Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/61417
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Electronic and Information Engineering | en_US |
dc.creator | Fang, Y | en_US |
dc.creator | Guan, YL | en_US |
dc.creator | Bi, G | en_US |
dc.creator | Wang, L | en_US |
dc.creator | Lau, FCM | en_US |
dc.date.accessioned | 2016-12-19T08:55:48Z | - |
dc.date.available | 2016-12-19T08:55:48Z | - |
dc.identifier.issn | 0018-9545 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/61417 | - |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
dc.rights | © 2015 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 Y. Fang, Y. L. Guan, G. Bi, L. Wang and F. C. M. Lau, "Rate-Compatible Root-Protograph LDPC Codes for Quasi-Static Fading Relay Channels," in IEEE Transactions on Vehicular Technology, vol. 65, no. 4, pp. 2741-2747, April 2016 is available at https://dx.doi.org/10.1109/TVT.2015.2420570. | en_US |
dc.subject | Coded cooperation (CC) | en_US |
dc.subject | Extrinsic information transfer (EXIT) | en_US |
dc.subject | Outage probability | en_US |
dc.subject | Protograph LDPC codes | en_US |
dc.subject | Quasi-static fading (QSF) channels | en_US |
dc.title | Rate-compatible root-protograph LDPC codes for quasi-static fading relay channels | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 2741 | en_US |
dc.identifier.epage | 2747 | en_US |
dc.identifier.volume | 65 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.doi | 10.1109/TVT.2015.2420570 | en_US |
dcterms.abstract | We investigate the protograph low-density parity-check (LDPC) codes over quasi-static fading (QSF) relay channels with coded cooperation (CC) in this paper. A new construction method is proposed for designing the full-diversity rate-compatible root-protograph (RCRP) codes for such a relaying protocol. The asymptotic word error rate (WER) and bit error rate (BER) of the RCRP codes are analyzed by exploiting a new protograph extrinsic information transfer (PEXIT) algorithm. Furthermore, the expression of outage probability is also developed to characterize the error performance of RCRP codes. Both theoretical and simulated results suggest that the RCRP codes not only outperform the conventional regular rate-compatible protograph (RCP) codes in terms of error performance with code rates ranging from 0 to 1/2 but approach the outage limit as well. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | IEEE transactions on vehicular technology, Apr. 2016, v. 65, no. 4, 7080854, p. 2741-2747 | en_US |
dcterms.isPartOf | IEEE transactions on vehicular technology | en_US |
dcterms.issued | 2016-04 | - |
dc.identifier.isi | WOS:000375031500071 | - |
dc.identifier.scopus | 2-s2.0-84964821395 | - |
dc.identifier.eissn | 1939-9359 | en_US |
dc.identifier.rosgroupid | 2015002198 | - |
dc.description.ros | 2015-2016 > Academic research: refereed > Publication in refereed journal | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | a0721-n15 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.fundingText | RGC: 519011E | en_US |
dc.description.pubStatus | Published | en_US |
dc.description.oaCategory | Green (AAM) | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
a0721-n15_2016_TVT.pdf | Pre-Published version | 189.65 kB | Adobe PDF | View/Open |
Page views
152
Last Week
0
0
Last month
Citations as of Apr 14, 2025
Downloads
74
Citations as of Apr 14, 2025
SCOPUSTM
Citations
29
Last Week
1
1
Last month
Citations as of May 8, 2025
WEB OF SCIENCETM
Citations
27
Last Week
1
1
Last month
Citations as of May 8, 2025

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