Based On Chaos Optimization Of Cdma Multi-user Detection

Verdu derives the ideal of Multi-user Detection in 1986 .The Multiple Access Interference, he deemed it has available information in certainly structure. Adopted by the MLSD in the theoretical, it has many good abilities, such as its capability close with the single user's, near-far resistance, raised the capacity of the system. Thereby come to operate the MUD's research.The research of chaos is less then 20 years. Though there are a lot of conceptions, it does not attain maturity. To apply in the woks, there are many problems in theory and technology. Firstly, this paper presents some mature theorems of chaos. Chaos often exists in nonlinear system; it has many good properties, such as ergodicity, stochastic and so on. A chaos motion can go nonrepeatedly through every stated in a certain domain. Secondly, this paper discusses the progress of the communications with chaos and the capacity's analysis of the MUD in the CDMA. Thirdly, this paper emphasizes the elemental theorems, methodology, and development in the future of the MUD in the CDMA. A chaos search for implementing optimal multi-user detection in CDMA system has been proposed.Computer simulation illustrated that this way has many powerful abilities. Its capability is better than the traditional detection and the multi-series detection, it is near to the OMD which was presented by Verdu, and then its beginning condition is insensitivity, near-far insensitivity, eliminate interference, it can converge to global minimum point and hold down the noise interference. The complication of computation of this way is lower; it is a new direction of the optimal multi-user detection in CDMA system.