Low complexity encoding of regular low density parity check codes

We consider in this paper the encoding problem for low-density parity-check (LDPC) code. We investigate an efficient encoding approach for LDPC code. The straightforward the existing encoding scheme for LDPC code usually incurs too high complexity and should be changed to encoding scheme with low co...

Full description

Saved in:
Bibliographic Details
Main Authors: Su-Chang Chae, Yun-Ok Park
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Encoding
Field programmable gate arrays
Hardware
Iterative algorithms
Iterative decoding
Mobile communication
Parity check codes
Sparse matrices
Very large scale integration
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider in this paper the encoding problem for low-density parity-check (LDPC) code. We investigate an efficient encoding approach for LDPC code. The straightforward the existing encoding scheme for LDPC code usually incurs too high complexity and should be changed to encoding scheme with low complexity. However, little consideration has been given to the LDPC encoder VLSI implementation. We consider low complexity encoding of regular LDPC code, and we propose a pivoting and bit-reverse (PABR) algorithm to rapidly construct parity-check matrix for regular LDPC code. The code have sparse parity-check matrix. They are designed to perform well when iteratively decoded with the sum-product decoding algorithm and to allow low complexity encoding. Performance is superior to that of cyclic regular LDPC code can be achieved. We show approach to implementing LDPC encoder using PABR algorithm. This paper then describes FPGA implementation of regular LDPC encoder on hardware platform for 4th mobile communication system.
ISSN:1090-3038
2577-2465
DOI:10.1109/VETECF.2003.1285340