Design of A Parallel Decoding Method for LDPC Code Generated via Primitive Polynomial

An effective way of improving decoding performance of an LDPC code is to extend the single-decoder decoding method to a parallel decoding method with multiple sub-decoders. To this end, this paper proposes a parallel decoding method for the LDPC codes constructed by m-sequence. In this method, the s...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Electronics (Basel) Ročník 10; číslo 4; s. 425
Hlavní autori: Zhang, Zhe, Zhou, Liang, Zhou, Zhi Heng
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: 09.02.2021
ISSN:2079-9292, 2079-9292
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract An effective way of improving decoding performance of an LDPC code is to extend the single-decoder decoding method to a parallel decoding method with multiple sub-decoders. To this end, this paper proposes a parallel decoding method for the LDPC codes constructed by m-sequence. In this method, the sub-decoders have two types. The first one contains only one decoding module using the original parity-check constraints to implement a belief propagation (BP) algorithm. The second one consists of a pre-decode module and a decoding module. The parity-check matrices for pre-decode modules are generated by the parity-check constraints of the sub-sequences sampled from an m-sequence. Then, the number of iterations of the BP process in each pre-decode module is set as half of the girth of the parity-check matrix, resulting in the elimination of the impact of short cycles. Using maximum a posterior (MAP), the least metric selector (LMS) finally picks out a codeword from the outputs of sub-decoders. Our simulation results show that the performance gain of the proposed parallel decoding method with five sub-decoders is about 0.4 dB, compared to the single-decoder decoding method at the bit error rate (BER) of 10−5.
AbstractList An effective way of improving decoding performance of an LDPC code is to extend the single-decoder decoding method to a parallel decoding method with multiple sub-decoders. To this end, this paper proposes a parallel decoding method for the LDPC codes constructed by m-sequence. In this method, the sub-decoders have two types. The first one contains only one decoding module using the original parity-check constraints to implement a belief propagation (BP) algorithm. The second one consists of a pre-decode module and a decoding module. The parity-check matrices for pre-decode modules are generated by the parity-check constraints of the sub-sequences sampled from an m-sequence. Then, the number of iterations of the BP process in each pre-decode module is set as half of the girth of the parity-check matrix, resulting in the elimination of the impact of short cycles. Using maximum a posterior (MAP), the least metric selector (LMS) finally picks out a codeword from the outputs of sub-decoders. Our simulation results show that the performance gain of the proposed parallel decoding method with five sub-decoders is about 0.4 dB, compared to the single-decoder decoding method at the bit error rate (BER) of 10−5.
Author Zhou, Zhi Heng
Zhang, Zhe
Zhou, Liang
Author_xml – sequence: 1
  givenname: Zhe
  surname: Zhang
  fullname: Zhang, Zhe
– sequence: 2
  givenname: Liang
  surname: Zhou
  fullname: Zhou, Liang
– sequence: 3
  givenname: Zhi Heng
  surname: Zhou
  fullname: Zhou, Zhi Heng
BookMark eNp9kM1KAzEURoNUsNY-gZu8wGh-ZqbJsky1CiPOwq6HTHJTI2kimVDo2zuiCxHxbr67-M7lci7RLMQACF1TcsO5JLfgQecUg9MjJaQkJavO0JyRlSwkk2z2Y79Ay3F8I9NIygUnc7TbwOj2AUeL17hTSXkPHm9AR-PCHj9Bfo0G25hwu-ka3EQDeAsBkspg8NEp3CV3cNkdAXfRn0I8OOWv0LlVfoTldy7Q7v7upXko2uftY7NuC81kmQvK6srwyjJqpbCmtBUphRoqJkytLbdkIOUg7AB0pZgdxIpQXdfKTB0AwQe-QPzrrk5xHBPY_n36RqVTT0n_Kaf_Q85EyV-UdlllF0NOyvl_2Q9Cl3C5
CitedBy_id crossref_primary_10_1109_LCOMM_2022_3174164
crossref_primary_10_32604_cmc_2023_032565
crossref_primary_10_3390_electronics11050733
crossref_primary_10_3390_electronics10162010
crossref_primary_10_1109_MBITS_2023_3322974
Cites_doi 10.1109/TCOMM.2008.060105
10.1109/SCVT.2010.5720472
10.1109/ISIT.2007.4557244
10.1109/WCSP.2017.8171065
10.1109/TCOMM.2009.07.070621
10.1109/JPROC.2011.2159571
10.1109/TIT.2004.839541
10.1109/TCOMM.2013.032713.120050
10.1002/9781119113263
10.1109/TCOMM.2010.01.070468
10.1109/TC.2012.175
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.3390/electronics10040425
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2079-9292
ExternalDocumentID 10_3390_electronics10040425
GroupedDBID 5VS
8FE
8FG
AAYXX
ADMLS
AFFHD
AFKRA
ALMA_UNASSIGNED_HOLDINGS
ARAPS
BENPR
BGLVJ
CCPQU
CITATION
HCIFZ
IAO
KQ8
MODMG
M~E
OK1
P62
PHGZM
PHGZT
PIMPY
PQGLB
PROAC
ID FETCH-LOGICAL-c294t-1265d35f21f98fd4f5048ab528d6cf3f0b04b8fbe17a2fb8701c66ad8abee83b3
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000623370300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2079-9292
IngestDate Sat Nov 29 07:14:03 EST 2025
Tue Nov 18 22:54:47 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c294t-1265d35f21f98fd4f5048ab528d6cf3f0b04b8fbe17a2fb8701c66ad8abee83b3
OpenAccessLink https://www.mdpi.com/2079-9292/10/4/425/pdf?version=1613963728
ParticipantIDs crossref_primary_10_3390_electronics10040425
crossref_citationtrail_10_3390_electronics10040425
PublicationCentury 2000
PublicationDate 2021-02-09
PublicationDateYYYYMMDD 2021-02-09
PublicationDate_xml – month: 02
  year: 2021
  text: 2021-02-09
  day: 09
PublicationDecade 2020
PublicationTitle Electronics (Basel)
PublicationYear 2021
References ref_1
Paolini (ref_2) 2011; 99
Hu (ref_4) 2005; 51
Dimnik (ref_9) 2009; 57
ref_3
Chen (ref_10) 2013; 61
(ref_12) 2014; 63
Halford (ref_8) 2008; 56
ref_11
ref_5
ref_7
Hehn (ref_6) 2010; 58
References_xml – volume: 56
  start-page: 513
  year: 2008
  ident: ref_8
  article-title: Transactions Letters—Random Redundant Iterative Soft-in Soft-out Decoding
  publication-title: IEEE Trans. Commun.
  doi: 10.1109/TCOMM.2008.060105
– ident: ref_3
  doi: 10.1109/SCVT.2010.5720472
– ident: ref_5
  doi: 10.1109/ISIT.2007.4557244
– ident: ref_1
  doi: 10.1109/WCSP.2017.8171065
– volume: 57
  start-page: 1982
  year: 2009
  ident: ref_9
  article-title: Improved random redundant iterative HDPC decoding
  publication-title: IEEE Trans. Commun.
  doi: 10.1109/TCOMM.2009.07.070621
– volume: 99
  start-page: 2056
  year: 2011
  ident: ref_2
  article-title: Reliability Options for Data Communications in the Future Deep-Space Missions
  publication-title: Proc. IEEE
  doi: 10.1109/JPROC.2011.2159571
– volume: 51
  start-page: 386
  year: 2005
  ident: ref_4
  article-title: Regular and irregular progressive edge-growth tanner graphs
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2004.839541
– volume: 61
  start-page: 2128
  year: 2013
  ident: ref_10
  article-title: Enhancing Iterative Decoding of Cyclic LDPC Codes Using Their Automorphism Groups
  publication-title: IEEE Trans. Commun.
  doi: 10.1109/TCOMM.2013.032713.120050
– ident: ref_11
  doi: 10.1002/9781119113263
– volume: 58
  start-page: 1
  year: 2010
  ident: ref_6
  article-title: Multiple-bases belief-propagation decoding of high-density cyclic codes
  publication-title: IEEE Trans. Commun.
  doi: 10.1109/TCOMM.2010.01.070468
– volume: 63
  start-page: 196
  year: 2014
  ident: ref_12
  article-title: Correcting DFT Codes with a Modified Berlekamp-Massey Algorithm and Kalman Recursive Syndrome Extension
  publication-title: IEEE Trans. Comput.
  doi: 10.1109/TC.2012.175
– ident: ref_7
  doi: 10.1109/ISIT.2007.4557244
SSID ssj0000913830
Score 2.1929278
Snippet An effective way of improving decoding performance of an LDPC code is to extend the single-decoder decoding method to a parallel decoding method with multiple...
SourceID crossref
SourceType Enrichment Source
Index Database
StartPage 425
Title Design of A Parallel Decoding Method for LDPC Code Generated via Primitive Polynomial
Volume 10
WOSCitedRecordID wos000623370300001&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: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2079-9292
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913830
  issn: 2079-9292
  databaseCode: M~E
  dateStart: 20120101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 2079-9292
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913830
  issn: 2079-9292
  databaseCode: P5Z
  dateStart: 20120301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2079-9292
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913830
  issn: 2079-9292
  databaseCode: BENPR
  dateStart: 20120301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 2079-9292
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913830
  issn: 2079-9292
  databaseCode: PIMPY
  dateStart: 20120301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LTxsxELZayoEeEG1BPCsfemtX7Hq9a_vIUz0AygEkxCXyU0SKNlESEL30t3fs9T5AEYJDL1Y0cWa1mU8z49F4PoR-QApUWK1UolIhE6qpSKQtRVJIBeGWGqZcYC25YFdX_PZWDGJVaR7oBFhV8acnMf2vpgYZGNtfnX2HuVulIIDPYHRYweywvsnwp6EnI2SYkB_OPFcKeDY4ZYbrK5eBMTo0F16cDk7AH5hm9rTPPR9H8ufAM32FjqLBZPzHX1uOj2wK-C1zTqjYHkMcHPcKCm0J-u7edrLJQ10BkDFS9oR39yOIflEeCxAkCz3LovNTJGUigSyrdqp2iaxxtGkPULTnNWl99_mlN89z4dsfOz6guR9vl8bdz2dnv4hpbachnHG8muESJR_RJ8IK4fsAL_92hTk_KJUHjpr2JeppVV7P4RI9vYyml5pcb6D1eKbARzUWvqAPtvqKPvcmTX5DNzUq8MThI9ygAjeowDUqMKACe1RgjwrcogIDKnCLCtyhYhPdnJ9dn_xOIqNGoomgiyQjZWHywpHMCe4MdQU4cKkKwk2pXe5SlVLFnbIZk8Qp8OWZLktpYI-1PFf5FlqpJpXdRpgV2rDMUCO0pSYVXGhOpXMZyxh8o3YQaf6VoY7j5j3ryXj4ikl20K_2R9N62spr23fft30PrXX43Ucri9mDPUCr-nExms--BxT8A7iTfE8
linkProvider ISSN International Centre
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=Design+of+A+Parallel+Decoding+Method+for+LDPC+Code+Generated+via+Primitive+Polynomial&rft.jtitle=Electronics+%28Basel%29&rft.au=Zhang%2C+Zhe&rft.au=Zhou%2C+Liang&rft.au=Zhou%2C+Zhi+Heng&rft.date=2021-02-09&rft.issn=2079-9292&rft.eissn=2079-9292&rft.volume=10&rft.issue=4&rft.spage=425&rft_id=info:doi/10.3390%2Felectronics10040425&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_electronics10040425
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2079-9292&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2079-9292&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2079-9292&client=summon