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

Low Complexity Progressive Edge-Growth Algorithm Based on Chinese Remainder Theorem

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

4 Author(s)

Progressive edge-growth (PEG) algorithm construction builds the Tanner graph for an LDPC code by establishing edges between the symbol nodes and the check nodes in an edge-by-edge manner and maximizing the local girth in a greedy fashion. This approach is simple but the computational complexity of the PEG algorithm scale as O(nm), where n is the number of symbol nodes and m is the number of check nodes. We deal with this problem by first construct a base LDPC code of length n1 with the PEG algorithm and then extend this LDPC code into an LDPC code of length n, where n ≥ n1, via the the chinese remainder theorem (CRT). This method increase the code length of an LDPC code generated with the PEG algorithm, without decreasing its girth. Due to the code length reducing in the PEG construction step, the computational complexity of the whole code construction process is reduced. Furthermore, the proposed algorithm have a potential advantage by storing a small parity-check matrix of a base code and extending it “on-the-fly” in hardware.

Published in:

Vehicular Technology Conference (VTC Fall), 2012 IEEE

Date of Conference:

3-6 Sept. 2012

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.