Computer Science – Information Theory
Scientific paper
2008-01-30
Computer Science
Information Theory
Scientific paper
In this paper we introduce a new class of codes for over-loaded synchronous wireless and optical CDMA systems which increases the number of users for fixed number of chips without introducing any errors. Equivalently, the chip rate can be reduced for a given number of users, which implies bandwidth reduction for downlink wireless systems. An upper bound for the maximum number of users for a given number of chips is derived. Also, lower and upper bounds for the sum channel capacity of a binary over-loaded CDMA are derived that can predict the existence of such over-loaded codes. We also propose a simplified maximum likelihood method for decoding these types of over-loaded codes. Although a high percentage of the over-loading factor degrades the system performance in noisy channels, simulation results show that this degradation is not significant. More importantly, for moderate values of Eb/N0 (in the range of 6-10 dB) or higher, the proposed codes perform much better than the binary Welch bound equality sequences.
Akbari Saieed
Alishahi Kasra
Marvasti Farokh
Pad Pedram
No associations
LandOfFree
A Class of Errorless Codes for Over-loaded Synchronous Wireless and Optical CDMA Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Class of Errorless Codes for Over-loaded Synchronous Wireless and Optical CDMA Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Class of Errorless Codes for Over-loaded Synchronous Wireless and Optical CDMA Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-122089