Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/79962
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electronic and Information Engineering-
dc.creatorJiang, S-
dc.creatorLau, FCM-
dc.date.accessioned2018-12-21T07:14:03Z-
dc.date.available2018-12-21T07:14:03Z-
dc.identifier.issn2169-3536en_US
dc.identifier.urihttp://hdl.handle.net/10397/79962-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2018 IEEE. Translations and content mining are permitted for academic research only. Personal use is also permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.en_US
dc.rightsPosted with permission of the publisher.en_US
dc.rightsThe following publication Jiang, S., & Lau, F. C. M.(2018). An approach to evaluating the number of closed paths in an all-one base matrix. IEEE Access, 6, - is available at https://dx.doi.org/10.1109/ACCESS.2018.2819981en_US
dc.subjectAll-one base matrixen_US
dc.subjectClosed pathen_US
dc.subjectCyclesen_US
dc.subjectLow-density parity-check codeen_US
dc.titleAn approach to evaluating the number of closed paths in an all-one base matrixen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage22332-
dc.identifier.epage22340-
dc.identifier.volume6-
dc.identifier.doi10.1109/ACCESS.2018.2819981en_US
dcterms.abstractGiven an all-one base matrix of size M x N, a closed path of different lengths can be formed by starting at an arbitrary element and moving horizontally and vertically alternatively before terminating at the same "starting" element. When the closed-path length is small, say 4 or 6, the total number of combinations can be evaluated easily. When the length increases, the computation becomes non-trivial. In this paper, a novel method is proposed to evaluate the number of closed paths of different lengths in an all-one base matrix. Theoretical results up to closed paths of length 10 have been derived and are verified by the exhaustive search method. Based on the theoretical work, results for closed paths of length larger than 10 can be further derived. Note that each of such closed paths may give rise to one or more cycles in a low-density parity-check (LDPC) code when the LDPC code is constructed by replacing each "1" in the base matrix with a circulant permutation matrix or a random permutation matrix. Since LPDC codes with short cycles are known to give unsatisfactory error correction capability, the results in this paper can be used to estimate the amount of effort required to evaluate the number of potential cycles of an LDPC code or to optimize the code.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIEEE access, 2018, v. 6, p. 22332-22340-
dcterms.isPartOfIEEE access-
dcterms.issued2018-
dc.identifier.isiWOS:000431977800001-
dc.identifier.scopus2-s2.0-85044870374-
dc.identifier.rosgroupid2017003613-
dc.description.ros2017-2018 > Academic research: refereed > Publication in refereed journal-
dc.description.validate201812 bcrcen_US
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryPublisher permissionen_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Jiang_Evaluating_Number_Closed.pdf5.08 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

118
Last Week
4
Last month
Citations as of Jul 21, 2024

Downloads

113
Citations as of Jul 21, 2024

SCOPUSTM   
Citations

1
Citations as of Jul 19, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.