Abstract
A study of the application of the methods of optimum state assignment to obtain all J-K gateless counters has been developed. The superiority of the Harrison method has been shown and it is used to obtain all gateless counters with three J-K bistables. For the case of countres with four bistables, the connection's methods has been used. For countres with injective or self-starting state graphs a list is given of one representative counter of each equivalence class. Also a new theorem concerned with three interconnection structures which can be present in gateless J-K counters is reported.
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.
