Constant-Weight Counters and Decoding Trees
暂无分享,去创建一个
A class of counters is described in which the number of 1's in the flip-flops or register stages composing the counter remains constant as the counter advances from state to state. Simple digital circuit arrangements are described for the design of such counters, which may be used with a particular type of decoding tree as economical ring-type counters, to provide a separate output lead for each state. Some interesting theoretical questions concerning the minimization of these decoding trees are raised and partially answered. Finally, the costs of these counters are compared with one another, and with those of other types of counters, over a continuous range of values of the flip-flop/gate-input cost ratio.
[1] Don W. Warren,et al. Complete Decoding Nets: General Theory and Minimality , 1954 .
[2] B. Elspas,et al. The Theory of Autonomous Linear Sequential Networks , 1959 .
[3] Nelson M. Blachman,et al. On the Wiring of Two-Dimensional Multiple-Coincidence Magnetic Memories , 1956, IRE Trans. Electron. Comput..
[4] W. H. Kautz,et al. State-logic relations in autonomous sequential networks , 1899, AIEE-ACM-IRE '58 (Eastern).