![Institutional Repository [SANDBOX]](images/dias.logo.png "Institutional Repository [SANDBOX]"){kind=logo}
Institutional Repository [SANDBOX]
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/7187B4C3-2D7E-4692-BE3A-AAD5AFB49BC1 | ||
| Year | 2009 | ||
| Type of Item | Conference Full Paper | ||
| License |
|
||
| Bibliographic Citation | D. S. Papailiopoulos and G. N. Karystinos, “Optimal OSTBC sequence detection over unknown correlated fading channels,” in Proc. 2009 Asilomar Conference on Signals, Systems, and Computers, pp. 1441-1445. | ||
| Appears in Collections |
We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded (OSTBC) signals can be performed in polynomial time with respect to the sequence length for time-varying Rayleigh or Ricean distributed, correlated (in general) channel coefficients, if the mean channel vector belongs to the range of the channel covariance matrix. We develop a novel algorithm that, provided the above condition, performs ML noncoherent sequence detection with polynomial complexity the order of which equals twice the rank of the channel covariance matrix. Therefore, for Rayleigh fading, polynomial ML noncoherent detection complexity is always guaranteed; the lower the channel covariance rank the lower the receiver complexity. Instead, for Ricean fading, fullrank channel correlation is desired to guarantee polynomial ML noncoherent detection complexity.
Copyright © DIAS 2013
