Faster and Energy-Efficient Signed Multipliers
نویسندگان
چکیده
منابع مشابه
Area and Power Efficient Booth’s Multipliers Based on Non Redundant Radix-4 Signed- Digit Encoding
In this paper, we introduce an architecture of pre-encoded multipliers for Digital Signal Processing applications based on off-line encoding of coefficients. To this extend, the Non-Redundant radix-4 Signed-Digit (NR4SD) encoding technique, which uses the digit values {-1, 0, +1, +2} or {-2,-1,0,+1}, is proposed leading to a multiplier design with less complex partial products implementation. E...
متن کاملOn net-Laplacian Energy of Signed Graphs
A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...
متن کاملA New Architecture for Signed Radix-2m Pure Array Multipliers
We present a new architecture for signed multiplication which maintains the pure form of an array multiplier, exhibiting a much lower overhead than the Booth architecture. This architecture is extended for radixencoding, which leads to a reduction of the number of partial lines, enabling a significant improvement in performance and power consumption. The flexibility of our architecture allows f...
متن کاملA New Architecture for Signed Radix-2 Pure Array Multipliers
We present a new architecture for signed multiplication which maintains the pure form of an array multiplier, exhibiting a much lower overhead than the Booth architecture. This architecture is extended for radix-2 encoding, which leads to a reduction of the number of partial lines, enabling a significant improvement in performance and power consumption. The flexibility of our architecture allow...
متن کاملFaster Modulo 2 + 1 Multipliers without Booth Recoding
This paper proposes an improvement to the fastest modulo 2 + 1 multiplier already published, without Booth recoding. Results show that by manipulating the partial products and modulo reduction terms and by inserting them adequately in the multiplication matrix, the performance of multiplication units can be improved more than 20%. This improvement is obtained at the expense of some extra circui...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VLSI Design
سال: 2013
ISSN: 1065-514X,1563-5171
DOI: 10.1155/2013/495354