Reduced-complexity decoding implementation of QC-LDPC codes with modified shuffling
Authors:
Open Access
- 9 October 2021
- journal article
- research article
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2021 (1) , 1-14
Abstract
Layered decoding (LD) facilitates a partially parallel architecture for performing belief propagation (BP) algorithm for decoding low-density parity-check (LDPC) codes. Such a schedule for LDPC codes has, in general, reduced implementation complexity compared to a fully parallel architecture and higher convergence rate compared to both serial and parallel architectures, regardless of the codeword length or code-rate. In this paper, we introduce a modified shuffling method which shuffles the rows of the parity-check matrix (PCM) of a quasi-cyclic LDPC (QC-LDPC) code, yielding a PCM in which each layer can be produced by the circulation of its above layer one symbol to the right. The proposed shuffling scheme additionally guarantees the columns of a layer of the shuffled PCM to be either zero weight or single weight. This condition has a key role in further decreasing LD complexity. We show that due to these two properties, the number of occupied look-up tables (LUTs) on a field programmable gate array (FPGA) reduces by about 93% and consumed on-chip power by nearly 80%, while the bit error rate (BER) performance is maintained. The only drawback of the shuffling is the degradation of decoding throughput, which is negligible for low values of $$E_b/N_0$$ until the BER of 1e−6.
Keywords
Funding Information
- Deutsche Forschungsgemeinschaft (442607813)
- IHP GmbH – Leibniz-Institut für innovative Mikroelektronik
This publication has 36 references indexed in Scilit:
- Performance of Turbo Coded OFDM Under the Presence of Various Noise TypesWireless Personal Communications, 2015
- A Fully-Parallel Turbo Decoding AlgorithmIEEE Transactions on Communications, 2015
- Efficient hardware implementation of a highly-parallel 3GPP LTE/LTE-advance turbo decoderIntegration, 2011
- A 640-Mb/s 2048-Bit Programmable LDPC Decoder ChipIEEE Journal of Solid-State Circuits, 2006
- Shuffled Iterative DecodingIEEE Transactions on Communications, 2005
- Memory-Efficient Sum–Product Decoding of LDPC CodesIEEE Transactions on Communications, 2004
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation MatricesIEEE Transactions on Information Theory, 2004
- Blind Multiuser Detection in Uplink CDMA With Multipath Fading: A Sequential EM ApproachIEEE Transactions on Communications, 2004
- Near optimum universal belief propagation based decoding of low-density parity check codesIEEE Transactions on Communications, 2002
- Iterative decoding of compound codes by probability propagation in graphical modelsIEEE Journal on Selected Areas in Communications, 1998