Cart (Loading....) | Create Account
Close category search window
 

Efficient Encoder Design of the Q-LDPC 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
$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)
Li Peng ; Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Wuhan ; Guangxi Zhu

This paper have developed farther the method of constructing sparse parity-check matrix (H-matrix) with determinate systemic structure as well as designing practice recursive encoding algorithm of the low-density parity-check (LDPC) codes. It discovers that the LDPC codes based on the circulant-shifted permutation Q-matrix created by N-queens searching algorithm perform better than them based on permutation identity matrix when Hd -matrix in H =[ Hp Hd] was constructed by using circulant-shifted permutation Q-matrix and identity matrix, respectively. It presents a simple and efficient algorithm of constructing Hd matrix without 4-cycle and 6-cycle. The presented LDPC encoders require O(M) operation (M is check-bit size). They are rate-compatible and length- compatible encoders that can cover a very wide range of rate from 0.1 to 0.9 and length including any positive integer from 20 to infinity except prime number and multiple prime numbers. The presented LDPC codes with moderate length and 1/2 rate can achieve reliable performance - 10-5~10-6 bit error rate (BER) - on an additive white Gaussian noise (AWGN) channel with signal-to-noise ratio (SNR) Eb/No about 1.42 dB1.

Published in:

Circuits and Systems for Communications, 2008. ICCSC 2008. 4th IEEE International Conference on

Date of Conference:

26-28 May 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.