## Digital logic | Design 101 sequence detector (Mealy machine)

Prerequisite – Mealy and Moore machines A sequence detector is a sequential state machine which takes an input string of bits and generates an output… 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
- Difference between Programmable Logic Array and Programming Array Logic
- Digital Logic | Number of possible Functions
- Counting Boolean function with some variables
- Difference between Repeater and Amplifier
- Difference between PCM and DPCM

Prerequisite – Mealy and Moore machines A sequence detector is a sequential state machine which takes an input string of bits and generates an output… Read More »

Prerequisite – Counters Problem – Design synchronous counter for sequence: 0 → 1 → 3 → 4 → 5 → 7 → 0, using T… Read More »

Prerequisite – Karnaugh Map (K-map) K-map is the best manual technique to solve Boolean equations, but it becomes difficult to manage when number of variables… Read More »

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 »

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 »

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 »

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 »

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 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 »

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 »

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 »

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 »

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 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 »

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 »