Optimized Min-Sum decoding algorithm for Low Density PC codes

Low Density Parity Check (LDPC) approaches Shannon -limit performance for binary field and long code lengths. However performance of binary LDPC code is degraded when the code word length is small. An optimized min-sum algorithm for LDPC code is proposed in this paper. In this algorithm unlike other...

Full description

Saved in:
Bibliographic Details
Published in:2012 14th International Conference on Advanced Communication Technology (ICACT) pp. 475 - 480
Main Authors: Shafiullah, D. S., Islam, M. R., Faisal, M. M. A., Rahman, I.
Format: Conference Proceeding
Language:English
Published: IEEE 01.02.2012
Subjects:
Approximation algorithms
Bit error rate
Complexity theory
Decoding
Iterative decoding
LDPC codes
Min-sum algorithm
Normalized min-sum algorithm
Optimization
Optimization factor
ISBN:1467301507, 9781467301503
ISSN:1738-9445
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Low Density Parity Check (LDPC) approaches Shannon -limit performance for binary field and long code lengths. However performance of binary LDPC code is degraded when the code word length is small. An optimized min-sum algorithm for LDPC code is proposed in this paper. In this algorithm unlike other decoding methods an optimization factor has been introduced in both check node and bit node of the Min-sum algorithm. The optimization factor is obtained before decoding program and the same factor is multiplied twice in one cycle. So the increased complexity is fairly low. Simulation results show that the proposed Optimized Min-Sum decoding algorithm performs very close to the Sum-Product decoding, while preserving the main features of the Min-Sum decoding, that is low complexity and independence with respect to noise variance estimation errors.
AbstractList Low Density Parity Check (LDPC) approaches Shannon -limit performance for binary field and long code lengths. However performance of binary LDPC code is degraded when the code word length is small. An optimized min-sum algorithm for LDPC code is proposed in this paper. In this algorithm unlike other decoding methods an optimization factor has been introduced in both check node and bit node of the Min-sum algorithm. The optimization factor is obtained before decoding program and the same factor is multiplied twice in one cycle. So the increased complexity is fairly low. Simulation results show that the proposed Optimized Min-Sum decoding algorithm performs very close to the Sum-Product decoding, while preserving the main features of the Min-Sum decoding, that is low complexity and independence with respect to noise variance estimation errors.
Author Faisal, M. M. A.
Rahman, I.
Shafiullah, D. S.
Islam, M. R.
Author_xml – sequence: 1
  givenname: D. S.
  surname: Shafiullah
  fullname: Shafiullah, D. S.
  email: siamshafiullah@yahoo.com
  organization: Dept. of Electr. & Electron. Eng., Islamic Univ. of Technol., Dhaka, Bangladesh
– sequence: 2
  givenname: M. R.
  surname: Islam
  fullname: Islam, M. R.
  email: rakibuliut@yahoo.com
  organization: Dept. of Electr. & Electron. Eng., Islamic Univ. of Technol., Dhaka, Bangladesh
– sequence: 3
  givenname: M. M. A.
  surname: Faisal
  fullname: Faisal, M. M. A.
  email: oranta68@yahoo.com
  organization: Dept. of Electr. & Electron. Eng., Islamic Univ. of Technol., Dhaka, Bangladesh
– sequence: 4
  givenname: I.
  surname: Rahman
  fullname: Rahman, I.
  email: imran.iutoic@gmail.com
  organization: Dept. of Electr. & Electron. Eng., Islamic Univ. of Technol., Dhaka, Bangladesh
BookMark eNotjs1Kw0AURkesYFP7BG7mBQJzM3-ZhQuJPxUiFey-THLv1JEmKZmI1Kc3oKtvcQ6HL2OLfujpgmWl0xocGKkuWQbKWClAC7tgS7CyzJ1S-pqtU_oUQsxIiEIu2d32NMUu_hDy19jn718dR2oHjP2B--NhGOP00fEwjLwevvkD9SlOZ_5W8dmhdMOugj8mWv_viu2eHnfVJq-3zy_VfZ1HJ6YcERAklAU6KHwI2hFiq4M2ynkBHiUob3G-LK3yHqkoG2XaoEKDhtpGrtjtXzYS0f40xs6P570Bq4xW8hfGw0bs
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Xplore Digital Library
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore Digital Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 8955191634
9788955191622
9788955191639
8955191626
EndPage 480
ExternalDocumentID 6174654
Genre orig-research
GroupedDBID 6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i90t-dd1d13182d912aff59eddc5f5649a01ad314a7d146374aade28b46cf4fbd6ecb3
IEDL.DBID RIE
ISBN 1467301507
9781467301503
ISSN 1738-9445
IngestDate Wed Aug 27 03:46:44 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-dd1d13182d912aff59eddc5f5649a01ad314a7d146374aade28b46cf4fbd6ecb3
PageCount 6
ParticipantIDs ieee_primary_6174654
PublicationCentury 2000
PublicationDate 2012-Feb.
PublicationDateYYYYMMDD 2012-02-01
PublicationDate_xml – month: 02
  year: 2012
  text: 2012-Feb.
PublicationDecade 2010
PublicationTitle 2012 14th International Conference on Advanced Communication Technology (ICACT)
PublicationTitleAbbrev ICACT
PublicationYear 2012
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0003010023
ssj0000702770
Score 1.4915491
Snippet Low Density Parity Check (LDPC) approaches Shannon -limit performance for binary field and long code lengths. However performance of binary LDPC code is...
SourceID ieee
SourceType Publisher
StartPage 475
SubjectTerms Approximation algorithms
Bit error rate
Complexity theory
Decoding
Iterative decoding
LDPC codes
Min-sum algorithm
Normalized min-sum algorithm
Optimization
Optimization factor
Title Optimized Min-Sum decoding algorithm for Low Density PC codes
URI https://ieeexplore.ieee.org/document/6174654
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELXaioEJUIv4lgdGDHXi2M3AVKgYSqlEhbpVju8MQTRBbQqCX4-dhCIkFjbbyuCTz3nP9r07Qk6N8kBmLYvc4jKBsWVJqC1DjDUYG3Isq0Q8DNVo1JtO43GDnK21MIhYBp_huW-Wb_mQm5W_KrtwaOvTfzVJUylZabXW9ynOdQNV-95zxfQ9HpV6SL-nhYhKXZf0Lu1I0He6p7of_qquUoLLYOt_09omnR-VHh2v8WeHNDBrk8s79w-Yp58I9DbN2P1qTsGdMP0XVL885ou0eJpTx1TpMH-nVz58vfig4z712vZlh0wG15P-DatLJLA07hYMgAN3uzKAmAfa2ihGABPZSIpYd7mGkAutwFkZKqE1YNBLhDRW2AQkmiTcJa0sz3CPUG15olWUqK4xIgCrec84buMIouOAUsh90vaWz16rJBiz2uiDv4cPyaZjFkEV3nxEWsVihcdkw7wV6XJxUq7cF98dlfo
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED2VggQToBbxjQdGDHHiJM3AVKiKSEslKtStcuwzBNEEtSkIfj12GoqQWNhsK4NPPuc92_fuAE5laIFMa-qbxaUcI00TT2iKGAkltcewrBLxEIf9fms0igY1OFtqYRCxDD7Dc9ss3_JVLuf2quzCoK1N_7UCqz7nrrNQay1vVIzzumHlfc8Lrm8RqVRE2l3NuV8quwLr1IYGfSd8qvrer_oqJbx0Nv83sS1o_uj0yGCJQNtQw6wBl3fmLzBJP1GRXprR-_mEKHPGtF8Q8fKYT9PiaUIMVyVx_k6ubAB78UEGbWLV7bMmDDvXw3aXVkUSaBo5BVWKKWb2pasi5gqt_QiVkr72Ax4JhwnlMS5CZaz0Qi6EQreV8EBqrhMVoEy8HahneYa7QIRmiQj9JHSk5K7SgrWkYTeGIhoWGPBgDxrW8vHrIg3GuDJ6_-_hE1jvDnvxOL7p3x7AhuEZ7iLY-RDqxXSOR7Am34p0Nj0uV_EL45WZQQ
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=2012+14th+International+Conference+on+Advanced+Communication+Technology+%28ICACT%29&rft.atitle=Optimized+Min-Sum+decoding+algorithm+for+Low+Density+PC+codes&rft.au=Shafiullah%2C+D.+S.&rft.au=Islam%2C+M.+R.&rft.au=Faisal%2C+M.+M.+A.&rft.au=Rahman%2C+I.&rft.date=2012-02-01&rft.pub=IEEE&rft.isbn=9781467301503&rft.issn=1738-9445&rft.spage=475&rft.epage=480&rft.externalDocID=6174654
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1738-9445&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1738-9445&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1738-9445&client=summon