An Iteratively Decodable Tensor Product Code with Application to Data Storage

The error pattern correcting code (EPCC) can be constructed to provide a syndrome decoding table targeting the dominant error events of an inter-symbol interference channel at the output of the Viterbi detector. For the size of the syndrome table to be manageable and the list of possible error event...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE journal on selected areas in communications Ročník 28; číslo 2; s. 228 - 240
Hlavní autoři:	Alhussien, Hakim, Moon, Jaekyun
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.02.2010 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Complexity Decoding detection postprocessing Detectors Error correction Error correction codes Error detection error-pattern correction Event detection inter-symbol interference Interference channels Iterative decoding Mathematical analysis Memory multilevel log-likelihood ratio Permissible error Product codes q-ary LDPC Redundancy signature correcting code Tables (data) Tensile stress Tensor product codes tensor symbol signatures Tensors turbo equalization Viterbi algorithm
ISSN:	0733-8716, 1558-0008
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	The error pattern correcting code (EPCC) can be constructed to provide a syndrome decoding table targeting the dominant error events of an inter-symbol interference channel at the output of the Viterbi detector. For the size of the syndrome table to be manageable and the list of possible error events to be reasonable in size, the codeword length of EPCC needs to be short enough. However, the rate of such a short length code will be too low for hard drive applications. To accommodate the required large redundancy, it is possible to record only a highly compressed function of the parity bits of EPCC's tensor product with a symbol correcting code. In this paper, we show that the proposed tensor error-pattern correcting code (T-EPCC) is linear time encodable and also devise a low-complexity soft iterative decoding algorithm for EPCC's tensor product with q-ary LDPC (T-EPCC-qLDPC). Simulation results show that T-EPCC-qLDPC achieves almost similar performance to single-level qLDPC with a 1/2 KB sector at 50% reduction in decoding complexity. Moreover, 1 KB T-EPCC-qLDPC surpasses the performance of 1/2 KB single-level qLDPC at the same decoder complexity.
AbstractList	The error pattern correcting code (EPCC) can be constructed to provide a syndrome decoding table targeting the dominant error events of an inter-symbol interference channel at the output of the Viterbi detector. For the size of the syndrome table to be manageable and the list of possible error events to be reasonable in size, the codeword length of EPCC needs to be short enough. However, the rate of such a short length code will be too low for hard drive applications. To accommodate the required large redundancy, it is possible to record only a highly compressed function of the parity bits of EPCC¿s tensor product with a symbol correcting code. In this paper, we show that the proposed tensor error-pattern correcting code (T-EPCC) is linear time encodable and also devise a low-complexity soft iterative decoding algorithm for EPCC¿s tensor product with q-ary LDPC (T-EPCC-qLDPC). Simulation results show that T-EPCC-qLDPC achieves almost similar performance to single-level qLDPC with a 1/2 KB sector at 50% reduction in decoding complexity. Moreover, 1 KB T-EPCC-qLDPC surpasses the performance of 1/2 KB single-level qLDPC at the same decoder complexity. The error pattern correcting code (EPCC) can be constructed to provide a syndrome decoding table targeting the dominant error events of an inter-symbol interference channel at the output of the Viterbi detector. For the size of the syndrome table to be manageable and the list of possible error events to be reasonable in size, the codeword length of EPCC needs to be short enough. However, the rate of such a short length code will be too low for hard drive applications. To accommodate the required large redundancy, it is possible to record only a highly compressed function of the parity bits of EPCC[iquest]s tensor product with a symbol correcting code. In this paper, we show that the proposed tensor error-pattern correcting code (T-EPCC) is linear time encodable and also devise a low-complexity soft iterative decoding algorithm for EPCC[iquest]s tensor product with q-ary LDPC (T-EPCC-qLDPC). Simulation results show that T-EPCC-qLDPC achieves almost similar performance to single-level qLDPC with a 1/2 KB sector at 50% reduction in decoding complexity. Moreover, 1 KB T-EPCC-qLDPC surpasses the performance of 1/2 KB single-level qLDPC at the same decoder complexity. The error pattern correcting code (EPCC) can be constructed to provide a syndrome decoding table targeting the dominant error events of an inter-symbol interference channel at the output of the Viterbi detector. For the size of the syndrome table to be manageable and the list of possible error events to be reasonable in size, the codeword length of EPCC needs to be short enough. However, the rate of such a short length code will be too low for hard drive applications. To accommodate the required large redundancy, it is possible to record only a highly compressed function of the parity bits of EPCC's tensor product with a symbol correcting code. In this paper, we show that the proposed tensor error-pattern correcting code (T-EPCC) is linear time encodable and also devise a low-complexity soft iterative decoding algorithm for EPCC's tensor product with q-ary LDPC (T-EPCC-qLDPC). Simulation results show that T-EPCC-qLDPC achieves almost similar performance to single-level qLDPC with a 1/2 KB sector at 50% reduction in decoding complexity. Moreover, 1 KB T-EPCC-qLDPC surpasses the performance of 1/2 KB single-level qLDPC at the same decoder complexity.
Author	Moon, Jaekyun Alhussien, Hakim
Author_xml	– sequence: 1 givenname: Hakim surname: Alhussien fullname: Alhussien, Hakim email: hakima@link-a-media.com organization: Link-A-Media Devices, CA – sequence: 2 givenname: Jaekyun surname: Moon fullname: Moon, Jaekyun email: jaemoon@ee.kaist.ac.kr organization: KAIST, Yuseonggu, Republic of Korea
BookMark	eNqFkT1PHDEQhq0IJA5Cj5TGSpNqydjrry1PR_iIiEC6o7a83nGyaFlfbF8Q_549DqWggGo00vPMaOY9JHtjHJGQEwanjEHz_edyvjjlsG0BOOOfyIxJaSoAMHtkBrquK6OZOiCHOd8DMCEMn5Ff85FeFUyu9P9weKJn6GPn2gHpCsccE71Nsdv4QhexQ_rYlz90vl4PvZ-EONIS6Zkrji5LTO43fib7wQ0Zj1_rEbk7_7FaXFbXNxdXi_l15etGlkryYDpllBTIvBDgOx14B02npJEYRFCtFEp0ddCybdpQQ6288W0jOQ8MRX1Evu3mrlP8u8Fc7EOfPQ6DGzFusjVaggCuPyYnRDOhWTORX9-Q93GTxukMa6RS0CilJwh2kE8x54TBrlP_4NKTZWC3OdhtDnabg93lMCnqjeL78vK9klw_vCd-2Yk9Iv7fI6e7RAP1M3PilOY
CODEN	ISACEM
CitedBy_id	crossref_primary_10_1109_TIT_2012_2234207 crossref_primary_10_1109_TCOMM_2021_3064566 crossref_primary_10_1109_TIT_2010_2096031 crossref_primary_10_1007_s41745_023_00392_7
Cites_doi	10.1109/TMAG.2008.2002368 10.1109/TMAG.2005.861747 10.1109/ACSSC.2004.1399513 10.1109/ICC.2005.1494700 10.1109/TIT.2009.2013019 10.1109/TMAG.2004.830620 10.1109/TIT.2004.828066 10.1109/INTMAG.2006.375878 10.1109/ICC.2001.936639 10.1109/TMAG.2007.906890 10.1109/TMAG.2003.808600 10.1109/TMAG.2006.888370 10.1109/TMAG.2007.912832 10.1109/TMAG.2005.861043 10.1109/TIT.1963.1057813 10.1109/TIT.1965.1053771 10.1109/TMAG.2007.912943 10.1109/TMAG.2002.1017759 10.1109/TMAG.2007.893478 10.1109/26.705396 10.1109/TIT.2003.814494 10.1109/TCOMM.2008.050600 10.1109/49.924875 10.1017/CBO9781139172769 10.1109/TIT.2004.839541 10.1109/LCOMM.2003.810000 10.1109/TMAG.2008.2002468 10.1109/ITW2.2006.323741 10.1109/TMAG.2003.816481 10.1109/TCOMM.2004.826367 10.1109/TMAG.2006.888607 10.1109/TMAG.2006.878623 10.1109/ITW.1998.706440 10.1109/TCOMM.2005.861667 10.1109/TIT.1981.1056329
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Feb 2010
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Feb 2010
DBID	97E RIA RIE AAYXX CITATION 7SP 8FD L7M F28 FR3
DOI	10.1109/JSAC.2010.100212
DatabaseName	IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Engineering Research Database
DatabaseTitle	CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts Engineering Research Database ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList	Technology Research Database Engineering Research Database Engineering Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1558-0008
EndPage	240
ExternalDocumentID	2289785391 10_1109_JSAC_2010_100212 5402490
Genre	orig-research
GroupedDBID	-~X .DC 0R~ 29I 3EH 4.4 41~ 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT ADRHT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IBMZZ ICLAB IES IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS TN5 VH1 AAYXX CITATION 7SP 8FD L7M RIG F28 FR3
ID	FETCH-LOGICAL-c395t-52f8d68654e1c440cd7f2d09d6585ef4f6b5464d3f75b9bf3036c8cb9522f1e43
IEDL.DBID	RIE
ISICitedReferencesCount	6
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000277063400012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0733-8716
IngestDate	Wed Oct 01 14:00:13 EDT 2025 Thu Oct 02 10:50:33 EDT 2025 Mon Jun 30 10:22:20 EDT 2025 Sat Nov 29 05:32:25 EST 2025 Tue Nov 18 22:12:13 EST 2025 Wed Aug 27 05:45:51 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	2
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c395t-52f8d68654e1c440cd7f2d09d6585ef4f6b5464d3f75b9bf3036c8cb9522f1e43
Notes	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23
PQID	856609667
PQPubID	23500
PageCount	13
ParticipantIDs	proquest_miscellaneous_875040274 proquest_miscellaneous_743714719 proquest_journals_856609667 crossref_citationtrail_10_1109_JSAC_2010_100212 ieee_primary_5402490 crossref_primary_10_1109_JSAC_2010_100212
PublicationCentury	2000
PublicationDate	2010-02-01
PublicationDateYYYYMMDD	2010-02-01
PublicationDate_xml	– month: 02 year: 2010 text: 2010-02-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE journal on selected areas in communications
PublicationTitleAbbrev	J-SAC
PublicationYear	2010
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref35 ref13 ref34 ref12 ref15 ref36 ref14 ref31 ref30 ref33 ref32 ref2 ref1 ref17 ref16 ref19 ref18 kurkoski (ref10) 2003; 49 ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref28 ref27 ref29 ref8 ref7 ref9 ref4 han (ref11) 2008 ref3 ref6 ref5
References_xml	– ident: ref33 doi: 10.1109/TMAG.2008.2002368 – ident: ref23 doi: 10.1109/TMAG.2005.861747 – ident: ref31 doi: 10.1109/ACSSC.2004.1399513 – ident: ref15 doi: 10.1109/ICC.2005.1494700 – ident: ref18 doi: 10.1109/TIT.2009.2013019 – ident: ref25 doi: 10.1109/TMAG.2004.830620 – ident: ref5 doi: 10.1109/TIT.2004.828066 – ident: ref9 doi: 10.1109/INTMAG.2006.375878 – ident: ref28 doi: 10.1109/ICC.2001.936639 – ident: ref1 doi: 10.1109/TMAG.2007.906890 – ident: ref35 doi: 10.1109/TMAG.2003.808600 – ident: ref13 doi: 10.1109/TMAG.2006.888370 – ident: ref32 doi: 10.1109/TMAG.2007.912832 – ident: ref22 doi: 10.1109/TMAG.2005.861043 – ident: ref24 doi: 10.1109/TIT.1963.1057813 – ident: ref21 doi: 10.1109/TIT.1965.1053771 – ident: ref19 doi: 10.1109/TMAG.2007.912943 – ident: ref12 doi: 10.1109/TMAG.2002.1017759 – ident: ref17 doi: 10.1109/TMAG.2007.893478 – ident: ref27 doi: 10.1109/26.705396 – volume: 49 start-page: 2076 year: 2003 ident: ref10 article-title: Joint message-passing decoding of LDPC codes and partial-response channels publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.2003.814494 – ident: ref6 doi: 10.1109/TCOMM.2008.050600 – ident: ref14 doi: 10.1109/49.924875 – ident: ref36 doi: 10.1017/CBO9781139172769 – ident: ref30 doi: 10.1109/TIT.2004.839541 – ident: ref3 doi: 10.1109/LCOMM.2003.810000 – start-page: 277 year: 2008 ident: ref11 article-title: LDPC decoder strategies for achieving low error floors publication-title: Information Theory and Applications Workshop 2008 – ident: ref34 doi: 10.1109/TMAG.2008.2002468 – ident: ref20 doi: 10.1109/ITW2.2006.323741 – ident: ref4 doi: 10.1109/TMAG.2003.816481 – ident: ref7 doi: 10.1109/TCOMM.2004.826367 – ident: ref2 doi: 10.1109/TMAG.2006.888607 – ident: ref16 doi: 10.1109/TMAG.2006.878623 – ident: ref29 doi: 10.1109/ITW.1998.706440 – ident: ref8 doi: 10.1109/TCOMM.2005.861667 – ident: ref26 doi: 10.1109/TIT.1981.1056329
SSID	ssj0014482
Score	1.9869624
Snippet	The error pattern correcting code (EPCC) can be constructed to provide a syndrome decoding table targeting the dominant error events of an inter-symbol...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	228
SubjectTerms	Complexity Decoding detection postprocessing Detectors Error correction Error correction codes Error detection error-pattern correction Event detection inter-symbol interference Interference channels Iterative decoding Mathematical analysis Memory multilevel log-likelihood ratio Permissible error Product codes q-ary LDPC Redundancy signature correcting code Tables (data) Tensile stress Tensor product codes tensor symbol signatures Tensors turbo equalization Viterbi algorithm
Title	An Iteratively Decodable Tensor Product Code with Application to Data Storage
URI	https://ieeexplore.ieee.org/document/5402490 https://www.proquest.com/docview/856609667 https://www.proquest.com/docview/743714719 https://www.proquest.com/docview/875040274
Volume	28
WOSCitedRecordID	wos000277063400012&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
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-0008 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014482 issn: 0733-8716 databaseCode: RIE dateStart: 19830101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB60eNCDb7G-2IMXwdikSfZxLFVRwVJQwVvY7AMESaRNBf-9s5s0Kj7AWyC7SZjJ7sy3M_MNwLFgubZa6kCw0ASOfyTI-zQOqOrHkksrQ5b7ZhNsNOKPj2K8AKdtLYwxxiefmTN36WP5ulQzd1TWQ-8C0QIC9EXGaF2r1UYMEGb4iAGL48CBgHlIMhS9m7vBsE7iijyj-RcT5HuqfNuIvXW5XPvfd63DauNFkkGt9g1YMMUmrHziFtyC20FBrj1lMu5nz2_kHHGmdnVS5B6Razkh45rrlQxLbYg7jiWDj2A2qUpyLitJ7hCT45azDQ-XF_fDq6DpnRCoWKQV4kvLNeU0TUykkiRUmtm-DoVGjyM1NrE0TxOa6NiyNBe5dZZMcZUL9MdsZJJ4BzpFWZhdIBFlWmsWS6PxSUZK1U85j5SKqHCEbV3ozcWZqYZY3PW3eM48wAhF5hSQOQVktQK6cNLOeKlJNf4Yu-UE3o5rZN2F_bnGsmbVTTOOvilCMsq6QNq7uFxcDEQWppxNM3SYWIQGWfw-hDvGe4fW935-9T4s1ykELqflADrVZGYOYUm9Vk_TyZH_K98Br9Depw
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1La9wwEB5CWmh7aNKmods8qkMugbrrh6zHcdk0JG2yBLKF3ISsBwSCHXa9hf77jmSv09AH5GawZJsZSzOfZuYbgCPJK-uttonkqUsC_0hS5axImMkLLbTXKa9iswk-m4mbG3m1AZ-GWhjnXEw-c5_DZYzl28aswlHZGL0LRAsI0J-VlOZpV601xAwQaMSYAS-KJMCAdVAyleOv15Npl8aVRU7zR0YodlX5YyuO9uV062lftg2vez-STDrFv4ENV7-FV7-xC-7A5aQm55E0GXe0u5_kBJGmDZVSZI7YtVmQq47tlUwb60g4kCWTh3A2aRtyoltNrhGV46bzDr6ffplPz5K-e0JiClm2iDC9sEywkrrMUJoay31uU2nR5yidp55VJWXUFp6Xlax8sGVGmEqiR-YzR4td2Kyb2r0HkjFureWFdhaf5LQ2eSlEZkzGZKBsG8F4LU5lemrx0OHiTkWIkUoVFKCCAlSngBEcDzPuO1qN_4zdCQIfxvWyHsHeWmOqX3dLJdA7RVDG-AjIcBcXTIiC6No1q6VCl4lnaJLlv4eIwHkf8PqHv7_6I7w4m19eqIvz2bc9eNklFIQMl33YbBcrdwDPzY_2drk4jH_oL2wo4e4
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%3Ajournal&rft.genre=article&rft.atitle=An+Iteratively+Decodable+Tensor+Product+Code+with+Application+to+Data+Storage&rft.jtitle=IEEE+journal+on+selected+areas+in+communications&rft.au=Alhussien%2C+Hakim&rft.au=Moon%2C+Jaekyun&rft.date=2010-02-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0733-8716&rft.eissn=1558-0008&rft.volume=28&rft.issue=2&rft.spage=228&rft_id=info:doi/10.1109%2FJSAC.2010.100212&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2289785391
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0733-8716&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0733-8716&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0733-8716&client=summon