Institutional Repository
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Polynomial-complexity maximum-likelihood block noncoherent MPSKdetection

Papailiopoulos Dimitrios S., Karystinos Georgios

Full record


URI: http://purl.tuc.gr/dl/dias/13F4DAF3-8D66-4BF5-9990-D1599D59F541
Year 2008
Type of Item Conference Full Paper
License
Details
Bibliographic Citation D. S. Papailiopoulos and G. N. Karystinos, “Polynomial-complexity maximum-likelihood block noncoherent MPSK detection,” in Proc. IEEE - Intern. Conf. Acoust., Speech and Signal Proc.,(ICASSP '08) , pp. 2681-2684 , doi: 10.1109/ICASSP.2008.4518201 https://doi.org/10.1109/ICASSP.2008.4518201
Appears in Collections

Summary

In wireless channels, maximum-likelihood (ML) block noncoherent detection offers significant gains over conventional symbol- by-symbol detection when the fading channel coefficients are not available and cannot be estimated at the receiver. Certainly, in general the complexity of the block detector grows exponentially with the symbol sequence length. However, it has been recently shown that for M-ary phase-shift keying (MPSK) modulation block noncoherent detection can be performed with polynomial complexity. In this work, we develop a new ML block noncoherent detector for MPSK transmission of arbitrary order and multiple-antenna reception. The proposed algorithm introduces auxiliary spherical variables and constructs with polynomial complexity a polynomial- size set which includes the ML data sequence. It is shown that the complexity of the proposed algorithm is polynomial in the sequence length and at least one order of magnitude lower than the complexity of computational-geometry based noncoherent detection algorithms that have been developed recently.

Services

Statistics