...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Low-rate turbo-Hadamard codes
【24h】

Low-rate turbo-Hadamard codes

机译：低速Turbo Hadamard码

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper is concerned with a class of low-rate codes constructed from Hadamard code arrays. A recursive encoding principle is employed to introduce an interleaving gain. Very simple trellis codes with only two or four states are sufficient for this purpose, and the decoding cost involved in the trellis part is typically negligible. Both simulation and analytical results are provided to demonstrate the advantages of the proposed scheme. The proposed scheme is of theoretical interest as it can achieve performance of BER=10/sup -5/ at E/sub b//N/sub 0//spl ap/-1.2dB (only about 0.4 dB away from the ultimate low-rate Shannon limit) with an information block size of 65534. To the authors' knowledge, this is the best result achieved to date with respect to the ultimate Shannon limit. With regard to practical issues, the decoding complexity of the proposed code is considerably lower than that of existing low-rate turbo-type codes with comparable performance.
机译：本文涉及由Hadamard码阵列构成的一类低码率码。采用递归编码原理来引入交织增益。为此目的，只有两个或四个状态的非常简单的网格码就足够了，并且网格部分所涉及的解码成本通常可以忽略不计。提供了仿真和分析结果，以证明所提出方案的优点。所提出的方案具有理论意义，因为它可以在E / sub b // N / sub 0 // spl ap / -1.2dB时达到BER = 10 / sup -5 /的性能（距离极限低值仅约0.4 dB速率的Shannon限制），信息块大小为65534。据作者所知，这是迄今为止有关Shannon最终限制的最佳结果。关于实际问题，所提出的代码的解码复杂度明显低于具有可比性能的现有低速率turbo型代码的解码复杂度。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号