Novel Power-Imbalanced Dense Codebooks for Reliable Multiplexing in Nakagami Channels

09/07/2023
by   Yiming Gui, et al.
0

This paper studies enhanced dense code multiple access (DCMA) system design for downlink transmission over the Nakagami-m fading channels. By studying the DCMA pairwise error probability (PEP) in a Nakagami-m channel, a novel design metric called minimum logarithmic sum distance (MLSD) is first derived. With respect to the proposed MLSD, we introduce a new family of power-imbalanced dense codebooks by deleting certain rows of a special non-unimodular circulant matrix. Simulation results demonstrate that our proposed dense codebooks lead to both larger minimum Euclidean distance and MLSD, thus yielding significant improvements of error performance over the existing sparse code multiple access and conventional unimodular DCMA schemes in Nakagami-m fading channels under different overloading factors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/07/2020

Design of Power-Imbalanced SCMA Codebook

Sparse code multiple access (SCMA) is a promising multiuser communicatio...
research
08/25/2023

Enhancing Signal Space Diversity for SCMA Over Rayleigh Fading Channels

Sparse code multiple access (SCMA) is a promising technique for the enab...
research
01/09/2021

Downlink SCMA Codebook Design with Low Error Rate by Maximizing Minimum Euclidean Distance of Superimposed Codewords

Sparse code multiple access (SCMA), as a codebook-based non-orthogonal m...
research
09/25/2019

Power-Imbalanced Low-Density Signatures (LDS) From Eisenstein Numbers

As a special case of sparse code multiple access (SCMA), low-density sig...
research
08/05/2022

A Design of Low-Projection SCMA Codebooks for Downlink Satellite Internet of Things

This paper presents a systematic investigation on codebook design of spa...
research
12/05/2021

Designing Enhanced Multi-dimensional Constellations for Code-Domain NOMA

This paper presents an enhanced design of multi-dimensional (MD) constel...
research
07/08/2019

Distributed Approximation of Functions over Fast Fading Channels with Applications to Distributed Learning and the Max-Consensus Problem

In this work, we consider the problem of distributed approximation of fu...

Please sign up or login with your details

Forgot password? Click here to reset