Journal ArticleDOI
M*N Booth encoded multiplier generator using optimized Wallace trees
Reads0
Chats0
TLDR
The architecture of a design method for an M-bit by N-bit Booth encoded parallel multiplier generator and an algorithm for reducing the delay inside the branches of the Wallace tree section are discussed.Abstract:
The architecture of a design method for an M-bit by N-bit Booth encoded parallel multiplier generator are discussed. An algorithm for reducing the delay inside the branches of the Wallace tree section is explained. The final step of adding two N+or-M-1-bit numbers is done by an optimal carry select adder stage. The algorithm for optimal partitioning of the N+or-M-1-bit adder is also presented. >read more
Citations
More filters
Journal ArticleDOI
The density advantage of configurable computing
TL;DR: The author attempts to answer questions as to why FPGAs have been so much more successful than their microprocessor and DSP counterparts and how configurable computing fits into the arsenal of structures used to build general, programmable computing platforms.
Journal ArticleDOI
A method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approach
TL;DR: The proposed method is applicable to any multiplier size and adaptable to any technology for which speed parameters are known, and it is easy to incorporate this method in silicon compilation or logic synthesis tools.
Journal ArticleDOI
High-speed Booth encoded parallel multiplier design
Wen-Chang Yeh,Chein-Wei Jen +1 more
TL;DR: A new modified Booth encoding (MBE) scheme is proposed to improve the performance of traditional MBE schemes and a new algorithm is developed to construct multiple-level conditional-sum adder (MLCSMA).
Journal ArticleDOI
Modified Booth Multipliers With a Regular Partial Product Array
TL;DR: A simple approach is proposed to generate a regular partial product array with fewer partial product rows and negligible overhead, thereby lowering the complexity of partial product reduction and reducing the area, delay, and power of MBE multipliers.
Journal ArticleDOI
A fast parallel multiplier-accumulator using the modified Booth algorithm
TL;DR: A dependence graph (DG) is presented to visualize and describe a merged multiply-accumulate (MAC) hardware that is based on the modified Booth algorithm, in which an accurate delay model for deep submicron CMOS technology is used.
References
More filters
Journal ArticleDOI
A Suggestion for a Fast Multiplier
TL;DR: A design is developed for a multiplier which generates the product of two numbers using purely combinational logic, i.e., in one gating step, using straightforward diode-transistor logic.
Journal ArticleDOI
High-Speed Arithmetic in Binary Computers
TL;DR: Methods of obtaining high speed in addition, multiplication, and division in parallel binary computers are described and then compared with each other as to efficiency of operation and cost.
Journal ArticleDOI
Carry-Select Adder
TL;DR: The adder system described increases the speed of the addition process by reducing the carry-propagation time to the minimum commensurate with economical circuit design.
Book
The AWK Programming Language
TL;DR: The AWK Lanaguage, an Assembler and Interpreter for Drawing Graphs, and AWK as a Language, a guide to computing with AWK and its applications.