Skip to main content

A Novel Codebook Design Scheme for Sparse Code Multiple Access

  • Conference paper
  • First Online:
IoT as a Service (IoTaaS 2020)

Abstract

The sparse code multiple access (SCMA) technology proposed by Huawei has become a very competitive one of many NOMA solutions due to its high overload capability. SCMA maps the user’s binary bit data input by the system’s sending end into a multi-dimensional complex number sequence through a pre-designed codebook, instead of the modulation and spreading in the orthogonal multiple access scheme. Based on the sparsity of codewords, the receiving end uses the Message Passing Algorithm (MPA) for multi-user detection. Among them, the excellent SCMA codebook can effectively improve the performance of the system under limited spectrum resources. Therefore, this paper conducts detailed research on the SCMA codebook design scheme. First, this article introduces the principle of the SCMA system in detail, and then proposes a SCMA codebook design method, including the design of the mapping matrix, the design of the mother constellation and the constellation operator. Among them, the mother constellation design adopts a reorganized multi-dimensional constellation scheme. The constellation operator obtains the user constellations of different users through phase rotation, and then maps the designed user constellations into a codebook through a mapping matrix. The simulation results show that the performance of this design is better than the sample codebook given by Huawei.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. SCMA: massive connectivity & low latency. http://www.innovateasia.com/5g/gp2.html. Accessed 15 June 2016

  2. Boutros, J., Viterbo, E.: Signal space diversity: a power- and bandwidth-efficient diversity technique for the Rayleigh fading channel. IEEE Trans. Inf. Theo. 44(4), 1453–1467 (2002)

    Article  MathSciNet  Google Scholar 

  3. Zhi-Xin, L., Jing, L., Ling, Y.: Optimal design of APSK constellation for satellite channel. Aerosp. Shanghai 023(005), 33–37 (2006)

    Google Scholar 

  4. Shao, K., et al.: SCMA codebook optimization method based on phase rotation. Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Syst. Eng. Electron. 40(10), 2354–2362 (2018)

    Google Scholar 

  5. Taherzadeh, M., et al.: SCMA codebook design. In: IEEE Vehicular Technology Conference. IEEE (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Huanzhu Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, H., Yu, P., Yan, Y. (2021). A Novel Codebook Design Scheme for Sparse Code Multiple Access. In: Li, B., Li, C., Yang, M., Yan, Z., Zheng, J. (eds) IoT as a Service. IoTaaS 2020. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 346. Springer, Cham. https://doi.org/10.1007/978-3-030-67514-1_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-67514-1_55

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-67513-4

  • Online ISBN: 978-3-030-67514-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics