Paper Info
Title
A Class of Generalized Quasi-Cyclic LDPC Codes: High-Rate and Low-Complexity Encoder for Data Storage Devices
Abstract
In this paper, we study no 4-cycle, high-rate LDPC codes based on finite geometries for use in data storage devices and prove that these codes cannot be classified as quasi-cyclic (QC) codes but should be considered as broader generalized quasi-cyclic (GQC) codes. Because of the GQC structure of such codes, they can be systematically encoded using Grobner bases and their encoder can be implemented using simple feedback-shift registers. In order to demonstrate the efficiency of the encoder, we show that the hardware complexity of the serial-in serial-out encoder architecture of these codes is of linear order O(n). To encode a binary codeword of length n, less than 2n adders and 3n memory elements are required. Furthermore, we evaluated the error performances of these codes with sum product algorithm (SPA) decoding over additive white Gaussian noise (AWGN) channels. At a bit error rate (BER) of 10(-5), they perform 1-dB away from the Shannon limit after 10 decoding iterations.
Year
DOI
Venue
2010
10.1109/GLOCOM.2010.5683369
IEEE Global Telecommunications Conference (Globecom)
Keywords
Field
DocType
generalized quasi-cyclic (GQC) codes,finite geometry low-density parity-check (LDPC) codes,circulant matrix,serial-in serial-out systematic encoder
Discrete mathematics,BCJR algorithm,Concatenated error correction code,Computer science,Low-density parity-check code,Block code,Serial concatenated convolutional codes,Turbo code,Algorithm,Real-time computing,Linear code,Tornado code
Conference
ISSN
Citations 
PageRank 
1930-529X
2
0.39
References 
Authors
11
3
Name
Order
Citations
PageRank
Vo Tam Van1182.65
Hajime Matsui2188.14
Seiichi Mita331638.88