## Encoders and Decoders in Digital Logic

Prerequisite – Encoder, Decoders Binary code of N digits can be used to store 2N distinct elements of coded information. This is what encoders and… Read More »

## Ripple Counter in Digital Logic

Prerequisite – Counters, n-bit Johnson Counter A counter is basically used to count the number of clock pulses applied to a flip-flop. It can also… Read More »

## Various Implicants in K-Map

Prerequisite – K – Map (Karnaugh Map) Implicant is a product/minterm term in Sum of Products (SOP) or sum/maxterm term in Product of Sums (POS)… Read More »

## Non-Restoring Division For Unsigned Integer

In earlier post Restoring Division learned about restoring division. Now, here perform Non-Restoring division, it is less complex than the restoring one because simpler operation… Read More »

## Restoring Division Algorithm For Unsigned Integer

A division algorithm provides a quotient and a remainder when we divide two number. They are generally of two type slow algorithm and fast algorithm.… Read More »

## Amortized analysis for increment in counter

Amortized analysis refers to determining the time-averaged running time for a sequence (not an individual) operation. It is different from average case analysis because here,… Read More »

## Operational Amplifier (op-amp) in Digital Electronics

Amplifier is a device that increases the strength of input signal. It can be Voltage amplifiers, whose input is some voltage and output is also… Read More »

## Combinational circuits using Decoder

Prerequisite- Binary Decoder, Multiplexers A Decoder is a combinational circuit that converts binary information from input lines to unique output lines. Apart from the Input… Read More »

## n-bit Johnson Counter in Digital Logic

Prerequisite – Counters Johnson counter also known as creeping counter, is an example of synchronous counter. In Johnson counter, the complemented output of last flip… Read More »

## Consensus Theorem in Digital Logic

Prerequisite – Properties of Boolean algebra, Minimization of Boolean Functions Redundancy theorem is used as a Boolean algebra trick in Digital Electronics. It is also… Read More »

## BCD Adder in Digital Logic

BCD stand for binary coded decimal. Suppose, we have two 4-bit numbers A and B. The value of A and B can varies from 0(0000… Read More »

## Programming Array Logic

Programmable Array Logic (PAL) is a commonly used programmable logic device (PLD). It has programmable AND array and fixed OR array. Because only the AND… Read More »

## Programmable Logic Array

Programmable Logic Array(PLA) is a fixed architecture logic device with programmable AND gates followed by programmable OR gates. PLA is basically a type of programmable… Read More »

## Digital to Analog Conversion

Digital Signal – A digital signal is a signal that represents data as a sequence of discrete values; at any given time it can only… Read More »

## BCD to 7 Segment Decoder

Prerequisite – Number System and base conversions, BCD(8421) In Binary Coded Decimal (BCD) encoding scheme each of the decimal numbers(0-9) is represented by its equivalent… Read More »