给定输出序列的有限状态机状态序列估计的一种有效算法

SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications Pub Date : 2003-12-03 DOI:10.1109/TIC.2003.1249101

S. Baggen, V. Balakirsky, S. Egner

{"title":"给定输出序列的有限状态机状态序列估计的一种有效算法","authors":"S. Baggen, V. Balakirsky, S. Egner","doi":"10.1109/TIC.2003.1249101","DOIUrl":null,"url":null,"abstract":"We consider the problem of sequentially estimating the states of non-unifilar finite state machines on the basis of the output symbols of the machine and show that a Fano-type inequality can be effectively used as a stopping criterion. Lower and upper bounds on the decoding error probability are given.","PeriodicalId":177770,"journal":{"name":"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient algorithm for estimating the state sequence of a finite state machine given an output sequence\",\"authors\":\"S. Baggen, V. Balakirsky, S. Egner\",\"doi\":\"10.1109/TIC.2003.1249101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of sequentially estimating the states of non-unifilar finite state machines on the basis of the output symbols of the machine and show that a Fano-type inequality can be effectively used as a stopping criterion. Lower and upper bounds on the decoding error probability are given.\",\"PeriodicalId\":177770,\"journal\":{\"name\":\"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TIC.2003.1249101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TIC.2003.1249101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

研究了基于有限状态机输出符号的非幺正有限状态机状态序列估计问题，并证明了用fano型不等式作为停止准则是有效的。给出了译码错误概率的下界和上界。

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

查看原文本刊更多论文

An efficient algorithm for estimating the state sequence of a finite state machine given an output sequence

We consider the problem of sequentially estimating the states of non-unifilar finite state machines on the basis of the output symbols of the machine and show that a Fano-type inequality can be effectively used as a stopping criterion. Lower and upper bounds on the decoding error probability are given.

求助全文

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

来源期刊

SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications

自引率

0.00%

发文量