
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Michael J. Schulte, Pablo I. Balzola, Ahmet Akkas, Robert W. Brocato, "Integer Multiplication with Overflow Detection or Saturation," IEEE Transactions on Computers, vol. 49, no. 7, pp. 681691, July, 2000.  
BibTex  x  
@article{ 10.1109/12.863038, author = {Michael J. Schulte and Pablo I. Balzola and Ahmet Akkas and Robert W. Brocato}, title = {Integer Multiplication with Overflow Detection or Saturation}, journal ={IEEE Transactions on Computers}, volume = {49}, number = {7}, issn = {00189340}, year = {2000}, pages = {681691}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.863038}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Integer Multiplication with Overflow Detection or Saturation IS  7 SN  00189340 SP681 EP691 EPD  681691 A1  Michael J. Schulte, A1  Pablo I. Balzola, A1  Ahmet Akkas, A1  Robert W. Brocato, PY  2000 KW  Overflow KW  saturation KW  two's complement KW  unsigned KW  integer KW  array multipliers KW  tree multipliers KW  computer arithmetic. VL  49 JA  IEEE Transactions on Computers ER   
Abstract—Highspeed multiplication is frequently used in generalpurpose and applicationspecific computer systems. These systems often support integer multiplication, where two
[1] D. Tabak, RISC Systems and Applications. John Wiley&Sons, 1996.
[2] J.C. Hoffman and R. Kitai, “Parallel Multiplier Circuit,” Electronic Letters, vol. 4, p. 178, May 1968.
[3] S.D. Pezaris, “A 40 ns 17bit Array Multiplier,” IEEE Trans. Computers, vol. 20, no. 4, pp. 442447, Apr. 1971.
[4] K.Z. Pekmestzi, “MultiplexerBased Array Multipliers,” IEEE Trans. Computers, vol. 48, no. 1, pp. 1523, Jan. 1999.
[5] C.S. Wallace, “Suggestion for a Fast Multiplier,” IEEE Trans. Electronic Computers, vol. 13, pp. 1417, 1964.
[6] L. Dadda, “Some Schemes for Parallel Multipliers,” Alta Frequenza, vol. 34, pp. 349356, 1965.
[7] K.C. Bickerstaff, M.J. Schulte, and E.E. SwartzlanderJr., “Parallel Reduced Area Multipliers,” J. VLSI Signal Processing, pp. 181191, Apr. 1995.
[8] P. Song and G. De Micheli, “Circuit and Architecture TradeOffs for HighSpeed Multiplication,” IEEE J. Solid State Circuits, vol. 26, no. 9, Sept. 1991.
[9] I. Koren, Computer Arithmetic and Algorithms. Brookside Court Publishers, 1998.
[10] T. Lindholm and F. Yellin, The Java Virtual Machine Specification, AddisonWesley, Reading, Mass., 1997.
[11] K. Guttag, “BuiltIn Overflow Detection Speeds 16bit Microprocessor Arithmetic,” EDN, vol. 28, no. 1, pp. 133135, Jan. 1983.
[12] J. Hennessy and D. Patterson, Computer Architecture: A Quantitative Approach. Morgan Kaufmann, 1995.
[13] P. Lapsley, DSP Processor Fundamentals: Architectures and Features. IEEE Press, 1997.
[14] N. Yadav, M.J. Schulte, and J. Glossner, “Parallel Saturating Fractional Arithmetic Units,” Proc. Ninth Great Lakes Symp. VLSI, pp. 214217, Mar. 1999.
[15] F. Mintzer and A. Peled, “A Microprocessor for Signal Processing, the RSP,” IBM J. Research and Development, vol. 26, no. 4, pp. 413423, July 1982.
[16] A. Peleg and U. Weiser, “MMX Technology Extension to the Intel Architecture,” IEEE Micro, vol. 16, no. 4, pp. 4250, Aug. 1996.
[17] A. Landauro and J. Lienard, “On Overflow Detection and Correction in Digital Filters,” IEEE Trans. Computers, vol. 24, no. 12, pp. 1,2261,228, Dec. 1975.
[18] P.D. Pai and A. Tran, “Overflow Detection in Multioperand Addition,” Int'l J. Electronics, vol. 73, no. 3, pp. 461469, Sept. 1992.
[19] D.G. East and J.W. Moore, “Overflow Indication in Two's Complement Arithmetic,” IBM Technical Disclosure Bulletin, vol. 19, no. 8, pp. 3,1353,136, Jan. 1977.
[20] Z. Wang, G.A. Jullien, and W.C. Miller, “A New Design Technique for Column Compression Multipliers,” IEEE Trans. Computers, vol. 44, no. 8, pp. 962970, Aug. 1995.
[21] V.G. Oklobdzija and D. Villeger, "Improving Multiplier Design by Using Improved Column Compression Tree and Optimized Final Adder in CMOS Technology," IEEE Trans. VLSI Systems, vol. 3, no. 2, pp. 292301, June 1995.
[22] C.R. Baugh and B.A. Wooley, “A Two's Complement Parallel Array Multiplication Algorithm,” IEEE Trans. Computers, vol. 22, no. 12, pp. 1,0451,047, Dec. 1973.
[23] P.E. Blankenship, “Comments on a Two's Complement Parallel Array Multiplication Algorithm,” IEEE Trans. Computers, vol. 23, p. 1,327 1974.
[24] J.A. Gibson and R.W. Gibbard, “Synthesis and Comparison of Two's Complement Parallel Multipliers,” IEEE Trans. Computers, vol. 24, no. 10, pp. 1,0201,027, Oct. 1975.
[25] A.D. Booth, “A Signed Binary Multiplication Technique,” Quarterly J. Mechanics and Applied Mathematics, vol. 4, pp. 236240, 1951.
[26] H. Sam and A. Gupta, “A Generalized Multibit Recoding of Two's Complement Binary Numbers and Its Proof with Application in Multiplier Implementations,” IEEE Trans. Computers, vol. 39, no. 8, pp. 1,0061,015, Aug. 1990.
[27] R. De Mori and A. Serra, “A Parallel Structure for SignedNumber Multiplication and Addition,” IEEE Trans. Computers, vol. 21, no. 12, pp. 1,4531,454, Dec. 1972.
[28] M. Zheng and A. Albicki, “Low Power and High Speed Multiplication Design through Mixed Number Representations,” Proc. Int'l Conf. Computer Design, pp. 566570, 1995.