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

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.