Low Complexity Iterative Receiver Design for Sparse Code Multiple Access
Sparse code multiple access (SCMA) is one of the most promising methods among all the non-orthogonal multiple access techniques in the future 5G communication. Compared with some other non-orthogonal multiple access techniques, such as low density signature, SCMA can achieve better performance due t...
Saved in:
| Published in | IEEE transactions on communications Vol. 65; no. 2; pp. 621 - 634 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
New York
IEEE
01.02.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | Sparse code multiple access (SCMA) is one of the most promising methods among all the non-orthogonal multiple access techniques in the future 5G communication. Compared with some other non-orthogonal multiple access techniques, such as low density signature, SCMA can achieve better performance due to the shaping gain of the SCMA code words. However, despite the sparsity of the code words, the decoding complexity of the current message passing algorithm utilized by SCMA is still prohibitively high. In this paper, by exploring the lattice structure of SCMA code words, we propose a low-complexity decoding algorithm based on list sphere decoding (LSD). The LSD avoids the exhaustive search for all possible hypotheses and only considers signal within a hypersphere. As LSD can be viewed a depth-first tree search algorithm, we further propose several methods to prune the redundancy-visited nodes in order to reduce the size of the search tree. Simulation results show that the proposed algorithm can reduce the decoding complexity substantially while the performance loss compared with the existing algorithm is negligible. |
|---|---|
| AbstractList | Sparse code multiple access (SCMA) is one of the most promising methods among all the non-orthogonal multiple access techniques in the future 5G communication. Compared with some other non-orthogonal multiple access techniques, such as low density signature, SCMA can achieve better performance due to the shaping gain of the SCMA code words. However, despite the sparsity of the code words, the decoding complexity of the current message passing algorithm utilized by SCMA is still prohibitively high. In this paper, by exploring the lattice structure of SCMA code words, we propose a low-complexity decoding algorithm based on list sphere decoding (LSD). The LSD avoids the exhaustive search for all possible hypotheses and only considers signal within a hypersphere. As LSD can be viewed a depth-first tree search algorithm, we further propose several methods to prune the redundancy-visited nodes in order to reduce the size of the search tree. Simulation results show that the proposed algorithm can reduce the decoding complexity substantially while the performance loss compared with the existing algorithm is negligible. |
| Author | Wei, Fan Chen, Wen |
| Author_xml | – sequence: 1 givenname: Fan surname: Wei fullname: Wei, Fan email: weifan89@sjtu.edu.cn organization: Shanghai Key Laboratory of Navigation and location based services, Shanghai Jiao Tong University, Minhang, China – sequence: 2 givenname: Wen orcidid: 0000-0003-2133-8679 surname: Chen fullname: Chen, Wen email: wenchen@sjtu.edu.cn organization: Shanghai Key Laboratory of Navigation and location based services, Shanghai Jiao Tong University, Minhang, China |
| BookMark | eNp9kE1PwkAQhjcGEwH9A3rZxHNxt_t9JPUDEgiJ4rlpt1NTUtq6W1T-vYsQDx68zHt5n5nMM0KDpm0AoWtKJpQSc7dOVsvlJCZUTmLJKJf6DA2pEDoiWqgBGhJiSCSV0hdo5P2GEMIJY0M0W7SfOGm3XQ1fVb_H8x5c1lcfgJ_BQkiH78FXbw0uW4dfusx5CP0C8HJX91XA8NRa8P4SnZdZ7eHqlGP0-viwTmbRYvU0T6aLyDJJ-4gXApguDIu5KZjMYwWaWC1KywtdFJLqnOVZyS3jORVKZDYMawRIzqgyho3R7XFv59r3Hfg-3bQ714STKdXScMK5kKGljy3rWu8dlKmt-vBX2_Quq-qUkvTgLf3xlh68pSdvAY3_oJ2rtpnb_w_dHKEKAH4BpUSsNGffqR16RQ |
| CODEN | IECMBT |
| CitedBy_id | crossref_primary_10_1109_TVT_2018_2876121 crossref_primary_10_1109_ACCESS_2018_2842233 crossref_primary_10_3390_app9020335 crossref_primary_10_1109_ACCESS_2021_3136303 crossref_primary_10_1007_s11036_017_0968_9 crossref_primary_10_1587_transcom_2022EBP3166 crossref_primary_10_1109_LCOMM_2017_2747550 crossref_primary_10_1049_iet_com_2017_0774 crossref_primary_10_1109_ACCESS_2018_2828126 crossref_primary_10_1109_TCOMM_2017_2782325 crossref_primary_10_1109_TWC_2018_2878571 crossref_primary_10_1109_TVLSI_2019_2947495 crossref_primary_10_1587_transcom_2017EBP3420 crossref_primary_10_3390_e25060930 crossref_primary_10_1109_LWC_2017_2775627 crossref_primary_10_1615_TelecomRadEng_2024053179 crossref_primary_10_1109_JSYST_2020_2975666 crossref_primary_10_1109_TWC_2020_3041295 crossref_primary_10_1109_ACCESS_2019_2940045 crossref_primary_10_1109_OJCOMS_2021_3081166 crossref_primary_10_1109_TCOMM_2022_3182402 crossref_primary_10_1109_TVT_2017_2728607 crossref_primary_10_1109_JSAC_2020_3019724 crossref_primary_10_1109_ACCESS_2020_3037357 crossref_primary_10_1155_2018_8910907 crossref_primary_10_1109_TWC_2019_2950000 crossref_primary_10_1109_ACCESS_2019_2891597 crossref_primary_10_1109_LWC_2020_2965939 crossref_primary_10_1109_TCOMM_2021_3068733 crossref_primary_10_1109_TWC_2019_2963185 crossref_primary_10_1016_j_dcan_2021_07_008 crossref_primary_10_1016_j_phycom_2020_101041 crossref_primary_10_1109_TCOMM_2018_2870894 crossref_primary_10_1109_LCOMM_2018_2848273 crossref_primary_10_1109_JIOT_2019_2948281 crossref_primary_10_1049_iet_com_2017_0420 crossref_primary_10_1109_ACCESS_2019_2954492 crossref_primary_10_1109_TWC_2018_2816929 crossref_primary_10_1109_TWC_2019_2939820 crossref_primary_10_1007_s11277_021_08115_w crossref_primary_10_1109_ACCESS_2018_2868093 crossref_primary_10_3390_rs14246402 crossref_primary_10_1007_s00034_023_02517_w crossref_primary_10_1109_TWC_2018_2813378 crossref_primary_10_1109_ACCESS_2018_2883399 crossref_primary_10_1109_COMST_2017_2721379 crossref_primary_10_1631_FITEE_1900405 crossref_primary_10_1109_TVT_2022_3175540 crossref_primary_10_32604_iasc_2021_013009 crossref_primary_10_1109_TWC_2021_3062235 crossref_primary_10_1109_ACCESS_2021_3062887 crossref_primary_10_1109_ACCESS_2019_2950901 crossref_primary_10_1109_TVT_2018_2874044 crossref_primary_10_3390_electronics11071020 crossref_primary_10_3390_s19020329 crossref_primary_10_1109_TVT_2024_3424690 crossref_primary_10_1109_TVT_2018_2865920 crossref_primary_10_1109_TCOMM_2020_2965522 crossref_primary_10_1109_TVT_2022_3151936 crossref_primary_10_1109_MVT_2018_2867280 crossref_primary_10_1109_ACCESS_2019_2896582 crossref_primary_10_1109_ACCESS_2019_2910776 crossref_primary_10_1109_TVT_2023_3305233 crossref_primary_10_1109_OJCOMS_2020_2969899 crossref_primary_10_1109_TVT_2019_2932907 crossref_primary_10_1109_TCOMM_2020_3031624 crossref_primary_10_1109_COMST_2019_2910569 crossref_primary_10_1109_LCOMM_2021_3081569 crossref_primary_10_1109_JIOT_2024_3413895 crossref_primary_10_1109_TVT_2022_3232810 crossref_primary_10_1109_TWC_2018_2792425 crossref_primary_10_1109_TVT_2018_2854184 crossref_primary_10_1109_TITS_2021_3095437 crossref_primary_10_32604_iasc_2023_029996 crossref_primary_10_1109_TWC_2021_3108901 crossref_primary_10_1109_TVT_2024_3435737 crossref_primary_10_3390_s20071960 crossref_primary_10_1109_LCOMM_2020_3034956 crossref_primary_10_1109_LWC_2022_3151432 crossref_primary_10_1049_iet_com_2019_0719 crossref_primary_10_1088_1742_6596_2373_5_052028 crossref_primary_10_1109_ACCESS_2017_2772259 crossref_primary_10_1155_2022_6855947 crossref_primary_10_1109_MVT_2018_2869425 crossref_primary_10_1155_2020_8845371 crossref_primary_10_1109_TCOMM_2018_2843354 crossref_primary_10_1109_TVT_2021_3099640 |
| Cites_doi | 10.1109/LCOMM.2011.061011.102098 10.1109/GLOCOM.2014.7037563 10.1109/LWC.2015.2469668 10.1109/GLOCOM.2009.5425243 10.1109/18.910572 10.1109/VETECS.2010.5493941 10.1109/TSP.2005.843746 10.1109/TCOMM.2014.2367013 10.1090/S0025-5718-1985-0777278-8 10.1109/ICCChina.2016.7636728 10.1109/TIT.2002.800499 10.1109/38.595279 10.1109/TCOMM.2003.809789 10.1109/PIMRC.2013.6666156 10.1109/TSP.2005.850350 10.1109/TSP.2014.2352595 10.1109/TCOMM.2012.082812.110284 10.1109/TSP.2005.850352 10.1109/49.661110 10.1109/ICC.2015.7248770 10.1109/WCSP.2015.7341312 10.1109/GLOCOMW.2015.7414184 10.1109/LCOMM.2012.052112.120469 10.1109/TWC.2012.070912.111948 10.1109/TIT.2003.817444 10.1109/18.681321 10.1109/TIT.2010.2059730 10.1109/LCOMM.2005.1431159 10.1109/18.771234 10.1007/BF01581144 10.1109/GLOCOM.2016.7841513 10.1145/1089242.1089247 10.1109/4234.846498 10.1109/TSP.2007.909320 10.1109/VTCFall.2014.6966170 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2017 |
| DBID | 97E RIA RIE AAYXX CITATION 7SP 8FD L7M |
| DOI | 10.1109/TCOMM.2016.2631468 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace |
| DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-0857 |
| EndPage | 634 |
| ExternalDocumentID | 10_1109_TCOMM_2016_2631468 7752784 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China; NSFC grantid: #61671294 funderid: 10.13039/501100001809 – fundername: STCSM Key Fundamental Project grantid: #16JC1402900 – fundername: National 863 Project grantid: #2015AA01A710 – fundername: GXNSF grantid: #2015GXNSFDA139037 |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 85S 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACIWK ACKIV ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IES IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 ZCA ZCG AAYOK AAYXX CITATION RIG 7SP 8FD L7M |
| ID | FETCH-LOGICAL-c361t-4d5e38d93249d36b27e80c85fc4d8dd618b3baf4c34b1575ac575c95e64317993 |
| IEDL.DBID | RIE |
| ISSN | 0090-6778 |
| IngestDate | Mon Jun 30 10:23:47 EDT 2025 Tue Jul 01 00:29:04 EDT 2025 Thu Apr 24 23:06:33 EDT 2025 Wed Aug 27 08:34:00 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c361t-4d5e38d93249d36b27e80c85fc4d8dd618b3baf4c34b1575ac575c95e64317993 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0003-2133-8679 |
| PQID | 1869404456 |
| PQPubID | 85472 |
| PageCount | 14 |
| ParticipantIDs | crossref_citationtrail_10_1109_TCOMM_2016_2631468 proquest_journals_1869404456 crossref_primary_10_1109_TCOMM_2016_2631468 ieee_primary_7752784 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2017-02-01 |
| PublicationDateYYYYMMDD | 2017-02-01 |
| PublicationDate_xml | – month: 02 year: 2017 text: 2017-02-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on communications |
| PublicationTitleAbbrev | TCOMM |
| PublicationYear | 2017 |
| 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 | ref35 ref13 ref34 ref12 ref37 ref15 ref14 ref31 ref30 ref33 ref11 ref32 ref10 ref2 ref17 ref16 ref19 ref18 golub (ref36) 1993 (ref1) 2013 ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref28 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 |
| References_xml | – ident: ref7 doi: 10.1109/LCOMM.2011.061011.102098 – ident: ref13 doi: 10.1109/GLOCOM.2014.7037563 – ident: ref14 doi: 10.1109/LWC.2015.2469668 – ident: ref5 doi: 10.1109/GLOCOM.2009.5425243 – ident: ref4 doi: 10.1109/18.910572 – ident: ref6 doi: 10.1109/VETECS.2010.5493941 – ident: ref32 doi: 10.1109/TSP.2005.843746 – ident: ref26 doi: 10.1109/TCOMM.2014.2367013 – ident: ref16 doi: 10.1090/S0025-5718-1985-0777278-8 – ident: ref10 doi: 10.1109/ICCChina.2016.7636728 – ident: ref21 doi: 10.1109/TIT.2002.800499 – ident: ref37 doi: 10.1109/38.595279 – ident: ref18 doi: 10.1109/TCOMM.2003.809789 – ident: ref8 doi: 10.1109/PIMRC.2013.6666156 – ident: ref34 doi: 10.1109/TSP.2005.850350 – ident: ref25 doi: 10.1109/TSP.2014.2352595 – ident: ref3 doi: 10.1109/TCOMM.2012.082812.110284 – ident: ref33 doi: 10.1109/TSP.2005.850352 – ident: ref31 doi: 10.1109/49.661110 – ident: ref29 doi: 10.1109/ICC.2015.7248770 – ident: ref15 doi: 10.1109/WCSP.2015.7341312 – ident: ref12 doi: 10.1109/GLOCOMW.2015.7414184 – ident: ref27 doi: 10.1109/LCOMM.2012.052112.120469 – ident: ref28 doi: 10.1109/TWC.2012.070912.111948 – ident: ref22 doi: 10.1109/TIT.2003.817444 – year: 2013 ident: ref1 article-title: 5G: A technology vision – ident: ref11 doi: 10.1109/18.681321 – ident: ref24 doi: 10.1109/TIT.2010.2059730 – ident: ref35 doi: 10.1109/LCOMM.2005.1431159 – ident: ref20 doi: 10.1109/18.771234 – ident: ref30 doi: 10.1007/BF01581144 – ident: ref19 doi: 10.1109/GLOCOM.2016.7841513 – ident: ref17 doi: 10.1145/1089242.1089247 – ident: ref23 doi: 10.1109/4234.846498 – ident: ref2 doi: 10.1109/TSP.2007.909320 – ident: ref9 doi: 10.1109/VTCFall.2014.6966170 – year: 1993 ident: ref36 publication-title: Matrix Computations Baltimore MD |
| SSID | ssj0004033 |
| Score | 2.574723 |
| Snippet | Sparse code multiple access (SCMA) is one of the most promising methods among all the non-orthogonal multiple access techniques in the future 5G communication.... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 621 |
| SubjectTerms | Algorithms Binary system Codes Complexity Complexity theory Computer simulation Decoding Iterative decoding Lattices list sphere decoding Maximum likelihood decoding Message passing message passing algorithm node pruning NOMA Non-orthogonal multiple access Nonorthogonal multiple access Redundancy SCMA Search algorithms |
| Title | Low Complexity Iterative Receiver Design for Sparse Code Multiple Access |
| URI | https://ieeexplore.ieee.org/document/7752784 https://www.proquest.com/docview/1869404456 |
| Volume | 65 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV09T8MwED2VTjDwVRCFgjywQdI0dhxnrApVQQQGWqlblNjOAmorSIXg1-NzkvIpxBJlsCXL59y9i9-9AzjVKk_TSEjHpwFzmNLSSXmUOpRLJSIpeGq7NcS3fDRh19Ng2oDzVS2M1tqSz7SLr_YuX83lEn-VdcMwwHuyNVgziVtZq_VRA-nRSnES6eyhqAtkvKg7HtzFMbK4uOtzirVGX4KQ7arywxXb-DLcgrheWUkreXCXRebKt2-ijf9d-jZsVkCT9MuTsQMNPduFjU_ygy0Y3cxfCDoEFMUsXsmVVVg27o8YMKmRsEEuLMGDGGRL7hcmB9ZmvNIkrmiIpG_7Le7BZHg5HoycqrOCIynvFcYmgaZCGezGIkV55odaeFIEuWRKKMV7IqNZmjNJWdYzgC6V5iGjQHPEGwbS7ENzNp_pAyBM-kxRP0WdGaSMRjk1QV_ITPnShEXdhl691YmsZMex-8VjYtMPL0qseRI0T1KZpw1nqzmLUnTjz9Et3O_VyGqr29CpLZpU3-Vzgg24mMcMajz8fdYRrPsYuC0vuwPN4mmpjw3sKLITe97eAbz80iQ |
| linkProvider | IEEE |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwzV1NbxMxEB1V5QAc-CqItAV8gBPadGN7HfvAoWqpEpotB1Kpt2XXnlyKkopuVLW_pX-l_60zjhM-xa0Sl9UebFnrGc08r9-8AXiLYVLXzvpMqkJnOqDPauPqTBkfrPPW1LFbQ3lkBsf600lxsgbXq1oYRIzkM-zya7zLDzM_519lO_1-wfdkiUJ5iJcXdEA7_zDcJ2u-k_Lg43hvkKUeAplXptfS6gUqGwilaBeUaWQfbe5tMfE62BBMzzaqqSfaK930CLrUnh7eFWg4szqWWqIAf49wRiEX1WE_qi5zlTQumUDft8uSnNztjPc-lyXzxkxXGsXVTb-kvdjH5Y_gHzPawWO4We7Fgshy2p23Tddf_SYT-b9u1hN4lKC02F34_lNYw-kzePiTwOIGDEazC8Ehj2U_20sxjBrSFOAFwWVkSorYjxQWQdhdfDmjUz7S-ICiTERLsRs7Sj6H4zv5lBewPp1N8SUI7aUOStaspMOkWDdRBGusb4L0lPixA72laSufhNW5v8e3Kh6wcldFd6jYHarkDh14v5pztpAV-efoDbbvamQybQe2lx5UpchzXnGLMZ1rwsWbf5_1Bu4PxuWoGg2PDrfggWSYElno27Defp_jKwJZbfM6-rqAr3ftL7f5ui6S |
| 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+Iterative+Receiver+Design+for+Sparse+Code+Multiple+Access&rft.jtitle=IEEE+transactions+on+communications&rft.au=Fan%2C+Wei&rft.au=Chen%2C+Wen&rft.date=2017-02-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0090-6778&rft.eissn=1558-0857&rft.volume=65&rft.issue=2&rft.spage=621&rft_id=info:doi/10.1109%2FTCOMM.2016.2631468&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0090-6778&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0090-6778&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0090-6778&client=summon |