Time-varying periodic convolutional codes with low-density parity-check matrix
IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm
IEEE Transactions on Information Theory
Analysis of low-density parity-check codes for the Gilbert-Elliott channel
IEEE Transactions on Information Theory
On Designing Good LDPC Codes for Markov Channels
IEEE Transactions on Information Theory
Hi-index | 0.00 |
This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveals that our pipelined algorithm reduces the number of operations per time step compared to LDPC block codes, at the expense of increased memory and latency. This tradeoff is favorable for low-power applications.