Synchronous CDMA based on the cyclical translations of a CAZAC sequence

A new scheme of synchronous CDMA is introduced in the paper. The new scheme is based on a code made by all the cyclical translations of a basic sequence having constant amplitude and white discrete spectrum. Such a code is proposed here for the first time as a code for CDMA. According to the proposed scheme, a cyclic prefix is appended to the multiplexed signal. The proposed scheme has a property that none of the known CDMA schemes has: in a multipath environment, it allows multiuser interference to become cyclic intersymbol interference. Noticeably, the memory of the finite state machine that describes the ISI model is equal to memory of the multipath channel. The main advantage of our proposed scheme is that optimal and suboptimal detectors can be obtained from detectors proposed in the past for the ISI channel, which are much easier to implement than conventional multiuser detectors of classical CDMA schemes. Another advantage of our scheme is that it leads naturally to a signal processing architecture similar to that of OFDM systems, hence based on the efficient FFT/IFFT algorithm.