An Optical CDMA Code Acquisition Algorithm Using Multiple Thresholds 


Vol. 33,  No. 12, pp. 1075-1081, Dec.  2008


PDF Full-Text
  Abstract

In this paper, we propose a code acquisition algorithm using optical orthogonal code (OOC) for optical code division multiple access (CDMA) systems. Generally, a good code acquisition algorithm offers short mean acquisition time (MAT). The conventional multiple-shift (MS) algorithm consists of two stages and has shorter MAT than that of well-known serial-search (SS) algorithm. This paper proposes a novel code acquisition algorithm called enhanced multiple-shift (EMS) algorithm. By using multiple thresholds, the proposed EMS algorithm provides shorter MAT compared with that of the MS algorithm. The simulation results show that the EMS algorithm presents shorter MAT compared with the MS algorithm in both single-user and multi-user environments.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

D. Chong, Y. Lee, S. Ahn, S. R. Lee, S. Yoon, "An Optical CDMA Code Acquisition Algorithm Using Multiple Thresholds," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 12, pp. 1075-1081, 2008. DOI: .

[ACM Style]

Dahae Chong, Youngyoon Lee, Sangho Ahn, Seong Ro Lee, and Seokho Yoon. 2008. An Optical CDMA Code Acquisition Algorithm Using Multiple Thresholds. The Journal of Korean Institute of Communications and Information Sciences, 33, 12, (2008), 1075-1081. DOI: .

[KICS Style]

Dahae Chong, Youngyoon Lee, Sangho Ahn, Seong Ro Lee, Seokho Yoon, "An Optical CDMA Code Acquisition Algorithm Using Multiple Thresholds," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 12, pp. 1075-1081, 12. 2008.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880