On the Sparsity of Spreading Sequences for NOMA with Reliability Guarantee and Detection Complexity Limitation

Non-orthogonal multiple access (NOMA) is a promising technology for handling massive connectivity in future 5G wireless networks. Even though the spectral efficiency can be promoted, the transmission reliability is sometimes poor, due to the introduced multiple access interference (MAI), and the com...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2017 IEEE 85th Vehicular Technology Conference (VTC Spring) S. 1 - 6
Hauptverfasser: Ting Qi, Wei Feng, Youzheng Wang
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.06.2017
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Non-orthogonal multiple access (NOMA) is a promising technology for handling massive connectivity in future 5G wireless networks. Even though the spectral efficiency can be promoted, the transmission reliability is sometimes poor, due to the introduced multiple access interference (MAI), and the computational complexity for multiuser detection is usually high in NOMA. To solve this problem, we investigate the NOMA regime with sparse multiple-access sequences, so as to leverage sparse signal processing methods, e.g., the message passing algorithm (MPA) for low-complexity and highly- reliable multiuser detection. Particularly, we formulate an optimization problem to design the sparsity of spreading sequences, while maximizing the efficiency of NOMA subject to the allowable symbol error rate (SER) constraint as well as the affordable detection complexity constraint. To evaluate the detection performance of MPA, we give the large-system limit analysis and derive the density evolution method. The impact of variable and function sparsity on the performance is then analyzed. Based on the uncovered characteristics of the optimization problem, an efficient algorithm is proposed to derive the optimal sparsity achieving the desired trade-off between efficiency, reliability and complexity.
AbstractList Non-orthogonal multiple access (NOMA) is a promising technology for handling massive connectivity in future 5G wireless networks. Even though the spectral efficiency can be promoted, the transmission reliability is sometimes poor, due to the introduced multiple access interference (MAI), and the computational complexity for multiuser detection is usually high in NOMA. To solve this problem, we investigate the NOMA regime with sparse multiple-access sequences, so as to leverage sparse signal processing methods, e.g., the message passing algorithm (MPA) for low-complexity and highly- reliable multiuser detection. Particularly, we formulate an optimization problem to design the sparsity of spreading sequences, while maximizing the efficiency of NOMA subject to the allowable symbol error rate (SER) constraint as well as the affordable detection complexity constraint. To evaluate the detection performance of MPA, we give the large-system limit analysis and derive the density evolution method. The impact of variable and function sparsity on the performance is then analyzed. Based on the uncovered characteristics of the optimization problem, an efficient algorithm is proposed to derive the optimal sparsity achieving the desired trade-off between efficiency, reliability and complexity.
Author Wei Feng
Youzheng Wang
Ting Qi
Author_xml – sequence: 1
  surname: Ting Qi
  fullname: Ting Qi
  email: qit13@mails.tsinghua.edu.cn
  organization: Tsinghua Space Center, Tsinghua Univ., Beijing, China
– sequence: 2
  surname: Wei Feng
  fullname: Wei Feng
  email: fengwei@tsinghua.edu.cn
  organization: Tsinghua Nat. Lab. for Inf. Sci. & Technol., Tsinghua Univ., Beijing, China
– sequence: 3
  surname: Youzheng Wang
  fullname: Youzheng Wang
  email: yzhwang@mail.tsinghua.edu.cn
  organization: Tsinghua Space Center, Tsinghua Univ., Beijing, China
BookMark eNotkM9KxDAYxCPoQdd9AkHyAl2Tpn-S41J1FaoFW7wuX9ovbqBNa5tF9-1tcU8zDPObw9yQS9c7JOSesw3nTD18Vlk5jNZ9bULG043kTCZSXZC1SiWPmWKxEmF0TVzhqD8gLQcYJ-tPtDezHxGamaUlfh_R1ThR04_0vXjb0h_rD_QDWwvatguwO8IIziNScA19RI-1t72jWd8NLf4uldx21sOS3pIrA-2E67OuSPX8VGUvQV7sXrNtHljFfCBjrZNUc0wwrqMwljzUQgkDSWhCEJECrrSUSiQaGEopotQ0aYocgDPDUKzI3f-sRcT9_EMH42l_PkH8AWIgWUg
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/VTCSpring.2017.8108689
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781509059324
1509059326
EndPage 6
ExternalDocumentID 8108689
Genre orig-research
GroupedDBID 6IE
6IH
CBEJK
RIE
RIO
ID FETCH-LOGICAL-i90t-85bb67b1e6e5c425812b393fa62f2a349a19b88936ba0e88347fd77e1aa10f0e3
IEDL.DBID RIE
IngestDate Thu Jun 29 18:37:34 EDT 2023
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-85bb67b1e6e5c425812b393fa62f2a349a19b88936ba0e88347fd77e1aa10f0e3
PageCount 6
ParticipantIDs ieee_primary_8108689
PublicationCentury 2000
PublicationDate 2017-June
PublicationDateYYYYMMDD 2017-06-01
PublicationDate_xml – month: 06
  year: 2017
  text: 2017-June
PublicationDecade 2010
PublicationTitle 2017 IEEE 85th Vehicular Technology Conference (VTC Spring)
PublicationTitleAbbrev VTCSpring
PublicationYear 2017
Publisher IEEE
Publisher_xml – name: IEEE
Score 2.0071998
Snippet Non-orthogonal multiple access (NOMA) is a promising technology for handling massive connectivity in future 5G wireless networks. Even though the spectral...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Complexity theory
Multiuser detection
NOMA
Optimization
Reliability
Sparse matrices
Wireless networks
Title On the Sparsity of Spreading Sequences for NOMA with Reliability Guarantee and Detection Complexity Limitation
URI https://ieeexplore.ieee.org/document/8108689
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF7a4sGTSiu-mYNH0ybdzT6OUi1ebAst0lvZxwR6SUtNBf-9u5tYEbx4W8JAYGY3M5n9vvkIuecmYwVqTKyvxROGqUyM8j-u2kjnmHIFlzaKTYjJRC6XatYiDwcuDCJG8Bn2wzLe5buN3YdW2UAGWSCp2qQtBK-5Wg3pN0vV4G0xqpthAbAl-o3xL9WUmDTGJ_973Snp_bDvYHbIK2ekhWWXlNMSfK0G862OMArYFH69qyHwMP8GRIOvQWEyfX2E0GCFADiuB3F_QtgMwY0IunTwhFUEYZUQvghhKqY3iWynGKoeWYyfF6OXpNFKSNYqrRKZG8OFyZBjbv0x9GnbUEULzYfFUFOmdKaM9LUJNzpFKSkThRMCM62ztEiRnpNOuSnxgkDmqBVWSaTOMJHzoC-ptczzHKkyKbsk3eCq1baehrFqvHT19-NrchyiUYOrbkin2u3xlhzZj2r9vruLIfwCjb2htA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA5zCnpS2cTf5uDRbumSNslRpmPi1g1WZLeRNK-wSzdmJ_jfm6R1InjxFsqDwntJ3-vL970PoftYhywHBUFma_GAARGBlvbHVWlhDJMmj0XmxSZ4koj5XE4b6GHHhQEADz6Djlv6u3yzyrauVdYVThZIyD20HzHWIxVbq6b9hkR239J-1Q5zkC3eqc1_6ab4tDE4_t8LT1D7h3-Hp7vMcooaULRQMSmwrdbwbK08kAKvcrveVCB4PPuGRGNbheJkMn7ErsWKHeS4GsX9id12cI4ErAqDn6D0MKwCu2-Cm4tpTTzfyQerjdLBc9ofBrVaQrCUpAxEpHXMdQgxRJk9iDZxayppruJe3lOUSRVKLWx1EmtFQAjKeG44h1CpkOQE6BlqFqsCzhEODc14JgVQoxmPYqcwqZSIogio1IRdoJZz1WJdzcNY1F66_PvxHTocpuPRYvSSvF6hIxeZCmp1jZrlZgs36CD7KJfvm1sfzi8h26T7
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%3Abook&rft.genre=proceeding&rft.title=2017+IEEE+85th+Vehicular+Technology+Conference+%28VTC+Spring%29&rft.atitle=On+the+Sparsity+of+Spreading+Sequences+for+NOMA+with+Reliability+Guarantee+and+Detection+Complexity+Limitation&rft.au=Ting+Qi&rft.au=Wei+Feng&rft.au=Youzheng+Wang&rft.date=2017-06-01&rft.pub=IEEE&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FVTCSpring.2017.8108689&rft.externalDocID=8108689