Analysis and Design of an Analog Sorting Network

IEEE Transactions on Neural Networks

Volumn 6, Issue 4, 1995, Pages 962-971

  Wang, Jun ^a  

^a UNIVERSITY OF NORTH DAKOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK ANALYSIS; ELECTRIC NETWORK SYNTHESIS; FUNCTIONS; MATRIX ALGEBRA; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PERFORMANCE; PROBLEM SOLVING; SORTING; VLSI CIRCUITS;

ANALOG SORTING NETWORK; BITONIC SORTING; MONOTONIC SORTING; PARALLEL SORTING NETWORK;

NEURAL NETWORKS;

EID: 0029343629     PISSN: 10459227     EISSN: 19410093     Source Type: Journal    
DOI: 10.1109/72.392258     Document Type: Article

References (23)

1. D. E. Knuth, The Art of Computer Programming: Sorting and Searching. Reading, MA: Addison-Wesley, 1973.
2. S. G. Akl, Parallel Sorting Algorithms. Orlando, FL: Academic, 1985.
3. D. P. Agrawal and K. K. Agrawal, “Efficient sorting with CCD's and magnetic bubble memories,” IEEE Trans. Comput., vol. C-30, pp. 153-156, 1981.
4. D. T. Lee, H. Chen, and C. K. Wong, “An on-chip compare/steer bubble sorter,” IEEE Trans. Comput., vol. C-30, pp. 396-405, 1981.
5. H. Yasuura, N. Takagi, and S. Yajima, “The parallel enumeration scheme for VLSI,” IEEE Trans. Comput., vol. C-31, pp. 1192-1201, 1982.
6. G. Bilardi and F. P. Preparata, “A minimum area VLSI network for O(log n) time sorting,” IEEE Trans. Comput., vol. C-34, pp. 336-343, 1985.
7. D. Rotem, N. Santora, and J. B. Sydney, “Distributed sorting,” IEEE Trans. Comput., vol. C-34, pp. 372-376, 1985.
8. Y. H. Choi and M. Malek, “A fault-tolerant systolic sorter,” IEEE Trans. Comput., vol. C-37, pp. 621-624, 1988.
9. D. E. Francis and I. D. Mathieson, “Benchmark parallel sort for shared memory multi-processors,” IEEE Trans. Comput., vol. C-37, pp. 1619-1626, 1988.
10. H. M. Alnuweiri and V. K. P. Kumar, “Optimal VLSI Sorting with reduced number of processors,” IEEE Trans. Comput., vol. C-40, pp. 105-110, 1991.
11. J. J. Hopfield and D. W. Tank, “Neural computation of decisions in optimization problems,” Biological Cybern., vol. 52, no. 3, pp. 141-152, 1985.
12. D. W. Tank and J. J. Hopfield, “Simple neural optimization networks: An A/D converter, signal decision circuit, and a linear programming circuit,” IEEE Trans. Circuits Syst., vol. CAS-33, no. 5, pp. 533-541, 1986.
13. R. W. Brockett, “Dynamical systems that sort lists, diagonize matrices and solve linear programming problems,” Linear Algebra and Its Applications, vol. 146, pp. 79-91, 1991; also in Proc. IEEE Conf. Decision Contr., Austin, TX, 1988, pp. 799-803.
14. Y. Takefuji and K.-C. Lee, “A super parallel sorting algorithm based on neural networks,” IEEE Trans. Circuits Syst., vol. CAS-37, no. 11, pp. 1425-1429, 1990.
15. “A two-step parallel sorting algorithm based on neural networks,” J. Neural Network Computing, vol. 2, no. 1, pp. 30-32, 1990.
16. M. Atkins, “Sorting by Hopfield net,” in Proc. Int. Joint Conf. Neural Networks, vol. II, Washington, DC, 1989, pp. 65-68.
17. W. Chen and K. Hsieh, “A neural sorting network with 0(1) time complexity,” in Proc. Int. Joint Conf. Neural Networks, vol. III, San Diego, CA, 1990, pp. 793-798.
18. T. M. Kwon and M. Zervakis, “A parallel sorting network without comparators: A neural network approach,” in Proc. Int. Joint Conf. Neural Networks, vol. I, Baltimore, MD, 1992, pp. 701-706.
19. Y.-H. Tseng and J.-L. Wu, “Solving sorting and related problems by quadratic perceptrons,” Electron. Lett., vol. 28, no. 10, pp. 906-908, 1992.
20. D. E. Luenberger, Linear and Nonlinear Programming. Reading, MA: Addison-Wesley, 1984.
21. J. Wang, “Analog neural network for solving the assignment problem,” Electron. Lett., vol. 28, no. 11, pp. 1047-1050, 1992.
22. “Analysis and design of a recurrent neural network for linear programming,” IEEE Trans Circuits Syst.—Part I: Fundamental Theory Applicat., vol. 40, pp. 613-618, 1993.
23. T. Kailath, Linear Systems. Reading, MA: Addison-Wesley, 1980.