Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Low Complexity Space-Time Block Codes Detection for Cell-Free Massive MIMO Systems (2004.00405v1)

Published 1 Apr 2020 in eess.SY, cs.SY, and eess.SP

Abstract: The new generation of telecommunication systems must provide acceptable data rates and spectral efficiency for new applications. Recently massive MIMO has been introduced as a key technique for the new generation of telecommunication systems. Cell-free massive MIMO system is not segmented into cells. Each BS antennas are distributed throughout the environment and each user is served by all BSs, simultaneously. In this paper, the performance of the multiuser cell-free massive MIMO-system exploying space-time block codes in the uplink, and with linear decoders is studied. An Inverse matrix approximation using Neumann series is proposed to reduce the computational and hardware complexity of the decoding in the receiver. For this purpose, each user has two antennas, and also for improving the diversity gain performance, space-time block codes are used in the uplink. Then, Neumann series is used to approximate the inverse matrix in ZF and MMSE decoders, and its performance is evaluated in terms of BER and spectral efficiency. In addition, we derive lower bound for throughput of ZF decoder. The simulation results show that performance of the system , in terms of BER and spectral efficiency, is better than the single-antenna users at the same system. Also, the BER performance in a given system with the proposed method will be close to the exact method.

Citations (2)

Summary

We haven't generated a summary for this paper yet.