Close category search window
 

Adaptive offset min-sum algorithm for low-density parity check 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

4 Author(s)
Ming Jiang ; Nat. Mobile Commun. Res. Lab., Southeast Univ., Nanjing ; Chunming Zhao ; Li Zhang ; Enyang Xu

An improvement is presented to the offset min-sum decoding algorithm for low-density parity check codes. The proposed algorithm introduces a more efficient adjustment for check-node update computation in view of different minimum values. According to the optimal correction factor of normalized min-sum algorithm, we can determine the adaptive offset item. The improved algorithm achieves a noticeable performance gain with only a modest increase in computation complexity

Published in:
Communications Letters, IEEE  (Volume:10 ,  Issue: 6 )

Date of Publication: June 2006

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.