Abstract
A novel implementation structure of linear finite state machines, named tree-structured linear cellular automata (TLCA), is introduced. The structures and operations of TLCA are defined. The minimal cost maximum length machines and their implementation procedure are given. Our empirical study on the ISCAS‘85 benchmark circuits shows the effectiveness of TLCA for testing stuck-open and delay faults.
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.
