Low-Complexity Multi-size Cyclic-Shifter for QC-LDPC Codes

The decoding process of a quasi-cyclic low-density parity check code requires a unique type of rotator. These rotators, called multi-size cyclic-shifters (MSCSs), rotate input data with various sizes, where the size is the amount of data to be rotated. This paper proposes a low-complexity MSCS struc...

Full description

Saved in:
Bibliographic Details
Published inETRI journal Vol. 39; no. 3; pp. 319 - 325
Main Authors Kang, Hyeong-Ju, Yang, Byung-Do
Format Journal Article
LanguageKorean
Published 2017
Subjects
Quasi-cyclic LDPC
Rotator
Benes network
Low-density parity-check code
Multi-size cyclic-shifter
Online AccessGet full text

Cover

More Information
Summary:The decoding process of a quasi-cyclic low-density parity check code requires a unique type of rotator. These rotators, called multi-size cyclic-shifters (MSCSs), rotate input data with various sizes, where the size is the amount of data to be rotated. This paper proposes a low-complexity MSCS structure for the case when the sizes have a nontrivial common divisor. By combining the strong points of two previous structures, the proposed structure achieves the smallest area. The experimental results show that the area reduction was more than 14.7% when the proposed structure was applied to IEEE 802.16e as an example.
Bibliography:KISTI1.1003/JNL.JAKO201761948860218
ISSN:1225-6463
2233-7326