Adaptive Code Assignment Algorithm for a Multi-User/Multi-Rate CDMA System
Summary :
Code division multiple access (CDMA) technique is used widely since it can flexibly support multi-rate multi-media services by changing the number of orthogonal spreading codes. In this paper, we present a new adaptive code assignment algorithm, which consists of three steps: reserved-space, improved-crowded-first-space, and multi-code combination to fully use the code space. Compared with the existing algorithms, the proposed algorithm can avoid the code blocking problem and lower its total blocking probability while keeping its computational complexity relatively low. Simulation results show that increasing the free space reduces the average total blocking probability while increasing the blocking probability of high rate users.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E92-B No.5 pp.1600-1607
- Publication Date
- 2009/05/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E92.B.1600
- Type of Manuscript
- Special Section PAPER (Special Section on Radio Access Techniques for 3G Evolution)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Qiyue YU, Fumiyuki ADACHI, Weixiao MENG, "Adaptive Code Assignment Algorithm for a Multi-User/Multi-Rate CDMA System" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 5, pp. 1600-1607, May 2009, doi: 10.1587/transcom.E92.B.1600.
Abstract: Code division multiple access (CDMA) technique is used widely since it can flexibly support multi-rate multi-media services by changing the number of orthogonal spreading codes. In this paper, we present a new adaptive code assignment algorithm, which consists of three steps: reserved-space, improved-crowded-first-space, and multi-code combination to fully use the code space. Compared with the existing algorithms, the proposed algorithm can avoid the code blocking problem and lower its total blocking probability while keeping its computational complexity relatively low. Simulation results show that increasing the free space reduces the average total blocking probability while increasing the blocking probability of high rate users.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.1600/_p
Copy
@ARTICLE{e92-b_5_1600,
author={Qiyue YU, Fumiyuki ADACHI, Weixiao MENG, },
journal={IEICE TRANSACTIONS on Communications},
title={Adaptive Code Assignment Algorithm for a Multi-User/Multi-Rate CDMA System},
year={2009},
volume={E92-B},
number={5},
pages={1600-1607},
abstract={Code division multiple access (CDMA) technique is used widely since it can flexibly support multi-rate multi-media services by changing the number of orthogonal spreading codes. In this paper, we present a new adaptive code assignment algorithm, which consists of three steps: reserved-space, improved-crowded-first-space, and multi-code combination to fully use the code space. Compared with the existing algorithms, the proposed algorithm can avoid the code blocking problem and lower its total blocking probability while keeping its computational complexity relatively low. Simulation results show that increasing the free space reduces the average total blocking probability while increasing the blocking probability of high rate users.},
keywords={},
doi={10.1587/transcom.E92.B.1600},
ISSN={1745-1345},
month={May},}
Copy
TY - JOUR
TI - Adaptive Code Assignment Algorithm for a Multi-User/Multi-Rate CDMA System
T2 - IEICE TRANSACTIONS on Communications
SP - 1600
EP - 1607
AU - Qiyue YU
AU - Fumiyuki ADACHI
AU - Weixiao MENG
PY - 2009
DO - 10.1587/transcom.E92.B.1600
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2009
AB - Code division multiple access (CDMA) technique is used widely since it can flexibly support multi-rate multi-media services by changing the number of orthogonal spreading codes. In this paper, we present a new adaptive code assignment algorithm, which consists of three steps: reserved-space, improved-crowded-first-space, and multi-code combination to fully use the code space. Compared with the existing algorithms, the proposed algorithm can avoid the code blocking problem and lower its total blocking probability while keeping its computational complexity relatively low. Simulation results show that increasing the free space reduces the average total blocking probability while increasing the blocking probability of high rate users.
ER -
English
