Name
Abstract | ||
|---|---|---|
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-max(a) 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-max(a) for L = 8. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/ACCESS.2022.3170491 | IEEE ACCESS |
Keywords | DocType | Volume |
Uniquely decodable (UD) codes, overloaded CDMA, overloaded binary and ternary spreading spreading codes | Journal | 10 |
ISSN | Citations | PageRank |
2169-3536 | 0 | 0.34 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michel Kulhandjian | 1 | 0 | 1.35 |
| Hovannes Kulhandjian | 2 | 0 | 1.01 |
| Claude D'Amours | 3 | 0 | 2.70 |
| Halim Yanikomeroglu | 4 | 4413 | 367.42 |
| Dimitris Pados | 5 | 208 | 26.49 |
| Gurgen Khachatrian | 6 | 0 | 0.34 |