Cellular automata based synthesis of easily and fully testable FSMs

Authors:
D. Roy Chowdhury;S. Chakraborty;B. Vamsi;B. Pal Chaudhuri
Affiliations:
Dept. of Computer Science & Engg., Indian Institute of Technology, Kharagpur - 721 302, India;Dept. of Computer Science & Engg., Indian Institute of Technology, Kharagpur - 721 302, India;Dept. of Computer Science & Engg., Indian Institute of Technology, Kharagpur - 721 302, India;Dept. of Computer Science & Engg., Indian Institute of Technology, Kharagpur - 721 302, India
Venue:
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Year:
1993

Citing 2
Cited 6

Logic testing and design for testability

Logic testing and design for testability
Vector Space Theoretic Analysis of Additive Cellular Automata and its Application for Pseudoexhaustive Test Pattern Generation

IEEE Transactions on Computers

Cellular Automata-Based Recursive Pseudoexhaustive Test Pattern Generator

IEEE Transactions on Computers
Theory and Application of Nongroup Cellular Automata for Synthesis of Easily Testable Finite State Machines

IEEE Transactions on Computers
Theory and applications of cellular automata for synthesis of easily testable combinational logic

ATS '95 Proceedings of the 4th Asian Test Symposium
Technology mapping on a multi-output logic module built around Cellular Automata Array for a new FPGA architecture

VLSID '95 Proceedings of the 8th International Conference on VLSI Design
A VLSI architecture for cellular automata based parallel data compression

VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
On Incorporation of BIST for the Synthesis of Easily and Fully Testable Controllers

VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract