FORMAL SYNTHESIS OF VLSI LAYOUTS FROM ALGORITHMIC SPECIFICATIONS

Citation
Sm. Sait et Elleithy Km",masudulhasan, FORMAL SYNTHESIS OF VLSI LAYOUTS FROM ALGORITHMIC SPECIFICATIONS, Computer systems science and engineering, 11(2), 1996, pp. 67-81
Citations number
37
Categorie Soggetti
System Science","Computer Application, Chemistry & Engineering","Computer Sciences, Special Topics","Computer Science Theory & Methods
ISSN journal
02676192
Volume
11
Issue
2
Year of publication
1996
Pages
67 - 81
Database
ISI
SICI code
0267-6192(1996)11:2<67:FSOVLF>2.0.ZU;2-K
Abstract
Due to advances in VLSI technology, it is possible to implement comple x digital systems on a single chip. However modelling such large and c omplex systems at structural level is tedious and error prone. This fa ct has motivated the development of several high-level synthesis syste ms. The process consists of translating the abstract behavioural repre sentation generally at the algorithmic level into a structural realiza ble representation. In this paper we present a formal approach for hig h-level synthesis. This formal high-level synthesis system uses mu-rec ursive algorithms to model the behaviour to be synthesized. These algo rithms can be mathematically verified for correctness before being sub jected to the task of translation. As a case study, the modelling and synthesis of VLSI layouts for matrix-matrix multipliers is discussed.