DocumentCode
756398
Title
Orthogonal and Quasi-Orthogonal Tree Codes with Applications to Multiple Access
Author
Raychaudhuri, Dipankar ; Rappaport, Stephen S.
Author_Institution
State Univ of New York, Stony Brook, NY
Volume
27
Issue
2
fYear
1979
fDate
2/1/1979 12:00:00 AM
Firstpage
449
Lastpage
460
Abstract
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.
Keywords
Multiple-access communications; Tree codes; Algorithm design and analysis; Bandwidth; Communications Society; Convolution; Convolutional codes; Decoding; Error probability; Gaussian noise; Signal generators; Upper bound;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOM.1979.1094384
Filename
1094384
Link To Document