Low Complexity Decoding Algorithms for Rate Compatible Modulation

Rate compatible modulation (RCM) has high spectrum efficiency and achieves seamless and blind rate adaptation in wide range of channel conditions. However, due to many convolution operations at symbol nodes, the belief propagation decoding algorithm of RCM has a high level of computational complexit...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE access Jg. 6; S. 31417 - 31429
Hauptverfasser:	Lu, Fang, Dong, Yan, Rao, Wengui, Chen, Chang Wen
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Approximation algorithms belief propagation Codes Complexity Complexity theory Computation Convolution Decoding Domains Jacobian logarithm Jacobian matrices log likelihood ratio Logarithms Modulation Nodes Parity check codes rate adaptation Rate compatible modulation
ISSN:	2169-3536, 2169-3536
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	Rate compatible modulation (RCM) has high spectrum efficiency and achieves seamless and blind rate adaptation in wide range of channel conditions. However, due to many convolution operations at symbol nodes, the belief propagation decoding algorithm of RCM has a high level of computational complexity. In this paper, we investigate the low complexity algorithms for fast decoding of RCM. Instead of computing the outgoing messages at symbol nodes via multi-level convolutions, we first design a novel two-level computing structure (2L-RCM) for symbol nodes in the probability-domain, each level is composed of one set of multiplications followed by one set of additions. Based on 2L-RCM, we derive Log-2L-RCM decoding algorithm in the log-domain, which converts the multiplications and additions of 2L-RCM into additions and Jacobian logarithms, respectively. Furthermore, we propose some approximate algorithms to reduce the complexity of Jacobian logarithms. In particular, the improved Max-Log-RCM (IMax-Log-RCM) algorithm obtains good performance-complexity trade-off. The simulation results and the numerical analyses show that IMax-Log-RCM achieves only 0.3-dB worse decoding performance than the original decoding algorithm with much fewer additions.
AbstractList	Rate compatible modulation (RCM) has high spectrum efficiency and achieves seamless and blind rate adaptation in wide range of channel conditions. However, due to many convolution operations at symbol nodes, the belief propagation decoding algorithm of RCM has a high level of computational complexity. In this paper, we investigate the low complexity algorithms for fast decoding of RCM. Instead of computing the outgoing messages at symbol nodes via multi-level convolutions, we first design a novel two-level computing structure (2L-RCM) for symbol nodes in the probability-domain, each level is composed of one set of multiplications followed by one set of additions. Based on 2L-RCM, we derive Log-2L-RCM decoding algorithm in the log-domain, which converts the multiplications and additions of 2L-RCM into additions and Jacobian logarithms, respectively. Furthermore, we propose some approximate algorithms to reduce the complexity of Jacobian logarithms. In particular, the improved Max-Log-RCM (IMax-Log-RCM) algorithm obtains good performance-complexity trade-off. The simulation results and the numerical analyses show that IMax-Log-RCM achieves only 0.3-dB worse decoding performance than the original decoding algorithm with much fewer additions.
Author	Chen, Chang Wen Dong, Yan Lu, Fang Rao, Wengui
Author_xml	– sequence: 1 givenname: Fang orcidid: 0000-0002-9491-4895 surname: Lu fullname: Lu, Fang organization: School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, China – sequence: 2 givenname: Yan surname: Dong fullname: Dong, Yan email: dongyan@mail.hust.edu.cn organization: School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, China – sequence: 3 givenname: Wengui orcidid: 0000-0002-7846-6682 surname: Rao fullname: Rao, Wengui organization: School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, China – sequence: 4 givenname: Chang Wen surname: Chen fullname: Chen, Chang Wen organization: School of Science and Engineering, The Chinese University of Hong Kong at Shenzhen, Shenzhen, China
BookMark	eNqFkE9rGzEQxUVJoWmaT5DLQs929WclS0ezSduAS6Bpz2KkHbky65WrlWnz7at4Qwi9ZC4zDO-9GX7vydmYRiTkitElY9R8Wnfdzf39klOml1y3nBr5hpxzpsxCSKHOXszvyOU07WgtXVdydU7Wm_Sn6dL-MODfWB6aa_Spj-O2WQ_blGP5tZ-akHLzHQqedFCiG7D5lvrjUOc0fiBvAwwTXj71C_Lz882P7utic_fltltvFr6luiwkwkozDgoddZobWIFjFEH0noMA0_pegeFKM5Ct6FFq8FRJYYIS3IQgLsjtnNsn2NlDjnvIDzZBtKdFylsLuUQ_oF1p5VAy56UIra5AnHAB24BaqOAYr1kf56xDTr-POBW7S8c81vctb6XUxigmqkrMKp_TNGUMz1cZtY_o7YzePqK3T-iry_zn8rGcSJUMcXjFezV7IyI-X6tfGyqF-AeE95Lw
CODEN	IAECCG
CitedBy_id	crossref_primary_10_1109_ACCESS_2020_3043529 crossref_primary_10_1109_TVT_2021_3118792 crossref_primary_10_1109_ACCESS_2019_2910935 crossref_primary_10_1109_TCSI_2019_2906774 crossref_primary_10_3390_electronics8030307 crossref_primary_10_1109_TVT_2022_3175540
Cites_doi	10.1145/2018436.2018455 10.1109/MECO.2014.6862657 10.1109/TWC.2013.090413.121308 10.1109/TIT.2006.880031 10.1109/TIT.1981.1056404 10.1049/el:19981120 10.1109/LCOMM.2013.101813.131972 10.1109/VETEC.1996.503495 10.1109/TWC.2015.2460254 10.1145/2342356.2342363 10.1109/26.771341 10.1109/LCOMM.2017.2692762 10.1109/TIT.2006.874390 10.1109/TIT.2009.2016018 10.1109/TSP.2009.2027773 10.1109/ICC.1995.524253 10.1145/2068897.2068971 10.1109/18.748992 10.1109/LCOMM.2006.1603379 10.1109/JETCAS.2012.2220291 10.1109/TIT.2006.871582 10.1109/TSP.2008.2010379 10.1109/MWC.2015.7096290 10.1109/ACCESS.2018.2794625 10.1109/JSYST.2014.2363081 10.1109/GLOCOM.2014.7037412 10.1109/ICC.2004.1312606 10.1109/TIT.2009.2018224
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018
DBID	97E ESBDL RIA RIE AAYXX CITATION 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D DOA
DOI	10.1109/ACCESS.2018.2842095
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE Xplore Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts METADEX Technology Research Database Materials Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional DOAJ Open Access Full Text
DatabaseTitle	CrossRef Materials Research Database Engineered Materials Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace METADEX Computer and Information Systems Abstracts Professional
DatabaseTitleList	Materials Research Database
Database_xml	– sequence: 1 dbid: DOA name: DOAJ Open Access Full Text url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	2169-3536
EndPage	31429
ExternalDocumentID	oai_doaj_org_article_786be51bc53f48209b3bfe4fe836fb12 10_1109_ACCESS_2018_2842095 8369053
Genre	orig-research
GrantInformation_xml	– fundername: National Natural Science Foundation of China; NSFC grantid: 91538203 funderid: 10.13039/501100001809 – fundername: Fundamental Research Funds for the Central Universities grantid: HUST-2015QN78; HUST-2015MS046 funderid: 10.13039/501100012226
GroupedDBID	0R~ 4.4 5VS 6IK 97E AAJGR ABAZT ABVLG ACGFS ADBBV AGSQL ALMA_UNASSIGNED_HOLDINGS BCNDV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD ESBDL GROUPED_DOAJ IPLJI JAVBF KQ8 M43 M~E O9- OCL OK1 RIA RIE RNS AAYXX CITATION 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D RIG
ID	FETCH-LOGICAL-c408t-5ea7812a6eb0b829a7ab10ea3dc2a3a94cd6a92681a543de58ac06539f6329ff3
IEDL.DBID	RIE
ISICitedReferencesCount	11
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000437273200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	2169-3536
IngestDate	Fri Oct 03 12:51:16 EDT 2025 Mon Jun 30 04:29:10 EDT 2025 Tue Nov 18 21:44:59 EST 2025 Sat Nov 29 03:33:12 EST 2025 Wed Aug 27 08:34:59 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/OAPA.html
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c408t-5ea7812a6eb0b829a7ab10ea3dc2a3a94cd6a92681a543de58ac06539f6329ff3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-9491-4895 0000-0002-7846-6682
OpenAccessLink	https://ieeexplore.ieee.org/document/8369053
PQID	2455899613
PQPubID	4845423
PageCount	13
ParticipantIDs	proquest_journals_2455899613 doaj_primary_oai_doaj_org_article_786be51bc53f48209b3bfe4fe836fb12 crossref_primary_10_1109_ACCESS_2018_2842095 crossref_citationtrail_10_1109_ACCESS_2018_2842095 ieee_primary_8369053
PublicationCentury	2000
PublicationDate	20180000 2018-00-00 20180101 2018-01-01
PublicationDateYYYYMMDD	2018-01-01
PublicationDate_xml	– year: 2018 text: 20180000
PublicationDecade	2010
PublicationPlace	Piscataway
PublicationPlace_xml	– name: Piscataway
PublicationTitle	IEEE access
PublicationTitleAbbrev	Access
PublicationYear	2018
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref13 hu (ref30) 2001 ref12 ref15 ref14 ref31 ref11 ref32 ref10 ref2 ref1 ref16 ref18 sarvotham (ref24) 2010; 58 rao (ref17) 2013 ref23 ref26 ref25 ref20 ref22 ref21 cheng (ref29) 2000 ref28 wiberg (ref33) 1996 ref27 ref8 ref7 ref9 ref4 ref3 ref6 candes (ref19) 2006 ref5
References_xml	– ident: ref5 doi: 10.1145/2018436.2018455 – ident: ref25 doi: 10.1109/MECO.2014.6862657 – start-page: 1433 year: 2006 ident: ref19 article-title: Compressive sampling publication-title: Proc Int Congr Math – start-page: 1036 year: 2001 ident: ref30 article-title: Efficient implementations of the sum-product algorithm for decoding LDPC codes publication-title: Proc IEEE Globecom – start-page: 2252 year: 2000 ident: ref29 article-title: Linearly approximated log-MAP algorithms for turbo decoding publication-title: Proc 51st IEEE Veh Technol Conf – ident: ref8 doi: 10.1109/TWC.2013.090413.121308 – ident: ref21 doi: 10.1109/TIT.2006.880031 – ident: ref32 doi: 10.1109/TIT.1981.1056404 – ident: ref27 doi: 10.1049/el:19981120 – ident: ref7 doi: 10.1109/LCOMM.2013.101813.131972 – ident: ref1 doi: 10.1109/VETEC.1996.503495 – ident: ref11 doi: 10.1109/TWC.2015.2460254 – ident: ref6 doi: 10.1145/2342356.2342363 – ident: ref2 doi: 10.1109/26.771341 – ident: ref16 doi: 10.1109/LCOMM.2017.2692762 – ident: ref4 doi: 10.1109/TIT.2006.874390 – ident: ref22 doi: 10.1109/TIT.2009.2016018 – volume: 58 start-page: 269 year: 2010 ident: ref24 article-title: Bayesian compressive sensing via belief propagation publication-title: IEEE Trans Signal Process doi: 10.1109/TSP.2009.2027773 – start-page: 1938 year: 2013 ident: ref17 article-title: Log-likelihood ratio algorithm for rate compatible modulation publication-title: Proc ISCAS – ident: ref26 doi: 10.1109/ICC.1995.524253 – ident: ref9 doi: 10.1145/2068897.2068971 – ident: ref15 doi: 10.1109/18.748992 – ident: ref28 doi: 10.1109/LCOMM.2006.1603379 – ident: ref18 doi: 10.1109/JETCAS.2012.2220291 – ident: ref20 doi: 10.1109/TIT.2006.871582 – ident: ref23 doi: 10.1109/TSP.2008.2010379 – ident: ref10 doi: 10.1109/MWC.2015.7096290 – ident: ref14 doi: 10.1109/ACCESS.2018.2794625 – ident: ref12 doi: 10.1109/JSYST.2014.2363081 – ident: ref13 doi: 10.1109/GLOCOM.2014.7037412 – year: 1996 ident: ref33 article-title: Codes and decoding on general graphs – ident: ref31 doi: 10.1109/ICC.2004.1312606 – ident: ref3 doi: 10.1109/TIT.2009.2018224
SSID	ssj0000816957
Score	2.1646218
Snippet	Rate compatible modulation (RCM) has high spectrum efficiency and achieves seamless and blind rate adaptation in wide range of channel conditions. However, due...
SourceID	doaj proquest crossref ieee
SourceType	Open Website Aggregation Database Enrichment Source Index Database Publisher
StartPage	31417
SubjectTerms	Algorithms Approximation algorithms belief propagation Codes Complexity Complexity theory Computation Convolution Decoding Domains Jacobian logarithm Jacobian matrices log likelihood ratio Logarithms Modulation Nodes Parity check codes rate adaptation Rate compatible modulation
SummonAdditionalLinks	– databaseName: DOAJ Open Access Full Text dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PS8MwFA4yPOhB1ClOp_Tg0bo2aX4d53R40CGisFtI0lSFuck2Ff97X9I4JoJevIY0bb_XvPe-Er4PoeNSyIoSx1OpNU4LoNep5Jan0IvTnGemFK42m-CDgRgO5c2S1Zc_E1bLA9fAdbhgxtHcWEqqAsqVNMRUrqicIKwywV8YZ1wukamQg0XOJOVRZijPZKfb68Eb-bNc4hRSMixEv5WioNgfLVZ-5OVQbPqbaCN2iUm3frottOLG22h9STuwibpXk_fE72avaDn_SM6BR_o6lHRHDxNg_I_PswQa0uQWmskwD0JgRi65npTRsWsH3fcv7nqXafRDSG2RiXlKneZQjzVzJjMCS821yTOnSWmxJloWtmRaYiZyTQtSOiq0DdKzFSNYVhXZRY3xZOz2UGK5dARgYMxkhQZWQWAJIXSOcwMkxbQQ_oJG2SgW7j0rRiqQhkyqGk_l8VQRzxY6WVz0Umtl_D79zGO-mOqFrsMAhF_F8Ku_wt9CTR-xxSIwLCGvtFD7K4IqbsqZwgWlQC-hgdn_j1sfoDX_OvX_mDZqzKev7hCt2rf502x6FL7HT2Hj4CU priority: 102 providerName: Directory of Open Access Journals
Title	Low Complexity Decoding Algorithms for Rate Compatible Modulation
URI	https://ieeexplore.ieee.org/document/8369053 https://www.proquest.com/docview/2455899613 https://doaj.org/article/786be51bc53f48209b3bfe4fe836fb12
Volume	6
WOSCitedRecordID	wos000437273200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAON databaseName: DOAJ Open Access Full Text customDbUrl: eissn: 2169-3536 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000816957 issn: 2169-3536 databaseCode: DOA dateStart: 20130101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2169-3536 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000816957 issn: 2169-3536 databaseCode: M~E dateStart: 20130101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3BTtwwEB0B4tAeaIFW3RZQDhwJJHYc28dlAfVQEKqKxM2ynUmLtN2g3dCql357x46JkIoq9RJFkW05M7FnnmO_B3DYKN0KjjLX1rK8Inida-llTrm4KGXhGoWD2IS8ulK3t_p6DY7GszCIGDef4XG4jf_ym84_hKWyE8UJywm-DutS1sNZrXE9JQhIaCETsVBZ6JPpbEbvEHZvqWOahFkRNCSeBJ_I0Z9EVf6aiWN4uXj1fx17DVspjcymg9-3YQ0XO_DyCbngLkw_dT-zMNwD5WX_KzsjoBkCVTadf-2Wd_2376uMMtbsM2WbsRz5yM0xu-yaJOn1Bm4uzr_MPuZJMCH3VaH6XKCVFLBtja5wimkrrSsLtLzxzHKrK9_UVrNalVZUvEGhrI_ctG3NmW5b_hY2Ft0C30HmpUZOVqtrV1SWYAenJpSyJSsdoRg3AfZoSeMTm3gQtZibiCoKbQbzm2B-k8w_gaOx0v1ApvHv4qfBRWPRwIQdH5DtTRpYRqraoSidF7ytKJ3RjrsWqxbJJ60r2QR2g7_GRpKrJrD36HCTRu3KsEoIwp-U4bx_vtYHeBE6OCzB7MFGv3zAfdj0P_q71fIg4nm6Xv4-P4gf5x90Sd7f
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nb9QwEB2VggQc-GoRWwrkwLFpEzuO7eOyUBWxXSFUpN4s25lApe0G7aYg_n3HjhtVAiFxiyLbcmZizzx_vAfwtlG6FRxlrq1leUXwOtfSy5xycVHKwjUKB7EJuVio83P9eQsOxrswiBgPn-FheIx7-U3nr8JS2ZHihOUEvwN3g3JWuq01rqgECQktZKIWKgt9NJ3N6CvC-S11SNMwK4KKxK3wE1n6k6zKH3NxDDDHj_-va0_gUUoks-ng-aewhatn8PAWveAOTOfdrywM-EB62f_O3hPUDKEqmy6_deuL_vvlJqOcNftC-WYsR15yS8xOuyaJeu3C1-MPZ7OTPEkm5L4qVJ8LtJJCtq3RFU4xbaV1ZYGWN55ZbnXlm9pqVqvSioo3KJT1kZ22rTnTbcufw_aqW-ELyLzUyMlqde2KyhLw4NSEUrZkpSMc4ybAbixpfOITD7IWSxNxRaHNYH4TzG-S-SdwMFb6MdBp_Lv4u-CisWjgwo4vyPYmDS0jVe1QlM4L3laU0GjHXYtVi-ST1pVsAjvBX2MjyVUT2L9xuEnjdmNYJQQhUMpx9v5e6w3cPzk7nZv5x8Wnl_AgdHZYkNmH7X59ha_gnv_ZX2zWr-PPeQ21p-AC
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Low+Complexity+Decoding+Algorithms+for+Rate+Compatible+Modulation&rft.jtitle=IEEE+access&rft.au=Lu%2C+Fang&rft.au=Dong%2C+Yan&rft.au=Rao%2C+Wengui&rft.au=Chen%2C+Chang+Wen&rft.date=2018&rft.pub=IEEE&rft.eissn=2169-3536&rft.volume=6&rft.spage=31417&rft.epage=31429&rft_id=info:doi/10.1109%2FACCESS.2018.2842095&rft.externalDocID=8369053
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2169-3536&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2169-3536&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2169-3536&client=summon