Search arXivSearch

arXiv · 2305.11959

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

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianjian Wu, Chi-Tsun Cheng, Qingfeng Zhou, Jianlin Liang, Jinke Wu. 2025-06-13. SBMA: A Multiple Access Scheme Combining SCMA and BIA for MU-MISO. https://doi.org/10.1109/jiot.2025.3609063

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT