Abstract

In order to fully exploit the scarce spectrum, antenna arrays are incorporated into wireless communication devices in 4G and 5G communication networks to deploy MIMO-OFDM systems. Recently, the least squares Khatri–Rao factorization has been applied to MIMO-OFDM systems for semi-blind joint channel and symbol estimation. Its cubic computational complexity is prohibitive when the number of transmit and receive antennas is very large. Therefore, the average vector and Hadamard ratio rank one approximation has been proposed for MIMO-OFDM systems, showing a linear complexity, but being limited to channels and transmitted symbols with offsets. In this paper, we present four novel MIMO-OFDM algorithms for massive antenna array systems that outperform the state-of-the-art approaches in terms of complexity and/or accuracy. The four proposed schemes are the alternating least squares with vector selection initialization, the vector projection rank one approximation including vector selection rank one initialization, the factorization based on eigenvalue decomposition with eigenvector projection and the factorization based on sectional truncated singular value decomposition and vector projection. Our analytical complexity analysis and numerical results corroborate the trade-offs offered by the different receiver algorithms in terms of complexity, parallelism and performance.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.