Comparison of reweighted message passing algorithms for LDPC decoding

Low density parity check (LDPC) codes can be decoded with a variety of decoding algorithms, offering a trade-off in terms of complexity, latency, and performance. We describe seven distinct LDPC decoders and provide a performance comparison for a practical regular LDPC code. Our simulations indicate...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2013 IEEE International Conference on Communications S. 3264 - 3269
Hauptverfasser: Wymeersch, Henk, Penna, Federico, Savic, Vladimir, Jun Zhao
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.06.2013
Schlagworte:
Complexity theory
Decoding
Iterative decoding
LDPC
max-product
Message Passing
Signal to noise ratio
sum-product
ISBN:9781467331227, 1467331228
ISSN:1550-3607
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Low density parity check (LDPC) codes can be decoded with a variety of decoding algorithms, offering a trade-off in terms of complexity, latency, and performance. We describe seven distinct LDPC decoders and provide a performance comparison for a practical regular LDPC code. Our simulations indicate that the best performance/latency trade-off is achieved by one version of the reweighted max-product decoder. When latency is not an issue, the traditional sum-product decoder yields the best performance.
AbstractList Low density parity check (LDPC) codes can be decoded with a variety of decoding algorithms, offering a trade-off in terms of complexity, latency, and performance. We describe seven distinct LDPC decoders and provide a performance comparison for a practical regular LDPC code. Our simulations indicate that the best performance/latency trade-off is achieved by one version ofthe reweighted max-product decoder. When latency is not an issue, the traditional sum-product decoder yields the best performance.
Low density parity check (LDPC) codes can be decoded with a variety of decoding algorithms, offering a trade-off in terms of complexity, latency, and performance. We describe seven distinct LDPC decoders and provide a performance comparison for a practical regular LDPC code. Our simulations indicate that the best performance/latency trade-off is achieved by one version of the reweighted max-product decoder. When latency is not an issue, the traditional sum-product decoder yields the best performance.
Author Penna, Federico
Jun Zhao
Wymeersch, Henk
Savic, Vladimir
Author_xml – sequence: 1
  givenname: Henk
  surname: Wymeersch
  fullname: Wymeersch, Henk
  email: henkw@chalmers.se
  organization: Chalmers Univ. of Technol., Gothenburg, Sweden
– sequence: 2
  givenname: Federico
  surname: Penna
  fullname: Penna, Federico
  email: federico.penna@hhi.fraunhofer.de
  organization: Fraunhofer Heinrich Hertz Inst., Berlin, Germany
– sequence: 3
  givenname: Vladimir
  surname: Savic
  fullname: Savic, Vladimir
  email: vladimir.savic@liu.se
  organization: Linkoping Univ., Linkoping, Sweden
– sequence: 4
  surname: Jun Zhao
  fullname: Jun Zhao
  email: zjun@student.chalmers.se
  organization: Chalmers Univ. of Technol., Gothenburg, Sweden
BackLink https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-88545$$DView record from Swedish Publication Index (Linköpings universitet)
https://research.chalmers.se/publication/189203$$DView record from Swedish Publication Index (Chalmers tekniska högskola)
BookMark eNp1kc1qGzEYRRWaQNPE-0A38wC1K43-l2actgZDC_nZik_Sp7GKxzKSTcjb15DQRaGry-UezuZ-Ipf7skdC7hhdMEbt1_UwLHrK-EIpKakwF2RmtWFCac5Z3-sP__RLcs3O4Jwrqj-SWWu_KaVMK8WluCb3Q5kOUHMr-66kruIL5nF7xNhN2BqM2B2gtbwfO9iNpebjdmpdKrXbrH4NXcRQ4nm8JVcJdg1n73lDnr7dPw4_5puf39fDcjPPnNPjPKJQEWNkxlMqwScJCQKNkGwwVAYmBfeKaWkt89grMGCphyB0kJQly2_Iw5u3veDh5N2h5gnqqyuQXcWGUMPWhS3sJqzNNXTRU9SmV85qL50AmZwJWjmfUCuWtAUuztYv_7Wu8vPSlTq6XT45Y6SQZ_zzG54R8S_8_gb_A-72fdA
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
ABXSW
ADTPV
BNKNJ
BVBDO
D8T
DG8
F1S
DOI 10.1109/ICC.2013.6655048
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
SWEPUB Linköpings universitet full text
SwePub
SwePub Conference
SwePub Conference full text
SWEPUB Freely available online
SWEPUB Linköpings universitet
SWEPUB Chalmers tekniska högskola
DatabaseTitleList


Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781467331227
1467331228
EndPage 3269
ExternalDocumentID oai_research_chalmers_se_db0e7826_97b5_4a5f_8c76_bfe761f79a34
oai_DiVA_org_liu_88545
6655048
Genre orig-research
GroupedDBID 29F
29I
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
6IG
ABXSW
ADFMO
ADTPV
BNKNJ
BVBDO
D8T
DG8
IERZE
F1S
ID FETCH-LOGICAL-i330t-de46dedd18b005abf5afac0daf9c805c1543b6175991be26a8a90bac47c501f93
IEDL.DBID RIE
ISBN 9781467331227
1467331228
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000349673802120&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1550-3607
IngestDate Wed Nov 05 04:13:57 EST 2025
Tue Nov 04 16:41:14 EST 2025
Wed Aug 27 05:03:37 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i330t-de46dedd18b005abf5afac0daf9c805c1543b6175991be26a8a90bac47c501f93
OpenAccessLink https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-88545
PageCount 6
ParticipantIDs swepub_primary_oai_DiVA_org_liu_88545
swepub_primary_oai_research_chalmers_se_db0e7826_97b5_4a5f_8c76_bfe761f79a34
ieee_primary_6655048
PublicationCentury 2000
PublicationDate 2013-June
2013
PublicationDateYYYYMMDD 2013-06-01
2013-01-01
PublicationDate_xml – month: 06
  year: 2013
  text: 2013-June
PublicationDecade 2010
PublicationTitle 2013 IEEE International Conference on Communications
PublicationTitleAbbrev ICC
PublicationYear 2013
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001766354
ssj0052931
Score 1.8503929
Snippet Low density parity check (LDPC) codes can be decoded with a variety of decoding algorithms, offering a trade-off in terms of complexity, latency, and...
SourceID swepub
ieee
SourceType Open Access Repository
Publisher
StartPage 3264
SubjectTerms Complexity theory
Decoding
Iterative decoding
LDPC
max-product
Message Passing
Signal to noise ratio
sum-product
Title Comparison of reweighted message passing algorithms for LDPC decoding
URI https://ieeexplore.ieee.org/document/6655048
https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-88545
https://research.chalmers.se/publication/189203
WOSCitedRecordID wos000349673802120&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/eLvHCXMwlV3JThwxEC0ByiG5ZIEoQxb5kNzS4KG9HqMGlEgjNIck4mZ5KTMtwQyaJfw-5e5miCIuuVmyVbLK3a7nsus9gM8U86JJ2VY587oSQmNlvE1VVEloq6KXoWPXn-iLC3N5aac78HVbC4OI3eMzPCrN7i4_LeKmpMqOlSI8Lcwu7Gqt-lqtx3yKLrFTPOzCksJYz5UqaZ9RXD9cUXJ7_KNpypuu-miwNwir_EMW2gWY85f_N7VXcPBYqcem2xj0GnZw_gZe_EUyuA9nzVZqkC0yW-Jdlw3FxG6K_MkVslsC0DSU-eurxbJdz25WjKAsm5xOG5boeFpMH8Cv87OfzfdqEE-o2rrm6yqhUAlTGpvyo_mQpc8-8uQzLQ6XkaBTHQi-SAKIAU-UpyXiwUeho-TjbOu3sDdfzPEdMI90yDMhZ2ESGc1BRiWy9SLaWCelR7BfHOJue34MN_hiBF96f247CpX1afv7myPXuet244whADeCyRPjBq6jmYuzTkhm5VboUuBIkEY5q4N0wsvsTNTKhYxajbO2vhaHT8_mPTw_6ZUsKj7-AHvr5QY_wrP4Z92ulp-6b-keFvTKgQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTxsxELYoVCq9QAtVU2jrQ3vrgsP6eUQLCNRtlAOtuFl-jMlKkKA84O8z3iyhqrj0ZsnWyBrvej6PPd9HyDeMeUHHZIqUWFlwrqDQzsQiyMiVkcEJ37Lr12ow0FdXZrhGfqxqYQCgfXwGB7nZ3uXHSVjkVNmhlIinuX5FNrJyVlet9ZxRUTl68qd9WGAgW7KlCtxpJFNPl5TMHF5UVX7VVR50FjtplX_oQtsQc7b1f5PbJrvPtXp0uIpC78gajN-Tt3_RDO6Q02olNkgniU7hoc2HQqS3WQDlGugdQmgcSt3N9WTazEe3M4pgltYnw4pGPKBm07vk99npZXVedPIJRVOWbF5E4DJCjH2dfzXnk3DJBRZdwuVhIiB4Kj0CGIEQ0cORdLhIzLvAVRCsn0z5gayPJ2P4SKgDPOZpnxLXEY0mL4LkyTgeTCijVD2ykx1i75YMGbbzRY98X_pz1ZHJrE-aP8cWXWdvmoXVGiFcj9QvjOvYjkY2jFopmZmdgY2eAYIaaY3ywnInktVBSesTKNlPyriSf3p5Nl_Jm_PLX7WtLwY_98jm0VLXomD9fbI-ny7gM3kd7ufNbPql_a4eAcrfzco
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=2013+IEEE+International+Conference+on+Communications&rft.atitle=Comparison+of+reweighted+message+passing+algorithms+for+LDPC+decoding&rft.au=Wymeersch%2C+Henk&rft.au=Penna%2C+Federico&rft.au=Savic%2C+Vladimir&rft.au=Zhao%2C+Jun&rft.date=2013-01-01&rft.isbn=9781467331227&rft.spage=3264&rft_id=info:doi/10.1109%2FICC.2013.6655048&rft.externalDocID=oai_DiVA_org_liu_88545
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1550-3607&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1550-3607&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1550-3607&client=summon