Flexible low-complexity decoding architecture for QC-LDPC codes

A novel flexible decoding architecture for quasi-cyclic (QC) low-density parity-check (LDPC) code is proposed in this paper to reduce decoding complexity. The novelty of this architecture lies in a new time-sharing scheme of processing units, which provides low complexity and flexible serial factor...

Full description

Saved in:
Bibliographic Details
Main Authors: Nan Jiang, Kewu Peng, Zhixing Yang
Format: Conference Proceeding
Language:English
Subjects:
Communication standards
Computer architecture
Digital communication
Hardware
Iterative decoding
Laboratories
Parity check codes
Throughput
Time sharing computer systems
TV broadcasting
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A novel flexible decoding architecture for quasi-cyclic (QC) low-density parity-check (LDPC) code is proposed in this paper to reduce decoding complexity. The novelty of this architecture lies in a new time-sharing scheme of processing units, which provides low complexity and flexible serial factor of decoding hardware. Without loss of coding performance, the architecture requires significantly less processing units compared with known semi-parallel decoders at the expense of throughput decrease, while keeping memory requirement unchanged. As demonstrated by hardware and software implementation results, the proposed architecture is advisable and competent for wireless mobile systems and portable devices.
DOI:10.1109/ICCS.2008.4737396