Loading…
Architectural tradeoffs for survivor sequence memory management in Viterbi decoders
In a Viterbi decoder, there are two known memory organization techniques for the storage of survivor sequences from which the decoded information sequence is retrieved, namely, register exchange method and traceback method. This work extends previously known traceback approaches, describes two new t...
Saved in:
| Published in: | IEEE transactions on communications 1993-03, Vol.41 (3), p.425-429 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| 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-c306t-be76c44945cac5e97e4ea6680fbb4a7940e8437e346264f21460ad7efda1323c3 |
|---|---|
| cites | cdi_FETCH-LOGICAL-c306t-be76c44945cac5e97e4ea6680fbb4a7940e8437e346264f21460ad7efda1323c3 |
| container_end_page | 429 |
| container_issue | 3 |
| container_start_page | 425 |
| container_title | IEEE transactions on communications |
| container_volume | 41 |
| creator | Feygin, G. Gulak, P. |
| description | In a Viterbi decoder, there are two known memory organization techniques for the storage of survivor sequences from which the decoded information sequence is retrieved, namely, register exchange method and traceback method. This work extends previously known traceback approaches, describes two new traceback algorithms, and compares various traceback methods with each other. Memory size, latency, and implementational complexity of the survivor sequence management are analyzed for both uniprocessor and multiprocessor realizations of Viterbi decoders. A new, one-pointer traceback method is shown to be better than previously known traceback methods.< > |
| doi_str_mv | 10.1109/26.221067 |
| format | article |
| fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_221067</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>221067</ieee_id><sourcerecordid>28564194</sourcerecordid><originalsourceid>FETCH-LOGICAL-c306t-be76c44945cac5e97e4ea6680fbb4a7940e8437e346264f21460ad7efda1323c3</originalsourceid><addsrcrecordid>eNo9kMtLw0AQhxdRsFYPXj3tQQQPqbOP7CbHUnxBwYOPa9hsZnUlj7qbFPrfm5LS0wzM9_sYfoRcM1gwBvkDVwvOGSh9QmYsTbMEslSfkhlADonSOjsnFzH-AoAEIWbkfRnsj-_R9kMwNe2DqbBzLlLXBRqHsPXb_YJ_A7YWaYNNF3a0Ma35xgbbnvqWfo35UHpaoe0qDPGSnDlTR7w6zDn5fHr8WL0k67fn19VynVgBqk9K1MpKmcvUGptirlGiUSoDV5bS6FwCZlJoFFJxJR1nUoGpNLrKMMGFFXNyN3k3oRv_i33R-Gixrk2L3RALnqVKslyO4P0E2tDFGNAVm-AbE3YFg2JfW8FVMdU2srcHqYnW1C6Y1vp4DEidc5mqEbuZMI-Ix-vB8Q_DdXVX</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28564194</pqid></control><display><type>article</type><title>Architectural tradeoffs for survivor sequence memory management in Viterbi decoders</title><source>IEEE Xplore (Online service)</source><creator>Feygin, G. ; Gulak, P.</creator><creatorcontrib>Feygin, G. ; Gulak, P.</creatorcontrib><description>In a Viterbi decoder, there are two known memory organization techniques for the storage of survivor sequences from which the decoded information sequence is retrieved, namely, register exchange method and traceback method. This work extends previously known traceback approaches, describes two new traceback algorithms, and compares various traceback methods with each other. Memory size, latency, and implementational complexity of the survivor sequence management are analyzed for both uniprocessor and multiprocessor realizations of Viterbi decoders. A new, one-pointer traceback method is shown to be better than previously known traceback methods.< ></description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/26.221067</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Coding, codes ; Decoding ; Delay ; Design methodology ; Energy consumption ; Exact sciences and technology ; Information retrieval ; Information, signal and communications theory ; Memory management ; Read-write memory ; Registers ; Signal and communications theory ; Telecommunications and information theory ; Very large scale integration ; Viterbi algorithm</subject><ispartof>IEEE transactions on communications, 1993-03, Vol.41 (3), p.425-429</ispartof><rights>1993 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c306t-be76c44945cac5e97e4ea6680fbb4a7940e8437e346264f21460ad7efda1323c3</citedby><cites>FETCH-LOGICAL-c306t-be76c44945cac5e97e4ea6680fbb4a7940e8437e346264f21460ad7efda1323c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/221067$$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&idt=4792456$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Feygin, G.</creatorcontrib><creatorcontrib>Gulak, P.</creatorcontrib><title>Architectural tradeoffs for survivor sequence memory management in Viterbi decoders</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>In a Viterbi decoder, there are two known memory organization techniques for the storage of survivor sequences from which the decoded information sequence is retrieved, namely, register exchange method and traceback method. This work extends previously known traceback approaches, describes two new traceback algorithms, and compares various traceback methods with each other. Memory size, latency, and implementational complexity of the survivor sequence management are analyzed for both uniprocessor and multiprocessor realizations of Viterbi decoders. A new, one-pointer traceback method is shown to be better than previously known traceback methods.< ></description><subject>Applied sciences</subject><subject>Coding, codes</subject><subject>Decoding</subject><subject>Delay</subject><subject>Design methodology</subject><subject>Energy consumption</subject><subject>Exact sciences and technology</subject><subject>Information retrieval</subject><subject>Information, signal and communications theory</subject><subject>Memory management</subject><subject>Read-write memory</subject><subject>Registers</subject><subject>Signal and communications theory</subject><subject>Telecommunications and information theory</subject><subject>Very large scale integration</subject><subject>Viterbi algorithm</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1993</creationdate><recordtype>article</recordtype><recordid>eNo9kMtLw0AQhxdRsFYPXj3tQQQPqbOP7CbHUnxBwYOPa9hsZnUlj7qbFPrfm5LS0wzM9_sYfoRcM1gwBvkDVwvOGSh9QmYsTbMEslSfkhlADonSOjsnFzH-AoAEIWbkfRnsj-_R9kMwNe2DqbBzLlLXBRqHsPXb_YJ_A7YWaYNNF3a0Ma35xgbbnvqWfo35UHpaoe0qDPGSnDlTR7w6zDn5fHr8WL0k67fn19VynVgBqk9K1MpKmcvUGptirlGiUSoDV5bS6FwCZlJoFFJxJR1nUoGpNLrKMMGFFXNyN3k3oRv_i33R-Gixrk2L3RALnqVKslyO4P0E2tDFGNAVm-AbE3YFg2JfW8FVMdU2srcHqYnW1C6Y1vp4DEidc5mqEbuZMI-Ix-vB8Q_DdXVX</recordid><startdate>19930301</startdate><enddate>19930301</enddate><creator>Feygin, G.</creator><creator>Gulak, P.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope></search><sort><creationdate>19930301</creationdate><title>Architectural tradeoffs for survivor sequence memory management in Viterbi decoders</title><author>Feygin, G. ; Gulak, P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c306t-be76c44945cac5e97e4ea6680fbb4a7940e8437e346264f21460ad7efda1323c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1993</creationdate><topic>Applied sciences</topic><topic>Coding, codes</topic><topic>Decoding</topic><topic>Delay</topic><topic>Design methodology</topic><topic>Energy consumption</topic><topic>Exact sciences and technology</topic><topic>Information retrieval</topic><topic>Information, signal and communications theory</topic><topic>Memory management</topic><topic>Read-write memory</topic><topic>Registers</topic><topic>Signal and communications theory</topic><topic>Telecommunications and information theory</topic><topic>Very large scale integration</topic><topic>Viterbi algorithm</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Feygin, G.</creatorcontrib><creatorcontrib>Gulak, P.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE transactions on communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Feygin, G.</au><au>Gulak, P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Architectural tradeoffs for survivor sequence memory management in Viterbi decoders</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>1993-03-01</date><risdate>1993</risdate><volume>41</volume><issue>3</issue><spage>425</spage><epage>429</epage><pages>425-429</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>In a Viterbi decoder, there are two known memory organization techniques for the storage of survivor sequences from which the decoded information sequence is retrieved, namely, register exchange method and traceback method. This work extends previously known traceback approaches, describes two new traceback algorithms, and compares various traceback methods with each other. Memory size, latency, and implementational complexity of the survivor sequence management are analyzed for both uniprocessor and multiprocessor realizations of Viterbi decoders. A new, one-pointer traceback method is shown to be better than previously known traceback methods.< ></abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/26.221067</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0090-6778 |
| ispartof | IEEE transactions on communications, 1993-03, Vol.41 (3), p.425-429 |
| issn | 0090-6778 1558-0857 |
| language | eng |
| recordid | cdi_ieee_primary_221067 |
| source | IEEE Xplore (Online service) |
| subjects | Applied sciences Coding, codes Decoding Delay Design methodology Energy consumption Exact sciences and technology Information retrieval Information, signal and communications theory Memory management Read-write memory Registers Signal and communications theory Telecommunications and information theory Very large scale integration Viterbi algorithm |
| title | Architectural tradeoffs for survivor sequence memory management in Viterbi decoders |
| url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T18%3A59%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Architectural%20tradeoffs%20for%20survivor%20sequence%20memory%20management%20in%20Viterbi%20decoders&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Feygin,%20G.&rft.date=1993-03-01&rft.volume=41&rft.issue=3&rft.spage=425&rft.epage=429&rft.pages=425-429&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/26.221067&rft_dat=%3Cproquest_ieee_%3E28564194%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c306t-be76c44945cac5e97e4ea6680fbb4a7940e8437e346264f21460ad7efda1323c3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=28564194&rft_id=info:pmid/&rft_ieee_id=221067&rfr_iscdi=true |