Patent
Method and apparatus for multi-function arithmetic
Stuart F. Oberman,Norbert Juffa,Ming Siu,Frederick D. Weber,Ravi Krishna Cherukuri +4 more
- 22 Oct 1998
83
TL;DR: In this paper, a multiplier capable of performing signed and unsigned scalar and vector multiplication is disclosed, where the multiplier is configured to receive signed or unsigned multiplier and multiplicand operands in scalar or packed vector form.
read more
Abstract: A multiplier capable of performing signed and unsigned scalar and vector multiplication is disclosed. The multiplier is configured to receive signed or unsigned multiplier and multiplicand operands in scalar or packed vector form. An effective sign for the multiplier and multiplicand operands may be calculated and used to create and select a number of partial products according to Booth's algorithm. Once the partial products have been created and selected, they may be summed and the results may be output. The results may be signed or unsigned, and may represent vector or scalar quantities. When a vector multiplication is performed, the multiplier may be configured to generate and select partial products so as to effectively isolate the multiplication process for each pair of vector components. The multiplier may also be configured to sum the products of the vector components to form the vector dot product. The final product may be output in segments so as to require fewer bus lines. The segments may be rounded by adding a rounding constant. Rounding and normalization may be performed in two paths, one assuming an overflow will occur, the other assuming no overflow will occur. The multiplier may also be configured to perform iterative calculations to evaluate constant powers of an operand. Intermediate products that are formed may be rounded and normalized in two paths and then compressed and stored for use in the next iteration. An adjustment constant may also be added to increase the frequency of exactly rounded results.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Mathematical circuit with dynamic rounding
James M. Simkins,Steven P. Young,Jennifer Wong,Bernard J. New,Alvin Y. Ching +4 more
- 21 Dec 2004
TL;DR: In this paper, a DSP circuit stores a rounding constant selected from the group of binary numbers 2 (M−1) and 2 (m −1) −1, calculates a correction factor and sums the rounding constant, the correction factor, and a data item to obtain a rounded data item.
122
Patent
Programmable logic device with cascading DSP slices
James M. Simkins,Steven P. Young,Jennifer Wong,Bernard J. New,Alvin Y. Ching +4 more
- 21 Dec 2004
TL;DR: In this article, a programmable logic device (PLD) with columns of DSP slices that can be cascaded to create DSP circuits of varying size and complexity is described, each slice includes a plurality of operand input ports and a slice output port, all of which are programmably connected to general routing and logic resources.
118
Patent
Arithmetic circuit with multiplexed addend inputs
James M. Simkins,Steven P. Young,Jennifer Wong,Bernard J. New,Alvin Y. Ching +4 more
- 21 Dec 2004
TL;DR: In this paper, arithmetic circuits are divided logically into a product generator and an adder, and multiplexing circuitry logically disposed between the generator and adder supports conventional functionality by providing partial products from the product generator to addend terminals of the adder.
101
Patent
Applications of cascading DSP slices
James M. Simkins,Steven P. Young,Jennifer Wong,Bernard J. New,Alvin Y. Ching +4 more
- 21 Dec 2004
TL;DR: In this article, a plurality of cascaded digital signal processing slices, where each slice has a multiplier coupled to an adder via a multiplexer, and each slice can be configured to perform one or more mathematical operations via opmodes.
100
Patent
Apparatus and methods for hardware-efficient unbiased rounding
Ofir Avraham Kanter,Ilan Bar +1 more
- 17 Sep 2008
TL;DR: A system and method for unbiased rounding away from, or toward zero comprising apparatus for truncating N bits from an original M bit input number, and apparatus for adding the equivalent value of '½' to the M - N bit number unless the input number is negative, or positive, respectively, and the N truncated bits represent exactly ½ as discussed by the authors.
71
References
Rounding algorithms for IEEE multipliers
M.R. Santoro,G. Bewick,Mark Horowitz +2 more
- 06 Sep 1989
TL;DR: A new fast and efficient technique for computing the sticky bit directly from the carry-save form without undergoing the expense of a carry-propagate addition is presented.
96
167 MHz radix-4 floating point multiplier
R.K. Yu,G.B. Zyner +1 more
- 19 Jul 1995
TL;DR: In this article, an IEEE floating point multiplier with partial support for subnormal operands and results is presented, which is implemented in a 0.5 /spl mu/m static CMOS technology in the UltraSPARC RISC microprocessor.
86
Patent
Method and apparatus for computer implemented constant multiplication with multipliers having repeated patterns including shifting of replicas and patterns having at least two digit positions with non-zero values
Kenneth Alan Dockser
- 24 Jan 1997
TL;DR: In this article, a method for designing a constant multiplier system comprises identifying a repeated pattern in a minimal signed digit expression of a multiplier, designing a first accumulator stage to compute the product of a multiplicand by an instance of the pattern, and designing a second accumulators stage for accumulating shifted replicas of the patterns to yield a final product.
66
Patent
Multiplier array processing system with enhanced utilization at lower precision for group multiply and sum instruction
Craig Hansen,Henry Massalin +1 more
- 16 May 1997
TL;DR: In this paper, a multiplier array processing system which improves the utilization of the multiplier and adder array for lower-precision arithmetic is described, and new instructions are defined which provide for the deployment of additional multiply and add operations as a result of a single instruction.
64