A polynomial complexity algorithm for near-optimal signal detection in linear Gaussian vector channels

A near-optimal signal detection algorithm with complexity of O(K log K) is proposed for K -input, K -output linear Gaussian vector channels. The proposed algorithm is based on the searching for a monotone sequence with maximum likelihood, under the ranking of sufficient statistics. It is proved that...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2010 3rd IEEE International Conference on Computer Science and Information Technology Ročník 9; s. 223 - 226
Hlavní autoři: Qingyi Quan, Suzi Xie
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.07.2010
Témata:
Computational modeling
MIMO
optimal detection
polynomial complexity
vector channels
ISBN:9781424455379, 1424455375
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A near-optimal signal detection algorithm with complexity of O(K log K) is proposed for K -input, K -output linear Gaussian vector channels. The proposed algorithm is based on the searching for a monotone sequence with maximum likelihood, under the ranking of sufficient statistics. It is proved that the algorithm can reach the optimal detection result in the case that all cross-correlation values in the linear Gaussian vector channel are identical. Also some simulation results are provided for the case that the crosscorrelation values are different. The simulation results show that the performance of the proposed algorithm degrades with the divergence of the cross-correlation values in the linear vector channels. Finally, a method of modifying the correlation matrix is suggested by an example. In this method, a transformation is derived for reducing the divergence of the cross-correlation values of the correlation matrix. A simulation result shows that the proposed algorithm is enhanced further with the transformation.
ISBN:9781424455379
1424455375
DOI:10.1109/ICCSIT.2010.5563575