Abstract
Signature analysis is an accepted method of obtaining data compression for built-in testing applications. The author deals with a unified approach to the analysis of multiple-input signature analyzers by considering them as finite state switching circuits. This approach is used to investigate and compare different implementations, and it is shown that there is a large range of alternatives to achieve a given characteristic polynomial. Particular emphasis is placed on the two most common implementations. It is shown that both perform polynomial division, with each input of one circuit being equivalent to a combination of inputs of the other. The approach also gives a method of expressing aliasing patterns for both implementations, which leads to a study of the differences with regard to certain error detection capabilities.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.