Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Rate-adaptive codes for distributed source coding
Signal Processing - Special section: Distributed source coding
EURASIP Journal on Applied Signal Processing
Differentially encoded LDPC codes-part II: general case and code optimization
EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
Differentially encoded LDPC codes-part I: special case of product accumulate codes
EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
Design of High-Rate Serially Concatenated Codes with Low Error Floor
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Low-density parity-check codes with 2-state trellis decoding
IEEE Transactions on Communications
Spectra and minimum distances of repeat multiple-accumulate codes
IEEE Transactions on Information Theory
Improving the distance properties of turbo codes using a third component code: 3D turbo codes
IEEE Transactions on Communications
Accumulate codes based on 1+D convolutional outer codes
IEEE Transactions on Communications
Serially concatenated turbo codes
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Bandwidth-efficient modulation codes based on nonbinary irregular repeat-accumulate codes
IEEE Transactions on Information Theory
Hi-index | 754.96 |
We propose a novel class of provably good codes which are a serial concatenation of a single-parity-check (SPC)-based product code, an interleaver, and a rate-1 recursive convolutional code. The proposed codes, termed product accumulate (PA) codes, are linear time encodable and linear time decodable. We show that the product code by itself does not have a positive threshold, but a PA code can provide arbitrarily low bit-error rate (BER) under both maximum-likelihood (ML) decoding and iterative decoding. Two message-passing decoding algorithms are proposed and it is shown that a particular update schedule for these message-passing algorithms is equivalent to conventional turbo decoding of the serial concatenated code, but with significantly lower complexity. Tight upper bounds on the ML performance using Divsalar's (1999) simple bound and thresholds under density evolution (DE) show that these codes are capable of performance within a few tenths of a decibel away from the Shannon limit. Simulation results confirm these claims and show that these codes provide performance similar to turbo codes but with significantly less decoding complexity and with a lower error floor. Hence, we propose PA codes as a class of prospective codes with good performance, low decoding complexity, regular structure, and flexible rate adaptivity for all rates above 1/2.