On Synthesis of (k,K) Circuits.

S.R. Naidu, V. Chandru

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

72 Downloads (Pure)

Samenvatting

circuit is one which can be decomposed into nonintersecting blocks of gates where each block has no more than K external inputs, such that the graph formed by letting each block be a node and inserting edges between blocks if they share a signal line, is a partial k-tree. (k;K) circuits are special in that they have been shown to be testable in time polynomial in the number of gates in the circuit, and are useful if the constants k and K are small. We demonstrate a procedure to synthesise (k;K) circuits from a special class of Boolean expressions.
Originele taal-2Engels
Pagina's (van-tot)1490-1494
Aantal pagina's5
TijdschriftIEEE Transactions on Computers
Volume52
Nummer van het tijdschrift11
DOI's
StatusGepubliceerd - 2003

Vingerafdruk

Duik in de onderzoeksthema's van 'On Synthesis of (k,K) Circuits.'. Samen vormen ze een unieke vingerafdruk.

Citeer dit