Abstract
Various delay-insensitive circuits for modulo-N counters are formally derived and analyzed. Modulo-N counters are used in many circuit designs and have a simple specification, but allow for a surprising variety of decompositions into networks of basic components. We present three decompositions in detail. Along the way we explai our correctness criteria and show to analyze the area complexity and response time of each decomposition. Our final decomposition for the modulo-N counter has optimal area complexity of θ(logN) and optimal response time of θ(1).
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.
