15,912 research outputs found
Infinite Factorial Finite State Machine for Blind Multiuser Channel Estimation
New communication standards need to deal with machine-to-machine
communications, in which users may start or stop transmitting at any time in an
asynchronous manner. Thus, the number of users is an unknown and time-varying
parameter that needs to be accurately estimated in order to properly recover
the symbols transmitted by all users in the system. In this paper, we address
the problem of joint channel parameter and data estimation in a multiuser
communication channel in which the number of transmitters is not known. For
that purpose, we develop the infinite factorial finite state machine model, a
Bayesian nonparametric model based on the Markov Indian buffet that allows for
an unbounded number of transmitters with arbitrary channel length. We propose
an inference algorithm that makes use of slice sampling and particle Gibbs with
ancestor sampling. Our approach is fully blind as it does not require a prior
channel estimation step, prior knowledge of the number of transmitters, or any
signaling information. Our experimental results, loosely based on the LTE
random access channel, show that the proposed approach can effectively recover
the data-generating process for a wide range of scenarios, with varying number
of transmitters, number of receivers, constellation order, channel length, and
signal-to-noise ratio.Comment: 15 pages, 15 figure
Massive MIMO has Unlimited Capacity
The capacity of cellular networks can be improved by the unprecedented array
gain and spatial multiplexing offered by Massive MIMO. Since its inception, the
coherent interference caused by pilot contamination has been believed to create
a finite capacity limit, as the number of antennas goes to infinity. In this
paper, we prove that this is incorrect and an artifact from using simplistic
channel models and suboptimal precoding/combining schemes. We show that with
multicell MMSE precoding/combining and a tiny amount of spatial channel
correlation or large-scale fading variations over the array, the capacity
increases without bound as the number of antennas increases, even under pilot
contamination. More precisely, the result holds when the channel covariance
matrices of the contaminating users are asymptotically linearly independent,
which is generally the case. If also the diagonals of the covariance matrices
are linearly independent, it is sufficient to know these diagonals (and not the
full covariance matrices) to achieve an unlimited asymptotic capacity.Comment: To appear in IEEE Transactions on Wireless Communications, 17 pages,
7 figure
Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks
Future wireless networks have a substantial potential in terms of supporting
a broad range of complex compelling applications both in military and civilian
fields, where the users are able to enjoy high-rate, low-latency, low-cost and
reliable information services. Achieving this ambitious goal requires new radio
techniques for adaptive learning and intelligent decision making because of the
complex heterogeneous nature of the network structures and wireless services.
Machine learning (ML) algorithms have great success in supporting big data
analytics, efficient parameter estimation and interactive decision making.
Hence, in this article, we review the thirty-year history of ML by elaborating
on supervised learning, unsupervised learning, reinforcement learning and deep
learning. Furthermore, we investigate their employment in the compelling
applications of wireless networks, including heterogeneous networks (HetNets),
cognitive radios (CR), Internet of things (IoT), machine to machine networks
(M2M), and so on. This article aims for assisting the readers in clarifying the
motivation and methodology of the various ML algorithms, so as to invoke them
for hitherto unexplored services as well as scenarios of future wireless
networks.Comment: 46 pages, 22 fig
Massive MIMO with Non-Ideal Arbitrary Arrays: Hardware Scaling Laws and Circuit-Aware Design
Massive multiple-input multiple-output (MIMO) systems are cellular networks
where the base stations (BSs) are equipped with unconventionally many antennas,
deployed on co-located or distributed arrays. Huge spatial degrees-of-freedom
are achieved by coherent processing over these massive arrays, which provide
strong signal gains, resilience to imperfect channel knowledge, and low
interference. This comes at the price of more infrastructure; the hardware cost
and circuit power consumption scale linearly/affinely with the number of BS
antennas . Hence, the key to cost-efficient deployment of large arrays is
low-cost antenna branches with low circuit power, in contrast to today's
conventional expensive and power-hungry BS antenna branches. Such low-cost
transceivers are prone to hardware imperfections, but it has been conjectured
that the huge degrees-of-freedom would bring robustness to such imperfections.
We prove this claim for a generalized uplink system with multiplicative
phase-drifts, additive distortion noise, and noise amplification. Specifically,
we derive closed-form expressions for the user rates and a scaling law that
shows how fast the hardware imperfections can increase with while
maintaining high rates. The connection between this scaling law and the power
consumption of different transceiver circuits is rigorously exemplified. This
reveals that one can make the circuit power increase as , instead of
linearly, by careful circuit-aware system design.Comment: Accepted for publication in IEEE Transactions on Wireless
Communications, 16 pages, 8 figures. The results can be reproduced using the
following Matlab code: https://github.com/emilbjornson/hardware-scaling-law
Infinite Factorial Finite State Machine for Blind Multiuser Channel Estimation
New communication standards need to deal with machine-to-machine
communications, in which users may start or stop transmitting at any time in an
asynchronous manner. Thus, the number of users is an unknown and time-varying
parameter that needs to be accurately estimated in order to properly recover
the symbols transmitted by all users in the system. In this paper, we address
the problem of joint channel parameter and data estimation in a multiuser
communication channel in which the number of transmitters is not known. For
that purpose, we develop the infinite factorial finite state machine model, a
Bayesian nonparametric model based on the Markov Indian buffet that allows for
an unbounded number of transmitters with arbitrary channel length. We propose
an inference algorithm that makes use of slice sampling and particle Gibbs with
ancestor sampling. Our approach is fully blind as it does not require a prior
channel estimation step, prior knowledge of the number of transmitters, or any
signaling information. Our experimental results, loosely based on the LTE
random access channel, show that the proposed approach can effectively recover
the data-generating process for a wide range of scenarios, with varying number
of transmitters, number of receivers, constellation order, channel length, and
signal-to-noise ratio
- …