Venkatachalam Anantharam

Dr. Venkatachalam Anantharam


Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 February 2021 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
CLCheuk Ting Li
Cheuk Ting Li
VAVenkatachalam Anantharam
Venkatachalam Anantharam
We introduce a fundamental lemma called the Poisson matching lemma, and apply it to prove one-shot achievability results for various settings, namely channels with state information at the encoder, lossy source coding with side information at the decoder, joint source-channel coding, broadcast channels, distributed lossy source coding, multiple access channels and channel resolvability. Our one-shot bounds improve upon the best known one-shot bounds in most of the aforementioned settings (except multiple access channels and channel resolvability, where we recover bounds comparable to the best known bounds), with shorter proofs in some settings even when compared to the conventional asymptotic approach using typicality. The Poisson matching lemma replaces both the packing and covering lemmas, greatly simplifying the error analysis. This paper extends the work of Li and El Gamal on Poisson functional representation, which mainly considered variable-length source coding settings, whereas this paper studies fixed-length settings, and is not limited to source coding, showing that the Poisson functional representation is a viable alternative to typicality for most problems in network information theory.

1 July 2006 in Queueing Systems
Verified
Journal Article
Closed access
PDF file
ASAnand Sarwate
Anand Sarwate
VAVenkatachalam Anantharam
Venkatachalam Anantharam

1 September 2007
Verified
Conference Paper
Closed access
LDLara Dolecek
Lara Dolecek
ZZZhengya Zhang
Zhengya Zhang
MWMartin Wainwright
Martin Wainwright
VAVenkatachalam Anantharam
Venkatachalam Anantharam
BNBorivoje Nikolic
Borivoje Nikolic
We present an importance sampling method for the evaluation of the low frame error rate (FER) performance of LDPC codes under iterative decoding. It relies on a combinatorial characterization of absorbing sets, which are the dominant cause of decoder failure in the low FER region. The biased density in the importance sampling scheme is a mean-shifted version of the original Gaussian density, which is suitably centered between a codeword and a dominant absorbing set. This choice of biased density yields an unbiased estimator for the FER with a variance lower by several orders of magnitude than the standard Monte Carlo estimator. Using this importance sampling scheme in software, we obtain good agreement with the experimental results obtained from a fast hardware emulator of the decoder.

1 January 1996 in Queueing Systems
Verified
Journal Article
Closed access
PDF file
AGA. Ganesh
A. Ganesh
VAVenkatachalam Anantharam
Venkatachalam Anantharam

6 May 2020 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
PDPayam Delgosha
Payam Delgosha
VAVenkatachalam Anantharam
Venkatachalam Anantharam
Graphical data is comprised of a graph with marks on its edges and vertices. The mark indicates the value of some attribute associated to the respective edge or vertex. Examples of such data arise in social networks, molecular and systems biology, and web graphs, as well as in several other application areas. Our goal is to design schemes that can efficiently compress such graphical data without making assumptions about its stochastic properties. Namely, we wish to develop a universal compression algorithm for graphical data sources. To formalize this goal, we employ the framework of local weak convergence, also called the objective method, which provides a technique to think of a marked graph as a kind of stationary stochastic processes, stationary with respect to movement between vertices of the graph. In recent work, we have generalized a notion of entropy for unmarked graphs in this framework, due to Bordenave and Caputo, to the case of marked graphs. We use this notion to evaluate the efficiency of a compression scheme. The lossless compression scheme we propose in this paper is then proved to be universally optimal in a precise technical sense. It is also capable of performing local data queries in the compressed form.

21 July 2022 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
VAVenkatachalam Anantharam
Venkatachalam Anantharam
VJVarun Jog
Varun Jog
CNChandra Nair
Chandra Nair
The entropy power inequality (EPI) and the Brascamp-Lieb inequality (BLI) are fundamental inequalities concerning the differential entropies of linear transformations of random vectors. The EPI provides lower bounds for the differential entropy of linear transformations of random vectors with independent components. The BLI, on the other hand, provides upper bounds on the differential entropy of a random vector in terms of the differential entropies of some of its linear transformations. In this paper, we define a family of entropy functionals, which we show are subadditive. We then establish that Gaussians are extremal for these functionals by adapting a proof technique from Geng and Nair (2014). As a consequence, we obtain a new entropy inequality that generalizes both the BLI and EPI. By considering a variety of independence relations among the components of the random vectors appearing in these functionals, we also obtain families of inequalities that lie between the EPI and the BLI.