On Viterbi detector path metric differences
This letter continues the investigation of methods for computing exact bounds on the path metric differences in maximum-likelihood sequence detectors based upon the Viterbi algorithm. New upper and lower estimates for these bounds are presented and recast in terms of a collection of linear programmi...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on communications 1998-12, Vol.46 (12), p.1549-1554 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1554 |
|---|---|
| container_issue | 12 |
| container_start_page | 1549 |
| container_title | IEEE transactions on communications |
| container_volume | 46 |
| creator | Vityaev, A. Siegel, P.H. |
| description | This letter continues the investigation of methods for computing exact bounds on the path metric differences in maximum-likelihood sequence detectors based upon the Viterbi algorithm. New upper and lower estimates for these bounds are presented and recast in terms of a collection of linear programming problems. These estimates improve upon previously proposed linear programming bounds. The estimates are applied to derive exact bounds or provably close to exact bounds for several Viterbi detectors corresponding to coded and uncoded partial-response channels of practical interest in digital magnetic and optical recording. |
| doi_str_mv | 10.1109/26.737388 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_737388</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>737388</ieee_id><sourcerecordid>26681825</sourcerecordid><originalsourceid>FETCH-LOGICAL-c308t-4896e50a5503aa0c7867c47aa9da14d256980131ccc1f3efc5e0c3e42a04d32e3</originalsourceid><addsrcrecordid>eNqF0DtLBDEUBeAgCo6rha3VVILIrDfJ5DGlLL5gYRu1HeKdOxiZl0m28N-7yyy2Vqc4H6c4jF1yWHIO1Z3QSyONtPaIZVwpW4BV5phlABUU2hh7ys5i_AKAEqTM2O1myN99ovDh84YSYRpDPrn0mfeUgse88W1LgQakeM5OWtdFujjkgr09Pryunov15ulldb8uUIJNRWkrTQqcUiCdAzRWGyyNc1XjeNkIpSsLXHJE5K2kFhUBSiqFg7KRguSCXc-7Uxi_txRT3fuI1HVuoHEba2EVCCPV_1Bry63Yw5sZYhhjDNTWU_C9Cz81h3r_247W8287ezVbT0R_7lD-Ai6VZkQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>26681825</pqid></control><display><type>article</type><title>On Viterbi detector path metric differences</title><source>IEEE Electronic Library (IEL)</source><creator>Vityaev, A. ; Siegel, P.H.</creator><creatorcontrib>Vityaev, A. ; Siegel, P.H.</creatorcontrib><description>This letter continues the investigation of methods for computing exact bounds on the path metric differences in maximum-likelihood sequence detectors based upon the Viterbi algorithm. New upper and lower estimates for these bounds are presented and recast in terms of a collection of linear programming problems. These estimates improve upon previously proposed linear programming bounds. The estimates are applied to derive exact bounds or provably close to exact bounds for several Viterbi detectors corresponding to coded and uncoded partial-response channels of practical interest in digital magnetic and optical recording.</description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/26.737388</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>IEEE</publisher><subject>Arithmetic ; AWGN ; Circuits ; Detectors ; Digital recording ; Linear programming ; Magnetic recording ; Maximum likelihood estimation ; Optical recording ; Viterbi algorithm</subject><ispartof>IEEE transactions on communications, 1998-12, Vol.46 (12), p.1549-1554</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c308t-4896e50a5503aa0c7867c47aa9da14d256980131ccc1f3efc5e0c3e42a04d32e3</citedby><cites>FETCH-LOGICAL-c308t-4896e50a5503aa0c7867c47aa9da14d256980131ccc1f3efc5e0c3e42a04d32e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/737388$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/737388$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Vityaev, A.</creatorcontrib><creatorcontrib>Siegel, P.H.</creatorcontrib><title>On Viterbi detector path metric differences</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>This letter continues the investigation of methods for computing exact bounds on the path metric differences in maximum-likelihood sequence detectors based upon the Viterbi algorithm. New upper and lower estimates for these bounds are presented and recast in terms of a collection of linear programming problems. These estimates improve upon previously proposed linear programming bounds. The estimates are applied to derive exact bounds or provably close to exact bounds for several Viterbi detectors corresponding to coded and uncoded partial-response channels of practical interest in digital magnetic and optical recording.</description><subject>Arithmetic</subject><subject>AWGN</subject><subject>Circuits</subject><subject>Detectors</subject><subject>Digital recording</subject><subject>Linear programming</subject><subject>Magnetic recording</subject><subject>Maximum likelihood estimation</subject><subject>Optical recording</subject><subject>Viterbi algorithm</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1998</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqF0DtLBDEUBeAgCo6rha3VVILIrDfJ5DGlLL5gYRu1HeKdOxiZl0m28N-7yyy2Vqc4H6c4jF1yWHIO1Z3QSyONtPaIZVwpW4BV5phlABUU2hh7ys5i_AKAEqTM2O1myN99ovDh84YSYRpDPrn0mfeUgse88W1LgQakeM5OWtdFujjkgr09Pryunov15ulldb8uUIJNRWkrTQqcUiCdAzRWGyyNc1XjeNkIpSsLXHJE5K2kFhUBSiqFg7KRguSCXc-7Uxi_txRT3fuI1HVuoHEba2EVCCPV_1Bry63Yw5sZYhhjDNTWU_C9Cz81h3r_247W8287ezVbT0R_7lD-Ai6VZkQ</recordid><startdate>19981201</startdate><enddate>19981201</enddate><creator>Vityaev, A.</creator><creator>Siegel, P.H.</creator><general>IEEE</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope></search><sort><creationdate>19981201</creationdate><title>On Viterbi detector path metric differences</title><author>Vityaev, A. ; Siegel, P.H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c308t-4896e50a5503aa0c7867c47aa9da14d256980131ccc1f3efc5e0c3e42a04d32e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Arithmetic</topic><topic>AWGN</topic><topic>Circuits</topic><topic>Detectors</topic><topic>Digital recording</topic><topic>Linear programming</topic><topic>Magnetic recording</topic><topic>Maximum likelihood estimation</topic><topic>Optical recording</topic><topic>Viterbi algorithm</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Vityaev, A.</creatorcontrib><creatorcontrib>Siegel, P.H.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</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_linktorsrc</fulltext></delivery><addata><au>Vityaev, A.</au><au>Siegel, P.H.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On Viterbi detector path metric differences</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>1998-12-01</date><risdate>1998</risdate><volume>46</volume><issue>12</issue><spage>1549</spage><epage>1554</epage><pages>1549-1554</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>This letter continues the investigation of methods for computing exact bounds on the path metric differences in maximum-likelihood sequence detectors based upon the Viterbi algorithm. New upper and lower estimates for these bounds are presented and recast in terms of a collection of linear programming problems. These estimates improve upon previously proposed linear programming bounds. The estimates are applied to derive exact bounds or provably close to exact bounds for several Viterbi detectors corresponding to coded and uncoded partial-response channels of practical interest in digital magnetic and optical recording.</abstract><pub>IEEE</pub><doi>10.1109/26.737388</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0090-6778 |
| ispartof | IEEE transactions on communications, 1998-12, Vol.46 (12), p.1549-1554 |
| issn | 0090-6778 1558-0857 |
| language | eng |
| recordid | cdi_ieee_primary_737388 |
| source | IEEE Electronic Library (IEL) |
| subjects | Arithmetic AWGN Circuits Detectors Digital recording Linear programming Magnetic recording Maximum likelihood estimation Optical recording Viterbi algorithm |
| title | On Viterbi detector path metric differences |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T23%3A02%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20Viterbi%20detector%20path%20metric%20differences&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Vityaev,%20A.&rft.date=1998-12-01&rft.volume=46&rft.issue=12&rft.spage=1549&rft.epage=1554&rft.pages=1549-1554&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/26.737388&rft_dat=%3Cproquest_RIE%3E26681825%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=26681825&rft_id=info:pmid/&rft_ieee_id=737388&rfr_iscdi=true |