Abstract
To save energy of VLSI systems flip-flops (FFs) are grouped in Multi-Bit Flip-Flop (MBFF), sharing a common clock driver. The energy savings strongly depends the grouping. For 2-bit MBFFs the optimal grouping turns into a minimum cost perfect graph matching problem. For k-bit MBFFs the optimal grouping turns into a minimum cost exact k-covering problem. We show that due to their special setting that is based on the FFs’ data toggling probabilities, those problems are well-solvable in O(nlogn) time complexity.
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.
