Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/90072
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electronic and Information Engineeringen_US
dc.creatorXu, Zen_US
dc.creatorWang, Len_US
dc.creatorHong, Sen_US
dc.creatorLau, FCMen_US
dc.creatorSham, CWen_US
dc.date.accessioned2021-05-18T08:20:41Z-
dc.date.available2021-05-18T08:20:41Z-
dc.identifier.issn2162-2337en_US
dc.identifier.urihttp://hdl.handle.net/10397/90072-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2019 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.rightsThe following publication Z. Xu, L. Wang, S. Hong, F. C. M. Lau and C. Sham, "Joint Shuffled Scheduling Decoding Algorithm for DP-LDPC Codes-Based JSCC Systems," in IEEE Wireless Communications Letters, vol. 8, no. 6, pp. 1696-1699, Dec. 2019 is available at https://dx.doi.org/10.1109/LWC.2019.2937766en_US
dc.subjectBelief propagationen_US
dc.subjectDP-LDPC codesen_US
dc.subjectJSCCen_US
dc.subjectShuffled schedulingen_US
dc.titleJoint shuffled scheduling decoding algorithm for DP-LDPC codes-based JSCC systemsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage1696en_US
dc.identifier.epage1699en_US
dc.identifier.volume8en_US
dc.identifier.issue6en_US
dc.identifier.doi10.1109/LWC.2019.2937766en_US
dcterms.abstractIn this letter, a joint shuffled scheduling decoding algorithm for double-protograph low-density parity-check (DP-LDPC) codes-based joint source-channel coding (JSCC) schemes is presented. The proposed algorithm adopts the shuffled scheduling method to both source decoder and channel decoder, and can improve convergence speed and reduce the decoding complexity. In addition, a unique phenomenon named unequal convergence rates is revealed at the same time. The proposed algorithm can terminate this phenomenon with faster decoding. The results show that this algorithm has faster convergence speed and better error performance, compared with the traditional joint belief propagation (BP) decoding algorithm.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIEEE wireless communications letters, Dec. 2019, v. 8, no. 6, 8815836, p. 1696-1699en_US
dcterms.isPartOfIEEE wireless communications lettersen_US
dcterms.issued2019-12-
dc.identifier.scopus2-s2.0-85076575180-
dc.identifier.eissn2162-2345en_US
dc.identifier.artn8815836en_US
dc.description.validate202105 bchyen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera0721-n04-
dc.description.fundingSourceRGCen_US
dc.description.fundingTextRGC: 15217018Een_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
a0721-n04_2019_WCL.pdfPre-Published version210.45 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

98
Last Week
2
Last month
Citations as of Apr 14, 2025

Downloads

60
Citations as of Apr 14, 2025

SCOPUSTM   
Citations

16
Citations as of Sep 12, 2025

WEB OF SCIENCETM
Citations

11
Citations as of Oct 10, 2024

Google ScholarTM

Check

Altmetric


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