Title :
Theoretical analysis and performance limits of noncoherent sequence detection of coded PSK
Author :
Colavolpe, Giulio ; Raheli, Riccardo
Author_Institution :
Dipt. di Ingegneria dell´´Inf., Parma Univ., Italy
fDate :
7/1/2000 12:00:00 AM
Abstract :
A theoretical performance analysis of noncoherent sequence detection schemes previously proposed by the authors for combined detection and decoding of coded M-ary phase-shift keying (M-PSK) is presented. A method for the numerical evaluation of the pairwise error probability-for which no closed-form expressions exist-is described, the classical union bound is computed, and results are compared with computer simulations. An upper bound on this pairwise error probability is also presented. This upper bound may be effectively used for the definition of an equivalent distance, which may be useful in exhaustive searches for optimal codes. Using this bound, it is proven that, in the general coded case, the considered noncoherent decoding schemes perform as close as desired to an optimal coherent receiver when a phase memory parameter is sufficiently large. In the case of differentially encoded M-PSK, a simple expression of the asymptotic bit-error probability is derived, which is in agreement with simulations for high as well as low signal-to-noise ratio (SNR)
Keywords :
codes; error statistics; modulation coding; phase shift keying; signal detection; SNR; asymptotic bit-error probability; closed-form expressions; coded M-PSK; coded M-ary phase-shift keying; coded PSK; computer simulations; differentially encoded M-PSK; equivalent distance; exhaustive searches; noncoherent decoding; noncoherent sequence detection; optimal codes; optimal coherent receiver; pairwise error probability; performance analysis; performance limits; phase memory parameter; signal-to-noise ratio; simulations; union bound; upper bound; Closed-form solution; Computer errors; Computer simulation; Decoding; Pairwise error probability; Performance analysis; Phase detection; Phase shift keying; Signal to noise ratio; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on