Analogue decoding of tail-biting convolutional codes based on Tanner graph
A scheme is proposed to decode a tail-biting convolutional code based on its Tanner graph, which is traditionally done using a forward-backward MAP algorithm. Therefore, decoding may be performed using a standard sum-product algorithm. With respect to decoding based on trellis, all variables in a Ta...
Gespeichert in:
| Veröffentlicht in: | Electronics letters 2006-09, Vol.42 (20), p.1-1 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1 |
|---|---|
| container_issue | 20 |
| container_start_page | 1 |
| container_title | Electronics letters |
| container_volume | 42 |
| creator | Zahabi, M R Meghdadi, V Cances, J-P |
| description | A scheme is proposed to decode a tail-biting convolutional code based on its Tanner graph, which is traditionally done using a forward-backward MAP algorithm. Therefore, decoding may be performed using a standard sum-product algorithm. With respect to decoding based on trellis, all variables in a Tanner graph are binary, which may lead to complexity reduction. A min-sum algorithm is used to decrease the analogue circuit complexity. Simulation shows there is no significant degradation compared with more complex traditional methods. |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_1651439513</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1651439513</sourcerecordid><originalsourceid>FETCH-LOGICAL-p613-85ea808de9c973b487eee8ca41f50ddb273e411249d39657f7a7267d4b21f82f3</originalsourceid><addsrcrecordid>eNpdj0tLxDAUhYMoWEf_Q8CNm0JvHk2yHAafDLjpwt2QNje1Q01q0_r7zaCrWV0--Djn3AtSAJdVaQA-LklRVcBLCUZck5uUjhmZMaogb9tgx9ivSB120Q2hp9HTxQ5j2Q7LCbsYfuK4LkPMZiaHibY2oaMx0MaGgDPtZzt93pIrb8eEd_93Q5qnx2b3Uu7fn19323051XmDlmh1pR2azijeCq0QUXdWgJeVcy1THAUAE8ZxU0vllVWsVk60DLxmnm_Iw1_sNMfvFdNy-BpSh-NoA8Y1HaCWILiRwLN6f6Ye4zrnN04Wk0LnGsF_AZkRVyM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1625481244</pqid></control><display><type>article</type><title>Analogue decoding of tail-biting convolutional codes based on Tanner graph</title><source>Alma/SFX Local Collection</source><creator>Zahabi, M R ; Meghdadi, V ; Cances, J-P</creator><creatorcontrib>Zahabi, M R ; Meghdadi, V ; Cances, J-P</creatorcontrib><description>A scheme is proposed to decode a tail-biting convolutional code based on its Tanner graph, which is traditionally done using a forward-backward MAP algorithm. Therefore, decoding may be performed using a standard sum-product algorithm. With respect to decoding based on trellis, all variables in a Tanner graph are binary, which may lead to complexity reduction. A min-sum algorithm is used to decrease the analogue circuit complexity. Simulation shows there is no significant degradation compared with more complex traditional methods.</description><identifier>ISSN: 0013-5194</identifier><identifier>EISSN: 1350-911X</identifier><identifier>CODEN: ELLEAK</identifier><language>eng</language><publisher>Stevenage: John Wiley & Sons, Inc</publisher><subject>Algorithms ; Analogue ; Circuits ; Complexity ; Computer simulation ; Decoding ; Graphs</subject><ispartof>Electronics letters, 2006-09, Vol.42 (20), p.1-1</ispartof><rights>Copyright The Institution of Engineering & Technology Sep 28, 2006</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784</link.rule.ids></links><search><creatorcontrib>Zahabi, M R</creatorcontrib><creatorcontrib>Meghdadi, V</creatorcontrib><creatorcontrib>Cances, J-P</creatorcontrib><title>Analogue decoding of tail-biting convolutional codes based on Tanner graph</title><title>Electronics letters</title><description>A scheme is proposed to decode a tail-biting convolutional code based on its Tanner graph, which is traditionally done using a forward-backward MAP algorithm. Therefore, decoding may be performed using a standard sum-product algorithm. With respect to decoding based on trellis, all variables in a Tanner graph are binary, which may lead to complexity reduction. A min-sum algorithm is used to decrease the analogue circuit complexity. Simulation shows there is no significant degradation compared with more complex traditional methods.</description><subject>Algorithms</subject><subject>Analogue</subject><subject>Circuits</subject><subject>Complexity</subject><subject>Computer simulation</subject><subject>Decoding</subject><subject>Graphs</subject><issn>0013-5194</issn><issn>1350-911X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNpdj0tLxDAUhYMoWEf_Q8CNm0JvHk2yHAafDLjpwt2QNje1Q01q0_r7zaCrWV0--Djn3AtSAJdVaQA-LklRVcBLCUZck5uUjhmZMaogb9tgx9ivSB120Q2hp9HTxQ5j2Q7LCbsYfuK4LkPMZiaHibY2oaMx0MaGgDPtZzt93pIrb8eEd_93Q5qnx2b3Uu7fn19323051XmDlmh1pR2azijeCq0QUXdWgJeVcy1THAUAE8ZxU0vllVWsVk60DLxmnm_Iw1_sNMfvFdNy-BpSh-NoA8Y1HaCWILiRwLN6f6Ye4zrnN04Wk0LnGsF_AZkRVyM</recordid><startdate>20060928</startdate><enddate>20060928</enddate><creator>Zahabi, M R</creator><creator>Meghdadi, V</creator><creator>Cances, J-P</creator><general>John Wiley & Sons, Inc</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L6V</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>7SP</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>L7M</scope></search><sort><creationdate>20060928</creationdate><title>Analogue decoding of tail-biting convolutional codes based on Tanner graph</title><author>Zahabi, M R ; Meghdadi, V ; Cances, J-P</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p613-85ea808de9c973b487eee8ca41f50ddb273e411249d39657f7a7267d4b21f82f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithms</topic><topic>Analogue</topic><topic>Circuits</topic><topic>Complexity</topic><topic>Computer simulation</topic><topic>Decoding</topic><topic>Graphs</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zahabi, M R</creatorcontrib><creatorcontrib>Meghdadi, V</creatorcontrib><creatorcontrib>Cances, J-P</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>Electronics letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zahabi, M R</au><au>Meghdadi, V</au><au>Cances, J-P</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Analogue decoding of tail-biting convolutional codes based on Tanner graph</atitle><jtitle>Electronics letters</jtitle><date>2006-09-28</date><risdate>2006</risdate><volume>42</volume><issue>20</issue><spage>1</spage><epage>1</epage><pages>1-1</pages><issn>0013-5194</issn><eissn>1350-911X</eissn><coden>ELLEAK</coden><abstract>A scheme is proposed to decode a tail-biting convolutional code based on its Tanner graph, which is traditionally done using a forward-backward MAP algorithm. Therefore, decoding may be performed using a standard sum-product algorithm. With respect to decoding based on trellis, all variables in a Tanner graph are binary, which may lead to complexity reduction. A min-sum algorithm is used to decrease the analogue circuit complexity. Simulation shows there is no significant degradation compared with more complex traditional methods.</abstract><cop>Stevenage</cop><pub>John Wiley & Sons, Inc</pub><tpages>1</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0013-5194 |
| ispartof | Electronics letters, 2006-09, Vol.42 (20), p.1-1 |
| issn | 0013-5194 1350-911X |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1651439513 |
| source | Alma/SFX Local Collection |
| subjects | Algorithms Analogue Circuits Complexity Computer simulation Decoding Graphs |
| title | Analogue decoding of tail-biting convolutional codes based on Tanner graph |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T08%3A45%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Analogue%20decoding%20of%20tail-biting%20convolutional%20codes%20based%20on%20Tanner%20graph&rft.jtitle=Electronics%20letters&rft.au=Zahabi,%20M%20R&rft.date=2006-09-28&rft.volume=42&rft.issue=20&rft.spage=1&rft.epage=1&rft.pages=1-1&rft.issn=0013-5194&rft.eissn=1350-911X&rft.coden=ELLEAK&rft_id=info:doi/&rft_dat=%3Cproquest%3E1651439513%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1625481244&rft_id=info:pmid/&rfr_iscdi=true |