Abstract
The paper utilises a particular class of nongroup CA as a mathematical tool to derive solutions of XOR-dominated Boolean equations. Some problems in digital circuits (such as logic synthesis, test pattern generation etc.) demand efficient schemes for the solution of Boolean equations. A large number of combinational benchmarks and real-life circuits used in the fields of built-in self-test (BIST) structures, cryptography, error-correcting codes etc. can be found to have dominance of such XOR functionality. The proposed scheme is suited to such XOR dominated circuits. A comparison between the execution time of the proposed method and popular schemes based on tabular algebra shows a maximum speedup of up to ten times. In the worst case, the performance of the algorithm presented is equivalent to that of tabular algebra, which is inescapable since the problem is inherently NP-hard.
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 callMore From: IEE Proceedings - Computers and Digital Techniques
Disclaimer: 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.
