具有存储器和约束输入的信道容量的上界

Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494) Pub Date : 2001-09-02 DOI:10.1109/ITW.2001.955166

P. Vontobel, D. Arnold

{"title":"具有存储器和约束输入的信道容量的上界","authors":"P. Vontobel, D. Arnold","doi":"10.1109/ITW.2001.955166","DOIUrl":null,"url":null,"abstract":"A method for computing upper bounds on capacity for a class of time-invariant indecomposable finite state channels is presented. It extends a result for finite-input memoryless channels. Numerical results are provided for selected channels having memory and constraint (binary) input.","PeriodicalId":288814,"journal":{"name":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"56","resultStr":"{\"title\":\"An upper bound on the capacity of channels with memory and constraint input\",\"authors\":\"P. Vontobel, D. Arnold\",\"doi\":\"10.1109/ITW.2001.955166\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method for computing upper bounds on capacity for a class of time-invariant indecomposable finite state channels is presented. It extends a result for finite-input memoryless channels. Numerical results are provided for selected channels having memory and constraint (binary) input.\",\"PeriodicalId\":288814,\"journal\":{\"name\":\"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"56\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2001.955166\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2001.955166","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 56

摘要

给出了一类定常不可分解有限状态信道容量上界的计算方法。它扩展了有限输入无内存通道的结果。给出了具有存储和约束(二进制)输入的选定通道的数值结果。

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

查看原文本刊更多论文

An upper bound on the capacity of channels with memory and constraint input

A method for computing upper bounds on capacity for a class of time-invariant indecomposable finite state channels is presented. It extends a result for finite-input memoryless channels. Numerical results are provided for selected channels having memory and constraint (binary) input.

求助全文

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

来源期刊

Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)

自引率

0.00%

发文量