Skip to content

A/D Converters

An analog-to-digital converter (ADC) samples a continuous input, assigns each sample to one of a finite number of amplitude levels (quantization), and encodes that level as a binary word. A complete data-acquisition path therefore uses anti-alias filtering, sampling/holding, quantization and encoding.

ADC Language, Conversion Chain and Ideal Transfer

Section titled “ADC Language, Conversion Chain and Ideal Transfer”

A complete ADC signal path: sampling discretizes time, quantization discretizes amplitude, and encoding expresses the selected level in binary.

A complete ADC signal path: sampling discretizes time, quantization discretizes amplitude, and encoding expresses the selected level in binary.

The three conversion operations are distinct:

  • Sampling: selects values at t=kTst=kT_s and therefore discretizes time; Ts=1/fsT_s=1/f_s.

  • Quantization: maps each held value to one of 2n2^n amplitude intervals and is the irreversible step.

  • Encoding: labels the selected interval with an nn-bit binary word; it introduces no additional ideal error.

QuantitySymbolDefinition
Analog inputvi(t)v_i(t)Continuous-time voltage presented to the ADC front end.
Samplevi[k]=vi(kTs)v_i[k]=v_i(kT_s)Input value selected at sampling instant kTskT_s.
Sampling rate/periodfs, Tsf_s,\ T_sSamples requested per second and their spacing; Ts=1/fsT_s=1/f_s.
Bit depthnnNumber of binary digits in one output codeword.
Number of codesL=2nL=2^nDistinct digital words, numbered 00 through 2n−12^n-1.
Input limitsVmin,VmaxV_{min},V_{max}Lowest and highest specified analog inputs.
Full-scale spanVFSV_{FS}Width of the input range: VFS=Vmax−VminV_{FS}=V_{max}-V_{min}.
ReferenceVrefV_{ref}Precision voltage that establishes the converter scale; for a simple unipolar ADC, Vref=VFSV_{ref}=V_{FS}.
Step size / 1 LSBΔ,VLSB\Delta,V_{LSB}Ideal width of one code bin in volts: Δ=VFS/2n\Delta=V_{FS}/2^n.
Code / codewordDDInteger bin index and its nn-bit representation.
Transition voltageVkV_kInput boundary at which the output changes from code k−1k-1 to kk.
Code bin—Input interval producing one code; ideal width is Δ\Delta.
Quantized estimatev^i\hat v_iAnalog value assigned to the selected code, often its bin midpoint.
Quantization errorqeq_eDifference vi−v^iv_i-\hat v_i caused by finite amplitude bins.
Clipping / overrange—Input lies outside the allowed span, so the output remains at an end code.

ADC quantities used throughout this chapter.

The bit depth nn fixes the number of available codewords, 2n2^n. The word resolution may mean bit depth, one ideal LSB in volts, or the fractional step 1/2n1/2^n of full-scale span. It describes granularity, not total measurement accuracy.

Thus resolution may be reported in three equivalent ideal forms:

n bits,Δ=VFS2n volts/code,1002n% of span per code.\boxed{n\ \text{bits}},\qquad \boxed{\Delta=\frac{V_{FS}}{2^n}\ \text{volts/code}},\qquad \boxed{\frac{100}{2^n}\%\ \text{of span per code}}.

Let VFS=Vmax−VminV_{FS}=V_{max}-V_{min} be the allowed input span. For an ideal nn-bit uniform ADC,

L=2n codes,Δ=VLSB=VFS2n,\boxed{L=2^n\ \text{codes}},\qquad \boxed{\Delta=V_{LSB}=\frac{V_{FS}}{2^n}}, D=clip⁡02n−1(⌊vi−VminΔ⌋).\boxed{D=\operatorname{clip}_{0}^{2^n-1} \left(\left\lfloor\frac{v_i-V_{min}}{\Delta}\right\rfloor\right)}.

The nominal, non-overload range is the half-open interval Vmin≤vi<VmaxV_{min}\le v_i<V_{max}; values outside it, including vi≥Vmaxv_i\ge V_{max}, saturate at an end code. If code DD represents the midpoint of its interval, then, within the nominal range,

v^i=Vmin+(D+12)Δ,qe=vi−v^i∈[−Δ2,Δ2),σq2≃Δ212.\hat v_i=V_{min}+\left(D+\frac12\right)\Delta, \qquad \boxed{q_e=v_i-\hat v_i\in \left[-\frac{\Delta}{2},\frac{\Delta}{2}\right)}, \qquad \sigma_q^2\simeq\frac{\Delta^2}{12}.

The variance model assumes no overload and quantization error that is approximately uniform and uncorrelated with the input, as occurs for a sufficiently active or dithered signal. For DC or coherent low-level inputs, the error can instead be deterministic and correlated. Bipolar and offset-binary converters use the same span rule with a shifted code origin. Datasheets occasionally quote endpoint spacing VFS/(2n−1)V_{FS}/(2^n-1), so the convention stated in a numerical problem must be followed.

Resolution answers the ideal question, “how finely is the selected input span divided?” It depends on both bit depth and span:

  • increasing nn by one doubles the number of codes and halves Δ\Delta;

  • keeping nn fixed but narrowing VFSV_{FS} also reduces Δ\Delta, although it reduces allowable input headroom and may cause clipping;

  • widening a bipolar range means using its complete span. For example, a ±5 V\pm5\,\mathrm{V} range has VFS=10 VV_{FS}=10\,\mathrm{V}, not 5 V5\,\mathrm{V}.

For a required ideal voltage increment Δreq\Delta_{req}, the minimum bit depth is

nmin=⌈log⁡2 ⁣(VFSΔreq)⌉.\boxed{n_{min}=\left\lceil \log_2\!\left(\frac{V_{FS}}{\Delta_{req}}\right) \right\rceil}.

This calculation selects nominal granularity only. Noise, DNL, INL, offset, gain and reference uncertainty determine whether such a small input change can actually be distinguished or measured accurately.

TermMeaning
Nominal resolutionIdeal code count or code-bin width: 2n2^n codes and Δ=VFS/2n\Delta=V_{FS}/2^n.
AccuracyCloseness of the reported value to the true input after systematic and random errors.
Effective resolution/ENOBUsable dynamic resolution inferred from measured noise plus distortion, generally less than nn.
Noise-free resolutionStable code divisions remaining after peak-to-peak code flicker or transition noise.
SensitivitySmallest input change producing a reliably observable output change under stated test conditions.

Meanings that must not be confused with nominal resolution.

The reference voltage is the precision analog standard against which the sampled input is compared. It establishes the converter’s transfer scale: its value determines the ideal transition voltages and therefore the number of input volts represented by one code.

The reference is the ADC’s measuring ruler; it is not simply the supply voltage. The analog supply powers the circuitry, whereas the reference defines the scale. Some ADCs contain a factory-trimmed internal reference, some require an external reference, and others permit either. In every case the input, reference and supply pins must obey the ranges stated in the datasheet.

For a common unity-scaled unipolar ADC with Vmin=0V_{min}=0,

VFS=Vref,Δ=Vref2n,Vk=kΔ(k=1,2,…,2n−1).V_{FS}=V_{ref},\qquad \Delta=\frac{V_{ref}}{2^n},\qquad V_k=k\Delta\quad(k=1,2,\ldots,2^n-1).

More generally, a converter may use positive and negative reference pins, internal scaling or bipolar input translation. A useful model is

VFS=Gref(VREF+−VREF−),Δ=Gref(VREF+−VREF−)2n,\boxed{V_{FS}=G_{ref} \left(V_{\mathrm{REF}+}-V_{\mathrm{REF}-}\right)},\qquad \boxed{\Delta=\frac{G_{ref} \left(V_{\mathrm{REF}+}-V_{\mathrm{REF}-}\right)}{2^n}},

where its datasheet defines GrefG_{ref}. Therefore Vref=VFSV_{ref}=V_{FS} only in the simple unity-scaled case.

Changing the reference does not create more digital codes: an nn-bit ADC still has 2n2^n codewords. A lower permitted reference reduces volts per code but also reduces input headroom, and makes fixed input noise and offset larger when expressed in LSBs. In the simple unipolar model the last code covers [Vref−Δ,Vref)[V_{ref}-\Delta,V_{ref}); VrefV_{ref} is the upper range boundary, not an additional code value.

Away from clipping, the ideal code is proportional to Vin/VrefV_{in}/V_{ref}. Thus a small reference change has opposite signs depending on what is held fixed:

δDD∣Vin≃−δVrefVref,δv^iv^i∣D≃+δVrefVref.\boxed{\left.\frac{\delta D}{D}\right|_{V_{in}} \simeq-\frac{\delta V_{ref}}{V_{ref}}},\qquad \boxed{\left.\frac{\delta\hat v_i}{\hat v_i}\right|_D \simeq+\frac{\delta V_{ref}}{V_{ref}}}.

A higher actual reference therefore produces fewer codes for the same input, while a fixed code represents more volts.

Reference propertyEffect on conversion
Initial accuracyA constant reference-ratio error produces a full-scale or gain error.
Temperature coefficientDrift in ppm/∘C\mathrm{ppm}/{}^\circ\mathrm{C} causes the transfer scale to move with temperature.
NoiseMoving thresholds cause code flicker and reduce SNR, SINAD and ENOB.
Output impedanceDynamic ADC reference current can disturb the voltage at the reference pin.
Settling/load recoveryIncomplete recovery can create signal- and code-dependent conversion error.
Long-term driftCalibrated gain changes over months or years.
Bypass networkLocal charge storage supports transients; poor placement or unsuitable capacitance increases error.

Reference properties and their ADC consequences.

An internal reference simplifies design, while an external one can offer a different range, noise or drift grade. Either must satisfy the specified drive and decoupling requirements. A ratiometric system excites a sensor and references the ADC from the same source. If Vin=αVrefV_{in}=\alpha V_{ref}, then

D≈⌊α2n⌋,D\approx\left\lfloor\alpha2^n\right\rfloor,

so common slow reference changes cancel from the ideal code ratio. This does not cancel reference noise, settling error, offset or nonlinearity.

Ideal uniform ADC model. Each horizontal code bin has width Δ; midpoint reconstruction produces a bounded sawtooth error over the nominal half-open range. The point at V_(max) is clipped to the top code.

Ideal uniform ADC model. Each horizontal code bin has width Δ\Delta; midpoint reconstruction produces a bounded sawtooth error over the nominal half-open range. The point at VmaxV_{max} is clipped to the top code.

CodingTypical range and zero codeInterpretation
Straight binaryUnipolar; 00…000\ldots0 is the minimum inputAll bits have positive weights.
Offset binaryBipolar; midscale 10…010\ldots0 represents zeroStraight binary shifted by half scale.
Two’s complementBipolar; 00…000\ldots0 represents zeroMSB has negative sign weight; convenient for arithmetic.
Gray or thermometer codeInternal high-speed stagesAdjacent states change minimally; translated before normal binary output.

Common ADC code conventions.

Sampling, Anti-Aliasing and Sample-and-Hold

Section titled “Sampling, Anti-Aliasing and Sample-and-Hold”

The sampling rate fsf_s is the number of sampling instants per second; the sampling period is Ts=1/fsT_s=1/f_s. The signal bandwidth BB is the highest baseband frequency that must be preserved. The Nyquist rate is 2B2B, whereas the Nyquist frequency for an already chosen fsf_s is fs/2f_s/2.

An ideally band-limited baseband input can be reconstructed if

fs≥2B.\boxed{f_s\ge2B}.

Sampling replicates the analog spectrum around integer multiples of fsf_s. Aliasing occurs when these replicas overlap, making different analog frequencies produce the same samples. A sinusoid at finf_{in} appears in the first Nyquist zone at

fa=∣fin−kfs∣,0≤fa≤fs2,\boxed{f_a=\left|f_{in}-kf_s\right|},\qquad 0\le f_a\le\frac{f_s}{2},

where integer kk is chosen to place faf_a in that interval. Because aliasing is irreversible after sampling, a realizable analog anti-alias low-pass filter and a guard band require fs>2Bf_s>2B in practice.

Sampling rate determines how closely samples are spaced in time; it does not determine amplitude resolution. At fsf_s samples per second, adjacent ideal aperture instants are Ts=1/fsT_s=1/f_s apart. A sinusoid at finf_{in} is represented by

Nsamples/cycle=fsfin\boxed{N_{samples/cycle}=\frac{f_s}{f_{in}}}

samples per cycle. Increasing this ratio gives a denser time record and can ease waveform processing, but it neither adds nominal ADC bits nor removes analog errors by itself.

The Nyquist inequality is a mathematical lower bound for an ideally band-limited signal, not a complete hardware design rule. Equality fs=2Bf_s=2B leaves no transition band for a realizable anti-alias filter and can sample a band-edge tone at an unfortunate phase. In practice one chooses fs>2Bf_s>2B, passes the wanted band to BB, and attenuates unwanted analog content before it can fold into that band. The oversampling ratio is

OSR=fs2B.\boxed{OSR=\frac{f_s}{2B}}.

An OSR>1OSR>1 provides filter guard band. With suitable digital low-pass filtering and decimation, oversampling can also reduce in-band white noise. Merely collecting more noisy samples without filtering does not guarantee higher accuracy.

QuantityMeaning
Sampling rate fsf_sAperture instants per second; it sets TsT_s and the Nyquist frequency fs/2f_s/2.
Throughput/output rateCompleted codewords delivered per second; it may differ from sampling rate.
Conversion clockClock used for internal bit decisions; several cycles may be required per sample.
Conversion timeTime the architecture needs to determine one sampled code.
LatencyDelay from one sample’s aperture instant until that sample’s code appears.
Analog input bandwidthFront-end frequency range that can reach the sampler, not the unaliased baseband limit.
Per-channel sample rateRate seen by one channel; in an MM-channel scan it is at most roughly aggregate rate/MM.

Rates and bandwidths often confused in ADC specifications.

Architecture and acquisition impose an additional upper limit. A basic SAR conversion cycle must provide time to acquire and convert,

Ts≥tacq+tconv+toverhead,fs≤1tacq+tconv+toverhead.\boxed{T_s\ge t_{acq}+t_{conv}+t_{overhead}},\qquad f_s\le\frac{1}{t_{acq}+t_{conv}+t_{overhead}}.

A pipeline ADC can deliver one result each clock after a multi-cycle latency; a sigma-delta modulator samples internally much faster than its decimated output-word rate. After a multiplexer changes channel, the driver and sampling capacitor must settle again, so usable per-channel rate can be lower than the simple aggregate-rate division.

Sample-and-hold circuit and timing vocabulary. Aperture delay locates the actual sampling instant; latency extends until the corresponding code is valid.

Sample-and-hold circuit and timing vocabulary. Aperture delay locates the actual sampling instant; latency extends until the corresponding code is valid.

QuantityDefinitionWhy it matters
Track modeSwitch closed; CHC_H follows the inputDriver must charge the ADC input network.
Acquisition time tacqt_{acq}Time to settle after entering track modeLimits source resistance and multiplexing speed.
Aperture delay tapt_{ap}Mean delay from sample command to actual hold instantShifts the effective sampling time.
Aperture jitter σt\sigma_tRandom uncertainty of the aperture instantConverts input slew into voltage noise.
Droop rateHeld-voltage change caused by leakageCreates error during a long conversion.
Hold step/pedestalOutput jump at track-to-hold transitionCaused mainly by switch charge injection.
FeedthroughInput or clock coupling into the held nodeDisturbs the supposedly constant sample.
Settling accuracyError band reached during acquisitionMust normally be below the allocated LSB fraction.

Sample-and-hold quantities.

For a simple first-order source resistance RsR_s charging input capacitance CinC_{in}, settling from a full-scale step to within 12\tfrac12 LSB requires approximately

tacq≥(n+1)ln⁡(2) RsCin.\boxed{t_{acq}\ge(n+1)\ln(2)\,R_sC_{in}}.

Real ADC data sheets include switch resistance, charge redistribution and driver recovery, so this is a design estimate rather than a replacement for the specified acquisition-time test.

ADC quality is described in three complementary ways: static transfer tests use slowly changing or DC inputs; dynamic tests use sampled sinusoids and spectra; timing/interface tests describe when a valid code appears and how quickly another conversion can begin.

SpecificationMeaning or relationDesign consequence
Resolutionnn bits, 2n2^n codes; Δ=VFS/2n\Delta=V_{FS}/2^nIdeal granularity, not guaranteed accuracy
Input range/spanAllowed limits and VFS=Vmax−VminV_{FS}=V_{max}-V_{min}Must match signal, common-mode and reference limits
Transition voltageInput at which one code changes to the nextBasic measured point for transfer testing
Quantization errorIdeally bounded by ±Δ/2\pm\Delta/2 for midpoint roundingIrreducible ideal amplitude uncertainty
Offset errorHorizontal shift of transfer characteristicProduces nearly constant code error
Gain errorFull-scale slope error after offset removalReference/gain calibration can reduce it
DNLActual code width minus 1 LSB1\,\mathrm{LSB}DNL>−1 LSB>-1\,\mathrm{LSB} prevents missing codes
INLDeviation from an ideal straight transfer lineLimits absolute accuracy and distortion
MonotonicityCode never decreases as input increasesEssential in control and closed-loop systems
Missing codeA nominal code has no positive-width input binIndicates local non-monotonic or zero-width behavior
Transition noiseCode spread under repeated conversion of one DC inputSets code flicker and noise-free resolution
TUEWorst total unadjusted error under stated conditionsCombines specified uncalibrated error contributions
Reference and temperature driftChange of scale and errors with supply/temperatureSets long-term calibration stability

Static ADC specifications.

Define endpoint boundaries V0=VminV_0=V_{min} and VL=VmaxV_L=V_{max}, where L=2nL=2^n; for 1≤k≤L−11\le k\le L-1, let VkV_k be the actual transition from code k−1k-1 to kk. The width of code kk, 0≤k≤L−10\le k\le L-1, is Wk=Vk+1−VkW_k=V_{k+1}-V_k. Then

DNL[k]=WkΔ−1,INL[k]=Vk−Vk,idealΔ.\boxed{DNL[k]=\frac{W_k}{\Delta}-1},\qquad \boxed{INL[k]=\frac{V_k-V_{k,ideal}}{\Delta}}.

INL must name its reference line (endpoint or best fit). A code is missing when Wk≤0W_k\le0, equivalently DNL[k]≤−1DNL[k]\le-1 LSB. If the peak-to-peak input-referred transition noise is Vn,ppV_{n,pp}, an approximate noise-free resolution is

Nfree≈log⁡2 ⁣(VFSVn,pp),N_{free}\approx\log_2\!\left(\frac{V_{FS}}{V_{n,pp}}\right),

provided the measurement bandwidth and test method are stated.

Static ADC errors relative to the dashed ideal transfer. Offset and gain change scale; DNL changes code widths; INL measures transfer curvature.

Static ADC errors relative to the dashed ideal transfer. Offset and gain change scale; DNL changes code widths; INL measures transfer curvature.

Offset error translates the transfer characteristic horizontally without ideally changing the spacing between transitions. Using the transition-voltage sign convention adopted here,

EOS,V=V1,actual−V1,ideal,EOS,LSB=EOS,VΔ,EOS,%FS=100EOS,VVFS.\boxed{E_{OS,V}=V_{1,actual}-V_{1,ideal}}, \qquad \boxed{E_{OS,LSB}=\frac{E_{OS,V}}{\Delta}}, \qquad \boxed{E_{OS,\%FS}=100\frac{E_{OS,V}}{V_{FS}}}.

A positive value means the measured transition occurs at a larger input voltage (the staircase is shifted right). Some data sheets define polarity from code error rather than transition error and therefore reverse this sign; the stated convention must always be checked.

Applying zero input and observing a nonzero code is a useful quick test only for a compatible unipolar coding convention. Measuring the first specified transition is the more general definition. Digital subtraction can calibrate offset, but cannot recover analog headroom already lost by early clipping.

Gain error is measured after offset removal. It changes the average slope or span of the transfer. One transition-based definition is

EG,V=VL−1,actual,corr−VL−1,ideal,EG,LSB=EG,VΔ,EG,%FS=100EG,VVFS.\boxed{E_{G,V}=V_{L-1,actual,corr}-V_{L-1,ideal}}, \qquad E_{G,LSB}=\frac{E_{G,V}}{\Delta}, \qquad E_{G,\%FS}=100\frac{E_{G,V}}{V_{FS}}.

Here “corr” means that the measured characteristic has first been translated to remove offset. A two-point calibration can correct offset and average gain, but any curvature, unequal code widths, noise and clipping remain.

Offset and gain errors measured from transition positions. Offset is removed first; gain error is then measured at the upper end of the transfer.

Offset and gain errors measured from transition positions. Offset is removed first; gain error is then measured at the upper end of the transfer.

Differential nonlinearity is a local width error. If one measured code bin has width Wk=1.2ΔW_k=1.2\Delta, then DNL[k]=+0.2DNL[k]=+0.2 LSB; if Wk=0.4ΔW_k=0.4\Delta, then DNL[k]=−0.6DNL[k]=-0.6 LSB. At Wk=0W_k=0, DNL[k]=−1DNL[k]=-1 LSB and code kk is missing.

Integral nonlinearity is a global transition-position error. Before removing endpoint slope, the transition locations satisfy

Vk=V0+∑i=0k−1Wi,INL[k]=∑i=0k−1DNL[i]V_k=V_0+\sum_{i=0}^{k-1}W_i, \qquad INL[k]=\sum_{i=0}^{k-1}DNL[i]

when the same V0V_0 and ideal Δ\Delta are used. Thus consecutive positive or negative DNL values accumulate into INL; isolated positive and negative DNL can partly cancel.

Two reference-line methods are common:

  • Endpoint INL: Use the line through specified end transitions after offset/gain handling. It preserves endpoint meaning and is common in precision specifications.

  • Best-fit INL: Choose a regression line that best fits all measured transitions. It usually reports a smaller numerical INL, so values from the two methods are not directly interchangeable.

Differential and integral nonlinearity. DNL measures each bin width; transition-based INL is the cumulative departure from the chosen ideal line.

Differential and integral nonlinearity. DNL measures each bin width; transition-based INL is the cumulative departure from the chosen ideal line.

QuantityDefinitionImportant distinction
Sampling rate fsf_sSampling instants requested per secondMust satisfy anti-alias needs.
Throughput/output rateCompleted output words per secondCan differ from fsf_s or inverse latency.
Conversion time tconvt_{conv}Time used internally to determine one codeArchitecture dependent.
LatencyDelay from aperture instant to corresponding valid outputA pipeline may have high throughput but many-cycle latency.
Analog input bandwidthFront-end frequency response before samplingMay exceed fs/2f_s/2; does not permit unplanned aliasing.
SNRFundamental signal power divided by noise powerExcludes harmonic distortion.
SINADFundamental divided by noise plus distortionDirectly determines ENOB.
THDRSS harmonic rms amplitude divided by fundamental amplitudeMeasures nonlinearity, not random noise.
SFDRFundamental-to-largest-spur ratioDoes not integrate the entire noise floor.
ENOBEquivalent ideal bit count from measured SINADDynamic performance, usually frequency dependent.
Aperture jitterRMS sampling-time uncertaintySets an SNR limit that worsens with finf_{in}.

Timing and AC specifications.

For an ideal full-scale sinusoid and uncorrelated uniform quantization error,

SNRq≃6.02n+1.76 dB,ENOB=SINAD−1.766.02,\boxed{SNR_q\simeq6.02n+1.76\ \mathrm{dB}},\qquad \boxed{ENOB=\frac{SINAD-1.76}{6.02}},

while sampling-clock jitter imposes approximately

SNRj≃−20log⁡10(2πfinσt).\boxed{SNR_j\simeq-20\log_{10}(2\pi f_{in}\sigma_t)}.

This assumes an ideal ADC and sufficiently active codes; real SINAD also contains thermal noise, clock jitter, harmonic distortion and reference error. Resolution is therefore not the same as accuracy or effective resolution.

An ADC architecture is the internal method used to locate the input’s code bin. Parallel comparison minimizes decision time; feedback methods reuse one comparator; subranging resolves a few bits per stage; integration converts voltage to a time ratio; oversampling trades excess sample rate for in-band resolution.

Principal ADC families organized by the mechanism used to reach a code.

Principal ADC families organized by the mechanism used to reach a code.

No architecture is universally best. Selection starts with signal bandwidth, required ENOB, latency, throughput, power, input loading, noise rejection and whether deterministic timing or absolute DC accuracy matters most.

Unless stated otherwise, the architecture equations and numerical examples below use a unipolar straight-binary range 0≤vi<Vref0\le v_i<V_{ref} with Vmin=0V_{min}=0 and Δ=Vref/2n\Delta=V_{ref}/2^n. Bipolar designs shift the origin or select reference polarity according to their coding.

A Flash converter generates all decision thresholds with a resistor string, compares the sampled input with every threshold simultaneously, and converts the resulting thermometer code to binary with a priority encoder. An nn-bit converter requires

NC=2n−1 comparators,VTk=k2nVref,k=1,…,2n−1.\boxed{N_C=2^n-1\ \text{comparators}},\qquad V_{Tk}=\frac{k}{2^n}V_{ref},\quad k=1,\ldots,2^n-1.

Three-bit Flash ADC: the ladder creates seven thresholds, the comparator bank produces a thermometer code, and the encoder returns a three-bit word.

Three-bit Flash ADC: the ladder creates seven thresholds, the comparator bank produces a thermometer code, and the encoder returns a three-bit word.

Input intervalComparators HIGHThermometer codeBinary output
[0,Vref/8)[0,V_{ref}/8)none
[Vref/8,2Vref/8)[V_{ref}/8,2V_{ref}/8)C1C_1
[2Vref/8,3Vref/8)[2V_{ref}/8,3V_{ref}/8)C1,C2C_1,C_2
[3Vref/8,4Vref/8)[3V_{ref}/8,4V_{ref}/8)C1C_1–C3C_3
[4Vref/8,5Vref/8)[4V_{ref}/8,5V_{ref}/8)C1C_1–C4C_4
[5Vref/8,6Vref/8)[5V_{ref}/8,6V_{ref}/8)C1C_1–C5C_5
[6Vref/8,7Vref/8)[6V_{ref}/8,7V_{ref}/8)C1C_1–C6C_6
[7Vref/8,Vref)[7V_{ref}/8,V_{ref})C1C_1–C7C_7

Complete three-bit Flash conversion table; comparator order is [C7,C6,…,C1][C_7,C_6,\ldots,C_1], from highest to lowest threshold.

At an exact ideal threshold either adjacent code can appear depending on the specified transition convention; comparator offset and noise create a small real uncertainty region. Writing comparators in ascending order reverses every thermometer word, so the ordering must always be labelled.

All decisions occur in parallel, so Flash is the fastest architecture, requiring essentially one comparator-plus-encoder delay. The cost is exponential area, power and input capacitance: 8 bits require 255 comparators and 10 bits require 1023. Comparator offset, resistor mismatch and metastable “bubbles” limit accuracy, so Flash is normally low/medium resolution. Applications include oscilloscopes, video, radar and very-high-speed data acquisition.

Operating sequence and practical circuitry

Section titled “Operating sequence and practical circuitry”
  1. Acquire and hold viv_i so every comparator sees the same voltage.

  2. The 2n2^n equal ladder resistors create thresholds Δ,2Δ,…,(2n−1)Δ\Delta,2\Delta,\ldots,(2^n-1)\Delta.

  3. All 2n−12^n-1 comparators resolve simultaneously. With Ck=1C_k=1 for vi≥VTkv_i\ge V_{Tk}, the ideal outputs form one monotonic run.

  4. Bubble-correction logic removes sparse isolated comparator errors.

  5. A leading-one/priority encoder finds the highest crossed threshold and latches its index as the binary output.

Practical comparator channels often contain a low-offset preamplifier, a fast regenerative latch and a retiming register before the encoder. Preamplification reduces latch kickback and input-referred offset; retiming aligns unequal comparator delays and confines metastability before deep logic.

A practical Flash comparator path and its latency components. Extra register stages can raise throughput but add clock-cycle latency.

A practical Flash comparator path and its latency components. Extra register stages can raise throughput but add clock-cycle latency.

With acquisition excluded from the internal decision time,

tconv≈tcmp+tbubble+tenc+tsetup,tlat≈tacq+tconv.\boxed{t_{conv}\approx t_{cmp}+t_{bubble}+t_{enc}+t_{setup}}, \qquad \boxed{t_{lat}\approx t_{acq}+t_{conv}}.

An unpipelined converter’s maximum output rate is limited by this cycle. A registered or pipelined comparator/encoder tree may sustain a higher throughput while adding one or more clock cycles of latency.

If every resistor-string segment has resistance RR,

Rstring=2nR,Ilad=Vref2nR,Plad=Vref22nR.R_{string}=2^nR, \qquad I_{lad}=\frac{V_{ref}}{2^nR}, \qquad P_{lad}=\frac{V_{ref}^2}{2^nR}.

If a fixed total resistance RTR_T is chosen instead, each segment is RT/2nR_T/2^n and Ilad=Vref/RTI_{lad}=V_{ref}/R_T. The signal driver sees roughly

Cin≈(2n−1)Ccmp+Croute+CESD,\boxed{C_{in}\approx(2^n-1)C_{cmp}+C_{route}+C_{ESD}},

so comparator input capacitance and kickback also grow exponentially.

nn (bits)346810
Codes/resistors816642561024
Comparators715632551023

Full-Flash hardware growth.

An ideal thermometer code has only one zero–one boundary. Comparator offset, noise, reference kickback, unequal delay or input motion can create an isolated wrong bit called a bubble. Local majority logic such as

Ck′=maj⁡(Ck−1,Ck,Ck+1)C'_k=\operatorname{maj}(C_{k-1},C_k,C_{k+1})

can repair a sparse one-bit bubble; robust encoders detect a valid run or boundary rather than trusting one comparator. This cannot repair grossly non-monotonic decisions or an input that changes too much during the aperture.

Interpolating Flash synthesizes intermediate thresholds from fewer physical preamplifiers. Folding reuses one comparator bank over coarse ranges. A two-step/subranging ADC resolves coarse bits, subtracts a DAC estimate, then resolves the residue. These reduce input capacitance, area and power at the cost of extra stages, calibration or latency.

A counter ADC resets an nn-bit counter to zero, converts each count through a DAC and increments until the comparator detects VDAC≥viV_{DAC}\ge v_i. Its output is therefore the first trial code whose DAC value reaches the held input. With VDAC(D)=Vmin+DΔV_{DAC}(D)=V_{min}+D\Delta, this stop convention gives

Dramp=min⁡ ⁣(2n−1,⌈vi−VminΔ⌉).D_{ramp}=\min\!\left(2^n-1, \left\lceil\frac{v_i-V_{min}}{\Delta}\right\rceil\right).

The explicit terminal-count clamp is essential because the largest ordinary DAC level is Vmax−ΔV_{max}-\Delta; without it, an input in the final bin would never satisfy VDAC≥viV_{DAC}\ge v_i. Designs that latch the previous count produce the lower-edge floor convention instead.

Counter ADC feedback and its input-dependent DAC ramp. A tracking variant retains the previous code and moves one LSB per clock toward the input.

Counter ADC feedback and its input-dependent DAC ramp. A tracking variant retains the previous code and moves one LSB per clock toward the input.

Conversion time depends on input amplitude:

Tconv≈DTclk,Twc≈(2n−1)Tclk,T_{conv}\approx D T_{clk},\qquad \boxed{T_{wc}\approx(2^n-1)T_{clk}},

plus reset, acquisition and latch overhead. For uniformly distributed input codes, average search time is about 2n−12^{n-1} clocks. The architecture is simple and low cost, but much slower than SAR because it performs a linear search instead of a binary search.

A tracking or servo ADC retains its previous code. An up/down counter increments when vi>VDACv_i>V_{DAC} and decrements when vi<VDACv_i<V_{DAC}. It follows slowly varying inputs quickly but moves only one LSB per clock, so a basic tracking condition is

∣dvidt∣max≲Δfclk.\boxed{\left|\frac{\mathrm{d}v_i}{\mathrm{d}t}\right|_{max}\lesssim\Delta f_{clk}}.

Rapid input steps require many clocks and comparator chatter can make the code toggle around one transition.

A successive-approximation-register ADC performs a binary search. It holds the input constant, tentatively sets one bit from MSB to LSB, converts that trial code back to analog, and retains or clears the bit according to one comparator decision. Conversion therefore has fixed duration independent of input value.

A SAR ADC uses comparator feedback to run a binary search; the trial code drives a DAC, represented here by a four-bit R–2R ladder.

A SAR ADC uses comparator feedback to run a binary search; the trial code drives a DAC, represented here by a four-bit R–2R2R ladder.

For straight-binary conversion, the trial DAC voltage is

VDAC=Vref(bn−12+bn−24+⋯+b02n).\boxed{V_{DAC}=V_{ref}\left(\frac{b_{n-1}}2+ \frac{b_{n-2}}4+\cdots+\frac{b_0}{2^n}\right)}.

Modern SARs often use a binary-weighted capacitive array rather than R–2R2R, but the bit-test algorithm and ideal transfer are the same.

  1. Acquire and hold viv_i; clear the register and assert start of conversion (SOC).

  2. Tentatively set the MSB, giving VDAC=Vref/2V_{DAC}=V_{ref}/2.

  3. If vi≥VDACv_i\ge V_{DAC} retain the bit; otherwise clear it.

  4. Tentatively set the next bit while preserving earlier decisions. Repeat comparison through the LSB.

  5. After nn decisions, latch the code and assert end of conversion (EOC).

The internal decision time is approximately

tconv≃nTclk+toh,tcycle≃tacq+tconv.\boxed{t_{conv}\simeq nT_{clk}+t_{oh}}, \qquad \boxed{t_{cycle}\simeq t_{acq}+t_{conv}}.

The held input must not move enough to alter a decision during those trials.

Four-bit SAR conversion: a retained bit moves the trial upward; a cleared bit moves it downward, halving the remaining search interval each time.

Four-bit SAR conversion: a retained bit moves the trial upward; a cleared bit moves it downward, halving the remaining search interval each time.

SAR offers an excellent speed, resolution, power and area compromise, commonly 8–18 bits. Its limits include S/H acquisition, reference settling, DAC matching/linearity, comparator offset/noise and clock feedthrough. Applications include microcontrollers, multiplexed sensor interfaces, data acquisition and digital instrumentation.

A half-flash ADC, also called a two-step or subranging ADC, divides an nn-bit conversion into a coarse Flash decision and a fine Flash decision. A DAC reconstructs the coarse result; the converter subtracts it from the same held input and quantizes the remaining residue to obtain the lower bits.

“Half-flash” means that the output bits are approximately divided between two Flash stages; it does not mean that the circuit uses exactly half as many comparators as a full Flash ADC. For an 8-bit design, a 4+44+4 split is natural. The input must remain held while both decisions, the DAC reconstruction and the residue operation take place.

Ideal 8-bit half-flash (two-step subranging) ADC. The residue gain expands one coarse-code interval to the fine ADC’s full input range; without this ×16 block, the fine ADC must instead use a range of V_(ref)/16.

Ideal 8-bit half-flash (two-step subranging) ADC. The residue gain expands one coarse-code interval to the fine ADC’s full input range; without this ×16\times16 block, the fine ADC must instead use a range of Vref/16V_{ref}/16.

The conversion path contains seven functional blocks:

BlockFunction
Sample-and-holdCaptures viv_i and keeps one value constant throughout both conversion steps.
Coarse 4-bit FlashLocates the held input in one of 16 coarse ranges and produces the four MSBs CC.
-bit DACReconstructs the lower boundary VDACV_{DAC} of the selected coarse range.
SubtractorForms the residue r=vs−VDACr=v_s-V_{DAC}, the part not represented by the coarse code.
Residue amplifierUsually multiplies rr by 1616 so one coarse interval occupies the fine Flash ADC’s full range.
Fine 4-bit FlashQuantizes the scaled residue and produces the four LSBs FF.
Delay/latches and logicDelays the early MSBs, aligns both results and forms the final 8-bit word; practical designs may also correct redundant decisions.

Blocks in an 8-bit half-flash ADC.

Let the coarse stage resolve mm bits and the fine stage resolve ℓ\ell bits, so n=m+ℓn=m+\ell. For a unipolar input 0≤vs<Vref0\le v_s<V_{ref},

Δ=Vref2m+ℓ,ΔC=Vref2m=2ℓΔ.\Delta=\frac{V_{ref}}{2^{m+\ell}}, \qquad \Delta_C=\frac{V_{ref}}{2^m}=2^\ell\Delta .

The ideal coarse conversion, DAC reconstruction and residue are

C=⌊vsΔC⌋,VDAC=CΔC,r=vs−VDAC,\boxed{C=\left\lfloor\frac{v_s}{\Delta_C}\right\rfloor}, \qquad \boxed{V_{DAC}=C\Delta_C}, \qquad \boxed{r=v_s-V_{DAC}},

where 0≤r<ΔC0\le r<\Delta_C. A residue gain G=2mG=2^m expands this interval to the fine ADC’s full range:

r′=2mr,F=⌊r′Vref/2ℓ⌋=⌊rΔ⌋.r'=2^m r, \qquad \boxed{F=\left\lfloor\frac{r'}{V_{ref}/2^\ell}\right\rfloor =\left\lfloor\frac{r}{\Delta}\right\rfloor}.

The aligned result is the concatenation

D=2ℓC+F.\boxed{D=2^\ell C+F}.

For an ideal 4+44+4 converter, G=16G=16 and D=16C+FD=16C+F. If the residue is not amplified, the fine ADC must instead have full-scale span ΔC=Vref/16\Delta_C=V_{ref}/16; its local step is then ΔC/16=Vref/256\Delta_C/16=V_{ref}/256.

  1. Sample: the S/H acquires viv_i and enters hold mode.

  2. Coarse conversion: the first 4-bit Flash ADC selects one of 16 coarse ranges and outputs CC, the four MSBs.

  3. Reconstruction: the DAC converts CC to the analog coarse estimate VDAC=C(Vref/16)V_{DAC}=C(V_{ref}/16).

  4. Residue extraction: the subtractor forms r=vs−VDACr=v_s-V_{DAC}; ideally 0≤r<Vref/160\le r<V_{ref}/16.

  5. Fine conversion: either rr is amplified by 1616 and applied to a full-range 4-bit Flash ADC, or an unamplified residue is applied to a fine ADC whose range is Vref/16V_{ref}/16.

  6. Alignment: latches retain the earlier MSBs until the LSBs are ready, then logic forms D=C ∥ F=16C+FD=C\,\|\,F=16C+F.

The decisions are sequential. A nonpipelined half-flash latency is approximately

t2step≃tcoarse+tDAC,res+tfine+tlogic,\boxed{t_{2step}\simeq t_{coarse}+t_{DAC,res}+t_{fine}+t_{logic}},

where tDAC,rest_{DAC,res} includes DAC, subtractor, residue-gain and settling time. Thus it is slower than a full Flash ADC but normally much faster than an nn-step iterative converter. It cannot automatically accept one new sample per clock; interstage holding and pipelining are required to overlap conversions.

Important error sources are coarse-comparator offset and bubbles, coarse-DAC INL, subtractor offset, residue-gain error/nonlinearity, incomplete settling, S/H droop, reference mismatch and fine-comparator offset/noise. In a strict 4+44+4 concatenation, a wrong coarse decision near a subrange boundary can move the output by 16 final LSBs. Practical converters therefore often provide overlap or redundant bits: the fine stage covers beyond one nominal coarse interval, and digital correction combines overlapping stage decisions. This tolerates bounded coarse-comparator and residue errors, but it does not fix arbitrary gross errors or an unsettled residue.

Half-flash ADCs offer much lower input capacitance, area and comparator power than full Flash at the same nominal resolution. Their costs are extra latency, a precision DAC/residue path, interstage matching and calibration complexity. They are useful in video, imaging, communication receivers and high-speed instrumentation where full Flash is too large or power hungry but SAR speed is insufficient.

A pipeline ADC divides conversion among clocked stages. Each stage samples its input residue, resolves a few coarse bits with a small sub-ADC, converts those bits back through a sub-DAC, subtracts that estimate and amplifies the remaining residue for the next stage.

Pipeline ADC. Each stage resolves a few coarse bits, subtracts their DAC estimate, amplifies the residue and passes it to the next clocked stage.

Pipeline ADC. Each stage resolves a few coarse bits, subtracts their DAC estimate, amplifies the residue and passes it to the next clocked stage.

For an ideal stage resolving bb bits,

vres,next=2b(vres−VDAC).\boxed{v_{res,next}=2^b\left(v_{res}-V_{DAC}\right)}.

Here bb is the integer gain exponent of a nonredundant ideal stage. The stage bits emerge on different clock cycles, so digital logic delays, aligns and combines them. A conventional “1.5-bit” stage has three decision regions, contributes roughly one effective bit and normally uses residue gain 22, not 21.52^{1.5}; its redundant range permits correction of finite sub-comparator offset.

Once all stages are full, a pipeline can deliver one conversion per clock even though one sample needs several clocks to traverse the chain:

throughput≈fclk,latency≈NstagesTclk.\boxed{\text{throughput}\approx f_{clk}},\qquad \boxed{\text{latency}\approx N_{stages}T_{clk}}.

It therefore offers high throughput at medium/high resolution, but incurs multi-cycle latency, residue-amplifier settling and gain errors, sub-DAC linearity limits, clocking complexity and substantial analog power. Typical uses include video, intermediate-frequency digitization and high-speed data acquisition.

Single-Slope and Dual-Slope Integrating ADCs

Section titled “Single-Slope and Dual-Slope Integrating ADCs”

An integrating ADC converts voltage into a measured time or count by using an op-amp integrator. A single-slope converter times one calibrated ramp; a dual-slope converter first integrates the unknown for a fixed time and then measures the time required by an opposite reference to return the integrator to zero.

Integrating conversion deliberately trades speed for averaging, high DC resolution and good rejection of periodic interference. It suits slowly varying measurements and instruments, especially digital multimeters, weighing systems and precision panel meters; it is generally unsuitable for high-bandwidth, continuous waveform acquisition.

A single-slope ADC resets an integrator to zero, applies a constant reference of known polarity, and times the resulting linear ramp until it reaches the unknown input. In the figure, the applied input is −Vref-V_{ref}, so an inverting integrator produces a positive ramp.

Single-slope ADC. A fixed-slope reference ramp is timed until it reaches the unknown input; the count changes if R, C, V_(ref) or the clock period changes.

Single-slope ADC. A fixed-slope reference ramp is timed until it reaches the unknown input; the count changes if RR, CC, VrefV_{ref} or the clock period changes.

With the capacitor initially discharged,

vr(t)=−1RC∫0t(−Vref) dτ=VrefRCt.v_r(t)=-\frac{1}{RC}\int_0^t(-V_{ref})\,\mathrm{d}\tau =\frac{V_{ref}}{RC}t.

The comparator changes state when vr(T)=viv_r(T)=v_i, hence

T=RCviVref.\boxed{T=RC\frac{v_i}{V_{ref}}}.

If the clock period is TcT_c and the counter records approximately N=T/TcN=T/T_c pulses,

N≃RCTcviVref,vi≃NTcVrefRC.\boxed{N\simeq\frac{RC}{T_c}\frac{v_i}{V_{ref}}}, \qquad \boxed{v_i\simeq\frac{NT_cV_{ref}}{RC}}.

A larger input therefore needs a longer ramp time and produces a larger count; the ramp slope itself remains fixed during one conversion.

  1. Momentarily close the reset switch to discharge the integrating capacitor and clear the counter.

  2. Apply −Vref-V_{ref} to the integrator and open the clock gate while vr<viv_r<v_i.

  3. Count clock pulses as the reference ramp rises linearly.

  4. When vrv_r reaches viv_i, the comparator closes the gate; latch the count NN as the output code.

  5. Reset the integrator and counter before the next conversion.

The simplicity is attractive, but its scale depends directly on several analog and timing quantities. For fixed viv_i, small changes produce approximately

δNN≃δRR+δCC−δVrefVref−δTcTc.\boxed{\frac{\delta N}{N}\simeq \frac{\delta R}{R}+\frac{\delta C}{C} -\frac{\delta V_{ref}}{V_{ref}} -\frac{\delta T_c}{T_c}}.

Resistor/capacitor tolerance and temperature coefficient, capacitor ageing and leakage, reset residue, integrator offset, comparator offset and clock error all change the result. Conversion time is also input-dependent and approaches 2nTc2^nT_c near full scale when the ramp is calibrated for an nn-bit count. These limitations make the basic single-slope ADC unsuitable for precision measurement without frequent calibration.

A dual-slope ADC removes the first-order dependence on RR, CC and clock period by using the same integrator and clock in two opposite-slope phases. It first integrates the unknown input for a fixed run-up interval T1T_1, then applies a known opposite-polarity reference and counts the variable run-down interval T2T_2 required to return to zero.

Dual-slope ADC architecture and counter-controlled sequence: a fixed M-clock run-up followed by a measured N-clock run-down.

Dual-slope ADC architecture and counter-controlled sequence: a fixed MM-clock run-up followed by a measured NN-clock run-down.

The capacitor and counter are reset. Practical converters may also measure and store integrator/comparator offset during an auto-zero interval. Residual charge must be small enough that each conversion begins from the same initial state.

The switch applies viv_i for a prescribed MM clock periods, T1=MTcT_1=MT_c; commonly M=2nM=2^n. For a constant positive input,

V1=−viT1RC.\boxed{V_1=-\frac{v_iT_1}{RC}}.

The integrator ramps negative. A counter overflow or timing register marks the end of exactly MM clocks, changes the input switch to −Vref-V_{ref} and clears or restarts the run-down counter.

The opposite reference produces a positive slope. At time tt after run-down begins,

vint(T1+t)=V1+VrefRCt.v_{int}(T_1+t)=V_1+\frac{V_{ref}}{RC}t.

The zero-crossing comparator keeps the clock gate open until vint(T1+T2)=0v_{int}(T_1+T_2)=0. Therefore

−viT1RC+VrefT2RC=0,viVref=T2T1.-\frac{v_iT_1}{RC}+\frac{V_{ref}T_2}{RC}=0, \qquad \boxed{\frac{v_i}{V_{ref}}=\frac{T_2}{T_1}}.

With T1=MTcT_1=MT_c and T2=NTcT_2=NT_c,

vi=VrefNM.\boxed{v_i=V_{ref}\frac{N}{M}}.

For M=2nM=2^n, the latched run-down count is ideally N≃2nvi/VrefN\simeq2^n v_i/V_{ref}. The nominal unipolar range remains half-open, 0≤vi<Vref0\le v_i<V_{ref}, so the largest valid nn-bit count is 2n−12^n-1; an exact or larger full-scale input must be treated as overrange.

  1. Reset/auto-zero the integrator and counter.

  2. Select viv_i and integrate for exactly MM clocks. With an nn-bit timing counter, overflow after M=2nM=2^n clocks can change the switch.

  3. Select −Vref-V_{ref}, restart the counter at zero and continue clocking while the integrator output has not crossed zero.

  4. At the zero crossing, close the clock gate and latch the run-down count NN; compute or directly interpret N/M=vi/VrefN/M=v_i/V_{ref}.

Ignoring reset and auto-zero overhead,

Tconv=T1+T2=(M+N)Tc.\boxed{T_{conv}=T_1+T_2=(M+N)T_c}.

For M=2nM=2^n and 0≤vi<Vref0\le v_i<V_{ref},

Twc≃(2n+1−1)Tc≈2n+1Tc.\boxed{T_{wc}\simeq(2^{n+1}-1)T_c \approx2^{n+1}T_c}.

Each added bit approximately doubles the fixed run-up and worst-case conversion time at the same clock frequency. Increasing fclkf_{clk} reduces conversion time only until integrator settling, comparator response, switching and counter limits dominate.

For a time-varying input, run-up measures its average over T1T_1:

v‾i=1T1∫0T1vi(t) dt,v‾i=VrefT2T1.\overline v_i=\frac{1}{T_1}\int_0^{T_1}v_i(t)\,\mathrm{d}t, \qquad \boxed{\overline v_i=V_{ref}\frac{T_2}{T_1}}.

Rectangular integration has normalized magnitude response

∣H(f)∣=∣sin⁡(πfT1)πfT1∣,\boxed{|H(f)|=\left|\frac{\sin(\pi fT_1)}{\pi fT_1}\right|},

with zeros at f=k/T1f=k/T_1 for nonzero integer kk. Choosing T1=20 msT_1=20\,\mathrm{ms} rejects ideal 50 Hz50\,\mathrm{Hz} interference; choosing 16.667 ms16.667\,\mathrm{ms} rejects 60 Hz60\,\mathrm{Hz}. A 100 ms100\,\mathrm{ms} run-up contains five 50-Hz periods and six 60-Hz periods, so it ideally rejects both. This averaging explains the excellent mains-noise immunity of integrating meters, although noninteger-frequency interference and front-end saturation are not eliminated.

FeatureSingle slopeDual slope
Measured intervalReference ramp until it reaches viv_iReference run-down after fixed-time input integration
Ideal resultN≃(RC/Tc)(vi/Vref)N\simeq(RC/T_c)(v_i/V_{ref})N/M=vi/VrefN/M=v_i/V_{ref}
R,CR,C dependenceDirect scale errorCancels to first order between phases
Clock dependenceClock period sets scaleCommon clock period cancels in N/MN/M
Noise rejectionLittle inherent averagingStrong averaging; selectable notches at k/T1k/T_1
Conversion timeInput-dependent, up to about 2nTc2^nT_cT1+T2T_1+T_2, up to about 2n+1Tc2^{n+1}T_c
Typical useSimple low-cost conversionDMMs and precision low-rate measurement

Single-slope versus dual-slope conversion.

Dual-slope conversion offers high resolution, excellent DC accuracy and strong periodic-noise rejection with modest analog hardware. Its limitations are low throughput, input-dependent latency, reference error, integrator leakage and finite gain, dielectric absorption, comparator offset, switching charge and auto-zero overhead. It is preferred for slowly changing signals where measurement reliability matters more than acquisition speed.

A sigma-delta converter trades bandwidth for resolution. A high-rate feedback modulator produces a low-resolution, usually one-bit stream; a digital low-pass filter removes out-of-band quantization noise and a decimator reduces the rate to high-resolution output words.

A first-order sigma-delta ADC produces a high-rate one-bit stream, shapes quantization noise out of band, then filters and decimates the result.

A first-order sigma-delta ADC produces a high-rate one-bit stream, shapes quantization noise out of band, then filters and decimates the result.

For signal bandwidth BB and modulator rate fsf_s, the oversampling ratio is

OSR=fs2B.\boxed{OSR=\frac{f_s}{2B}}.

The summer subtracts one-bit DAC feedback, the integrator accumulates this error (sigma operation), and the quantizer emits a pulse density representing input amplitude. A one-bit DAC is inherently monotonic because it has only two reference levels.

Oversampling spreads approximately fixed quantization-noise power across the wider Nyquist band; digital filtering retains only the small in-band fraction. Oversampling alone gains about 3 dB3\,\mathrm{dB} SNR whenever OSR doubles. A linearized first-order modulator has approximately

Y(z)=STF(z)X(z)+(1−z−1)E(z),\boxed{Y(z)=STF(z)X(z)+(1-z^{-1})E(z)},

so its noise-transfer function has a zero at DC. Quantization noise is suppressed in band and pushed to high frequency; a first-order loop ideally gains about 9 dB9\,\mathrm{dB} in-band SNR per doubling of OSR. More generally, for ideal order pp,

Pq, in∝OSR−(2p+1),ΔSNR≃(6p+3) dBP_{q,\,in}\propto OSR^{-(2p+1)},\qquad \Delta SNR\simeq(6p+3)\,\mathrm{dB}

per doubling of OSR. The digital filter then rejects the shaped out-of-band noise and decimates to the required output rate.

Sigma-delta ADCs provide excellent linearity, noise rejection and 16–24-bit resolution with simple analog circuitry. Their limitations are restricted signal bandwidth, filter latency, clock-jitter sensitivity, digital complexity, idle tones and higher-order loop-stability concerns. They dominate audio, precision sensor and biomedical conversion.

Practical ADC Interface, Error Budget and Calibration

Section titled “Practical ADC Interface, Error Budget and Calibration”

An ADC never operates in isolation. The signal source, anti-alias filter, driver, sampling network, reference, clock, supplies, printed-circuit layout and digital interface all contribute error or limit speed.

Practical ADC signal chain. Conversion accuracy depends on the source, driver, reference, clock, supplies, return paths and digital interface—not only on the nominal converter core.

Practical ADC signal chain. Conversion accuracy depends on the source, driver, reference, clock, supplies, return paths and digital interface—not only on the nominal converter core.

A single-ended ADC measures one input relative to a common reference. A differential ADC measures

vd=vp−vn,vCM=vp+vn2.v_d=v_p-v_n, \qquad v_{CM}=\frac{v_p+v_n}{2}.

Both pins must remain inside their specified common-mode range even when vdv_d is valid. Differential drive rejects common coupled noise and even-order distortion, but does not remove reference, mismatch or clock errors. Unipolar, bipolar, pseudo-differential and fully differential ranges must therefore be distinguished before assigning codes.

  • Input driver: Must charge the switched input capacitance within tacqt_{acq}, absorb kickback, remain stable with the ADC load and preserve the required bandwidth and distortion.

  • Anti-alias network: Sets the wanted passband and attenuates all unwanted energy that would fold below fs/2f_s/2. Its resistance and the ADC input capacitance also affect settling.

  • Reference: Sets every transition voltage. Check absolute accuracy, noise density, temperature coefficient, output impedance, load-transient recovery and local bypassing.

  • Clock: Its rms jitter limits high-frequency SNR; keep clock edges from coupling into the analog input and reference.

  • Supplies and layout: Keep analog/reference loops short, provide local decoupling, control return-current paths and prevent digital output currents from sharing sensitive analog impedance.

Reference variation is a scale error. For a fixed output code interpreted as an analog estimate in a unipolar converter, a small reference change produces approximately

δv^iv^i≃δVrefVref.\frac{\delta\hat v_i}{\hat v_i}\simeq \frac{\delta V_{ref}}{V_{ref}}.

Input-referred white noise density ene_n integrated over effective noise bandwidth BNB_N gives the useful estimate

Vn,rms≃enBN.V_{n,rms}\simeq e_n\sqrt{B_N}.

For error contributions expressed in the same units at one operating point, a conservative worst-case bound and an independent-error estimate are

EWC=∑i∣Ei∣,ERSS=∑iEi2.\boxed{E_{WC}=\sum_i|E_i|}, \qquad \boxed{E_{RSS}=\sqrt{\sum_iE_i^2}}.

Use worst-case addition when guaranteed limits must hold simultaneously; use root-sum-square only for sufficiently independent random terms. A two-point calibration can remove much of offset and gain error, but it cannot remove quantization, random noise, missing codes or detailed INL shape. Calibration conditions must remain representative of reference, temperature and loading.

TypeDecision methodTiming behaviorRepresentative bitsBest fit and principal limitations
FlashAll thresholds in parallelComparator + encoder delay; highest raw speed–10Scopes, radar, direct IF; exponential power, area, input capacitance and matching.
Half-flashCoarse Flash, DAC/residue path, then fine FlashTwo sequential decisions plus residue settling–12Video and fast DAQ; far fewer comparators than Flash, but residue accuracy limits.
Counter / trackingDAC feedback with linear up/down searchInput dependent; worst counter case 2n−12^n-1 clocks–12Simple controls and slowly varying signals; poor step response and low speed.
SARDAC feedback with MSB-to-LSB binary searchFixed nn decisions plus acquisition–20General DAQ and MCUs; DAC/reference settling and acquisition limit accuracy/speed.
PipelineCoarse sub-ADC, sub-DAC subtraction and residue gain per stageOne output/clock after fill; multi-cycle latency–16Video and IF; residue gain/settling, calibration, clocking and analog power.
Single-slopeFixed reference ramp timed to the input crossingInput-dependent; up to about 2n2^n clocks–12Simple low-cost conversion; RCRC, ramp, comparator and clock drift limit accuracy.
Dual-slopeFixed run-up, timed reference run-downT1+T2T_1+T_2; very slow but deterministic ratio–22DMMs/precision DC; strong mains rejection, leakage and reference drift.
Sigma-deltaOversampled feedback, noise shaping and digital decimationMany modulator clocks plus filter latency–24Audio/precision sensors; limited signal bandwidth, latency, idle tones and loop limits.

Practical comparison of the principal ADC architectures.

The bit ranges are representative, not hard physical boundaries. Process, calibration, bandwidth and power targets can move them substantially.

Scaling check: At n=12n=12, Flash needs 40954095 comparators, two 6-bit Flash stages need only 126126 comparators before redundancy and correction hardware, a counter ADC can need 40954095 trial clocks, SAR needs 1212, and a filled pipeline can output one word per clock after its latency, and a dual-slope converter with T1=4096TcT_1=4096T_c can need nearly 81928192 clocks. The tabulated bit ranges are representative, not hard architectural limits.

Reference Definitions and Architecture Mechanisms

Section titled “Reference Definitions and Architecture Mechanisms”
TermDefinition
ADCCircuit that samples an analog input, quantizes each held sample to one of finite levels and encodes the selected level as a digital word.
Bit depthNumber nn of bits in one output word; it provides 2n2^n possible codes.
ResolutionSmallest ideal code interval: Δ=VFS/2n\Delta=V_{FS}/2^n, also stated as nn bits or 100/2n%100/2^n\% of span.
Reference voltagePrecision analog standard that establishes the ADC transfer scale and its ideal transition voltages.
Sampling rateNumber of sampling instants per second, fs=1/Tsf_s=1/T_s; its associated Nyquist frequency is fs/2f_s/2.
QuantizationIrreversible assignment of a continuous-amplitude sample to one finite code bin.
Quantization errorDifference between the actual sample and represented level; ideally $
Single-slopeIntegrating ADC that counts the time for a fixed reference ramp to reach the unknown input; its scale depends on RCRC.
Dual-slopeIntegrating ADC that applies the input for a fixed time, then counts an opposite-reference return to zero; RCRC cancels ideally.
Half-flashTwo-step ADC that resolves coarse bits, subtracts their DAC value and quantizes the remaining residue for the fine bits.
Conversion timeInternal time needed to determine one result after conversion begins.
LatencyTime from sampling instant to availability of that sample’s valid output code.
ThroughputNumber of completed output codes per second after any pipeline is full.
DNL / INLCode-width error relative to 1 LSB / transition deviation from a specified ideal straight line.
ENOBNumber of ideal bits giving the measured SINAD: (SINAD−1.76)/6.02(SINAD-1.76)/6.02.

Core ADC definitions.

ArchitectureCore mechanism
FlashParallel comparators test every threshold simultaneously, minimizing latency but requiring exponentially more hardware.
Half-flashA coarse Flash/DAC stage forms a residue that a second Flash stage resolves, reducing comparators at the cost of residue settling.
CounterA DAC code rises one LSB per clock until it crosses the input, so time depends on input and can approach 2n−12^n-1 clocks.
SARA feedback DAC performs an MSB-to-LSB binary search, giving a fixed nn comparator decisions.
PipelineClocked stages resolve coarse bits and amplify residue, giving one output per clock after multi-cycle latency.
Single-slopeA fixed reference ramp is timed until it reaches the input; simple hardware leaves the result sensitive to ramp and clock scale.
Dual-slopeFixed-time integration of the input followed by timed opposite-reference integration gives an accurate ratio and rejects periodic noise.
Sigma-deltaOversampling and feedback shape quantization noise out of band; digital filtering and decimation recover high in-band resolution.

ADC architecture mechanism summary.