Digital hardware realization of a recurrent neural network for solving the assignment problem

Neurocomputing

Volumn 51, Issue , 2003, Pages 447-461

  Hung, Donald L ^a   Wang, Jun ^b  

^a SAN JOSE STATE UNIVERSITY   (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Digital hardware; Parallel processing; Recurrent neural network; Systolic array

Indexed keywords

FIELD PROGRAMMABLE GATE ARRAYS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; TOPOLOGY;

DIGITAL HARDWARE REALIZATION;

RECURRENT NEURAL NETWORKS;

ARTICLE; ARTIFICIAL NEURAL NETWORK; AUTOMATION; COMPUTER PROGRAM; DATA ANALYSIS; FEASIBILITY STUDY; INFORMATION PROCESSING; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; PROBLEM SOLVING;

EID: 0037379814     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-2312(02)00627-6     Document Type: Article

References (23)

1. M.S. Bazaraa, J.J. Jarvis, H.D. Sherali, Linear Programming and Network Flows, 2nd Edition, Wiley, New York, 1990.
2. A. Cichocki, R. Unbehauen, Neural Networks for Optimization and Signal Processing, Wiley, London, UK, 1993.
3. A. Cichocki, R. Unbehauen, K. Weinzierl, R. Holzel, A new neural network for solving linear programming problems, Eur. J. Operational Res. 93 (3) (1996) 244-256.
4. S.P. Eberhardt, T. Duad, D.A. Kerns, T.X. Brown, A.P. Thakoor, Competitive neural architecture for hardware solution to the assignment problem, Neural Networks 4 (4) (1991) 431-442.
5. J.J. Hopfield, D.W. Tank, Neural computation of decisions in optimization problems, Biol. Cybernet. 52 (1985) 141-152.
6. M.P. Kennedy, L.O. Chua, Neural networks for nonlinear programming, IEEE Trans. Circuits Syst. 35 (5) (1988) 554-562.
7. J.J. Kosowsky, A.L. Yuille, The invisible hand algorithm: solving the assignment problem with statistical physics, Neural Networks 7 (1994) 477-490.
8. S.Y. Kung, Digital Neural Networks, Prentice-Hall, Englewood Cliffs, NJ, 1993.
9. D.G. Luenberger, Linear and Nonlinear Programming, 2nd Edition, Addison-Wesley, Reading, MA, 1984.
10. C.Y. Maa, M.A. Shanblatt, Linear and quadratic programming neural network analysis, IEEE Trans. Neural Networks 3 (1992) 580-594.
11. D.W. Tank, J.J. Hopfield, Simple neural optimization networks: an A/D converter, signal decision circuit, and a linear programming circuit, IEEE Trans. Circuits Syst. I 33 (5) (1986) 533-541.
12. P.-Y. Ting, R.A. Iltis, Diffusion network architectures for implementation of gibbs sampler with applications to the assignment problem, IEEE Trans. Neural Networks 5 (4) (1994) 622-638.
13. K. Urahama, Analog circuit for solving assignment problem, IEEE Trans. Circuits Syst. I 40 (5) (1994) 426-429.
14. J. Wang, An analog neural network for solving the assignment problem, Electron. Lett. 28 (11) (1992) 1047-1050.
15. J. Wang, Analysis and design of a recurrent neural network for linear programming, IEEE Trans. Circuits Syst. I 40 (9) (1993) 613-618.
16. J. Wang, A deterministic annealing neural network for convex programming, Neural Networks 7 (4) (1994) 629-641.
17. J. Wang, Analysis and design of an analog sorting network, IEEE Trans. Neural Networks 6 (1995) 962-971.
18. J. Wang, Recurrent neural networks for optimization, in: C.H. Chen (Ed.), Fuzzy Logic and Neural Network Handbook, McGraw-Hill, New York, 1996, pp. 4.1-4.35.
19. J. Wang, Primal and dual assignment networks, IEEE Trans. Neural Networks 8 (3) (1997) 784-790.
20. W.J. Wolfe, J.M. MacMillan, G. Brady, R. Mathews, J.A. Rothman, M.D. Orosz, C. Anderson, G. Alaghband, Inhibitory grids and the assignment problem, IEEE Trans. Neural Networks 4 (2) (1993) 319-331.
21. W.J. Wolfe, R.M. Ulmer, Orthogonal projections applied to the assignment problem, IEEE Trans. Neural Networks 8 (3) (1997) 774-778.
22. Y. Xia, A new neural network for solving linear programming problems and its applications, IEEE Trans. Neural Networks 7 (1996) 525-529.
23. Y. Xia, A new neural network for solving linear and quadratic programming problems, IEEE Trans. Neural Networks 7 (1996) 1544-1547.