This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Asymptotically Optimal Circuit for a Storage Access Function
August 1980 (vol. 29 no. 8)
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.
Index Terms:
combinational complexity, Boolean function
Citation:
P. Klein, M.S. Paterson, "Asymptotically Optimal Circuit for a Storage Access Function," IEEE Transactions on Computers, vol. 29, no. 8, pp. 737-738, Aug. 1980, doi:10.1109/TC.1980.1675657
Usage of this product signifies your acceptance of the Terms of Use.