2016
Durisi, Giuseppe; Koch, Tobias; Ostman, Johan; Polyanskiy, Yury; Yang, Wei
Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels Artículo de revista
En: IEEE Transactions on Communications, vol. 64, no 2, pp. 618–629, 2016, ISSN: 0090-6778.
Resumen | Enlaces | BibTeX | Etiquetas: diversity branches, Encoding, ergodic capacity, Fading, fading channels, finite-blocklength information theory, finiteblocklength information theory, infinite-blocklength performance metrics, Journal, machine-type communication systems, maximum coding rate, Mission critical systems, mission-critical machine-type communications, multiple antennas, multiple-antenna Rayleigh block-fading channels, Multiplexing, optimal number, outage capacity, rate gain, Rayleigh channels, Receivers, Reliability, short-packet communications, spatial multiplexing, Throughput, Time-frequency analysis, time-frequency-spatial degrees of freedom, transmit antennas, transmit diversity, Transmitting antennas, Ultra-reliable low-latency communications
@article{Durisi2016b,
title = {Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels},
author = {Giuseppe Durisi and Tobias Koch and Johan Ostman and Yury Polyanskiy and Wei Yang},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7362178},
doi = {10.1109/TCOMM.2015.2511087},
issn = {0090-6778},
year = {2016},
date = {2016-02-01},
journal = {IEEE Transactions on Communications},
volume = {64},
number = {2},
pages = {618--629},
publisher = {IEEE},
abstract = {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},
keywords = {diversity branches, Encoding, ergodic capacity, Fading, fading channels, finite-blocklength information theory, finiteblocklength information theory, infinite-blocklength performance metrics, Journal, machine-type communication systems, maximum coding rate, Mission critical systems, mission-critical machine-type communications, multiple antennas, multiple-antenna Rayleigh block-fading channels, Multiplexing, optimal number, outage capacity, rate gain, Rayleigh channels, Receivers, Reliability, short-packet communications, spatial multiplexing, Throughput, Time-frequency analysis, time-frequency-spatial degrees of freedom, transmit antennas, transmit diversity, Transmitting antennas, Ultra-reliable low-latency communications},
pubstate = {published},
tppubtype = {article}
}
2014
Campo, Adria Tauste; Vazquez-Vilar, Gonzalo; i Fàbregas, Albert Guillén; Koch, Tobias; Martinez, Alfonso
A Derivation of the Source-Channel Error Exponent Using Nonidentical Product Distributions Artículo de revista
En: IEEE Transactions on Information Theory, vol. 60, no 6, pp. 3209–3217, 2014, ISSN: 0018-9448.
Resumen | Enlaces | BibTeX | Etiquetas: ALCIT, Channel Coding, COMONSENS, DEIPRO, error probability, joint source-channel coding, Joints, MobileNET, Probability distribution, product distributions, random coding, Reliability, reliability function, sphere-packing bound, Upper bound
@article{TausteCampo2014,
title = {A Derivation of the Source-Channel Error Exponent Using Nonidentical Product Distributions},
author = {Adria Tauste Campo and Gonzalo Vazquez-Vilar and Albert Guill\'{e}n i F\`{a}bregas and Tobias Koch and Alfonso Martinez},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6803047 http://www.tsc.uc3m.es/~koch/files/IEEE_TIT_60(6).pdf},
issn = {0018-9448},
year = {2014},
date = {2014-01-01},
journal = {IEEE Transactions on Information Theory},
volume = {60},
number = {6},
pages = {3209--3217},
publisher = {IEEE},
abstract = {This paper studies the random-coding exponent of joint source-channel coding for a scheme where source messages are assigned to disjoint subsets (referred to as classes), and codewords are independently generated according to a distribution that depends on the class index of the source message. For discrete memoryless systems, two optimally chosen classes and product distributions are found to be sufficient to attain the sphere-packing exponent in those cases where it is tight.},
keywords = {ALCIT, Channel Coding, COMONSENS, DEIPRO, error probability, joint source-channel coding, Joints, MobileNET, Probability distribution, product distributions, random coding, Reliability, reliability function, sphere-packing bound, Upper bound},
pubstate = {published},
tppubtype = {article}
}