Papers
Topics
Authors
Recent
Search
2000 character limit reached

SBMA: A Multiple Access Scheme Combining SCMA and BIA for MU-MISO

Published 19 May 2023 in cs.IT, eess.SP, and math.IT | (2305.11959v4)

Abstract: Sparse Code Multiple Access (SCMA) and Blind Interference Alignment (BIA) are key enablers for multi-user communication, yet each suffers from distinct limitations: SCMA faces high complexity and limited multiplexing gain, while BIA requires a long temporal channel pattern and incurs significant decoding delay. This paper proposes SBMA (Sparsecode-and-BIA-based Multiple Access), a novel framework that synergizes SCMA's diversity and BIA's multiplexing while addressing their drawbacks. We design two decoders: a low-complexity two-stage decoder (Zero-forcing + Message Passing Algorithm (MPA)) and a Joint MPA (JMPA) decoder leveraging a virtual factor graph for improved BER. Theoretical analysis derives closed-form BER expressions for a 6-user 2x1 MISO system, validated by simulations. Compared to existing schemes, SBMA with JMPA achieves a diversity gain equivalent to STBC-SCMA and a multiplexing gain comparable to BIA, while simultaneously offering enhanced privacy (relative to STBC-SCMA) and reduced reliance on channel coherence time (compared to BIA). These advancements position SBMA as a compelling solution for next-generation wireless communication systems, particularly in IoT applications demanding high throughput, robust data privacy, and adaptability to dynamic channel conditions.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.