...
首页> 外文期刊>IEEE Transactions on Information Theory >Shaping multidimensional signal spaces. II. Shell-addressed constellations
【24h】

Shaping multidimensional signal spaces. II. Shell-addressed constellations

机译:塑造多维信号空间。二。壳寻址星座

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

摘要

For Pt. I, see ibid., pp. 1799-1808, Nov. 1993. By appropriately selecting the boundary of a multidimensional signal constellation used for data transmission, the average energy of the constellation can be reduced. Reduction in the average energy (shaping gain) is obtained at the price of increasing the constellation-expansion ratio (CER/sub s/) and the peak-to-average-power ratio (PAR). The authors describe some practical means for selecting the boundary so as to achieve a point with low addressing complexity near the knee of the corresponding tradeoff curves (shaping gain versus CER/sub s/ or PAR). One class of addressing schemes is based on using a lookup table. A method to facilitate the realization of the addressing lookup table is introduced. This method is based on the decomposition of addressing into a hierarchy of addressing steps, each of a low complexity. This avoids exponential growth of the complexity. Using this addressing decomposition and a memory of a practical size, one can move along a tradeoff curve which has negligible suboptimality. Another class of addressing schemes is based on using a Voronoi constellation in a space of half the original dimensionality.
机译:对于铂参见I,同上,第1799-1808页,1993年11月。通过适当选择用于数据传输的多维信号星座图的边界,可以降低星座图的平均能量。平均能量(整形增益)的降低是以增加星座图扩展比(CER / sub s /)和峰均功率比(PAR)为代价的。作者描述了一些用于选择边界的实用方法,以便在相应折衷曲线的拐点(成形增益与CER / sub s /或PAR)的拐点附近获得低寻址复杂度的点。一类寻址方案是基于使用查找表的。介绍了一种有助于实现地址查找表的方法。此方法基于将寻址分解为寻址步骤的层次结构,每个寻址步骤的复杂度都很低。这避免了复杂度的指数增长。使用这种寻址分解和实际大小的存储器,可以沿着折衷曲线移动,该折衷曲线的次优程度可以忽略不计。另一类寻址方案是基于在原始尺寸一半的空间中使用Voronoi星座。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号