### **Vinay A. Vaishampayan **

**Professor of Electrical Engineering **

**City University of New York
**

**Recent Work**

(2021)

On Communication for Distributed Babai Point Computation, to appear IEEE Transactions on Information Theory, 2021. doi: 10.1109/TIT.2021.3097719. (with M. F. Bollauf and S. I. R. Costa) [Babai]

* Computation of an approximate nearest lattice point (Babai point) in a distributed setting. Algorithm that minimizes the communication overhead is presented. Probability that Babai point is the true nearest lattice point (Voronoi point) is evaluated. For lattices that are good coverings (in the sense of Rogers), the probability that Babai and Voronoi points coincide converges to zero as the dimension grows without bound*

Precoder Design for Communication-Efficient Distributed MIMO Receivers With Controlled Peak-Average Power Ratio. IEEE Transactions on Communication,vol. 69, no. 7, pp. 4704-4716, July 2021. doi: 10.1109/TCOMM.2021.3070364. [precoder]

*Relay enhanced backhaul wireless system. Communication overhead on the access links is minimized. Precoder is designed to exploit a tradeoff between communication overhead on the access links and peak-average power ratio (PAPR) at the transmitter*.

(2019)

2019:2 Communication Efficient Linear Equation Solver Based on the Gauss Seidel Algorithm (with N. Brasil and S. I. R. Costa) [pdf]

2019:1 Communication Efficient Classification in a Large Network** [pdf]. **

(2018)

2018:4 Communication Efficient Search for An Approximate Nearest Lattice Point (with M. F. Bollauf and S. I. R. Costa) (extended version of 2017:2) [arxiv]

2018:3 On the interactive communication cost of the closest lattice point problem (with M. F. Bollauf) (extended journal version of 2017:1) [pdf]

2018:2 Lattice Erasure Codes of Low Rank with Noise Margins. Jan. 2018 [arxiv]

2018:1 Communication Complexity of min(X1,X2) with an Application to the Nearest Lattice Point Problem, Jan. 2018 [arxiv].

**(2017)
**

2017:2 On the Communication Cost of Determining an Approximate Nearest Lattice Point (with M. F. Bollauf and S. I. R. Costa), Jan. 2017 [arxiv]. Proc. IEEE International Symposium on Information Theory, Aachen, Germany, June 2017.

2017:1 Communication Cost of Transforming a Nearest Plane Partition to the Voronoi Partition (with M. F. Bollauf), Jan. 2017 [arxiv]. Proc. IEEE International Symposium on Information Theory, Aachen, Germany, June 2017.