Method and system for performing decoding using a reduced-memory implementation
An approach for performing computations that require processing of values in a forward sweep as well as a reverse sweep, such as the Maximum A Posteriori (MAP) algorithm, is disclosed. A first series of values are computed, in which only every f th value of the first series of values and associated...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Venkataraman, Bharath Hammons, Roger Eroz, Mustafa |
| description | An approach for performing computations that require processing of values in a forward sweep as well as a reverse sweep, such as the Maximum A Posteriori (MAP) algorithm, is disclosed. A first series of values are computed, in which only every f
th
value of the first series of values and associated normalization values are stored. The first series of values are indexed such that these first series of values are partitioned in time as blocks. The first series of values are recalculated on a per block basis, whereby a second series of values are calculated in response to these recalculated first series of values. |
| format | Patent |
| fullrecord | <record><control><sourceid>uspatents_EFI</sourceid><recordid>TN_cdi_uspatents_applications_20030061563</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>20030061563</sourcerecordid><originalsourceid>FETCH-uspatents_applications_200300615633</originalsourceid><addsrcrecordid>eNqVyjEOAiEQhWEaC6PeYVqLTVDiXsBobIyN_WYCs0rCAGGg2Nu7a7yAzftf8a3V4071nRxgdCCTVGIYU4FMZQ77-AJHNrnlNFkWoZBrllzHxKlM4DkHYooVq09xq1YjBqHdrxu1v16e51vXJGOdlQyYc_D2q2U4am207g-n3ph_7AeRtj5f</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Method and system for performing decoding using a reduced-memory implementation</title><source>USPTO Published Applications</source><creator>Venkataraman, Bharath ; Hammons, Roger ; Eroz, Mustafa</creator><creatorcontrib>Venkataraman, Bharath ; Hammons, Roger ; Eroz, Mustafa</creatorcontrib><description>An approach for performing computations that require processing of values in a forward sweep as well as a reverse sweep, such as the Maximum A Posteriori (MAP) algorithm, is disclosed. A first series of values are computed, in which only every f
th
value of the first series of values and associated normalization values are stored. The first series of values are indexed such that these first series of values are partitioned in time as blocks. The first series of values are recalculated on a per block basis, whereby a second series of values are calculated in response to these recalculated first series of values.</description><language>eng</language><creationdate>2003</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/20030061563$$EPDF$$P50$$Guspatents$$Hfree_for_read</linktopdf><link.rule.ids>230,308,776,869,881,64032</link.rule.ids><linktorsrc>$$Uhttps://patentcenter.uspto.gov/applications/09957749$$EView_record_in_USPTO$$FView_record_in_$$GUSPTO$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Venkataraman, Bharath</creatorcontrib><creatorcontrib>Hammons, Roger</creatorcontrib><creatorcontrib>Eroz, Mustafa</creatorcontrib><title>Method and system for performing decoding using a reduced-memory implementation</title><description>An approach for performing computations that require processing of values in a forward sweep as well as a reverse sweep, such as the Maximum A Posteriori (MAP) algorithm, is disclosed. A first series of values are computed, in which only every f
th
value of the first series of values and associated normalization values are stored. The first series of values are indexed such that these first series of values are partitioned in time as blocks. The first series of values are recalculated on a per block basis, whereby a second series of values are calculated in response to these recalculated first series of values.</description><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2003</creationdate><recordtype>patent</recordtype><sourceid>EFI</sourceid><recordid>eNqVyjEOAiEQhWEaC6PeYVqLTVDiXsBobIyN_WYCs0rCAGGg2Nu7a7yAzftf8a3V4071nRxgdCCTVGIYU4FMZQ77-AJHNrnlNFkWoZBrllzHxKlM4DkHYooVq09xq1YjBqHdrxu1v16e51vXJGOdlQyYc_D2q2U4am207g-n3ph_7AeRtj5f</recordid><startdate>20030327</startdate><enddate>20030327</enddate><creator>Venkataraman, Bharath</creator><creator>Hammons, Roger</creator><creator>Eroz, Mustafa</creator><scope>EFI</scope></search><sort><creationdate>20030327</creationdate><title>Method and system for performing decoding using a reduced-memory implementation</title><author>Venkataraman, Bharath ; Hammons, Roger ; Eroz, Mustafa</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-uspatents_applications_200300615633</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2003</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Venkataraman, Bharath</creatorcontrib><creatorcontrib>Hammons, Roger</creatorcontrib><creatorcontrib>Eroz, Mustafa</creatorcontrib><collection>USPTO Published Applications</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Venkataraman, Bharath</au><au>Hammons, Roger</au><au>Eroz, Mustafa</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Method and system for performing decoding using a reduced-memory implementation</title><date>2003-03-27</date><risdate>2003</risdate><abstract>An approach for performing computations that require processing of values in a forward sweep as well as a reverse sweep, such as the Maximum A Posteriori (MAP) algorithm, is disclosed. A first series of values are computed, in which only every f
th
value of the first series of values and associated normalization values are stored. The first series of values are indexed such that these first series of values are partitioned in time as blocks. The first series of values are recalculated on a per block basis, whereby a second series of values are calculated in response to these recalculated first series of values.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_uspatents_applications_20030061563 |
| source | USPTO Published Applications |
| title | Method and system for performing decoding using a reduced-memory implementation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T15%3A30%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-uspatents_EFI&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Venkataraman,%20Bharath&rft.date=2003-03-27&rft_id=info:doi/&rft_dat=%3Cuspatents_EFI%3E20030061563%3C/uspatents_EFI%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |