Sum Capacity Bounds and Design of Suboptimal Codes for Asynchronous CDMA Systems

Abstract

In this paper, we study two issues in asynchronous communication systems. The first issue is the derivation of sum capacity bounds for finite dimensional asynchronous systems. In addition, asymptotic results for the sum capacity bounds are obtained. The second issue is the design of practical suboptimal codes for binary chip asynchronous CDMA systems that become optimal for high Signal-to-Noise (SNR) ratios. The performance of such suboptimal codes is also compared to Gold and Optical Orthogonal codes. The conclusion is that the proposed suboptimal codes perform favorably compared to other known codes for high SNR asynchronous systems and perform more or less the same as the other codes for the low SNR values.