File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A fast signature computation algorithm for LFSR and MISR

TitleA fast signature computation algorithm for LFSR and MISR
Authors
KeywordsBuiltin Selftest
Fault Simulation
Lfsr
Logic Testing
Misr
Signature Analysis
Issue Date2000
PublisherIEEE
Citation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2000, v. 19 n. 9, p. 10311040 How to Cite?
AbstractA multipleinput signature register (MISR) computation algorithm for fast signature simulation is proposed. Based on the table lookup linear compaction algorithm and the modularity property of a singleinput signature register (SISR), some new accelerating schemespartialinput lookup tables and flyingstate lookup tablesare developed to boost the signature computation speed. Mathematical analysis and simulation results show that this algorithm has an order of magnitude speedup without extra memory requirement compared with the original linear compaction algorithm. Though this algorithm is derived for SISR, a simple conversion scheme exists that can convert internalEXOR MISR to SISR. Consequently, fast MISR signature computation can be done. © 2000 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/90911
ISSN
2015 Impact Factor: 1.181
2015 SCImago Journal Rankings: 0.710
References

 

DC FieldValueLanguage
dc.contributor.authorLin, BHen_HK
dc.contributor.authorShieh, SHen_HK
dc.contributor.authorWu, CWen_HK
dc.date.accessioned2010-09-17T10:10:13Z-
dc.date.available2010-09-17T10:10:13Z-
dc.date.issued2000en_HK
dc.identifier.citationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2000, v. 19 n. 9, p. 10311040en_HK
dc.identifier.issn0278-0070en_HK
dc.identifier.urihttp://hdl.handle.net/10722/90911-
dc.description.abstractA multipleinput signature register (MISR) computation algorithm for fast signature simulation is proposed. Based on the table lookup linear compaction algorithm and the modularity property of a singleinput signature register (SISR), some new accelerating schemespartialinput lookup tables and flyingstate lookup tablesare developed to boost the signature computation speed. Mathematical analysis and simulation results show that this algorithm has an order of magnitude speedup without extra memory requirement compared with the original linear compaction algorithm. Though this algorithm is derived for SISR, a simple conversion scheme exists that can convert internalEXOR MISR to SISR. Consequently, fast MISR signature computation can be done. © 2000 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEEen_HK
dc.relation.ispartofIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systemsen_HK
dc.subjectBuiltin Selftesten_HK
dc.subjectFault Simulationen_HK
dc.subjectLfsren_HK
dc.subjectLogic Testingen_HK
dc.subjectMisren_HK
dc.subjectSignature Analysisen_HK
dc.titleA fast signature computation algorithm for LFSR and MISRen_HK
dc.typeArticleen_HK
dc.identifier.emailLin, B:blin@hku.hken_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-33747451674en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33747451674&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume19en_HK
dc.identifier.issue9en_HK
dc.identifier.spage10311040en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats