Improved and distributive code assignment technique for interference-free CDMA network

Code assignment In the CDMA network has been a major area of study concerned with more spatial use of the codes and reduced interferences in the network. Some of the major code assignment techniques that have been proposed so far are mainly RCA, TCA, PCA and hybrid TCA-PCA. Each of these code assignment techniques face some interferences after the code assignment. In this paper, we have discussed about the best improvements one can perform in-order to reduce the interferences faced in the network to zero while also showing the trade-off one would face in terms of number of codes used in the network. It has been shown that the code requirement of i-PCA will vary from (2(Δ) +3) to (2(2(Δ) +3)) and 2(Δ) +1 to 3(Δ) +1 for i-TCA-PCA Hybrid. The second part of paper discusses a new distributive algorithm which is based on the principles of deadlock free algorithm. Using this an increased throughput in terms of memory and total time of assignment has been achieved.