asynchronous comparator design

30
Asynchronous comparator design • Motivation • Background: Sync and Async comparato • Delay-insensitive carry-lookahead comparators • Complexity Analysis • Conclusions

Upload: brilliant

Post on 23-Jan-2016

45 views

Category:

Documents


1 download

DESCRIPTION

Asynchronous comparator design. Motivation Background: Sync and Async comparators Delay-insensitive carry-lookahead comparators Complexity Analysis Conclusions. Motivation. Comparison is one of the most important operations in digital systems. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Asynchronous comparator design

Asynchronous comparator design• Motivation• Background: Sync and Async comparators• Delay-insensitive carry-lookahead comparators• Complexity Analysis• Conclusions

Page 2: Asynchronous comparator design

Motivation

• Comparison is one of the most important

operations in digital systems.

• Comparators are used in ALUs, cache memory,

MMU and data hazard detection.

• Integer comparison: use an integer adder.

Problem: addition time > comparison time.

• High speed comparison is needed.

Page 3: Asynchronous comparator design

Background: Binary Comparison

• Worst case: A=B A: 01101110 B: 01101110

• Best case: A>B A: 01101110 B: 10101110

• Comparators can perform average case behavior

Page 4: Asynchronous comparator design

Background

• Ripple-Carry Comparator(Sync):

• Flow table specification:

Page 5: Asynchronous comparator design

Background

• Delay-Insensitive Ripple-Carry Comparator:

• Flow table:

Page 6: Asynchronous comparator design

Background

• Ripple-Carry Comparator:• Logic complexity: O(n)• Time complexity: O(n)

• Delay-Insensitive Ripple-Carry Comparator: • Logic complexity: O(n)• Time complexity: O(1)

Page 7: Asynchronous comparator design

Carry-Lookahead Comparators• RCC requires n stage-propagation delays.

• Use carry-lookahead comparators(CLC).

• CLCs:

Logic complexity: O(n) Time complexity: O(log n)

Page 8: Asynchronous comparator design

8-bit carry-lookahead comparator

Page 9: Asynchronous comparator design
Page 10: Asynchronous comparator design
Page 11: Asynchronous comparator design

DI Carry-Lookahead Comparator• Delay-Insensitive Carry-Lookahead Comparators may be implemented by using delay-insensitive code.

1. dual-rail signaling: input bits 2. one-hot code: internal signals, s, g, e (S, G, E). S: smaller (A<B) G: greater (A>B) E: equal (A=B)

Page 12: Asynchronous comparator design
Page 13: Asynchronous comparator design
Page 14: Asynchronous comparator design
Page 15: Asynchronous comparator design
Page 16: Asynchronous comparator design
Page 17: Asynchronous comparator design

CMOS Implementation

• DI P-module:

Page 18: Asynchronous comparator design

CMOS Implementation

• DI I-module:

Page 19: Asynchronous comparator design

CMOS Implementation

• DI SI-module: 3 2-input AND gates.

Page 20: Asynchronous comparator design

CMOS Implementation

• Speed-up circuits for S and G signals: Dynamic OR gates.

Page 21: Asynchronous comparator design

CMOS Implementation

• Speed-up circuits for E signals: Dynamic OR gate:

Page 22: Asynchronous comparator design

SPICE Simulation:

SPICE Simulation contains two parts:• Random number inputs: 10000 random generated input pairs• Statistical data: running examples on a 32-bit ARM emulator

Page 23: Asynchronous comparator design

SPICE Simulation:

• Random number inputs: 10000 random generated input pairs a. RCC: 32.4ns b. CLC: 6.2ns

Page 24: Asynchronous comparator design

SPICE Simulation:

• Confidence Limits:

Page 25: Asynchronous comparator design

SPICE Simulation:

• Confidence Limits:

Page 26: Asynchronous comparator design

SPICE Simulation:

• Distribution of typical-case comparisons:

Page 27: Asynchronous comparator design
Page 28: Asynchronous comparator design
Page 29: Asynchronous comparator design

SPICE Simulation:

• SPICE simulation results: dynamic traces

Page 30: Asynchronous comparator design

Conclusions

• A new pratical design of DI comparator.• Theoretically,

• Logic Complexity:((n)).• Time Complexity:((1)).

• Reality:• more than 2 times faster than its sync

counterpart with 80% usable clock.• Suitable for VLSI implementation.