Open AccessLow‐Complexity Multi‐size Cyclic‐Shifter for QC‐LDPC Codes
Author(s) -
Kang HyeongJu,
Yang ByungDo
Publication year - 2017
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.17.0116.0341
Subject(s) - low density parity check code , reduction (mathematics) , decoding methods , algorithm , computer science , code (set theory) , mathematics , geometry , set (abstract data type) , programming language
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.