Detection of M'ARY communication with truncated symbols

The detection peformance of optimum and nonoptimum, coherent and noncoherent receivers with truncated M-ary symbols is investigated. The exact performance equations are formulated for some cases, and these are compared with the union upper and lower bound solutions in order to establish the confidence in the union bound solutions for the specific receiver. Numerical results are presented for the case of 32-ary cyclic code-shift keying, with the number of chips truncated being a variable. It is found that a matched filter or correlation receiver can provide reliable detection of truncated M-ary symbols. The degree of tolerable truncation is found to be dependent on the overall system performance, although it is suggested that the use of truncated symbols in place of accepting symbol erasures can improve network throughput.