By Topic

A counterexample to a Voronoi constellation conjecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Headley, P. ; Dept. of Math., Michigan Univ., Ann Arbor, MI, USA

Voronoi constellations are of interest because it is possible to save on signal power by choosing a lattice for which the second moment of the Voronoi region is close to that of a sphere with the same dimensionality. A Voronoi constellation based on the lattice partition Λ/Λs is the set of points in some translate Λ+a that fall within the Voronoi region Rs). G.D. Forney, Jr. (1989) proposed an algorithm for constructing Voronoi constellations and conjectured that this algorithm minimized the average signal power. A two-dimensional counterexample, to Forney's conjecture is presented

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 6 )