On a Family of Circulant Matrices for Quasi-Cyclic Low-Density Generator Matrix Codes
- 30 August 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 57 (9) , 6052-6067
Abstract
We present a new class of sparse and easily invertible circulant matrices that can have a sparse inverse though not being permutation matrices. Their study is useful in the design of quasi-cyclic low-density generator matrix codes that are able to join the inner structure of quasi-cyclic codes with sparse generator matrices, so limiting the number of elementary operations needed for encoding. Circulant matrices of the proposed class permit to hit both targets without resorting to identity or permutation matrices that may penalize the code minimum distance and often cause significant error floors.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Finite-Precision Analysis of Demappers and Decoders for LDPC-Coded M-QAM SystemsIEEE Transactions on Broadcasting, 2009
- Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded ComplexityIEEE Transactions on Information Theory, 2007
- Arbitrary Bit Generation and Correction Technique for Encoding QC-LDPC Codes with Dual-Diagonal Parity Structure2007
- Block-LDPC Codes vs Duo-Binary Turbo-Codes for European Next Generation Wireless Systems2006
- Concatenated LDGM codes with single decoderIEEE Communications Letters, 2006
- Efficient encoding of quasi-cyclic low-density parity-check codesIEEE Transactions on Communications, 2006
- Asymptotic weight distributions of irregular repeat-accumulate codes2005
- Accumulate repeat accumulate codes2004
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation MatricesIEEE Transactions on Information Theory, 2004
- A low-density generator matrix interpretation of parallel concatenated single bit parity codesIEEE Transactions on Magnetics, 2001