...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >Maximum-Likelihood Priority-First Search Decodable Codes for Combined Channel Estimation and Error Correction
【24h】

Maximum-Likelihood Priority-First Search Decodable Codes for Combined Channel Estimation and Error Correction

机译：组合信道估计和纠错的最大似然优先优先搜索可解码代码

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

摘要

The coding technique that combines channel estimation and error correction has received attention recently, and has been regarded as a promising approach to counter the effects of multipath fading. It has been shown by simulation that a proper code design that jointly considers channel estimation can improve the system performance subject to a fixed code rate as compared to a conventional system which performs channel estimation and error correction separately. Nevertheless, the major obstacle that prevents the practice of such coding technique is that the existing codes are mostly searched by computers, and subsequently exhibit no apparent structure for efficient decoding. Hence, the operation-intensive exhaustive search becomes the only decoding option, and the decoding complexity increases dramatically with codeword length. In this paper, a systematic construction is derived for a class of structured codes that support joint channel estimation and error correction. It is confirmed by simulation that these codes have comparable performance to the best simulated-annealing-based computer-searched codes. Moreover, the systematically constructed codes can now be maximum-likelihoodly decoded with respect to the unknown-channel criterion in terms of a newly derived recursive metric for use by the priority-first search decoding algorithm. Thus, the decoding complexity is significantly reduced as compared with that of an exhaustive decoder.
机译：结合了信道估计和纠错的编码技术近来受到关注，并且已经被认为是对抗多径衰落影响的有前途的方法。通过仿真已经显示，与分别执行信道估计和纠错的常规系统相比，共同考虑信道估计的适当的代码设计可以在固定的代码率的情况下提高系统性能。然而，阻碍这种编码技术实践的主要障碍是现有代码主要由计算机搜索，并且随后没有表现出有效解码的明显结构。因此，操作密集的穷举搜索成为唯一的解码选项，并且解码复杂度随着码字长度而急剧增加。在本文中，为支持联合信道估计和纠错的一类结构化代码推导了系统构造。通过仿真确认，这些代码具有与最佳基于模拟退火的计算机搜索代码相当的性能。此外，现在可以根据优先级优先搜索解码算法使用的新推导的递归度量，相对于未知信道准则最大可能地解码系统构造的代码。因此，与穷举解码器相比，解码复杂度大大降低。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号