By Topic

Orthogonal and Quasi-Orthogonal Tree Codes with Applications to Multiple Access

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)
D. Raychaudhuri ; State Univ of New York, Stony Brook, NY ; S. Rappaport

The performance of orthogonal and quasi-orthogonal tree codes is considered for incoherent and coherent systems. In addition, several alternative receiver structures using hard quantizing and "greatest-of" detection are treated. Upper bounds on error probability are derived and are used as a basis for system comparison. An application of quasi-orthogonal tree codes to a multiple access environment is presented as an example and discussed.

Published in:

IEEE Transactions on Communications  (Volume:27 ,  Issue: 2 )