XOR Gate: The Difference Detector That Powers Binary Addition
In the previous post in this series, we explored the NOR gate — and one of the most remarkable facts in all of digital logic: NOR is universal. From this...
A collection of 5 posts
In the previous post in this series, we explored the NOR gate — and one of the most remarkable facts in all of digital logic: NOR is universal. From this...
TL;DR: A parity bit is one extra bit appended to a binary word so that the total number of 1s is even (even parity) or odd (odd parity). A chain...
TL;DR: A half adder is the simplest binary-addition circuit. Two inputs (A, B) produce two outputs: Sum = (XOR) and Carry = (AND). It's only "half" an adder because it...
TL;DR: The XOR (Exclusive OR) gate outputs 1 only when its inputs differ. Boolean expression . XOR is binary addition modulo 2, the sum bit of a half adder, the...
TL;DR: XOR outputs 1 when inputs differ; XNOR outputs 1 when they match. Multi-input XOR chains detect odd parity; multi-input XNOR chains detect even parity. The choice between them depends...
Occasional updates on new SimCast lessons, components, and build guides. No spam — unsubscribe anytime.