Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/68E6AF31-1D0C-4F99-BC05-38A9DCED3508 | - |
| Αναγνωριστικό | https://doi.org/10.1109/TWC.2010.06.081715 | - |
| Γλώσσα | en | - |
| Μέγεθος | 10 | en |
| Τίτλος | Maximum-likelihood noncoherent OSTBC detection with polynomial complexity | en |
| Δημιουργός | Papailiopoulos, D.S. | en |
| Δημιουργός | Karystinos Georgios | en |
| Δημιουργός | Καρυστινος Γεωργιος | el |
| Εκδότης | Institute of Electrical and Electronics Engineers | en |
| Περιγραφή | Δημοσίευση σε επιστημονικό περιοδικό | el |
| Περίληψη | We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect to the sequence length for static Rayleigh, correlated (in general) channels. Moreover, using recent results on efficient maximization of rank-deficient quadratic forms over finite alphabets, we develop an algorithm that performs ML noncoherent sequence detection with polynomial complexity. The order of the polynomial complexity of the proposed receiver equals two times the rank of the covariance matrix of the vectorized channel matrix. Therefore, the lower the Rayleigh channel covariance rank the lower the receiver complexity. Instead, for Ricean channel distribution, we prove that polynomial complexity is attained through the proposed receiver as long as the mean channel vector is in the range of the covariance matrix of the vectorized channel matrix. Hence, full-rank channel correlation is desired to guarantee polynomial ML noncoherent detection complexity for the case of static Ricean fading. Our results are presented for the general case of block-fading Rayleigh or Ricean channels where we provide conditions under which ML noncoherent sequence detection can be performed in polynomial time through our algorithm. | en |
| Τύπος | Peer-Reviewed Journal Publication | en |
| Τύπος | Δημοσίευση σε Περιοδικό με Κριτές | el |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2015-10-23 | - |
| Ημερομηνία Δημοσίευσης | 2010 | - |
| Θεματική Κατηγορία | Blind detection | en |
| Θεματική Κατηγορία | maximum-likelihood (ML) | en |
| Θεματική Κατηγορία | multiple-input multiple-output (MIMO) | en |
| Θεματική Κατηγορία | quadratic form maximization | en |
| Βιβλιογραφική Αναφορά | D. S. Papailiopoulos and G. N. Karystinos, “Maximum-likelihood noncoherent OSTBC detection with polynomial complexity,” IEEE Transactions on Wireless Communications, vol. 9, no. 6, pp. 1935 - 1945, Jun. 2010. doi: 10.1109/TWC.2010.06.081715 | en |
Copyright © DIAS 2013
