pith. sign in

arxiv: 1305.5625 · v2 · pith:P5UXFXBFnew · submitted 2013-05-24 · 💻 cs.IT · math.IT

Memory Efficient Decoders using Spatially Coupled Quasi-Cyclic LDPC Codes

classification 💻 cs.IT math.IT
keywords memoryparity-checkcodescoupleddecodersfpgalogicquasi-cyclic
0
0 comments X
read the original abstract

In this paper we propose the construction of Spatially Coupled Low-Density Parity-Check (SC-LDPC) codes using a periodic time-variant Quasi-Cyclic (QC) algorithm. The QC based approach is optimized to obtain memory efficiency in storing the parity-check matrix in the decoders. A hardware model of the parity-check storage units has been designed for Xilinx FPGA to compare the logic and memory requirements for various approaches. It is shown that the proposed QC SC-LDPC code (with optimization) can be stored with reasonable logic resources and without the need of block memory in the FPGA. In addition, a significant improvement in the processing speed is also achieved.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.