...
首页> 外文期刊>IEEE Transactions on Information Theory >A counterexample to a Voronoi constellation conjecture
【24h】

A counterexample to a Voronoi constellation conjecture

机译:Voronoi星座猜想的反例

获取原文
获取原文并翻译 | 示例
           

摘要

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 Lambda / Lambda /sub s/ is the set of points in some translate Lambda +a that fall within the Voronoi region R( Lambda /sub s/). 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.
机译:Voronoi星座很有趣,因为可以通过选择Voronoi区域的第二矩接近具有相同维度的球体的矩来节省信号功率。基于晶格分区Lambda / Lambda / sub s /的Voronoi星座图是某些翻译Lambda + a中属于Voronoi区域R(Lambda / sub s /)的点集。 G.D. Forney,Jr.(1989)提出了一种构造Voronoi星座的算法,并推测该算法可将平均信号功率降至最低。提出了一个针对福尼猜想的二维反例。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号