Art of constructing low-complexity encoders/decoders for constrained block codes
Suppose we are given a block code, that is, a list of at least 2/sup p/ q-bit self-concatenable codewords. A rate p:q block encoder is a dataword-to-codeword assignment from 2/sup p/ p-bit datawords to 2/sup p/ q-bit codewords, and the corresponding block decoder is the inverse of the encoder. We pr...
Uloženo v:
| Vydáno v: | Information Theory: 2000 IEEE International Symposium On s. 147 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
2000
|
| Témata: | |
| ISBN: | 9780780358577, 0780358570 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Suppose we are given a block code, that is, a list of at least 2/sup p/ q-bit self-concatenable codewords. A rate p:q block encoder is a dataword-to-codeword assignment from 2/sup p/ p-bit datawords to 2/sup p/ q-bit codewords, and the corresponding block decoder is the inverse of the encoder. We propose efficient heuristic computer algorithms (i) to eliminate the excess codewords; and (ii) to construct low hardware complexity block encoders/decoders. Constructing low-complexity encoder/decoders for very high rate codes is of immense economical value-as these codes may be implemented in mass-market magnetic recording systems. For several practical constraints, block encoders/decoders generated using the proposed algorithms are comparable in complexity to human-generated encoders/decoders, but are significantly simpler than lexicographical encoders/decoders. |
|---|---|
| AbstractList | Suppose we are given a block code, that is, a list of at least 2/sup p/ q-bit self-concatenable codewords. A rate p:q block encoder is a dataword-to-codeword assignment from 2/sup p/ p-bit datawords to 2/sup p/ q-bit codewords, and the corresponding block decoder is the inverse of the encoder. We propose efficient heuristic computer algorithms (i) to eliminate the excess codewords; and (ii) to construct low hardware complexity block encoders/decoders. Constructing low-complexity encoder/decoders for very high rate codes is of immense economical value-as these codes may be implemented in mass-market magnetic recording systems. For several practical constraints, block encoders/decoders generated using the proposed algorithms are comparable in complexity to human-generated encoders/decoders, but are significantly simpler than lexicographical encoders/decoders. |
| Author | Marcus, B.H. Modha, D.S. |
| Author_xml | – sequence: 1 givenname: D.S. surname: Modha fullname: Modha, D.S. organization: IBM Almaden Res. Center, San Jose, CA, USA – sequence: 2 givenname: B.H. surname: Marcus fullname: Marcus, B.H. |
| BookMark | eNotj9tKAzEYhAMqqHXvxau8wLZJNqe9LMXDQkHBel1y-Fei26QkK9q3t2ULAzPwMQNziy5jioDQPSVzSkm76N67zZwRQuZaSt60F6hqlSZHNUILpa5RVcrXkRMuiKTyBr0t84hTj12KZcw_bgzxEw_pt3Zptx_gL4wHDNElD7ksPEwB9ymfGyZE8NgOyX3jEyx36Ko3Q4Hq7DP08fS4Wb3U69fnbrVc14ESPtZCWc-dcxI0SHBMceNbJpUG5g20zBoQjFtBjaXCOGmc1soz61hLeyV4M0MP024AgO0-h53Jh-10u_kHVrFRWg |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/ISIT.2000.866439 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 866439 |
| GroupedDBID | 6IE 6IH 6IK 6IL AAJGR AAVQY AAWTH ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK OCL RIE RIL RIO |
| ID | FETCH-LOGICAL-i104t-57bd4ccc6e8e6ec274ad92678e2dae92bae524b51ab15ac6ac887d2bc291f7543 |
| IEDL.DBID | RIE |
| ISBN | 9780780358577 0780358570 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000168322900145&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Tue Aug 26 18:04:31 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i104t-57bd4ccc6e8e6ec274ad92678e2dae92bae524b51ab15ac6ac887d2bc291f7543 |
| ParticipantIDs | ieee_primary_866439 |
| PublicationCentury | 2000 |
| PublicationDate | 20000000 |
| PublicationDateYYYYMMDD | 2000-01-01 |
| PublicationDate_xml | – year: 2000 text: 20000000 |
| PublicationDecade | 2000 |
| PublicationTitle | Information Theory: 2000 IEEE International Symposium On |
| PublicationTitleAbbrev | ISIT |
| PublicationYear | 2000 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0000450616 |
| Score | 1.2780873 |
| Snippet | Suppose we are given a block code, that is, a list of at least 2/sup p/ q-bit self-concatenable codewords. A rate p:q block encoder is a dataword-to-codeword... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 147 |
| SubjectTerms | Block codes Concatenated codes Concrete Decoding Hardware Heuristic algorithms Magnetic recording Subspace constraints |
| Title | Art of constructing low-complexity encoders/decoders for constrained block codes |
| URI | https://ieeexplore.ieee.org/document/866439 |
| WOSCitedRecordID | wos000168322900145&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF5s8eDJV8U3e_C6bbLZPPYoYrGXUrBCb2V3dipFSaSNj5_v7CatCF68hE1CQpjAfvP6vmHsJraEI845EQFtgSo2IDTaSKAqIiykMgA2DJvIx-NiNtOTVmc7cGEQMTSfYd8vQy3fVfDuU2WDIvP42WGdPM8aqtY2nUKeCSFTFgLzIkpSr9ve6utszvNNlTLSg9HjaBpYKv3mnb9mqwRoGe7_66MOWO-HoscnW_A5ZDtYHrPJ7arm1YJDtdGFLZ_5a_UpQuM4fpHHzb1wpW9eHjhsFpzc1vYJQy6n45bw7YX7m-seexreT-8eRDsyQSwprqpFmlunACDDAjMECjmN05IACaUzqKU1mEpl09jYODWQGaBNxkkLUseLPFXJCeuWVYmnjOeKoh3lFcp8tdAok4DWi8zSgVzKBM_YkTfG_K1RxZg3djj_8-oF22so7D51ccm6ZAK8YrvwUS_Xq-vwJ78BMmudOA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFA46BX3yNvFuHnzN1nbpJY8ijg3nGDhhbyM5OZPhaGWbl5_vSdpNBF98adOUhnIC-c71O4zdhIZwxForAqAjUIYahEITCJRZgFkkNYDxzSbSfj8bjdSg4tn2tTCI6JPPsOGGPpZvC3h3rrJmljj83GRbMd2Cslhr7VAh3YSwKfGmeRa0YsfcXjHsrJ7TVZwyUM3uU3fo61Qa5aq_uqt4cGnv_eu39ln9p0iPD9bwc8A2MD9ig9v5khcTDsWKGTZ_4bPiU_jUcfwinZs76kqXvty0WA44Ka7VF5qUTssNIdwrdy8Xdfbcvh_edUTVNEFMybJaijg1VgJAghkmCGR0aqsigiSMrEYVGY1xJE0cahPGGhINdMzYyECkwklKgj1mtbzI8YTxVJK9Ix1HmYsXaqlboNQkMXQhpbKFp-zQCWP8VvJijEs5nP05e812OsPH3rjX7T-cs92yoN05Mi5YjcSBl2wbPpbTxfzK7-o3nlighQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Information+Theory%3A+2000+IEEE+International+Symposium+On&rft.atitle=Art+of+constructing+low-complexity+encoders%2Fdecoders+for+constrained+block+codes&rft.au=Modha%2C+D.S.&rft.au=Marcus%2C+B.H.&rft.date=2000-01-01&rft.pub=IEEE&rft.isbn=9780780358577&rft.spage=147&rft_id=info:doi/10.1109%2FISIT.2000.866439&rft.externalDocID=866439 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780358577/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780358577/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780358577/sc.gif&client=summon&freeimage=true |