On the Storage Schemes for Parallel Memories without Access Conflict

This paper discusses how storage schemes must be required in such a way that the parallel, conflict-free access to various slices of a 2-dimensional array can be implemented most efficiently, and its corresponding alignment networks NW₁ and NW₂ can be designed more easily; Meanwhile, the structure of storage schemes for any 2-dimensional array is described generally, and an important structured theory is given; Finally, we show how to use a 4×4 storage system to build a 16×16 storage system with the advantages of no memory cell redundancy and simple implementation.