ScholarLens Back to search
1988•IETE Journal of EducationRequires access

Network Boolean Equations and Truth Tables

J K Reddy

Open publisher page 0 citations

Abstract

Network Boolean equation and truth table analysis techniques are used in describing and analysing combinational logic networks. These logic networks are constructed by interconnecting logic gates which help in making logical decisions and controlling operations in digital electronic systems. This paper deals with developing Boolean equations and making truth table analysis for the logic networks. At the end, it is illustrated that an out function of a logic network can be realized in either AND-OR-NOT, or NAND-NOT or NOR-NOT circuitry.

About this research paper

What this paper is about

Network Boolean equation and truth table analysis techniques are used in describing and analysing combinational logic networks. These logic networks are constructed by interconnecting logic gates which help in making logical decisions and controlling operations in digital electronic systems. This paper deals with developing Boolean equations and making truth table analysis for the logic networks. At the end, it is illustrated that an out function of a logic network can be realized in either AND-OR-NOT, or NAND-NOT or NOR-NOT circuitry.

Why it matters

A significance statement is not available in the OpenAlex record.

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

Network Boolean equation and truth table analysis techniques are used in describing and analysing combinational logic networks. These logic networks are constructed by interconnecting logic gates which help in making logical decisions and controlling operations in digital electronic systems. This paper deals with developing Boolean equations and making truth table analysis for the logic networks. At the end, it is illustrated that an out function of a logic network can be realized in either AND-OR-NOT, or NAND-NOT or NOR-NOT circuitry.

Key concepts: Truth table, And-inverter graph, Boolean circuit, Digital electronics, Boolean function, Circuit minimization for Boolean functions, Boolean network, Computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Network Boolean Equations and Truth Tables — Research Paper | ScholarLens