By Topic

A serial concatenated scheme for LDPC code to achieve better error correction performance

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
$31 $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)
Zhe Wang ; Nat. ASIC Res. Center, Southeast Univ., Nanjing, China ; Meng Zhang

Low Density Parity Check(LDPC) Codes is a class of approaching limits error correction codes which has gained widely application in communications. The excellent performance, however, is the result of a large number of repeatedly conducting iterative decoding algorithm, and is apt to be seriously affected by small girth in the parity check matrix. In this paper we present a novel serial concatenated scheme for LDPC codes which utilize much smaller generation matrix and the interleaver to reduce possibilities of girth, thus reducing the number of iterations in decoding. Simulation shows that the new codes have better performance while less requirement of iterations.

Published in:

Consumer Electronics, Communications and Networks (CECNet), 2012 2nd International Conference on

Date of Conference:

21-23 April 2012