The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Han <etal/> propose a new method for parallel decimal multiplication with redundant partial products. They compare the performance of their multiplier with some previous relevant works, based on analytical and synthesis results. We have noted that the claimed critical delay path in (IEEE Trans. Computers, vol. 62, no. 5, pp. 956–968, May 2013) is faster than the actual critical delay path. Therefore,...
Different approaches for implementing a complex multiplier in pipelined FFT are considered and implemented to find an efficient one in this paper. The design is implemented in VHDL and design is synthesized on FPGA to know the performance. The design is implemented with a focus of reducing the resources used. Some approaches resulted in the reduced number of DSP blocks and others resulted in reduced...
Complex arithmetic operations are widely used in Digital Signal Processing (DSP) applications. Keeping the intermediate results in a redundant representation (e.g. carry-save) is a common technique to speed up chained arithmetic operations due to the elimination of the intermediate parallel additions which occupy significant area and largely increase the overall critical delay. Thus, arithmetic units...
The delay of the multiplier plays a critical role in many high-speed implementations and processors such as RISC, DSP, and image processing cores, etc. In this paper, a design of unsigned 32-bit multiplier is proposed, aiming to achieve the best timing performance with an appropriate area. The proposed architecture consists of a modified Radix-4 Booth encoder, a modified Wallace Tree adder, and a...
Speed and power consumption are one of the most important parameters to judge the performance of a computational method. In this paper, we compare two algorithms for 8 Bit multiplication namely Vedic Multiplication Algorithm and Booth algorithm. This paper aims in bringing to the fore the differences in compilation speeds and the chip area consumption of the two methodologies. The programming language...
Signal processing requires high performance digital signal processors(DSP) and hardware accelerators. Real and complex multiply-accumulate(MAC) units are the most critical computation units in the DSPs and accelerators, which greatly impact the performance, power and chip area of the signal processing system. A fixed-point Single-Instruction-Multiple-Data(SIMD)/vector MAC architecture is presented...
A multiplier is one of the key hardware blocks in most digital and high performance systems such as FIR filters, micro processors and digital signal processors etc. A system's performance is generally determined by the performance of the multiplier because the multiplier is generally the slowest element in the whole system and also it is occupying more area consuming. The Carry Select Adder (CSLA)...
In recent trend, power management has become critical concern due to portable applications. High power dissipation increases temperature profile of the chip and affects the performance of the design. Many techniques at different levels of design process have been recommended to reduce the power dissipation. Multiplier is one of the major sources of power dissipation in application systems like Digital...
In this paper, a high speed and low power 16×16 Vedic Multiplier is designed by using low power and high speed modified carry select adder. Modified Carry Select Adder employs a newly incremented circuit in the intermediate stages of the Carry Select Adder (CSA) which is known to be the fastest adder among the conventional adder structures. A Novel technique for digit multiplication namely Vedic multiplication...
Vedic mathematics is derived from ancient mathematics which is the simplest form of multiplication of two numbers which is one among the 16 sutras. This Vedic mathematics improves the performance of the multiplier in terms of speed. By using this technique RTL coding for 4×4 Vedic multipliers with and without Pipelining, Simulation is performed in Modelsim and got the RTL schematic in Cadence (rc)...
Lot of applications today employ multipliers to do many simple and complex jobs, from mathematical calculations to signal processing. But we only employ lower order compressors for this operation. This gives us lot of delay. The proposed paper puts to usage, higher order compressors for the same purpose. This results in reduced delay and improves efficiency greatly.
A universal floating-point fused dot-product (UFDP) unit is presented that is capable of performing floating-point multiplication and addition or subtraction operations on two pairs of data, floating-point multiply add operation on three data items, floating-point multiplication of two data items and floating-point addition or subtraction of two data items. The proposed UFDP unit could be used as...
This paper examines a modification to the Wallace/Dadda Multiplier to use carry lookahead adders instead of full adders to implement the reduction of the bit product matrix into the two numbers that are summed to make the product. Four bit carry lookahead adders are used in the reduction in place of individual full adders. Each carry lookahead adder reduces up to 9 partial products (instead of 3 with...
Addition is ubiquitous in computer systems, and rising error rates make error detection within adders increasingly important. This paper considers the best way to introduce strong, non-intrusive error detection to fixed-point addition within an existing, optimized machine datapath. A flexible family of separable error detection techniques called carry-propagate/carry-free (CP/CF) duplication is presented...
Utilizing Binary Signed-Digit (BSD) number representation in RNS arithmetic is called BSD-RNS. Up to the present, 2's complement BSD-RNS has been proposed. In this work, we utilize 1-out-of-3 encoding to represent residues in BSD-RNS. This paper proposes efficient modular multipliers for the moduli set {2n-1, 2n, 2n+1} based on 1-out-of-3 BSD number system. Compared to efficient 2's complement BSD-RNS...
Modular adders and multipliers have applications in residue number system (RNS) arithmetic, cryptography, and error-checking, where general architectures are usually designed for moduli of the form 2n±k ± 1, with very efficient realizations. However, less efficient arithmetic circuits also occasionally appear in the relevant literature for moduli of the form 2n ± δ, where δ is an odd integer and δ...
The diminished-one encoding is often considered when representing the operands in the modulo 2k+1 channels of a Residue Number System (RNS) since it can offer increased arithmetic processing speed. However, limited research is available on the design of residue-to-binary (reverse) converters for RNSs that use the diminished-one encoding in one or more channels. In this paper we introduce a simple...
This paper presents a low power and high speed 15-4 Compressor for digital signal processing applications. A new 5-3 compressor also proposed which is faster and also consumes less power than the conventional 5-3 compressor. This proposed 5-3 compressor is utilized in 15-4 compressor which will results in low power and high speed. Proposed 15-4 compressor is 11.01% faster and power consumption is...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.