By Topic

Good low-rate convolutional codes using integer linear programming

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
$33 $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)

Code-spreading using low-rate convolutional codes has been proved to have good performance. This broaches the issue of how to construct good low-rate codes. In this paper we come up with a novel method to construct arbitrarily low rate convolutional codes for various constraint length K. The proposed method in this paper outperforms some previous work in three ways. First, it does not have to iteratively search from a starting code. Then the results demonstrate that the number of generators used for each specific code rate is much smaller, to avoid synchronization trouble. Finally, paths to achieve maximum free distances are in a rather small scale as well, giving birth to a good distance spectrum in the first element

Published in:

IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006.  (Volume:3 )

Date of Conference:

3-6 April 2006