## 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 | Self dual functions
- Construction of Combinational Circuits
- Differences between Synchronous and Asynchronous Counter
- Digital Logic | Number of Boolean functions
- Difference between EPROM and EEPROM
- Prime Implicant chart for minimizing Cyclic Boolean functions
- Difference between DDR and SDRAM
- Digital Logic | Number of possible Functions
- Difference between Programmable Logic Array and Programming Array Logic
- Counting Boolean function with some variables
- Difference between Repeater and Amplifier
- Difference between PCM and DPCM

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »

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 »