On Communication for Distributed Babai Point Computation

08/30/2020
by   Maiara F. Bollauf, et al.
0

We present a communication-efficient distributed protocol for computing the Babai point, an approximate nearest point for a random vector X∈ℝ^n in a given lattice. We show that the protocol is optimal in the sense that it minimizes the sum rate when the components of X are mutually independent. We then investigate the error probability, i.e. the probability that the Babai point does not coincide with the nearest lattice point. In dimensions two and three, this probability is seen to grow with the packing density. For higher dimensions, we use a bound from probability theory to estimate the error probability for some well-known lattices. Our investigations suggest that for uniform distributions, the error probability becomes large with the dimension of the lattice, for lattices with good packing densities. We also consider the case where 𝐗 is obtained by adding Gaussian noise to a randomly chosen lattice point. In this case, the error probability goes to zero with the lattice dimension when the noise variance is sufficiently small. In such cases, a distributed algorithm for finding the approximate nearest lattice point is sufficient for finding the nearest lattice point.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/29/2018

Communication-Efficient Search for an Approximate Closest Lattice Point

We consider the problem of finding the closest lattice point to a vector...
01/30/2018

On the Interactive Communication Cost of the Distributed Nearest Lattice Point Problem

We consider the problem of distributed computation of the nearest lattic...
06/04/2019

On General Lattice Quantization Noise

The problem of constructing lattices such that their quantization noise ...
11/19/2020

Cluster structure of optimal solutions in bipartitioning of small worlds

Using a simulated annealing, we examine a bipartitioning of small worlds...
01/16/2021

An MCMC Method to Sample from Lattice Distributions

We introduce a Markov Chain Monte Carlo (MCMC) algorithm to generate sam...
02/06/2019

Restriction enzymes use a 24 dimensional coding space to recognize 6 base long DNA sequences

Restriction enzymes recognize and bind to specific sequences on invading...
10/24/2017

Explicit error bounds for lattice Edgeworth expansions

Motivated, roughly, by comparing the mean and median of an IID sum of bo...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.