Abstract
A novel memory system is proposed for image processing. Latin squares, which are well known combinatorial objects, are used as the skew function of the memory system. A Latin square with desired properties for image-array access is introduced. The resulting memory system provides access to various subsets of image data (rows, columns, diagonals, main subsquares, etc.) without memory conflict. The memory modules are fully utilized for most frequently used subsets of image data. The address generation can be performed in constant time. This memory system achieves constant-time access to rows, columns, diagonals, and subarrays using a minimum number of memory modules.
Original language | English |
---|---|
Pages | 654-659 |
Number of pages | 6 |
State | Published - 1989 |
Event | Proceedings: IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Rosemont, IL, USA Duration: 6 Jun 1989 → 9 Jun 1989 |
Conference
Conference | Proceedings: IEEE Computer Society Conference on Computer Vision and Pattern Recognition |
---|---|
City | Rosemont, IL, USA |
Period | 6/06/89 → 9/06/89 |