DocumentCode
3483247
Title
Sequential chaotic annealing neural network for CDMA multiuser detection
Author
Bhardwaj, Sumit ; Jayadeva
Author_Institution
Dept. of Electr. Eng., Indian Inst. of Technol., New Delhi, India
Volume
5
fYear
2002
fDate
18-22 Nov. 2002
Firstpage
2176
Abstract
The optimum multiuser detection problem in the presence of noise is a quadratic integer programming problem which has been shown to be NP-complete. In this paper, we propose a novel neural network based multiuser detector for a direct-sequence code division multiple access system. The proposed detector combines the paradigms of chaotic neural networks and methods from sequential unconstrained minimization techniques. The proposed network is adaptive in the sense that the network "learns" the energy function to minimize. We show that the proposed network outperforms traditional methods such as the Hopfield net as well as as recent methods such as the transiently chaotic neural network.
Keywords
chaos; code division multiple access; computational complexity; integer programming; multiuser detection; neural nets; quadratic programming; simulated annealing; spread spectrum communication; CDMA multiuser detection; NP-complete problem; chaotic neural networks; direct-sequence code division multiple access system; quadratic integer programming problem; sequential chaotic annealing neural network; sequential unconstrained minimization techniques; Adaptive systems; Annealing; Chaos; Detectors; Hopfield neural networks; Linear programming; Minimization methods; Multiaccess communication; Multiuser detection; Neural networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Information Processing, 2002. ICONIP '02. Proceedings of the 9th International Conference on
Print_ISBN
981-04-7524-1
Type
conf
DOI
10.1109/ICONIP.2002.1201878
Filename
1201878
Link To Document