Neural Lattice Decoders

07/02/2018
by   Vincent Corlay, et al.
0

Lattice decoders constructed with neural networks are presented. Firstly, we show how the fundamental parallelotope is used as a compact set for the approximation by a neural lattice decoder. Secondly, we introduce the notion of Voronoi-reduced lattice basis. As a consequence, a first optimal neural lattice decoder is built from Boolean equations and the facets of the Voronoi region. This decoder needs no learning. Finally, we present two neural decoders with learning. It is shown that L1 regularization and a priori information about the lattice structure lead to a simplification of the model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2019

Construction of s-extremal optimal unimodular lattices in dimension 52

An s-extremal optimal unimodular lattice in dimension 52 is constructed ...
research
07/10/2018

Effects of Some Lattice Reductions on the Success Probability of the Zero-Forcing Decoder

Zero-forcing (ZF) decoder is a commonly used approximation solution of t...
research
11/28/2016

Emergence of foveal image sampling from learning to attend in visual scenes

We describe a neural attention model with a learnable retinal sampling l...
research
11/05/2021

Lattice Packings of Cross-polytopes Constructed from Sidon Sets

A family of lattice packings of n-dimensional cross-polytopes (ℓ_1 balls...
research
05/05/2023

Equivariant Neural Networks for Spin Dynamics Simulations of Itinerant Magnets

I present a novel equivariant neural network architecture for the large-...
research
02/17/2021

Automatic Generation of Interpolants for Lattice Samplings: Part I – Theory and Analysis

Interpolation is a fundamental technique in scientific computing and is ...
research
07/31/2023

Lax Liftings and Lax Distributive Laws

Liftings of endofunctors on sets to endofunctors on relations are common...

Please sign up or login with your details

Forgot password? Click here to reset