466 research outputs found
Finite-Blocklength Bounds on the Maximum Coding Rate of Rician Fading Channels with Applications to Pilot-Assisted Transmission
We present nonasymptotic bounds on the maximum coding rate achievable over a
Rician block-fading channel for a fixed packet size and a fixed packet error
probability. Our bounds, which apply to the scenario where no a priori channel
state information is available at the receiver, allow one to quantify the
tradeoff between the rate gains resulting from the exploitation of
time-frequency diversity and the rate loss resulting from fast channel
variations and pilot-symbol overhead
One-Bit Massive MIMO: Channel Estimation and High-Order Modulations
We investigate the information-theoretic throughout achievable on a fading
communication link when the receiver is equipped with one-bit analog-to-digital
converters (ADCs). The analysis is conducted for the setting where neither the
transmitter nor the receiver have a priori information on the realization of
the fading channels. This means that channel-state information needs to be
acquired at the receiver on the basis of the one-bit quantized channel outputs.
We show that least-squares (LS) channel estimation combined with joint pilot
and data processing is capacity achieving in the single-user,
single-receive-antenna case.
We also investigate the achievable uplink throughput in a massive
multiple-input multiple-output system where each element of the antenna array
at the receiver base-station feeds a one-bit ADC. We show that LS channel
estimation and maximum-ratio combining are sufficient to support both multiuser
operation and the use of high-order constellations. This holds in spite of the
severe nonlinearity introduced by the one-bit ADCs
Capacity Theorems for the Fading Interference Channel with a Relay and Feedback Links
Handling interference is one of the main challenges in the design of wireless
networks. One of the key approaches to interference management is node
cooperation, which can be classified into two main types: relaying and
feedback. In this work we consider simultaneous application of both cooperation
types in the presence of interference. We obtain exact characterization of the
capacity regions for Rayleigh fading and phase fading interference channels
with a relay and with feedback links, in the strong and very strong
interference regimes. Four feedback configurations are considered: (1) feedback
from both receivers to the relay, (2) feedback from each receiver to the relay
and to one of the transmitters (either corresponding or opposite), (3) feedback
from one of the receivers to the relay, (4) feedback from one of the receivers
to the relay and to one of the transmitters. Our results show that there is a
strong motivation for incorporating relaying and feedback into wireless
networks.Comment: Accepted to the IEEE Transactions on Information Theor
Outage Capacity and Optimal Transmission for Dying Channels
In wireless networks, communication links may be subject to random fatal
impacts: for example, sensor networks under sudden power losses or cognitive
radio networks with unpredictable primary user spectrum occupancy. Under such
circumstances, it is critical to quantify how fast and reliably the information
can be collected over attacked links. For a single point-to-point channel
subject to a random attack, named as a \emph{dying channel}, we model it as a
block-fading (BF) channel with a finite and random delay constraint. First, we
define the outage capacity as the performance measure, followed by studying the
optimal coding length such that the outage probability is minimized when
uniform power allocation is assumed. For a given rate target and a coding
length , we then minimize the outage probability over the power allocation
vector \mv{P}_{K}, and show that this optimization problem can be cast into a
convex optimization problem under some conditions. The optimal solutions for
several special cases are discussed.
Furthermore, we extend the single point-to-point dying channel result to the
parallel multi-channel case where each sub-channel is a dying channel, and
investigate the corresponding asymptotic behavior of the overall outage
probability with two different attack models: the independent-attack case and
the -dependent-attack case. It can be shown that the overall outage
probability diminishes to zero for both cases as the number of sub-channels
increases if the \emph{rate per unit cost} is less than a certain threshold.
The outage exponents are also studied to reveal how fast the outage probability
improves over the number of sub-channels.Comment: 31 pages, 9 figures, submitted to IEEE Transactions on Information
Theor
Short-Packet Communications over Multiple-Antenna Rayleigh-Fading Channels
Motivated by the current interest in ultra-reliable, low-latency, machine-type communication systems, we investigate the tradeoff between reliability, throughput, and latency in the transmission of information over multiple-antenna Rayleigh block-fading channels. Specifically, we obtain finite-blocklength, finite-SNR upper and lower bounds on the maximum coding rate achievable over such channels for a given constraint on the packet error probability. Numerical evidence suggests that our bounds delimit tightly the maximum coding rate already for short blocklengths (packets of about 100 symbols). Furthermore, our bounds reveal the existence of a tradeoff between the rate gain obtainable by spreading each codeword over all available time-frequency-spatial degrees of freedom, and the rate loss caused by the need of estimating the fading coefficients over these degrees of freedom. In particular, our bounds allow us to determine the optimal number of transmit antennas and the optimal number of time-frequency diversity branches that maximize the rate. Finally, we show that infinite-blocklength performance metrics such as the ergodic capacity and the outage capacity yield inaccurate throughput estimates.This work was supported in part by the Swedish Research Council under grant 2012-4571, by the National Science Foundation CAREER award under grant agreement CCF-12-53205, by the European Community’s Seventh Framework Programme FP7/2007-2013 under Grant 333680, by the Ministerio de Economía y Competitividad of Spain under Grants RYC-2014-16322, TEC2013-41718-R,
and CSD2008-00010, and by the Comunidad de Madrid under Grant S2013/ICE-2845
Ultra-Reliable Short-Packet Communications: Fundamental Limits and Enabling Technologies
The paradigm shift from 4G to 5G communications, anticipated to enable ultra-reliable low-latency communications (URLLC), will enforce a radical change in the design of wireless communication systems. Unlike in 4G systems, where the main objective is to provide a large transmission rate, in URLLC, as implied by its name, the objective is to enable transmissions with low latency and, simultaneously, very high reliability. Since low latency implies the use of short data packets, the tension between blocklength and reliability is studied in URLLC.Several key enablers for URLLC communications have been designated in the literature. Of special importance are diversity-enabling technologies such as multiantenna systems and feedback protocols. Furthermore, it is not only important to introduce additional diversity by means of the above examples, one must also guarantee that thescarce number of channel uses are used in an optimal way. Therefore, it is imperative to develop design guidelines for how to enable reliable detection of incoming data, how to acquire channel-state information, and how to construct efficient short-packet channel codes. The development of such guidelines is at the heart of this thesis. This thesis focuses on the fundamental performance of URLLC-enabling technologies. Specifically, we provide converse (upper) bounds and achievability (lower) bounds on the maximum coding rate, based on finite-blocklength information theory, for systems that employ the key enablers outlined above. With focus on the wireless channel, modeled via a block-fading assumption, we are able to provide answers to questions like: howto optimally utilize spatial and frequency diversity, how far from optimal short-packet channel codes perform, how multiantenna systems should be designed to serve a given number of users, and how to design feedback schemes when the feedback link is noisy. In particular, this thesis is comprised out of four papers. In Paper A, we study the short-packet performance over the Rician block-fading channel. In particular, we present achievability bounds for pilot-assisted transmission with several different decoders that allow us to quantify the impact, on the achievable performance, of imposed pilots and mismatched decoding. Furthermore, we design short-packet channel codes that perform within 1 dB of our achievability bounds. Paper B studies multiuser massive multiple-input multiple-output systems with short packets. We provide an achievability bound on the average error probability over quasistatic spatially correlated Rayleigh-fading channels. The bound applies to arbitrary multiuser settings, pilot-assisted transmission, and mismatched decoding. This makes it suitable to assess the performance in the uplink/downlink for arbitrary linear signal processing. We show that several lessons learned from infinite-blocklength analyses carry over to the finite-blocklength regime. Furthermore, for the multicell setting with randomly placed users, pilot contamination should be avoided at all cost and minimum mean-squared error signal processing should be used to comply with the stringent requirements of URLLC.In Paper C, we consider sporadic transmissions where the task of the receiver is to both detect and decode an incoming packet. Two novel achievability bounds, and a novel converse bound are presented for joint detection-decoding strategies. It is shown that errors associated with detection deteriorates performance significantly for very short packet sizes. Numerical results also indicate that separate detection-decoding strategies are strictly suboptimal over block-fading channels.Finally, in Paper D, variable-length codes with noisy stop-feedback are studied via a novel achievability bound on the average service time and the average error probability. We use the bound to shed light on the resource allocation problem between the forward and the feedback channel. For URLLC applications, it is shown that enough resources must be assigned to the feedback link such that a NACK-to-ACK error becomes rarer than the target error probability. Furthermore, we illustrate that the variable-length stop-feedback scheme outperforms state-of-the-art fixed-length no-feedback bounds even when the stop-feedback bit is noisy
Optimal Energy Allocation For Delay-Constrained Traffic Over Fading Multiple Access Channels
In this paper, we consider a multiple-access fading channel where users
transmit to a single base station (BS) within a limited number of time slots.
We assume that each user has a fixed amount of energy available to be consumed
over the transmission window. We derive the optimal energy allocation policy
for each user that maximizes the total system throughput under two different
assumptions on the channel state information. First, we consider the offline
allocation problem where the channel states are known a priori before
transmission. We solve a convex optimization problem to maximize the
sum-throughput under energy and delay constraints. Next, we consider the online
allocation problem, where the channels are causally known to the BS and obtain
the optimal energy allocation via dynamic programming when the number of users
is small. We also develop a suboptimal resource allocation algorithm whose
performance is close to the optimal one. Numerical results are presented
showing the superiority of the proposed algorithms over baseline algorithms in
various scenarios.Comment: IEEE Global Communications Conference: Wireless Communications
(Globecom2016 WC
- …