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

Fingerprint

Multiuser detection
Bit error rate
Synchronization
code

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

A novel code acquisition algorithm and its application to markov spreading codes. / Khan, Tahir Abbas; Eshima, Nobuoki; Jitsumatsu, Yutaka; Kohda, Tohru.

In: Proceedings - IEEE International Symposium on Circuits and Systems, 01.12.2005, p. 2056-2059.

Research output: Contribution to journalConference article

@article{fe1b3d88eb684fcca707ab51e01b162d,
title = "A novel code acquisition algorithm and its application to markov spreading codes",
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.",
author = "Khan, {Tahir Abbas} and Nobuoki Eshima and Yutaka Jitsumatsu and Tohru Kohda",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/ISCAS.2005.1465022",
language = "English",
pages = "2056--2059",
journal = "Proceedings - IEEE International Symposium on Circuits and Systems",
issn = "0271-4310",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

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

AU - Khan, Tahir Abbas

AU - Eshima, Nobuoki

AU - Jitsumatsu, Yutaka

AU - Kohda, Tohru

PY - 2005/12/1

Y1 - 2005/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=67649126704&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67649126704&partnerID=8YFLogxK

U2 - 10.1109/ISCAS.2005.1465022

DO - 10.1109/ISCAS.2005.1465022

M3 - Conference article

AN - SCOPUS:67649126704

SP - 2056

EP - 2059

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

M1 - 1465022

ER -