| |
Browse All Reviews > Hardware (B) > Register-Transfer-Level Implementation (B.5) > Design (B.5.1) > Arithmetic And Logic Units (B.5.1...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 21
Reviews about "Arithmetic And Logic Units (B.5.1...)":
|
Date Reviewed |
| |
Synthesis of integer multipliers in sum of pseudoproducts form
Ciriani V., Luccio F., Pagli L. Integration, the VLSI Journal 36(3): 103-119, 2003. Type: Article
Ciriani, Luccio, and Pagli apply earlier work on sum of pseudoproducts (SPP) expressions of Boolean functions to the synthesis of integer multiplication circuits. A pseudoproduct is a generalization of the AND-products of Boolean variables, where ...
|
Mar 9 2004 |
| |
Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials
Zhang T., Parhi K. IEEE Transactions on Computers 50(7): 734-749, 2001. Type: Article
Finite field multiplication is a key operation in such areas as cryptography and error correction coding by block codes. The operation is far from trivial, since it involves a modulo operation with a primitive polynomial. This paper provides...
|
Jun 13 2002 |
| |
Boosting Very-High Radix Division with Prescaling and Selection by Rounding
Montuschi P., Lang T. IEEE Transactions on Computers 50(1): 13-27, 2001. Type: Article
The authors discuss an algorithm for high radix division, and provide a hardware implementation....
|
May 1 2001 |
| |
High-performance carry chains for FPGA’s
Hauck S., Fry T., Hosler M. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 8(2): 138-147, 2000. Type: Article
The purpose of this paper is to extend the carry chain design of traditional ASICs into the field programmable gate array (FPGA) arena. The authors point out the performance (delay) disadvantages of classic ripple carry logic used in FPGAs,...
|
Mar 1 2001 |
| |
Low-Power Divider
Nannarelli A., Lang T. IEEE Transactions on Computers 48(1): 2-14, 1999. Type: Article
This paper presents a multi-method approach to low-power design.
The authors have chosen a good problem (division) to work on. It is a
good choice because in such a complex problem, it is possible to
minimize energy consumption at many levels,...
|
Jul 1 1999 |
| |
Computation of $\sqrt {{x \mathord{\left/ {\vphantom {x d}} \right. \kern-\nulldelimiterspace} d}}$ in a Very High Radix Combined Division/Square-Root Unit with Scaling and Selection by Rounding
Antelo E., Lang T., Bruguera J. IEEE Transactions on Computers 47(2): 152-161, 1998. Type: Article
The authors describe a circuit for calculating the square root of the ratio of two numbers. If the denominator is set at one, the circuit can also be used to calculate square roots. The computation time is nearly proportional to the logarithm of...
|
Aug 1 1998 |
| |
Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition
Walter C. IEEE Transactions on Computers 46(2): 139-141, 1997. Type: Article
Its title and abstract describe this paper well. The author’s primary concern is an investigation of the value of using a higher radix for modular multiplication in Rivest-Shamir-Adleman (RSA) cryptography applications. He concludes that...
|
Oct 1 1997 |
| |
Numerical programming the 386, 486, and Pentium
Sanchez J., Canton M., McGraw-Hill, Inc., New York, NY, 1995.Type: Book (9780079118325)
The authors discuss programming the Intel floating point units (FPUs) in assembly language from a programmer’s point of view. That is, the book does not include details about how the floating point units perform the arithmetic operations....
|
Feb 1 1996 |
| |
Hardware Implementation of Montgomery’s Modular Multiplication Algorithm
Eldridge S., Walter C. IEEE Transactions on Computers 42(6): 693-699, 1993. Type: Article
Hardware that quickly computes A  B mod M is described. The basic algorithm that this hardware uses for such computation is the one presented first by P. L. Montgomery [1] and further developed by...
|
Oct 1 1994 |
| |
A Spanning Tree Carry Lookahead Adder
Lynch T., Earl E J. IEEE Transactions on Computers 41(8): 931-939, 1992. Type: Article
A classical problem in computer arithmetic, high-speed adder design, is revisited in this paper. The major novelty is in finding a good combination of two well-known techniques, carry lookahead and carry select. The combined adder consists of a...
|
Oct 1 1993 |
| |
|
|
| |
|
|
