Reduced-complexity decoding implementation of QC-LDPC codes with modified shuffling
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 architectur...
Main Authors: | Alireza Hasani, Lukasz Lopacinski, Rolf Kraemer |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2021-10-01
|
Series: | EURASIP Journal on Wireless Communications and Networking |
Subjects: | |
Online Access: | https://doi.org/10.1186/s13638-021-02056-5 |
Similar Items
-
High-Throughput Multi-Frame Decoding of QC-LDPC Codes With Modified Rejection-Based Minimum Finding
by: Alireza Hasani, et al.
Published: (2022-01-01) -
Design of Mutual-Information-Maximizing Quantized Shuffled Min-Sum Decoder for Rate-Compatible Quasi-Cyclic LDPC Codes
by: Peng Kang, et al.
Published: (2022-10-01) -
Memory Compact High-Speed QC-LDPC Decoder Based on FPGA
Published: (2019-06-01) -
Derived dynamic scheduling for belief propagation decoding of LDPC codes
by: Xiaotian Xu, et al.
Published: (2024-02-01) -
Low-Complexity High-Throughput QC-LDPC Decoder for 5G New Radio Wireless Communication
by: Tram Thi Bao Nguyen, et al.
Published: (2021-02-01)