Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/98B935A1-77F9-434B-BCAF-B133C81B9013 | - |
| Αναγνωριστικό | https://doi.org/10.1109/ICC.2012.6364631 | - |
| Γλώσσα | en | - |
| Μέγεθος | 4 | en |
| Τίτλος | Maximum-likelihood blind PAM detection | en |
| Δημιουργός | Papailiopoulos Dimitrios | en |
| Δημιουργός | Abou Elkheir G | en |
| Δημιουργός | Karystinos Georgios | en |
| Δημιουργός | Καρυστινος Γεωργιος | el |
| Εκδότης | Institute of Electrical and Electronics Engineers | en |
| Περίληψη | Blind sequence detection offers significant gains over conventional symbol-by-symbol detection when channel knowledge is not available at the receiver. However, maximum-likelihood (ML) blind sequence detection is often intractable due to exponential complexity in the sequence length. In this work, we develop a polynomial-time ML blind sequence detector for pulse-amplitude modulation (PAM) transmissions in Rayleigh fading. Our detector follows an auxiliary-angle approach that reduces the exponential-size space of solution vectors to a polynomial-size set of candidate sequences; we prove that this significantly smaller set always contains the ML PAM sequence. Hence, with overall polynomial complexity the proposed detector solves the problem of identifying the ML PAM sequence in unknown Rayleigh fading. | en |
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | el |
| Τύπος | Conference Full Paper | en |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by-nc-nd/4.0/ | en |
| Ημερομηνία | 2015-11-10 | - |
| Ημερομηνία Δημοσίευσης | 2012 | - |
| Βιβλιογραφική Αναφορά | D. S. Papailiopoulos, G. Abou Elkheir, and G. N. Karystinos, “Maximum-likelihood blind PAM detection,” in Proc. IEEE - International Conference on Communications,(ICC '12) pp. 2283-2287, doi: 10.1109/ICC.2012.6364631 | en |
Copyright © DIAS 2013
