Design of high speed low power viterbi decoder for TCM system
Viterbi decoder is the most power hungry module in the Trelli coded modulation system. In VLSI implementation, reduced chip area, low power consumption, improved speed are the main concerns to be obtained. In this brief, high speed low power Viterbi algorithm architecture is proposed to decode the h...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 190 |
---|---|
container_issue | |
container_start_page | 185 |
container_title | |
container_volume | |
creator | Nargis, J. Vaithiyanathan, D. Seshasayanan, R. |
description | Viterbi decoder is the most power hungry module in the Trelli coded modulation system. In VLSI implementation, reduced chip area, low power consumption, improved speed are the main concerns to be obtained. In this brief, high speed low power Viterbi algorithm architecture is proposed to decode the high rate convolution codes. Constraint length of high rate convolution code should be high to maintain low error probability. But computational complexity of the Viterbi algorithm for high rate convolution code increases exponentially with the constraint length. This computational problem can be solved by trimming the least likely paths at each trelli stage in the T-algorithm; as a result significant power reduction can also be achieved. Furthermore, the pre-computation technique is used to speed up the process of searching for the optimal path metric from the ACSU loop. Architecture of the Add-Compare-Select loop is modified using the pre-computation architecture. This shortens the long critical path introduced by the conventional T-algorithm. Register exchange algorithm is used for the survivor memory unit design, since it is faster and requires lesser memory. Conceptually, Register exchange algorithm has a pre-defined end state. Since the optimized T-algorithm is used, pre-defining the end state is not possible. This issue is focused and appropriate solution is provided in this paper. From the simulation results it is observed that the proposed Viterbi decoder architecture can reduce significant amount of computations, power consumption with negligible performance reduction. |
doi_str_mv | 10.1109/ICICES.2013.6508239 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6508239</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6508239</ieee_id><sourcerecordid>6508239</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-6f9ba1d0614d4aa199005868ea00646959b7a4f498898c2ee2b677238db02faa3</originalsourceid><addsrcrecordid>eNo1j0FLwzAYhiMiqLO_YJf8gdYvSZt8OXiQOmdh4sEJ3ka6fNkimy1NcezfO3CeHp7D88LL2FRAIQTY-6Zu6tl7IUGoQleAUtkLditKbVRlED8vWWYN_ru21yxL6QsATrWWiDfs4YlS3HzzLvBt3Gx56ok833UH3ncHGvhPHGloI_e07vzJQzfwZf3K0zGNtL9jV8HtEmVnTtjH82xZv-SLt3lTPy7yKEw15jrY1gkPWpS-dE5YC1ChRnIAutS2sq1xZSgtosW1JJKtNkYq9C3I4JyasOnfbiSiVT_EvRuOq_Nj9QvhlkjL</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Design of high speed low power viterbi decoder for TCM system</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Nargis, J. ; Vaithiyanathan, D. ; Seshasayanan, R.</creator><creatorcontrib>Nargis, J. ; Vaithiyanathan, D. ; Seshasayanan, R.</creatorcontrib><description>Viterbi decoder is the most power hungry module in the Trelli coded modulation system. In VLSI implementation, reduced chip area, low power consumption, improved speed are the main concerns to be obtained. In this brief, high speed low power Viterbi algorithm architecture is proposed to decode the high rate convolution codes. Constraint length of high rate convolution code should be high to maintain low error probability. But computational complexity of the Viterbi algorithm for high rate convolution code increases exponentially with the constraint length. This computational problem can be solved by trimming the least likely paths at each trelli stage in the T-algorithm; as a result significant power reduction can also be achieved. Furthermore, the pre-computation technique is used to speed up the process of searching for the optimal path metric from the ACSU loop. Architecture of the Add-Compare-Select loop is modified using the pre-computation architecture. This shortens the long critical path introduced by the conventional T-algorithm. Register exchange algorithm is used for the survivor memory unit design, since it is faster and requires lesser memory. Conceptually, Register exchange algorithm has a pre-defined end state. Since the optimized T-algorithm is used, pre-defining the end state is not possible. This issue is focused and appropriate solution is provided in this paper. From the simulation results it is observed that the proposed Viterbi decoder architecture can reduce significant amount of computations, power consumption with negligible performance reduction.</description><identifier>ISBN: 9781467357869</identifier><identifier>ISBN: 1467357863</identifier><identifier>EISBN: 146735788X</identifier><identifier>EISBN: 9781467357883</identifier><identifier>EISBN: 9781467357876</identifier><identifier>EISBN: 1467357871</identifier><identifier>DOI: 10.1109/ICICES.2013.6508239</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer architecture ; Convolution ; convolution code ; Convolutional codes ; Decoding ; Measurement ; pre-computation ; register exchange ; Registers ; state reduction ; Viterbi algorithm ; viterbi decoder ; VLSI</subject><ispartof>2013 International Conference on Information Communication and Embedded Systems (ICICES), 2013, p.185-190</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6508239$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,27916,54911</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6508239$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Nargis, J.</creatorcontrib><creatorcontrib>Vaithiyanathan, D.</creatorcontrib><creatorcontrib>Seshasayanan, R.</creatorcontrib><title>Design of high speed low power viterbi decoder for TCM system</title><title>2013 International Conference on Information Communication and Embedded Systems (ICICES)</title><addtitle>ICICES</addtitle><description>Viterbi decoder is the most power hungry module in the Trelli coded modulation system. In VLSI implementation, reduced chip area, low power consumption, improved speed are the main concerns to be obtained. In this brief, high speed low power Viterbi algorithm architecture is proposed to decode the high rate convolution codes. Constraint length of high rate convolution code should be high to maintain low error probability. But computational complexity of the Viterbi algorithm for high rate convolution code increases exponentially with the constraint length. This computational problem can be solved by trimming the least likely paths at each trelli stage in the T-algorithm; as a result significant power reduction can also be achieved. Furthermore, the pre-computation technique is used to speed up the process of searching for the optimal path metric from the ACSU loop. Architecture of the Add-Compare-Select loop is modified using the pre-computation architecture. This shortens the long critical path introduced by the conventional T-algorithm. Register exchange algorithm is used for the survivor memory unit design, since it is faster and requires lesser memory. Conceptually, Register exchange algorithm has a pre-defined end state. Since the optimized T-algorithm is used, pre-defining the end state is not possible. This issue is focused and appropriate solution is provided in this paper. From the simulation results it is observed that the proposed Viterbi decoder architecture can reduce significant amount of computations, power consumption with negligible performance reduction.</description><subject>Computer architecture</subject><subject>Convolution</subject><subject>convolution code</subject><subject>Convolutional codes</subject><subject>Decoding</subject><subject>Measurement</subject><subject>pre-computation</subject><subject>register exchange</subject><subject>Registers</subject><subject>state reduction</subject><subject>Viterbi algorithm</subject><subject>viterbi decoder</subject><subject>VLSI</subject><isbn>9781467357869</isbn><isbn>1467357863</isbn><isbn>146735788X</isbn><isbn>9781467357883</isbn><isbn>9781467357876</isbn><isbn>1467357871</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2013</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1j0FLwzAYhiMiqLO_YJf8gdYvSZt8OXiQOmdh4sEJ3ka6fNkimy1NcezfO3CeHp7D88LL2FRAIQTY-6Zu6tl7IUGoQleAUtkLditKbVRlED8vWWYN_ru21yxL6QsATrWWiDfs4YlS3HzzLvBt3Gx56ok833UH3ncHGvhPHGloI_e07vzJQzfwZf3K0zGNtL9jV8HtEmVnTtjH82xZv-SLt3lTPy7yKEw15jrY1gkPWpS-dE5YC1ChRnIAutS2sq1xZSgtosW1JJKtNkYq9C3I4JyasOnfbiSiVT_EvRuOq_Nj9QvhlkjL</recordid><startdate>201302</startdate><enddate>201302</enddate><creator>Nargis, J.</creator><creator>Vaithiyanathan, D.</creator><creator>Seshasayanan, R.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201302</creationdate><title>Design of high speed low power viterbi decoder for TCM system</title><author>Nargis, J. ; Vaithiyanathan, D. ; Seshasayanan, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-6f9ba1d0614d4aa199005868ea00646959b7a4f498898c2ee2b677238db02faa3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Computer architecture</topic><topic>Convolution</topic><topic>convolution code</topic><topic>Convolutional codes</topic><topic>Decoding</topic><topic>Measurement</topic><topic>pre-computation</topic><topic>register exchange</topic><topic>Registers</topic><topic>state reduction</topic><topic>Viterbi algorithm</topic><topic>viterbi decoder</topic><topic>VLSI</topic><toplevel>online_resources</toplevel><creatorcontrib>Nargis, J.</creatorcontrib><creatorcontrib>Vaithiyanathan, D.</creatorcontrib><creatorcontrib>Seshasayanan, R.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Nargis, J.</au><au>Vaithiyanathan, D.</au><au>Seshasayanan, R.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Design of high speed low power viterbi decoder for TCM system</atitle><btitle>2013 International Conference on Information Communication and Embedded Systems (ICICES)</btitle><stitle>ICICES</stitle><date>2013-02</date><risdate>2013</risdate><spage>185</spage><epage>190</epage><pages>185-190</pages><isbn>9781467357869</isbn><isbn>1467357863</isbn><eisbn>146735788X</eisbn><eisbn>9781467357883</eisbn><eisbn>9781467357876</eisbn><eisbn>1467357871</eisbn><abstract>Viterbi decoder is the most power hungry module in the Trelli coded modulation system. In VLSI implementation, reduced chip area, low power consumption, improved speed are the main concerns to be obtained. In this brief, high speed low power Viterbi algorithm architecture is proposed to decode the high rate convolution codes. Constraint length of high rate convolution code should be high to maintain low error probability. But computational complexity of the Viterbi algorithm for high rate convolution code increases exponentially with the constraint length. This computational problem can be solved by trimming the least likely paths at each trelli stage in the T-algorithm; as a result significant power reduction can also be achieved. Furthermore, the pre-computation technique is used to speed up the process of searching for the optimal path metric from the ACSU loop. Architecture of the Add-Compare-Select loop is modified using the pre-computation architecture. This shortens the long critical path introduced by the conventional T-algorithm. Register exchange algorithm is used for the survivor memory unit design, since it is faster and requires lesser memory. Conceptually, Register exchange algorithm has a pre-defined end state. Since the optimized T-algorithm is used, pre-defining the end state is not possible. This issue is focused and appropriate solution is provided in this paper. From the simulation results it is observed that the proposed Viterbi decoder architecture can reduce significant amount of computations, power consumption with negligible performance reduction.</abstract><pub>IEEE</pub><doi>10.1109/ICICES.2013.6508239</doi><tpages>6</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 9781467357869 |
ispartof | 2013 International Conference on Information Communication and Embedded Systems (ICICES), 2013, p.185-190 |
issn | |
language | eng |
recordid | cdi_ieee_primary_6508239 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Computer architecture Convolution convolution code Convolutional codes Decoding Measurement pre-computation register exchange Registers state reduction Viterbi algorithm viterbi decoder VLSI |
title | Design of high speed low power viterbi decoder for TCM system |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T07%3A45%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Design%20of%20high%20speed%20low%20power%20viterbi%20decoder%20for%20TCM%20system&rft.btitle=2013%20International%20Conference%20on%20Information%20Communication%20and%20Embedded%20Systems%20(ICICES)&rft.au=Nargis,%20J.&rft.date=2013-02&rft.spage=185&rft.epage=190&rft.pages=185-190&rft.isbn=9781467357869&rft.isbn_list=1467357863&rft_id=info:doi/10.1109/ICICES.2013.6508239&rft_dat=%3Cieee_6IE%3E6508239%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=146735788X&rft.eisbn_list=9781467357883&rft.eisbn_list=9781467357876&rft.eisbn_list=1467357871&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6508239&rfr_iscdi=true |