Maximum-Girth Cylinder-Type Block-Circulant LDPC Codes

In this paper, a particular class of block-circulant low-density parity-check (BC-LDPC) codes referred to as cylinder-type BC-LDPC (CTBC-LDPC) codes is studied. We represent a cylinder-type parity-check matrix H by a graph called the block-structure graph of H and denoted by BSG(H). Using the proper...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on communications Vol. 60; no. 4; pp. 952 - 962
Main Authors Gholami, M., Esmaeili, M.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.04.2012
Institute of Electrical and Electronics Engineers
Subjects
Online AccessGet full text
ISSN0090-6778
DOI10.1109/TCOMM.2012.022912.100419

Cover

Abstract In this paper, a particular class of block-circulant low-density parity-check (BC-LDPC) codes referred to as cylinder-type BC-LDPC (CTBC-LDPC) codes is studied. We represent a cylinder-type parity-check matrix H by a graph called the block-structure graph of H and denoted by BSG(H). Using the properties of BSG(H) we show that CTBC matrices with column-weight two and girth an arbitrary multiple of 8 can be constructed, while for a CTBC matrix H with column-weight ℓ ≥ 3 this girth cannot exceed 12. An algorithm generating CTBC-LDPC codes of arbitrary possible girth is given. The algorithm produces a large group of codes with flexible rate, length and girth. From performance perspective over AWGN channel, the maximum girth-12 CTBC-LDPC codes with column-weight at least three generated by the given algorithm are at least as good as their random-like counterpart codes and outperform the codes of the same size constructed by successive-level-growth, progressive-edge-growth, and partition-and-shift methods.
AbstractList In this paper, a particular class of block-circulant low-density parity-check (BC-LDPC) codes referred to as cylinder-type BC-LDPC (CTBC-LDPC) codes is studied. We represent a cylinder-type parity-check matrix H by a graph called the block-structure graph of H and denoted by BSG(H). Using the properties of BSG(H) we show that CTBC matrices with column-weight two and girth an arbitrary multiple of 8 can be constructed, while for a CTBC matrix H with column-weight ℓ ≥ 3 this girth cannot exceed 12. An algorithm generating CTBC-LDPC codes of arbitrary possible girth is given. The algorithm produces a large group of codes with flexible rate, length and girth. From performance perspective over AWGN channel, the maximum girth-12 CTBC-LDPC codes with column-weight at least three generated by the given algorithm are at least as good as their random-like counterpart codes and outperform the codes of the same size constructed by successive-level-growth, progressive-edge-growth, and partition-and-shift methods.
Author Esmaeili, M.
Gholami, M.
Author_xml – sequence: 1
  givenname: M.
  surname: Gholami
  fullname: Gholami, M.
  email: gholami-m@sci.sku.ac.ir
  organization: Dept. of Math. Sci., Shahrekord Univ., Shahrekord, Iran
– sequence: 2
  givenname: M.
  surname: Esmaeili
  fullname: Esmaeili, M.
  email: emorteza@cc.iut.ac.ir
  organization: Dept. of Math. Sci., Isfahan Univ. of Technol., Isfahan, Iran
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=25862346$$DView record in Pascal Francis
BookMark eNqNkD1PwzAURT0UibbwC1iyMKY8f9SxFyQwUJBalaHMlmM7wpAmlZ1K9N-TEmBgYrrS0z33SWeCRk3beIQyDDOMQV5t1Hq1mhHAZAaEyD4wAMNyhMYAEnJeFOIUTVJ6g_4OlI4RX5mPsN1v80WI3WumDnVonI_55rDz2W3d2vdchWj3tWm6bHn3rDLVOp_O0Ell6uTPv3OKXh7uN-oxX64XT-pmmVsKssuNYNwZjymUDgQAqagFLisiHKGlLZgoqC8LymXpGC1ZiYkUxlQO4zmbW0en6HLY3ZlkTV1F09iQ9C6GrYkHTeaCE8p437seeja2KUVfaRs604W26aIJtcagj4b0lyF9NKQHQ3ow1A-IPwM_P_6BXgxo8N7_YhxzBoWknzxQdh4
CODEN IECMBT
CitedBy_id crossref_primary_10_1049_iet_com_2013_0857
crossref_primary_10_1109_TCOMM_2013_012313_110692
crossref_primary_10_1007_s10772_021_09815_1
crossref_primary_10_1016_j_aeue_2017_02_009
crossref_primary_10_1109_LCOMM_2013_020513_122820
Cites_doi 10.1109/18.910577
10.1109/18.748992
10.1109/TIT.2004.831841
10.1109/18.910572
10.1109/TIT.1981.1056404
10.1049/el:19961141
10.1016/j.aeue.2008.11.013
10.1109/TIT.2004.828066
10.1109/TMAG.2004.829197
10.1109/TCOMM.2008.060527
10.1109/TCOMM.2009.10.080108
10.1007/978-1-4615-1525-8_7
10.1109/CWIT.2007.375703
10.1109/TMAG.2005.861748
10.1109/TCOMM.2004.833037
10.1109/GLOCOM.2002.1188406
10.1049/iet-com:20070324
10.1109/TIT.2004.838370
10.1109/18.910578
10.1109/TIT.1962.1057683
10.1109/TIT.2006.878179
10.1109/JSAC.2009.090802
10.1049/iet-com:20080013
10.1109/4234.681360
ContentType Journal Article
Copyright 2015 INIST-CNRS
Copyright_xml – notice: 2015 INIST-CNRS
DBID 97E
RIA
RIE
AAYXX
CITATION
IQODW
DOI 10.1109/TCOMM.2012.022912.100419
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE/IET Electronic Library (IEL)
CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Applied Sciences
EndPage 962
ExternalDocumentID 25862346
10_1109_TCOMM_2012_022912_100419
6164079
Genre orig-research
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
85S
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACKIV
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
RIA
RIE
RNS
TAE
TN5
VH1
ZCA
ZCG
AAYXX
CITATION
IQODW
RIG
ID FETCH-LOGICAL-c309t-a846dae130bd08002f3c069f28d23bc74873eb7369bd43b4b1298aafd11545cd3
IEDL.DBID RIE
ISSN 0090-6778
IngestDate Mon Jul 21 09:14:35 EDT 2025
Thu Apr 24 23:06:33 EDT 2025
Wed Oct 01 00:48:15 EDT 2025
Wed Aug 27 02:49:11 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords Performance evaluation
Block code
Partition method
Algorithm
Random codes
LDPC codes
AWGN channels
block-structure graph
Error correcting code
Parity check codes
maximum girth
Parity check
cylinder form matrix
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c309t-a846dae130bd08002f3c069f28d23bc74873eb7369bd43b4b1298aafd11545cd3
PageCount 11
ParticipantIDs crossref_primary_10_1109_TCOMM_2012_022912_100419
pascalfrancis_primary_25862346
crossref_citationtrail_10_1109_TCOMM_2012_022912_100419
ieee_primary_6164079
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2012-04-01
PublicationDateYYYYMMDD 2012-04-01
PublicationDate_xml – month: 04
  year: 2012
  text: 2012-04-01
  day: 01
PublicationDecade 2010
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
PublicationTitle IEEE transactions on communications
PublicationTitleAbbrev TCOMM
PublicationYear 2012
Publisher IEEE
Institute of Electrical and Electronics Engineers
Publisher_xml – name: IEEE
– name: Institute of Electrical and Electronics Engineers
References ref13
ref12
ref15
ref14
ref30
ref11
ref10
ref2
ref1
ref17
ref19
ref18
(ref31) 0
kim (ref22) 0; 53
ref24
ref23
ref25
ref20
thorpe (ref21) 0
ref28
ref27
ref29
ref8
ref7
song (ref26) 0
tanner (ref16) 0
ref4
ref3
ref6
shannon (ref5) 1948
chung (ref9) 2001; 5
References_xml – ident: ref7
  doi: 10.1109/18.910577
– ident: ref6
  doi: 10.1109/18.748992
– ident: ref15
  doi: 10.1109/TIT.2004.831841
– ident: ref4
  doi: 10.1109/18.910572
– volume: 5
  year: 2001
  ident: ref9
  article-title: On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
  publication-title: IEEE Commun Lett
– ident: ref3
  doi: 10.1109/TIT.1981.1056404
– start-page: 372-423
  year: 1948
  ident: ref5
  article-title: A mathematical theory of communication
  publication-title: Bell Syst Tech J
– ident: ref2
  doi: 10.1049/el:19961141
– ident: ref25
  doi: 10.1016/j.aeue.2008.11.013
– ident: ref12
  doi: 10.1109/TIT.2004.828066
– ident: ref28
  doi: 10.1109/TMAG.2004.829197
– year: 0
  ident: ref16
  article-title: A class of group structured LDPC codes
  publication-title: Proc ICSTA 2001
– year: 0
  ident: ref26
  article-title: Low complexity LDPC codes for magnetic recording
  publication-title: IEEE GLOBECOM 2002
– ident: ref30
  doi: 10.1109/TCOMM.2008.060527
– year: 0
  ident: ref31
– ident: ref14
  doi: 10.1109/TCOMM.2009.10.080108
– ident: ref10
  doi: 10.1007/978-1-4615-1525-8_7
– ident: ref20
  doi: 10.1109/CWIT.2007.375703
– ident: ref19
  doi: 10.1109/TMAG.2005.861748
– ident: ref11
  doi: 10.1109/TCOMM.2004.833037
– volume: 53
  start-page: 2885
  year: 0
  ident: ref22
  article-title: Quasi-cyclic low-density parity-check codes with girth larger than 12
  publication-title: IEEE Trans Inf Theory
– ident: ref27
  doi: 10.1109/GLOCOM.2002.1188406
– start-page: 42
  year: 0
  ident: ref21
  article-title: Low-density parity-check codes constructed from protographs
  publication-title: JPL IPN Progress Report
– ident: ref13
  doi: 10.1049/iet-com:20070324
– ident: ref17
  doi: 10.1109/TIT.2004.838370
– ident: ref8
  doi: 10.1109/18.910578
– ident: ref1
  doi: 10.1109/TIT.1962.1057683
– ident: ref18
  doi: 10.1109/TIT.2006.878179
– ident: ref23
  doi: 10.1109/JSAC.2009.090802
– ident: ref24
  doi: 10.1049/iet-com:20080013
– ident: ref29
  doi: 10.1109/4234.681360
SSID ssj0004033
Score 2.0691345
Snippet In this paper, a particular class of block-circulant low-density parity-check (BC-LDPC) codes referred to as cylinder-type BC-LDPC (CTBC-LDPC) codes is...
SourceID pascalfrancis
crossref
ieee
SourceType Index Database
Enrichment Source
Publisher
StartPage 952
SubjectTerms Algorithm design and analysis
Applied sciences
Arrays
AWGN channels
block-structure graph
Coding, codes
cylinder form matrix
Encoding
Exact sciences and technology
Information, signal and communications theory
LDPC codes
maximum girth
Parity check codes
Partitioning algorithms
Phase change materials
Signal and communications theory
Telecommunications and information theory
Title Maximum-Girth Cylinder-Type Block-Circulant LDPC Codes
URI https://ieeexplore.ieee.org/document/6164079
Volume 60
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE/IET Electronic Library
  issn: 0090-6778
  databaseCode: RIE
  dateStart: 19720101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://ieeexplore.ieee.org/
  omitProxy: false
  ssIdentifier: ssj0004033
  providerName: IEEE
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3JTsMwEB2VnuDAVhBlqXLgSNo0dpz4CIFSIQocQOot8hZRdUNtKgFfjydJS0EcuCSRYmeZsTRv7Oc3AOdM-0IxLVxF7IFKo92IB5EbSN4WRAUI0pFt8cC6L_SuH_QrcLHaC2OMyclnpomX-Vq-nqoFTpW1WBuXnfgGbIQRK_Zqfe-B9EipOIl09jBasnY83nqOH3s9ZHH5TRuxuD2hTBpq66yFory2CjIjxdwaJy2qWqyFms4O9JYfWTBMhs1FJpvq85d-43__Yhe2S8zpXBaDZA8qZrIPW2tKhDVgPfE-GC_G7u1glr068ccIZRRnLqapzpUNeEM3HsyQszrJnPvrp9iJp9rMD-Clc_Mcd92ypIL1hcczV1i4oYWxgUvqHCumRHmMp36kfSJVaNMXYmRIGJeaEkmlhQOREKlG1Z5AaXII1cl0Yo7A8ahAtb_UNgstpqL2qTa90TIQlJJImTqES-smqtQbx7IXoyTPOzye5H5J0C9J4Zek8Esd2queb4Xmxj_61NDSq_alkevQ-OHQ1X0_sKkcoez4734nsInvKCg6p1DNZgtzZtFHJhv5sPsCAP3RjQ
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3JTsMwEB2VcgAO7Iiy5sCRlDS2k_gIYSnQAIcicYu8RVRAi0oqAV-PJ0lLQRy4JJFiZ5mxNG_s5zcAB4H2hQq0cBWxByqNdiPOIpdJ3hJEMQTpyLa4Cdr39OqBPdTgcLIXxhhTkM9MEy-LtXw9UCOcKjsKWrjsxGdgllFKWblb63sXpEcqzUkktIfRmLfj8aNufJskyOPymzZmcXtCoTRU15kKRkV1FeRGijdrnqysazEVbM6XIBl_ZskxeWqOctlUn78UHP_7H8uwWKFO57gcJitQM_1VWJjSIlyDIBHvvZfRi3vRG-aPTvzxjEKKQxcTVefEhrwnN-4NkbXaz53O6V3sxANt3tbh_vysG7fdqqiC9YbHc1dYwKGFsaFL6gItZkR5Ac_8SPtEqtAmMMTIkARcakoklRYQREJkGnV7mNJkA-r9Qd9sguNRgXp_mW0WWlRF7VNtgqMlE5SSSJkGhGPrpqpSHMfCF89pkXl4PC38kqJf0tIvaemXBrQmPV9L1Y1_9FlDS0_aV0ZuwN4Ph07u-8wmc4QGW3_324e5djfppJ3Lm-ttmMf3lYSdHajnw5HZtVgkl3vFEPwCKtrU2g
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=Maximum-Girth+Cylinder-Type+Block-Circulant+LDPC+Codes&rft.jtitle=IEEE+transactions+on+communications&rft.au=Gholami%2C+M.&rft.au=Esmaeili%2C+M.&rft.date=2012-04-01&rft.pub=IEEE&rft.issn=0090-6778&rft.volume=60&rft.issue=4&rft.spage=952&rft.epage=962&rft_id=info:doi/10.1109%2FTCOMM.2012.022912.100419&rft.externalDocID=6164079
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0090-6778&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0090-6778&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0090-6778&client=summon