IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Conference Publications > Information Sciences and Syst ... Help

The Generator and Parity-Check Matrices of Turbo Codes

Full Text Sign-In or Purchase

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)
Fan Jiang ; Dept. of Electr. Eng., Nebraska Univ., Lincoln, NE ; Psota, E. ; Perez, L.C.

Turbo codes are typically represented as parallel concatenated convolutional codes, but will be treated as serially concatenated codes in this paper. Treating turbo codes as serially concatenated codes makes possible the general description of their generator and parity-check matrices. Given the generator and parity-check matrices, turbo codes may be analyzed from a block and low-density parity-check code point of view.

Published in:
Information Sciences and Systems, 2006 40th Annual Conference on

Date of Conference: 22-24 March 2006

Page(s):
1451 - 1454
E-ISBN :
1-4244-0350-2
Print ISBN:
1-4244-0349-9
INSPEC Accession Number:
9528525
Conference Location :
Princeton, NJ
Digital Object Identifier :
10.1109/CISS.2006.286693
Product Type:
Conference Publications

IEEE Account

Purchase Details

Profile Information

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.