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

Tahir Abbas Khan, Nobuoki Eshima, Yutaka Jitsumatsu, Tohru Kohda

Research output: Contribution to journalConference article

Abstract

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

Original languageEnglish
Article number1465022
Pages (from-to)2056-2059
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
DOIs
Publication statusPublished - Dec 1 2005
EventIEEE International Symposium on Circuits and Systems 2005, ISCAS 2005 - Kobe, Japan
Duration: May 23 2005May 26 2005

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A novel code acquisition algorithm and its application to markov spreading codes'. Together they form a unique fingerprint.

  • Cite this