Zobrazeno 1 - 10
of 97
pro vyhledávání: '"Vinay A. Vaishampayan"'
Autor:
Vinay A. Vaishampayan
Publikováno v:
IEEE Transactions on Communications. 69:4704-4716
We consider the problem of communicating over a relay-assisted multiple-input multiple-output (MIMO) channel with additive noise, in which physically separated relays forward quantized information to a central decoder where the transmitted message is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf920351d205fc3943340e454a62d299
https://doi.org/10.1109/tcomm.2021.3070364
https://doi.org/10.1109/tcomm.2021.3070364
We present a communication-efficient distributed protocol for computing the Babai point, an approximate nearest point for a random vector ${\mathbf{X}}\in \mathbb {R}^{n}$ in a given lattice. We show that the protocol is optimal in the sense that it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82125bedd44e2e9a0548e23cb2a473f3
Autor:
Vinay A. Vaishampayan
Publikováno v:
ISIT
We construct and analyze the communication cost of protocols (interactive and one-way) for classifying ${\mathbf X}=(X_1,X_2,\ldots,X_n) \in [0,1)^n \subset \mathbb{R}^n$, in a network with $n\geq 2$ nodes, with $X_i$ known only at node $i$. The clas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aff38cede81548506f1e82edd81c150a
https://doi.org/10.1109/isit.2019.8849301
https://doi.org/10.1109/isit.2019.8849301
Autor:
Gil Zussman, Robert Margolies, Rittwik Jana, Vinay A. Vaishampayan, Ashwin Sridharan, N. K. Shankaranarayanan, Vaneet Aggarwal
Publikováno v:
INFOCOM
Proportional Fair (PF) scheduling algorithms are the de facto standard in cellular networks. They exploit the users' channel state diversity (induced by fast-fading) and are optimal for stationary channel state distributions and an infinite time-hori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::600a2e09f0bc9a3ebac578f9bb5ad208
https://doi.org/10.1109/tnet.2014.2362928
https://doi.org/10.1109/tnet.2014.2362928
Autor:
Vinay A. Vaishampayan
Publikováno v:
ISIT
Lattice codes of low rank are considered for an additive Gaussian noise channel with erasures. The objective is to minimize the error probability with no erasures subject to rate and power constraints while ensuring that the error probability under a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7a148dd152186f8e8370ba5aafb4c73
http://arxiv.org/abs/1801.04466
http://arxiv.org/abs/1801.04466
Publikováno v:
IEEE Transactions on Information Theory. 61:5795-5809
We consider the probability of data loss, or equivalently, the reliability function for an erasure coded distributed data storage system under worst case conditions. Data loss in an erasure coded system depends on probability distributions for the di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28e8402f0ee28fd3daebdb3831342842
https://doi.org/10.1109/tit.2015.2477401
https://doi.org/10.1109/tit.2015.2477401
Publikováno v:
ISIT
We consider the problem of distributed computation of the nearest lattice point for a two-dimensional lattice. An interactive model of communication is considered. We address the problem of reconfiguring a specific rectangular partition, a nearest pl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22fd52a75dd95085bd6223f367f8115d
https://doi.org/10.1109/isit.2017.8006848
https://doi.org/10.1109/isit.2017.8006848
Publikováno v:
ISIT
We consider the closest lattice point problem in a distributed network setting and study the communication cost and the error probability for computing an approximate nearest lattice point, using the nearest-plane algorithm, due to Babai. Two distinc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d199aa01e3b1ecf53e1b5a422aa3a9e4
https://doi.org/10.1109/isit.2017.8006847
https://doi.org/10.1109/isit.2017.8006847
Publikováno v:
IEEE Transactions on Information Theory. 55:1051-1060
We present a novel technique for encoding and decoding constant weight binary vectors that uses a geometric interpretation of the codebook. Our technique is based on embedding the codebook in a Euclidean space of dimension equal to the weight of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::604e82bb5b7119123c30ac1444883b81
https://doi.org/10.1109/tit.2008.2011441
https://doi.org/10.1109/tit.2008.2011441
Publikováno v:
Discrete & Computational Geometry. 41:232-248
Let v 1,…,v n be unit vectors in ℝn such that v i ⋅v j =−w for i≠j, where $-1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a40dbfe31199cfa75d201b27aa653ff6
https://doi.org/10.1007/s00454-008-9086-6
https://doi.org/10.1007/s00454-008-9086-6