A Scaling Law for Bandwidth Under Quantization
Maximilian Kalcher, Tena Dubcek

TL;DR
This paper establishes a mathematical relationship between ADC bit depth and effective bandwidth for signals with 1/f^α spectra, showing how each additional bit extends the bandwidth approximately exponentially, with validation on synthetic and real EEG data.
Contribution
It introduces a scaling law linking ADC bit depth to bandwidth for 1/f^α signals, providing theoretical predictions and empirical validation, including practical implications for EEG data.
Findings
Each additional bit extends bandwidth by a factor of approximately 2^{2/α}.
Prediction errors below 3% on synthetic signals using the theoretical noise floor.
Empirical noise floor estimation yields about 14% prediction error.
Abstract
We derive a scaling law relating ADC bit depth to effective bandwidth for signals with power spectra. Quantization introduces a flat noise floor whose intersection with the declining signal spectrum defines an effective cutoff frequency . We show that each additional bit extends this cutoff by a factor of , approximately doubling bandwidth per bit for . The law requires that quantization noise be approximately white, a condition whose minimum bit depth we show to be -dependent. Validation on synthetic signals for yields prediction errors below 3\% using the theoretical noise floor , and approximately 14\% when the noise floor is estimated empirically from the quantized signal's spectrum. We illustrate practical implications on real EEG data.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural dynamics and brain function · Analog and Mixed-Signal Circuit Design · Advanced Data Compression Techniques
