216 research outputs found
On the Achievable Rates of Decentralized Equalization in Massive MU-MIMO Systems
Massive multi-user (MU) multiple-input multiple-output (MIMO) promises
significant gains in spectral efficiency compared to traditional, small-scale
MIMO technology. Linear equalization algorithms, such as zero forcing (ZF) or
minimum mean-square error (MMSE)-based methods, typically rely on centralized
processing at the base station (BS), which results in (i) excessively high
interconnect and chip input/output data rates, and (ii) high computational
complexity. In this paper, we investigate the achievable rates of decentralized
equalization that mitigates both of these issues. We consider two distinct BS
architectures that partition the antenna array into clusters, each associated
with independent radio-frequency chains and signal processing hardware, and the
results of each cluster are fused in a feedforward network. For both
architectures, we consider ZF, MMSE, and a novel, non-linear equalization
algorithm that builds upon approximate message passing (AMP), and we
theoretically analyze the achievable rates of these methods. Our results
demonstrate that decentralized equalization with our AMP-based methods incurs
no or only a negligible loss in terms of achievable rates compared to that of
centralized solutions.Comment: Will be presented at the 2017 IEEE International Symposium on
Information Theor
Decentralized Massive MIMO Processing Exploring Daisy-chain Architecture and Recursive Algorithms
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 Stochastic
Gradient Descent (SGD) 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.Comment: Manuscript accepted for publication in IEEE Transactions on Signal
Processin
Efficient DSP and Circuit Architectures for Massive MIMO: State-of-the-Art and Future Directions
Massive MIMO is a compelling wireless access concept that relies on the use
of an excess number of base-station antennas, relative to the number of active
terminals. This technology is a main component of 5G New Radio (NR) and
addresses all important requirements of future wireless standards: a great
capacity increase, the support of many simultaneous users, and improvement in
energy efficiency. Massive MIMO requires the simultaneous processing of signals
from many antenna chains, and computational operations on large matrices. The
complexity of the digital processing has been viewed as a fundamental obstacle
to the feasibility of Massive MIMO in the past. Recent advances on
system-algorithm-hardware co-design have led to extremely energy-efficient
implementations. These exploit opportunities in deeply-scaled silicon
technologies and perform partly distributed processing to cope with the
bottlenecks encountered in the interconnection of many signals. For example,
prototype ASIC implementations have demonstrated zero-forcing precoding in real
time at a 55 mW power consumption (20 MHz bandwidth, 128 antennas, multiplexing
of 8 terminals). Coarse and even error-prone digital processing in the antenna
paths permits a reduction of consumption with a factor of 2 to 5. This article
summarizes the fundamental technical contributions to efficient digital signal
processing for Massive MIMO. The opportunities and constraints on operating on
low-complexity RF and analog hardware chains are clarified. It illustrates how
terminals can benefit from improved energy efficiency. The status of technology
and real-life prototypes discussed. Open challenges and directions for future
research are suggested.Comment: submitted to IEEE transactions on signal processin
Systems with Massive Number of Antennas: Distributed Approaches
As 5G is entering maturity, the research interest has shifted towards 6G, and specially the new use cases that the future telecommunication infrastructure needs to support. These new use cases encompass much higher requirements, specifically: higher communication data-rates, larger number of users, higher accuracy in localization, possibility to wirelessly charge devices, among others.The radio access network (RAN) has already gone through an evolution on the path towards 5G. One of the main changes was a large increment of the number of antennas in the base-station. Some of them may even reach 100 elements, in what is commonly referred as Massive MIMO. New proposals for 6G RAN point in the direction of continuing this path of increasing the number of antennas, and locate them throughout a certain area of service. Different technologies have been proposed in this direction, such as: cell-free Massive MIMO, distributed MIMO, and large intelligent surface (LIS). In this thesis we focus on LIS, whose conducted theoretical studies promise the fulfillment of the aforementioned requirements.While the theoretical capabilities of LIS have been conveniently analyzed, little has been done in terms of implementing this type of systems. When the number of antennas grow to hundreds or thousands, there are numerous challenges that need to be solved for a successful implementation. The most critical challenges are the interconnection data-rate and the computational complexity.In the present thesis we introduce the implementation challenges, and show that centralized processing architectures are no longer adequate for this type of systems. We also present different distributed processing architectures and show the benefits of this type of schemes. This work aims at giving a system-design guideline that helps the system designer to make the right decisions when designing these type of systems. For that, we provide algorithms, performance analysis and comparisons, including first order evaluation of the interconnection data-rate, processing latency, memory and energy consumption. These numbers are based on models and available data in the literature. Exact values depend on the selected technology, and will be accurately determined after building and testing these type of systems.The thesis concentrates mostly on the topic of communication, with additional exploration of other areas, such as localization. In case of localization, we benefit from the high spatial resolution of a very-large array that provides very rich channel state information (CSI). A CSI-based fingerprinting via neural network technique is selected for this case with promising results. As the communication and localization services are based on the acquisition of CSI, we foresee a common system architecture capable of supporting both cases. Further work in this direction is recommended, with the possibility of including other applications such as sensing.The obtained results indicate that the implementation of these very-large array systems is feasible, but the challenges are numerous. The proposed solutions provide encouraging results that need to be verified with hardware implementations and real measurements
Trade-offs In Quasi-Decentralized Massive MIMO
Typical massive multiple-input multiple-output (MIMO) architectures consider
a centralized approach, in which all baseband data received by each antenna has
to be sent to a central processing unit (CPU) to be processed. Due to the
enormous amount of antennas expected in massive MIMO base stations (BSs), the
number of connections to the CPU required in centralized massive MIMO is not
scalable. In recent literature decentralized approaches have been proposed to
reduce the number of connections between the antennas and the CPU. However, the
reduction in the connections to the CPU requires more outputs per antenna to be
generated. We study the trade-off between number of connections to the CPU and
number of outputs per antenna. We propose a generalized architecture that
allows exploitation of this trade-off, and we define a novel matrix
decomposition that allows lossless linear equalization within our proposed
architecture.Comment: 6 pages, 4 figures, accepted at IEEE ICC 2020 workshop on scalable
massive MIMO technologies for beyond 5
- …