By Topic

Low complexity encoding of regular low density parity check codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Su-Chang Chae ; Mobile Telecomm. Lab., Electron. & Telecommun. Res. Inst., Daejeon, South Korea ; Yun-Ok Park

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.

Published in:

Vehicular Technology Conference, 2003. VTC 2003-Fall. 2003 IEEE 58th  (Volume:3 )

Date of Conference:

6-9 Oct. 2003