In this paper, we propose simple and efficient algorithms for the code timing acquisition in the direct-sequence code-division multiple-access communication system. The essential assumption is that a preamble or an unmodulated pilot channel is available for the desired user. Then the correlation matrix R(tau) of the sampled data, where tau is suitably chosen time lag, contains the timing information only of desired user, while the contributions of uncorrelated interferers and noise are suppressed out. Hence, compared to the conventional approach, more interference suppression is achieved. Coarse;delay estimates are then obtained by matched filter (MF) or multiple signal classification-type approaches. In the latter case, only L eigenvectors are computed, where L is the number of resolvable paths. If only one path exists, an additional procedure is proposed to both approaches, by which the estimation accuracy is greatly improved with negligible increase in computation, More precisely, the chip timing offset due to chip-asynchronous sampling can be determined by solving a system of two second-order polynomials for each chip interval. Therefore. only at most 2C hypotheses are needed, where C is the processing gain. All the proposed methods are computationally quite simple, containing mainly MF-operations, or at most computation of only few eigenvectors. Mean acquisition time analysis is carried out semianalytically. Numerical experiments speaks for the possibility of achieving significant performance gains compared to conventional acquisition, especially in the presence of strong multiple-access interference, making them attractive options to be attached for the next generation mobile receivers.