Improved Orthogonal Code Hopping Multiplexing Using Both Division and Hopping 


Vol. 33,  No. 3, pp. 277-285, Mar.  2008


PDF Full-Text
  Abstract

We previously proposed an Orthogonal Code Hopping Multiplexing (OCHM) scheme for statistical multiplexing on a synchronous downlink. OCHM enables a large number of users to share a limited number of code channels through statistical multiplexing. We here improve the performance of OCHM by prioritizing encoded symbols according to their importance using both the conventional code division and the previously proposed code hopping multiplexing schemes. Prioritization is useful for channel coding schemes with different levels of importance for encoded symbols such as turbo-codes. Scheme performance is evaluated by simulation in terms of the required Eb/N0 for a 1% block error rate.

  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]

J. K. Kwon, S. Park, D. K. Sung, "Improved Orthogonal Code Hopping Multiplexing Using Both Division and Hopping," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 3, pp. 277-285, 2008. DOI: .

[ACM Style]

Jae Kyun Kwon, Suwon Park, and Dan Keun Sung. 2008. Improved Orthogonal Code Hopping Multiplexing Using Both Division and Hopping. The Journal of Korean Institute of Communications and Information Sciences, 33, 3, (2008), 277-285. DOI: .

[KICS Style]

Jae Kyun Kwon, Suwon Park, Dan Keun Sung, "Improved Orthogonal Code Hopping Multiplexing Using Both Division and Hopping," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 3, pp. 277-285, 3. 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