TY - GEN
T1 - Optimal non-coherent data detection for massive SIMO wireless systems: A polynomial complexity solution
AU - Alshamary, Haider Ali Jasim
AU - Al-Naffouri, Tareq Y.
AU - Zaib, Alam
AU - Xu, Weiyu
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2016/1/4
Y1 - 2016/1/4
N2 - © 2015 IEEE. This paper considers the joint maximum likelihood (ML) channel estimation and data detection problem for massive SIMO (single input multiple output) wireless systems. We propose efficient algorithms achieving the exact ML non-coherent data detection, for both constant-modulus constellations and nonconstant-modulus constellations. Despite a large number of unknown channel coefficients in massive SIMO systems, we show that the expected computational complexity is linear in the number of receive antennas and polynomial in channel coherence time. To the best of our knowledge, our algorithms are the first efficient algorithms to achieve the exact joint ML channel estimation and data detection performance for massive SIMO systems with general constellations. Simulation results show our algorithms achieve considerable performance gains at a low computational complexity.
AB - © 2015 IEEE. This paper considers the joint maximum likelihood (ML) channel estimation and data detection problem for massive SIMO (single input multiple output) wireless systems. We propose efficient algorithms achieving the exact ML non-coherent data detection, for both constant-modulus constellations and nonconstant-modulus constellations. Despite a large number of unknown channel coefficients in massive SIMO systems, we show that the expected computational complexity is linear in the number of receive antennas and polynomial in channel coherence time. To the best of our knowledge, our algorithms are the first efficient algorithms to achieve the exact joint ML channel estimation and data detection performance for massive SIMO systems with general constellations. Simulation results show our algorithms achieve considerable performance gains at a low computational complexity.
UR - http://hdl.handle.net/10754/621284
UR - http://ieeexplore.ieee.org/document/7369548/
UR - http://www.scopus.com/inward/record.url?scp=84964034454&partnerID=8YFLogxK
U2 - 10.1109/DSP-SPE.2015.7369548
DO - 10.1109/DSP-SPE.2015.7369548
M3 - Conference contribution
SN - 9781467391696
SP - 172
EP - 177
BT - 2015 IEEE Signal Processing and Signal Processing Education Workshop (SP/SPE)
PB - Institute of Electrical and Electronics Engineers (IEEE)
ER -