TOGAPS: A Testability Oriented Genetic Algorithm for Pipeline Synthesis

VLSI Design

Volumn 5, Issue 1, 1996, Pages 77-87

  Ravikumar, C P ^a   Saxena, V ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

BILBO architecture; Data path synthesis; evolutionary programming; genetic algorithm; pipeline synthesis; testability oriented synthesis

Indexed keywords

GRAPH THEORY; HEURISTIC METHODS; INTEGRATED CIRCUIT LAYOUT; MATHEMATICAL OPERATORS; VLSI CIRCUITS;

CROSSOVER OPERATOR; DATA FLOW GRAPH; MODULE ALLOCATION; MUTATION OPERATOR; TESTABILITY ORIENTED GENETIC ALGORITHM FOR PIPELINE SYNTHESIS;

GENETIC ALGORITHMS;

EID: 0029725272     PISSN: 1065514X     EISSN: None     Source Type: Journal    
DOI: 10.1155/1996/65320     Document Type: Article

References (15)

1. L. Avra. Allocation and assignment in high-level synthesis for self-testable data paths. In Proceedings of International Test Conference, pages 463–472, 1991.
2. D.D. Gajski and L. Ramachandran. Introduction to High-Level Synthesis. IEEE Design and Test of Computers, pages 44–54, Winter 1994. Tutorial.
3. D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading, Massachusetts, 1989.
4. R. Jain. High level synthesis benchmarks. Personal Communication.
5. K. Kucukcakar. System-Level Synthesis Techniques With Emphasis on Partitioning and Design Planning. PhD thesis, University of Southern California, October 1991.
6. P.M. Kogge. The Architecture of Pipelined Computers. Hemisphere Publishing Corporation, NY, 1981.
7. S.-P. Lin, C. Njinda, and M. Breuer. Generating a Family of Testable Designs using the BILBO Methodology. Journal of Electronic Testing: Theory and Applications, pages 71–89, 1993.
8. A.C. Parker, M. McFarland and R. Camposano. The high level synthesis of digital systems. Proceedings of the IEEE, 78, February 1990.
9. A. Mujumdar, K. Saluja, and R. Jain. Incorporating testability considerations in high-level synthesis. In Proceedings of the Fault-Tolerant Computing Symposium, pages 272–279, 1992.
10. C.A. Papachristou et al. A framework for high-level synthesis with self-testability. Technical report, Computer Engineering and Science Department, Case Institute of Technology, Case Western Reserve University, February 1991. CES-91–03.
11. K.K. Parhi. Calculation of minimum number of registers in arbitrary life time cycles. In Proceedings of the VLSI Design 1994 Conference, 1994. Calcutta, India.
12. N. Park and A.C. Parker. SEHWA a program for synthesis of pipelines. In Proceedings of the 23rd IEEE/ACM Design Automation Conference, pages 454–460, 1986.
13. P.G. Paulin and J.P. Knight. Force directed scheduling for the behavioral synthesis of ASICs. IEEE Transactions of CAD, 8(6):661–679, 1989.
14. C.P. Ravikumar and A.K. Gupta. A genetic algorithm for mapping tasks onto a reconfigurable parallel processor. IEE Proceedings (E); 142:81–86, March 1995.
15. L. Stok. Data Path Synthesis. Integration, the VLSI Journal, pages 1–71, December 1994. Tutorial.