Novel fast construction and allocation algorithm for OVSF codes

Gang Wang; Jun Zhang; Qi Shan Zhang

Novel fast construction and allocation algorithm for OVSF codes

Gang Wang^*
, Jun Zhang
, Qi Shan Zhang

^*Corresponding author for this work

School of Cyber Science and Technology

Beihang University

Research output: Contribution to journal › Article › peer-review

Abstract

The representation of OVSF codes by copying is developed firstly. Based on this scheme, non-rearrangeable and rearrangeable compact assignment algorithms are proposed. The two algorithms can dramatically reduce the call-blocking rate, as well as the hardware complexity, and leave the system as flexible as possible after each code assignment.

Original language	English
Pages (from-to)	2282-2284
Number of pages	3
Journal	Tien Tzu Hsueh Pao/Acta Electronica Sinica
Volume	34
Issue number	12
State	Published - Dec 2006

Keywords

Code division multiple access
Copy
Orthogonal variable spreading factor codes

Cite this

@article{1d6d0d74be8343feb47086e59c474570,

title = "Novel fast construction and allocation algorithm for OVSF codes",

abstract = "The representation of OVSF codes by copying is developed firstly. Based on this scheme, non-rearrangeable and rearrangeable compact assignment algorithms are proposed. The two algorithms can dramatically reduce the call-blocking rate, as well as the hardware complexity, and leave the system as flexible as possible after each code assignment.",

keywords = "Code division multiple access, Copy, Orthogonal variable spreading factor codes",

author = "Gang Wang and Jun Zhang and Zhang, \{Qi Shan\}",

year = "2006",

month = dec,

language = "英语",

volume = "34",

pages = "2282--2284",

journal = "Tien Tzu Hsueh Pao/Acta Electronica Sinica",

issn = "0372-2112",

publisher = "Chinese Institute of Electronics",

number = "12",

}

TY - JOUR

T1 - Novel fast construction and allocation algorithm for OVSF codes

AU - Wang, Gang

AU - Zhang, Jun

AU - Zhang, Qi Shan

PY - 2006/12

Y1 - 2006/12

N2 - The representation of OVSF codes by copying is developed firstly. Based on this scheme, non-rearrangeable and rearrangeable compact assignment algorithms are proposed. The two algorithms can dramatically reduce the call-blocking rate, as well as the hardware complexity, and leave the system as flexible as possible after each code assignment.

AB - The representation of OVSF codes by copying is developed firstly. Based on this scheme, non-rearrangeable and rearrangeable compact assignment algorithms are proposed. The two algorithms can dramatically reduce the call-blocking rate, as well as the hardware complexity, and leave the system as flexible as possible after each code assignment.

KW - Code division multiple access

KW - Copy

KW - Orthogonal variable spreading factor codes

UR - https://www.scopus.com/pages/publications/33847266784

M3 - 文章

AN - SCOPUS:33847266784

SN - 0372-2112

VL - 34

SP - 2282

EP - 2284

JO - Tien Tzu Hsueh Pao/Acta Electronica Sinica

JF - Tien Tzu Hsueh Pao/Acta Electronica Sinica

IS - 12

ER -

Novel fast construction and allocation algorithm for OVSF codes

Abstract

Keywords

Other files and links

Fingerprint

Cite this