SCMA Joint Coding and Decoding Algorithm Based on Code Reliability

The wide application of the Internet of Things (IoT), large-scale satellite clusters and drone clusters requires multiple access capabilities for massive devices. In order to meet the high-capacity and low-latency access requirements in application scenarios such as the IoT, this paper proposes to a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mobile networks and applications Ročník 28; číslo 1; s. 285 - 295
Hlavní autoři: Zhao, Hongwei, Wang, Huanzhu, Yan, Yue
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.02.2023
Springer Nature B.V
Témata:
ISSN:1383-469X, 1572-8153
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract The wide application of the Internet of Things (IoT), large-scale satellite clusters and drone clusters requires multiple access capabilities for massive devices. In order to meet the high-capacity and low-latency access requirements in application scenarios such as the IoT, this paper proposes to apply sparse code multiple access (SCMA) technology to the massive terminal access of the IoT, focusing on the study of SCMA decoding algorithm. Aiming at the high complexity of its traditional decoding algorithm, a decoding algorithm based on codeword reliability is proposed. The algorithm reduces the number of codeword iterations with higher reliability by setting a threshold to reduce the algorithm complexity. The simulation results show that the algorithm reduces the complexity of the algorithm while the loss of bit error rate performance is very small. Then, aiming at the poor bit error rate performance of SCMA technology under the condition of low signal-to-noise ratio, a joint coding and decoding simulation link based on soft input and soft output Turbo code and SCMA technology is proposed. The simulation results prove that Turbo codes can speed up the convergence speed of the decoding algorithm. When the SNR is 4 dB, the bit error rate of the joint system has been reduced to below 10e-3, which has obvious advantages compared with the SCMA system without Turbo coding. Therefore, the two methods proposed in this paper can be used for the high-capacity demand of the IoT communication system.
AbstractList The wide application of the Internet of Things (IoT), large-scale satellite clusters and drone clusters requires multiple access capabilities for massive devices. In order to meet the high-capacity and low-latency access requirements in application scenarios such as the IoT, this paper proposes to apply sparse code multiple access (SCMA) technology to the massive terminal access of the IoT, focusing on the study of SCMA decoding algorithm. Aiming at the high complexity of its traditional decoding algorithm, a decoding algorithm based on codeword reliability is proposed. The algorithm reduces the number of codeword iterations with higher reliability by setting a threshold to reduce the algorithm complexity. The simulation results show that the algorithm reduces the complexity of the algorithm while the loss of bit error rate performance is very small. Then, aiming at the poor bit error rate performance of SCMA technology under the condition of low signal-to-noise ratio, a joint coding and decoding simulation link based on soft input and soft output Turbo code and SCMA technology is proposed. The simulation results prove that Turbo codes can speed up the convergence speed of the decoding algorithm. When the SNR is 4 dB, the bit error rate of the joint system has been reduced to below 10e-3, which has obvious advantages compared with the SCMA system without Turbo coding. Therefore, the two methods proposed in this paper can be used for the high-capacity demand of the IoT communication system.
The wide application of the Internet of Things (IoT), large-scale satellite clusters and drone clusters requires multiple access capabilities for massive devices. In order to meet the high-capacity and low-latency access requirements in application scenarios such as the IoT, this paper proposes to apply sparse code multiple access (SCMA) technology to the massive terminal access of the IoT, focusing on the study of SCMA decoding algorithm. Aiming at the high complexity of its traditional decoding algorithm, a decoding algorithm based on codeword reliability is proposed. The algorithm reduces the number of codeword iterations with higher reliability by setting a threshold to reduce the algorithm complexity. The simulation results show that the algorithm reduces the complexity of the algorithm while the loss of bit error rate performance is very small. Then, aiming at the poor bit error rate performance of SCMA technology under the condition of low signal-to-noise ratio, a joint coding and decoding simulation link based on soft input and soft output Turbo code and SCMA technology is proposed. The simulation results prove that Turbo codes can speed up the convergence speed of the decoding algorithm. When the SNR is 4 dB, the bit error rate of the joint system has been reduced to below 10e-3, which has obvious advantages compared with the SCMA system without Turbo coding. Therefore, the two methods proposed in this paper can be used for the high-capacity demand of the IoT communication system.
Author Wang, Huanzhu
Yan, Yue
Zhao, Hongwei
Author_xml – sequence: 1
  givenname: Hongwei
  surname: Zhao
  fullname: Zhao, Hongwei
  organization: School of Electronics and Information, Northwestern Polytechnical University
– sequence: 2
  givenname: Huanzhu
  surname: Wang
  fullname: Wang, Huanzhu
  email: 910544662@qq.com
  organization: School of Electronics and Information, Northwestern Polytechnical University
– sequence: 3
  givenname: Yue
  surname: Yan
  fullname: Yan, Yue
  organization: School of Electronics and Information, Northwestern Polytechnical University
BookMark eNp9kE1LAzEQhoNUsK3-AU8Lnlczm2Z3c2zrNxXBD_AWkmxSU7ZJTdJD_71bVxA89DQz8D4zwzNCA-edRugc8CVgXF1FAEzKHBdFjoERmtMjNARaFXkNlAy6ntQkn5Ts4wSNYlxhjCmtJ0M0e50_TbNHb13K5r6xbpkJ12TXWvXDtF36YNPnOpuJqJvMu31MZy-6tULa1qbdKTo2oo367LeO0fvtzdv8Pl883z3Mp4tcEWApl4ZOMJNQmoZWUijATGDSKNBgCJZEKVXrygDTZSGlFBTAmFKqBppaaKzIGF30ezfBf211THzlt8F1J3lRl8BYCZR1qaJPqeBjDNrwTbBrEXYcMN-74r0r3rniP6447aD6H6RsEsl6l4Kw7WGU9Gjs7rilDn9fHaC-AXVjf30
CitedBy_id crossref_primary_10_1007_s11277_023_10688_7
Cites_doi 10.1109/JSTSP.2019.2898323
10.1109/LCOMM.2017.2697425
10.1109/COMST.2016.2621116
10.1109/LSP.2016.2544792
10.1109/TCOMM.2015.2511078
10.1109/LCOMM.2020.2981024
10.1109/LCOMM.2018.2792019
10.1109/JSAC.2016.2525418
10.1109/LCOMM.2016.2592912
10.1109/PIMRC.2013.6666209
10.1109/VTCFall.2014.6966170
10.1109/ICC.2015.7248770
10.1109/PIMRC.2013.6666156
10.1109/GLOCOMW.2016.7848941
10.1109/VTCSpring.2013.6692652
10.1109/GLOCOM.2016.7841966
ContentType Journal Article
Copyright The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022
The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022.
Copyright_xml – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022
– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022.
DBID AAYXX
CITATION
3V.
7SC
7SP
7WY
7WZ
7XB
87Z
8AL
8AO
8FD
8FE
8FG
8FK
8FL
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
HCIFZ
JQ2
K60
K6~
K7-
L.-
L7M
L~C
L~D
M0C
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
Q9U
DOI 10.1007/s11036-022-01935-5
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
ProQuest ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Global (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni Edition)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
Technology collection
ProQuest One
ProQuest Central
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM Global
Computing Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central Basic
DatabaseTitle CrossRef
ABI/INFORM Global (Corporate)
ProQuest Business Collection (Alumni Edition)
ProQuest One Business
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Pharma Collection
ABI/INFORM Complete
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
ABI/INFORM Complete (Alumni Edition)
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
Electronics & Communications Abstracts
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Business Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Business (Alumni)
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
Business Premium Collection (Alumni)
DatabaseTitleList
ABI/INFORM Global (Corporate)
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1572-8153
EndPage 295
ExternalDocumentID 10_1007_s11036_022_01935_5
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 61771393
  funderid: http://dx.doi.org/10.13039/501100001809
GroupedDBID -59
-5G
-BR
-EM
-Y2
-~C
-~X
.4S
.86
.DC
.VR
06D
0R~
0VY
123
1N0
1SB
2.D
203
28-
29M
29~
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
3V.
4.4
406
408
409
40D
40E
5QI
5VS
67Z
6NX
7WY
85S
8AO
8FE
8FG
8FL
8FW
8TC
8UJ
8US
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYOK
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFO
ACGFS
ACHSB
ACHXU
ACKNC
ACM
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACREN
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADL
ADMLS
ADRFC
ADTPH
ADURQ
ADYFF
ADYOE
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFEXP
AFFNX
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFYQB
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMTXH
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCEE
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
AZQEC
B-.
BA0
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DWQXO
EBLON
EBS
EDO
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ6
GQ7
GQ8
GROUPED_ABI_INFORM_COMPLETE
GROUPED_ABI_INFORM_RESEARCH
GXS
H13
HCIFZ
HF~
HG5
HG6
HGAVV
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I-F
I07
I09
IHE
IJ-
IKXTQ
ITG
ITH
ITM
IWAJR
IXC
IXE
IZIGR
IZQ
I~X
I~Y
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K60
K6V
K6~
K7-
KDC
KOV
KOW
LAK
LLZTM
M0C
M0N
M4Y
MA-
N2Q
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P62
P9O
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
PT5
Q2X
QOK
QOS
R4E
R89
R9I
RHV
RIG
RNI
RNS
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCLPG
SCO
SCV
SDH
SDM
SHX
SISQX
SJN
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
W7O
WK8
YLTOR
Z45
Z7R
Z7X
Z7Z
Z81
Z83
Z88
Z8M
Z8R
Z8T
Z8W
Z92
ZMTXR
_50
~A9
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
AETEA
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
7SC
7SP
7XB
8AL
8FD
8FK
JQ2
L.-
L7M
L~C
L~D
PKEHL
PQEST
PQUKI
Q9U
ID FETCH-LOGICAL-c319t-bf5409b16fd57bac109a03dc1e1f30b3ccc8e7f19e62bbba511ff6bcd1d8ae0c3
IEDL.DBID RSV
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000769325300002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1383-469X
IngestDate Wed Nov 05 03:11:48 EST 2025
Sat Nov 29 03:18:16 EST 2025
Tue Nov 18 21:05:58 EST 2025
Fri Feb 21 02:43:18 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Internet of things
Decoding algorithm
High capacity
Sparse code multiple access
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c319t-bf5409b16fd57bac109a03dc1e1f30b3ccc8e7f19e62bbba511ff6bcd1d8ae0c3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2861996159
PQPubID 26070
PageCount 11
ParticipantIDs proquest_journals_2861996159
crossref_primary_10_1007_s11036_022_01935_5
crossref_citationtrail_10_1007_s11036_022_01935_5
springer_journals_10_1007_s11036_022_01935_5
PublicationCentury 2000
PublicationDate 20230200
2023-02-00
20230201
PublicationDateYYYYMMDD 2023-02-01
PublicationDate_xml – month: 2
  year: 2023
  text: 20230200
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationSubtitle The Journal of SPECIAL ISSUES on Mobility of Systems, Users, Data and Computing
PublicationTitle Mobile networks and applications
PublicationTitleAbbrev Mobile Netw Appl
PublicationYear 2023
Publisher Springer US
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer Nature B.V
References CR2
CR4
Palattella, Dohler, Grieco (CR1) 2016; 34
Yang, Ma, Siu (CR13) 2017; 21
CR6
CR5
Jienan, Zhenbing, Shuaining (CR16) 2016; 23
Kim, Kim, Lee, Cho (CR18) 2018; 22
CR17
CR9
CR15
CR14
Zheng, Zhiguo, Pingzhi (CR3) 2016; 64
Yang, Dong, Chen (CR12) 2016; 20
Aldababsa, Göztepe, Kurt (CR8) 2020; 24
Dai, Niu, Lin (CR10) 2019; 13
Islam, Avazov, Dobre (CR7) 2016; 19
Min, Jia, Yun (CR11) 2019; 59
1935_CR14
M Kim (1935_CR18) 2018; 22
S Min (1935_CR11) 2019; 59
Y Zheng (1935_CR3) 2016; 64
1935_CR6
1935_CR5
1935_CR4
1935_CR15
MR Palattella (1935_CR1) 2016; 34
1935_CR9
1935_CR17
J Dai (1935_CR10) 2019; 13
SMR Islam (1935_CR7) 2016; 19
L Yang (1935_CR13) 2017; 21
1935_CR2
C Jienan (1935_CR16) 2016; 23
D Yang (1935_CR12) 2016; 20
M Aldababsa (1935_CR8) 2020; 24
References_xml – volume: 13
  start-page: 753
  issue: 3
  year: 2019
  end-page: 765
  ident: CR10
  article-title: Iterative Gaussian-approximated message passing receiver for MIMO-SCMA system[J]
  publication-title: IEEE Journal of Selected Topics in Signal Processing
  doi: 10.1109/JSTSP.2019.2898323
– volume: 21
  start-page: 1855
  issue: 8
  year: 2017
  end-page: 1858
  ident: CR13
  article-title: Low complexity MPA detector based on sphere decoding for SCMA[J]
  publication-title: IEEE Commun Lett
  doi: 10.1109/LCOMM.2017.2697425
– volume: 19
  start-page: 721
  issue: 2
  year: 2016
  end-page: 741
  ident: CR7
  article-title: Power-domain non-orthogonal multiple access (NOMA) in 5G systems: potentials and challenges[J]
  publication-title: IEEE Communications Surveys &Tutorials
  doi: 10.1109/COMST.2016.2621116
– volume: 59
  start-page: 749
  issue: 7
  year: 2019
  end-page: 754
  ident: CR11
  article-title: A dynamic sub-graph detection algorithm for uplink SCMA systems[J]
  publication-title: Telecommunication Engineering
– ident: CR4
– ident: CR14
– ident: CR15
– ident: CR2
– volume: 23
  start-page: 639
  issue: 5
  year: 2016
  end-page: 643
  ident: CR16
  article-title: Sparse code multiple access decoding based on a Monte Carlo Markov chain method[J]
  publication-title: IEEE signal processing letters
  doi: 10.1109/LSP.2016.2544792
– ident: CR17
– volume: 64
  start-page: 654
  issue: 2
  year: 2016
  end-page: 667
  ident: CR3
  article-title: On the performance of non-orthogonal multiple access systems with partial channel information[J]
  publication-title: IEEE Trans Commun
  doi: 10.1109/TCOMM.2015.2511078
– ident: CR9
– ident: CR6
– ident: CR5
– volume: 24
  start-page: 1188
  issue: 6
  year: 2020
  end-page: 1191
  ident: CR8
  article-title: Bit error rate for NOMA network[J]
  publication-title: IEEE Commun Lett
  doi: 10.1109/LCOMM.2020.2981024
– volume: 22
  start-page: 720
  issue: 4
  year: 2018
  end-page: 723
  ident: CR18
  article-title: Deep learning-aided SCMA[J]
  publication-title: IEEE Commun Lett
  doi: 10.1109/LCOMM.2018.2792019
– volume: 34
  start-page: 510
  issue: 3
  year: 2016
  end-page: 527
  ident: CR1
  article-title: Internet of things in the 5G era: enablers, architecture, and business models[J]
  publication-title: IEEE Journal on Selected Areas in Communications
  doi: 10.1109/JSAC.2016.2525418
– volume: 20
  start-page: 1812
  issue: 9
  year: 2016
  end-page: 1815
  ident: CR12
  article-title: Low-complexity detector in sparse code multiple access systems[J]
  publication-title: IEEE Commun Lett
  doi: 10.1109/LCOMM.2016.2592912
– volume: 23
  start-page: 639
  issue: 5
  year: 2016
  ident: 1935_CR16
  publication-title: IEEE signal processing letters
  doi: 10.1109/LSP.2016.2544792
– ident: 1935_CR5
  doi: 10.1109/PIMRC.2013.6666209
– ident: 1935_CR17
  doi: 10.1109/VTCFall.2014.6966170
– ident: 1935_CR15
  doi: 10.1109/ICC.2015.7248770
– volume: 19
  start-page: 721
  issue: 2
  year: 2016
  ident: 1935_CR7
  publication-title: IEEE Communications Surveys &Tutorials
  doi: 10.1109/COMST.2016.2621116
– volume: 64
  start-page: 654
  issue: 2
  year: 2016
  ident: 1935_CR3
  publication-title: IEEE Trans Commun
  doi: 10.1109/TCOMM.2015.2511078
– volume: 59
  start-page: 749
  issue: 7
  year: 2019
  ident: 1935_CR11
  publication-title: Telecommunication Engineering
– volume: 21
  start-page: 1855
  issue: 8
  year: 2017
  ident: 1935_CR13
  publication-title: IEEE Commun Lett
  doi: 10.1109/LCOMM.2017.2697425
– ident: 1935_CR6
  doi: 10.1109/PIMRC.2013.6666156
– volume: 24
  start-page: 1188
  issue: 6
  year: 2020
  ident: 1935_CR8
  publication-title: IEEE Commun Lett
  doi: 10.1109/LCOMM.2020.2981024
– volume: 34
  start-page: 510
  issue: 3
  year: 2016
  ident: 1935_CR1
  publication-title: IEEE Journal on Selected Areas in Communications
  doi: 10.1109/JSAC.2016.2525418
– volume: 20
  start-page: 1812
  issue: 9
  year: 2016
  ident: 1935_CR12
  publication-title: IEEE Commun Lett
  doi: 10.1109/LCOMM.2016.2592912
– ident: 1935_CR4
– volume: 13
  start-page: 753
  issue: 3
  year: 2019
  ident: 1935_CR10
  publication-title: IEEE Journal of Selected Topics in Signal Processing
  doi: 10.1109/JSTSP.2019.2898323
– ident: 1935_CR14
  doi: 10.1109/GLOCOMW.2016.7848941
– volume: 22
  start-page: 720
  issue: 4
  year: 2018
  ident: 1935_CR18
  publication-title: IEEE Commun Lett
  doi: 10.1109/LCOMM.2018.2792019
– ident: 1935_CR2
  doi: 10.1109/VTCSpring.2013.6692652
– ident: 1935_CR9
  doi: 10.1109/GLOCOM.2016.7841966
SSID ssj0005584
Score 2.3631833
Snippet The wide application of the Internet of Things (IoT), large-scale satellite clusters and drone clusters requires multiple access capabilities for massive...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 285
SubjectTerms Algorithms
Bit error rate
Clusters
Codes
Coding
Communications Engineering
Communications systems
Complexity
Computer Communication Networks
Decoding
Electrical Engineering
Engineering
Errors
Internet of Things
IT in Business
Multiple access
Networks
Reliability
Satellite constellations
Signal to noise ratio
Simulation
Turbo codes
SummonAdditionalLinks – databaseName: ABI/INFORM Global
  dbid: M0C
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFA46fdAH7-J0Sh5802Cz9JYn2apDxA3BC3sruVUHs51bFfz3Jm1qVXAvPpZcKDlJzneSk-8D4FhS5hNfSsP8yHWAwgJEmZsgJ1ScKkoVK5TnHm-CwSAcDumtPXCb2bTKak8sNmqZCXNGftYOfZMwq73v-eQVGdUoc7tqJTQWwZJBNialr-9EdYqHF5aitiFBOgwc2kcz5dM5bKh4TS67BjnEQ95Px1SjzV8XpIXf6a3_9483wJpFnLBTTpFNsKDSLbD6jYdwG3Tvon4HXmejNIdRZrwZZKmEFzo0LT464yfdcf78Arva6UmYpaaagiafueT5_tgBD73L--gKWXEFJPSqyxFPNFajHPuJ9ALOBHYoc4gUWOGEOJwIIUIVJJgqv805ZxqYJYnPhcQyZMoRZBc00ixVewDq5gZ2ugoT4QYB1TGvp2FPW0MXVymsmgBXIxsLyzxuBDDGcc2ZbKwRa2vEhTVirwlOvtpMSt6NubVblQliuwZncT3-TXBaGbEu_ru3_fm9HYAVozlfpm63QCOfvqlDsCze89FselTMwE9t5t6C
  priority: 102
  providerName: ProQuest
Title SCMA Joint Coding and Decoding Algorithm Based on Code Reliability
URI https://link.springer.com/article/10.1007/s11036-022-01935-5
https://www.proquest.com/docview/2861996159
Volume 28
WOSCitedRecordID wos000769325300002&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: PRVAVX
  databaseName: Springer Journals New Starts & Take-Overs Collection
  customDbUrl:
  eissn: 1572-8153
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0005584
  issn: 1383-469X
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1ZS8NAEB68HvTBW6xH2QffNJBtmmMf26qIRyme1ZewV7RQE2mj4L93NodRUUFfFpbMLmH2mG_YmW8AdhTjnuMpZZgfBToo3LcYb0aWHWjBNGOaZ5Xnrk_9bjfo91mvSAobl9Hu5ZNkdlNXyW7UkOea6HOEJY5ruZMwjeYuMAUbzi-uq8AON8hL2QaOhc5fv0iV-X6Oz-aowphfnkUza3O48L__XIT5Al2SVr4dlmBCx8sw94FzcAXaF52zFjlOBnFKOomxXITHiuyjG5p1WsP7ZDRIHx5JGw2cIklsxDQxscs5p_frKlwdHlx2jqyikIIl8YSllogQlzFBvUi5vuCS2ozbjpJU08ixhSOlDLQfUaa9hhCCIwiLIk9IRVXAtS2dNZiKk1ivA8HhBmI2NXVk0_cZ-rcuQpwGwpSm1lTXgJb6DGXBMm6KXQzDih_Z6CdE_YSZfkK3BrvvY55yjo1fpbfKZQqL8zYOG4FnwqkRm9Vgr1yW6vPPs238TXwTZk29-Txsewum0tGz3oYZ-ZIOxqM6TPo3t3WYbh90e-fYO_EtbM_sDrY9966e7dM3IxvZuw
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB5RilQ4UGiLukCLD-2ptRrHefmA0LIUQXdZIZVWewt-pUWiCbChFX-K38g4j6ZUghsHjlFsS8439nwTj78BeGeEjHhkjFN-VBigyJgKGWTUS6wSVggrq8pz30fxeJxMJuJwBq7buzAurbLdE6uN2hTa_SP_5CeRS5hF77t1dk5d1Sh3utqW0KjNYmiv_mDINt3c30F83_v-7uejwR5tqgpQjeZWUpUhSRGKRZkJYyU184T0uNHMsox7imutExtnTNjIV0pJZCRZFiltmEmk9TTHcZ_A04AnsVtXw5h2KSVhUhfRTTjFsHPSXNKpr-oxJ_3rcueRVPGQhrcdYcdu_zuQrfzc7vPH9oWWYLFh1KRfL4FlmLH5C1j4R2fxJWx_HRz0yZfiJC_JoHDemsjckB0MvauH_ukPnEj58xfZRqduSJG7Zpa4fO1ax_zqFXx7kEmswGxe5PY1EOzuaHVgGddBHAuM6UOkdT5Ss8BaZnvAWiRT3SiruwIfp2mnCe3QTxH9tEI_DXvw4W-fs1pX5N7W6y3kabPHTNMO7x58bI2me333aKv3j7YBz_aODkbpaH88XIN5nCav09TXYba8uLRvYE7_Lk-mF28r6ydw_NDGdAPYCD-_
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB4BrVB74FGoui0PH-ipjYjjzcOHqlp2WfHqaiVatOIS_Aog0WS7m4L4a_y6jvNoClK5ceAYObbkzGfPN_HnGYAtzUXAAq1t5keJAYoIHS7aieNGRnLDuRFF5bmTo3AwiEYjPpyBu_oujJVV1ntisVHrTNl_5NteFFjBLHrf7aSSRQx7_a_jX46tIGVPWutyGiVEDs3tDYZv0y_7PbT1R8_r737v7jlVhQFHIfRyRyZIWLikQaL9UApFXS5cphU1NGGuZEqpyIQJ5SbwpJQC2UmSBFJpqiNhXMVw3Fl4EWKMaeWEQ_-0kZf4UVlQN2IONo-qCzvltT1q0wBbHT0SLOY7_n2n2DDdB4ezhc_rLz7nr7UECxXTJp1yaSzDjEnfwOt_8i-uwM5x91uHHGSXaU66mfXiRKSa9DAkLx46V-c4kfziJ9lBZ69JltrXDLE67jK_-e0q_HiSSbyFuTRLzTsg2N3S7bahTLXDkGOs7yPd85CytY2hpgW0tmqsqozrtvDHVdzkirZIiBEJcYGE2G_Bp799xmW-kUffXqvNH1d7zzRubN-CzzWAmub_j_b-8dE2YR4xFB_tDw4_wCucJSvV62swl09-m3V4qa7zy-lko1gIBM6eGkt_AOY4SOM
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=SCMA+Joint+Coding+and+Decoding+Algorithm+Based+on+Code+Reliability&rft.jtitle=Mobile+networks+and+applications&rft.au=Zhao%2C+Hongwei&rft.au=Wang%2C+Huanzhu&rft.au=Yan%2C+Yue&rft.date=2023-02-01&rft.issn=1383-469X&rft.eissn=1572-8153&rft.volume=28&rft.issue=1&rft.spage=285&rft.epage=295&rft_id=info:doi/10.1007%2Fs11036-022-01935-5&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s11036_022_01935_5
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1383-469X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1383-469X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1383-469X&client=summon