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

Design of turbo decoder based on Min-Sum decoding algorithm of LDPC code

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)
Pengjun Wang ; Inst. of Circuits & Syst., Ningbo Univ., Ningbo, China ; Fanglong Yi

Turbo code has been used by multiple communication standards due to its performance near Shannon limit. However, its decoding algorithm is complicated. Through the research on Turbo code, a novel design of Turbo decoder is presented in this paper. Turbo code is decoded by the Min-Sum decoding algorithm of LDPC code, which is a low complicated decoding algorithm. Moreover, messages are stored compressively, and the check-to-variable messages and the variable-to-check messages are stored alternately. This design reduced the required memory significantly. Finally, the decoder is simulated by ModelSim SE6.0 and the simulation results show that the decoder has high decoding speed.

Published in:

Circuits and Systems (APCCAS), 2010 IEEE Asia Pacific Conference on

Date of Conference:

6-9 Dec. 2010

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.