Matrix analysis and applied linear algebra
Matrix analysis and applied linear algebra
Efficient computation of the binary vector that maximizes a rank-deficient quadratic form
IEEE Transactions on Information Theory
On maximum-likelihood detection and decoding for space-time codingsystems
IEEE Transactions on Signal Processing
Blind ML Detection of Orthogonal Space-Time Block Codes: Identifiability and Code Construction
IEEE Transactions on Signal Processing - Part I
IEEE Transactions on Signal Processing
Blind ML detection of orthogonal space-time block codes: efficient high-performance implementations
IEEE Transactions on Signal Processing
IEEE Transactions on Wireless Communications
Efficient Blind Receiver Design for Orthogonal Space-Time Block Codes
IEEE Transactions on Wireless Communications
Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading
IEEE Transactions on Information Theory
Systematic design of unitary space-time constellations
IEEE Transactions on Information Theory
Differential space-time modulation
IEEE Transactions on Information Theory
Optimal Joint Detection/Estimation in Fading Channels With Polynomial Complexity
IEEE Transactions on Information Theory
Rank-2-Optimal Adaptive Design of Binary Spreading Codes
IEEE Transactions on Information Theory
Hi-index | 0.00 |
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.