Reducing complexity of tail-biting trellises

被引：0
|
作者：
Gluesing-Luerssen, Heide [1 ]
Forney, G. David, Jr. [1 ]
机构：
[1] Univ Kentucky, Dept Math, Lexington, KY 40506 USA
来源：
2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT) | 2012年
关键词：
CHARACTERISTIC GENERATORS; REALIZATIONS;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：646 / 650
页数：5
相关论文
共 50 条
  • [1] Lower bounds on the state complexity of linear tail-biting trellises
    Shany, Y
    Reuven, I
    Be'ery, Y
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (03) : 566 - 571
  • [2] Turbo decoding with tail-biting trellises
    Weiss, C
    Bettstetter, C
    Riedel, S
    Costello, DJ
    1998 URSI SYMPOSIUM ON SIGNALS, SYSTEMS, AND ELECTR ONICS, 1998, : 343 - 348
  • [3] On the complexity of exact maximum likelihood decoding on tail-biting trellises
    Shankar, P
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 104 - 104
  • [4] Local Irreducibility of Tail-Biting Trellises
    Gluesing-Luerssen, Heide
    Forney, G. David, Jr.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (10) : 6597 - 6610
  • [5] Turbo decoding with tail-biting trellises
    Munich Univ of Technology, Muenchen, Germany
    Conf Proc Int Symp Signals Syst Electron, (343-348):
  • [6] Construction of minimal tail-biting trellises
    Kotter, R
    Vardy, A
    1998 INFORMATION THEORY WORKSHOP - KILLARNEY, IRELAND, 1998, : 72 - 74
  • [7] Tail-biting trellises of block codes: Trellis complexity and Viterbi decoding complexity
    Reuven, I
    Be'ery, Y
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1999, E82A (10) : 2043 - 2051
  • [8] On the Algebraic Structure of Linear Tail-Biting Trellises
    Conti, David
    Boston, Nigel
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (05) : 2283 - 2299
  • [9] Approximate MAP decoding on tail-biting trellises
    Madhu, AS
    Shankar, P
    2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, 2005, : 1325 - 1328
  • [10] Characteristic Generators and Dualization for Tail-Biting Trellises
    Gluesing-Luerssen, Heide
    Weaver, Elizabeth A.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (11) : 7418 - 7430
12345