Pasar al contenido principal

Resultados relacionados

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

e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

On LDPC Code Ensembles with Generalized Constraints

  • Liu, Yanfang
  • Martínez Olmos, Pablo
  • Koch, Tobias Mirco
Proceeding of: 2017 IEEE International Symposium on Information Theory, Aachen, Germany, 25-30 June, 2017, In this paper, we analyze the tradeoff between coding rate and asymptotic performance of a class of generalized low-density parity-check (GLDPC) codes constructed by including a certain fraction of generalized constraint (GC) nodes in the graph. The rate of the GLDPC ensemble is bounded using classical results on linear block codes, namely Hamming bound and Varshamov bound. We also study the impact of the decoding method used at GC nodes. To incorporate both bounded-distance (BD) and Maximum Likelihood (ML) decoding at GC nodes into our analysis without having to resort on multi-edge type of degree distributions (DDs), we propose the probabilistic peeling decoder (P-PD) algorithm, which models the decoding step at every GC node as an instance of a Bernoulli random variable with a success probability that depends on the GC block code and its decoding algorithm. The P-PD asymptotic performance over the BEC can be efficiently predicted using standard techniques for LDPC codes such as density evolution (DE) or the differential equation method. Furthermore, for a class of GLDPC ensembles, we demonstrate that the simulated P-PD performance accurately predicts the actual performance of the GLPDC code. We illustrate our analysis for GLDPC code ensembles using (2, 6) and (2,15) base DDs. In all cases, we show that a large fraction of GC nodes is required to reduce the original gap to capacity., This work has been funded in part by the Spanish Ministerio de Economía y Competitividad and the Agencia Española de Investigación under Grant TEC2016-78434-C3-3-R (AEI/FEDER, EU) and by the Comunidad de Madrid in Spain under Grant S2103/ICE-2845. T. Koch has further received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161), from the 7th European Union Framework Programme under Grant 333680, and from the Spanish Ministerio de Economía y Competitividad under Grants TEC2013-41718-R and RYC-2014-16332. Pablo M. Olmos has further received funding from the Spanish Ministerio de Economía y Competitividad under Grant IJCI-2014-19150.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

On Single-Antenna Rayleigh Block-Fading Channels at Finite Blocklength

  • Lancho Serrano, Alejandro
  • Koch, Tobias Mirco
  • Durisi, Giuseppe
This article concerns the maximum coding rate at which data can be transmitted over a noncoherent, single-antenna, Rayleigh block-fading channel using an error-correcting code of a given blocklength with a block-error probability not exceeding a given value. A high-SNR normal approximation of the maximum coding rate is presented that becomes accurate as the signal-to-noise ratio (SNR) and the number of coherence intervals $L$ over which we code tend to infinity. Numerical analyses suggest that the approximation is accurate at SNR values above 15dB and when the number of coherence intervals is 10 or more., The work of A. Lancho and T. Koch was supported in part by the Spanish Ministerio de Economia y Competitividad under Grant TEC2013-41718-R and Grant TEC2016-78434-C3-3-R (AEI/FEDER, EU), in part by the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme under Grant 714161, and in part by the Comunidad de Madrid under Grant S2103/ICE-2845. The work of A. Lancho further was supported by an FPU fellowship from the Spanish Ministerio de Educación, Cultura y Deporte under Grant FPU14/01274. The work of T. Koch further was supported in part by the Spanish Ministerio de Economía y Competitividad under Grant RYC-2014-16332 and in part by the 7th European Union Framework Programme under Grant 333680. The work of G. Durisi was supported by the Swedish Research Council under Grant 2012-4571 and Grant 2016-03293.
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)

Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength

  • Yang, Wei
  • Durisi, Giuseppe
  • Koch, Tobias Mirco
  • Polyanskiy, Yury
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 × 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., This work was supported in part by the Swedish Research Council under grant 2012-4571, by the Ericsson Research Foundation under grant FOSTIFT- 12:022, by a Marie Curie FP7 Integration Grant within the 7th European Union Framework Programme under Grant 333680, by the Spanish government (TEC2009-14504-C02-01, CSD2008-00010, and TEC2012-38800-C03-01), and by the National Science Foundation under Grant CCF-1253205. The material of this paper was presented in part at the 2013 and 2014 IEEE International Symposium on Information Theory.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

A Probabilistic Peeling Decoder to Efficiently Analyze Generalized LDPC Codes Over the BEC

  • Liu, Yanfang
  • Martínez Olmos, Pablo
  • Koch, Tobias Mirco
In this paper, we analyze the tradeoff between coding rate and asymptotic performance of a class of generalized low-density parity-check (GLDPC) codes constructed by including a certain fraction of generalized constraint (GC) nodes in the graph. The rate of the GLDPC ensemble is bounded using classical results on linear block codes, namely, Hamming bound and Varshamov bound. We also study the impact of the decoding method used at GC nodes. To incorporate both bounded-distance (BD) and maximum likelihood (ML) decoding at GC nodes into our analysis without resorting on multi-edge type of degree distributions (DDs), we propose the probabilistic peeling decoding (P-PD) algorithm, which models the decoding step at every GC node as an instance of a Bernoulli random variable with a successful decoding probability that depends on both the GC block code and its decoding algorithm. The P-PD asymptotic performance over the BEC can be efficiently predicted using standard techniques for LDPC codes such as density evolution (DE) or the differential equation method. Furthermore, for a class of GLDPC ensembles, we demonstrate that the simulated P-PD performance accurately predicts the actual performance of the GLPDC code under ML decoding at GC nodes. We illustrate our analysis for GLDPC code ensembles with regular and irregular DDs. In all cases, we show that a large fraction of GC nodes is required to reduce the original gap to capacity, but the optimal fraction is strictly smaller than one. We then consider techniques to further reduce the gap to capacity by means of random puncturing, and the inclusion of a certain fraction of generalized variable nodes in the graph., This work was supported in part by the Spanish Ministerio de Economía y Competitividad and the Agencia Española de Investigación under Grant TEC2016-78434-C3-3-R (AEI/FEDER, EU) and in part by the Comunidad de Madrid in Spain under Grant S2103/ICE-2845, Grant IND2017/TIC-7618, Grant IND2018/TIC-9649, and Grant Y2018/TCS-4705. P. M. Olmos was further supported by the Spanish Ministerio de Economía y Competitividad under Grant IJCI-2014-19150. T. Koch was further supported by the European Research Council (ERC) through the European Union’s Horizon 2020 research and innovation programme under Grant 714161, by the 7th European Union Framework Programme under Grant 333680, and by the Spanish Ministerio de Economía y Competitividad under Grant TEC2013- 41718-R and Grant RYC-2014-16332.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

On the Information Dimension of Stochastic Processes

  • Geiger, Bernhard C.
  • Koch, Tobias Mirco
In 1959, Rényi proposed the information dimension and the d-dimensional entropy to measure the information content of general random variables. This paper proposes a generalization of information dimension to stochastic processes by defining the information dimension rate as the entropy rate of the uniformly quantized stochastic process divided by minus the logarithm of the quantizer step size 1/m in the limit as m to infty. It is demonstrated that the information dimension rate coincides with the rate-distortion dimension, defined as twice the rate-distortion function R(D) of the stochastic process divided by -log (D) in the limit as D downarrow 0 . It is further shown that among all multivariate stationary processes with a given (matrix-valued) spectral distribution function (SDF), the Gaussian process has the largest information dimension rate and the information dimension rate of multivariate stationary Gaussian processes is given by the average rank of the derivative of the SDF. The presented results reveal that the fundamental limits of almost zero-distortion recovery via compressible signal pursuit and almost lossless analog compression are different in general., The work of Bernhard C. Geiger has partly been funded by the Erwin Schrödinger Fellowship J 3765 of the Austrian Science Fund and by the German Ministry of Education and Research in the framework of an Alexander von Humboldt Professorship. The Know-Center is funded within the Austrian COMET Program - Competence Centers for Excellent Technologies - under the auspices of the Austrian Federal Ministry of Transport, Innovation and Technology, the Austrian Federal Ministry of Digital and Economic Affairs, and by the State of Styria. COMET is managed by the Austrian Research Promotion Agency FFG. The work of Tobias Koch has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161), from the 7th European Union Framework Programme under Grant 333680, from the Ministerio de EconomÍa y Competitividad of Spain under Grants TEC2013-41718-R, RYC-2014-16332, and TEC2016-78434-C3-3-R (AEI/FEDER, EU), and from the Comunidad de Madrid under Grant S2103/ICE-2845.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

High-SNR Asymptotics of Mutual Information for Discrete Constellations with Applications to BICM

  • Alvarado, Alex
  • Brännström, Fredrik
  • Agrell, Erik
  • Koch, Tobias Mirco
Asymptotic expressions of the mutual information between any discrete input and the corresponding output of the scalar additive white Gaussian noise channel are presented in the limit as the signal-to-noise ratio (SNR) tends to infinity. Asymptotic expressions of the symbol-error probability (SEP) and the minimum mean-square error (MMSE) achieved by estimating the channel input given the channel output are also developed. It is shown that for any input distribution, the conditional entropy of the channel input given the output, MMSE, and SEP have an asymptotic behavior proportional to the Gaussian Q-function. The argument of the Q-function depends only on the minimum Euclidean distance (MED) of the constellation and the SNR, and the proportionality constants are functions of the MED and the probabilities of the pairs of constellation points at MED. The developed expressions are then generalized to study the high-SNR behavior of the generalized mutual information (GMI) for bit-interleaved coded modulation (BICM). By means of these asymptotic expressions, the long-standing conjecture that Gray codes are the binary labelings that maximize the BICM-GMI at high SNR is proven. It is further shown that for any equally spaced constellation whose size is a power of two, there always exists an anti-Gray code giving the lowest BICM-GMI at high SNR., Research supported by the European Community’s Seventh’s Framework Programme (FP7/2007-2013) under grant agreements No. 271986 and No. 333680, by the Swedish Research Council, Sweden (under grants #621-2006-4872 and #621-2011-5950) and by the Ministerio de Economía y Competitividad of Spain (TEC2009-14504-C02-01, CSD2008-00010, and TEC2012-38800-C03-01).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Short-Packet Communications over Multiple-Antenna Rayleigh-Fading Channels

  • Durisi, Giuseppe
  • Koch, Tobias Mirco
  • Östman, Johan
  • Polyanskiy, Yury
  • Yang, Wei
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.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

A high-SNR normal approximation for single-antenna Rayleigh block-fading channels

  • Lancho Serrano, Alejandro
  • Koch, Tobias Mirco
  • Durisi, Giuseppe
Proceeding of: 2017 IEEE International Symposium on Information Theory, Aachen, Germany, 25-30 June, 2017, This paper concerns the maximal achievable rate at which data can be transmitted over a non-coherent, single-antenna, Rayleigh block-fading channel using an error-correcting code of a given blocklength with a block-error probability not exceeding a given value. In particular, a high-SNR normal approximation of the maximal achievable rate is presented that becomes accurate as the signal-to-noise ratio (SNR) and the number of coherence intervals L over which we code tend to infinity. Numerical analyses suggest that the approximation is accurate already at SNR values of 15 dB., A. Lancho and T. Koch have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161), from the 7th European Union Framework Programme under Grant 333680, from the Spanish Ministerio de Economía y Competitividad under Grants TEC2013-41718-R, RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU), from an FPU fellowship from the Spanish Ministerio de Educación, Cultura y Deporte under Grant FPU14/01274 and from the Comunidad de Madrid under Grant S2103/ICE-2845. G. Durisi has been supported by the Swedish Research Council under Grants 2012-4571 and 2016-03293.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

On the information dimension rate of stochastic processes

  • Geiger, Bernhard C.
  • Koch, Tobias Mirco
Proceeding of: 2017 IEEE International Symposium on Information Theory, Aachen, Germany, 25-30 June 2017, Jalali and Poor ("Universal compressed sensing," arXiv:1406.7807v3, Jan. 2016) have recently proposed a generalization of Rényi's information dimension to stationary stochastic processes by defining the information dimension of the stochastic process as the information dimension of k samples divided by k in the limit as k →∞ to. This paper proposes an alternative definition of information dimension as the entropy rate of the uniformly-quantized stochastic process divided by minus the logarithm of the quantizer step size 1/m in the limit as m →∞ ; to. It is demonstrated that both definitions are equivalent for stochastic processes that are ψ*-mixing, but that they may differ in general. In particular, it is shown that for Gaussian processes with essentially-bounded power spectral density (PSD), the proposed information dimension equals the Lebesgue measure of the PSD's support. This is in stark contrast to the information dimension proposed by Jalali and Poor, which is 1 if the process's PSD is positive on a set of positive Lebesgue measure, irrespective of its support size., The work of Bernhard C. Geiger has been funded by the Erwin Schrödinger Fellowship J 3765 of the Austrian Science Fund and by the German Ministry of Education and Research in the framework of an Alexander von Humboldt Professorship. The work of Tobias Koch has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161), from the 7th European Union Framework Programme under Grant 333680, from the Spanish Ministerio de Economía y Competitividad under Grants TEC2013- 41718-R, RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU), and from the Comunidad de Madrid under Grant S2103/ICE-2845.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

Towards Massive, Ultrareliable, and Low-Latency Wireless Communication with Short Packets

  • Durisi, Giuseppe
  • Koch, Tobias Mirco
  • Popovski, Petar
Most of the recent advances in the design of high-speed wireless systems are based on information-theoretic principles that demonstrate how to efficiently transmit long data packets. However, the upcoming wireless systems, notably the fifth-generation (5G) system, will need to support novel traffic types that use short packets. For example, short packets represent the most common form of traffic generated by sensors and other devices involved in machine-to-machine (M2M) communications. Furthermore, there are emerging applications in which small packets are expected to carry critical information that should be received with low latency and ultrahigh reliability. Current wireless systems are not designed to support short-packet transmissions. For example, the design of current systems relies on the assumption that the metadata (control information) is of negligible size compared to the actual information payload. Hence, transmitting metadata using heuristic methods does not affect the overall system performance. However, when the packets are short, metadata may be of the same size as the payload, and the conventional methods to transmit it may be highly suboptimal. In this paper, we review recent advances in information theory, which provide the theoretical principles that govern the transmission of short packets. We then apply these principles to three exemplary scenarios (the two-way channel, the downlink broadcast channel, and the uplink random access channel), thereby illustrating how the transmission of control information can be optimized when the packets are short. The insights brought by these examples suggest that new principles are needed for the design of wireless protocols supporting short packets. These principles will have a direct impact on the system design., The work of G. Durisi has been in part supported by the Swedish Research Council under Grant 2012-4571. The work of T. Koch has been supported in part by the European Community’s Seventh Framework Programme FP7/2007-2013 under Grant 333680, in part by the Ministerio de Economía y Competitividad of Spain under Grants TEC2013-41718-R, RYC-2014-16332, and TEC2015-69648-REDC, and in part by the Comunidad de Madrid under Grant S2013/ICE-2845. The work of P. Popovski has been in part supported by the European Research Council (ERC Consolidator Grant Nr. 648382 WILLOW) within the Horizon 2020 Program. The simulations were performed in part on resources at Chalmers Centre for Computational Science and Engineering (C3SE) provided by the Swedish National Infrastructure for Computing (SNIC).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Artículo científico (JournalArticle)

A Rigorous Approach to High-Resolution Entropy-Constrained Vector Quantization

  • Koch, Tobias Mirco
  • Vázquez Vilar, Gonzalo
The nonnegativity of relative entropy implies that the differential entropy of a random vector X with probability density function (pdf) f is upper-bounded by -E[log g(X)]for any arbitrary pdf g. Using this inequality with a cleverly chosen g, we derive a lower bound on the asymptotic excess rate of entropy-constrained vector quantization for d-dimensional sources and rth-power distortion, where the asymptotic excess rate is defined as the difference between the smallest output entropy of a vector quantizer satisfying the distortion constraint and the rate-distortion function in the limit as the distortion tends to zero. Specialized to the one-dimensional case, this lower bound coincides with the asymptotic excess rate achieved by a uniform quantizer, thereby recovering the result by Gish and Pierce that uniform quantizers are asymptotically optimal as the allowed distortion tends to zero. Furthermore, in the one-dimensional case, the derivation of the lower bound reveals a necessary condition for a sequence of quantizers to be asymptotically optimal. This condition implies that any sequence of asymptotically optimal almost-regular quantizers must converge to a uniform quantizer as the distortion tends to zero. While the obtained lower bound itself is not novel, to the best of our knowledge, we present the first rigorous derivation that follows the direct approach by Gish and Pierce without resorting to heuristic high-resolution approximations commonly found in the quantization literature. Furthermore, our derivation holds for all d-dimensional sources having finite differential entropy and whose integer part has finite entropy. In contrast to Gish and Pierce, we do not require additional constraints on the continuity or decay of the source pdf., This work has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161), from the 7th European Union Framework Programme under Grant 333680, from the Ministerio de Economía y Competitividad of Spain under Grants TEC2013-41718-R, RYC-2014-16332, IJCI-2015-27020, TEC2015-69648-REDC, and TEC2016-78434-C3-3-R (AEI/FEDER, EU), and from the Comunidad de Madrid under Grant S2103/ICE-2845. The material in this paper was presented in part at the 2016 IEEE International Symposium on Information Theory, Barcelona, Spain, July 2016.
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.
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.