OVSF Code Detection Based on Likelihood Scores 


Vol. 45,  No. 3, pp. 562-567, Mar.  2020
10.7840/kics.2020.45.3.562


PDF Full-Text
  Abstract

In this paper, we present a maximum likelihood detection method of OVSF codes used in WCDMA systems. We investigate the probability distribution of CDP for each code investigated and devise a threshold that is used to determine the existence of an OVSF code in the first stage of the code search. In the second stage, the searched codes at the first stage are grouped according to whether they have a parent-children relationship in the OVSF code tree. And with likelihood scores computed for the codes in a code group, the code that has the maximum value is determined to be used in the group. With computer simulation, we show that the proposed method provides better detection probability and lower false alarm probability.

  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]

Y. Choi, D. Jeong, B. Mun, W. Choe, D. Kim, "OVSF Code Detection Based on Likelihood Scores," The Journal of Korean Institute of Communications and Information Sciences, vol. 45, no. 3, pp. 562-567, 2020. DOI: 10.7840/kics.2020.45.3.562.

[ACM Style]

Yunsung Choi, Dae-Kyo Jeong, Byung-ho Mun, Won-seok Choe, and Dongwoo Kim. 2020. OVSF Code Detection Based on Likelihood Scores. The Journal of Korean Institute of Communications and Information Sciences, 45, 3, (2020), 562-567. DOI: 10.7840/kics.2020.45.3.562.

[KICS Style]

Yunsung Choi, Dae-Kyo Jeong, Byung-ho Mun, Won-seok Choe, Dongwoo Kim, "OVSF Code Detection Based on Likelihood Scores," The Journal of Korean Institute of Communications and Information Sciences, vol. 45, no. 3, pp. 562-567, 3. 2020. (https://doi.org/10.7840/kics.2020.45.3.562)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880