ADC Averaging / Oversampling Calculator

The idea that averaging N noisy samples reduces RMS noise by √N goes back to Carl Friedrich Gauss\'s 1809 work on least-squares estimation. The specific application to ADCs — trading bandwidth for resolution — was developed in the 1960s–70s alongside the rise of digital signal processing. The √N rule gives one effective bit per 4× increase in sample count because each doubling of N reduces noise by √2 = one half-bit.

Σ-Δ (sigma-delta) converters take this to the extreme: a 1-bit modulator running at 100+ MHz, with noise-shaping to push quantization noise out of the signal band, produces 20+ bits of effective resolution at audio rates after digital decimation. Max Hauser and James Candy\'s seminal Σ-Δ work at Bell Labs in the 1970s–80s formalized the architecture that now dominates audio, precision measurement, and sensor interfaces.

The √N rule assumes white (Gaussian, uncorrelated) input noise. Real ADCs have 1/f (flicker) noise at low frequencies and systematic errors (INL, offset, gain) that don\'t average out. These place a practical ceiling — typically 3–4 effective bits of gain through simple averaging — beyond which better ADCs or more sophisticated architectures (chopper amplifiers, auto-zero circuits) are required.

Enter the ADC\'s native resolution in bits and the number of samples you plan to average (or oversample + decimate). The tool computes the effective resolution gain (ΔN = ½ log₂N bits), new effective bit count, noise reduction factor, and — if you supply a sample rate and target signal bandwidth — the output sample rate after decimation.

Remember: averaging only gains you ENOB if the input has at least ~1 LSB of uncorrelated noise. If samples are identical (noiseless input), averaging returns the same value every time with zero improvement. Intentional dither (adding small white noise) is standard practice in precision DAQ. All math runs client-side.