An area-efficient multirate low-density parity-check convolutional code (LDPC-CC) decoder is presented in this brief. Using the layered decoding algorithm, the decoder achieves a better performance than the message-pa...
详细信息
An area-efficient multirate low-density parity-check convolutional code (LDPC-CC) decoder is presented in this brief. Using the layered decoding algorithm, the decoder achieves a better performance than the message-passing algorithm;the extrinsic-message storing is switched from variable node based to check node based. Then, using the normalized min-sum (NMS) algorithm, the extrinsic messages can be reduced to the first and second minimum absolute values, the position index of the first minimum absolute value, the signs of all extrinsic messages, and the product of all the signs. A memory-based application-specific integrated circuit architecture of the LDPC-CC decoder that supports these methods is proposed for the IEEE 1901 standard. Based on a SMIC 130-nm complementary metal-oxide-semiconductor process, a decoder that can support all the code rates of the LDPC-CCs defined in IEEE 1901 (1/2, 2/3, 3/4, 4/5) is fabricated and evaluated. The proposed decoder attains a maximum throughput of 300 Mb/s at a maximum operating frequency of 180 MHz. The core area is 3.55 mm(2) with ten processors. The average power consumption is 200.4 mW at code rate 4/5 and a frequency of 180 MHz, and the power efficiency is 66.8 pJ/bit/proc. The very large scale integration results show that the decoder is both memory and area efficient.
Quasi-cyclic low-density parity-check (QC-LDPC) codes are linear block codes with performance close to the Shannon limit. The layered minimum sum (LMS) decodingalgorithm speeds up the decoding convergence by layering...
详细信息
ISBN:
(纸本)9781450396899
Quasi-cyclic low-density parity-check (QC-LDPC) codes are linear block codes with performance close to the Shannon limit. The layered minimum sum (LMS) decodingalgorithm speeds up the decoding convergence by layering the check matrix and updating the nodes according to the layers. However, the MS algorithm has the problem of over estimation and affects the decoding performance due to its simplified strategy of MS algorithm updating the message of check nodes. Therefore, this paper proposes a layered minimum sum decodingalgorithm based on overestimation. By setting the correction threshold and updating the check nodes by the conditions, the decoding performance is improved. When the code length is 2048 and the bit error rate is , the proposed algorithm can improve the decoding convergence speed by about 25% and obtain a coding gain of about 0.1 dB.
Low-Density Parity-Check code is a kind of near-optimal error correction code. In order to improve the performance of layered decoding algorithms, two algorithms are put forward in this paper. In the first algorithm, ...
详细信息
ISBN:
(纸本)9781538624104
Low-Density Parity-Check code is a kind of near-optimal error correction code. In order to improve the performance of layered decoding algorithms, two algorithms are put forward in this paper. In the first algorithm, additional messages are employed for the messages updating operation of each layer by using another layered part, making it possible to accelerate the speed of convergence. In the second one, a correction operation for certain type of errors is performed to improve the decoding performance. Simulation results show that more decoding gain and accelerated convergence can be obtained compared with the conventional layered decoding algorithms.
Abstract： The layered decoding algorithm has been widely used in the implementation of Low Density Parity Check （LDPC） decoders, due to its high convergence speed. However, the pipeline operation of the layered dec...
详细信息
Abstract： The layered decoding algorithm has been widely used in the implementation of Low Density Parity Check （LDPC） decoders, due to its high convergence speed. However, the pipeline operation of the layered decoder may introduce memory access conflicts, which heavily deteriorates the decoder throughput. To essentially deal with the issue of memory access conflicts,
Low-Density Parity-Check code is a kind of near-optimal error correction code. In order to improve the performance of layered decoding algorithms, two algorithms are put forward in this paper. In the first algorithm, ...
详细信息
ISBN:
(纸本)9781538624111
Low-Density Parity-Check code is a kind of near-optimal error correction code. In order to improve the performance of layered decoding algorithms, two algorithms are put forward in this paper. In the first algorithm, additional messages are employed for the messages updating operation of each layer by using another layered part, making it possible to accelerate the speed of convergence. In the second one, a correction operation for certain type of errors is performed to improve the decoding performance. Simulation results show that more decoding gain and accelerated convergence can be obtained compared with the conventional layered decoding algorithms.
暂无评论