On the geometric ergodicity of Gibbs algorithm for lattice Gaussian sampling

Sampling from the lattice Gaussian distribution is emerging as an important problem in coding and cryptography. In this paper, the conventional Gibbs sampling algorithm is demonstrated to be geometrically ergodic in tackling with lattice Gaussian sampling, which means its induced Markov chain conver...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:ITW : 2017 IEEE Information Theory Workshop : 6-10 November 2017 s. 269 - 273
Hlavní autoři: Zheng Wang, Cong Ling
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.11.2017
Témata:
Conferences
Convergence
Correlation
Gaussian distribution
Information theory
lattice coding and decoding
Lattice Gaussian sampling
Lattices
Markov chain Monte Carlo
Markov processes
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Sampling from the lattice Gaussian distribution is emerging as an important problem in coding and cryptography. In this paper, the conventional Gibbs sampling algorithm is demonstrated to be geometrically ergodic in tackling with lattice Gaussian sampling, which means its induced Markov chain converges exponentially fast to the stationary distribution. Moreover, as the exponential convergence rate is dominated by the spectral radius of the forward operator of the Markov chain, a comprehensive analysis is given and we show that the convergence performance can be further enhanced by usages of blocked sampling strategy and choices of selection probabilities.
DOI:10.1109/ITW.2017.8278001