The Community for Technology Leaders
Green Image
Issue No. 12 - December (1975 vol. 24)
ISSN: 0018-9340
pp: 1217-1221
F.M. Brown , Department of Electrical Engineering, University of Kentucky
ABSTRACT
Any switching function has weighted representations, i.e., symmetric representations for which some of the arguments are repeated. We call a logic network based on such a representation a weighted realization. It is shown that a weighted realization may be implemented using a full-adder network (called a moment generator) whose outputs are fed to a multiplexer. A procedure is given to synthesize the full-adder network using the fewest possible modules and with strong coalescing of modules into multibit adders.
INDEX TERMS
Binary adders, combinational logic, multiplexers, symmetric functions, tally-coded representations.
CITATION
F.M. Brown, "Weighted Realizations of Switching Functions", IEEE Transactions on Computers, vol. 24, no. , pp. 1217-1221, December 1975, doi:10.1109/T-C.1975.224166
103 ms
(Ver )