通过控制器颗粒分解实现咬尾网格的独特分解和可控性

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-02-23 DOI:10.1109/ITW.2015.7133082

G. David Forney

{"title":"通过控制器颗粒分解实现咬尾网格的独特分解和可控性","authors":"G. David Forney","doi":"10.1109/ITW.2015.7133082","DOIUrl":null,"url":null,"abstract":"The Conti-Boston factorization theorem (CBFT) for linear tail-biting trellis realizations is extended to group realizations with a new and simpler proof, based on a controller granule decomposition of the behavior and known controllability results for group realizations. Further controllability results are given; e.g., a trellis realization is controllable if and only if its top (controllability) granule is trivial.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Unique factorization and controllability of tail-biting trellis realizations via controller granule decompositions\",\"authors\":\"G. David Forney\",\"doi\":\"10.1109/ITW.2015.7133082\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Conti-Boston factorization theorem (CBFT) for linear tail-biting trellis realizations is extended to group realizations with a new and simpler proof, based on a controller granule decomposition of the behavior and known controllability results for group realizations. Further controllability results are given; e.g., a trellis realization is controllable if and only if its top (controllability) granule is trivial.\",\"PeriodicalId\":174797,\"journal\":{\"name\":\"2015 IEEE Information Theory Workshop (ITW)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Information Theory Workshop (ITW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2015.7133082\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2015.7133082","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

基于控制器颗粒的行为分解和群实现的已知可控性结果，将线性咬尾网格实现的coni - boston分解定理(CBFT)扩展到群实现，并给出了一个新的更简单的证明。给出了进一步的可控性结果;例如，一个网格实现是可控的，当且仅当它的顶部(可控性)颗粒是平凡的。

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

查看原文本刊更多论文

Unique factorization and controllability of tail-biting trellis realizations via controller granule decompositions

The Conti-Boston factorization theorem (CBFT) for linear tail-biting trellis realizations is extended to group realizations with a new and simpler proof, based on a controller granule decomposition of the behavior and known controllability results for group realizations. Further controllability results are given; e.g., a trellis realization is controllable if and only if its top (controllability) granule is trivial.

求助全文

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

来源期刊

2015 IEEE Information Theory Workshop (ITW)

自引率

0.00%

发文量