Fast OVSF Code Generation Method using Multi-Stage Spreading Scheme 


Vol. 29,  No. 10, pp. 1123-1130, Oct.  2004


PDF
  Abstract

This paper proposes the fast QVSF code generation method using the multi-stage spreading scheme based on the single code indexing scheme The conventional OVSF indexing scheme based on the code-tree structure uses two numbers as the code word indices, the layer number and the code number of the corresponding layer However, the single code index number implicitly includes the information of the spreading factor as well as the code number. Since the binary representation of the single code indices shows the pattern of the code word, the orthogonality between two different code words can be determined by comparing their code indices instead of much longer code words The above useful property also makes the code word can be generated directly from its single code index In this paper, the multi-stage spreading scheme 15 applied to generate the long code by spreading two shorter code words with the appropriate code indices The proposed fast code generation algorithm is designed for 3GPP UMTS systems and verified by the simulations

  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]

C. Choi, T. Kim, Y. Kim, H. Joung, "Fast OVSF Code Generation Method using Multi-Stage Spreading Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 10, pp. 1123-1130, 2004. DOI: .

[ACM Style]

Changsoon Choi, Taehoon Kim, Younglok Kim, and Hwayong Joung. 2004. Fast OVSF Code Generation Method using Multi-Stage Spreading Scheme. The Journal of Korean Institute of Communications and Information Sciences, 29, 10, (2004), 1123-1130. DOI: .

[KICS Style]

Changsoon Choi, Taehoon Kim, Younglok Kim, Hwayong Joung, "Fast OVSF Code Generation Method using Multi-Stage Spreading Scheme," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 10, pp. 1123-1130, 10. 2004.