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

A Reduced-Complexity Decoding Algorithm for Turbo Codes with Odd-Even Interleavers

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

3 Author(s)
Xiao Ma ; Dept. of Electron. & Commun. Eng., Sun Yat-sen Univ., Guangzhou ; Xiuni Wang ; Lin Zhang

In this paper, we propose a novel decoding schedule for turbo codes with odd-even interleavers. The proposed schedule has lower complexity and the same performance as the standard one

Published in:

Information Theory Workshop, 2006. ITW '06 Chengdu. IEEE

Date of Conference:

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