A novel code acquisition algorithm and its application to Markov spreading codes

In terms of bit error rate (BER) and synchronization performances, Markovian codes are superior to i.i.d. codes in asynchronous mode, for the single-user case. Their BER performance is better than i.i.d. codes also in the case of multiuser detection (MUD). The paper shows that a simple code acquisition scheme based on the statistical properties of spread spectrum (SS) codes efficiently makes the performance of Markov codes superior to i.i.d. codes in asynchronous MUD systems. Hence, Markov codes are a strong candidate for being SS codes in the MUD case as well. Furthermore, the proposed code acquisition scheme significantly outperforms conventional schemes.