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

^*此作品的通讯作者

Beihang University

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

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.

源语言	英语
页（从-至）	2282-2284
页数	3
期刊	Tien Tzu Hsueh Pao/Acta Electronica Sinica
卷	34
期	12
出版状态	已出版 - 12月 2006
已对外发布	是

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{acc7ffad564641c187bce7b5c3b05b2d,

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 = "English",

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 - Article

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

摘要

其它文件与链接

指纹

引用此