Abstract
Linear Feedback Shift Registers (LFSRs) and Linear Cellular Automata Registers (LCARs) are linear finite state machines which are used in built-in self test as test pattern generators and signature analysers. This paper considers the problem of partitioning maximal length machines into a number of smaller maximal length submachines. Such a property allows more flexibility to the system designer with resulting economy in testing hardware. The study presented shows that LCARs have better partitioning behavior than LFSRs, but only a small percentage of all the primitive machines of both types can be partitioned into primitive bit-slices. It is proposed that LFSRs and LCARs can exhibit better partitioning performance if minimum modifications to the registers are allowed. The extra hardware required for partitioning and modifications is estimated using the OASIS Design System and the Magic Layout Editor.
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.
