Premium
Spreading‐code‐dependent bit error rate and capacity analysis for finite asynchronous CDMA systems
Author(s) -
Chen HsiaoHwa
Publication year - 1999
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/(sici)1099-1131(199901/02)12:1<49::aid-dac385>3.0.co;2-o
Subject(s) - computer science , code division multiple access , bit error rate , asynchronous communication , channel capacity , channel (broadcasting) , interference (communication) , code (set theory) , bernoulli's principle , gold code , algorithm , computer network , electronic engineering , spread spectrum , set (abstract data type) , engineering , programming language , aerospace engineering
Most CDMA systems serve only finite number of active users. Therefore, using Gaussian approximation to evaluate its performance is inappropriate. In such finite CDMA systems, the selection of spreading codes is of great importance because its performance is very much spreading‐code‐dependent. In this paper, a new algorithm based on multiple variable Bernoulli process is introduced to evaluate bit error rate due to co‐channel interference and thus the capacity of a CDMA system. The algorithm can also be used for large‐sized CDMA systems. The results show that small Kasami and Gold‐like codes offer higher capacity than the others do. Copyright © 1999 John Wiley & Sons, Ltd.