利用有限字母特性改进源和信道估计的随机算法

Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154) Pub Date : 2000-10-29 DOI:10.1109/ACSSC.2000.911256

J. Manton, Y. Hua

{"title":"利用有限字母特性改进源和信道估计的随机算法","authors":"J. Manton, Y. Hua","doi":"10.1109/ACSSC.2000.911256","DOIUrl":null,"url":null,"abstract":"Many channel identification algorithms do not take into account the fact that the source symbols belong to a finite alphabet. This paper proposes an algorithm which exploits this finite alphabet property to refine the estimates of the source symbols and channel parameters obtained by any identification algorithm. The key idea is to reformulate the problem as minimising a quadratic cost function on a set of discrete points. Since it is known that this problem is NP-hard, a randomised algorithm is proposed, which guesses the direction in which to search for the minimum.","PeriodicalId":10581,"journal":{"name":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","volume":"15 1","pages":"1582-1585 vol.2"},"PeriodicalIF":0.0000,"publicationDate":"2000-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A randomised algorithm for improving source and channel estimates by exploiting the finite alphabet property\",\"authors\":\"J. Manton, Y. Hua\",\"doi\":\"10.1109/ACSSC.2000.911256\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many channel identification algorithms do not take into account the fact that the source symbols belong to a finite alphabet. This paper proposes an algorithm which exploits this finite alphabet property to refine the estimates of the source symbols and channel parameters obtained by any identification algorithm. The key idea is to reformulate the problem as minimising a quadratic cost function on a set of discrete points. Since it is known that this problem is NP-hard, a randomised algorithm is proposed, which guesses the direction in which to search for the minimum.\",\"PeriodicalId\":10581,\"journal\":{\"name\":\"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)\",\"volume\":\"15 1\",\"pages\":\"1582-1585 vol.2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-10-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2000.911256\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2000.911256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

许多信道识别算法没有考虑到源符号属于有限字母这一事实。本文提出了一种算法，利用这一有限字母性质来改进任何识别算法得到的源符号和信道参数的估计。关键思想是将问题重新表述为在一组离散点上最小化一个二次代价函数。由于已知这个问题是np困难的，因此提出了一种随机算法，该算法猜测搜索最小值的方向。

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

查看原文本刊更多论文

A randomised algorithm for improving source and channel estimates by exploiting the finite alphabet property

Many channel identification algorithms do not take into account the fact that the source symbols belong to a finite alphabet. This paper proposes an algorithm which exploits this finite alphabet property to refine the estimates of the source symbols and channel parameters obtained by any identification algorithm. The key idea is to reformulate the problem as minimising a quadratic cost function on a set of discrete points. Since it is known that this problem is NP-hard, a randomised algorithm is proposed, which guesses the direction in which to search for the minimum.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154)

自引率

0.00%

发文量