Close category search window
 

On asymptotically optimum rate 1/n convolutional codes for a given constraint length

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)
Papadimitriou, P.D. ; Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA ; Georghiades, C.N.

The criterion used to find good convolutional codes has traditionally been the maximization of the free distance for a given constraint length and code rate. In this letter we approach convolutional code design from a different perspective. We assume no constraints in the rate of the code, and the only restriction is in the constraint length. That is, we assume we can utilize as much bandwidth as necessary but we are complexity-limited by the constraint length we can afford. The results are optimum codes for a given constraint length, which can find application, for example, in CDMA systems.

Published in:
Communications Letters, IEEE  (Volume:5 ,  Issue: 1 )

Date of Publication: Jan. 2001

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.