1. 1 Error Detecting Adder Yugandhar Asmath Saikiran Vodela Pavan Polum Puneet Shrivastava Advisor: Dr. David W Parent 8 th May 2006

2. 2 Agenda Abstract Introduction –Why –Simple Theory –Back Ground information (Literature Review) Summary of Results Project (Experimental) Details Results Cost Analysis Conclusions

3. 3 Abstract We designed an error detecting carry free adder based on the architecture proposed by Whitney J. Townsend, Jacob A. Abraham & Parag K. Lala. in ‘On-Line Error Detecting Constant Delay Adder’. The data width was taken as four bits and the circuit was designed to operate at 200 MHz and had dimensions of 200.7x324.1  m 2 with a power consumption of 44.1 mW.

4. 4 Introduction Why the need for error tolerance? What possibly could cause errors? How can errors be detected? – Different error detecting codes –Hamming code –Gray code –m-out-of-n code We have chosen to use the 1-of-3 code for error detection!

5. 5 1-of-3 code in error detecting adder We use constant delay arithmetic with decimal number representation. As suggested in [1] and [2], we encode the binary inputs to the adder as –0 is coded as 010 –1 in any of the n-1 bits is coded as 001 –1` (-1 in signed bit representation) in the MSB as 100 The figure illustrates a two operand addition/error detection operation.

6. 6 Project Summary Inputs –Two 4-bit words as addend and augend. –A reset pin. –Clock Outputs –A 4-bit sum. –One Carry bit. –Error indication pin. Specs –Clock Frequency – 200MHz –Worst Propagation delay – 3.3ns. –Cell height 30 microns –Power consumption – 44.1 mW. –Area – 200 x 324 microns

7. 7 Project Details The 1-of-3 code is split into two 1-of-2 codes to simplify logic realization. The encoder consists of a simple inverter. Addition is carried out in two stages –The output of the 1 st stage is called intermediate sum and carry. –The intermediate sum and carry are then summed up to get the final sum. The final outputs in 1-of-3 code are then checked for errors using the checker circuit.

8. 8 Schematic

9. 9 Internal gate logics

10. 10 Verilog output

11. 11 Longest Path Calculations CELLBIT#WN LoadWP LoadCg or Cin of load Cg+Cint  phl WNWP INV121.50E-04 2.0000E-142.5000E-141.00E-102.84E-045.12E-04 NOR3112.84E-045.12E-041.3355E-141.8355E-143.70E-101.76E-049.20E-04 INV101.76E-049.20E-041.8394E-142.3394E-141.00E-102.67E-044.82E-04 NOR292.67E-044.82E-042.5139E-143.0139E-142.20E-102.63E-049.35E-04 INV82.63E-049.35E-044.0228E-144.5228E-143.00E-101.18E-042.07E-04 AOI33371.18E-042.07E-045.4404E-151.0440E-147.00E-102.05E-043.40E-04 INV62.05E-043.40E-041.8309E-142.3309E-141.50E-101.52E-042.73E-04 INV51.52E-042.73E-047.1280E-151.2128E-141.03E-101.44E-042.59E-04 AOI2241.44E-042.59E-041.3515E-141.8515E-143.00E-102.41E-044.23E-04 INV32.41E-044.23E-041.1137E-141.6137E-141.00E-101.92E-043.46E-04 AOI2221.92E-043.46E-041.8038E-142.3038E-143.30E-102.28E-043.99E-04 INV12.28E-043.99E-042.1039E-142.6039E-141.50E-101.68E-043.02E-04 Total  = 2.92 ns.

12. 12 Floor Planning

13. 13 Layout

14. 14 Verification

15. 15 Simulations Propagation delay for post-extraction - 3.36ns Propagation delay for pre-extraction - 3.22ns

16. 16 Cost Analysis Time spent on each phase of the project –Designing the logic - 2 week –Verifying logic – 2 week –Verifying timing – 1 week –Layout – 2 weeks. –Post extraction verification – 2 days. Total labour involved –200 hrs

17. 17 Summary Designed an error detecting carry free constant delay adder that works at 200MHz. Extensively used the concepts learned as a part of EE166. Used IC5.0 by Cadence systems to verify gate level logic and then lay out the logic in CMOS technology (AMI06 Process)

18. 18 Lessons learnt Start early, that’s the key to avoid last minute pressures. Take full advantage of Dr.Parent’s expertise. Work as a team, and plan well before you start. Break the projects into smaller modules and proceed step by step. Don’t be ambitious.

19. 19 References and Bibliography 1.On-Line Error Detecting Constant Delay Adder - Whitney J. Townsend, Jacob A. Abraham & Parag K. Lala. 2.On-Line Error Detection in a Carry-Free AdderWhitney J. Townsend and Mitchell A. Thornton Parag K. Lala. 3.Evolution of fault-tolerant and noise-robust digital designs - M. Hartmann and P.C. Haddow. 4.On the Design of Combinational Totally Self-checking 1-out-of-3 Code Checkers JIEN-CHUNG LO AND SUCHAI THANAWASTIEN. 5.A MOS Implementation of Totally Self-checking Checker for the 1-out-of-3 Code - D. L. TAO, PARAG K. LALA AND CARLOS R. P. HARTMAN Acknowledgements We thank Prof. Parent for his support and guidance which helped us in successfully completing the project. We would thank the Cadence Design Systems to have generously let us use their tools in our Cadence lab. We would also like to thank all our counterparts in this class who helped us in a way or the other.

20. 20 Supplementary Slides

21. 21 Supplementary Slides

22. 22 Supplementary Slides

23. 23 Supplementary Slides

24. 24 Supplementary Slides