Tuesday, 8 May 2012

Introduction

CA(Cellular Automata) consist of a number of cells arranged in a regular manner, where the state transitions of each cell depends on the state of its neighbors.Each cell consists of D flip-flop and a combinational logic implementing the next-state function. The next state function is called the rule of the automata.In this we can detect and correct errors presented in different systems.

No comments:

Post a Comment