On Synthesis of (k,K) Circuits.

S.R. Naidu; V. Chandru

doi:10.1109/TC.2003.1244946

On Synthesis of (k,K) Circuits.

S.R. Naidu, V. Chandru

Electronic Systems

Research output: Contribution to journal › Article › Academic › peer-review

141 Downloads (Pure)

Abstract

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.

Original language	English
Pages (from-to)	1490-1494
Number of pages	5
Journal	IEEE Transactions on Computers
Volume	52
Issue number	11
DOIs	https://doi.org/10.1109/TC.2003.1244946
Publication status	Published - 2003

Access to Document

10.1109/TC.2003.1244946

Metis156721Final published version, 268 KB

Cite this

@article{d4cb493772b14e519605b8d0c46a4742,

title = "On Synthesis of (k,K) Circuits.",

abstract = "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.",

author = "S.R. Naidu and V. Chandru",

year = "2003",

doi = "10.1109/TC.2003.1244946",

language = "English",

volume = "52",

pages = "1490--1494",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "Institute of Electrical and Electronics Engineers",

number = "11",

}

TY - JOUR

T1 - On Synthesis of (k,K) Circuits.

AU - Naidu, S.R.

AU - Chandru, V.

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

U2 - 10.1109/TC.2003.1244946

DO - 10.1109/TC.2003.1244946

M3 - Article

SN - 0018-9340

VL - 52

SP - 1490

EP - 1494

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 11

ER -

On Synthesis of (k,K) Circuits.

Abstract

Access to Document

Fingerprint

Cite this