This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
July 1968 (vol. 17 no. 7)
pp. 701-702
null Sureshchander, Electrical Engineering Dept. Regional Engineering College
In a recent paper Graham and Distler1have 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 a1, a2on the R map and a3, a4on the S map are replaced by ai, and each aican be chosen independently of the others. Whereas, in the Graham and Distler techniques, a1chosen to be 1 (or 0) on one vertex of the Karnaugh map implies that all a1are to be 1 (or 0), and the same is true about a2, a3, and a4.
Citation:
null Sureshchander, "Comments on "RST Flip-Flop Input Equations"," IEEE Transactions on Computers, vol. 17, no. 7, pp. 701-702, July 1968, doi:10.1109/TC.1968.227410
Usage of this product signifies your acceptance of the Terms of Use.