Maximum-likelihood noncoherent OSTBC detection with polynomial complexity

Abstract--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 guara...

• Type: Journal
• Year: 2010
• Where: TWC
• Authors: Dimitris S. Papailiopoulos, George N. Karystinos
• Keywords: Artificial Intelligence, Noncoherent Sequence Detection, Polynomial, Polynomial Complexity, TWC 2010