Shuffled Multiuser Detection Schemes for Uplink Sparse Code Multiple Access Systems

The existing multiuser detection schemes for uplink (UP) sparse code multiple access (SCMA) systems are based on a parallel message update for message passing algorithm (MPA). In this letter, a shuffled MPA (S-MPA) scheme for UP SCMA systems is proposed, based on a serial message update strategy. Si...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE communications letters Vol. 20; no. 6; pp. 1231 - 1234
Main Authors:	Du, Yang, Dong, Binhong, Chen, Zhi, Fang, Jun, Yang, Lin
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.06.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	5G mobile communication Acceleration Bit error rate Computational complexity Computer simulation Convergence Delay group shuffled message passing algorithm (G-S-MPA) Message passing message passing algorithm (MPA) Messages Multiple access Multiuser detection Serials shuffled strategy Sparse code multiple access (SCMA) Strategy Uplink group shuffled message passing algorithm (G-S-MPA) multiuser detection shuffled strategy message passing algorithm (MPA) Sparse code multiple access (SCMA)
ISSN:	1089-7798, 1558-2558
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	The existing multiuser detection schemes for uplink (UP) sparse code multiple access (SCMA) systems are based on a parallel message update for message passing algorithm (MPA). In this letter, a shuffled MPA (S-MPA) scheme for UP SCMA systems is proposed, based on a serial message update strategy. Since the updated messages can join the message propagation immediately in current iteration, the convergence rate is accelerated, so that the complexity of the proposed S-MPA scheme can be substantially reduced with negligible bit error rate (BER) degradation. Simulations show that the proposed S-MPA scheme with two iterations provides similar BER performance to the original MPA scheme with six iterations. Furthermore, a parallel form of the proposed S-MPA scheme, termed group S-MPA, is developed to decrease the detection delay of the proposed S-MPA scheme, which offers a good BER-latency tradeoff.
AbstractList	The existing multiuser detection schemes for uplink (UP) sparse code multiple access (SCMA) systems are based on a parallel message update for message passing algorithm (MPA). In this letter, a shuffled MPA (S-MPA) scheme for UP SCMA systems is proposed, based on a serial message update strategy. Since the updated messages can join the message propagation immediately in current iteration, the convergence rate is accelerated, so that the complexity of the proposed S-MPA scheme can be substantially reduced with negligible bit error rate (BER) degradation. Simulations show that the proposed S-MPA scheme with two iterations provides similar BER performance to the original MPA scheme with six iterations. Furthermore, a parallel form of the proposed S-MPA scheme, termed group S-MPA, is developed to decrease the detection delay of the proposed S-MPA scheme, which offers a good BER-latency tradeoff.
Author	Jun Fang Binhong Dong Lin Yang Zhi Chen Yang Du
Author_xml	– sequence: 1 givenname: Yang surname: Du fullname: Du, Yang – sequence: 2 givenname: Binhong surname: Dong fullname: Dong, Binhong – sequence: 3 givenname: Zhi surname: Chen fullname: Chen, Zhi – sequence: 4 givenname: Jun surname: Fang fullname: Fang, Jun – sequence: 5 givenname: Lin surname: Yang fullname: Yang, Lin
BookMark	eNp9kD1vwjAQhq2KSgXaP9Aulrp0CbUdO7ZHRD8lEEPKbBlzFqEhSe1k4N83FNShQ6fzye_jOz8jNKjqChC6pWRCKdGP89lysZgwQrMJE4JKzi7QkAqhkr5Vg_5MlE6k1OoKjWLcEUIUE3SI8nzbeV_CBi-6si26CAE_QQuuLeoK524Le4jY1wGvmrKoPnHe2BABz-oNnJCmBDx1DmLE-SG2sI_X6NLbMsLNuY7R6uX5Y_aWzJev77PpPHEpU23CtefebqyUhDu-XkvhtRPCZ5l1kq81s14yp5h0QqX9DQiSqbXIqHDMMmbTMXo4vduE-quD2Jp9ER2Upa2g7qKh_Re5TpXWffT-T3RXd6HqtzNUaqFTqqnsU-yUcqGOMYA3TSj2NhwMJebo2fx4NkfP5uy5h9QfyBWtPeprgy3K_9G7E1oAwO8syblSUqfftkyMuw
CODEN	ICLEF6
CitedBy_id	crossref_primary_10_1109_TVT_2018_2876121 crossref_primary_10_1109_TVT_2019_2918748 crossref_primary_10_1109_ACCESS_2018_2872723 crossref_primary_10_1109_TCSI_2021_3084634 crossref_primary_10_1109_ACCESS_2021_3104509 crossref_primary_10_1109_LCOMM_2017_2779859 crossref_primary_10_1109_TVT_2018_2849621 crossref_primary_10_1109_TVT_2021_3106001 crossref_primary_10_3390_electronics8111355 crossref_primary_10_1109_JSAC_2017_2726279 crossref_primary_10_1109_LCOMM_2016_2592912 crossref_primary_10_1049_iet_com_2017_0774 crossref_primary_10_3390_electronics11010125 crossref_primary_10_1109_LWC_2017_2775627 crossref_primary_10_1049_cmu2_12303 crossref_primary_10_1109_TWC_2022_3186973 crossref_primary_10_1109_TVT_2019_2891771 crossref_primary_10_1109_TVT_2017_2664894 crossref_primary_10_1109_TVT_2020_2966333 crossref_primary_10_1088_1757_899X_790_1_012013 crossref_primary_10_1109_ACCESS_2019_2891597 crossref_primary_10_1109_LWC_2019_2916400 crossref_primary_10_1007_s11036_020_01627_y crossref_primary_10_1109_LSP_2017_2653845 crossref_primary_10_1049_iet_com_2018_5378 crossref_primary_10_1109_LWC_2016_2565581 crossref_primary_10_1049_iet_com_2017_0420 crossref_primary_10_1109_TWC_2018_2816929 crossref_primary_10_1109_LCOMM_2017_2697425 crossref_primary_10_1109_TWC_2018_2813378 crossref_primary_10_1049_iet_com_2020_0517 crossref_primary_10_3390_e25111514 crossref_primary_10_1109_ACCESS_2019_2950901 crossref_primary_10_3390_electronics11071020 crossref_primary_10_1109_COMST_2018_2835558 crossref_primary_10_1109_TVT_2020_2969020 crossref_primary_10_1109_LWC_2016_2623785 crossref_primary_10_1109_TVT_2020_3012516 crossref_primary_10_1007_s11432_019_2908_x crossref_primary_10_1049_el_2018_0125 crossref_primary_10_1109_ACCESS_2022_3165582 crossref_primary_10_1109_COMST_2019_2910569 crossref_primary_10_1016_S1005_8885_17_60182_1 crossref_primary_10_1109_ACCESS_2023_3258451 crossref_primary_10_3390_s20071960 crossref_primary_10_1109_JSTSP_2019_2907476 crossref_primary_10_1109_LCOMM_2017_2752745 crossref_primary_10_1155_2022_6855947 crossref_primary_10_3390_s25103098 crossref_primary_10_1155_2020_8845371 crossref_primary_10_1109_LWC_2017_2717407 crossref_primary_10_1109_TCOMM_2018_2843354 crossref_primary_10_1109_TVT_2021_3099640
Cites_doi	10.1109/LWC.2015.2469668 10.1109/GLOCOM.2009.5425243 10.1109/PIMRC.2013.6666156 10.1109/JSAC.2014.2328098 10.1109/ICC.2015.7248770 10.1109/GLOCOM.2014.7037563 10.1109/18.910572 10.1109/MCOM.2015.7263349 10.1109/TSP.2007.909320 10.1109/VTCFall.2014.6966170
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
DBID	97E RIA RIE AAYXX CITATION 7SP 8FD L7M F28 FR3
DOI	10.1109/LCOMM.2016.2551742
DatabaseName	IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Engineering Research Database
DatabaseTitle	CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts Engineering Research Database ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList	Technology Research Database Engineering Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1558-2558
EndPage	1234
ExternalDocumentID	4086964601 10_1109_LCOMM_2016_2551742 7448879
Genre	orig-research
GrantInformation_xml	– fundername: Huawei HIRP project grantid: YB2015040056 – fundername: Sichuan Youth Science and Technology Fund grantid: 2012JQ0020
GroupedDBID	-~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV AZLTO BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IES IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS TN5 VH1 AAYXX CITATION 7SP 8FD L7M RIG F28 FR3
ID	FETCH-LOGICAL-c328t-49f4fada7704c4bb75f9c55f66ac74b92af72c827c5839c5e5068b5615c2a22a3
IEDL.DBID	RIE
ISICitedReferencesCount	72
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000383741400044&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1089-7798
IngestDate	Sun Sep 28 09:26:25 EDT 2025 Mon Jun 30 10:21:02 EDT 2025 Tue Nov 18 22:12:14 EST 2025 Sat Nov 29 06:26:36 EST 2025 Wed Aug 27 02:48:15 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	6
Keywords	group shuffled message passing algorithm (G-S-MPA) multiuser detection shuffled strategy message passing algorithm (MPA) Sparse code multiple access (SCMA)
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c328t-49f4fada7704c4bb75f9c55f66ac74b92af72c827c5839c5e5068b5615c2a22a3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
PQID	1795931917
PQPubID	85419
PageCount	4
ParticipantIDs	crossref_primary_10_1109_LCOMM_2016_2551742 proquest_miscellaneous_1825493899 ieee_primary_7448879 proquest_journals_1795931917 crossref_citationtrail_10_1109_LCOMM_2016_2551742
PublicationCentury	2000
PublicationDate	2016-June 2016-6-00 20160601
PublicationDateYYYYMMDD	2016-06-01
PublicationDate_xml	– month: 06 year: 2016 text: 2016-June
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE communications letters
PublicationTitleAbbrev	COML
PublicationYear	2016
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	ref8 ref7 ref9 ref4 ref3 ref6 ref10 ref5 ref2 ref1
References_xml	– ident: ref10 doi: 10.1109/LWC.2015.2469668 – ident: ref4 doi: 10.1109/GLOCOM.2009.5425243 – ident: ref5 doi: 10.1109/PIMRC.2013.6666156 – ident: ref1 doi: 10.1109/JSAC.2014.2328098 – ident: ref8 doi: 10.1109/ICC.2015.7248770 – ident: ref6 doi: 10.1109/GLOCOM.2014.7037563 – ident: ref9 doi: 10.1109/18.910572 – ident: ref2 doi: 10.1109/MCOM.2015.7263349 – ident: ref3 doi: 10.1109/TSP.2007.909320 – ident: ref7 doi: 10.1109/VTCFall.2014.6966170
SSID	ssj0008251
Score	2.4536295
Snippet	The existing multiuser detection schemes for uplink (UP) sparse code multiple access (SCMA) systems are based on a parallel message update for message passing...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	1231
SubjectTerms	5G mobile communication Acceleration Bit error rate Computational complexity Computer simulation Convergence Delay group shuffled message passing algorithm (G-S-MPA) Message passing message passing algorithm (MPA) Messages Multiple access Multiuser detection Serials shuffled strategy Sparse code multiple access (SCMA) Strategy Uplink
Title	Shuffled Multiuser Detection Schemes for Uplink Sparse Code Multiple Access Systems
URI	https://ieeexplore.ieee.org/document/7448879 https://www.proquest.com/docview/1795931917 https://www.proquest.com/docview/1825493899
Volume	20
WOSCitedRecordID	wos000383741400044&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: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-2558 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008251 issn: 1089-7798 databaseCode: RIE dateStart: 19970101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED9UfNAHv8XplAi-abVLkyZ5HFPxwS-Ygm8lTRMUZzfc5t9vLu2Kogi-FXppy12T-11ydz-AoyR2zrjYRUg7EDHvA6Oc4k4ck6xghYcMUgeyCXF7K5-e1P0cnDS1MNbakHxmT_EynOUXQzPFrbIz4WMJKdQ8zAuRVrVazaqLJZhVMr3yiFHJWYFMrM6ue3c3N5jFlZ56AO0hOP3mhAKryo-lOPiXy9X_fdkarNQ4knQrw6_DnC03YPlLd8FN6Pefp84NbEFClS1uR5BzOwm5VyXpe2u92THxoJU8YlnuK-mPfJRrSW9Y2GrIaGBJNzAqkrqz-RY8Xl489K6imkMhMgmVk4gpx5wutBAxMyzPBXfKcO7SVBvBckW1E9RIKgz3UMlwy-NU5h5UcUM1pTrZhoVyWNodIEoY4cPWQskk97Ar9Ro33OFRHrday7wFnZlSM1M3GEeei0EWAo1YZcEQGRoiqw3RguNmzKhqr_Gn9CaqvpGstd6C9sx2WT0Dx1kHSdQTjEZbcNjc9nMHD0R0aYdTLxPCY-wwuPv7k_dgCd9fpYa1YWHyPrX7sGg-Ji_j94PwA34Cc03XDA
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fS-QwEB48FU4f1DsV1585uLe7ak2TJnmUVVHcXYVV8K2kaYLi2l3cXf9-M2m3KB4HvhU6KWGmSb6ZzMwH8DuJnTMudhHSDkTMn4FRTjESxyQrWOEhg9SBbEL0evL-Xt3Mwd-mFsZaG5LP7CE-hrv8YmimGCo7Et6XkEJ9gwXOGI2raq1m38UizCqdXnnMqOSsRCZWR532dbeLeVzpoYfQHoTTD8dQ4FX5tBmHE-Z89WtzW4OVGkmSk8r0P2DOlj9h-V1_wXXo9x-mzg1sQUKdLQYkyKmdhOyrkvS9vZ7tmHjYSu6wMPeJ9Efez7WkPSxsNWQ0sOQkcCqSurf5Btydn922L6KaRSEyCZWTiCnHnC60EDEzLM8Fd8pw7tJUG8FyRbUT1EgqDPdgyXDL41TmHlZxQzWlOtmE-XJY2i0gShjhHddCyST3wCv1Gjfc4WUet1rLvAXHM6Vmpm4xjkwXgyy4GrHKgiEyNERWG6IFf5oxo6rBxn-l11H1jWSt9RbszmyX1WtwnB0jjXqC_mgLfjWv_erBKxFd2uHUywQHGXsMbv_7ywfw_eK228k6l72rHVjCuVSJYrswP3mZ2j1YNK-Tx_HLfvgZ3wDKydpT
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=Shuffled+Multiuser+Detection+Schemes+for+Uplink+Sparse+Code+Multiple+Access+Systems&rft.jtitle=IEEE+communications+letters&rft.au=Du%2C+Yang&rft.au=Dong%2C+Binhong&rft.au=Chen%2C+Zhi&rft.au=Fang%2C+Jun&rft.date=2016-06-01&rft.issn=1089-7798&rft.volume=20&rft.issue=6&rft.spage=1231&rft.epage=1234&rft_id=info:doi/10.1109%2FLCOMM.2016.2551742&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_LCOMM_2016_2551742
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-7798&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-7798&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-7798&client=summon