Referenced Items are not available for this document.
This paper presents a algebraic method for constructing LDPC codes. It uses a parity-check matrix of a short LDPC code with given degree distribution as mother matrix, upon which a long LDPC code is constructed by circulant permutation matrices. The number of cycles of given length in the Tanner graph of constructed codes is equal to or less than that of the short codes. Simulation results show that the error floor of constructed LDPC codes can be suppressed to a very low level.
Published in:
Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on
Date of Conference: 21-25 Sept. 2007
- Page(s):
- 838 - 841
- Print ISBN:
- 978-1-4244-1311-9
- INSPEC Accession Number:
- 10046315
- Conference Location :
- Shanghai
- Digital Object Identifier :
- 10.1109/WICOM.2007.216
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
