A self‐recovering communication buffer based on the concept of cellular automaton

Abstract

AbstractThis paper presents a self‐recovering buffer memory for communication systems based on the concept of cellular automaton. The model proposed is a FIFO‐type (First‐in, First‐out‐type) memory which meets the conditions for a communication buffer and incorporates the principles of cellular automaton. By binding together a number of cells which can perform basic FIFO operations, it is found that each cell is capable of determining whether or not it is holding the first valid data in a queue based on information about its own status and it s neighboring cell.It also is observed that this model possesses a capacity for self recovery which always enables the buffer to return to a normal state in the event of an internal transient fault. Furthermore, by representing each cell with a sequential circuit, this buffer memory is prototyped with a gate array and its applicability is verified comparing it with existing FIFO design methods.