By Topic

Construction and performance of q-ary turbo codes for use with M-ary modulation techniques

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)
White, G.S. ; Raytheon Co., USA ; Costello, D.J., Jr.

This paper describes a construction technique for q-ary turbo codes that computes good recursive systematic convolutional q-ary constituent codes with constraint length v/spl les/5 for q=2/sup m/, m=2, 3, and 4. The construction technique, based on the algorithm of Benedetto, Garello and Montorsi (see IEEE Trans. Commun., vol.46, p.1101-1105, 1998), determines the codes with maximum d/sub i/ for i=2, 3, and 4 and minimum codeword multiplicity, where d/sub i/ is the minimum weight of all code sequences with input weight i. Due to the large number of encoder states involved, standard weight distribution calculations are difficult. The construction algorithm employed is a computer search that generates all possible terminating sequences of weight 2, 3, and 4 to use as inputs to the set of allowable encoders.

Published in:

Information Theory, 2000. Proceedings. IEEE International Symposium on

Date of Conference:

25-30 June 2000