Low-Complexity Codebook Design for SCMA-Based Visible Light Communication
Open Access
- 11 January 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 3, 106-118
Abstract
Sparse code multiple access (SCMA), as a code-domain non-orthogonal multiple access (NOMA) scheme, has received considerable research attention for enabling massive connectivity in future wireless communication systems. In this paper, we present a novel codebook (CB) design for SCMA based visible light communication (VLC) system, which suffers from shot noise. In particular, we introduce an iterative algorithm for designing and optimizing CB by considering the impact of shot noise at the VLC receiver. Based on the proposed CB, we derive and analyze the theoretical bit error rate (BER) expression for the resultant SCMA-VLC system. The simulation results show that our proposed CBs outperform CBs in the existing literature for different loading factors with much less complexity. Further, the derived analytical BER expression well aligns with simulated results, especially in high signal power regions.Keywords
All Related Versions
Funding Information
- SPARC from the Ministry of Education, Government of India (SPARC/2018-2019/P950/SL)
- TCS Research Scholarship Program
This publication has 44 references indexed in Scilit:
- On Fixed-Point Implementation of Log-MPA for SCMA SignalsIEEE Wireless Communications Letters, 2016
- Low Complexity Techniques for SCMA Detection2015
- Low‐complexity colour‐shift keying‐based visible light communications systemIET Optoelectronics, 2015
- Non-Orthogonal Multiple Access for Visible Light CommunicationsIEEE Photonics Technology Letters, 2015
- SCMA Codebook Design2014
- Sparse code multiple access2013
- Constellation design for color-shift keying using interior point methods2012
- Stochastic Properties of the Random Waypoint Mobility ModelWireless Networks, 2004
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Solution of minimax problems using equivalent differentiable functionsComputers & Mathematics with Applications, 1985