A Neural Network Design for Circuit Partitioning

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 9, Issue 12, 1990, Pages 1265-1271

  Yih, Jih Shyr ^a   Mazumder, Pinaki ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--HEURISTIC; NEURAL NETWORKS;

ALGORITHM COMPLEXITY; CIRCUIT PARTITIONING; HEURISTIC SOLUTIONS; NEURAL CIRCUITS;

INTEGRATED CIRCUITS;

EID: 0025587187     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.62771     Document Type: Article

References (15)

1. L. I. Corrigan, “A placement capability based on partitioning,” in Proc. Design Automation Conf., pp. June 1979, pp. 406–413.
2. A. E. Dunlop and B. W. Kernighan, “A procedure for placement of standard-cell VLSI circuits,” IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 92–98, Jan. 85.
3. C. M. Fiduccia and R. M. Mattheyses, “A linear heuristic for improving network partitions,” in Proc. Design Automation Conf., June 1982, pp. 175–181.
4. H. P. Graf et al., “VLSI implementation of a neural network memory with several hundreds of neurons.” in Proc. Conf. on Neural Networks for Computing, Amer. Inst, of Phys., 1986, pp. 182–187.
5. J. J. Hopfield, “Neural networks and physical systems with emergent collective computational abilities,” in Proc. Nat. Acad. Sci. USA, vol. 79, Apr. 1982, pp. 2554–2558.
6. J. J. Hopfield and D. W. Tank, “Neural computation of decisions in optimization problems,” Biol. Cybern., vol. 52, pp. 141–152, 1985.
7. D. K. Hwang, W. K. Fuchs, and S. M. Kang, “An efficient approach to gate matrix layout,” IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 802–809, Sept. 87.
8. B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell Syst. Tech. J., vol. 49, pp. 291–307, Feb. 1970.
9. U. R. Kodres, “Partitioning and card selection,” in Design Automation of Digital Systems, M. A. Breuer, ed. Englewood Cliffs, NJ: Prentice-Hall, 1972, pp. 173–212.
10. B. Krishnamurthy, “An improved min-cut algorithm for partitioning VLSI networks,” IEEE Trans. Comput., vol. C-33, pp. 438–446, May 1984.
11. W. S. McCulloch and W. H. Pitts, “A logical calculus of ideas immanent in nervous activity,” Bull. Math. Biol., vol. 5, pp. 115–133, 1943.
12. A. F. Murray and A. V. W. Smith, “Asynchronous VLSI neural networks using pulse-stream arithmetic,” IEEE J. Solid-State Circuits, vol. 23, pp. 688–697, June 1988.
13. D. G. Schweikert and B. W. Kernighan, “A proper model for the partitioning of electrical circuits,” in Proc. 9th Design Automation Workshop, Dallas, 1979, pp. 57–62.
14. C. Sechen and D. Chen, “An improved objective function for mincut circuit partitioning” in Proc. Int. Conf. Computer-Aided Design, Nov. 1988, pp. 503–505.
15. M. A. Sivilotti, M. R. Emerling, and C. A. Mead, “VLSI architectures for implementation of neural networks,” in Proc. Conf. on Neural Networks for Computing, Amer. Inst, of Phys., 1986, pp. 408– 413.