Scalable High HUE LDPC Decoder Architecture Design
Date Issued
2005
Date
2005
Author(s)
Chien, Yi-hsing
DOI
en-US
Abstract
Low-density parity check (LDPC) codes have been shown that it is a strong competitor of Turbo codes. LDPC codes offer excellent coding gain and provide elegant low computation complexity when comparing with Turbo codes. The complex routing nature of LDPC decoder and low hardware utilization efficiency are the major implementation challenges.
In this thesis we design an elitist scheduling algorithm called “Jump-Reset Scheduling Algorithm” to boost hardware utilization efficiency (HUE) of low-density parity check (LDPC) decoder. This algorithm supports a scalable pipeline decoding architecture. The architecture is a semi-parallel decoder with a scalability factor. It offers flexible tradeoff between hardware cost and throughput. A high HUE and scalable decoding architecture is implemented. This architecture is decoding algorithm independent from decoding algorithm. Sum-product algorithm and min-sum algorithm can be applied to this architecture. We use a modified min-sum algorithm as decoding algorithm in this decoder. This algorithm only contains additions and comparisons. There are no large LUTs for non-linear function in bit-to-check functional units. The modified min-sum algorithm can improve BER performance extremely close to sum-product algorithm. Word length effect on BER performance is analyzed. This thesis presents a scalable pipelined architecture with single size of memory and extremely high hardware utilization efficiency. This architecture can offer double throughput of traditional architecture without increasing memory requirement.
Subjects
錯誤更正碼
低密度奇偶校驗編碼
遞迴解碼
編碼增益
Low-density Parity Check
LDPC
Iterative Decoding
Channel Coding
Sum-product Algorithm
SPA
Min-sum algorithm
MSA
Scaling min-sum algorithm
SMSA
Coding Gain
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-94-R92922049-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):bd46e00831b3030a4c160c9f55bfdf63