A REGULAR LAYOUT FOR PARALLEL ADDERS

被引:567
作者
BRENT, RP [1 ]
KUNG, HT [1 ]
机构
[1] CARNEGIE MELLON UNIV,DEPT COMP SCI,PITTSBURGH,PA 15213
关键词
D O I
10.1109/TC.1982.1675982
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:260 / 264
页数:5
相关论文
共 14 条
[1]   ON ADDITION OF BINARY NUMBERS [J].
BRENT, R .
IEEE TRANSACTIONS ON COMPUTERS, 1970, C 19 (08) :758-&
[2]   THE AREA-TIME COMPLEXITY OF BINARY MULTIPLICATION [J].
BRENT, RP ;
KUNG, HT .
JOURNAL OF THE ACM, 1981, 28 (03) :521-534
[3]  
GARNER HL, 1976, IEEE T COMPUT, V25, P1277, DOI 10.1109/TC.1976.1674595
[4]  
GUIBAS L, 1980, COMMUNICATION AUG
[5]  
HWANG K, 1979, COMPUTER ARITHMETIC
[6]  
Kuck DL., 1978, STRUCTURE COMPUTERS
[7]   PARALLEL PREFIX COMPUTATION [J].
LADNER, RE ;
FISCHER, MJ .
JOURNAL OF THE ACM, 1980, 27 (04) :831-838
[8]  
Leiserson C. E., 1981, THESIS CARNEGIE MELL
[9]  
Mead C., 1980, INTRO VLSI SYSTEMS
[10]  
SAVAGE JE, 1976, COMPLEXITY COMPUTING