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

Pseudorandom construction of low-density parity-check codes using linear congruential sequences

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)
Prabhakar, A. ; Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA ; Narayanan, K.

We consider maximal-length linear congruential sequences generated using a simple recursion to generate the bipartite graph of a low-density parity-check (LDPC) code. The main advantage is that the graph structure of the codes (edge connections) can be generated using a recursion, rather than having to store the graph connections in memory, which facilitates hardware implementation of the decoder. For this class of codes, sufficient conditions on the recursion parameters are derived, such that regular LDPC codes can be constructed with no cycles of length four or less. Simulation results show that these codes provide almost the same performance of a constrained pseudorandom construction that explicitly avoids cycles of length less than or equal to four.

Published in:

Communications, IEEE Transactions on  (Volume:50 ,  Issue: 9 )

Date of Publication:

Sep 2002

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.