THE AREA-TIME COMPLEXITY OF THE VLSI COUNTER

被引：2

作者：

VRTO, I

机构：

[1] Institute of Technical Cybernetics, Slovak Academy of Sciences, Dúbravská cesta 9, 842 37 Bratislava, Czech Republic

来源：

INFORMATION PROCESSING LETTERS | 1987年 / 25卷 / 06期

关键词：

AREA-TIME COMPLEXITY - BOUNDARY MODEL - LOWER BOUNDS - VLSI COUNTER;

D O I：

10.1016/0020-0190(87)90218-3

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：397 / 400

页数：4

共 50 条

[1] SOME AREA-TIME TRADEOFFS FOR VLSI
BRENT, RP
GOLDSCHLAGER, LM
[J]. SIAM JOURNAL ON COMPUTING, 1982, 11 (04) : 737 - 747
[2] Area-time tradeoffs for universal VLSI circuits
Bhatt, Sandeep N.
Bilardi, Gianfranco
Pucci, Geppino
[J]. THEORETICAL COMPUTER SCIENCE, 2008, 408 (2-3) : 143 - 150
[3] THE AREA-TIME COMPLEXITY OF BINARY MULTIPLICATION
BRENT, RP
KUNG, HT
[J]. JOURNAL OF THE ACM, 1981, 28 (03) : 521 - 534
[4] THE AREA-TIME COMPLEXITY OF A VLSI DIGITAL-FILTER USING RESIDUE NUMBER-SYSTEMS
BAYOUMI, MA
JULLIEN, GA
MILLER, WC
[J]. COMPUTERS & ELECTRICAL ENGINEERING, 1986, 12 (1-2) : 29 - 38
[5] AREA-TIME OPTIMAL VLSI NETWORKS FOR MULTIPLYING MATRICES
PREPARATA, FP
VUILLEMIN, JE
[J]. INFORMATION PROCESSING LETTERS, 1980, 11 (02) : 77 - 80
[6] AREA-TIME OPTIMAL VLSI INTEGER MULTIPLIER WITH MINIMUM COMPUTATION TIME
MEHLHORN, K
PREPARATA, FP
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1984, 172 : 347 - 357
[7] Implementing area-time efficient VLSI residue to binary converters
Srikanthan, T
Bhardwaj, M
Clarke, CT
[J]. SIPS 97 - 1997 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS: DESIGN AND IMPLEMENTATION, 1997, : 163 - 172
[8] AREA-TIME TRADEOFF FOR RECTANGULAR MATRIX MULTIPLICATION IN VLSI MODELS
LOTTI, G
[J]. INFORMATION PROCESSING LETTERS, 1984, 19 (02) : 95 - 98
[9] AREA-TIME TRADEOFFS FOR BILINEAR-FORMS COMPUTATIONS IN VLSI
CODENOTTI, B
LOTTI, G
[J]. INFORMATION PROCESSING LETTERS, 1986, 23 (02) : 107 - 109
[10] INFORMATION-TRANSFER AND AREA-TIME TRADEOFFS FOR VLSI MULTIPLICATION
ABELSON, H
ANDREAE, P
[J]. COMMUNICATIONS OF THE ACM, 1980, 23 (01) : 20 - 23

← 1 2 3 4 5 →