Abstract
The primary operation of any processor is to perform basic arithmetic operations. In all basic arithmetic operations, multiplication consumes more time to be performed. Multiplier is the component which performs the multiplication operation. Its performance speed is going to affect the speed of the entire processing unit. The major operation of multiplier is to generate final product from partial products. To perform this major operation, the required architecture may require more area which intends to increase in latency in operation. In order to improve the performance of processor with minimum area, fast multiplier must be employed to perform multiplication operation. With high speed, the multiplier should occupy less area and consume low power. In the design of multipliers, a new technology called superconductor RSFQ logic is extensively used in order to achieve a multiplier design with less area and minimum latency in operation. From the time of introduction of this technology, different types of RSFQ multipliers are proposed. This paper gives an comparative analysis of rapid single flux quantum(RSFQ) technology multipliers like integer multiplier, matrix multiplier, parallel carry-save pipelined multiplier, floating-point multiplier in terms of area (number of Josephson junctions) and latency.KeywordsRapid single flux quantum (RSFQ)Josephson junctions (JJs)Integer multiplierMatrix multiplierParallel carry-save pipelined multiplierFloating-point multiplier
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.