Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 30
Encontrada(s) 1 página(s)

e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

A Derivation of the Source-Channel Error Exponent Using Nonidentical Product Distributions

  • Tauste Campo, Adrià
  • Vázquez Vilar, Gonzalo
  • Guillen i Fabregas, Albert
  • Koch, Tobias Mirco
  • Martinez, Alfonso
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., This work has been funded in part by the European Research Council (ERC) under grant agreement 259663; by the European Union under the 7th Framework Programme, grants FP7-PEOPLE-2009-IEF no. 252663, FP7-PEOPLE-2011-CIG no. 303633, FP7-PEOPLE-2012-CIG no. 333680, FP7-PEOPLE-2013-IEF no. 329837; and by the Spanish Ministry of Economy and Competitiveness under grants CSD2008-00010, TEC2009-14504-C02-01, TEC2012-38800-C03-01, TEC2012-38800-C03-03 and RYC-2011-08150. A. Tauste Campo acknowledges funding from an EPSRC (Engineering and Physical Sciences Research Council, UK) Doctoral Prize Award.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Nearest Neighbor Decoding and Pilot-Aided Channel Estimation for Fading Channels

  • Taufiq Asyhari, A.
  • Koch, Tobias Mirco
  • Guillén i Fàbregas, Albert
The material in this paper was presented in part at the 2011 IEEE International Symposium on Information Theory (ISIT), Saint Petersburg, Russia, 31 July-5 August 2011 and the 49th Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, USA, 28-30 September 2011., We study the information rates of noncoherent, stationary, Gaussian, and multiple-input multiple-output (MIMO) flat-fading channels that are achievable with nearest neighbor decoding and pilot-aided channel estimation. In particular, we investigate the behavior of these achievable rates in the limit as the signal-to-noise ratio (SNR) tends to infinity by analyzing the capacity pre-log, which is defined as the limiting ratio of the capacity to the logarithm of the SNR as the SNR tends to infinity. We demonstrate that a scheme estimating the channel using pilot symbols and detecting the message using nearest neighbor decoding (while assuming that the channel estimation is perfect) essentially achieves the capacity pre-log of noncoherent multiple-input single-output flat-fading channels, and it essentially achieves the best so far known lower bound on the capacity pre-log of noncoherent MIMO flat-fading channels. Extending the analysis to fading multiple-access channels reveals interesting relationships between the number of antennas and Doppler bandwidth in the comparative performance of joint transmission and time division multiple-access., The work of A.T.A was supported in part by the Yousef Jameel Scholarship at the University of Cambridge. T. K. received funding from the European's Seventh Framework Programme (FP7/2007-2013) under grant agreement No. 252663, from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement number 714161), and from the Spanish Ministerio de Economía y Competitividad under grant RYC-2014-16332. The work of A.G.i.F. has been funded by the European Research Council under ERC grant agreements 259663 and 725411.
Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

A complex-integration approach to the saddlepoint approximation for random-coding bounds

  • Martínez, Alfonso, 1973-
  • Scarlett, Jonathan
  • Dalai, Marco
  • Guillén i Fábregas, A. (Albert)
Comunicació presentada a: the 11th International Symposium on Wireless Communications Systems (ISWCS), celebrat a Barcelona del 26 al 29 d'agost de 2014, This paper derives a saddlepoint approximation for the random-coding bound to the error probability of channel coding by using complex-integration techniques. The approximation is given by a sum of two terms: one with Gallager’s exponent, and a second one with Arimoto’s strong converse exponent (above capacity) or the sphere-packing exponent (below the critical rate).
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

MIMO block-fading channels with mismatched CSI

  • Asyhari, A. Taufiq
  • Guillén i Fábregas, A. (Albert)
We study transmission over multiple-input multiple-output block-fading channels with imperfect channel state information (CSI) at both the transmitter and receiver. In particular, based on mismatched decoding theory for a fixed channel realization, we investigate the largest achievable rates with independent and identically distributed inputs and the nearest neighbor decoder. We then study the corresponding information outage probability in the high signal-to-noise ratio (SNR) regime and analyze the interplay between estimation error variances at the transmitter and receiver to determine the optimal outage exponent, defined as the high-SNR slope of the outage probability plotted in a logarithmic-logarithmic scale against the SNR. We demonstrate that despite operating with imperfect CSI, power adaptation can offer substantial gains in terms of outage exponent., A. T. Asyhari was supported in part by the Yousef Jameel Scholarship, University of Cambridge, Cambridge, U.K., and in part by the National Science Council of Taiwan under grant NSC 102-2218-E-009-001. A. Guillén i Fàbregas was supported in part by the European Research Council under ERC grant agreement 259663 and in part by the Spanish Ministry of Economy and Competitiveness under grant TEC2012-38800-C03-03.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Multi-class source-channel coding

  • Bocharova, Irina E.
  • Guillén i Fábregas, A. (Albert)
  • Kudryashov, Boris D.
  • Martínez, Alfonso, 1973-
  • Tauste Campo, Adrià, 1982-
  • Vazquez-Vilar, Gonzalo
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., This work was supported in part by the European Research Council under Grant 259663, in part by the Spanish Ministry of Economy and Competitiveness under Grant FPDI-2013-18602, Grant RYC-2011-08150, Grant TEC2012-38800-C03-03, and Grant TEC2013-41718-R, and in part by the European Union’s 7th Framework Programme under Grant 303633 and Grant 329837.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Expurgated random-coding ensembles: exponents, refinements and connections

  • Scarlett, Jonathan
  • Peng, Li
  • Merhav, Neri
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
This paper studies expurgated random-coding bounds and exponents for channel coding with a given (possibly suboptimal) decoding rule. Variations of Gallager's analysis are presented, yielding several asymptotic and nonasymptotic bounds on the error probability for an arbitrary codeword distribution. A simple nonasymptotic bound is shown to attain an exponent of Csiszár and Körner under constant-composition coding. Using Lagrange duality, this exponent is expressed in several forms, one of which is shown to permit a direct derivation via cost-constrained coding that extends to infinite and continuous alphabets. The method of type class enumeration is studied, and it is shown that this approach can yield improved exponents and better tightness guarantees for some codeword distributions. A generalization of this approach is shown to provide a multiletter exponent that extends immediately to channels with memory., This work was supported in part by the European Research Council under Grant 259663, in part by the European Union’s 7th Framework Programme under Grant 303633, and in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150 and Grant TEC2012-38800-C03-03. The work of N. Merhav was supported by the Israel Science Foundation under Grant 412/12.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Mismatched decoding: error exponents, second-order rates and saddlepoint approximations

  • Scarlett, Jonathan
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error exponents and second-order coding rates matching those of constant-composition random coding, while being directly applicable to channels with infinite or continuous alphabets. The number of auxiliary costs required to match the error exponents and second-order rates of constant-composition coding is studied, and is shown to be at most two. For independent identically distributed random coding, asymptotic estimates of two well-known non-asymptotic bounds are given using saddlepoint approximations. Each expression is shown to characterize the asymptotic behavior of the corresponding random-coding bound at both fixed and varying rates, thus unifying the regimes characterized by error exponents, second-order rates, and moderate deviations. For fixed rates, novel exact asymptotics expressions are obtained to within a multiplicative 1+o(1) term. Using numerical examples, it is shown that the saddlepoint approximations are highly accurate even at short block lengths., This work was supported in part by the European Research Council under Grant 259663, in part by the European Union’s 7th Framework Programme under Grant 303633, and in part by the Spanish Ministry of Economy and Competitiveness under Grants RYC-2011-08150 and TEC2012-38800-C03-03.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

A Derivation of the source-channel error exponent using nonidentical product distributions

  • Tauste Campo, Adrià, 1982-
  • Vazquez-Vilar, Gonzalo
  • Guillén i Fábregas, A. (Albert)
  • Koch, Tobias
  • Martínez, Alfonso, 1973-
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., This work was supported in part by the European Research Council under Grant 259663, in part by the European Union under the 7th Framework Programme under Grant FP7-PEOPLE-2009-IEF 252663, Grant FP7-PEOPLE-2011-CIG 303633, Grant FP7-PEOPLE-2012-CIG 333680, and Grant FP7-PEOPLE-2013-IEF 329837, and in part by the Spanish Ministry of Economy and Competitiveness under Grant CSD2008-00010, Grant TEC2009-14504-C02-01, Grant TEC2012-38800-C03-01, Grant TEC2012-38800-C03-03, and Grant RYC-2011-08150.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Extremes of error exponents

  • Guillén i Fábregas, A. (Albert)
  • Land, Ingmar
  • Martínez, Alfonso, 1973-
This paper determines the range of feasible values of standard error exponents for binary-input memoryless symmetric channels of fixed capacity C and shows that extremes are attained by the binary symmetric and the binary erasure channel. The proof technique also provides analogous extremes for other quantities related to Gallager's E 0 function, such as the cutoff rate, the Bhattacharyya parameter, and the channel dispersion., This work was supported in part by the International Joint Project 2008/R2 of the Royal Society, in part by the Australian Research Council under ARC Discovery Grant DP0986089, and in part by the European Research Council under ERC grant agreement 259663. A. Martinez was supported in part by the Ministry of Economy and Competitiveness (Spain) under Grant RYC-2011-08150 and in part by the European Union’s 7th Framework Programme (PEOPLE-2011-CIG) under Grant 303633.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Multiuser random coding techniques for mismatched decoding

  • Scarlett, Jonathan
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensemble average, and positive within the interior of Lapidoth's achievable rate region. This exponent proves the ensemble tightness of the exponent of Liu and Hughes in the case of maximum-likelihood decoding. An equivalent dual form of Lapidoth's achievable rate region is given, and the latter is shown to immediately extend to channels with infinite and continuous alphabets. In the setting of single-user mismatched decoding, similar analysis techniques are applied to a refined version of superposition coding, which is shown to achieve rates at least as high as standard superposition coding for any set of random-coding parameters., This work was supported in part by the European Union Seventh Framework Program under Grant 303633, in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150, and Grant TEC2012-38800-C03-03, and in part by the European Research Council under Grant 259663.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Bayesian M-Ary hypothesis testing: the meta-converse and Verdú-Han bounds are tight

  • Vazquez-Vilar, Gonzalo
  • Tauste Campo, Adrià, 1982-
  • Guillén i Fábregas, A. (Albert)
  • Martínez, Alfonso, 1973-
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., This work was supported in part by the European Research Council under Grant 259663, in part by the Spanish Ministry of Economy and Competitiveness under Grant FPDI-2013-18602, Grant RYC-2011-08150, and Grant TEC2012-38800-C03-03, and in part by the European Union’s 7th Framework Programme under Grant 303633 and Grant 329837.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Multiuser coding techniques for mismatched decoding

  • Scarlett, Jonathan
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
This paper studies multiuser coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, error exponents are obtained which are tight with respect to the ensemble average, and positive within the interior of Lapidoth’s achievable rate region. In the special case of maximum-likelihood decoding, the ensemble tightness of the exponent of Liu-Hughes is proved. Alternative expressions for the error exponents and rate regions are given, including expressions obtained using Lagrange duality which extend immediately to general alphabets. In the setting of single-user mismatched decoding, similar analysis techniques are applied to two types of superposition coding. The standard version is shown to yield an achievable rate which is at least as high as that of Lapidoth’s expurgated parallel coding rate after the optimization of the parameters. A refined version of superposition coding is shown to achieve rates at least as good as the standard version for any set of random-coding parameters, and it is shown that the gap between the two can be significant when the input distribution is fixed., This work was supported in part by the European Union Seventh Framework Program under Grant 303633, in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150, and Grant TEC2012-38800-C03-03, and in part by the European Research Council under Grant 259663.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Mismatched multi-letter successive decoding for the multiple-access channel

  • Scarlett, Jonathan
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
This paper studies channel coding for the discrete memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. A multi-letter successive decoding rule depending on an arbitrary non-negative decoding metric is considered, and achievable rate regions and error exponents are derived both for the standard MAC (independent codebooks), and for the cognitive MAC (one user knows both messages) with superposition coding. In the cognitive case, the rate region and error exponent are shown to be tight with respect to the ensemble average. The rate regions are compared with those of the commonly considered decoder that chooses the message pair maximizing the decoding metric, and numerical examples are given for which successive decoding yields a strictly higher sum rate for a given pair of input distributions., This work was supported in part by the European Research Council through ERC under Grant 259663 and Grant 725411, in part by the European Union’s 7th Framework Programme under Grant 303633, and in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150, Grant TEC2012-38800-C03-03, and Grant TEC2016-78434-C3-1-R
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Second-order rate region of constant-composition codes for the multiple-access channel

  • Scarlett, Jonathan
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel (MAC) with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of Hoeffding's combinatorial central limit theorem, an inner bound on the set of locally achievable second-order coding rates is given for each point on the boundary of the capacity region. It is shown that the inner bound for constant-composition random coding includes that recovered by independent identically distributed random coding, and that the inclusion may be strict. The inner bound is extended to the Gaussian MAC via an increasingly fine quantization of the inputs., This work was supported in part by the European Research Council under Grant 259663, in part by the European Union’s 7th Framework Programme under Grant 303633, and in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150 and Grant TEC2012-38800-C03-03.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

A Counter-example to the mismatched decoding converse for binary-input discrete memoryless channels

  • Scarlett, Jonathan
  • Somekh-Baruch, Anelia
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
This paper studies the mismatched decoding problem for binary-input discrete memoryless channels. An example is provided for which an achievable rate based on superposition coding exceeds the Csiszár-Körner-Hui rate, thus providing a counter-example to a previously reported converse result. Both numerical evaluations and theoretical results are used in establishing this claim., This work was supported in part by the European Union Seventh Framework Programme under Grant 303633, in part by the European Research Council under Grant 259663, in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150 and Grant TEC2012-38800-C03-03, and in part by the Israel Science Foundation under Grant 2013/919.
Repositorio Digital de la UPF
Publicación Contribución de congreso (ConferenceOutput)

Asymptotics of the error probability in quasi-static binary symmetric channels

  • Font-Segura, Josep
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
Comunicació presentada a 2017 IEEE International Symposium on Information Theory (ISIT), celebrada del 25 al 30 de juny de 2017 a Aachen, Alemania., This paper provides an asymptotic expansion of the error probability, as the codeword length n goes to infinity, in quasi-static binary symmetric channels. After the leading term, namely the outage probability, the next two terms are found to be proportional to log n n and 1 n respectively. Explicit characterizations of the respective coefficients are given. The resulting expansion gives an approximation to the random-coding union bound, accurate even at small codeword lengths., This work has been funded in part by the European Research Council under ERC grant agreement 259663 and by the Spanish Ministry of Economy and Competitiveness under grants RYC-2011-08150, FJCI-2014-22747, and TEC2016-78434-C3-1-R.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Asymptotics of the error probability in quasi-static binary symmetric channels

  • Font-Segura, Josep
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
Comunicació presentada a 2017 IEEE International Symposium on Information Theory (ISIT), celebrada del 25 al 30 de juny de 2017 a Aachen, Alemania., This paper provides an asymptotic expansion of the error probability, as the codeword length n goes to infinity, in quasi-static binary symmetric channels. After the leading term, namely the outage probability, the next two terms are found to be proportional to log n n and 1 n respectively. Explicit characterizations of the respective coefficients are given. The resulting expansion gives an approximation to the random-coding union bound, accurate even at small codeword lengths., This work has been funded in part by the European Research Council under ERC grant agreement 259663 and by the Spanish Ministry of Economy and Competitiveness under grants RYC-2011-08150, FJCI-2014-22747, and TEC2016-78434-C3-1-R.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

A complex-integration approach to the saddlepoint approximation for random-coding bounds

  • Martínez, Alfonso, 1973-
  • Scarlett, Jonathan
  • Dalai, Marco
  • Guillén i Fábregas, A. (Albert)
Comunicació presentada a: the 11th International Symposium on Wireless Communications Systems (ISWCS), celebrat a Barcelona del 26 al 29 d'agost de 2014, This paper derives a saddlepoint approximation for the random-coding bound to the error probability of channel coding by using complex-integration techniques. The approximation is given by a sum of two terms: one with Gallager’s exponent, and a second one with Arimoto’s strong converse exponent (above capacity) or the sphere-packing exponent (below the critical rate).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A Derivation of the source-channel error exponent using nonidentical product distributions

  • Tauste Campo, Adrià, 1982-
  • Vazquez-Vilar, Gonzalo
  • Guillén i Fábregas, A. (Albert)
  • Koch, Tobias
  • Martínez, Alfonso, 1973-
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., This work was supported in part by the European Research Council under Grant 259663, in part by the European Union under the 7th Framework Programme under Grant FP7-PEOPLE-2009-IEF 252663, Grant FP7-PEOPLE-2011-CIG 303633, Grant FP7-PEOPLE-2012-CIG 333680, and Grant FP7-PEOPLE-2013-IEF 329837, and in part by the Spanish Ministry of Economy and Competitiveness under Grant CSD2008-00010, Grant TEC2009-14504-C02-01, Grant TEC2012-38800-C03-01, Grant TEC2012-38800-C03-03, and Grant RYC-2011-08150.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Multiuser coding techniques for mismatched decoding

  • Scarlett, Jonathan
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
This paper studies multiuser coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, error exponents are obtained which are tight with respect to the ensemble average, and positive within the interior of Lapidoth’s achievable rate region. In the special case of maximum-likelihood decoding, the ensemble tightness of the exponent of Liu-Hughes is proved. Alternative expressions for the error exponents and rate regions are given, including expressions obtained using Lagrange duality which extend immediately to general alphabets. In the setting of single-user mismatched decoding, similar analysis techniques are applied to two types of superposition coding. The standard version is shown to yield an achievable rate which is at least as high as that of Lapidoth’s expurgated parallel coding rate after the optimization of the parameters. A refined version of superposition coding is shown to achieve rates at least as good as the standard version for any set of random-coding parameters, and it is shown that the gap between the two can be significant when the input distribution is fixed., This work was supported in part by the European Union Seventh Framework Program under Grant 303633, in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150, and Grant TEC2012-38800-C03-03, and in part by the European Research Council under Grant 259663.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Mismatched multi-letter successive decoding for the multiple-access channel

  • Scarlett, Jonathan
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
This paper studies channel coding for the discrete memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. A multi-letter successive decoding rule depending on an arbitrary non-negative decoding metric is considered, and achievable rate regions and error exponents are derived both for the standard MAC (independent codebooks), and for the cognitive MAC (one user knows both messages) with superposition coding. In the cognitive case, the rate region and error exponent are shown to be tight with respect to the ensemble average. The rate regions are compared with those of the commonly considered decoder that chooses the message pair maximizing the decoding metric, and numerical examples are given for which successive decoding yields a strictly higher sum rate for a given pair of input distributions., This work was supported in part by the European Research Council through ERC under Grant 259663 and Grant 725411, in part by the European Union’s 7th Framework Programme under Grant 303633, and in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150, Grant TEC2012-38800-C03-03, and Grant TEC2016-78434-C3-1-R
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Mismatched decoding: error exponents, second-order rates and saddlepoint approximations

  • Scarlett, Jonathan
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error exponents and second-order coding rates matching those of constant-composition random coding, while being directly applicable to channels with infinite or continuous alphabets. The number of auxiliary costs required to match the error exponents and second-order rates of constant-composition coding is studied, and is shown to be at most two. For independent identically distributed random coding, asymptotic estimates of two well-known non-asymptotic bounds are given using saddlepoint approximations. Each expression is shown to characterize the asymptotic behavior of the corresponding random-coding bound at both fixed and varying rates, thus unifying the regimes characterized by error exponents, second-order rates, and moderate deviations. For fixed rates, novel exact asymptotics expressions are obtained to within a multiplicative 1+o(1) term. Using numerical examples, it is shown that the saddlepoint approximations are highly accurate even at short block lengths., This work was supported in part by the European Research Council under Grant 259663, in part by the European Union’s 7th Framework Programme under Grant 303633, and in part by the Spanish Ministry of Economy and Competitiveness under Grants RYC-2011-08150 and TEC2012-38800-C03-03.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Multiuser random coding techniques for mismatched decoding

  • Scarlett, Jonathan
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensemble average, and positive within the interior of Lapidoth's achievable rate region. This exponent proves the ensemble tightness of the exponent of Liu and Hughes in the case of maximum-likelihood decoding. An equivalent dual form of Lapidoth's achievable rate region is given, and the latter is shown to immediately extend to channels with infinite and continuous alphabets. In the setting of single-user mismatched decoding, similar analysis techniques are applied to a refined version of superposition coding, which is shown to achieve rates at least as high as standard superposition coding for any set of random-coding parameters., This work was supported in part by the European Union Seventh Framework Program under Grant 303633, in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150, and Grant TEC2012-38800-C03-03, and in part by the European Research Council under Grant 259663.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

MIMO block-fading channels with mismatched CSI

  • Asyhari, A. Taufiq
  • Guillén i Fábregas, A. (Albert)
We study transmission over multiple-input multiple-output block-fading channels with imperfect channel state information (CSI) at both the transmitter and receiver. In particular, based on mismatched decoding theory for a fixed channel realization, we investigate the largest achievable rates with independent and identically distributed inputs and the nearest neighbor decoder. We then study the corresponding information outage probability in the high signal-to-noise ratio (SNR) regime and analyze the interplay between estimation error variances at the transmitter and receiver to determine the optimal outage exponent, defined as the high-SNR slope of the outage probability plotted in a logarithmic-logarithmic scale against the SNR. We demonstrate that despite operating with imperfect CSI, power adaptation can offer substantial gains in terms of outage exponent., A. T. Asyhari was supported in part by the Yousef Jameel Scholarship, University of Cambridge, Cambridge, U.K., and in part by the National Science Council of Taiwan under grant NSC 102-2218-E-009-001. A. Guillén i Fàbregas was supported in part by the European Research Council under ERC grant agreement 259663 and in part by the Spanish Ministry of Economy and Competitiveness under grant TEC2012-38800-C03-03.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Multi-class source-channel coding

  • Bocharova, Irina E.
  • Guillén i Fábregas, A. (Albert)
  • Kudryashov, Boris D.
  • Martínez, Alfonso, 1973-
  • Tauste Campo, Adrià, 1982-
  • Vazquez-Vilar, Gonzalo
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., This work was supported in part by the European Research Council under Grant 259663, in part by the Spanish Ministry of Economy and Competitiveness under Grant FPDI-2013-18602, Grant RYC-2011-08150, Grant TEC2012-38800-C03-03, and Grant TEC2013-41718-R, and in part by the European Union’s 7th Framework Programme under Grant 303633 and Grant 329837.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Expurgated random-coding ensembles: exponents, refinements and connections

  • Scarlett, Jonathan
  • Peng, Li
  • Merhav, Neri
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
This paper studies expurgated random-coding bounds and exponents for channel coding with a given (possibly suboptimal) decoding rule. Variations of Gallager's analysis are presented, yielding several asymptotic and nonasymptotic bounds on the error probability for an arbitrary codeword distribution. A simple nonasymptotic bound is shown to attain an exponent of Csiszár and Körner under constant-composition coding. Using Lagrange duality, this exponent is expressed in several forms, one of which is shown to permit a direct derivation via cost-constrained coding that extends to infinite and continuous alphabets. The method of type class enumeration is studied, and it is shown that this approach can yield improved exponents and better tightness guarantees for some codeword distributions. A generalization of this approach is shown to provide a multiletter exponent that extends immediately to channels with memory., This work was supported in part by the European Research Council under Grant 259663, in part by the European Union’s 7th Framework Programme under Grant 303633, and in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150 and Grant TEC2012-38800-C03-03. The work of N. Merhav was supported by the Israel Science Foundation under Grant 412/12.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A Counter-example to the mismatched decoding converse for binary-input discrete memoryless channels

  • Scarlett, Jonathan
  • Somekh-Baruch, Anelia
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
This paper studies the mismatched decoding problem for binary-input discrete memoryless channels. An example is provided for which an achievable rate based on superposition coding exceeds the Csiszár-Körner-Hui rate, thus providing a counter-example to a previously reported converse result. Both numerical evaluations and theoretical results are used in establishing this claim., This work was supported in part by the European Union Seventh Framework Programme under Grant 303633, in part by the European Research Council under Grant 259663, in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150 and Grant TEC2012-38800-C03-03, and in part by the Israel Science Foundation under Grant 2013/919.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Second-order rate region of constant-composition codes for the multiple-access channel

  • Scarlett, Jonathan
  • Martínez, Alfonso, 1973-
  • Guillén i Fábregas, A. (Albert)
This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel (MAC) with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of Hoeffding's combinatorial central limit theorem, an inner bound on the set of locally achievable second-order coding rates is given for each point on the boundary of the capacity region. It is shown that the inner bound for constant-composition random coding includes that recovered by independent identically distributed random coding, and that the inclusion may be strict. The inner bound is extended to the Gaussian MAC via an increasingly fine quantization of the inputs., This work was supported in part by the European Research Council under Grant 259663, in part by the European Union’s 7th Framework Programme under Grant 303633, and in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150 and Grant TEC2012-38800-C03-03.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Bayesian M-Ary hypothesis testing: the meta-converse and Verdú-Han bounds are tight

  • Vazquez-Vilar, Gonzalo
  • Tauste Campo, Adrià, 1982-
  • Guillén i Fábregas, A. (Albert)
  • Martínez, Alfonso, 1973-
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., This work was supported in part by the European Research Council under Grant 259663, in part by the Spanish Ministry of Economy and Competitiveness under Grant FPDI-2013-18602, Grant RYC-2011-08150, and Grant TEC2012-38800-C03-03, and in part by the European Union’s 7th Framework Programme under Grant 303633 and Grant 329837.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Extremes of error exponents

  • Guillén i Fábregas, A. (Albert)
  • Land, Ingmar
  • Martínez, Alfonso, 1973-
This paper determines the range of feasible values of standard error exponents for binary-input memoryless symmetric channels of fixed capacity C and shows that extremes are attained by the binary symmetric and the binary erasure channel. The proof technique also provides analogous extremes for other quantities related to Gallager's E 0 function, such as the cutoff rate, the Bhattacharyya parameter, and the channel dispersion., This work was supported in part by the International Joint Project 2008/R2 of the Royal Society, in part by the Australian Research Council under ARC Discovery Grant DP0986089, and in part by the European Research Council under ERC grant agreement 259663. A. Martinez was supported in part by the Ministry of Economy and Competitiveness (Spain) under Grant RYC-2011-08150 and in part by the European Union’s 7th Framework Programme (PEOPLE-2011-CIG) under Grant 303633.