By Topic

Orthogonal Tree Codes for Communication in the Presence of White Gaussian Noise

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

1 Author(s)
A. Viterbi ; Univ of Calif., Los Angeles, CA

This paper describes a convolutional encoder for generating tree codes whose distinct codewords are orthogonal over the constraint length of the code. The performance of this class of codes is analyzed and the error probability is shown to decrease exponentially with the energy-to-noise ratio over the constraint length period of the code. The performance is compared with wellknown results for orthogonal block codes and shown to be considerably superior to the latter. Asymptotic results are also obtained which coincide with results for the class of very noisy memoryless channels.

Published in:

IEEE Transactions on Communication Technology  (Volume:15 ,  Issue: 2 )