TY - GEN
T1 - Frequency Domain Multi-user Detection for Single Carrier Modulation with Cyclic Prefix
AU - Kenney, Brent A.
AU - Majid, Arslan J.
AU - Moradi, Hussein
AU - Farhang-Boroujeny, Behrouz
N1 - Funding Information:
This manuscript has in part been authored by Battelle Energy Alliance, LLC under Contract No. DE-AC07-05ID14517 with the U.S. Department of Energy. The United States Government retains and the publisher, by accepting the paper for publication, acknowledges that the United States Government retains a nonexclusive, paid-up, irrevocable, world-wide license to publish or reproduce the published form of this manuscript, or allow others to do so, for United States Government purposes. STI Number: INL/CON-20-58011.
Publisher Copyright:
© 2020 IEEE.
PY - 2020/12
Y1 - 2020/12
N2 - Frequency domain (FD) multi-user detection (MUD) has been shown to be an effective means of approaching the theoretical per-user capacity for single carrier modulation (SCM) schemes in massive MIMO scenarios with highly dispersive channels. When a cyclic prefix is added to the SCM waveform, the circulant structures of the resulting convolutional channel matrix allows for relatively simple expressions for the FD detection. In this paper, we develop a computationally efficient minimum mean squared error (MMSE) FD-MUD technique in a time-division duplexing (TDD) massive MIMO setup and show how processing steps can be shared between uplink and downlink.
AB - Frequency domain (FD) multi-user detection (MUD) has been shown to be an effective means of approaching the theoretical per-user capacity for single carrier modulation (SCM) schemes in massive MIMO scenarios with highly dispersive channels. When a cyclic prefix is added to the SCM waveform, the circulant structures of the resulting convolutional channel matrix allows for relatively simple expressions for the FD detection. In this paper, we develop a computationally efficient minimum mean squared error (MMSE) FD-MUD technique in a time-division duplexing (TDD) massive MIMO setup and show how processing steps can be shared between uplink and downlink.
UR - https://www.scopus.com/pages/publications/85100396221
U2 - 10.1109/GLOBECOM42002.2020.9322612
DO - 10.1109/GLOBECOM42002.2020.9322612
M3 - Conference contribution
AN - SCOPUS:85100396221
T3 - 2020 IEEE Global Communications Conference, GLOBECOM 2020 - Proceedings
BT - 2020 IEEE Global Communications Conference, GLOBECOM 2020 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2020 IEEE Global Communications Conference, GLOBECOM 2020
Y2 - 7 December 2020 through 11 December 2020
ER -