Direct sequence-code division multiple access (DS-CDMA) technique is used in cellular systems where users in the cell are separated from each other with their unique spreading codes. In recent times DS-CDMA has been used extensively. These systems suffers from multiple access interference (MAI) due to other users transmitting in the cell, channel inter symbol interference (ISI) due to multipath nature of channels in presence of additive white Gaussian noise(AWGN). Spreading codes play an important role in multiple access capacity of DS-CDMA system. M-sequences, gold sequences etc., has been traditionally used as spreading codes in DS-CDMA. These sequences are generated by shift registers and periodic in nature. So these sequences are less in number and also limits the security. This thesis presents an investigation on use of new type of sequences called chaotic sequences for DS-CDMA system. These sequences are generated by chaotic maps. First of all, chaotic sequences are easy to generate and store. Only a few parameters and functions are needed even for very long sequences. In addition, an enormous number of different sequences can be generated simply by changing its initial condition. . Chaotic sequences are deterministic, reproducible, uncorrelated and random-like, which can be very helpful in enhancing the security of transmission in communication. This Thesis investigates the performance of chaotic sequences in DS-CDMA communication systems using various receiver techniques. Extensive simulation studies demonstrate the performance of the different linear and nonlinear DS-CDMA receivers like RAKE receiver, matched filter (MF) receiver, minimum mean square error (MMSE) receiver and Volterra receiver using chaotic sequences and the performance have been compared with gold sequences.