| 一种新的OVSF码快速生成分配算法研究 |
| |
| 引用本文： | 王钢,张军,张其善.一种新的OVSF码快速生成分配算法研究[J].电子学报,2006,34(12):2282-2284. |
| |
| 作者姓名： | 王钢 张军 张其善 |
| |
| 作者单位： | 北京航空航天大学电子信息工程学院,北京 100083 |
| |
| 基金项目： | 国家自然科学基金，国家自然科学基金 |
| |
| 摘 要： | 本文利用复制方法提出一种新的OVSF码复制生成算法,并在此基础上,研究了非可重排和可重排两种情况下的OVSF码快速分配问题.利用复制生成的OVSF码字具有明显的异前置性特点,从而可以提高码字分配效率和减小硬件实现复杂度和降低呼叫阻塞率.
|
| 关 键 词： | 正交可变扩频因子码(OVSF) 复制 码分多址 |
| 文章编号： | 0372-2112（2006）12-2282-03 |
| 收稿时间： | 2006 |
| 修稿时间： | 20062006-01 |
A Novel Fast Construction and Allocation Algorithm for OVSF Codes |
| |
| WANG Gang,ZHANG Jun,ZHANG Qi-shan.A Novel Fast Construction and Allocation Algorithm for OVSF Codes[J].Acta Electronica Sinica,2006,34(12):2282-2284. |
| |
| Authors: | WANG Gang ZHANG Jun ZHANG Qi-shan |
| |
| Affiliation: | Department of Electronic Engineering,Beijing University of Aeronautics and Astronautics,Beijing 100083,China |
| |
| Abstract: | The representation of OVSF codes by copying is developed firstly. Based on this scheme, non-rearrange.able and rearrangeable compact assignment algorithms arc proposed. The two algorithms can dramatically reduce the call-blocking rate, as well as the hardware complcxity, and leave the system as flexible as possible after each code assignment. |
| |
| Keywords: | orthogonal variable spreading factor codes copy code division multiple access |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子学报》浏览原始摘要信息 |
|
点击此处可从《电子学报》下载全文 |
