A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Asymptotic Approximations for the Number of Fanout-Free Functions
IEEE transactions on computers
With two cosine terms about a third and with three cosine terms about half as many shifts are needed as for an arbitrary 5. The number of additions varies from about a fifth as many at n = 1 to about a fifteenth or sixteenth as many at n = 5. It should be noted that if the processor used to implement this has 4 or 8 bit shifts, the number of shifts is greatly reduced. Also, it should be stated that this can be implemented in hardware with about 30 MSI TTL packs for the case n = 7, r = 2, a = 1,doi:10.1109/tc.1978.1675021 fatcat:mr6khpmojfbvxkag4hgcdlqnuu