By Topic

Performance analysis of implement-oriented capacity-achieving LDPC codes on erasure channel and its encoder design

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

3 Author(s)
Li Peng ; Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Guangxi Zhu ; Qi Luo

This paper is concerned with threshold performance analysis of implement-oriented low-density parity check (LDPC) ensemble on binary erasure channel and design of its H-matrix structure and encoder hardware architecture. We construct a class of the special LDPC ensemble which has capacity-achieving degree distribution pair for infinity length code over the binary erasure channel (BEC). Its special characteristic different from the other LDPC ensembles is that the coefficient lambda1 of its degree distribution pair equal 1 instead of 0. Its H-matrix is constructed by combining zigzag matrix and partitioned permutation matrices. This paper completed a design from capacity-achieving sequence to algebraic structural H-matrix, and the H-matrix can directly be used to design low complexity recursive encoding circuit.

Published in:

Global Mobile Congress 2009

Date of Conference:

12-14 Oct. 2009