Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/79369
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Electronic and Information Engineering | en_US |
dc.creator | Jiang, S | en_US |
dc.creator | Lau, FCM | en_US |
dc.date.accessioned | 2018-11-26T09:31:08Z | - |
dc.date.available | 2018-11-26T09:31:08Z | - |
dc.identifier.isbn | 9791188428007 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/79369 | - |
dc.description | 20th IEEE International Conference on Advanced Communication Technology, ICACT 2018, Chuncheon, South Korea, 11-14 February 2018 | en_US |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
dc.rights | © IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | en_US |
dc.rights | The following publication S. Jiang and F. C. M. Lau, "An approach to evaluating the number of potential cycles in an all-one base matrix," 2018 20th International Conference on Advanced Communication Technology (ICACT), 2018, pp. 104-108 is available at https://dx.doi.org/10.23919/ICACT.2018.8323662. | en_US |
dc.subject | Base matrix | en_US |
dc.subject | LDPC codes | en_US |
dc.subject | Potential cycles | en_US |
dc.title | An approach to evaluating the number of potential cycles in an all-one base matrix | en_US |
dc.type | Conference Paper | en_US |
dc.identifier.spage | 104 | en_US |
dc.identifier.epage | 108 | en_US |
dc.identifier.volume | 2018-February | en_US |
dc.identifier.doi | 10.23919/ICACT.2018.8323662 | en_US |
dcterms.abstract | The 'Tree Method' is usually used to identify potential cycles in low-density parity-check codes. However, with the increasing demand of high girth codes, the method becomes hard to implement because of the exponential increase of both space complexity and time complexity. In this paper, a new method is introduced to evaluate potential cycles for all-one base matrix. The method applies to large cycle length and arbitrary size base matrix. The principle of potential cycle and potential cycle duplication are studied to support the new approach. Instead of doing low efficient exhaustive search, the approach gives the number of potential cycles without duplication directly. The results of cycle numbers are given, which are verified by the 'Tree Method'. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | 2018 20th International Conference on Advanced Communication Technology (ICACT), 11-14 Feb. 2018, p. 104-108 | en_US |
dcterms.issued | 2018 | - |
dc.identifier.scopus | 2-s2.0-85046728549 | - |
dc.relation.conference | IEEE International Conference on Advanced Communication Technology [ICACT] | en_US |
dc.identifier.rosgroupid | 2017004641 | - |
dc.description.ros | 2017-2018 > Academic research: refereed > Refereed conference paper | en_US |
dc.description.validate | 201811 bcma | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | a0721-n18 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.fundingText | RGC: 15208815E | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Conference Paper |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
a0721-n18_2018ICACT.pdf | Pre-Published version | 314.32 kB | Adobe PDF | View/Open |
Page views
108
Last Week
1
1
Last month
Citations as of Apr 14, 2024
Downloads
93
Citations as of Apr 14, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.