Abstract
Synchronous counters composed entirely of J-K flip-flops can be systematically designed to fit given specifications. However, known design methods do not provide useful counters for many specifications of interest. We prove that some plausible counters are impossible to construct. For example, we prove that there is no self-starting, gateless, synchronous J-K flip-flop counter with N J-K flip-flops, N ≫ 2, and a period of 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</sup> - 1. Known design methods do not trivially generate many desirable counters, but nonexistence theorems do not show that these counters are impossible. Searching among all possible configurations of J-K flip-flops is an attractive notion, but the number of possibilities is so large that it renders such search infeasible on current general-purpose digital computers. A special-purpose digital device was designed, implemented, and operated to perform an exhaustive search of all configurations of five or fewer J-K flip-flops. Some of the discovered counters are listed in the Appendix.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
