DocumentCode :
1142773
Title :
Asymptotically Optimal Circuit for a Storage Access Function
Author :
Klein, Peter ; Paterson, M.S.
Author_Institution :
Department of Mathematics, University of Bielefeld
Issue :
8
fYear :
1980
Firstpage :
737
Lastpage :
738
Abstract :
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(√n) gates and a depth asymptotic to k.
Keywords :
Boolean function; combinational complexity; Computer science; Hardware; Input variables; Mathematics; Switching circuits; Boolean function; combinational complexity;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1980.1675657
Filename :
1675657
Link To Document :
بازگشت