Your SlideShare is downloading. ×
Cmos Arithmetic Circuits
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Cmos Arithmetic Circuits

3,289

Published on

This is to study about Cmos Arithmetic Circuits..ok enjoy reading …

This is to study about Cmos Arithmetic Circuits..ok enjoy reading

Published in: Technology, Business
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
3,289
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
146
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. CMOS Arithmetic Circuits
  • 2. Multiplication of numbers
  • 3. Datapath circuit techniques for adders
  • 4. Binary adder
  • 5. Binary adder
  • 6. Special trick for reducing No of transistor
    • Cout = AB + C IN .(A + B)
    • SUM = ABC CN + C ’ OUT (A + B + CIN)
    • The advantage of these type realization is that transistor count is less as compared to earlier realization using expression of slide 5.
  • 7. CMOS full adder
  • 8. Mirror Adders
    • As discussed is class, Mirror adder circuit is having symmetrical N block and P block.
  • 9. Ripple carry adder
  • 10. Pipelined adder
  • 11. Carry bypass adder
  • 12. Carry bypass adder
  • 13. Linear carry select adder
  • 14. Linear carry select adder: critical path
  • 15. Carry look-ahead adder
  • 16. Carry look-ahead circuit structures
  • 17. Carry save (CSA) and carry propagate (CPA) adders
  • 18. Adder delays
  • 19. Adder delays summary
  • 20. Datapath circuit techniques for multipliers
  • 21. Multiplier definition
  • 22. Binary multiplication
  • 23. Indirect multiplication
  • 24. Array multiplier
  • 25. MxN array multiplier critical path
  • 26. Carry ripple vs. carry save array multiplier
  • 27. Carry save multiplier
  • 28. Adder cells in array multiplier
  • 29. Array multiplier floorplan
  • 30. Wallace tree multiplier
  • 31. Wallace tree multiplier
  • 32. Wallace tree multiplier
  • 33. Dadda tree multiplier
  • 34. Serial-serial multiplier
  • 35. Serial-parallel multiplier
  • 36. Parallel vs. serial multipliers
  • 37. Parallel vs. serial multipliers
  • 38. Multiplier performance
  • 39. Multiplier performance
  • 40. Multiplier summary
  • 41. Other datapath elements
  • 42. Binary shifter
  • 43. Barrel shifter
  • 44. 4x4 barrel shifter
  • 45. Logarithmic shifter
  • 46. Power considerations in datapath structures
  • 47. Reducing supply voltage
  • 48. Reducing supply voltage
  • 49. Architecture trade-offs: reference datapath
  • 50. Parallel datapath
  • 51. Pipelined datapath
  • 52. Datapath architecture summary
  • 53. Glitching in NOR chain
  • 54. Glitching in RCA
  • 55. Switching activity in adders
  • 56. Switching activity in multipliers
  • 57. Layout strategy for datapath
  • 58. Layout strategy for datapaths
  • 59. Cell area: 2 vs. 3 metal layer process
  • 60. Summary

×