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...
Saved in:
| Published in: | IEEE transactions on circuits and systems. I, Regular papers Vol. 58; no. 1; pp. 98 - 111 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
IEEE
01.01.2011
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 1549-8328, 1558-0806 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| 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 All-Society Periodicals Package (ASPP) 2005–Present 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.251793 |
| 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/eLvHCXMwlV1Ra9wwDBZd6cP2sK7rxm7thh_2NOY1lzix_dimu3bQdTfWQR8GwbFlOGiTcbkr9N_XStzQsTEY5CFgJSSWbEmW9AngnXDei1R6btCmXGCGXDmN3OQGZZAHUWOPrn8mz8_V5aWeb8CHsRYGEfvkM_xIt30s37V2TUdlBzlhkVDp-CMpi6FWa3SudJIN2KhC8yClKkYwp4k-uCi_fx6SuNIkpzDebzqob6ryx07cq5fZ9v992DN4Gs1IdjjwfQc2sHkOTx6AC-7Czy-URHvLBkxy9jXsDdex6JIFS5XN5ieH_CgoMcd6iODrWIXUsNazb2vTLXh5a68Wlp0dz0tWtg47doxUA7_sXsCP2aeL8pTHXgrcZjpZcROs6MLWia-FtdKmPk2ntkaPBYrcTdEraerCFVrmzlujvMqNyVXtMmENYSa-hM2mbfAVsCJRwmqf0phQ6IwzWYZ-WgTnhADgJpDcz25lI9A49bu4qnqHI9EVMaQihlSRIRN4Pz7ya0DZ-BfxLnFgJIyTP4G9exZWcR12lcqU1OGnigmwcTQsIIqKmAbbdSAhk5eAx17__b178Hg4R6ZrHzZXyzW-gS17s1p0y7e9EN4BZ1Laiw |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3da9RAEB9KFdSH-lFLr_VjH3wS1-aSTbL7WFPPFq_niSf0QQib3Vk4uCZyuRP637uTbIOiCEIeAjsJyc7szszOzG8AXgnrnIhzxzWamAtMkEurkOtUY-7lQVTYoetP89lMXl2p-Q68GWphELFLPsO3dNvF8m1jtnRUdpISFgmVjt9JhYijvlprcK9UlPToqEJxL6cyxDDHkTpZFF8u-jSuOEopkPebFuraqvyxF3cKZvLw_z7tEewFQ5Kd9px_DDtYP4EHv8AL7sO3S0qjvWE9Kjn75HeH61B2ybytyibzD6f8nVdjlnUgwdehDqlmjWOft7pd8uLGrJaGTc_mBSsaiy07Q6qCX7dP4evk_aI456GbAjeJijZcezs6M1XkKmFMbmIXx2NTocMMRWrH6GSuq8xmKk-tM1o6mWqdysomwmhCTTyA3bqp8RBYFklhlItpTEi02uokQTfOvHtCEHAjiG5ntzQBapw6XqzKzuWIVEkMKYkhZWDICF4Pj3zvcTb-RbxPHBgIw-SP4PiWhWVYiW0pE5kr_1PZCNgw6pcQxUV0jc3Wk5DRS9BjR39_70u4d764nJbTi9nHY7jfnyrT9Qx2N-stPoe75sdm2a5fdAL5E-0C3dI |
| 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.issn=1549-8328&rft.eissn=1558-0806&rft.volume=58&rft.issue=1&rft.spage=98&rft.epage=111&rft_id=info:doi/10.1109%2FTCSI.2010.2055250&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TCSI_2010_2055250 |
| 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 |