Why can a CPU finish an instruction every cycle when each one takes five steps? This guide follows instructions through a pipeline cycle by cycle, shows where hazards force stalls, and explains why a …
Read post →A one line project rule: no zlib, no third party compression libraries, turned into writing CRC32, Adler32, a bitstream packer, canonical Huffman coding, LZ77, and a full RFC 1951 DEFLATE encoder/deco…
Read post →LZ77 is the algorithm that taught modern compressors how to spot repetition. Instead of encoding every byte from scratch, it slides a window back through data it has already seen and replaces repeated…
Read post →A deep technical dive into Huffman coding, the greedy algorithm behind lossless data compression. This article covers how Huffman trees are built, why the algorithm guarantees an optimal prefix code, …
Read post →CRC (Cyclic Redundancy Check) is a family of checksum algorithms based on polynomial division, widely used to catch accidental data corruption in storage and transmission. This article explains how CR…
Read post →Adler-32 is a 32-bit checksum algorithm designed by Mark Adler and used by zlib and the DEFLATE format to detect accidental data corruption. This article explains how the algorithm works, why it was d…
Read post →