Memory System Optimization for FPGA-Based Implementation of Quasi-Cyclic LDPC Codes Decoders

Designers are increasingly relying on field-programmable gate array (FPGA)-based emulation to evaluate the performance of low-density parity-check (LDPC) codes empirically down to bit-error rates of 10 -12 and below. This requires decoding architectures that can take advantage of the unique characte...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on circuits and systems. I, Regular papers Ročník 58; číslo 1; s. 98 - 111
Hlavní autoři: Xiaoheng Chen, Jingyu Kang, Shu Lin, Akella, Venkatesh
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.01.2011
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:1549-8328, 1558-0806
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 Designers are increasingly relying on field-programmable gate array (FPGA)-based emulation to evaluate the performance of low-density parity-check (LDPC) codes empirically down to bit-error rates of 10 -12 and below. This requires decoding architectures that can take advantage of the unique characteristics of a modern FPGA to maximize the decoding throughput. This paper presents two specific optimizations called vectorization and folding to take advantage of the configurable data-width and depth of embedded memory in an FPGA to improve the throughput of a decoder for quasi-cyclic LDPC codes. With folding it is shown that quasi-cyclic LDPC codes with a very large number of circulants can be implemented on FPGAs with a small number of embedded memory blocks. A synthesis tool called QCSyn is described, which takes the H matrix of a quasi-cyclic LDPC code and the resource characteristics of an FPGA and automatically synthesizes a vector or folded architecture that maximizes the decoding throughput for the code on the given FPGA by selecting the appropriate degree of folding and/or vectorization. This helps not only in reducing the design time to create a decoder but also in quickly retargeting the implementation to a different (perhaps new) FPGA or a different emulation board.
AbstractList Designers are increasingly relying on field-programmable gate array (FPGA)-based emulation to evaluate the performance of low-density parity-check (LDPC) codes empirically down to bit-error rates of [Formula Omitted] and below. This requires decoding architectures that can take advantage of the unique characteristics of a modern FPGA to maximize the decoding throughput. This paper presents two specific optimizations called vectorization and folding to take advantage of the configurable data-width and depth of embedded memory in an FPGA to improve the throughput of a decoder for quasi-cyclic LDPC codes. With folding it is shown that quasi-cyclic LDPC codes with a very large number of circulants can be implemented on FPGAs with a small number of embedded memory blocks. A synthesis tool called QCSyn is described, which takes the matrix of a quasi-cyclic LDPC code and the resource characteristics of an FPGA and automatically synthesizes a vector or folded architecture that maximizes the decoding throughput for the code on the given FPGA by selecting the appropriate degree of folding and/or vectorization. This helps not only in reducing the design time to create a decoder but also in quickly retargeting the implementation to a different (perhaps new) FPGA or a different emulation board.
Designers are increasingly relying on field-programmable gate array (FPGA)-based emulation to evaluate the performance of low-density parity-check (LDPC) codes empirically down to bit-error rates of 10 - 12 and below. This requires decoding architectures that can take advantage of the unique characteristics of a modern FPGA to maximize the decoding throughput. This paper presents two specific optimizations called vectorization and folding to take advantage of the configurable data-width and depth of embedded memory in an FPGA to improve the throughput of a decoder for quasi-cyclic LDPC codes. With folding it is shown that quasi-cyclic LDPC codes with a very large number of circulants can be implemented on FPGAs with a small number of embedded memory blocks. A synthesis tool called QCSyn is described, which takes the bf H matrix of a quasi-cyclic LDPC code and the resource characteristics of an FPGA and automatically synthesizes a vector or folded architecture that maximizes the decoding throughput for the code on the given FPGA by selecting the appropriate degree of folding and/or vectorization. This helps not only in reducing the design time to create a decoder but also in quickly retargeting the implementation to a different (perhaps new) FPGA or a different emulation board.
Designers are increasingly relying on field-programmable gate array (FPGA)-based emulation to evaluate the performance of low-density parity-check (LDPC) codes empirically down to bit-error rates of 10 -12 and below. This requires decoding architectures that can take advantage of the unique characteristics of a modern FPGA to maximize the decoding throughput. This paper presents two specific optimizations called vectorization and folding to take advantage of the configurable data-width and depth of embedded memory in an FPGA to improve the throughput of a decoder for quasi-cyclic LDPC codes. With folding it is shown that quasi-cyclic LDPC codes with a very large number of circulants can be implemented on FPGAs with a small number of embedded memory blocks. A synthesis tool called QCSyn is described, which takes the H matrix of a quasi-cyclic LDPC code and the resource characteristics of an FPGA and automatically synthesizes a vector or folded architecture that maximizes the decoding throughput for the code on the given FPGA by selecting the appropriate degree of folding and/or vectorization. This helps not only in reducing the design time to create a decoder but also in quickly retargeting the implementation to a different (perhaps new) FPGA or a different emulation board.
Author Jingyu Kang
Akella, Venkatesh
Shu Lin
Xiaoheng Chen
Author_xml – sequence: 1
  surname: Xiaoheng Chen
  fullname: Xiaoheng Chen
  email: xhchen@ucdavis.edu
  organization: Dept. of Electr. & Comput. Eng., Univ. of California, Davis, Davis, CA, USA
– sequence: 2
  surname: Jingyu Kang
  fullname: Jingyu Kang
  email: jykang@ucdavis.edU
  organization: Dept. of Electr. & Comput. Eng., Univ. of California, Davis, Davis, CA, USA
– sequence: 3
  surname: Shu Lin
  fullname: Shu Lin
  email: shulin@ucdavis.edu
  organization: Dept. of Electr. & Comput. Eng., Univ. of California, Davis, Davis, CA, USA
– sequence: 4
  givenname: Venkatesh
  surname: Akella
  fullname: Akella, Venkatesh
  email: akella@ucdavis.edu
  organization: Dept. of Electr. & Comput. Eng., Univ. of California, Davis, Davis, CA, USA
BookMark eNp9kD1PwzAQhi1UJCjwAxCLxcIU8EcdOyOEr0pFgCgbkuU4Z8koiYudDuXXkyoVAwPT3eme9z7eKZp0oQOETim5pJQUV8vybX7JyFAyIgQTZA8dUiFURhTJJ9t8VmSKM3WApil9EsIKwukh-niCNsQNftukHlr8vOp9679N70OHXYj4_uXhOrsxCWo8b1cNtND1Yzc4_Lo2yWflxjbe4sXtS4nLUEPCt2CHGNMx2nemSXCyi0fo_f5uWT5mi-eHeXm9yCwvSJ8ZKVluK-KqmbXSMscYtRU4yGEmagpOSVPldV5IUTtrlFPCGKGqms-sEZLzI3Qxzl3F8LWG1OvWJwtNYzoI66RVTgXPOSEDef6H_Azr2A3HacWVLIYd-QDJEbIxpBTBaevHp_tofKMp0VvP9dZzvfVc7zwflPSPchV9a-LmX83ZqPEA8MsLwQUjkv8AzmSO5Q
CODEN ITCSCH
CitedBy_id crossref_primary_10_1109_TVLSI_2017_2776561
crossref_primary_10_1109_TCSI_2020_3018048
crossref_primary_10_1145_2538668
crossref_primary_10_1002_dac_4765
crossref_primary_10_1049_iet_com_2011_0767
crossref_primary_10_1109_TCSI_2018_2884252
crossref_primary_10_1109_ACCESS_2016_2599408
crossref_primary_10_1109_TCSI_2015_2510619
crossref_primary_10_1109_ACCESS_2021_3065776
crossref_primary_10_1007_s00034_015_9993_8
crossref_primary_10_1016_j_phycom_2021_101369
crossref_primary_10_1109_ACCESS_2017_2723046
crossref_primary_10_1109_TCSII_2023_3344221
crossref_primary_10_1016_j_vlsi_2014_09_002
crossref_primary_10_1109_TCSI_2012_2230506
crossref_primary_10_1109_ACCESS_2021_3118544
crossref_primary_10_1109_TCSII_2018_2849504
crossref_primary_10_1051_jnwpu_20193730515
crossref_primary_10_1109_ACCESS_2017_2678103
crossref_primary_10_1109_COMST_2015_2510381
crossref_primary_10_3390_s23187828
crossref_primary_10_1109_TCSI_2011_2161389
crossref_primary_10_1145_2068716_2068723
crossref_primary_10_4218_etrij_14_0213_0046
crossref_primary_10_1049_cmu2_12318
crossref_primary_10_1109_TCSI_2011_2158712
Cites_doi 10.1109/TCSI.2008.926995
10.1109/GLOCOM.2007.619
10.1109/TCSI.2005.844113
10.1109/TCSI.2005.862181
10.1109/TCSI.2008.924892
10.1109/TCOMM.2004.831353
10.1109/TCSI.2004.826194
10.1109/TVLSI.2007.891098
10.1109/DATE.2007.364613
10.1109/SIPS.2002.1049697
10.1109/TVLSI.2008.917540
10.1109/DATE.2009.5090905
10.1109/18.748992
10.1109/TCSI.2005.862074
10.1109/TCSII.2009.2015353
10.1109/DATE.2005.39
10.1109/TCOMM.2005.858628
10.1109/TCSII.2007.894409
10.1109/GLOCOM.2006.160
10.1109/TCSI.2009.2019395
10.1109/4.987093
10.1109/TIT.2007.899516
10.1109/TED.2007.895247
10.1109/TIT.1962.1057683
10.1109/TSP.2004.823508
10.1109/DATE.2006.243816
10.1109/GLOCOM.2001.965981
10.1109/TCSI.2009.2018915
10.1109/26.768759
10.1017/CBO9780511803253
10.1109/TVLSI.2005.853615
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2011
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2011
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
F28
FR3
DOI 10.1109/TCSI.2010.2055250
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

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Architecture
EISSN 1558-0806
EndPage 111
ExternalDocumentID 2236758191
10_1109_TCSI_2010_2055250
5535207
Genre orig-research
GroupedDBID 0R~
29I
4.4
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACIWK
AETIX
AGQYO
AGSQL
AHBIQ
AIBXA
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
HZ~
H~9
IFIPE
IPLJI
JAVBF
M43
O9-
OCL
PZZ
RIA
RIE
RNS
VJK
AAYXX
CITATION
7SP
8FD
L7M
RIG
F28
FR3
ID FETCH-LOGICAL-c390t-a7726cb0fb4cc7c2f221cbefe6e45d1ef87ab6d6975dfca8f85aa58bd34ca5733
IEDL.DBID RIE
ISICitedReferencesCount 50
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000288244600009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1549-8328
IngestDate Sun Sep 28 01:27:01 EDT 2025
Mon Jun 30 10:22:00 EDT 2025
Tue Nov 18 22:32:14 EST 2025
Sat Nov 29 06:14:36 EST 2025
Tue Aug 26 17:18:14 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c390t-a7726cb0fb4cc7c2f221cbefe6e45d1ef87ab6d6975dfca8f85aa58bd34ca5733
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 838796976
PQPubID 85411
PageCount 14
ParticipantIDs ieee_primary_5535207
proquest_miscellaneous_861536300
proquest_journals_838796976
crossref_citationtrail_10_1109_TCSI_2010_2055250
crossref_primary_10_1109_TCSI_2010_2055250
PublicationCentury 2000
PublicationDate 2011-Jan.
2011-01-00
20110101
PublicationDateYYYYMMDD 2011-01-01
PublicationDate_xml – month: 01
  year: 2011
  text: 2011-Jan.
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on circuits and systems. I, Regular papers
PublicationTitleAbbrev TCSI
PublicationYear 2011
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 ref13
ref12
ref15
ref14
ref31
ref30
ref32
ref10
ref2
ref1
ref17
ref16
ref19
ref18
zhang (ref11) 2002
ref24
lin (ref29) 2009; 56
ref23
ref26
ref25
ref20
ref22
ref21
ref28
ref27
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref25
  doi: 10.1109/TCSI.2008.926995
– ident: ref13
  doi: 10.1109/GLOCOM.2007.619
– ident: ref23
  doi: 10.1109/TCSI.2005.844113
– ident: ref19
  doi: 10.1109/TCSI.2005.862181
– ident: ref14
  doi: 10.1109/TCSI.2008.924892
– ident: ref4
  doi: 10.1109/TCOMM.2004.831353
– ident: ref9
  doi: 10.1109/TCSI.2004.826194
– ident: ref12
  doi: 10.1109/TVLSI.2007.891098
– ident: ref28
  doi: 10.1109/DATE.2007.364613
– ident: ref10
  doi: 10.1109/SIPS.2002.1049697
– ident: ref8
  doi: 10.1109/TVLSI.2008.917540
– ident: ref24
  doi: 10.1109/DATE.2009.5090905
– year: 2002
  ident: ref11
  publication-title: Efficient VLSI Architectures for Error-Correcting Coding
– ident: ref2
  doi: 10.1109/18.748992
– ident: ref20
  doi: 10.1109/TCSI.2005.862074
– volume: 56
  start-page: 215
  year: 2009
  ident: ref29
  article-title: efficient shuffle network architecture and application for wimax ldpc decoders
  publication-title: IEEE Trans Circuits Syst II Exp Briefs
  doi: 10.1109/TCSII.2009.2015353
– ident: ref26
  doi: 10.1109/DATE.2005.39
– ident: ref5
  doi: 10.1109/TCOMM.2005.858628
– ident: ref21
  doi: 10.1109/TCSII.2007.894409
– ident: ref6
  doi: 10.1109/GLOCOM.2006.160
– ident: ref31
  doi: 10.1109/TCSI.2009.2019395
– ident: ref18
  doi: 10.1109/4.987093
– ident: ref15
  doi: 10.1109/TIT.2007.899516
– ident: ref30
  doi: 10.1109/TED.2007.895247
– ident: ref1
  doi: 10.1109/TIT.1962.1057683
– ident: ref22
  doi: 10.1109/TSP.2004.823508
– ident: ref27
  doi: 10.1109/DATE.2006.243816
– ident: ref7
  doi: 10.1109/GLOCOM.2001.965981
– ident: ref32
  doi: 10.1109/TCSI.2009.2018915
– ident: ref3
  doi: 10.1109/26.768759
– ident: ref16
  doi: 10.1017/CBO9780511803253
– ident: ref17
  doi: 10.1109/TVLSI.2005.853615
SSID ssj0029031
Score 2.2518902
Snippet Designers are increasingly relying on field-programmable gate array (FPGA)-based emulation to evaluate the performance of low-density parity-check (LDPC) codes...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 98
SubjectTerms Alignment
Architecture
Bandwidth
Codes
Decoders
Decoding
Emulation
Field programmable gate arrays
field programmable logic array (FPGA)
Folding
Iterative decoding
Low density parity check codes
low-density parity-check (LDPC) decoder
Mathematical analysis
memory system optimization
NASA
normalized min-sum algorithm
Optimization
Parity check codes
Programmable logic arrays
quasi-cyclic low-density parity-check (QC-LDPC) codes
Random access memory
Throughput
Vectors (mathematics)
Very large scale integration
very large scale integration (VLSI) implementation
Title Memory System Optimization for FPGA-Based Implementation of Quasi-Cyclic LDPC Codes Decoders
URI https://ieeexplore.ieee.org/document/5535207
https://www.proquest.com/docview/838796976
https://www.proquest.com/docview/861536300
Volume 58
WOSCitedRecordID wos000288244600009&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-0806
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0029031
  issn: 1549-8328
  databaseCode: RIE
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3db9QwDLfGxAM88DUQxwDlgSdEWK5tkuZxdBwgjXGIIe0BqUodRzppa9H1btL--yVtVoFASEh9qFS3amIntmP7Z4BXNuggIplxh1LwotHErdA-yHIQrkJm6NzQteRYn5yUZ2dmuQNvploYIhqSz-htvB1i-a7DbTwqO5ARiySWjt_SWo21WpNzZUQ-YqMWhgcpLVMEcy7MwWn17dOYxJUJGcN4v-mgoanKHzvxoF4W9__vxx7AvWRGssOR7w9hh9pHcPcXcME9-PE5JtFesRGTnH0Je8NFKrpkwVJli-WHQ_4uKDHHBojgi1SF1LLOs69b2694dYXnK2THR8uKVZ2jnh1RrIFf94_h--L9afWRp14KHHMjNtwGK1phI3xTIGrMfJbNsSFPigrp5uRLbRvllNHSebSlL6W1smxcXqCNmIlPYLftWnoKjHKlC9cUDm1wrtHbTFinnRKNybyScgbiZnZrTEDjsd_FeT04HMLUkSF1ZEidGDKD19MrP0eUjX8R70UOTIRp8mewf8PCOq3Dvi7zUpswKDUDNj0NCyhGRWxL3TaQRJM3Ao89-_t39-HOeI4cr-ewu1lv6QXcxsvNql-_HITwGl2O2ik
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3db9MwED9NAwl4GB9jWjc-_MATIsx17Dh-HBllE10pokh7QIoc-yxV6hLUtEj777ETLwKBkJDyECmXKPadfXe-u98BvNJeByEKllgjaMIriYmm0nlZ9sLFBTPWdl1LpnI2y6-u1HwH3gy1MIjYJZ_h23DbxfJtY7bhqOxEBCySUDp-R3DOaF-tNbhXiqY9OipXiZfTPMYwx1SdLIovF30aF6MiBPJ-00JdW5U_9uJOwUwe_t-vPYK9aEiS057zj2EH6yfw4Bd4wX34dhnSaG9Ij0pOPvnd4TqWXRJvq5LJ_MNp8s6rMUs6kODrWIdUk8aRz1vdLpPixqyWhkzP5gUpGostOcNQBb9un8LXyftFcZ7EbgqJSRXdJNrb0ZmpqKu4MdIwx9jYVOgwQy7sGF0udZXZTElhndG5y4XWIq9syo0OqIkHsFs3NR4CwTST3FbcGu3da-M0o9pKm9FKMZcJMQJ6O7uliVDjoePFquxcDqrKwJAyMKSMDBnB6-GV7z3Oxr-I9wMHBsI4-SM4vmVhGVdiW-ZpLpUfVDYCMjz1SyjERXSNzdaTBKM3QI8d_f27L-He-eJyWk4vZh-P4X5_qhyuZ7C7WW_xOdw1PzbLdv2iE8if3OLdcA
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=Memory+System+Optimization+for+FPGA-Based+Implementation+of+Quasi-Cyclic+LDPC+Codes+Decoders&rft.jtitle=IEEE+transactions+on+circuits+and+systems.+I%2C+Regular+papers&rft.au=Chen%2C+Xiaoheng&rft.au=Kang%2C+Jingyu&rft.au=Lin%2C+Shu&rft.au=Akella%2C+Venkatesh&rft.date=2011-01-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1549-8328&rft.eissn=1558-0806&rft.volume=58&rft.issue=1&rft.spage=98&rft_id=info:doi/10.1109%2FTCSI.2010.2055250&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2236758191
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1549-8328&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1549-8328&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1549-8328&client=summon