In this paper, we present models for the code acquisition process in Rake receivers. These models include multipath diversity, multiple transmitter (base station or satellite) diversity, and multiple access interference generated by other users in the network, This results in a different probability of false alarm for each cell of the code delay uncertainty region. The analysis is based on signal flow graph theory By using these models, we elaborate different strategies for Rake receiver synchronization and derive exact closed-form results for the average acquisition time. These strategies differ in how they organize initial (first Rake finger) and postinitial search algorithms. If the channel is known, the initial synchronization may organize a parallel search for all fingers simultaneously by a proper set up of the local correlators' mutual delays. If not, then a serial search of different segments (partitioned among the different fingers) can be organized. In the postinitial search, sequential or random initializations are possible. A set of approximations is also included for practical applications where a quick assessment of the system performance is needed.