Kent E. Wires
Agere Systems
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Kent E. Wires.
international conference on computer design | 2001
Kent E. Wires; Michael J. Schulte; James E. Stine
Truncated multiplication can be used to significantly reduce power dissipation for applications that do not require correctly rounded results. This paper presents a power efficient method for designing floating point multipliers that can perform either correctly rounded IEEE compliant multiplication or truncated multiplication, based on an input control signal. Compared to conventional IEEE floating point multipliers, these multipliers require only a small amount of additional area and delay, yet provide a significant reduction in power dissipation for applications that do not require IEEE compliant results.
field-programmable logic and applications | 2001
Kent E. Wires; Michael J. Schulte; Don Mccarley
Significant reductions in FPGA resources, delay, and power can be achieved using truncated multipliers instead of standard parallel multipliers when the full precision of the standard multiplier is not required. With truncated multiplication, the less significant columns of the multiplication matrix are eliminated and correction terms are added to keep the total error to less than one unit in the last place. The truncated multiplication techniques presented in this paper are applied to FPGA parallel multipliers, and can be used in conjunction with a number of other performance enhancing techniques, such as pipelining, Booth encoding, and device specific optimizations to increase the effectiveness of device mapping, placing, and routing.
signal processing systems | 2006
Kent E. Wires; Michael J. Schulte
Abstract.Reciprocals and reciprocal square roots are used in several digital signal processing, multimedia, and scientific computing applications. This paper presents high-speed methods for computing reciprocals and reciprocal square roots. These methods use a table lookup, operand modification, and multiplication to obtain an initial approximation. This is followed by a modified Newton-Raphson iteration, which improves the accuracy of the initial approximation. The initial approximation and Newton-Raphson iteration employ specialized hardware to reduce the delay, area, and power dissipation. The application of these methods is illustrated through the design of reciprocal and reciprocal square root units for operands in the IEEE single precision format. These designs are pipelined to produce a new result every clock cycle.
Archive | 2006
Ambalavanar Arulambalam; Jian-Guo Chen; Nevin Heintze; Hakan I. Pekcan; Kent E. Wires
Archive | 1999
Dean Batten; Paul Gerard D'Arcy; C. John Glossner; Sanjay Jinturkar; Kent E. Wires
Archive | 1999
Dean Batten; Paul Gerard D'Arcy; C. John Glossner; Sanjay Jinturkar; Kent E. Wires
Archive | 1999
Dean Batten; Paul Gerard D'Arcy; C. John Glossner; Sanjay Jinturkar; Kent E. Wires
Archive | 1998
Dean Batten; Paul Gerard D'Arcy; C. John Glossner; Sanjay Jinturkar; Jesse Thilo; Kent E. Wires
Archive | 2006
Ambalavanar Arulambalam; Jian-Guo Chen; C Heintze Nevin; Hakan I. Pekcan; Kent E. Wires
Archive | 2003
Paul Gerard D'Arcy; Jesse Thilo; Kent E. Wires