Abstract
This work reports an effective test design for memory. It realizes March algorithm employing a periodic boundary cellular automata (PBCA) structure. The irreversible single length cycle attractor cellular automata (CA), selected for the design, returns correct decision on the fault in memory even if the test logic is defective. It avoids the bit by bit comparison of memory words, practiced in the conventional test designs, and outperforms the state-of-the-art memory test architecture in terms of delay in testing. The hardware overhead of CA based test design is insignificant in comparison to the cost of memory.
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.
