Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 21
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 Contribución de congreso (ConferenceOutput)

Bursty Wireless Networks of Bounded Capacity

  • Villacrés Estrada, Grace Silvana
  • Koch, Tobias Mirco
  • Vázquez Vilar, Gonzalo
Proceeding of: 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 21-26 June 2020, The channel capacity of wireless networks Is often studied under the assumption that the communicating nodes have perfect channel-state information and that interference is always present. In this paper, we study the channel capacity of a wireless network without these assumptions, i.e., a bursty noncoherent wireless network where the users are grouped in cells and the base-station features several receive antennas. We demonstrate that the channel capacity is bounded in the signal-to-noise ratio (SNR) when the number of receive antennas is finite and the probability of presence of interference is strictly positive., This work has been supported in part by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant No. 714161), and by the Spanish Ministerio de Economía y Competitividad under Grants RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Scaling laws for many-access channels and unsourced random access

  • Ravikumaran Nair, Jithin
  • Koch, Tobias Mirco
Proceeding of: 55th Asilomar Conference on Signals, Systems, and Computers, October 31 - November 3, 2021 Pacific Grove, California, USA., In the emerging Internet of Things, a massive number of devices may connect to one common receiver. Consequently, models that study this setting are variants of the classical multiple-access channel where the number of users grows with the blocklength. Roughly, these models can be classified into three groups based on two criteria: the notion of probability of error and whether users use the same codebook. The first group follows the classical notion of probability of error and assumes that users use different codebooks. In the second group, users use different codebooks, but a new notion of probability of error called per-user probability of error is considered. The third group considers the per-user probability of error and that users are restricted to use the same codebook. This group is also known as unsourced random access. For the first and second groups of models, scaling laws that describe the capacity per unit-energy as a function of the order of growth of users were characterized by Ravi and Koch (arxiv.org/abs/2012.10350). In this paper, we first review these results. We then present scaling laws for the third group of models, i.e., unsourced random access., J. Ravi and T. Koch have received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant No. 714161). T. Koch has further received funding from the Spanish Ministerio de Ciencia e Innovación under Grant PID2020-116683GB-C21 / AEI / 10.13039/501100011033.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

A High-SNR Normal Approximation for MIMO Rayleigh Block-Fading Channels

  • Qi, Chao
  • Koch, Tobias Mirco
Proceeding of: 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 21-26 June 2020, This paper concerns the maximum coding rate at which a code of given blocklength can be transmitted with a given block-error probability over a non-coherent Rayleigh block-fading channel with multiple transmit and receive antennas (MIMO). In particular, a high-SNR normal approximation of the maximum coding rate is presented, which is proved to become accurate as the signal-to-noise ratio (SNR) and the number of coherence intervals L tend to infinity., C. Qi and T. Koch have received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant No. 714161). T. Koch has further received funding from the Spanish Ministerio de Economía y Competitividad under Grants RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU)
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Second-order asymptotics of Hoeffding-like hypothesis tests

  • Kallumadatil Velluva, Harsha
  • Ravikumaran Nair, Jithin
  • Koch, Tobias Mirco
Proceedings of: 2022 IEEE Information Theory Workshop (ITW), 01-09 November 2022, Mumbai, India., We consider a binary statistical hypothesis testing problem, where n independent and identically distributed random variables Z^n are either distributed according to the none hypothesis P or the alternate hypothesis Q, and only P is known. For this problem, a well-known test is the Hoeffding test, which accepts P if the Kullback-Leibler (KL) divergence between the empirical distribution of Z^n and P is below some threshold. In this paper, we consider Hoeffding-like tests, where the KL divergence is replaced by other divergences, and characterize, for a large class of divergences, the first and second-order terms of the type-II error for a fixed type-I error. Since the considered class includes the KL divergence, we obtain the second-order term of the Hoeffding test as a special case., K. V. Harsha, J. Ravi, and T. Koch have received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant No. 714161). T. Koch has further received funding from the Spanish Ministerio de Ciencia e Innovación under Grant PID2020-116683GB- C21 / AEI / 10.13039/501100011033.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

The Role of Interaction and Common Randomness in Two-User Secure Computation

  • Kurri, Gowtham R.
  • Ravikumaran Nair, Jithin
  • Prabhakaran, Vinod M.
This paper has been presented at : 2018 IEEE International Symposium On Information Theory (ISIT), We consider interactive computation of randomized functions between two users with the following privacy requirement: the interactive communication should not reveal to either user any extra information about the other user's input and output other than what can be inferred from the user's own input and output. We also consider the case where privacy is required against only one of the users. For both cases, we give single-letter expressions for feasibility and optimal rates of communication. Then we discuss the role of common randomness and interaction in both privacy settings., Gowtham R. Kurri was supported by a travel fellowship from the Sarojini Damodaran Foundation. This work was done while Jithin Ravi was at Tata Institute of Fundamental Research. He has received funding from ERC grant 714161.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

On the error probability of optimal codes in Gaussian channels under maximal power constraint

  • Vázquez Vilar, Gonzalo
Proceedings of: 2019 IEEE International Symposium on Information Theory (ISIT), For an additive white Gaussian noise channel, we prove that Th. 41 in [Polyanskiy, Poor, Verdά2010] is a lower bound to the error probability of any channel code satisfying the maximal power constraint. In contrast, the (tighter) lower bound to the error probability in Eq. (20) in [Shannon 1959] only holds under equal power constraint., This work has been funded in part by the European Research Council (ERC) under grant 714161, and by the Spanish Ministry of Economy and Competitiveness under grants IJCI-2015-27020 and TEC2016-78434-C3 (AEI/FEDER, EU).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Capacity per Unit-Energy of Gaussian Random Many-Access Channels

  • Ravikumaran Nair, Jithin
  • Koch, Tobias Mirco
Proceeding of: 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 21-26 June 2020, We consider a Gaussian multiple-access channel with random user activity where the total number of userslₙ and the average number of active users kₙ may be unbounded. For this channel, we characterize the maximum number of bits that can be transmitted reliably per unit-energy in terms of lₙ and kₙ . We show that if kₙ log lₙ is sublinear in n, then each user can achieve the single-user capacity per unit-energy. Conversely, if kₙ log lₙ is superlinear in n, then the capacity per unit-energy is zero. We further demonstrate that orthogonal-access schemes, which are optimal when all users are active with probability one, can be strictly suboptimal., J. Ravi and T. Koch have received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant No. 714161). T. Koch has further received funding from the Spanish Ministerio de Economía y Competitividad under Grants RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Finite-Blocklength Approximations for Noncoherent Rayleigh Block-Fading Channels

  • Lancho Serrano, Alejandro
  • Östman, Johan
  • Koch, Tobias Mirco
  • Vázquez Vilar, Gonzalo
Proceeding of: 53rd Asilomar Conference on Signals, Systems, and Computers (ACSSC 2019), 3-6 Nov. 2019, Pacific Grove, CA, USA, Several emerging wireless communication services and applications have stringent latency requirements, necessitating the transmission of short packets. To obtain performance benchmarks for short-packet wireless communications, it is crucial to study the maximum coding rate as a function of the blocklength, commonly called finite-blocklength analysis. A finiteblocklength analysis can be performed via nonasymptotic bounds or via refined asymptotic approximations. This paper reviews finite-blocklength approximations for the noncoherent Rayleigh block-fading channel. These approximations have negligible computational cost compared to the nonasymptotic bounds and are shown to be accurate for error probabilities as small as 10-8 [super index] and SNRs down to 0 dB., A. Lancho has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement number 714161) and from the Swedish Research Council under grant 2016-03293. J. O¨ stman has been supported by the Swedish Research Council under grants 2014-6066 and 2016-03293. T. 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) and from the Spanish Ministerio de Economía y Competitividad under grants RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU). G. Vazquez-Vilar has received funding 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 TEC2016- 78434-C3-3-R (AEI/FEDER, EU).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Private Index Coding

  • Narayanan, Varun
  • Ravikumaran Nair, Jithin
  • Mishra, Vivek K.
  • Dey, Bikash K.
  • Karamchandani, Nikhil
  • Prabhkaran, Vinod M.
This paper has been presented at: 2018 IEEE International Symposium On Information Theory (ISIT), We study the problem of index coding under the privacy requirement that receivers do not learn anything more than the messages they already have as side information and the message they want from the server. To achieve this private index coding, we consider the use of secret keys that are shared among various subsets of users and the server. We characterize key access structures that allow private index coding. For up to three receivers, we characterize the rate region of transmission and key rates and show that scalar coding is optimal; we also show that scalar linear codes are sub-optimal for four receivers. Furthermore, when no keys are available, we consider a weaker notion of privacy analogous to weak security. Finally, for a different setting in which the server is allowed to send messages exclusively to a subset of users, we study the number of transmissions required to achieve error-free decoding and privacy., Prabhakaran and N. Karamchandani acknowledge initial discussions with Parathasarathi Panda and Vaishakh Ravi. V. Narayanan was supported by a travel fellowship from the Sarojini Damodaran Foundation. This work was done while Jithin Ravi was at Tata Institute of Fundamental Research and IIT Bombay. He has received funding from ERC grant 714161.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Design of Discrete Constellations for Peak-Power-Limited complex Gaussian Channels

  • Huleihel, Wasim
  • Goldfeld, Ziv
  • Koch, Tobias Mirco
  • Madiman, Mokshay
  • Médard, Muriel
  • Huleihel, Wasim
Proceeding of: IEEE International Symposium on Information Theory (ISIT 2018), The capacity-achieving input distribution of the complex Gaussian channel with both average- and peak-power constraint is known to have a discrete amplitude and a continuous, uniformly-distributed, phase. Practical considerations, however, render the continuous phase inapplicable. This work studies the backoff from capacity induced by discretizing the phase of the input signal. A sufficient condition on the total number of quantization points that guarantees an arbitrarily small backoff is derived, and constellations that attain this guaranteed performance are proposed., The work of W. Huleihel was supported by the MIT - Technion Postdoctoral Fellowship. The work of Z. Goldfeld was supported by the Rothchild postdoctoral fellowship. The work of T. 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 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. The work of M. Mokshay was supported by NSF grant #1409504.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Saddlepoint Approximation of the Error Probability of Binary Hypothesis Testing

  • Vázquez Vilar, Gonzalo
  • Guillén i Fàbregas, Albert
  • Koch, Tobias Mirco
  • Lancho Serrano, Alejandro
We propose a saddlepoint approximation of the error probability of a binary hypothesis test between two i.i.d. distributions. The approximation is accurate, simple to compute, and yields a unified analysis in different asymptotic regimes. The proposed formulation is used to efficiently compute the meta-converse lower bound for moderate block-lengths in several cases of interest., This work has been funded in part by the European Research Council (ERC) under grants 714161 and 725411, by the Spanish Ministry of Economy and Competitiveness under grants TEC2013-41718-R, RYC-201416332, IJCI-2015-27020 and TEC2016-78434-C3 (AEI/FEDER, EU), by the Madrid Autonomous Community under grant S2103/ICE-2845 and by the Spanish Ministry of Education, Culture and Sport under grant FPU14/01274.
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)

Normal approximations for fading channels

  • Lancho Serrano, Alejandro
  • Koch, Tobias Mirco
  • Durisi, Giuseppe
Proceeding of: 52nd Annual Conference on Information Sciences and Systems (CISS 2018), Capacity and outage capacity characterize the maximum coding rate at which reliable communication is feasible when there are no constraints on the packet length. Evaluated for fading channels, they are important performance benchmarks for wireless communication systems. However, the latency of a communication system is proportional to the length of the packets it exchanges, so assuming that there are no constraints on the packet length may be overly optimistic for communication systems with stringent latency constraints. Recently, there has been great interest within the information theory community in characterizing the maximum coding rate for short packet lengths. Research on this topic is often concerned with asymptotic expansions of the coding rate with respect to the packet length, which then give rise to normal approximations. In this paper, we review existing normal approximations for single-antenna Rayleigh block-fading channels and compare them with the high-SNR normal approximation we presented at the 2017 IEEE International Symposium on Information Theory (Lancho, Koch, and Durisi, 2017). We further discuss how these normal approx- imations may help to assess the performance of communication protocols., 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 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 Grant and 2016-03293.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Second-order asymptotics of divergence tests

  • Kallumadatil Velluva, Harsha
  • Ravikumaran Nair, Jithin
  • Koch, Tobias Mirco
Proceedings of: International Zurich Seminar on Information and Communication (IZS 2024), Zurich, Switzerland, March 6–8, 2024, Consider a binary statistical hypothesis testing problem, where n independent and identically distributed random variables Zn are either distributed according to the null hypothesis P or the alternate hypothesis Q, and only P is known. A well-known test that is suitable for this case is the so-called Hoeffding test, which accepts P if the Kullback-Leibler (KL) divergence between the empirical distribution of Zn and P is below some threshold. In this work, we characterize the first and second-order terms of the type-II error probability for a fixed type-I error probability for the Hoeffding test as well as for divergence tests, where the KL divergence is replaced by a general divergence. We demonstrate that, irrespective of the divergence, divergence tests achieve the first-order term of the Neyman-Pearson test, which is the optimal test when both P and Q are known. In contrast, the second-order term of divergence tests is strictly worse than that of the Neyman-Pearson test. We further demonstrate that divergence tests with an invariantdivergence achieve the same second-order term as the Hoeffding test, but divergence tests with a non-invariant divergence may outperform the Hoeffding test for some alternate hypotheses Q., Part of this work was done while K. V. Harsha and J. Ravi were with the Signal Theory and Communications Department, Universidad Carlos III de Madrid, Leganés, Spain. K. V. Harsha, J. Ravi, and T. Koch have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant No. 714161). J. Ravi has further received funding from the Science and Engineering Research Board (SERB) under Start-up Research Grant (SRG) and also from IIT Kharagpur under Faculty Start-up Research Grant (FSRG). T. Koch has further received funding from the Spanish Ministerio de Ciencia e Innovación under Grant PID2020-116683GBC21 / AEI / 10.13039/501100011033.
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 Contribución de congreso (ConferenceOutput)

The Error Probability of Generalized Perfect Codes

  • Vázquez Vilar, Gonzalo
  • Guillén I Fàbregas, Albert
  • Verdú, Sergio
This paper has been presented at : IEEE International Symposium on Information Theory 2018, We introduce a definition of perfect and quasi-perfect codes for symmetric channels parametrized by an auxiliary output distribution. This new definition generalizes previous definitions and encompasses maximum distance separable codes. The error probability of these codes, whenever they exist, is shown to attain the meta-converse lower bound., This work has been funded in part by the European Research Council (ERC) under grants 714161 and 725411, by the Spanish Ministry of Economy and Competitiveness under Grants TEC2016-78434-C3 and IJCI-2015-27020, by the National Science Foundation under Grant CCF-1513915 and by the Center for Science of Information, an NSF Science and Technology Center under Grant CCF-0939370.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Demand-Private Coded Caching and the Exact Trade-off for N=K=2

  • Kamath, Sneha
  • Ravikumaran Nair, Jithin
  • Dey, Bikash Kumar
Proceedings of: National Conference on Communications (NCC), 21-23 Feb. 2020, Kharagpur, India., The distributed coded caching problem has been studied extensively in the recent past. While the known coded caching schemes achieve an improved transmission rate, they violate the privacy of the users since in these schemes the demand of one user is revealed to others in the delivery phase. In this paper, we consider the coded caching problem under the constraint that the demands of the other users remain information theoretically secret from each user. We first show that the memory-rate pair (M, min{ N, K}(1- M / N)) is achievable under information theoretic demand privacy, while using broadcast transmissions. Using this, we show that perfectly demand-private coded caching rate is order optimal for all parameter regimes. We then show that a demand-private scheme for N files and K users can be obtained from a non-private scheme that satisfies only a restricted subset of demands of N K users for N files. We then focus on the demand-private coded caching problem for K = 2 users, N = 2 files. We characterize the exact memory-rate trade-off for this case. To show the achievability, we use our first result to construct a demand-private scheme from a non-private scheme satisfying a restricted demand subset that is known from an earlier work by Tian. Further, by giving a converse based on the extra requirement of privacy, we show that the obtained achievable region is the exact memory-rate trade-off., J. Ravi received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant No. 714161). The work of B. K. Dey was supported in part by the Bharti Centre for Communication, lIT Bombay.
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Capacity per Unit-Energy of Gaussian Many-Access Channels

  • Ravikumaran Nair, Jithin
  • Koch, Tobias Mirco
Proceeding of: 2019 IEEE International Symposium on Information Theory (ISIT), 7-12 July 2019, Paris, France, We consider a Gaussian multiple-access channel where the number of transmitters grows with the blocklength n. For this setup, the maximum number of bits that can be transmitted reliably per unit-energy is analyzed. We show that if the number of users is of an order strictly above n/log n, then the users cannot achieve any positive rate per unit-energy. In contrast, if the number of users is of order strictly below n/log n, then each user can achieve the single-user capacity per unit-energy (log e)/N 0 (where N 0 /2 is the noise power) by using an orthogonal access scheme such as time division multiple access. We further demonstrate that orthogonal codebooks, which achieve the capacity per unit-energy when the number of users is bounded, can be strictly suboptimal., J. Ravi and T. Koch have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant No. 714161). T. Koch has further received funding from the Spanish Ministerio de Economía y Competitividad under Grants RYC-2014-16332 and TEC2016-78434-C3-3-R (AEI/FEDER, EU).
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Improved memory-rate trade-off for caching with demand privacy

  • Gurjarpadhye, Chinmay
  • Ravikumaran Nair, Jithin
  • Dey, Bikash Kumar
  • Karamchandani, Nikhil
We consider the demand-private coded caching problem in a noiseless broadcast network. It is known from past works that a demand-private scheme for N files and K users can be obtained from a non-private scheme for N files and NK users. We first propose a scheme that improves on this idea by removing some redundant transmissions. The memory- rate trade-off achieved using this scheme is shown to be within a multiplicative factor of 3 from the optimal for all the memory regimes when K K = 2., J. Ravi has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Grant No. 714161). The work of B. K. Dey was supported in part by the Bharti Centre for Communication in IIT Bombay. The work of N. Karamchandani is supported in part by a Science and Engineering Research Board (SERB) grant on "Content Caching and Delivery over Wireless Networks".
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
Publicación Contribución de congreso (ConferenceOutput)

Saddlepoint Approximations for Noncoherent Single-Antenna Rayleigh Block-Fading Channels

  • Lancho Serrano, Alejandro
  • Östman, Johan
  • Durisi, Giuseppe
  • Koch, Tobias Mirco
  • Vázquez Vilar, Gonzalo
Proceeding of: 2019 IEEE International Symposium on Information Theory (ISIT), 7-12 July 2019, Paris, France, This paper presents saddlepoint approximations of state-of-the-art converse and achievability bounds for noncoherent, single-antenna, Rayleigh block-fading channels. These approximations can be calculated efficiently and are shown to be accurate for SNR values as small as 0 dB, blocklengths of 168 channel uses or more, and when the channel's coherence interval is not smaller than two. It is demonstrated that the derived approximations recover both the normal approximation and the reliability function of the channel., A. Lancho, G. Vázquez-Vilar and T. Koch have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (714161), the Spanish Ministerio de Economía y Competitividad (RYC-2014-16332, TEC2016-78434-C3-3-R (AEI/FEDER, EU) and IJCI2015-27020), the Spanish Ministerio de Educación, Cultura y Deporte (FPU014/01274), and the Comunidad de Madrid (S2103/ICE-2845). G. Durisi and J. Östman have been supported by the Swedish Research Council under Grants 2016-03293 and 2014-6066.