2016
Bocharova, Irina E; i Fàbregas, Albert Guillén; Kudryashov, Boris D; Martinez, Alfonso; Campo, Adria Tauste; Vazquez-Vilar, Gonzalo
Multi-Class Source-Channel Coding Artículo de revista
En: IEEE Transactions on Information Theory, vol. 62, no 9, pp. 5093 – 5104, 2016.
Resumen | Enlaces | BibTeX | Etiquetas: Channel Coding, Complexity theory, error probability, Indexes, Journal, Maximum likelihood decoding
@article{Bocharova2016,
title = {Multi-Class Source-Channel Coding},
author = {Irina E Bocharova and Albert Guill\'{e}n i F\`{a}bregas and Boris D Kudryashov and Alfonso Martinez and Adria Tauste Campo and Gonzalo Vazquez-Vilar},
url = {http://arxiv.org/abs/1410.8714},
year = {2016},
date = {2016-09-01},
journal = {IEEE Transactions on Information Theory},
volume = {62},
number = {9},
pages = {5093 -- 5104},
abstract = {This paper studies an almost-lossless source-channel coding scheme in which source messages are assigned to different classes and encoded with a channel code that depends on the class index. The code performance is analyzed by means of random-coding error exponents and validated by simulation of a low-complexity implementation using existing source and channel codes. While each class code can be seen as a concatenation of a source code and a channel code, the overall performance improves on that of separate source-channel coding and approaches that of joint source-channel coding when the number of classes increases.},
keywords = {Channel Coding, Complexity theory, error probability, Indexes, Journal, Maximum likelihood decoding},
pubstate = {published},
tppubtype = {article}
}
This paper studies an almost-lossless source-channel coding scheme in which source messages are assigned to different classes and encoded with a channel code that depends on the class index. The code performance is analyzed by means of random-coding error exponents and validated by simulation of a low-complexity implementation using existing source and channel codes. While each class code can be seen as a concatenation of a source code and a channel code, the overall performance improves on that of separate source-channel coding and approaches that of joint source-channel coding when the number of classes increases.
Vazquez-Vilar, Gonzalo; Campo, Adria Tauste; i Fabregas, Albert Guillen; Martinez, Alfonso
Bayesian M-Ary Hypothesis Testing: The Meta-Converse and Verdú-Han Bounds Are Tight Artículo de revista
En: IEEE Transactions on Information Theory, vol. 62, no 5, pp. 2324–2333, 2016, ISSN: 0018-9448.
Resumen | Enlaces | BibTeX | Etiquetas: Bayes methods, Channel Coding, Electronic mail, error probability, Journal, Random variables, Testing
@article{Vazquez-Vilar2016,
title = {Bayesian M-Ary Hypothesis Testing: The Meta-Converse and Verd\'{u}-Han Bounds Are Tight},
author = {Gonzalo Vazquez-Vilar and Adria Tauste Campo and Albert Guillen i Fabregas and Alfonso Martinez},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7434042},
doi = {10.1109/TIT.2016.2542080},
issn = {0018-9448},
year = {2016},
date = {2016-05-01},
journal = {IEEE Transactions on Information Theory},
volume = {62},
number = {5},
pages = {2324--2333},
abstract = {Two alternative exact characterizations of the minimum error probability of Bayesian M-ary hypothesis testing are derived. The first expression corresponds to the error probability of an induced binary hypothesis test and implies the tightness of the meta-converse bound by Polyanskiy et al.; the second expression is a function of an information-spectrum measure and implies the tightness of a generalized Verd\'{u}-Han lower bound. The formulas characterize the minimum error probability of several problems in information theory and help to identify the steps where existing converse bounds are loose.},
keywords = {Bayes methods, Channel Coding, Electronic mail, error probability, Journal, Random variables, Testing},
pubstate = {published},
tppubtype = {article}
}
Two alternative exact characterizations of the minimum error probability of Bayesian M-ary hypothesis testing are derived. The first expression corresponds to the error probability of an induced binary hypothesis test and implies the tightness of the meta-converse bound by Polyanskiy et al.; the second expression is a function of an information-spectrum measure and implies the tightness of a generalized Verdú-Han lower bound. The formulas characterize the minimum error probability of several problems in information theory and help to identify the steps where existing converse bounds are loose.
2015
Olmos, Pablo M; Urbanke, Rudiger
A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes Artículo de revista
En: IEEE Transactions on Information Theory, vol. 61, no 6, pp. 3164–3184, 2015, ISSN: 0018-9448.
Resumen | Enlaces | BibTeX | Etiquetas: asymptotic analysis, asymptotic properties, binary erasure channel, Channel Coding, Codes on graphs, Couplings, Decoding, Differential equations, error probability, finite length performance, finite length spatially coupled code, finite-length code performance, finite-length performance, Iterative decoding, iterative decoding thresholds, Journal, parity check codes, Probability, SC-LDPC codes, scaling law, Sockets, spatially coupled LDPC codes, spatially-coupled LDPC codes
@article{Olmos2015bb,
title = {A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes},
author = {Pablo M Olmos and Rudiger Urbanke},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7086074},
doi = {10.1109/TIT.2015.2422816},
issn = {0018-9448},
year = {2015},
date = {2015-06-01},
journal = {IEEE Transactions on Information Theory},
volume = {61},
number = {6},
pages = {3164--3184},
abstract = {Spatially-coupled low-density parity-check (SC-LDPC) codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially coupled code ensembles when transmission takes place over the binary erasure channel. We discuss how the parameters of the scaling law are connected to fundamental quantities appearing in the asymptotic analysis of these ensembles and we verify that the predictions of the scaling law fit well to the data derived from simulations over a wide range of parameters. The ultimate goal of this line of research is to develop analytic tools for the design of SC-LDPC codes under practical constraints.},
keywords = {asymptotic analysis, asymptotic properties, binary erasure channel, Channel Coding, Codes on graphs, Couplings, Decoding, Differential equations, error probability, finite length performance, finite length spatially coupled code, finite-length code performance, finite-length performance, Iterative decoding, iterative decoding thresholds, Journal, parity check codes, Probability, SC-LDPC codes, scaling law, Sockets, spatially coupled LDPC codes, spatially-coupled LDPC codes},
pubstate = {published},
tppubtype = {article}
}
Spatially-coupled low-density parity-check (SC-LDPC) codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially coupled code ensembles when transmission takes place over the binary erasure channel. We discuss how the parameters of the scaling law are connected to fundamental quantities appearing in the asymptotic analysis of these ensembles and we verify that the predictions of the scaling law fit well to the data derived from simulations over a wide range of parameters. The ultimate goal of this line of research is to develop analytic tools for the design of SC-LDPC codes under practical constraints.
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}
}
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.
Yang, Wei; Durisi, Giuseppe; Koch, Tobias; Polyanskiy, Yury
Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength Artículo de revista
En: IEEE Transactions on Information Theory, vol. 60, no 7, pp. 4232–4265, 2014, ISSN: 0018-9448.
Resumen | Enlaces | BibTeX | Etiquetas: channel dispersion, Decoding, error probability, finite blocklength regime, MIMO, MIMO channel, outage probability, quasi-static fading channel, Rayleigh channels, Receivers, Transmitters
@article{Yang2014bb,
title = {Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength},
author = {Wei Yang and Giuseppe Durisi and Tobias Koch and Yury Polyanskiy},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6802432 http://arxiv.org/abs/1311.2012},
issn = {0018-9448},
year = {2014},
date = {2014-01-01},
journal = {IEEE Transactions on Information Theory},
volume = {60},
number = {7},
pages = {4232--4265},
publisher = {IEEE},
abstract = {This paper investigates the maximal achievable rate for a given blocklength and error probability over quasi-static multiple-input multiple-output fading channels, with and without channel state information at the transmitter and/or the receiver. The principal finding is that outage capacity, despite being an asymptotic quantity, is a sharp proxy for the finite-blocklength fundamental limits of slow-fading channels. Specifically, the channel dispersion is shown to be zero regardless of whether the fading realizations are available at both transmitter and receiver, at only one of them, or at neither of them. These results follow from analytically tractable converse and achievability bounds. Numerical evaluation of these bounds verifies that zero dispersion may indeed imply fast convergence to the outage capacity as the blocklength increases. In the example of a particular 1 $,times,$ 2 single-input multiple-output Rician fading channel, the blocklength required to achieve 90% of capacity is about an order of magnitude smaller compared with the blocklength required for an AWGN channel with the same capacity. For this specific scenario, the coding/decoding schemes adopted in the LTE-Advanced standard are benchmarked against the finite-blocklength achievability and converse bounds.},
keywords = {channel dispersion, Decoding, error probability, finite blocklength regime, MIMO, MIMO channel, outage probability, quasi-static fading channel, Rayleigh channels, Receivers, Transmitters},
pubstate = {published},
tppubtype = {article}
}
This paper investigates the maximal achievable rate for a given blocklength and error probability over quasi-static multiple-input multiple-output fading channels, with and without channel state information at the transmitter and/or the receiver. The principal finding is that outage capacity, despite being an asymptotic quantity, is a sharp proxy for the finite-blocklength fundamental limits of slow-fading channels. Specifically, the channel dispersion is shown to be zero regardless of whether the fading realizations are available at both transmitter and receiver, at only one of them, or at neither of them. These results follow from analytically tractable converse and achievability bounds. Numerical evaluation of these bounds verifies that zero dispersion may indeed imply fast convergence to the outage capacity as the blocklength increases. In the example of a particular 1 $,times,$ 2 single-input multiple-output Rician fading channel, the blocklength required to achieve 90% of capacity is about an order of magnitude smaller compared with the blocklength required for an AWGN channel with the same capacity. For this specific scenario, the coding/decoding schemes adopted in the LTE-Advanced standard are benchmarked against the finite-blocklength achievability and converse bounds.