On the Overflow Problem in Finite Precision Turbo Decoding Message Passing

Much attention has been paid recently to the so-called layered decoding of LDPC codes, also known as turbo-decoding message passing (TDMP). The TDMP algorithm for decoding LDPC codes is known to possess some desirable features, such as fast convergence speed, reduced memory requirements and reduced...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on communications Vol. 60; no. 5; pp. 1253 - 1259
Main Author:	Sulek, W.
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.05.2012 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithm design and analysis Algorithms Applied sciences Coding, codes Computer simulation Decoding Exact sciences and technology Hardware Information, signal and communications theory Iterative decoding Low density parity check codes Manganese Mathematical analysis Message passing Messages overflow errors Quantization Representations Signal and communications theory Studies Telecommunications and information theory turbo decoding algorithm Overflow(computer arithmetics) Performance evaluation Dynamic response turbo decoding algorithm Iterative method Turbo code Algorithm Iterative decoding Implementation Convergence speed Low-density parity-check codes overflow errors Message passing Simulation Convergence rate Error correcting code Parity check codes
ISSN:	0090-6778, 1558-0857
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Much attention has been paid recently to the so-called layered decoding of LDPC codes, also known as turbo-decoding message passing (TDMP). The TDMP algorithm for decoding LDPC codes is known to possess some desirable features, such as fast convergence speed, reduced memory requirements and reduced implementation complexity in comparison with standard two-phase message passing algorithm. In this paper we analyze an important issue connected with hardware implementation of TDMP algorithm, namely the finite precision representation of messages influence on the decoding performance. Constrained dynamic range of the finite precision representation of messages entails overflow errors. We present an analysis revealing that in the subsequent decoding iterations, the subtraction of non-overflowed intrinsic message from overflowed extrinsic message is a source of errors that have substantial impact on the decoding results. The analysis is confirmed by simulation results showing significant performance loss. However this performance loss can be almost completely eliminated with a basic modifications in the messages computation algorithm. Effectiveness of the presented modifications is confirmed by simulation results obtained with hardware TDMP decoder implementation that has been developed.
AbstractList	Much attention has been paid recently to the so-called layered decoding of LDPC codes, also known as turbo-decoding message passing (TDMP). The TDMP algorithm for decoding LDPC codes is known to possess some desirable features, such as fast convergence speed, reduced memory requirements and reduced implementation complexity in comparison with standard two-phase message passing algorithm. In this paper we analyze an important issue connected with hardware implementation of TDMP algorithm, namely the finite precision representation of messages influence on the decoding performance. Constrained dynamic range of the finite precision representation of messages entails overflow errors. We present an analysis revealing that in the subsequent decoding iterations, the subtraction of non-overflowed intrinsic message from overflowed extrinsic message is a source of errors that have substantial impact on the decoding results. The analysis is confirmed by simulation results showing significant performance loss. However this performance loss can be almost completely eliminated with a basic modifications in the messages computation algorithm. Effectiveness of the presented modifications is confirmed by simulation results obtained with hardware TDMP decoder implementation that has been developed.
Author	Sulek, W.
Author_xml	– sequence: 1 givenname: W. surname: Sulek fullname: Sulek, W. email: wojciech.sulek@polsl.pl organization: Fac. Of Autom. Control, Electron. & Comput. Sci., Silesian Univ. of Technol., Gliwice, Poland
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=25894577$$DView record in Pascal Francis
BookMark	eNqNkU1vEzEQhi1UJNLCL-BiCSFx2TD-Xl-QUKB8qFE4hLPldWaLq41d7A2If4_LVj30xGnk0TOvx37OyVnKCQmhDNaMgX273-y22zUHxtcgwLTS2kqqJ2TFlOo76JU5IysAC502pn9Gzmu9AQAJQqzI112i8w-ku19Yxin_pt9KHiY80pjoZUxxxtbBEGvMie5PZcj0A4Z8iOmabrFWf90AX2s7PydPRz9VfHFfL8j3y4_7zefuavfpy-b9VReEgbnTOBjUTIENQvG2h5fc8qAl9JorZrTvjWVGmkNDNOMwSGaGQ_DCjgfFvLggb5bc25J_nrDO7hhrwGnyCfOpOgaCcWs4lw199Qi9yaeS2naNYsIIaZRq1Ot7ytfgp7H41B7sbks8-vLHcdVbqYxpXL9woeRaC44PCAN3J8P9k-HuZLhFhltktNF3j0ZDnP3cPnUuPk7_E_ByCYiI-HCvZrpnFsRfALqXoA
CODEN	IECMBT
CitedBy_id	crossref_primary_10_1109_TVLSI_2014_2382108 crossref_primary_10_1109_TCSI_2014_2333674 crossref_primary_10_1007_s00034_015_0235_x
Cites_doi	10.1109/TCOMM.2004.836563 10.1109/4234.824757 10.1109/DSD.2007.4341494 10.1109/EEEI.2004.1361130 10.1109/TVLSI.2003.817545 10.1109/18.748992 10.7551/mitpress/4347.001.0001 10.1109/TCE.2008.4560109 10.1109/JSSC.2005.864133 10.1109/TCSI.2005.862074 10.1109/TCOMM.2009.11.080105 10.1109/TIT.2009.2015993 10.1109/TSP.2009.2022356 10.1109/ISIT.2005.1523376 10.2478/v10175-011-0019-9 10.1109/MWSCAS.2002.1187117 10.1109/SIPS.2004.1363033 10.1109/26.768759 10.1109/TCSI.2005.844113 10.1109/TCSI.2009.2018915 10.1109/TIT.1974.1055186 10.1109/TCOMM.2005.852852 10.1109/JSAC.2009.090816 10.1109/TSP.2006.880240 10.1109/ICC.1993.397441
ContentType	Journal Article
Copyright	2015 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) May 2012
Copyright_xml	– notice: 2015 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) May 2012
DBID	97E RIA RIE AAYXX CITATION IQODW 7SP 8FD L7M F28 FR3
DOI	10.1109/TCOMM.2012.030712.110545
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis 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
Database_xml	– sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Applied Sciences
EISSN	1558-0857
EndPage	1259
ExternalDocumentID	2661816331 25894577 10_1109_TCOMM_2012_030712_110545 6168190
Genre	orig-research
GroupedDBID	-~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACIWK ACKIV ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IES IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 ZCA ZCG AAYXX CITATION IQODW RIG 7SP 8FD L7M F28 FR3
ID	FETCH-LOGICAL-c370t-6eb7e61509c352004a4292c6408625176a8791747d5096120b417bdca39fd51a3
IEDL.DBID	RIE
ISICitedReferencesCount	7
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000304203400012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0090-6778
IngestDate	Sun Sep 28 10:48:04 EDT 2025 Mon Jun 30 10:15:39 EDT 2025 Mon Jul 21 09:16:44 EDT 2025 Tue Nov 18 22:23:58 EST 2025 Sat Nov 29 01:41:30 EST 2025 Wed Aug 27 02:49:11 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	5
Keywords	Overflow(computer arithmetics) Performance evaluation Dynamic response turbo decoding algorithm Iterative method Turbo code Algorithm Iterative decoding Implementation Convergence speed Low-density parity-check codes overflow errors Message passing Simulation Convergence rate Error correcting code Parity check codes
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c370t-6eb7e61509c352004a4292c6408625176a8791747d5096120b417bdca39fd51a3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23
PQID	1013734755
PQPubID	85472
PageCount	7
ParticipantIDs	pascalfrancis_primary_25894577 crossref_citationtrail_10_1109_TCOMM_2012_030712_110545 crossref_primary_10_1109_TCOMM_2012_030712_110545 proquest_miscellaneous_1031297224 ieee_primary_6168190 proquest_journals_1013734755
PublicationCentury	2000
PublicationDate	2012-05-01
PublicationDateYYYYMMDD	2012-05-01
PublicationDate_xml	– month: 05 year: 2012 text: 2012-05-01 day: 01
PublicationDecade	2010
PublicationPlace	New York, NY
PublicationPlace_xml	– name: New York, NY – name: New York
PublicationTitle	IEEE transactions on communications
PublicationTitleAbbrev	TCOMM
PublicationYear	2012
Publisher	IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref12 ref15 zhu (ref7) 2009; 57 richardson (ref26) 0 ref14 ref11 ref10 ref2 hu (ref24) 0 ref17 ref16 ref19 ref18 rovini (ref13) 0 sulek (ref22) 2011; 59 ref23 ref25 ref20 ref21 gallager (ref1) 1963 ref28 ref27 ref8 ref9 ref4 ref3 ref6 ref5
References_xml	– ident: ref18 doi: 10.1109/TCOMM.2004.836563 – ident: ref12 doi: 10.1109/4234.824757 – ident: ref5 doi: 10.1109/DSD.2007.4341494 – ident: ref4 doi: 10.1109/EEEI.2004.1361130 – ident: ref8 doi: 10.1109/TVLSI.2003.817545 – ident: ref2 doi: 10.1109/18.748992 – year: 1963 ident: ref1 publication-title: Low-Density Parity-Check Codes doi: 10.7551/mitpress/4347.001.0001 – ident: ref25 doi: 10.1109/TCE.2008.4560109 – ident: ref11 doi: 10.1109/JSSC.2005.864133 – ident: ref20 doi: 10.1109/TCSI.2005.862074 – ident: ref14 doi: 10.1109/TCOMM.2009.11.080105 – ident: ref27 doi: 10.1109/TIT.2009.2015993 – volume: 57 start-page: 3679 year: 2009 ident: ref7 article-title: Architecture-aware LDPC code design for multiprocessor software defined radio systems publication-title: IEEE Trans Signal Process doi: 10.1109/TSP.2009.2022356 – start-page: 1426 year: 0 ident: ref26 article-title: Error floors of LDPC codes publication-title: Proc 2003 Allerton Conf Commun Control Comput – ident: ref15 doi: 10.1109/ISIT.2005.1523376 – volume: 59 start-page: 149 year: 2011 ident: ref22 article-title: Pipeline processing in low-density parity-check codes hardware decoder publication-title: Bull Polish Acad of Sciences Tech Sci doi: 10.2478/v10175-011-0019-9 – ident: ref16 doi: 10.1109/MWSCAS.2002.1187117 – ident: ref3 doi: 10.1109/SIPS.2004.1363033 – ident: ref17 doi: 10.1109/26.768759 – ident: ref19 doi: 10.1109/TCSI.2005.844113 – ident: ref21 doi: 10.1109/TCSI.2009.2018915 – ident: ref23 doi: 10.1109/TIT.1974.1055186 – ident: ref28 doi: 10.1109/TCOMM.2005.852852 – ident: ref6 doi: 10.1109/JSAC.2009.090816 – start-page: 1036 year: 0 ident: ref24 article-title: Efficient implementations of the sum-product algorithm for decoding LDPC codes publication-title: Proc 2001 (IEEE) Globecom – start-page: 1 year: 0 ident: ref13 article-title: LDPC decoding in fixed-point precision: a systematic quantisation study publication-title: Proc 2005 International Conf Software Telecommun Comput Netw – ident: ref9 doi: 10.1109/TSP.2006.880240 – ident: ref10 doi: 10.1109/ICC.1993.397441
SSID	ssj0004033
Score	2.076271
Snippet	Much attention has been paid recently to the so-called layered decoding of LDPC codes, also known as turbo-decoding message passing (TDMP). The TDMP algorithm...
SourceID	proquest pascalfrancis crossref ieee
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	1253
SubjectTerms	Algorithm design and analysis Algorithms Applied sciences Coding, codes Computer simulation Decoding Exact sciences and technology Hardware Information, signal and communications theory Iterative decoding Low density parity check codes Manganese Mathematical analysis Message passing Messages overflow errors Quantization Representations Signal and communications theory Studies Telecommunications and information theory turbo decoding algorithm
Title	On the Overflow Problem in Finite Precision Turbo Decoding Message Passing
URI	https://ieeexplore.ieee.org/document/6168190 https://www.proquest.com/docview/1013734755 https://www.proquest.com/docview/1031297224
Volume	60
WOSCitedRecordID	wos000304203400012&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/IET Electronic Library customDbUrl: eissn: 1558-0857 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004033 issn: 0090-6778 databaseCode: RIE dateStart: 19720101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT-QwDLYGxIE98FhAOzxGQeJIoW3Suj0iYISQhuEwK3Gr0iRdjYTa1Tzg72O3nQJiD-ypbZK2ke3UdmP7AzhL0SWh1KFnY5SeouXkJco4jzRN6FApK4u8BpvAh4fk6Sl97MF5lwvjnKuDz9wFn9Z7-bYyS_5VdhkHMSuwNVhDjJtcrfccSF-2FSc5nB2TVdSOn15OrsejEUdxhRcs0nSg5ogTmD6oohpbhSMj9ZyIUzSoFl8-0LXWGW7_33x3YKu1LsVVIw670HPlT_jxoebgHtyPS0FGnxiTDBfP1at4bCBlxLQUwylboNTSAu-IyXKWV-KGXFRWcWLEeCl_aABZ3HS9D7-Ht5PrO68FVPCMRH_hxS5HxxXgUyO53JLSDFZlYsV-TRRgrBMk902h5aIwQejnKsDcGi3TwkaBlgewXlal-wXCSZ2EhQ2N4a1Wm-ZkZ-nIRHGOgSWrsg-4om1m2mrjDHrxnNVeh59mNVcy5krWcCVruNKHoLvzb1Nx4xv37DH1u_Et4fsw-MTOrj-MklRFiH04XvE3a9funIPeJEqFET32tOumVcdbKbp01ZLHSDKUkOyfw3-_-gg2eZpNaOQxrC9mS3cCG-ZlMZ3PBrXovgEerOW_
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9RADLZKQQIOvApiaSmDxJG0yTzi5FgVVgW6uz0sUm_RZGZSrVQlaB_079dOsqEIDnBKMjNJRrYntjO2P4APOYZMKisjn6KKNC2nKNMuRKRpZECtvarKFmwCp9Ps8jK_2IGPQy5MCKENPgtHfNru5fvGbfhX2XGapKzA7sF9o7WMu2ytX1mQseprTnJAO2bbuJ04P56fziYTjuOSRyzUdKBmwylMd5RRi67CsZF2ReSpOlyLPz7Rrd4ZP_2_GT-DJ719KU46gXgOO6F-AY_vVB3cg6-zWpDZJ2YkxdV1cyMuOlAZsajFeME2KLX00DtivlmWjfhETiorOTFhxJQrGkA2N12_hO_jz_PTs6iHVIicwngdpaHEwDXgc6e44JK2DFflUs2ejUkwtRmSA6fRc1mYRMalTrD0zqq88iax6hXs1k0dXoMIymay8tI53mz1eUmWljXOpCUmnuzKEeCWtoXr640z7MV10fodcV60XCmYK0XHlaLjygiS4c4fXc2Nf7hnj6k_jO8JP4LD39g59EuT5dogjuBgy9-iX70rDntTqDQaeuz7oZvWHW-m2Do0Gx6jyFRCsoDe_P3V7-Dh2XxyXpx_mX7bh0c85S5Q8gB218tNeAsP3M_1YrU8bMX4Fjt96QY
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=On+the+Overflow+Problem+in+Finite+Precision+Turbo+Decoding+Message+Passing&rft.jtitle=IEEE+transactions+on+communications&rft.au=Sulek%2C+W.&rft.date=2012-05-01&rft.pub=IEEE&rft.issn=0090-6778&rft.volume=60&rft.issue=5&rft.spage=1253&rft.epage=1259&rft_id=info:doi/10.1109%2FTCOMM.2012.030712.110545&rft.externalDocID=6168190
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0090-6778&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0090-6778&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0090-6778&client=summon