2002•Unpublished venueRequires access

Interchangeable boolean functions and their effects on redundancy in logic circuits

Debesh Kumar Das, Susanta Kumar Chakraborty, Bhargab B. Bhattacharya

Abstract

A new concept of interchangeability of boolean functions under stuck-at faults in logic circuits is introduced in this paper. Two boolean functions F/sub 1/ and F/sub 2/ are said to be interchangeable if there exist two irredundant combinational networks N/sub 1/ and N/sub 2/ realizing F/sub 1/ and F/sub 2/ respectively, such that under some single/multiple stuck-at fault f/sub 1/(f/sub 2/) in N/sub 1/(N/sub 2/), the faulty network realizes F/sub 2/(F/sub 1/). It has been shown that an infinite family of such interchangeable pairs of functions exist, and they play an important role in determining several new types of redundancy in combinational and sequential circuits.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Boolean function, Boolean circuit, Combinational logic, And-inverter graph, Redundancy (engineering), Interchangeability, Product term, Boolean expression