Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/78913
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Electronic and Information Engineering | en_US |
dc.creator | Jiang, S | en_US |
dc.creator | Mo, FL | en_US |
dc.creator | Lau, FCM | en_US |
dc.creator | Sham, CW | en_US |
dc.date.accessioned | 2018-10-26T01:21:38Z | - |
dc.date.available | 2018-10-26T01:21:38Z | - |
dc.identifier.issn | 1549-7747 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/78913 | - |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
dc.rights | © 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information. | en_US |
dc.rights | The following publication S. Jiang, F. Mo, F. C. M. Lau and C. Sham, "Tree-Permutation-Matrix Based LDPC Codes," in IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 65, no. 8, pp. 1019-1023, Aug. 2018 is available at https://dx.doi.org/10.1109/TCSII.2017.2785779 | en_US |
dc.subject | FPGA implementation | en_US |
dc.subject | Low-density parity-check code | en_US |
dc.subject | Tree-permutation matrix | en_US |
dc.title | Tree-permutation-matrix based LDPC codes | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 1019 | en_US |
dc.identifier.epage | 1023 | en_US |
dc.identifier.volume | 65 | en_US |
dc.identifier.issue | 8 | en_US |
dc.identifier.doi | 10.1109/TCSII.2017.2785779 | en_US |
dcterms.abstract | Low-density parity-check (LDPC) codes are normally categorized into random structure or regular structure. In this brief, we introduce a new type of LDPC codes which is of semi-regular style. The parity-check matrices of the new LDPC code type are composed of sub-matrices termed tree-permutation matrices (TPMs). These TPMs are "semi-regular" and are constructed in a systematic way. Using the 2 x 2 identity matrix and anti-diagonal matrix as an example, we illustrate how 2(M) x 2(M ) TPMs are formed. During the formation of the 2(M) x 2(M) TPMs, we further apply the hill-climbing algorithm to avoid short cycles. Finally, we construct a girth-8 TPM-LDPC code with a base matrix of size 4 x 24 and a girth-10 TPM-LDPC code with a base matrix of size 3 x 10. We implement the TPM-LDPC decoders on an FPGA and compare the simulation results and decoder complexity with other LDPC codes. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | IEEE transactions on circuits and systems. II, Express briefs, Aug. 2018, v. 65, no. 8, p. 1019-1023 | en_US |
dcterms.isPartOf | IEEE transactions on circuits and systems. II, Express briefs | en_US |
dcterms.issued | 2018-08 | - |
dc.identifier.isi | WOS:000440693200011 | - |
dc.identifier.eissn | 1558-3791 | en_US |
dc.description.validate | 201810 bcrc | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | a0721-n06 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.fundingText | RGC: 15208815E | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
a0721-n06_2018_TCAS2.pdf | Pre-Published version | 305.87 kB | Adobe PDF | View/Open |
Page views
124
Last Week
1
1
Last month
Citations as of Apr 14, 2024
Downloads
64
Citations as of Apr 14, 2024
SCOPUSTM
Citations
4
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
3
Last Week
0
0
Last month
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.