Low-Density Spreading Codes for NOMA Systems and a Gaussian Separability-Based Design

Kulhandjian, Michel; Kulhandjian, Hovannes; D’Amours, Claude; Hanzo, Lajos

doi:10.1109/access.2021.3060879

Cited by 10 publications

(7 citation statements)

References 133 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…6, 7 and 5. In our simulations, we compare the FDA with the MMSE-PIC [40], slab-sphere [63], PDA [53] and ML detectors for binary phase-shift keying (BPSK) modulation, which are characterized in Figs. 8, 9 and 10.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…Recently, several NOMA solutions have been actively investigated [2], which can be basically divided into two main categories, namely power-domain and code-domain NOMA. A few of the strong contenders of code-domain NOMA are low-density spreading aided CDMA (LDS-CDMA) [39], [40] and sparse code multiple access (SCMA) [41], [42]. LDS-CDMA [39], [40] must generally guarantee to be UD code set [43], which means non-zero Euclidean distance.…”

Section: Introductionmentioning

confidence: 99%

“…A few of the strong contenders of code-domain NOMA are low-density spreading aided CDMA (LDS-CDMA) [39], [40] and sparse code multiple access (SCMA) [41], [42]. LDS-CDMA [39], [40] must generally guarantee to be UD code set [43], which means non-zero Euclidean distance. The design of LDS type matrices offers flexible resource allocation, performs better in terms of handling the MAI that exists in rank-deficient systems and has low-complexity receivers compared to conventional CDMA.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA

et al. 2022

Self Cite

View full text Add to dashboard Cite

We consider the problem of designing a low-complexity decoder for antipodal uniquely decodable (UD) /errorless code sets for overloaded synchronous code-division multiple access (CDMA) systems, where the number of signals K a max is the largest known for the given code length L. In our complexity analysis, we illustrate that compared to maximum-likelihood (ML) decoder, which has an exponential computational complexity for even moderate code lengths, the proposed decoder has a quasi-quadratic computational complexity. Simulation results in terms of bit-error-rate (BER) demonstrate that the performance of the proposed decoder has only a 1 − 2 dB degradation in signal-to-noise ratio (SNR) at a BER of 10 −3 when compared to ML. Moreover, we derive the proof of the minimum Manhattan distance of such UD codes and we provide the proofs for the propositions; these proofs constitute the foundation of the formal proof for the maximum number users K a max for L = 8.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA

et al. 2022

Self Cite

View full text Add to dashboard Cite

show abstract

“…1 -3. In addition, the BER hinges not only on the minimum distance criterion, but also on the average Gaussian separability margin [16]. Simulations were performed over the AWGN and Rayleigh fading channels with the fading rate of the symbol duration.…”

Section: Designsmentioning

confidence: 99%

“…Simulations were performed over the AWGN and Rayleigh fading channels with the fading rate of the symbol duration. We can apply transmitter precoding scheme for frequency selective channels [16]. In our simulations, we utilized LDS spreading codes of sizes 1 shows that when no error control coding is used, SCMA performs better than LDS using our proposed LDS codes at high / 0 in Rayleigh fading.…”

Section: Designsmentioning

confidence: 99%

Low-Density Spreading Design Based on an Algebraic Scheme for NOMA Systems

Millar¹,

Kulhandjian²,

Alaca³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

In this paper, a code-domain nonorthogonal multiple access (NOMA) technique based on an algebraic design is studied. We propose an improved low-density spreading (LDS) sequence design based on projective geometry. In terms of its bit error rate (BER) performance, our proposed improved LDS code set outperforms the existing LDS designs over the frequencynonselective Rayleigh fading and additive white Gaussian noise (AWGN) channels. We demonstrated that achieving the best BER depends on the minimum distance.

show abstract