Area—Time optimal VLSI integer multiplier with minimum computation time
From MaRDI portal
Publication:3330499
DOI10.1016/S0019-9958(83)80061-8zbMath0542.68027MaRDI QIDQ3330499
Kurt Mehlhorn, Franco P. Preparata
Publication date: 1983
Published in: Information and Control (Search for Journal in Brave)
Related Items (4)
Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\) ⋮ The area-time complexity of the greatest common divisor problem: A lower bound ⋮ Mod \(m\) arithmetic in binary systems ⋮ A fully parallel algorithm for residue to binary conversion
This page was built for publication: Area—Time optimal VLSI integer multiplier with minimum computation time
