To the Theory of Low-Density Convolutional Codes. II
Problems of Information Transmission
On the Theory of Low-Density Convolutional Codes
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Decoding LDPC convolutional codes on Markov channels
EURASIP Journal on Wireless Communications and Networking
Efficient decoding of turbo codes with nonbinary belief propagation
EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
Error performances of multi shift-register convolutional self-doubly-orthogonal codes
IEEE Communications Letters
A compact 1.1-Gb/s encoder and a memory-based 600-Mb/s decoder for LDPC convolutional codes
IEEE Transactions on Circuits and Systems Part I: Regular Papers - Special issue on ISCAS2008
Pseudocodeword performance analysis for LDPC convolutional codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Robust initial LLRs for iterative decoders in presence of non-Gaussian noise
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Trapping set analysis of protograph-based LDPC convolutional codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Analysis of delay statistics for the queued-code
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Braided convolutional codes: a new class of turbo-like codes
IEEE Transactions on Information Theory
Efficient quantum stabilizer codes: LDPC and LDPC-convolutional constructions
IEEE Transactions on Information Theory
Distance bounds for periodically time-varying and tail-biting LDPC convolutional codes
IEEE Transactions on Information Theory
Iterative decoding threshold analysis for LDPC convolutional codes
IEEE Transactions on Information Theory
| Hi-index | 755.20 |
We present a class of convolutional codes defined by a low-density parity-check matrix and an iterative algorithm for decoding these codes. The performance of this decoding is close to the performance of turbo decoding. Our simulation shows that for the rate R=1/2 binary codes, the performance is substantially better than for ordinary convolutional codes with the same decoding complexity per information bit. As an example, we constructed convolutional codes with memory M=1025, 2049, and 4097 showing that we are about 1 dB from the capacity limit at a bit-error rate (BER) of 10-5 and a decoding complexity of the same magnitude as a Viterbi decoder for codes having memory M=10