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 |
| Publication status | Published - Dec 2006 |
| Externally published | Yes |
Keywords
- Code division multiple access
- Copy
- Orthogonal variable spreading factor codes