Fast Decoder for Overloaded Uniquely Decodable Synchronous Optical CDMA

In this paper, we propose a fast decoder algorithm for uniquely decodable (errorless) code sets for overloaded synchronous optical code-division multiple-access (O-CDMA) systems. The proposed decoder is designed in a such a way that the users can uniquely recover the information bits with a very simple decoder, which uses only a few comparisons. Compared to maximum-likelihood (ML) decoder, which has a high computational complexity for even moderate code lengths, the proposed decoder has much lower computational complexity. Simulation results in terms of bit error rate (BER) demonstrate that the performance of the proposed decoder for a given BER requires only 1-2 dB higher signal-to-noise ratio (SNR) than the ML decoder.Comment: arXiv admin note: substantial text overlap with arXiv:1806.0395

Uniquely Decodable Ternary Codes for Synchronous CDMA Systems

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.Comment: arXiv admin note: text overlap with arXiv:1806.0395

Fast Decoder for Overloaded Uniquely Decodable Synchronous CDMA

We consider the problem of designing a fast decoder for antipodal uniquely decodable (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. The proposed decoder is designed in a such a way that the users can uniquely recover the information bits with a very simple decoder, which uses only a few comparisons. Compared to maximum-likelihood (ML) decoder, which has a high computational complexity for even moderate code length, the proposed decoder has a much lower computational complexity. Simulation results in terms of bit error rate (BER) demonstrate that the performance of the proposed decoder only has a 1-2 dB degradation at BER of 10^{-3} when compared to ML