This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient Buffer Memory System for Subarray Access
March 2001 (vol. 12 no. 3)
pp. 316-335

Abstract—Many current graphical display systems utilize a buffer memory system to contain a two-dimensional image array to be modified and displayed. In order to speed up the update of the buffer memory system, it is required that the buffer memory system accesses many image points within an image subarray in parallel. This paper proposes an efficient buffer memory system for a fast and high-resolution graphical display system. The memory system provides parallel accesses to $pq$ image points within a ${\rm{block(p \times q)}}$, a ${\rm{horizontal(1 \times pq)}}$, a ${\rm{vertical(pq \times 1)}}$, a forward-diagonal, or a backward-diagonal subarray in a two-dimensional image array, ${\rm{M \times N}}$, where the design parameters $p$ and $q$ are all powers of two. In the address calculation and routing circuit of the proposed buffer memory system, the address differences of the five subarrays are prearranged according to the index numbers of memory modules and stored in two Static Random Access Memories (SRAMs), so that the address differences are simply added to the base address to obtain the addresses according to the index numbers of memory modules. In addition, for the fast address calculation, one single multiplication operation in the base address calculation is replaced by a SRAM access, so that the multiplication operation can be performed during the SRAM access for the address differences for the case when N is not a power of two. The address calculation and routing circuit proposed in this paper is improved in the hardware cost, the complexity of control, and the speed over the previous circuits.

[1] R.F. Sproull, I.E. Sutherland, A. Thompson, S. Gupta, and C. Minter, “The 8 by 8 Display,” ACM Trans. Graphics, vol. 2, pp. 32-56, Jan. 1983.
[2] R.F. Sproull, “Frame-Buffer Display Architectures,” Ann. Rev., Computer Science, vol. 1, pp. 19-46, 1986.
[3] P. Budnik and D.J. Kuck, “The Organization and Use of Parallel Memories,” IEEE Trans. Computer, vol. 20, no. 12, pp. 1566-1569, Dec. 1971.
[4] D.H. Lawrie, “Access and Alignment of Data in an Array Processor,” IEEE Trans. Computer, vol. 24, no. 12, pp. 1145-1155, Dec. 1975.
[5] D.C. van Voorhis and T.H. Morrin, “Memory System for Image Processing,” IEEE Trans. Computer, vol. 27, no. 2, pp. 113-125, Feb. 1978.
[6] D.H. Lawrie and C.R. Vora, “The Prime Memory System for Array Access,“ IEEE Trans. Computer, vol. 31, no. 5, pp. 435-442, May 1982.
[7] J.W. Park, "An Efficient Memory System for Image Processing," IEEE Trans. Computers, vol. 35, pp. 669-674, July 1986.
[8] D.T. HarperIII, ”A Multiaccess Frame Buffer Architecture,” IEEE Trans. Computer, vol. 43, no. 5, pp. 618-622, May 1994.
[9] A. Norton and E. Melton, “A Class of Boolean Linear Transformations for Conflict-Free Power-of-Two Stride Access,” Proc. Int'l Conf. Parallel Processing, pp. 247-254, 1987.
[10] D.S. Whelan, “A Rectangular Area Filling Display System Architecture,” Computer Graphics, vol. 16, pp. 147-153, July 1982.
[11] J.W. Park and D.T. HarperIII, “Memory Architecture Support for the SIMD Construction of a Gaussian Pyramid,” IEEE Proc. Symp. Parallel and Distributed Processing, pp. 444-451, Dec. 1992.
[12] J.W. Park and D.T. HarperIII, “An Efficient Memory System for the SIMD Construction of a Gaussian Pyramid,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 8, pp. 855-860, Aug. 1996.

Index Terms:
High-resolution graphical display, image processing, buffer memory system, block access, address calculation, address routing, memory module selection.
Citation:
Jong Won Park, "An Efficient Buffer Memory System for Subarray Access," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 3, pp. 316-335, March 2001, doi:10.1109/71.914779
Usage of this product signifies your acceptance of the Terms of Use.