...
首页> 外文期刊>IEEE communications letters >Voronoi Shaping for Lattices With Efficient Encoding
【24h】

Voronoi Shaping for Lattices With Efficient Encoding

机译:Voronoi为具有高效编码的格子整形

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

摘要

In this letter, we propose a Voronoi shaping method for shaping lattices, Lambda(s), and coding lattices, Lambda(c), satisfying Lambda(s) subset of KZ(n) subset of Lambda(c) subset of Z(n), with K being an integer diagonal matrix. This assumption is easily satisfied for lattices obtained from error-correcting codes. For these lattices, using the proposed strategy, lattice encoding complexity is reduced to the encoding complexity of the underlying error-correcting code. Our proposal is illustrated for Construction-D lattices with Gosset (E-8) and Leech (Lambda(24)) lattices as shaping lattices.
机译:在这封信中,我们提出了一种用于整形格子,λ和编码格子,λ(c),满足λ(n)λ子集的λ(c)子集的λ(c)子集的λ(c)子集的λ(n)子集的voronoi成形方法 ),K是一个整数对角线矩阵。 对于从纠错码获得的格子容易满足该假设。 对于这些格子,使用所提出的策略,晶格编码复杂性降低到底层纠错码的编码复杂度。 我们的提案被展示了用门(E-8)和Leech(Lambda(24))格子作为塑造格子的建筑-D格子。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号