Reducing complexity of tail-biting trellises
Information Theory Proceedings（2012）
摘要
It is shown that a trellis realization can be locally reduced if it is not state-trim, branch-trim, proper, observable, and controllable. These conditions are not sufficient for local irreducibility. Making use of notions that amount to “almost unobservability/uncontrollability”, a necessary and sufficient criterion of local irreducibility for tail-biting trellises is presented.
更多查看译文
关键词
computational complexity,trellis codes,branch-trim,local irreducibility,reducing complexity,state-trim,tail-biting trellises,trellis realization,uncontrollability,unobservability
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要