Low-Complexity Linear MIMO-OTFS Receivers
Authors:
- 1 June 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Abstract
Orthogonal time-frequency space (OTFS) scheme, which transforms a time and frequency selective channel into an almost non-selective delay-Doppler domain channel, establishes reliable wireless communication links for high-speed moving devices. This work designs and analyzes low-complexity zero-forcing and minimum mean square error receivers for multiple-input multiple-output (MIMO)-OTFS systems for both perfect and imperfect channel state informations. The proposed receivers provide exactly the same solution as that of their conventional counterparts, and reduce the complexity by exploiting the doubly-circulant nature of the MIMO-OTFS channel matrix, the blockwise inverse, and Schur complement. We numerically show the same bit error rate and lower complexity of the proposed designs over the conventional ones.Keywords
Funding Information
- Anusandhan National Research Foundation
This publication has 12 references indexed in Scilit:
- Low-Complexity Linear Equalization for OTFS ModulationIEEE Communications Letters, 2019
- Uplink Sum-Rate and Power Scaling Laws for Multi-User Massive MIMO-FBMC SystemsIEEE Transactions on Communications, 2019
- Low complexity LMMSE Receiver for OTFSIEEE Communications Letters, 2019
- OTFS-NOMA: An Efficient Approach for Exploiting Heterogenous User Mobility ProfilesIEEE Transactions on Communications, 2019
- On the Diversity of Uncoded OTFS Modulation in Doubly-Dispersive ChannelsIEEE Transactions on Wireless Communications, 2019
- SER Analysis of MMSE Combining For MIMO FBMC-OQAM Systems With Imperfect CSIIEEE Communications Letters, 2018
- Interference Cancellation and Iterative Detection for Orthogonal Time Frequency Space ModulationIEEE Transactions on Wireless Communications, 2018
- Large MIMO Systems2013
- On Circulant MatricesNotices of the American Mathematical Society, 2012
- Inverses of 2 × 2 block matricesComputers & Mathematics with Applications, 2002