Issue No. 07 - July (1968 vol. 17)

ISSN: 0018-9340

pp: 701-702

null Sureshchander , Electrical Engineering Dept. Regional Engineering College

ABSTRACT

In a recent paper Graham and Distler<sup>1</sup>have shown how all the possible combinations of the input equations of an RST flip-flop can be displayed simultaneously on the Karnaugh maps. This claim is valid only if a<inf>1</inf>, a<inf>2</inf>on the R map and a<inf>3</inf>, a<inf>4</inf>on the S map are replaced by a<inf>i</inf>, and each a<inf>i</inf>can be chosen independently of the others. Whereas, in the Graham and Distler techniques, a<inf>1</inf>chosen to be 1 (or 0) on one vertex of the Karnaugh map implies that all a<inf>1</inf>are to be 1 (or 0), and the same is true about a<inf>2</inf>, a<inf>3</inf>, and a<inf>4</inf>.

INDEX TERMS

null

CITATION

null Sureshchander, "Comments on "RST Flip-Flop Input Equations"",

*IEEE Transactions on Computers*, vol. 17, no. , pp. 701-702, July 1968, doi:10.1109/TC.1968.227410