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.

Additional Metadata
Keywords Optical code-division multiple-access, overloaded synchronous O-CDMA, uniquely decodable (errorless) codes
Persistent URL dx.doi.org/10.1109/WCNC.2019.8885608
Conference 2019 IEEE Wireless Communications and Networking Conference, WCNC 2019
Citation
Kulhandjian, M. (Michel), Kulhandjian, H. (Hovannes), D'Amours, C. (Claude), Yanikomeroglu, H, & Khachatrian, G. (Gurgen). (2019). Fast Decoder for Overloaded Uniquely Decodable Synchronous Optical CDMA. In IEEE Wireless Communications and Networking Conference, WCNC. doi:10.1109/WCNC.2019.8885608