
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
T.P. Kelliher, R.M. Owens, M.J. Irwin, T.T. Hwang, "ELMA Fast Addition Algorithm Discovered by a Program," IEEE Transactions on Computers, vol. 41, no. 9, pp. 11811184, September, 1992.  
BibTex  x  
@article{ 10.1109/12.165399, author = {T.P. Kelliher and R.M. Owens and M.J. Irwin and T.T. Hwang}, title = {ELMA Fast Addition Algorithm Discovered by a Program}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {9}, issn = {00189340}, year = {1992}, pages = {11811184}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.165399}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  ELMA Fast Addition Algorithm Discovered by a Program IS  9 SN  00189340 SP1181 EP1184 EPD  11811184 A1  T.P. Kelliher, A1  R.M. Owens, A1  M.J. Irwin, A1  T.T. Hwang, PY  1992 KW  simple processors tree; addition algorithm; ELM; augend; addend; VLSI CAD tool; FACTOR; CMOS VLSI circuits; computational complexity; digital arithmetic. VL  41 JA  IEEE Transactions on Computers ER   
A new addition algorithm, ELM, is presented. This algorithm makes use of a tree of simple processors and requires O(log n) time, where n is the number of bits in the augend and addend. The sum itself is computed in one pass through the tree. This algorithm was discovered by a VLSI CAD tool, FACTOR, developed for use in synthesizing CMOS VLSI circuits.
[1] R. P. Brent and H. T. Kung, "A regular layout for parallel adders,"IEEE Trans. Comput., vol. C31, pp. 260264, Mar. 1982.
[2] B. W. Y. Wei and C. D. Thompson, "Areatime optimal adder design,"IEEE Trans. Comput., vol. 39, pp. 666675, May 1990.
[3] J. Beekman, R. M. Owens, and M. J. Irwin, "Mesh arrays and LOGICIAN: A tool for their efficient generation," inProc. ICCAD85, Nov. 1985, pp. 290299.
[4] H. GarciaMolina and A. Spauster, "Message ordering in a multicast environment," inProc. 9th Int. Conf. on Distr. Comput. Syst.(Newport Beach, CA), June 1989, pp. 354361.
[5] M. J. Flynn and S. Waser,Introduction to Arithmetic for Digital Systems Designers. CBS College Publishing, 1982, pp. 215222.
[6] C. A. Papachristou, "Iterative construction of binary lookahead addition trees,"Comput. Elect. Eng., vol. 12, no. 3/4, pp. 101107, 1986.
[7] S. Winograd, "On the time required for binary addition,"J. ACM, vol. 12, pp. 277285, 1965.
[8] S. Winograd, "On the time required to perform multiplication,"J. ACM, vol. 14, no. 4, pp. 793802, 1967.
[9] N. Weste and K. Eshraghian,Principles of CMOS Design: A Systems Perspective. Reading, MA: AddisonWesley, 1985, pp. 322325.
[10] T.T. Hwang, R. M. Owens, and M. J. Irwin, "Exploiting communication complexity for multilevel logic synthesis,"IEEE Trans. Comput.Aided Design, vol. 9, pp. 10171027, Oct. 1990.
[11] N. Roussopoulos and H. Kang, "Preliminary design of ADMS±: A workstationmainframe integrated architecture for database management systems," inProc. 12th Int. Conf. Very Large Data Bases, Kyoto, Japan, Aug. 1986.