Local Irreducibility of Tail-Biting Trellises

This paper investigates tail-biting trellis realizations for linear block codes. Intrinsic trellis properties are used to characterize irreducibility on given intervals of the time axis. It proves beneficial to always consider the trellis and its dual simultaneously. A major role is played by trelli...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2013-10, Vol.59 (10), p.6597-6610
Main Authors: Gluesing-Luerssen, Heide, Forney, G. David
Format: Article
Language:English
Subjects:
Applied sciences
Block codes
Codes
Codes on graphs
Coding, codes
Complexity theory
Controllability
duality
Exact sciences and technology
Generators
Indexes
Information theory
Information, signal and communications theory
Merging
minimality
Signal and communications theory
Telecommunications and information theory
Trajectory
trellis fragments
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c363t-4f19f317b607b682406abfca288017544621d29436ce64d9deb6728138167d9a3
cites cdi_FETCH-LOGICAL-c363t-4f19f317b607b682406abfca288017544621d29436ce64d9deb6728138167d9a3
container_end_page 6610
container_issue 10
container_start_page 6597
container_title IEEE transactions on information theory
container_volume 59
creator Gluesing-Luerssen, Heide
Forney, G. David
description This paper investigates tail-biting trellis realizations for linear block codes. Intrinsic trellis properties are used to characterize irreducibility on given intervals of the time axis. It proves beneficial to always consider the trellis and its dual simultaneously. A major role is played by trellis properties that amount to observability and controllability of trellis fragments of various lengths. For fragments of length less than the minimum span length of the code it is shown that fragment observability and fragment controllability are equivalent to irreducibility. For reducible trellises, a constructive reduction procedure is presented. The considerations also lead to a characterization for when the dual of a trellis allows a product factorization into elementary ("atomic") trellises.
doi_str_mv 10.1109/TIT.2013.2267612
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TIT_2013_2267612</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6527994</ieee_id><sourcerecordid>3074959251</sourcerecordid><originalsourceid>FETCH-LOGICAL-c363t-4f19f317b607b682406abfca288017544621d29436ce64d9deb6728138167d9a3</originalsourceid><addsrcrecordid>eNo9kMtLAzEQxoMoWKt3wcuCeMyaSbJ5HLX4KBS8rOeQzSaSsnZrsj30vzelpYdhGOb3zeND6B5IDUD0c7tsa0qA1ZQKKYBeoBk0jcRaNPwSzQgBhTXn6hrd5LwuJW-AzhBejc4O1TIl3-9c7OIQp301hqq1ccCvcYqbn6pNfhhi9vkWXQU7ZH93ynP0_f7WLj7x6utjuXhZYccEmzAPoAMD2QlSQlFOhO2Cs1QpArLhXFDoqeZMOC94r3vfCUkVMAVC9tqyOXo8zt2m8W_n82TW4y5tykoDnDHWaBC0UORIuTTmnHww2xR_bdobIOZgiimmmIMp5mRKkTydBttc_g7JblzMZx2VUjGheOEejlz03p_boqFSl7P_AaG8Z2g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1433359162</pqid></control><display><type>article</type><title>Local Irreducibility of Tail-Biting Trellises</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Gluesing-Luerssen, Heide ; Forney, G. David</creator><creatorcontrib>Gluesing-Luerssen, Heide ; Forney, G. David</creatorcontrib><description>This paper investigates tail-biting trellis realizations for linear block codes. Intrinsic trellis properties are used to characterize irreducibility on given intervals of the time axis. It proves beneficial to always consider the trellis and its dual simultaneously. A major role is played by trellis properties that amount to observability and controllability of trellis fragments of various lengths. For fragments of length less than the minimum span length of the code it is shown that fragment observability and fragment controllability are equivalent to irreducibility. For reducible trellises, a constructive reduction procedure is presented. The considerations also lead to a characterization for when the dual of a trellis allows a product factorization into elementary ("atomic") trellises.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2013.2267612</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Block codes ; Codes ; Codes on graphs ; Coding, codes ; Complexity theory ; Controllability ; duality ; Exact sciences and technology ; Generators ; Indexes ; Information theory ; Information, signal and communications theory ; Merging ; minimality ; Signal and communications theory ; Telecommunications and information theory ; Trajectory ; trellis fragments</subject><ispartof>IEEE transactions on information theory, 2013-10, Vol.59 (10), p.6597-6610</ispartof><rights>2014 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2013</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c363t-4f19f317b607b682406abfca288017544621d29436ce64d9deb6728138167d9a3</citedby><cites>FETCH-LOGICAL-c363t-4f19f317b607b682406abfca288017544621d29436ce64d9deb6728138167d9a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6527994$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=27783684$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Gluesing-Luerssen, Heide</creatorcontrib><creatorcontrib>Forney, G. David</creatorcontrib><title>Local Irreducibility of Tail-Biting Trellises</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>This paper investigates tail-biting trellis realizations for linear block codes. Intrinsic trellis properties are used to characterize irreducibility on given intervals of the time axis. It proves beneficial to always consider the trellis and its dual simultaneously. A major role is played by trellis properties that amount to observability and controllability of trellis fragments of various lengths. For fragments of length less than the minimum span length of the code it is shown that fragment observability and fragment controllability are equivalent to irreducibility. For reducible trellises, a constructive reduction procedure is presented. The considerations also lead to a characterization for when the dual of a trellis allows a product factorization into elementary ("atomic") trellises.</description><subject>Applied sciences</subject><subject>Block codes</subject><subject>Codes</subject><subject>Codes on graphs</subject><subject>Coding, codes</subject><subject>Complexity theory</subject><subject>Controllability</subject><subject>duality</subject><subject>Exact sciences and technology</subject><subject>Generators</subject><subject>Indexes</subject><subject>Information theory</subject><subject>Information, signal and communications theory</subject><subject>Merging</subject><subject>minimality</subject><subject>Signal and communications theory</subject><subject>Telecommunications and information theory</subject><subject>Trajectory</subject><subject>trellis fragments</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNo9kMtLAzEQxoMoWKt3wcuCeMyaSbJ5HLX4KBS8rOeQzSaSsnZrsj30vzelpYdhGOb3zeND6B5IDUD0c7tsa0qA1ZQKKYBeoBk0jcRaNPwSzQgBhTXn6hrd5LwuJW-AzhBejc4O1TIl3-9c7OIQp301hqq1ccCvcYqbn6pNfhhi9vkWXQU7ZH93ynP0_f7WLj7x6utjuXhZYccEmzAPoAMD2QlSQlFOhO2Cs1QpArLhXFDoqeZMOC94r3vfCUkVMAVC9tqyOXo8zt2m8W_n82TW4y5tykoDnDHWaBC0UORIuTTmnHww2xR_bdobIOZgiimmmIMp5mRKkTydBttc_g7JblzMZx2VUjGheOEejlz03p_boqFSl7P_AaG8Z2g</recordid><startdate>20131001</startdate><enddate>20131001</enddate><creator>Gluesing-Luerssen, Heide</creator><creator>Forney, G. David</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20131001</creationdate><title>Local Irreducibility of Tail-Biting Trellises</title><author>Gluesing-Luerssen, Heide ; Forney, G. David</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c363t-4f19f317b607b682406abfca288017544621d29436ce64d9deb6728138167d9a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Applied sciences</topic><topic>Block codes</topic><topic>Codes</topic><topic>Codes on graphs</topic><topic>Coding, codes</topic><topic>Complexity theory</topic><topic>Controllability</topic><topic>duality</topic><topic>Exact sciences and technology</topic><topic>Generators</topic><topic>Indexes</topic><topic>Information theory</topic><topic>Information, signal and communications theory</topic><topic>Merging</topic><topic>minimality</topic><topic>Signal and communications theory</topic><topic>Telecommunications and information theory</topic><topic>Trajectory</topic><topic>trellis fragments</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gluesing-Luerssen, Heide</creatorcontrib><creatorcontrib>Forney, G. David</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005–Present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gluesing-Luerssen, Heide</au><au>Forney, G. David</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Local Irreducibility of Tail-Biting Trellises</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2013-10-01</date><risdate>2013</risdate><volume>59</volume><issue>10</issue><spage>6597</spage><epage>6610</epage><pages>6597-6610</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>This paper investigates tail-biting trellis realizations for linear block codes. Intrinsic trellis properties are used to characterize irreducibility on given intervals of the time axis. It proves beneficial to always consider the trellis and its dual simultaneously. A major role is played by trellis properties that amount to observability and controllability of trellis fragments of various lengths. For fragments of length less than the minimum span length of the code it is shown that fragment observability and fragment controllability are equivalent to irreducibility. For reducible trellises, a constructive reduction procedure is presented. The considerations also lead to a characterization for when the dual of a trellis allows a product factorization into elementary ("atomic") trellises.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TIT.2013.2267612</doi><tpages>14</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0018-9448
ispartof IEEE transactions on information theory, 2013-10, Vol.59 (10), p.6597-6610
issn 0018-9448
1557-9654
language eng
recordid cdi_crossref_primary_10_1109_TIT_2013_2267612
source IEEE Electronic Library (IEL) Journals
subjects Applied sciences
Block codes
Codes
Codes on graphs
Coding, codes
Complexity theory
Controllability
duality
Exact sciences and technology
Generators
Indexes
Information theory
Information, signal and communications theory
Merging
minimality
Signal and communications theory
Telecommunications and information theory
Trajectory
trellis fragments
title Local Irreducibility of Tail-Biting Trellises
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T18%3A17%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Local%20Irreducibility%20of%20Tail-Biting%20Trellises&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Gluesing-Luerssen,%20Heide&rft.date=2013-10-01&rft.volume=59&rft.issue=10&rft.spage=6597&rft.epage=6610&rft.pages=6597-6610&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2013.2267612&rft_dat=%3Cproquest_cross%3E3074959251%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c363t-4f19f317b607b682406abfca288017544621d29436ce64d9deb6728138167d9a3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1433359162&rft_id=info:pmid/&rft_ieee_id=6527994&rfr_iscdi=true