Dissertation > Excellent graduate degree dissertation topics show

Design of High Speed Multiplier

Author: LiZuo
Tutor: YuMingYan
School: Harbin Institute of Technology
Course: Microelectronics and Solid State Electronics
Keywords: multiplier modified Booth algorithm tree structure optimization of area complexity
CLC: TP332.22
Type: Master's thesis
Year: 2007
Downloads: 399
Quote: 1
Read: Download Dissertation

Abstract


As technical level develops, IC design progresses in both the ways of higher speed and smaller area steadily. CPU is more likely to represent this trend for it is a typical product of IC design. To get a better performance of the whole target, we should optimize all the components of the CPU in all possible ways.Multiplier is an important component of the CPU. In the domains of multimedia application, image process and so on, plenty of multiplications in cycles make multiplier a significant part, which plays an important role in deciding the performance of the whole CPU. This paper is about to focus on improvement on speed as well as area, and present three designs of multipliers varied by data width: 16×16, 32×16 and 32×32 multiplier and their actualization.First of all, the paper introduces the basic principle of multiplier briefly, and then figures out the modified radix-4 Booth algorithm in conditions of signed multiplication and unsigned multiplication separately. The number of partial product can be reduced to half of the number by original Booth algorithm, which decompresses the follow steps.After that, tree structures of the compressors considering both the parallel calculation and the balance of time delay are presented, which can improve the speed of multiplication effectively. In condition of high speed, the paper also gives three methods to reduce the number of adders in compressor in order to optimize the area. Then, we finish the design by using a grouping CLA.Verifications of the whole design show that the designs are right at RTL level. For actualization, we uses smic0.18 technical library to build the multipliers, and optimize them by using DC, which then pass the post-synthesis verification.At last, the paper analyzes the projects of accomplishing the same goal: 32×32 multiplication using three kinds of multipliers by the consideration of area and speed complexity, and figure out the optimized project.

Related Dissertations

  1. Boundedness of Commutators of Generalized Fractional Integrals,O177.6
  2. Based on complexity thinking of the School Management,G471
  3. Teacher-student Negotiated Interaction and L2 Learners’ Oral Proficiency Development,H319
  4. The Research and Design of Low Voltage Low Power CMOS Analog Multiplier,TN432
  5. Research on the Reduction of Peak to Average Power Ratio in SLM OFDM Systems,TN919.3
  6. Statistical Complexity Measureanalysis of ECG Signal Based on LMCD and JSD,TN911.6
  7. Application of Dynamic Minimum Spanning Tree in WSN Clustering Routing Protocol,TP212.9
  8. Studies on Asynchronous Multiplier Design and Research Techniques Based on Macro Cell,TP332.22
  9. Research on the Equivalentanalysis Model and Extracting Features of the Heart Sound Signal,TN911.6
  10. FPGA-based digital readout device research and design,TP212.14
  11. Software-based research affecting network software metrics,TP311.52
  12. Based on polarization-independent optical superlattice device research,O437
  13. Ary LDPC Decoding Algorithm,TN911.2
  14. Optical vector matrix multiplier theory and method of,TP332.22
  15. An Efficient Design and Simulation of Adder and Multiplier Based on Memristors,TP332.2
  16. A Comparative Study of Relationship between Personality and English Proficiency Based Upon Traditional and CT-Led Research Methods,H319
  17. A Study on Challenges Facing China’s Credit Guarantee,D923
  18. Dominating set problem identification parameter tractable algorithm,TP301.6
  19. Research and design of the FFT processor multiplier multiplexed multiplexer,TN919.3
  20. LDPC decoder, the realization of research,TN911.22
  21. Filter Trust Region Algorithms and Multiplier Algorithms for Nonlinear Bilevel Programs,O221.2

CLC: > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > Electronic digital computer (not a continuous role in computer ) > Arithmetic unit and the controller (CPU) > Arithmetic unit > Multiplication , division control
© 2012 www.DissertationTopic.Net  Mobile