Journal
IEEE TRANSACTIONS ON SIGNAL PROCESSING
Volume 68, Issue -, Pages 687-700Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSP.2020.2964496
Keywords
Massive MIMO; decentralized architecture; precoding; detection; zero-forcing; coordinate descent; kaczmarz; inter-connection data-rate; SINR
Categories
Funding
- ELLIIT, the Excellence Center at Linkoping-Lund in Information Technlology
Ask authors/readers for more resources
Algorithms for Massive MIMO uplink detection and downlink precoding typically rely on a centralized approach, by which baseband data from all antenna modules are routed to a central node in order to be processed. In the case of Massive MIMO, where hundreds or thousands of antennas are expected in the base-station, said routing becomes a bottleneck since interconnection throughput is limited. This paper presents a fully decentralized architecture and an algorithm for Massive MIMO uplink detection and downlink precoding based on the Coordinate Descent (CD) method, which does not require a central node for these tasks. Through a recursive approach and very low complexity operations, the proposed algorithm provides a good trade-off between performance, interconnection throughput and latency. Further, our proposed solution achieves significantly lower interconnection data-rate than other architectures, enabling future scalability.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available