Method and apparatus for accessing horizontal sequences and rectangular sub-arrays from an array stored in a modified word organized random access memory system

Claim 2

A word organized random access memory system modified for image processing operations so that the pq image points of any 1 × pq or p × q subarray of any rp × sq image array I(*,*), of points storable in the memory system can be retrieved from or written into the system in a single memory cycle, each image point I(i,j) assuming a Boolean value when i and j lie respectively in the ranges 0≦i<rp-1 and 0≦j<sq-1, the system comprising: memory means (21, 23, 25) for storing rpsq image points in the cells of pq different memory modules, each memory module being an entity capable of storing rs image points in distinguishable cells, only one cell of each module being accessible at any single instant of time; and accessing means (7, 39, 47, 49, FIGS. 3-9) for causing each image point I(i,j) to be retrieved from or written into cell location A(i,j) of the M(i,j)th memory module, where the integer valued functions A(i,j) and M(i,j) are defined by the relations: A(i,j)=(i/p)s+j/q, wherein i/p and j/q are integer quotients, M(i,j)=(iq+j)//pq, wherein (iq+j)//pq is the remainder resulting from the integer division of iq+j by pq.

Claim 3

A menory system according to claim 1, wherein the accessing means include: a data register (39) having a capacity of at least pq image points; routing circuitry (47, 49, FIGS. 7-9) and routing control circuitry (7, 15) for causing each image point I(i,j) to be routed between the data register and the M(i,j)th memory modules; and address calculation circuitry (7, 9, 11, 13, FIGS. 3-6) coacting with the routing circuitry and the routing control circuitry for causing each image point I(i,j) to be retrieved from or written into cell location A(i,j) of the M(i,j)th module.

Claim 4

A word organized random across memory system modified for image processing operations so that the pq image points of any 1 × pq or p × q subarray of any rp × sq image array of points storable in the memory can be retrieved from or written into the system in a single memory cycle; each image point I(i,j) assuming a Boolean value when i and j lie in the respective ranges 0≦<rp=1 and 0≦j<sq-1, the system comprising: memory means (21, 23, 25) for storing rpsq image points in the cells of pq different memory modules, each memory module being an entity capable of storing rs image points in distinguishable cells, only one cell of each module being accessible at any single instant of time; a register (39) for holding at least pq image points; routing circuitry (15, 47, 49, FIGS. 7-9) for causing the appropriate subarray points to be routed between the kth memory module and the g(i,j,k)th register location, where k lies on the range 0≦k<pq and where the function g(i,j,k) is defined by the relation: g(i,j,k)=(k-iq-j)//pq wherein (k-iq-j)//pq constitutes the non-negative remainder resulting from the integer division of (k-iq-j) by pq; and addressing circuitry coacting with the routing circuitry and responsive to designation of subarray shape t and of the subarray starting point I(i,j) for determining the appropriate cell location 1(i,j,k,t) within the kth module according to the relation: 1(i,j,k,t)=t[(i/p)s+(j+g(i,j,k))/q]+t[](i,j,k)/q)/p]s+(j+g(i,j,k)//q)//q)/q], where the operators "/" and "//" designate resectively, an integer quotient and an integer remainder.

Claim 5

A word organized random across memory system modified for image processing operations so that the pq image points of any 1 × pq or p × q subarray of any rp × sq image array of points storable in the memory can be retrieved from or written into the system in a single memory cycle; each image point I(i,j) assuming a Boolean value when i and j lie in the respective ranges 0≦<rp=1 and 0≦j<sq-1, the system comprising: memory means (21, 23, 25) for storing rpsq image points in the cells of pq different memory modules, each memory module being an entity capable of storing rs image points in distinguishable cells, only one cell of each module being accessible at any single instant of time; a register (39) for holding at least pq image points; routing circuitry (15, 47, 49, FIGS. 7-9) for causing the appropriate subarray points to be routed between the kth memory module and the g(i,j,k)th register location, where k lies on the range 0≦k<pq and where the function g(i,j,k) is defined by the relation: g(i,j,k)=(k-iq-j)//pq wherein (k-iq-j)//pq constitutes the non-negative remainder resulting from the integer division of (k-iq-j) by pq; and addressing circuitry coacting with the routing circuitry and responsive to designation of subarray shape t and of the subarray starting point I(i,j) for determining the appropriate cell location 1(i,j,k,t) within the kth module according to the relation: 1(i,j,k,t)=t[(i/p)s+(j+g(i,j,k))/q]+t[](i,j,k)/q)/p]s+(j+g(i,j,k)//q)//q)/q], where the operators "/" and "//" designate resectively, an integer quotient and an integer remainder.

Claim 6

A system according to claim 3, wherein the routing circuitry includes: a first permuter (47, FIG. 7) interposed between the register and the memory modules for rotating the pq subarray image points extracted from the register to the right by the number of positions equal to the magnitude of M(i,j)=(iq+j)//pq; and a second permuter (49, FIG. 9) interposed between the memory modules and the data register for rotating the sequence of subarray image points extracted from the memory modules to the left by the number of positions equal to the magnitude of M(i,j).

Claim 7

A word-organizer random access memory system modified for image processing operations so that pq image points of any 1 × pq or p × q subarray of any rp × sq image array of points storage in the memory can be retrieved from or written into the system in a single memory cycle; each image point I(i,j) assuming a Boolean value when i and j lie in the respective ranges 0≦i<rp - 1 and 0≦j<sq - 1, the system comprising: memory means (21, 23, 25) for storing rpsq image points in the cells of pq different memory modules, each module being an entity capable of storing rs image points in distinguishable cells, only one cell of each module being accesible at any single instant of time; routing circuitry (15, 47, 49, FIGS. 9-7) for causing each image point I(i,j), the memory module being designated by the relation M(i,j)=(iq+j)//pq, where (iq+j)//pq is the remainder resulting from the enteger division of (iq+j)× pq; and addressing circuitry (7, FIGS. 3-6) coacting with the routing circuitry for causing each image point I(i,j) to be retrieved from or written into a corresponding cell location A(i,j) of module M(i,j) according to the relation A(i,j)=(i/t)s+j/q, where i/p and j/p represent integer quotients.

Claim 8

A word-organizer random access memory system modified for image processing operations so that pq image points of any 1 × pq or p × q subarray of any rp × sq image array of points storage in the memory can be retrieved from or written into the system in a single memory cycle; each image point I(i,j) assuming a Boolean value when i and j lie in the respective ranges 0≦i<rp - 1 and 0≦j<sq - 1, the system comprising: memory means (21, 23, 25) for storing rpsq image points in the cells of pq different memory modules, each module being an entity capable of storing rs image points in distinguishable cells, only one cell of each module being accesible at any single instant of time; routing circuitry (15, 47, 49, FIGS. 9-7) for causing each image point I(i,j), the memory module being designated by the relation M(i,j)=(iq+j)//pq, where (iq+j)//pq is the remainder resulting from the enteger division of (iq+j)× pq; and addressing circuitry (7, FIGS. 3-6) coacting with the routing circuitry for causing each image point I(i,j) to be retrieved from or written into a corresponding cell location A(i,j) of module M(i,j) according to the relation A(i,j)=(i/t)s+j/q, where i/p and j/p represent integer quotients.