ROM programmable cellular array
Abstract
A graphical merging technique is proposed for synthesizing a PCA using k-input, single-output ROMs. In doing so, the minterms of a given function are first converted to corresponding graphical forms, called the minigraphs. A simple merging rule is provided for merging these graphs in the same manner as two minterms are combined. A coverage map is then used to select the smallest set of graphs which realize the function F, and thus a minimal solution is obtained. An upperbound on the size of the array and the maximum number of irredundant functions realizable by a cascade structure are also provided. While the concept of graphical merger is simple for the synthesis of single-output cells, it is tedious for multi-output cells. A special decomposition technique is employed to synthesize a PCA using k-input, r-output ROMs. Several interesting properties, notably that of the equivalent forms of a cascade, are also discussed in detail. The final synthesized array is also minimal.
- Publication:
-
Ph.D. Thesis
- Pub Date:
- 1976
- Bibcode:
- 1976PhDT.......139S
- Keywords:
-
- Arrays;
- Computer Programming;
- Computer Storage Devices;
- Logical Elements;
- Cascade Control;
- Graphs (Charts);
- Merging Routines;
- Electronics and Electrical Engineering