DocumentCode :
1340710
Title :
Constant-Weight Counters and Decoding Trees
Author :
Kautz, William H.
Author_Institution :
Stanford Research Institute, Menlo Park, Calif.
Issue :
2
fYear :
1960
fDate :
6/1/1960 12:00:00 AM
Firstpage :
231
Lastpage :
244
Abstract :
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.
Keywords :
Costs; Counting circuits; Decoding; Digital circuits; Flip-flops; Minimization; Shift registers;
fLanguage :
English
Journal_Title :
Electronic Computers, IRE Transactions on
Publisher :
ieee
ISSN :
0367-9950
Type :
jour
DOI :
10.1109/TEC.1960.5219823
Filename :
5219823
Link To Document :
بازگشت