Construction of Quasi-Cyclic Low-Density Parity-Check Codes for Simplifying Shuffle Networks in Layered Decoder

Offset Shuffle Networks （OSNs） int- erleave a-posterior probability messages in the Block Row-Layered Decoder （BRLD） of Quasi- Cyclic Low-Density Parity-Check （QC-LDPC） codes. However, OSNs usually consume a sig- nificant amount of computational resources and limit the clock frequency, particularly...

Full description

Saved in:
Bibliographic Details
Published inChina communications Vol. 10; no. 12; pp. 102 - 113
Main Authors Jianjun, Zhang, Mingke, Dong, Da, Wang, Ye, Jin, Haige, Xiang
Format Journal Article
LanguageEnglish
Published China Institute of Communications 01.12.2013
Subjects
Complexity theory
construction algorithm
Decoding
DVB-S2
Interleaved codes
LDPC码
Multiplexing
Parity check codes
PEG algorithm
QC-LDPC codes
row-layered decoder
shuffle network
Switches
WiMAX
Wires
低密度奇偶校验码
循环
时钟频率
解码器
随机网络
Online AccessGet full text

Cover

More Information
Summary:Offset Shuffle Networks （OSNs） int- erleave a-posterior probability messages in the Block Row-Layered Decoder （BRLD） of Quasi- Cyclic Low-Density Parity-Check （QC-LDPC） codes. However, OSNs usually consume a sig- nificant amount of computational resources and limit the clock frequency, particularly when the size of the Circulant Permutation Matrix （CPM） is large. To simplify the architecture of the OSN, we propose a Simplified Offset Shuffle Net- work Block Progressive Edge-Growth （SOSN- BPEG） algorithm to construct a class of QC- LDPC codes. The SOSN-BPEG algorithm con- strains the shift values of CPMs and the differ- ence of the shift values in the same column by progressively appending check nodes. Simula- tion results indicate that the error performance of the SOSN-BPEG codes is the same as that of the codes in WiMAX and DVB-S2. The SOSN- BPEG codes can reduce the complexity of the OSNs by up to 54.3%, and can improve the maximum frequency by up to 21.7% for vari- ous code lengths and rates.
Bibliography:Offset Shuffle Networks （OSNs） int- erleave a-posterior probability messages in the Block Row-Layered Decoder （BRLD） of Quasi- Cyclic Low-Density Parity-Check （QC-LDPC） codes. However, OSNs usually consume a sig- nificant amount of computational resources and limit the clock frequency, particularly when the size of the Circulant Permutation Matrix （CPM） is large. To simplify the architecture of the OSN, we propose a Simplified Offset Shuffle Net- work Block Progressive Edge-Growth （SOSN- BPEG） algorithm to construct a class of QC- LDPC codes. The SOSN-BPEG algorithm con- strains the shift values of CPMs and the differ- ence of the shift values in the same column by progressively appending check nodes. Simula- tion results indicate that the error performance of the SOSN-BPEG codes is the same as that of the codes in WiMAX and DVB-S2. The SOSN- BPEG codes can reduce the complexity of the OSNs by up to 54.3%, and can improve the maximum frequency by up to 21.7% for vari- ous code lengths and rates.
QC-LDPC codes; construction alg-orithm; PEG algorithm; row-layered decoder;shuffle network
11-5439/TN
ISSN:1673-5447
DOI:10.1109/CC.2013.6723883