BitFlow
Digital Electronics Academy

Learn digital logic,
explore VLSI career tracks.

From your first bit to the university and GATE syllabus, with circuits you can click, plus an interactive career roadmap for RTL, DV, DFT, and Physical Design.

NEW FEATUREECE Career Guidance

🗺️ Interactive VLSI Career & Role-Based Learning Roadmap

Explore chip design roles: RTL Design, Design Verification (DV), DFT, Physical Design (PD), and Analog Layout.

Explore Roadmap →
01
01

What Is Digital?

Beginner

Why computers use only two levels, what a bit is, and how switches turn into logic. Start here if this is all new.

~20 min

0b
02

Number Systems

Beginner

Binary, octal and hexadecimal: reading them, converting between them, and how many bits a number needs.

~30 min

±
03

Binary Arithmetic and Signed Numbers

Beginner

Adding, subtracting and multiplying in binary, two's complement, and how to spot overflow.

~35 min

⌗
04

Codes: BCD, Gray, ASCII, Parity and Hamming

Core

The same bits can mean different things. Codes that suit displays, sensors, text and error checking.

~35 min

⊕
05

Logic Gates

Beginner

AND, OR, NOT, NAND, NOR, XOR: the building blocks of digital logic, what's inside them, and why they take time.

~35 min

∧
06

Boolean Algebra

Beginner

The algebra of 0s and 1s: laws, De Morgan's theorem, and turning any truth table into an expression you can simplify.

~35 min

⊞
07

Karnaugh Maps

Core

Simplify logic by eye: draw the truth table so neighbours differ by one variable, then circle the groups.

~40 min

QM
08

The Quine-McCluskey Method

GATE

K-maps stop working at about five variables. This is the same idea as a step-by-step procedure a computer can follow.

~30 min

⏚
09

Logic Families

Core

TTL, CMOS and ECL: what real gates do to voltages, how many others they can drive, how fast they go and how much power they burn.

~35 min

+
10

Adders, Subtractors and Comparators

Core

Build arithmetic out of gates: half and full adders, a 4-bit adder whose carry you can watch ripple, subtraction, and magnitude comparison.

~35 min

Σ
11

Multiplexers, Decoders and Encoders

Core

The blocks that route and translate data: MUX and DEMUX, decoders, encoders, priority encoders and code converters.

~40 min

×
12

Fast Arithmetic: Lookahead, BCD and Multipliers

GATE

Beat the ripple with carry lookahead, add in decimal, multiply in hardware, and see how Booth's algorithm handles signed numbers.

~45 min

↻
13

Latches and Flip-Flops

Core

How a circuit remembers: a bit stored in a loop, the difference between level and edge, and the four flip-flop types.

~40 min

▤
14

Registers and Shift Registers

Core

Storing a whole word, moving bits along a chain, serial and parallel conversion, and generating pseudo-random bits.

~30 min

⏲
15

Counters

Core

Ripple and synchronous counters, designing any count sequence with K-maps, and ring and Johnson counters.

~40 min

◎
16

Finite State Machines

GATE

Moore and Mealy machines, the design recipe from words to gates, sequence detectors and state reduction.

~45 min

⏱
17

Timing and Hazards

GATE

Setup and hold, how fast a circuit can run, glitches and how to remove them, and what happens when signals cross clock domains.

~45 min

▦
18

Memories and Programmable Logic

Core

How RAM and ROM store and find data, why DRAM forgets, sizing memories, and PLAs, PALs and FPGAs.

~45 min

∿
19

ADC and DAC: Meeting the Analog World

Core

How digital systems measure and produce real voltages: sampling, aliasing, quantization, and the main converter designs.

~35 min

</>
20

From Gates to Verilog

Core

Stop drawing and start describing: how every circuit in this course is written in Verilog, simulated, and turned into real hardware.

~40 min

▦
21

From RTL to GDS

GATE

How your Verilog becomes a manufacturable chip: synthesis, floorplan, placement, clock tree, routing, signoff and the GDS file sent to the foundry.

~45 min