Abstract
In this paper, we discussed several problems in the design and analysis of hardware algorithms. The complexity theory of logic circuits and parallel computation will form the theoretical foundation of design and analysis of hardware algorithms which will become more important for large VLSI systems. A formal description method of hardware algorithms will be proposed on a general model of parallel computation. Design tools for hardware algorithms will be developed such as a hardware description language, an automatic translation system from the language to circuits, a verification support system from algorithms, etc. Results of theoretical researches on the circuit complexity will play an important role in the development of these design tools.
Original language | English |
---|---|
Title of host publication | Lecture Notes in Computer Science |
Publisher | Springer Verlag |
Pages | 105-129 |
Number of pages | 25 |
ISBN (Print) | 0387700021, 9780387700021 |
DOIs | |
Publication status | Published - 1984 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science