[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Mrugalski et al., 1999 - Google Patents

Synthesis of pattern generators based on cellular automata with phase shifters

Mrugalski et al., 1999

Document ID
16658527699142710632
Author
Mrugalski G
Tyszer J
Rajski J
Publication year
Publication venue
International Test Conference 1999. Proceedings (IEEE Cat. No. 99CH37034)

External Links

Snippet

The paper presents novel algorithms for the automated synthesis of cellular automata-based test generators with phase shifters. As shown in the paper, it is possible to synthesize in time- efficient manner very large cellular automata and their corresponding fast phase shifters for …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/58—Random or pseudo-random number generators
    • G06F7/582—Pseudo-random number generators
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/58—Indexing scheme relating to groups G06F7/58 - G06F7/588
    • G06F2207/583—Serial finite field implementation, i.e. serial implementation of finite field arithmetic, generating one new bit or trit per step, e.g. using an LFSR or several independent LFSRs; also includes PRNGs with parallel operation between LFSR and outputs
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/50—Adding; Subtracting
    • G06F7/505—Adding; Subtracting in bit-parallel fashion, i.e. having a different digit-handling circuit for each denomination
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01R—MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
    • G01R31/00—Arrangements for testing electric properties; Arrangements for locating electric faults; Arrangements for electrical testing characterised by what is being tested not provided for elsewhere
    • G01R31/28—Testing of electronic circuits, e.g. by signal tracer
    • G01R31/317—Testing of digital circuits
    • G01R31/3181—Functional testing
    • G01R31/3183—Generation of test inputs, e.g. test vectors, patterns or sequence
    • G01R31/318385—Random or pseudo-random test pattern
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01R—MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
    • G01R31/00—Arrangements for testing electric properties; Arrangements for locating electric faults; Arrangements for electrical testing characterised by what is being tested not provided for elsewhere
    • G01R31/28—Testing of electronic circuits, e.g. by signal tracer
    • G01R31/317—Testing of digital circuits
    • G01R31/3181—Functional testing
    • G01R31/3183—Generation of test inputs, e.g. test vectors, patterns or sequence
    • G01R31/318371—Methodologies therefor, e.g. algorithms, procedures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers

Similar Documents

Publication Publication Date Title
JP3699397B2 (en) Method for reducing linear dependence of phase shifter generating pseudo-random test pattern and phase shifter with reduced linear dependence
Rajski et al. Automated synthesis of large phase shifters for built-in self-test
EP2144134B1 (en) Method for synthesizing linear finite state machines
Rajski et al. Automated synthesis of phase shifters for built-in self-test applications
Rajski et al. Design of phase shifters for BIST applications
Boubezari et al. A deterministic built-in self-test generator based on cellular automata structures
Acevedo et al. Using the Berlekamp-Massey algorithm to obtain LFSR characteristic polynomials for TPG
Mrugalski et al. Cellular automata-based test pattern generators with phase shifters
Stroele BIST pattern generators using addition and subtraction operations
Mrugalski et al. Synthesis of pattern generators based on cellular automata with phase shifters
Mrugalski et al. High speed ring generators and compactors of test data [logic IC test]
Srinivasan et al. Novel test pattern generators for pseudo-exhaustive testing
Rajski et al. Comparative study of CA-based PRPGs and LFSRs with phase shifters
Garbolino et al. A new LFSR with D and T flip-flops as an effective test pattern generator for VLSI circuits
Mrugalski et al. Linear independence as evaluation criterion for two-dimensional test pattern generators
Acevedo et al. LFSR characteristic polynomial and phase shifter computation for two-dimensional test set generation
Pomeranz et al. A Learning-based method to match a test pattern generator to a circuit-under-test
Neophytou et al. Efficient deterministic test generation for BIST schemes with LFSR reseeding
Joice et al. Efficient test sequence generator for area optimization in LFSR reseeding
Nikolos et al. An improved search method for accumulator-based test set embedding
Sudireddy et al. Deterministic built-in TPG with segmented FSMs
Kagaris et al. Pseudoexhaustive TPG with a provably low number of LFSR seeds
Stroud Test Pattern Generation
Gala et al. Built-in self test for C-testable ILA's
Ioannidis et al. Embedding Test patterns in Accumulator-Generated sequences in O (1) time