摘要
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 |
| 已对外发布 | 是 |