The Community for Technology Leaders
Green Image
Issue No. 08 - August (1980 vol. 29)
ISSN: 0018-9340
pp: 737-738
P. Klein , Department of Mathematics, University of Bielefeld
Let gk:{0,1}n+k ? {0,1}, where n = 2k, be the binary function defined by gk(a1,???, ak, X0,???, xn-1) = x(a) where (a) is the natural number with binary representation a1,???, ak. This function models the reading operation in a random-access storage. In [1] Paul proved a 2n lower bound to the combinational complexity of gk. This correspondence derives a realization for gk in a circuit with 2n + 0(vn) gates and a depth asymptotic to k.
combinational complexity, Boolean function

P. Klein and M. Paterson, "Asymptotically Optimal Circuit for a Storage Access Function," in IEEE Transactions on Computers, vol. 29, no. , pp. 737-738, 1980.
83 ms
(Ver 3.3 (11022016))