Serially Concatenated IRA Codes
Taikun Cheng, Krishnamoorthy Sivakumar, Benjamin J. Belzer

TL;DR
This paper proposes a serially concatenated IRA code architecture to mitigate the error floor problem in LDPC codes on AWGN channels, showing improved high-SNR performance at the cost of some low-SNR penalty.
Contribution
It introduces a novel serial concatenation of IRA codes with an interleaver designed to prevent error propagation, reducing the error floor in LDPC codes.
Findings
Achieves lower error floors at high SNRs with small blocklengths.
Experiments show a 2 dB SNR penalty at low to medium SNRs.
Larger blocklengths can reduce the SNR penalty.
Abstract
We address the error floor problem of low-density parity check (LDPC) codes on the binary-input additive white Gaussian noise (AWGN) channel, by constructing a serially concatenated code consisting of two systematic irregular repeat accumulate (IRA) component codes connected by an interleaver. The interleaver is designed to prevent stopping-set error events in one of the IRA codes from propagating into stopping set events of the other code. Simulations with two 128-bit rate 0.707 IRA component codes show that the proposed architecture achieves a much lower error floor at higher SNRs, compared to a 16384-bit rate 1/2 IRA code, but incurs an SNR penalty of about 2 dB at low to medium SNRs. Experiments indicate that the SNR penalty can be reduced at larger blocklengths.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Cellular Automata and Applications · DNA and Biological Computing
