FPGA implementation of one-dimensional and two-dimensional cellular automata

被引：0

作者：

D'Antone, I. ^{[1
]}

机构：

[1] Ist. Nazionale di Fisica Nucleare, Viale Berti Pichat 6/2, 40127, Bologna, Italy

来源：

Nuclear Instruments and Methods in Physics Research, Section A: Accelerators, Spectrometers, Detectors and Associated Equipment | 1999年 / 430卷 / 01期

关键词：

Algorithms - Built-in self test - Computational complexity - Computer hardware - Field programmable gate arrays - One dimensional - Two dimensional - VLSI circuits;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

This report describes the hardware implementation of one-dimensional and two-dimensional cellular automata (CAs). After a general introduction to the cellular automata, we consider a one-dimensional CA used to implement pseudo-random techniques in built-in self test for VLSI. Due to the increase in digital ASIC complexity, testing is becoming one of the major costs in the VLSI production. The high electronics complexity, used in particle physics experiments, demands higher reliability than in the past time. General criterions are given to evaluate the feasibility of the circuit used for testing and some quantitative parameters are underlined to optimize the architecture of the cellular automation. Furthermore, we propose a two-dimensional CA that performs a peak finding algorithm in a matrix of cells mapping a sub-region of a calorimeter. As in a two-dimensional filtering process, the peaks of the energy clusters are found in one evolution step. This CA belongs to Wolfram class II cellular automata. Some quantitative parameters are given to optimize the architecture of the cellular automation implemented in a commercial field programmable gate array (FPGA).

引用

页码：127 / 142