Implementation of a Reduced Decoding Algorithm Complexity for Quasi-Cyclic Split-Row Threshold Low-Density Parity-Check Decoders

We propose two decoding algorithms for quasi-cyclic LDPC codes (QC-LDPC) and implement the more efficient one in this paper. These algorithms depend on the split row for the layered decoding method applied to the Min-Sum (MS) algorithm. We designate the first algorithm “Split-Row Layered Min-Sum” (S...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information (Basel) Jg. 15; H. 11; S. 684
Hauptverfasser:	Mejmaa, Bilal, Aqil, Chakir, Akharraz, Ismail, Ahaitouf, Abdelaziz
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Basel MDPI AG 01.11.2024
Schlagworte:	Algorithms Co-design Codes Complexity Decoders Decoding Error correcting codes FPGA implementation layered decoding LDPC codes Low density parity check codes min-sum Parity Satellite communications Specific gravity split row New York United States
ISSN:	2078-2489, 2078-2489
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	We propose two decoding algorithms for quasi-cyclic LDPC codes (QC-LDPC) and implement the more efficient one in this paper. These algorithms depend on the split row for the layered decoding method applied to the Min-Sum (MS) algorithm. We designate the first algorithm “Split-Row Layered Min-Sum” (SRLMS), and the second algorithm “Split-Row Threshold Layered Min-Sum” (SRTLMS). A threshold message passes from one partition to another in SRTLMS, minimizing the gap from the MS and achieving a binary error rate of 3 × 10−5 with Imax = 4 as the maximum number of iterations, resulting in a decrease of 0.25 dB. The simulation’s findings indicate that the SRTLMS is the most efficient variant decoding algorithm for LDPC codes, thanks to its compromise between performance and complexity. This paper presents the two invented algorithms and a comprehensive study of the co-design and implementation of the SRTLMS algorithm. We executed the implementation on a Xilinx Kintex-7 XC7K160 FPGA, achieving a maximum operating frequency of 101 MHz and a throughput of 606 Mbps.
AbstractList	We propose two decoding algorithms for quasi-cyclic LDPC codes (QC-LDPC) and implement the more efficient one in this paper. These algorithms depend on the split row for the layered decoding method applied to the Min-Sum (MS) algorithm. We designate the first algorithm “Split-Row Layered Min-Sum” (SRLMS), and the second algorithm “Split-Row Threshold Layered Min-Sum” (SRTLMS). A threshold message passes from one partition to another in SRTLMS, minimizing the gap from the MS and achieving a binary error rate of 3 × 10[sup.−5] with Imax = 4 as the maximum number of iterations, resulting in a decrease of 0.25 dB. The simulation’s findings indicate that the SRTLMS is the most efficient variant decoding algorithm for LDPC codes, thanks to its compromise between performance and complexity. This paper presents the two invented algorithms and a comprehensive study of the co-design and implementation of the SRTLMS algorithm. We executed the implementation on a Xilinx Kintex-7 XC7K160 FPGA, achieving a maximum operating frequency of 101 MHz and a throughput of 606 Mbps. We propose two decoding algorithms for quasi-cyclic LDPC codes (QC-LDPC) and implement the more efficient one in this paper. These algorithms depend on the split row for the layered decoding method applied to the Min-Sum (MS) algorithm. We designate the first algorithm “Split-Row Layered Min-Sum” (SRLMS), and the second algorithm “Split-Row Threshold Layered Min-Sum” (SRTLMS). A threshold message passes from one partition to another in SRTLMS, minimizing the gap from the MS and achieving a binary error rate of 3 × 10−5 with Imax = 4 as the maximum number of iterations, resulting in a decrease of 0.25 dB. The simulation’s findings indicate that the SRTLMS is the most efficient variant decoding algorithm for LDPC codes, thanks to its compromise between performance and complexity. This paper presents the two invented algorithms and a comprehensive study of the co-design and implementation of the SRTLMS algorithm. We executed the implementation on a Xilinx Kintex-7 XC7K160 FPGA, achieving a maximum operating frequency of 101 MHz and a throughput of 606 Mbps.
Audience	Academic
Author	Aqil, Chakir Ahaitouf, Abdelaziz Mejmaa, Bilal Akharraz, Ismail
Author_xml	– sequence: 1 givenname: Bilal orcidid: 0000-0001-6758-8054 surname: Mejmaa fullname: Mejmaa, Bilal – sequence: 2 givenname: Chakir orcidid: 0000-0003-2457-0449 surname: Aqil fullname: Aqil, Chakir – sequence: 3 givenname: Ismail surname: Akharraz fullname: Akharraz, Ismail – sequence: 4 givenname: Abdelaziz orcidid: 0000-0002-5310-1388 surname: Ahaitouf fullname: Ahaitouf, Abdelaziz
BookMark	eNpNkUtv3CAUha0qlZqm2fUHIHVbp2BsDMuR08dIIzXPNcIXmGFqmykwSmfXn14cR1W4C9DVOR_36rwvziY_maL4SPAVpQJ_cZP1pCEEM16_Kc4r3PKyqrk4e_V-V1zGuMf5tC2vOTkv_q7Hw2BGMyWVnJ-Qt0ihO6OPYDS6NuC1m7ZoNWx9cGk3os7P-j8unZD1Ad0eVXRld4LBAbo_DC6Vd_4JPeyCiTs_aLTxT-W1meJsuFGZcSq7nYFfC9uE-KF4a9UQzeXLfVE8fvv60P0oNz-_r7vVpgTKaCqN7tuKc0yqRijd06ZpNeaYEVXZugaCGy0qYWmlBPScYNC2BdKTCiiApopeFOuFq73ay0Nwowon6ZWTzw0ftlKF5GAwsmdE9EzXLYOmZgYE5zUhmjOqxfxPZn1aWIfgfx9NTHLvj2HK40tKKMUMUzyrrhbVVmXoHE8KCnJpMzrI4VmX-ytOOKVtXiwbPi8GCD7GYOz_MQmWc8bydcb0H4zem1Q
Cites_doi	10.1109/ICCCN.2009.5235280 10.1109/JSSC.2007.916610 10.1109/LCOMM.2019.2924210 10.1109/EExPolytech50912.2020.9243997 10.1109/4234.905935 10.1155/2021/6698602 10.1002/sat.843 10.25046/aj020514 10.1049/iet-com.2017.0277 10.1109/TIT.1962.1057683 10.1109/CCECE.2018.8447564 10.31436/iiumej.v18i2.677 10.3390/computers13080195 10.1049/el:19961141 10.1109/TCOMM.2004.836563 10.1109/VLSID.2007.19 10.1109/ISCAS.2009.5118296 10.1109/TCOMM.2005.852852 10.1109/ICCD.2006.4380835 10.1109/VLSID49098.2020.00018 10.1109/LCOMM.2024.3360450 10.1007/s11277-019-06167-7 10.1109/ICCT.2017.8359612 10.1109/LCOMM.2005.1506712 10.1109/JSAC.2009.090816 10.1109/MWC.2005.1561948 10.1109/LCOMM.2016.2517142 10.1109/LCOMM.2004.825737 10.1109/18.959255 10.3390/electronics12173667
ContentType	Journal Article
Copyright	COPYRIGHT 2024 MDPI AG 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: COPYRIGHT 2024 MDPI AG – notice: 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	AAYXX CITATION 3V. 7SC 7XB 8AL 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI Q9U DOA
DOI	10.3390/info15110684
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology collection ProQuest One ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central Basic DOAJ Open Access Full Text
DatabaseTitle	CrossRef Publicly Available Content Database Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni)
DatabaseTitleList	Publicly Available Content Database CrossRef
Database_xml	– sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: PIMPY name: Proquest Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	2078-2489
ExternalDocumentID	oai_doaj_org_article_b619b6d476c546ec988411d863d905d9 A818337012 10_3390_info15110684
GeographicLocations	New York United States
GeographicLocations_xml	– name: New York – name: United States
GroupedDBID	.4I 5VS 8FE 8FG AADQD AAFWJ AAYXX ABDBF ABUWG ADBBV ADMLS AFFHD AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS ARAPS AZQEC BCNDV BENPR BGLVJ BPHCQ CCPQU CITATION DWQXO GNUQQ GROUPED_DOAJ HCIFZ IAO ITC K6V K7- KQ8 MK~ ML~ MODMG M~E OK1 P2P P62 PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC XH6 3V. 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D M0N PKEHL PQEST PQUKI Q9U
ID	FETCH-LOGICAL-c363t-edb728801259adb3557d08061a2f44c105d929f32a9cb810cdf7c1b12c3ccd3a3
IEDL.DBID	DOA
ISICitedReferencesCount	0
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001365436600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	2078-2489
IngestDate	Tue Oct 14 19:04:36 EDT 2025 Fri Jul 25 23:30:10 EDT 2025 Tue Nov 04 18:26:00 EST 2025 Sat Nov 29 07:12:32 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	11
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c363t-edb728801259adb3557d08061a2f44c105d929f32a9cb810cdf7c1b12c3ccd3a3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-5310-1388 0000-0001-6758-8054 0000-0003-2457-0449
OpenAccessLink	https://doaj.org/article/b619b6d476c546ec988411d863d905d9
PQID	3133060309
PQPubID	2032384
ParticipantIDs	doaj_primary_oai_doaj_org_article_b619b6d476c546ec988411d863d905d9 proquest_journals_3133060309 gale_infotracacademiconefile_A818337012 crossref_primary_10_3390_info15110684
PublicationCentury	2000
PublicationDate	2024-11-01
PublicationDateYYYYMMDD	2024-11-01
PublicationDate_xml	– month: 11 year: 2024 text: 2024-11-01 day: 01
PublicationDecade	2020
PublicationPlace	Basel
PublicationPlace_xml	– name: Basel
PublicationTitle	Information (Basel)
PublicationYear	2024
Publisher	MDPI AG
Publisher_xml	– name: MDPI AG
References	Chung (ref_3) 2001; 5 Xiao (ref_27) 2006; 12 Gallager (ref_1) 1962; 8 Chang (ref_13) 2019; 23 Aqil (ref_14) 2021; 2021 Kakde (ref_25) 2017; 18 Mrabti (ref_21) 2012; 4 ref_32 ref_31 ref_19 Zhang (ref_10) 2004; 8 Zhao (ref_16) 2005; 53 Jiang (ref_11) 2005; 9 Wang (ref_12) 2018; 12 Hemati (ref_18) 2016; 20 ref_23 ref_22 ref_20 Li (ref_30) 2024; 28 MacKay (ref_2) 1996; 32 Hajiyat (ref_17) 2019; 106 Liu (ref_29) 2008; 43 Zhang (ref_24) 2009; 27 ref_28 ref_26 Landolsi (ref_5) 2006; 24 ref_8 ref_4 ref_7 Kou (ref_9) 2001; 47 ref_6 Chen (ref_15) 2005; 53
References_xml	– ident: ref_28 doi: 10.1109/ICCCN.2009.5235280 – volume: 43 start-page: 684 year: 2008 ident: ref_29 article-title: An LDPC Decoder Chip Based on Self-Routing Network for IEEE 802.16e Applications publication-title: IEEE J. Solid-State Circuits doi: 10.1109/JSSC.2007.916610 – volume: 23 start-page: 1524 year: 2019 ident: ref_13 article-title: Multi-Stage Bit-Flipping Decoding Algorithms for LDPC Codes publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2019.2924210 – ident: ref_32 doi: 10.1109/EExPolytech50912.2020.9243997 – volume: 5 start-page: 58 year: 2001 ident: ref_3 article-title: On the Design of Low-Density Parity-Check Codes within 0.0045 dB of the Shannon Limit publication-title: IEEE Commun. Lett. doi: 10.1109/4234.905935 – volume: 4 start-page: 29 year: 2012 ident: ref_21 article-title: Reduced Complexity of Decoding Algorithm for Irregular LDPC Codes Using a Split Row Method publication-title: J. Wirel. Netw. Commun. – volume: 2021 start-page: 6698602 year: 2021 ident: ref_14 article-title: A New Reliability Ratio Weighted Bit Flipping Algorithm for Decoding LDPC Codes publication-title: Wirel. Commun. Mob. Comput. doi: 10.1155/2021/6698602 – volume: 24 start-page: 303 year: 2006 ident: ref_5 article-title: Semi-random LDPC codes for CDMA communication over non-linear band-limited satellite channels publication-title: Int. J. Satell. Commun. Netw. doi: 10.1002/sat.843 – ident: ref_22 doi: 10.25046/aj020514 – volume: 12 start-page: 271 year: 2018 ident: ref_12 article-title: Cyclic Switching Weighted Bit-Flipping Decoding for Low-Density Parity-Check Codes publication-title: IET Commun. doi: 10.1049/iet-com.2017.0277 – volume: 8 start-page: 1962 year: 1962 ident: ref_1 article-title: Low-density parity-check codes publication-title: IRE Trans. Inf. Theory doi: 10.1109/TIT.1962.1057683 – ident: ref_26 doi: 10.1109/CCECE.2018.8447564 – volume: 18 start-page: 128 year: 2017 ident: ref_25 article-title: Implementation of Decoding Architecture for LDPC Code Using a Layered Min-Sum Algorithm publication-title: IUM Eng. J. doi: 10.31436/iiumej.v18i2.677 – ident: ref_6 doi: 10.3390/computers13080195 – volume: 32 start-page: 1645 year: 1996 ident: ref_2 article-title: Near Shano Limit Performance of Low-Density-Parity-Check Codes publication-title: Electron. Lett. doi: 10.1049/el:19961141 – volume: 53 start-page: 549 year: 2005 ident: ref_16 article-title: On implementation of min-sum algorithm and its modifications for decoding low-density Paritycheck (LDPC) codes publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2004.836563 – ident: ref_23 doi: 10.1109/VLSID.2007.19 – ident: ref_20 doi: 10.1109/ISCAS.2009.5118296 – volume: 53 start-page: 1288 year: 2005 ident: ref_15 article-title: Reduced-complexity decoding of LDPC codes publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2005.852852 – ident: ref_19 doi: 10.1109/ICCD.2006.4380835 – ident: ref_4 – ident: ref_8 doi: 10.1109/VLSID49098.2020.00018 – volume: 28 start-page: 754 year: 2024 ident: ref_30 article-title: Efficient construction of quasi-cyclic LDPC codes with multiple lifting sizes publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2024.3360450 – volume: 106 start-page: 377 year: 2019 ident: ref_17 article-title: Channel Coding Scheme for 5G Mobile Communication System for Short Length Message Transmission publication-title: Wirel. Pers. Commun. doi: 10.1007/s11277-019-06167-7 – ident: ref_7 doi: 10.1109/ICCT.2017.8359612 – volume: 9 start-page: 814 year: 2005 ident: ref_11 article-title: An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes publication-title: Commun. Lett. IEEE doi: 10.1109/LCOMM.2005.1506712 – volume: 27 start-page: 985 year: 2009 ident: ref_24 article-title: High-Throughput Layered Decoder Implementation for Quasi-Cyclic LDPC Codes publication-title: IEEE J. Sel. Areas Commun. doi: 10.1109/JSAC.2009.090816 – volume: 12 start-page: 82 year: 2006 ident: ref_27 article-title: IEEE 802.11N: Enhancements for higher throughput in wireless LANs publication-title: IEEE Wirel. Commun. doi: 10.1109/MWC.2005.1561948 – volume: 20 start-page: 422 year: 2016 ident: ref_18 article-title: A Relaxed Min-Sum LDPC Decoder with Simplified Check Nodes publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2016.2517142 – volume: 8 start-page: 165 year: 2004 ident: ref_10 article-title: A modified weighted bit flipping decoding of low-density parity-check codes publication-title: Commun. Lett. IEEE doi: 10.1109/LCOMM.2004.825737 – volume: 47 start-page: 2711 year: 2001 ident: ref_9 article-title: Low-density parity check codes based on finite geometries: A rediscovery and more publication-title: IEEE Trans. Inform. Theory doi: 10.1109/18.959255 – ident: ref_31 doi: 10.3390/electronics12173667
SSID	ssj0000778481
Score	2.2959223
Snippet	We propose two decoding algorithms for quasi-cyclic LDPC codes (QC-LDPC) and implement the more efficient one in this paper. These algorithms depend on the...
SourceID	doaj proquest gale crossref
SourceType	Open Website Aggregation Database Index Database
StartPage	684
SubjectTerms	Algorithms Co-design Codes Complexity Decoders Decoding Error correcting codes FPGA implementation layered decoding LDPC codes Low density parity check codes min-sum Parity Satellite communications Specific gravity split row
SummonAdditionalLinks	– databaseName: Computer Science Database dbid: K7- link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwELZa6KEcKH0gllLkQ6ueLOLHxs4JbZcipFaIUipxi_wKrIANbAKIGz-dmcRL6aG99JrElqNvPPONH98Q8tG4ILl3kjnlIlM8VswFN2S6Uko5De4xC12xCb2_b46Pi4O04NakY5Vzn9g56lB7XCPfkpBMZTluCGxfXjGsGoW7q6mExnOyyIXgaOffNHtcY8m0RrX4_ry7hOx-C1GDGAd5kFF_RKJOsP9vbrmLNbuv_neUK2Q5sUw66s3iNXkWp2_I0hPtwbfkvtMFvkhXj6a0rqilhyjkGgPdgaQUgxodnZ9A9-3pBUXHgeKZ7R0Fnkt_XNtmwsZ3_nzi6U9gsi07rG_pEZhGgzta9Ht9y3bwdDw0OLBYIo-NT6M_6_sG0vmO_Nr9ejTeY6kcA_Myly2LwWlhMKINCxscEBUdgG_m3AoA1gNRC8C1Kils4Z3hmQ-V9txx4aX3QVq5Sham9TSuEYqqcTbKKLSIShfCQFJVSSOCK3KVxeGAfJpDU172qhslZCsIYfkUwgH5grg9foNa2d2DenZSpqlXOsgRXR6Uzv1Q5dEXxijOg8llKHDMA_IZUe86bmfW23QxAYaK2ljlCDiNlBr-e0A25qiXaao35W_I1__9-j15KYAR9RcZN8hCO7uOH8gLf9NOmtlmZ7kPADj4RQ priority: 102 providerName: ProQuest
Title	Implementation of a Reduced Decoding Algorithm Complexity for Quasi-Cyclic Split-Row Threshold Low-Density Parity-Check Decoders
URI	https://www.proquest.com/docview/3133060309 https://doaj.org/article/b619b6d476c546ec988411d863d905d9
Volume	15
WOSCitedRecordID	wos001365436600001&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: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2078-2489 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000778481 issn: 2078-2489 databaseCode: DOA dateStart: 20100101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2078-2489 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000778481 issn: 2078-2489 databaseCode: M~E dateStart: 20100101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 2078-2489 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000778481 issn: 2078-2489 databaseCode: P5Z dateStart: 20100301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 2078-2489 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000778481 issn: 2078-2489 databaseCode: K7- dateStart: 20100301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 2078-2489 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000778481 issn: 2078-2489 databaseCode: BENPR dateStart: 20100301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Proquest Publicly Available Content Database customDbUrl: eissn: 2078-2489 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000778481 issn: 2078-2489 databaseCode: PIMPY dateStart: 20100301 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwELZQ4QAHxFMsLZUPIE5W40di57jdbgWCrsJSpMIl8it0RbupdlOqXhA_nRknRcsBceHiQx6WM1_s-Ub2fEPIS-OC5N5J5pSLTPHYMBdcznSjlHIalscspGITejYzJydltVHqC8-E9fLAveH2HDB8VwSlC5-rIvrSGMV5MIUMZZaHlLoHrGcjmEprsNaoE9-fdJcQ1-8hXuDdIAIy6g8flKT6_7YgJy9z-IDcH-ghHffDekhuxeUjcm9DNPAx-ZkEfc-HnKElbRtq6RwVWGOgBxBNojei47OvLcT9p-cUZzyqXnbXFAgq_XBp1ws2ufZnC08_AgXt2Ly9oseA6Rq3ouj79ood4LF2eKGyWNuOTU6j_9b3DWzxCfl0OD2evGFDHQXmZSE7FoPTwqAryksbHDAMHcBkBbcCEPEczSjKRgpbemd45kOjPXdceOl9kFY-JVvLdhmfEYpybzbKKLSISpfCQDTUSCOCKwuVxXxEXt1Ytr7o5TJqCDMQgXoTgRHZR7P_fgZFrtMFgL4eoK__Bf2IvEbQUsfdyno7ZBTAUFHUqh4DGZFSw3ePyM4NrvUwR9e1hPA8K3CL6fn_GM02uSuA8PR5ijtkq1tdxhfkjv_eLdarXXJ7fzqr5rvpN4X2nWbQHv2YQlvlX-B-9fao-vwL2LzwHA
linkProvider	Directory of Open Access Journals
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwELZKQQIOvFEXCvhAxclqYntj54DQskvVapdVKYvUW_Ar7artpmxSVnvjF_EbmUmypRzg1gPXPCzb-TLzje35hpDX2noROyuYlTYwGYecWW-7TOVSSqvAPEa-LjahxmN9eJjur5Gfq1wYPFa5som1ofaFwzXybQHBVJTghsC7828Mq0bh7uqqhEYDi2FYLiBkK9_uDeD7bnG-82HS32VtVQHmRCIqFrxVXKNh7qbGW_C3ygNtSmLDoX8O-IYHypALblJndRw5nysX25g74ZwXRkC7N8hNKbRCrf6hYpdrOpFSqE7fnK8XIo22ESXgUyHu0vIPz1cXCPibG6h92879_21WHpB7LYumvQb2D8lamD0id69oKz4mP2rd47M2tWpGi5waeoBCtcHTAQTd6LRp7_QIhlMdn1E0jCgOWi0p8Hj66cKUU9ZfutOpo5-BqVfsoFjQCUC_xB07OioWbICn_-GFfYMlAFn_OLiTpm0g1U_Il2uZgqdkfVbMwgahqIpngghc8SBVyjUEjbnQ3Ns0kVHodsjWCgrZeaMqkkE0hpDJrkKmQ94jTi6fQS3w-kIxP8pa05JZiIFt4qVKXFcmwaVayzj2OhE-xT53yBtEWd1wNTfOtIkX0FXU_sp6wNmEUDDuDtlcoSxrTVmZ_YbYs3_ffkVu704-jrLR3nj4nNzhwP6apM1Nsl7NL8ILcst9r6bl_GX911Dy9boB-QtywVU6
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwELZKQQgOvFEXCvhAxcnaxHbi5IDQssuKaqvVUorUW_Ar7Yp2025SVnvjd_HrmMmjlAPceuCah-U4n2e-sT3fEPI6MU6E1ghmpPFMhj5nxpmIqVxKaRSYx8DVxSbUdJocHqazDfKzy4XBY5WdTawNtSssrpH3BQRTQYwbAv28PRYxG43fnZ0zrCCFO61dOY0GIhO_XkH4Vr7dHcG_3uF8_OFg-JG1FQaYFbGomHdG8QSNdJRqZ8D3KgcUKg41h75a4B4O6EMuuE6tScLAulzZ0ITcCmud0ALavUFugheOcI5NFLtc3wmUQqX65qy9EGnQR8SAf4UYLJF_eMG6WMDfXELt58b3_-cRekDuteyaDprp8JBs-MUjcveK5uJj8qPWQz5tU64WtMippvsoYOsdHUEwjs6cDk6O4HOq41OKBhNFQ6s1BX5PP13ocs6Ga3syt_QzMPiK7RcregBTosSdPLpXrNgIswLghZnG0oBseOztt6ZtINtPyJdrGYKnZHNRLPwWoaiWp73wXHEvVcoTCCZzkXBn0lgGPuqRnQ4W2VmjNpJBlIbwya7Cp0feI2Yun0GN8PpCsTzKWpOTGYiNTeykim0kY2_TJJFh6JJYuBT73CNvEHF1w9VSW90mZEBXURMsGwCXE0LBd_fIdoe4rDVxZfYbbs_-ffsVuQ04zPZ2p5Pn5A4HUtjkcm6TzWp54V-QW_Z7NS-XL-sJRMnX68bjL5xQXfQ
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=Implementation+of+a+Reduced+Decoding+Algorithm+Complexity+for+Quasi-Cyclic+Split-Row+Threshold+Low-Density+Parity-Check+Decoders&rft.jtitle=Information+%28Basel%29&rft.au=Mejmaa%2C+Bilal&rft.au=Aqil%2C+Chakir&rft.au=Akharraz%2C+Ismail&rft.au=Ahaitouf%2C+Abdelaziz&rft.date=2024-11-01&rft.issn=2078-2489&rft.eissn=2078-2489&rft.volume=15&rft.issue=11&rft.spage=684&rft_id=info:doi/10.3390%2Finfo15110684&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_info15110684
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2078-2489&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2078-2489&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2078-2489&client=summon