By Topic

A class of (γργ-1γ,ρ,γ,{0,1}) combinatorially designed LDPC codes with application to ISI channels

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)
J. Li ; Dept. of Electr. & Comput. Eng., Lehigh Univ., Bethlehem, PA, USA ; E. Kurtas

A systematic construction of regular low density parity check (LDPC) codes based on (γργ-1γ,ρ,γ,{0,1}) combinatorial designs is investigated. From one particular view point, the proposed codes are "loosened" finite geometry codes where some lines are systematic removed. The loosened design rules offer at least two advantages: a lower decoding complexity and a richer code set. We show that the proposed codes contain a good combination of structure and pseudorandomness, where the former enables low-cost implementation in hardware and the latter ensures reasonable performance by avoiding certain recurrent error patterns (e.g. rectangular error patterns). One possible application for the proposed structured LDPC codes is the digital recording systems. Simulations show that with proper preceding, the proposed codes can perform as well as or slightly better than the random codes. Unlike random codes, the proposed structured LDPC codes can lend themselves to a low-complexity implementation for high-speed applications.

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003