1990 · 12 citations · 15 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureParallel AlgorithmsParallel ComputingAlgorithm AnalysisComputational ComplexityParallel Computing SystemsMultipliersParallelizationTestability
After a brief review on testability aspects of parallel arithmetical units we focus on n-bit multipliers and especially consider a class of Wallace tree multipliers made suitable for VLSI design by Vuillemin and Luk [VULU].
15
Richard E. Ladner, Michael J. Fischer · Journal of the ACM · 1980 · 1.3K citations · Full text
A Regular Layout for Parallel Adders
Brent, Kung · IEEE Transactions on Computers · 1982 · 1.1K citations
Easily Testable Iterative Systems
Arthur Friedman · IEEE Transactions on Computers · 1973 · 253 citations