Low-Complexity Decoder for Overloaded Uniquely Decodable Synchronous CDMA

no code implementations • 11 Jun 2018 • Michel Kulhandjian, Claude D'Amours, Hovannes Kulhandjian, Halim Yanikomeroglu, Dimitris A. Pados, Gurgen Khachatrian

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 Kamax 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.

Decoder