Investigation of some quite interesting divisibility situations in a signature analyzer implementation

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

When designing error detecting and correcting systems, cryptographic apparatus, scramblers and other secure, safe and authenticated communication and digital system response data compression devices, the division of polynomials are frequently involved. Commonly, the process of division is implemented by using hardware known as Linear Feedback Shift Registers (LFSRs). In digital system testing the technique of Built-In Self Test (BIST) uses this LFSR based division process for response data compression and is popularly known as Signature Analyzer (SA). This paper presents a simulation experiment on the effectiveness study of the SA schemes. The finding of the results of the simulation study reveals that in SA implementation; in general the uses of primitive characteristic polynomials are the best. However, the study further investigates that the use of some critical primitive characteristic polynomials may reverse the effectiveness of the SA schemes i.e. lead to observe maximum aliasing errors.

Original languageEnglish
Pages (from-to)299-308
Number of pages10
JournalWSEAS Transactions on Circuits and Systems
Volume10
Issue number9
Publication statusPublished - Sep 2011

Keywords

  • Aliasing errors
  • Built-in self-test
  • Characteristic polynomial
  • Cyclic redundancy check
  • Linear Feedback Shift Registers
  • Polynomial division
  • Primitive polynomials
  • Signature analyzer
  • Vlsi

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Investigation of some quite interesting divisibility situations in a signature analyzer implementation'. Together they form a unique fingerprint.

  • Cite this