A self-orthogonal code and its maximum-likelihood decoder for combined channel estimation and error protection

2008 International Symposium on Information Theory and Its Applications Pub Date : 2008-12-01 DOI:10.1109/ISITA.2008.4895568

Chia-Lung Wu, Po-Ning Chen, Y.S. Han, Shih-Wei Wang

{"title":"A self-orthogonal code and its maximum-likelihood decoder for combined channel estimation and error protection","authors":"Chia-Lung Wu, Po-Ning Chen, Y.S. Han, Shih-Wei Wang","doi":"10.1109/ISITA.2008.4895568","DOIUrl":null,"url":null,"abstract":"Recent researches have confirmed that better system performance can be obtained by jointly considering channel equalization and channel estimation in the code design, when compared with the system with individually optimized devices. However, the existing codes are mostly searched by computers, and hence, exhibit no good structure for efficient decoding. In this paper, a systematic construction for the codes for combined channel estimation and error protection is proposed. Simulations show that it can yield codes of comparable performance to the computer-searched best codes. In addition, the structural codes can now be maximum-likelihoodly decodable in terms of a newly derived recursive metric for use of the priority-first search decoding algorithm. Thus, the decoding complexity reduces considerably when compared with that of the exhaustive decoder. In light of the rule-based construction, the feasible codeword length that was previously limited by the capability of code-search computers can now be further extended, and therefore facilitates their applications.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895568","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

Abstract

Recent researches have confirmed that better system performance can be obtained by jointly considering channel equalization and channel estimation in the code design, when compared with the system with individually optimized devices. However, the existing codes are mostly searched by computers, and hence, exhibit no good structure for efficient decoding. In this paper, a systematic construction for the codes for combined channel estimation and error protection is proposed. Simulations show that it can yield codes of comparable performance to the computer-searched best codes. In addition, the structural codes can now be maximum-likelihoodly decodable in terms of a newly derived recursive metric for use of the priority-first search decoding algorithm. Thus, the decoding complexity reduces considerably when compared with that of the exhaustive decoder. In light of the rule-based construction, the feasible codeword length that was previously limited by the capability of code-search computers can now be further extended, and therefore facilitates their applications.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

一种自正交码及其最大似然解码器，用于信道估计和错误保护

近年来的研究证实，与单独优化器件的系统相比，在编码设计中联合考虑信道均衡和信道估计可以获得更好的系统性能。然而，现有的密码大多是由计算机搜索的，因此，没有良好的结构来进行有效的解码。本文提出了信道估计和差错保护相结合的系统编码结构。仿真结果表明，该方法可以产生与计算机搜索的最佳代码性能相当的代码。此外，根据使用优先级搜索解码算法新导出的递归度量，结构代码现在可以最大可能地可解码。因此，与穷举解码器相比，译码复杂度大大降低。由于基于规则的结构，以前受代码搜索计算机能力限制的可行码字长度可以进一步延长，从而方便了它们的应用。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2008 International Symposium on Information Theory and Its Applications

自引率

0.00%

发文量