Uniquely Decodable Ternary Codes for Synchronous CDMA Systems
| Autor: | Michel Kulhandjian, Hovannes Kulhandjian, Claude D'Amours |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
FOS: Computer and information sciences
Synchronous CDMA Code division multiple access Computer science Computer Science - Information Theory Information Theory (cs.IT) 020302 automobile design & engineering 020206 networking & telecommunications 02 engineering and technology Data_CODINGANDINFORMATIONTHEORY Multiplexing symbols.namesake Ternary Golay code Additive white Gaussian noise 0203 mechanical engineering Transmission (telecommunications) 0202 electrical engineering electronic engineering information engineering Code (cryptography) symbols Algorithm Computer Science::Information Theory |
| Zdroj: | PIMRC |
| DOI: | 10.48550/arxiv.1902.09526 |
| Popis: | In this paper, we consider the problem of recursively designing uniquely decodable ternary code sets for highly overloaded synchronous code-division multiple-access (CDMA) systems. The proposed code set achieves larger number of users $K < K_{max}^t$ than any other known state-of-the-art ternary codes that offer low-complexity decoders in the noisy transmission. Moreover, we propose a simple decoder that uses only a few comparisons and can allow the user to uniquely recover the information bits. Compared to maximum likelihood (ML) decoder, which has a high computational complexity for even moderate code length, the proposed decoder has much lower computational complexity. We also derived the computational complexity of the proposed recursive decoder analytically. Simulation results show that the performance of the proposed decoder is almost as good as the ML decoder. arXiv admin note: text overlap with arXiv:1806.03958 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|