A Parallel-Layered Belief-Propagation Decoder for Non-layered LDPC Codes
نویسندگان
چکیده
In this paper, we proposed a Parallel-Layered Belief-Propagation (PLBP) algorithm first, which makes a breakthrough in utilizing the layered decoding algorithm on the “non-layered” quasi-cyclic (QC) LDPC codes, whose column weights are higher than one within layers. Our proposed PLBP algorithm not only achieves a better error performance, but also requires almost 50% less iterations, compared with the original flooding algorithm. Then we propose a low-power partial parallel decoder architecture based on the PLBP algorithm. The PLBP decoder architecture requires less area and energy efficiency than other existing decoders. As a case study, a multi-rate 9216-bit LDPC decoder is implemented in SMIC 0.13 m 1P6M CMOS technology. The decoder dissipates an average power of 87mW with 10 iterations at a clock frequency of 83.3 MHz. The chip core size is 7.59 mm, and the die area occupies 10.82 mm.
منابع مشابه
Research on LDPC Decoder Design Methodology for Error-Correcting Performance and Energy-Efficiency
I-Abstract Low-Density Parity-Check (LDPC) codes, as linear block error-correcting codes (ECC), which were invented by Gallager in 1963 and rediscovered by MacKay in 1999, nowadays become a hot topic in a variety of application fields. Due to inherently paralleled decoding algorithm and near Shannon limit error-correcting performance, LDPC codes have been widely adopted in modern communication ...
متن کاملHigh-throughput partial-parallel block-layered decoding architecture for nonbinary LDPC codes
This paper presents a novel forward-backward four-way merger min-max algorithm and high-throughput decoder architecture for nonbinary low-density parity-check (NB-LDPC) decoding, which significantly reduces decoding latency. An efficient partial-parallel block-layered decoder architecture suitable for the proposed forward-backward four-way merger algorithm is presented to speed up the decoder c...
متن کاملReduced-complexity column-layered decoding and implementation for LDPC codes
Layered decoding is well appreciated in Low-Density Parity-Check (LDPC) decoder implementation since it can achieve effectively high decoding throughput with low computation complexity. This work, for the first time, addresses low complexity column-layered decoding schemes and VLSI architectures for multi-Gb/s applications. At first, the Min-Sum algorithm is incorporated into the column-layered...
متن کاملVLSI Design of a Fully-Parallel High-Throughput Decoder for Turbo Gallager Codes
The most powerful channel coding schemes, namely those based on turbo codes and low-density parity-check (LDPC) Gallager codes, have in common the principle of iterative decoding. However, the relative coding structures and decoding algorithms are substantially different. This paper presents a 2048-bit, rate-1/2 soft decision decoder for a new class of codes known as Turbo Gallager Codes. These...
متن کاملA Parallel Turbo Decoding Message Passing Architecture for Array LDPC Codes
The VLSI implementation complexity of a low density parity check (LDPC) decoder is largely influenced by interconnect and the storage requirements. Here, the proposed layout-aware layered decoder architecture utilizes the data–reuse properties of min-sum, layered decoding and structured properties of array LDPC codes. This results in a significant reduction of logic and interconnects requiremen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCM
دوره 5 شماره
صفحات -
تاریخ انتشار 2010