Advertisement

Using the temporal logic programming language Tokio for algorithm description and automatic CMOS gate array synthesis

  • Masahiro Fujita
  • Makoto Ishisone
  • Hiroshi Nakamura
  • Hidehiko Tanaka
  • Tohru Moto-oka
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 221)

Abstract

To date, simulation has been the primary method used to support hardware logic design. In particular, there has been little that could support such design from the system level, such as a language to describe processing algorithms. In this paper, we will propose a silicon compiler, which is designed to support CMOS gate arrays from the system level. Descriptions from the system level through the state diagram level are done by using the temporal logic programming language called Tokio. Being based on temporal logic, Tokio enables the use of temporal operators. This facilitates the description of concurrent operations that cannot be easily described in Prolog. In addition, because the mathematical models are clearly defined, verification and synthesis can be easily supported. At present, only a simulator coded in Prolog is available to support descriptions of this level in Tokio.

A program that automatically synthesizes logical circuits for CMOS gate array from state diagram level is supported. The core of this program has already been developed in C-Prolog. Synthesis has already been tested at our laboratory. We used the Unify Processor (UP) of PIE (Parallel Inference Machine) which is currently under development, as an example.

This paper introduces the hardware design support strategy based on Tokio, and explains the details of the program that synthesizes CMOS gate arrays from the descriptions of the state diagram level.

Keywords

Temporal Logic Logical Circuit Common Part Linear Time Temporal Logic Gate Count 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Manna Z, Pnueli A (1981) Verification of concurrent programs part I: the temporal framework, Stanford univ. rep. STAN-C81-836Google Scholar
  2. Moszkowski B (1983) Reasoning about digital circuits, Stanford univ. rep. STAN-CS-83-970Google Scholar
  3. Aoyagi T, Kono S, Fujita M, Moto-oka T (1985) Logic Programming Conference '85, Tokyo JapanGoogle Scholar
  4. Kono S, Aoyagi T, Fujita M, Tanaka H (1985) Logic Programming Conference '85, Tokyo JapanGoogle Scholar
  5. Fujita M (1984) Logic design assistance with temporal logic, phD dissertation, Univ. of TokyoGoogle Scholar
  6. Juley JR, Dietmeyer DL (1968) A digital system design language (DDL), IEEE trans. computer, vol. C-17, no. 9Google Scholar
  7. Juley JR, Dietmeyer DL (1969) Translation of a DDL digital system specification to equation, IEEE trans. computer, vol. C-18, no. 4Google Scholar
  8. Pereira F (1984) C-Prolog users manual version 1.5, EdCAD, Edinburgh univ.Google Scholar
  9. Goto A, Aida A, Tanaka H, Moto-oka T (1983) Highly parallel inference engine PIE, Logic Programming Conference '83, Tokyo JapanGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Masahiro Fujita
    • 1
  • Makoto Ishisone
    • 1
  • Hiroshi Nakamura
    • 1
  • Hidehiko Tanaka
    • 1
  • Tohru Moto-oka
    • 1
  1. 1.Faculty of engineeringUniversity of TokyoTokyoJapan

Personalised recommendations