URI | http://purl.tuc.gr/dl/dias/09D9E7D7-87E2-4661-A6FE-6963C6BB6335 | - |
Identifier | https://doi.org/10.1109/TCOMM.2012.010913.120448 | - |
Language | en | - |
Extent | 7 | en |
Title | Maximum-likelihood noncoherent PAM detection | en |
Creator | Papailiopoulos D.S | en |
Creator | Elkheir G.A | en |
Creator | Karystinos Georgios | en |
Creator | Καρυστινος Γεωργιος | el |
Publisher | Institute of Electrical and Electronics Engineers | en |
Description | Δημοσίευση σε επιστημονικό περιοδικό | el |
Content Summary | Sequence detection offers improved error-rate performance over conventional symbol-by-symbol detection when channel knowledge is not available at the receiver end. However, maximum-likelihood (ML) noncoherent sequence detection is proven to be notoriously intractable in many communication settings. In this work, we develop a new ML sequence detector for pulse-amplitude modulation (PAM) or quadrature-amplitude modulation (QAM) transmissions in unknown Rayleigh fading. Our detector identifies the ML sequence with overall polynomial complexity. This is possible via an auxiliary-angle approach that unlocks a low-rank property of the ML detection problem, reduces the exponential-size set of solution sequences to a polynomial-size set of candidates, and guarantees that the ML sequence is always contained in this substantially smaller set. | en |
Type of Item | Peer-Reviewed Journal Publication | en |
Type of Item | Δημοσίευση σε Περιοδικό με Κριτές | el |
License | http://creativecommons.org/licenses/by/4.0/ | en |
Date of Item | 2015-10-23 | - |
Date of Publication | 2013 | - |
Subject | Fading channels | en |
Subject | lattice decoding | en |
Subject | maximum likelihood decoding | en |
Subject | noncoherent detection | en |
Subject | sequence detection | en |
Subject | wireless communications | en |
Bibliographic Citation | D. S. Papailiopoulos, G. Abou Elkheir, and G. N. Karystinos,"Maximum-likelihood noncoherent PAM detection," IEEE Transactions on Communications, vol. 61, no. 3, pp. 1152 - 1159, Mar. 2013. doi: 10.1109/TCOMM.2012.010913.120448 | en |