# Category Archives: Digital Electronics & Logic Design (adsbygoogle = window.adsbygoogle || []).push({});

## Digital logic | Carry Look-Ahead Adder

Motivation behind Carry Look-Ahead Adder : In ripple carry adders, for each adder block, the two bits that are to be added are available instantly.… Read More »

## Digital logic | Functional Completeness

A set of operations is said to be functionally complete or universal if and only if every switching function can be expressed by means of… Read More »

## Mathematics | Properties of Boolean algebra

Switching algebra is also known as Boolean Algebra. It is used to analyze digital gates and circuits It is logic to perform mathematical operation on… Read More »

## Digital logic | Canonical and Standard Form

Canonical Form – In Boolean algebra,Boolean function can be expressed as Canonical Disjunctive Normal Form known as minterm and some are expressed as Canonical Conjunctive… Read More »

## Digital logic | Encoder

An Encoder is a combinational circuit that performs the reverse operation of Decoder.It has maximum of 2^n input lines and ‘n’ output lines, hence it… Read More »

## Digital logic | Binary Decoder

In Digital Electronics, discrete quantities of information are represented by binary codes. A binary code of n bits is capable of representing up to 2^n distinct… Read More »

## Digital Logic | Code Converters – BCD(8421) to/from Excess-3

Prerequisite – Number System and base conversions Excess-3 binary code is a unweighted self-complementary BCD code. Self-Complementary property means that the 1’s complement of an… Read More »

## Digital logic | Code Converters – Binary to/from Gray Code

Prerequisite – Number System and base conversions Gray Code system is a binary number system in which every successive pair of numbers differs in only… Read More »

## Digital Logic | Minimization of Boolean Functions

As discussed in the “Representation of Boolean Functions” every boolean function can be expressed as a sum of minterms or a product of maxterms. Since… Read More »

## Mathematics | Representation of Boolean Functions

A Boolean function is described by an algebraic expression consisting of binary variables, the constants 0 and 1, and the logic operation symbols For a… Read More »

## Digital Logic | Logic Gates

In Boolean Algebra, there are three basic operations, which are analogous to disjunction, conjunction, and negation in propositional logic. Each of these operations has a… Read More »

## Digital Logic | Introduction of Sequential Circuits

A Sequential circuit combinational logic circuit that consists of inputs variable (X), logic gates (Computational circuit), and output variable (Z). Combinational circuit produces an output… Read More »

## Digital Logic | Full Subtractor

A full subtractor is a combinational circuit that performs subtraction of two bits, one is minuend and other is subtrahend, taking into account borrow of… Read More »

## Program for hexadecimal to decimal

Given a hexadecimal number as input, we need to write a program to convert the given hexadecimal number into equivalent decimal number. Examples: Input :… Read More »

## Program for octal to decimal conversion

Given an octal number as input, we need to write a program to convert the given octal number into equivalent decimal number. Examples: Input :… Read More »