ee247 lecture 21 - university of california, berkeley · 2009. 11. 12. · eecs 247- lecture 21...

31
EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 1 EE247 Lecture 21 ADC Converters –Techniques to reduce flash ADC complexity (continued) • Interpolating & folding (continued) –Multi-Step ADCs • Two-Step flash • Pipelined ADCs – Effect of sub-ADC, sub-DAC, gain stage non-idealities on overall ADC performance Error correction by adding redundancy Digital calibration Correction for inter-stage gain nonlinearity EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 2 Parallel Folders Using Only Zero-Crossings V ref + 3/4 * Δ Comparator Folder 3 Folder 2 Folder 1 Folder 4 Logic V ref + 2/4 * Δ V ref + 1/4 * Δ V ref + 0/4 * Δ V in LSB bits (to be combined with MSB bits) Comparator Comparator Comparator

Upload: others

Post on 15-Sep-2020

3 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 1

EE247Lecture 21

ADC Converters–Techniques to reduce flash ADC complexity

(continued)• Interpolating & folding (continued)

–Multi-Step ADCs• Two-Step flash• Pipelined ADCs

– Effect of sub-ADC, sub-DAC, gain stage non-idealities on overall ADC performance

• Error correction by adding redundancy• Digital calibration• Correction for inter-stage gain nonlinearity

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 2

Parallel Folders Using Only Zero-Crossings

Vref + 3/4 * Δ

Comparator

Folder 3

Folder 2

Folder 1

Folder 4

LogicVref + 2/4 * Δ

Vref + 1/4 * Δ

Vref + 0/4 * Δ

Vin

LSB bits

(to be combined with MSB bits)

Comparator

Comparator

Comparator

Page 2: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 3

Parallel Folder Outputs

• 4 folders with 4 folds each

• 16 zero crossings• 4 LSB bits

• Higher resolution• More folders

Large complexity• Interpolation

0 1 2 3 4 5

-0.4

-0.2

0

0.2

0.4

Vin /Δ

Fold

er O

utpu

t

F1F2F3F4

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 4

Folding & Interpolation

FineFlashADC

ENCODER

Vref + 3/4 * Δ

Folder 3

Folder 2

Folder 1

Folder 4

Vref + 2/4 * Δ

Vref + 1/4 * Δ

Vref + 0/4 * Δ

Page 3: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 5

Folder / Interpolator OutputExample:4 Folders + 4 Resistive Interpolator per Stage

0 1 2 3 5-0.5

-0.4

-0.3

-0.2

-0.1

0

0.1

0.2

0.3

0.4

0.5

Vin / Δ

Fold

er /

Inte

rpol

ator

Out

put F1

F2I1I2I3

1.5 1.6 1.7 1.8

-0.02

0

0.02

0.04

4

Note: Output of two folders only + corresponding interpolator only shown

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 6

A 70-MS/s 110-mW 8-b CMOS Folding and Interpolating A/D Converter

Ref: B. Nauta and G. Venes, JSSC Dec 1985, pp. 1302-8

Page 4: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 7

A 70-MS/s 110-mW 8-b CMOS Folding and Interpolating A/D Converter

Note: Total of 40 (MSB=8, LSB=32) comparators compared to 28-1= 255 for straight flash

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 8

A 70-MS/s 110-mW 8-b CMOS Folding and Interpolating A/D Converter

Ref: B. Nauta and G. Venes, JSSC Dec 1985, pp. 1302-8

Page 5: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 9

Multi-Step ADCs• Two-Step flash• Pipelined ADCs

– Effect of sub-ADC, sub-DAC, gain stage non-idealities on overall ADC performance

• Error correction by adding redundancy• Digital calibration• Correction for inter-stage gain nonlinearity

– Implementation • Practical circuits• Stage scaling• Combining the bits• Stage implementation

– Circuits– Noise budgeting

• How many bits per stage?

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 10

Two-Step Example: (2+2)Bits

• Using only one ADC: output contains large quantization error

• "Missing voltage" or "residue" ( -εq1)

• Idea: Use second ADC to quantize and add -εq1

0 1 2 300

01

10

11

0 1 2 3-1

-0.5

0

0.5

1

[LS

B]

ADC Input [LSB]

Vin

+Dout = Vin + εq1

2-bit ADC 2-bit ADC

???

ε q1

D out

Vin

Page 6: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 11

Two Stage Example

• Use DAC to compute missing voltage• Add quantized representation of missing voltage• Why does this help? How about εq2 ? • Since maximum voltage at input of the 2nd ADC is Vref1/4 then for 2nd ADC

Vref2=Vref1/4 and thus εq2= εq1/4 =Vref1/16 4bit overall resolution

Vin “Coarse“

+

Dout = Vin + εq1

2-bit ADC 2-bit ADC

“Fine“+-2-bit DAC

-εq1

-εq1+εq2

-εq1+εq2

Vref2Vref1

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 12

Two Step (2+2) Flash ADC

Vin Vin Vin

4-bit Straight Flash ADC Ideal 2-step Flash ADC

Voltage quantized by 2nd ADC

Page 7: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13

Two Stage Example

• Fine ADC is re-used 22 times• Fine ADC's full scale range needs to span only 1 LSB of coarse

quantizer

221

22

2 222 ⋅== refref

q

VVε

00 01 10 11

Vref1/22

−εq1

00

01

10

11

First ADC“Coarse“

Second ADC“Fine“VinVref1

Vref2

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 14

Two-Stage (2+2) ADC Transfer Function

0000000100100011010001010110011110001001101010111100110111101111

CoarseBits(MSB)

FineBits(LSB)

Dout

VinVref1

Page 8: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 15

Residue or Multi-Step Type ADCIssues

• Operation:– Coarse ADC determines MSBs– DAC converts the coarse ADC output to analog- Residue is found by

subtracting (Vin-VDAC)– Fine ADC converts the residue and determines the LSBs– Bits are combined in digital domain

• Issue: 1. Fine ADC has to have precision in the order of overall ADC 1/2LSB 2. Speed penalty Need at least 1 clock cycle per extra series stage to resolve

one sample

(optional)Coarse ADC

(B1-Bit)Vin

Residue

DAC(B1-Bit)

Fine ADC(B2-Bit)

Bit

Com

bine

r

(B1+

B2)

-Bit

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 16

Solution to Issue (1)Reducing Precision Required for Fine ADC

• Accuracy needed for fine ADC relaxed by introducing inter-stage gain

– Example: By adding gain of x(G=2B1=4) prior to fine ADC in (2+2)bit case, precision required for fine ADC is reduced to 2-bit only!

– Additional advantage- coarse and fine ADC can be identical stages

Vin “Coarse“

+

Dout= Vin + εq1

2-bit ADC 2-bit ADC

“Fine“+-

2-bit DAC-εq1

-εq1+εq2

-εq1+εq2

G=2B1

Page 9: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 17

Solution to Issue (2)Increasing ADC Throughput

• Conversion time significantly decreased by employing T/H betweenstages– All stages busy at all times operation concurrent– During one clock cycle coarse & fine ADCs operate concurrently:

• First stage samples/converts/generates residue of input signal sample # n• While 2nd samples/converts residue associated with sample # n-1

Vin “Coarse“

+Dout= Vin + εq1

2-bit ADC

2-bit ADC

“Fine“+-

2-bit DAC-εq1

- εq1+εq2

T/H+(G=2B1)

T/H

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 18

Multi-Step ADCs• Two-Step flash• Pipelined ADCs

– Effect of sub-ADC, sub-DAC, gain stage non-idealities on overall ADC performance

• Error correction by adding redundancy• Digital calibration• Correction for inter-stage gain nonlinearity

– Implementation • Practical circuits• Stage scaling• Combining the bits• Stage implementation

– Circuits– Noise budgeting

• How many bits per stage?

Page 10: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 19

Pipeline ADCBlock Diagram

• Idea: Cascade several low resolution stages to obtain high overall resolution (e.g. 10bit ADC can be built with series of 10 ADCs each 1-bit only!)

• Each stage performs coarse A/D conversion and computes its quantization error, or "residue“

• All stages operate concurrently

Align and Combine Data

Stage 1B1 Bits

Stage 2B2 Bits

Digital output(B1 + B2 + ... + Bk) Bits

Vin

MSB... ...LSB

Stage k Bk Bits

Vres1 Vres2

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 20

Pipeline ADCCharacteristics

• Number of components (stages) grows linearly with resolution

• Pipelining– Trading latency for conversion speed– Latency may be an issue in e.g. control systems– Throughput limited by speed of one stage → Fast

• Versatile: 8...16bits, 1...200MS/s

• One important feature of pipeline ADC: many analog circuit non-idealities can be corrected digitally

Page 11: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 21

Pipeline ADC Concurrent Stage Operation

• Stages operate on the input signal like a shift register• New output data every clock cycle, but each stage

introduces at least ½ clock cycle latency

Align and Combine Data

Stage 1B1 Bits

Stage 2B2 Bits

Digital output(B1 + B2 + ... + Bk) Bits

VinStage kBk Bits

φ1φ2

acquireconvert

convertacquire

...

...

CLKφ1

φ2

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 22

Pipeline ADCLatency

[Analog Devices, AD 9226 Data Sheet]

Note: One conversion per clock cycle & 8 clock cycle latency

Page 12: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 23

Pipeline ADCDigital Data Alignment

• Digital shift register aligns sub-conversion results in time

Stage 2B2 Bits

VinStage kBk Bits

φ1φ2

acquireconvert

convertacquire

...

...

+ +Dout

CLK CLK CLK

Stage 1B1 Bits

CLKφ1

φ2

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 24

Cascading More Stages

• LSB of last stage becomes very small • All stages need to have full precision• Impractical to generate several Vref

VinADC

+-DACADC

B3 bitsB2 bitsB1 bits

Vref Vref /2B1 Vref /2(B1+B2) Vref /2(B1+B2+B3)

Page 13: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 25

Pipeline ADC Inter-Stage Gain Elements

• Practical pipelines by adding inter-stage gain use single Vref• Precision requirements decrease down the pipe

– Advantageous for noise, matching (later), power dissipation

Vin ADCB3 bitsB2 bitsB1 bits

Vref

2B1

+-DACADC

Vref Vref Vref

2B22B3

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 26

Complete Pipeline StageVin +

-B-bitDAC

B-bitADC

D

-GVres

Vin00

Vref

−εq1

“ResiduePlot“

E.g.:B=2

G=22 =4

Vres

VrefNote: None of the blocks have ideal performanceQuestion: What is the effect of the non-idealities?

Page 14: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 27

Pipeline ADCErrors

• Non-idealities associated with sub-ADCs, sub-DACs and gain stages error in overall pipeline ADC performance

• Need to find means to tolerate/correct errors

• Important sources of error– Sub-ADC errors- comparator offset– Gain stage offset– Gain stage gain error– Sub-DAC error

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 28

Pipeline ADC Single StageModel

Vin

Dout

-G V res

−εq

Σ

εq

Σ

Vres = Gxεq

Page 15: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 29

Pipeline ADC Multi-Stage Model

1 q2 2out in,ADC q1

d1 d1 d 2

q( n 1) ( n 1) qnn 2 n 1

d( n 1)dj djj 1 j 1

G GD V 1 1

G G GG

.. . 1GG G

εε

ε ε− −− −

= =

⎛ ⎞ ⎛ ⎞= + − + − +⎜ ⎟ ⎜ ⎟⎜ ⎟ ⎜ ⎟

⎝ ⎠ ⎝ ⎠⎛ ⎞⎜ ⎟+ − +⎜ ⎟⎝ ⎠∏ ∏

ΣΣ

εq1

- G1

Σ

ΣΣ

εq2

- G2

Σ

ΣΣ

εq(n-1)

- Gn-1

Σ

Vin,ADC

Dout 1/Gd1 1/Gd2

Vres1 Vres2 Vres(n-1)

Σ

1/Gd(n-1)

εqnD1 D2 D(n-1)Dn

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 30

Pipeline ADC Model• If the "Analog" and "Digital" gain/loss is precisely matched:

=≈

=≈

=−

=

+

⎟⎟⎠

⎞⎜⎜⎝

⎛×

⎟⎟⎠

⎞⎜⎜⎝

⎛××=

×

==

1

12

1

12

1

11

1

log

2log

223log20

212

22log20.

log20..

n

jjnADC

n

jj

BADC

n

jj

B

n

jj

B

ref

ref

GBB

GB

G

G

V

V

NoiseQuantrmsSignalFSrmsRD

n

n

n

stage finalin bits of # & 2

where1

1

, ==+=∏

=

BnV

GVD Bn

refqnn

jj

qnADCinout ε

ε

Page 16: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 31

Pipeline ADCObservations

• The aggregate ADC resolution is independent of sub-ADC resolution!

• Effective stage resolution Bj=log2(Gj)

• Overall conversion error does not (directly)depend on sub-ADC errors!

• Only error term in Dout contains quantization error associated with the last stage

• So why do we care about sub-ADC errors?Go back to two stage example

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 32

Pipeline ADCSub-ADC Errors

∏−

=

+= 1

1

, n

jj

qnADCinout

GVD

ε

1

2, G

VD qADCinout

ε+=

Grows outside ½ LSB bounds

Vin,ADC ADC2-bits

B1 =2-bits

Vref Vref

Vres1

V εq2Vin0

0

Vref

Vres1

ref

Page 17: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 33

Pipeline ADC1st-Stage Comparator Offset

First stage ADC Levels:(Levels normalized to LSB)Ideal comparator threshold: -1, 0, +1Comparator threshold including offset: -1, 0.3, +1

Problem: Vres1 exceeds 2nd pipeline stage overload range

Missing Code!

Overall ADC Transfer Curve

Vres1

Vres2

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 34

Pipeline ADC Three Ways to Deal with Sub-ADC Errors

• All involve “sub-ADC redundancy”

• Redundancy in stage that produces errors– Choose gain for residue to be processed

by the 2nd stage < 2B1

– Higher resolution sub-ADC & sub-DAC

• Redundancy in succeeding stage(s)

Page 18: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 35

(1) Inter-Stage Gain Following 1st Stage <2B1

00

Vin ADCB1 bits

Vref

εq2

Vres1

• Choose G1 less than 2B1

• Effective stage resolution could become non-integer B1eff=log2G1

• E.g. if G1=3.8 B1eff=1.8bit

-Ref: A. Karanicolas et. al., JSSC 12/1993

Vref

Vref

Vres1

VinVref

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 36

Correction Through Redundancy

“enlarged” residuum still within input range of next stage

Overall ADC Transfer Curve

Vres1

Vres2

If G1=2 instead of 4 Only 1-bit resolution from first stage (3-bit total) In spite of comparator offset: No overall error!

Page 19: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 37

(2) Higher Resolution Sub-ADC

Vin ADCB1 bits

Vref

Vres1

Vref

00

εq2

Vref

Vres1

VinVref

• Keep G1 precise power of two (e.g. G1=4)

• Add extra decision levels in sub-ADC (e.g. add 1 extra bit to 1st stage)

• E.g. B1=B1eff+1

-Ref: Singer et. al., VSLI 1996

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 38

(3) Over-Range AccommodationThrough Increase in Following Stage Resolution

• No redundancy in stage with errors

• Add extra decision levels in succeeding stage

Ref: Opris et. al., JSSC 12/1998

Vin

Vref00

Vref

Vres1

Vin,ADCADCB1 bits

Vref Vref

εq2

Vres1

Page 20: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 39

Redundancy• The preceding analysis applies to any stage

in an n-stage pipeline• Can always perceive a multi-stage pipelined

ADC as a single stage + backend ADCVin

B4 bitsB3 bitsB2 bitsB1 bits

VinB2+B3+B4 bitsB1 bits

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 40

Redundancy• In literature, sub-ADC redundancy schemes are often called "digital correction" – a misnomer!

• No error correction takes place

• We can tolerate sub-ADC errors as long as:–The residues stay "within the box", or–Another stage downstream "returns the residue to

“within the box" before it reaches last quantizer

• Let's calculate tolerable errors for popular "1.5 bits/stage" topology

Page 21: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 41

1.5 Bits/Stage Example

• Comparators threshold levels placed strategically

• G=2

• Beff=log2G=log22=1

• B=log2(2+1)=1.589...

• 0.5bit redundancy

Ref: Lewis et. al., JSSC 3/1992

Vos=Vref/8

00

Vref

Vres1

VinVref

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 42

3-Stage 1.5-bit-per-Stage Pipelined ADC• All three stages

Comparator with offset

• Overall transfer curve

No missing codesSome DNL error

Ref: S. Lewis et al, “A 10-b 20-MS/s Analog-to-Digital Converter,” J. Solid-State Circ., pp. 351-8, March 1992

Overall Transfer Curve

Vres1

Vres2

Vres3

Page 22: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 43

Summary So Far Pipelined A/D Converters

VinADC2B1eff 2B2 2B3

+-DACADC

B2 bitsB1 bits

• Cascade of low resolution stages– Stages operate concurrently- trades latency for resolution– Throughput limited by speed of one stage → Fast

• Errors and correction– Built-in redundancy compensate for sub-ADC inaccuracies (interstage gain:

G=2Bneff, Bneff < Bn)

B3 bits2B2eff 2B3eff

VrefVref Vref Vref

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 44

Pipeline ADCErrors

• Non-idealities associated with sub-ADCs, sub-DACs and gain stages error in overall pipeline ADC performance

• Need to find means to tolerate/correct errors

• Important sources of error– Sub-ADC errors- comparator offset– Gain stage offset– Gain stage error– Sub-DAC error

Page 23: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 45

Inter-Stage Amplifier Offset

• Input referred converter offset – usually no problem• Equivalent sub-ADC offset - accommodated through

adequate redundancy

+

ADC DAC-

D

VresVin G+

Vos +

-Vos

+

Vos

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 46

Pipeline ADCErrors

• Non-idealities associated with sub-ADCs, sub-DACs and gain stages error in overall pipeline ADC performance

• Need to find means to tolerate/correct errors

• Important sources of error– Sub-ADC errors- comparator offset– Gain stage offset– Gain stage gain error– Sub-DAC error

Page 24: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 47

Gain Stage Gain Error

1, 1

1

2 ( 1) ( 1)22 1

1 2 ( 1)

1 1

1

1 ... 1

out in ADC qd

q q n n qnn n

d d d ndj dj

j j

GD VG

GGG G G

G G

ε

ε ε

δδ

ε− −− −

= =

⎛ ⎞+= + −⎜ ⎟+⎝ ⎠⎛ ⎞⎛ ⎞

+ − + + − +⎜ ⎟⎜ ⎟ ⎜ ⎟⎝ ⎠ ⎝ ⎠∏ ∏

ΣΣ

εq1

- G1+δ

Σ

ΣΣ

εq2

- G2

Σ

ΣΣ

εq(n-1)

- Gn-1

Σ

Vin,ADC

Dout 1/(Gd1+δ ) 1/Gd2

Vres1 Vres2 Vres(n-1)

Σ

1/Gd(n-1)

εqnD1 D2 D(n-1)Dn

- Resolution is function of log2G therefore error in G affects resolutionSmall amount of gain error can be tolerated

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 48

Interstage Gain Error

-1 -0.5 0 0.5 11

0

1First Stage Residue (Gain Error)

Vin

Vre

s

1 0.5 0 0.5 11

0

1Converter Transfer Function (Gain Error)

Vin

Dou

t

1 0.5 0 0.5 10.2

0

0.2Transfer Function Error(Gain Error)

Vin

Dou

t(ide

al) -

Dou

t

Page 25: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 49

Gain Stage Gain Inaccuracy

• Gain error can be compensated in digital domain – "Digital Calibration"

• Problem: Need to measure/calibrate digital correction coefficient

• Example: Calibrate 1-bit first stage

• Objective: Measure G in digital domain

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 50

ADC Model

( )DACinres VVGV −⋅=1

2/)1(0)0(

refDAC

DAC

VDVDV

====

2

VrefG Vin⎛ ⎞⎜ ⎟⋅ −⎝ ⎠

inG V⋅

Page 26: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 51

Gain Stage Inacurracy Calibration – Step 1

Vin= const.+

-1-bitDAC

1-bitADC

D

GVres1

(1)

BackendDback

(1)

MUX

“1“

Vref

( )( )

storeVVV

GD

VVGV

ref

refinback

refinres

→−

⋅=

−⋅=

2/

2/

)1(

)1(1

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 52

Gain Stage Inacurracy Calibration – Step 2

Vin= const.+

-1-bitDAC

1-bitADC

D

GVres1

(2)

BackendDback

(2)

MUX

“0“

Vref

( )( ) storeVVGD

VGV

ref

inback

inres

→−⋅=

−⋅=0

0)2(

)2(1

Page 27: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 53

Gain Stage Inacurracy Calibration – Evaluate

( )

( )

GDD

VVGD

VVV

GD

backback

ref

inback

ref

refinback

⋅=−

−−−−−−−−−−−−−−−−−

−⋅=−

−⋅=

21

0

2/

)2()1(

)2(

)1(

• To minimize the effect of backend ADC noise perform measurement several times and take the average

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 54

Accuracy Bootstrapping

• Highest sensitivity to gain errors in front-end stages

∏∏−

=

−−

=

− +⎟⎟⎠

⎞⎜⎜⎝

⎛−++⎟⎟

⎞⎜⎜⎝

⎛−+⎟⎟

⎞⎜⎜⎝

⎛−+= 1

1

)1(

)1(2

1

)1(

2

2

1

2

1

11, 1...11 n

jdj

qn

nd

nn

jdj

nq

dd

q

dqADCinout

GGG

GGG

GGGVD

εεεε

ΣΣ

εq1

- G1

Σ

ΣΣ

εq2

- G2

Σ

ΣΣ

εq(n-1)

- Gn-1

Σ

Vin,ADC

Dout 1/Gd1 1/Gd2

Vres1 Vres2 Vres(n-1)

Σ

1/Gd(n-1)

εqnD1 D2 D(n-1)Dn

Page 28: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 55

"Accuracy Bootstrapping"

VinBn bitsStage 3Stage 2Stage 1 Stage k

“Sufficiently Accurate“Direction of Calibration

Ref:

A. N. Karanicolas et al. "A 15-b 1-Msample/s digitally self-calibrated pipeline ADC," IEEE J. Of Solid-State Circuits, pp. 1207-15, Dec. 1993

E. G. Soenen et al., "An architecture and an algorithm for fully digital correction of monolithic pipelined ADCs," TCAS II, pp. 143-153, March 1995

L. Singer et al., "A 12 b 65 MSample/s CMOS ADC with 82 dB SFDR at 120 MHz," ISSCC 2000, Digest of Tech. Papers., pp. 38-9 (calibration in opposite direction!)

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 56

Pipeline ADCErrors

• Non-idealities associated with sub-ADCs, sub-DACs and gain stages error in overall pipeline ADC performance

• Need to find means to tolerate/correct errors

• Important sources of error– Sub-ADC errors- comparator offset– Gain stage offset– Gain stage error– Sub-DAC error

Page 29: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 57

DAC Errors

• Can be corrected digitally as well• Same calibration concept as gain errors

Vary DAC codes & measure errors via backend ADC

Vin +-

B1-bitDAC

D

GVres1

Dback

B1-bitADC +

Dout - 1/G

εDAC

+

Backend

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 58

DAC Calibration – Step 1

• εDAC(0) equivalent to offset - ignore

+-

B1-bitDAC

D

GVres1

Dback

B1-bitADC +

Dout1/G

BackendVin= const.

MUX

“0“

+

εDAC (0)

Page 30: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 59

DAC Calibration – Step 2...2B1

• Stepping through DAC codes 1...2B1 -1 yields all incremental correction values

• Measurements repeated and averages to account for variance associated with noise

+-

B1-bitDAC

D

GVres1

Dback

B1-bitADC +

Dout1/G

εDAC(1...2B1-1 )

BackendVin= const.

MUX

1...2B1 -1

+

Cal. Register

-

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 60

Pipeline ADC Example: Calibration Hardware

• Above block diagram may seem extensive however, in current fine-line CMOS technologies digital portion of a pipeline ADCs consume insignificant power and area compared to the analog sections

Ref: E. G. Soenen et al., "An architecture and an algorithm for fully digital correction of monolithic pipelined ADCs," TCAS II, pp. 143-153, March 1995

Page 31: EE247 Lecture 21 - University of California, Berkeley · 2009. 11. 12. · EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 13 Two Stage Example • Fine ADC is re-used 22 times •

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 61

Pipeline ADCBlock Diagram

• Idea: Cascade several low resolution stages to obtain high overall resolution (e.g. 10bit ADC can be built with series of 10 ADCs each 1-bit only!)

• Each stage performs coarse A/D conversion and computes its quantization error, or "residue“

Stage 1B1 Bits

Digital Output (B1+B2+………..Bk ) Bits

Vin

MSB....... ……...LSB

Vres1 Vres2Stage 2B2 Bits

Stage kBk Bits

+-DACADC

Align and Combine Data

EECS 247- Lecture 21 Pipelined ADCs © 2009 Page 62

Summary So Far Pipelined A/D Converters

VinADC2B1eff 2B2 2B3B2 bitsB1 bits

• Cascade of low resolution stages–By adding inter-stage gain= 2Beff

• No need to scale down Vref for stages down the pipe• Reduced accuracy requirement for stages coming after stage 1

–Addition of Track & Hold function to interstage-gain • Stages can operate concurrently• Throughput increased to as high as one sample per clock cycle• Latency function of number of stages & conversion-per-stage

– Correction for circuit non-idealities• Built-in redundancy compensate for sub-ADC inaccuracies such as

comparator offset (interstage gain: G=2Bneff, Bneff < Bn)

B3 bits2B2eff 2B3eff

VrefVref Vref VrefT/H+Gain