2,267 research outputs found
Asymptotic Task-Based Quantization with Application to Massive MIMO
Quantizers take part in nearly every digital signal processing system which
operates on physical signals. They are commonly designed to accurately
represent the underlying signal, regardless of the specific task to be
performed on the quantized data. In systems working with high-dimensional
signals, such as massive multiple-input multiple-output (MIMO) systems, it is
beneficial to utilize low-resolution quantizers, due to cost, power, and memory
constraints. In this work we study quantization of high-dimensional inputs,
aiming at improving performance under resolution constraints by accounting for
the system task in the quantizers design. We focus on the task of recovering a
desired signal statistically related to the high-dimensional input, and analyze
two quantization approaches: We first consider vector quantization, which is
typically computationally infeasible, and characterize the optimal performance
achievable with this approach. Next, we focus on practical systems which
utilize hardware-limited scalar uniform analog-to-digital converters (ADCs),
and design a task-based quantizer under this model. The resulting system
accounts for the task by linearly combining the observed signal into a lower
dimension prior to quantization. We then apply our proposed technique to
channel estimation in massive MIMO networks. Our results demonstrate that a
system utilizing low-resolution scalar ADCs can approach the optimal channel
estimation performance by properly accounting for the task in the system
design
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
Filter Bank Multicarrier for Massive MIMO
This paper introduces filter bank multicarrier (FBMC) as a potential
candidate in the application of massive MIMO communication. It also points out
the advantages of FBMC over OFDM (orthogonal frequency division multiplexing)
in the application of massive MIMO. The absence of cyclic prefix in FBMC
increases the bandwidth efficiency. In addition, FBMC allows carrier
aggregation straightforwardly. Self-equalization, a property of FBMC in massive
MIMO that is introduced in this paper, has the impact of reducing (i)
complexity; (ii) sensitivity to carrier frequency offset (CFO); (iii)
peak-to-average power ratio (PAPR); (iv) system latency; and (v) increasing
bandwidth efficiency. The numerical results that corroborate these claims are
presented.Comment: 7 pages, 6 figure
Fundamental Asymptotic Behavior of (Two-User) Distributed Massive MIMO
This paper considers the uplink of a distributed Massive MIMO network where
base stations (BSs), each equipped with antennas, receive data from
users. We study the asymptotic spectral efficiency (as )
with spatial correlated channels, pilot contamination, and different degrees of
channel state information (CSI) and statistical knowledge at the BSs. By
considering a two-user setup, we can simply derive fundamental asymptotic
behaviors and provide novel insights into the structure of the optimal
combining schemes. In line with [1], when global CSI is available at all BSs,
the optimal minimum-mean squared error combining has an unbounded capacity as
, if the global channel covariance matrices of the users are
asymptotically linearly independent. This result is instrumental to derive a
suboptimal combining scheme that provides unbounded capacity as
using only local CSI and global channel statistics. The latter scheme is shown
to outperform a generalized matched filter scheme, which also achieves
asymptotic unbounded capacity by using only local CSI and global channel
statistics, but is derived following [2] on the basis of a more conservative
capacity bound.Comment: 6 pages, 2 figures, to be presented at GLOBECOM 2018, Abu Dhab
- …