Abstract:
A memory architecture for image processing comprising a memory array having multiple multi-byte memory data paths of equal multi-byte data width, and a multiplexing structure connected to the output of the multiple multi-byte data paths, capable of selectively providing a multi-byte data path of a desired width containing a desired permutation of bytes chosen from one or more of the multiple data paths.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS  
       [0001]     This patent application claims priority under 35 U.S.C. § 119(a) to Indian Patent Application No. 3549/Del/2005 entitled “MEMORY STRUCTURE FOR OPTIMIZED IMAGE PROCESSING” filed on Dec. 30, 2005, which is hereby incorporated by reference. Indian Patent Application No. 3549/Del/2005 is assigned to the assignee of the present application and is hereby incorporated by reference into the present disclosure as if fully set forth herein. The present application hereby claims priority under 35 U.S.C. §119(a) to Indian Patent Application No. 3549/Del/2005.  
       TECHNICAL FIELD  
       [0002]     The present disclosure relates to memory structures and in particular to memory structures for image rotation and mirroring.  
       BACKGROUND  
       [0003]     Image processing is an essential function of a vast majority of modern day devices, ranging from computing systems to consumer devices such as cell phones and Personal Digital Assistants (PDAs). The human interfaces for these devices are becoming increasingly graphical in nature in order to provide a more user friendly interface. These graphical user interfaces (GUIs) are also increasing in sophistication as greater computing power becomes available in these devices.  
         [0004]     Conventional image processing systems typically require relatively large memory structures that store the images. The image processing activity involves the manipulation of this large amount of imaging data at very high speeds so as to enable real-time visualization of the images and the movement of those images. Typical operations include image translation and rotation. This high-speed manipulation of the image data is performed by signal processors, general purpose processors or special purpose image processors. These image processing engines access the image data in the memory through high-speed busses that connect them together.  
         [0005]     Conventional memory systems are designed for meeting the needs of normal non-imaging data processing functions. As such, conventional memory systems are designed for normal sequential memory access. When such conventional memory systems are used for image processing, the image data (pixels) are packed to improve the memory utilization, for example, if memory data width is 64-bits then it will contain four 16-bit pixels or two 24-bit pixels and two bytes of the third pixel. The resulting performance is less than optimal as the typical frequently used functions of image translation or rotation very often require non-sequential memory access. Consequently, several memory accesses are required for each step of the image processing function resulting in inefficient and slow operation for a given clock speed.  
         [0006]     Conventional systems attempt to improve the performance of a memory system that is used for image rotation by 90 degrees or a multiple of 90 degrees. For example, conventional system move image data from an initial position to a subsequent position involving rotation by 90 degrees or a multiple of 90 degrees with or without image translation. Typically, such systems focus on determining the optimum movement of the data regardless of the speed of accessing data from the memory without addresses the issues relating to the speed and efficiency of accessing the data from the memory, hence its effectiveness is limited by the memory access mechanism.  
         [0007]     There is therefore a need for memory architectures for efficient image processing applications that involve image rotation by 90 degrees or a multiple of 90 degrees.  
       SUMMARY  
       [0008]     One embodiment of the present disclosure provides a memory architecture that is efficient for image rotation by 90 degrees or a multiple of 90 degrees. In one embodiment, the present disclosure may be extended to implement rotation by any amount with at par or better performance than the conventional architecture.  
         [0009]     In one embodiment, the present disclosure provides a memory architecture for image processing. The memory architecture includes a memory array having multiple multi-byte memory data paths of equal multi-byte data width. The memory architecture also includes a multiplexing structure connected to the output of the multiple multi-byte data paths, capable of selectively providing a multi-byte data path of a desired width containing a desired permutation of bytes chosen from one or more of the multiple data paths.  
         [0010]     In another embodiment, the present disclosure provides a method of providing efficient memory architecture for image processing. The method includes structuring the memory architecture as a multi-byte memory array having multiple data paths of equal multi-byte data width. The method also includes providing a multiplexing structure at the output of the memory array that selectively provides a multi-byte data path of a desired width containing a desired permutation of bytes chosen from one or more of the multiple data paths.  
         [0011]     In still another embodiment, the present disclosure provides a memory architecture for image processing. The memory architecture includes a memory array having multiple multi-byte memory data paths of equal multi-byte data width. The memory architecture also includes a multiplexing structure connected to the output of the multiple multi-byte data paths. The multiplexing structure is capable of selectively providing a multi-byte data path of a desired width containing a desired permutation of bytes chosen from one or more of the multiple data paths. The memory architecture is capable of at least one of: rotating an image, separating an image into luma and chroma planes, image mirroring and generating planar data from an image.  
         [0012]     Other technical features may be readily apparent to one skilled in the art from the following figures, descriptions and claims.  
     
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0013]     For a more complete understanding of this disclosure and its features, reference is now made to the following description, taken in conjunction with the accompanying drawings, in which:  
         [0014]      FIG. 1  is an exemplary block diagram of a preferred embodiment of the present disclosure;  
         [0015]      FIG. 2  is an exemplary block diagram of the Read and Write Logic blocks, in the preferred embodiment;  
         [0016]      FIG. 3  illustrates the format of the address bus, in the preferred embodiment; and  
         [0017]      FIG. 4  illustrates the internal structure of the multiplexing arrangement in the preferred embodiment.  
     
    
     DETAILED DESCRIPTION  
       [0018]     Embodiments of the present disclosure enable efficient utilization of the system bus bandwidth for image manipulation functions. A preferred embodiment of the disclosure, shown in  FIG. 1 , uses six memory cuts each of forty eight data width, along with simple read write control logic and a data multiplexer.  
         [0019]     The embodiment shown in  FIG. 1  is capable of the best bus performance for the 16-bits and 24-bits per pixel modes. This structure can be extended to support other formats with slight alteration. These signals are used in the data multiplexer to pack the data so that all the bits can be used. The data read and data write logic blocks are connected with the system bus for receiving data inputs and control signals.  
         [0020]     In a preferred embodiment, the data width used is 48-bits wide. However, this is not a necessary restriction and the data width can be adjusted according to requirements. The memory system is preferably organized as six equal memory cuts of 48-bit wide data each. A 48-bit wide data width ensures that each single pixel is addressed in each access. The individual chip select and byte select signals are generated for each of the six memory cuts of 48-bit data width, which are, in turn, connected to the data multiplexer for multiplexing the received data and sent back to the SRAM through its 48-bit data bus. Data multiplexing information has the multiplexing information that is to be used by the glue logic. In one embodiment, the system utilizes two level multiplexing, in which the first level decides which combination of bytes from different cuts make a valid combination depending on the selected mode, rotation of the data and the second level selects one of them should be selected.  
         [0021]      FIG. 2  describes a system block diagram of the read and write processes according to one embodiment of the present disclosure. The system includes two write channels and one read channel with associated read and write control blocks (Write Channel#0,1 and Read channel), bi-directional Write FIFO memories and Read FIFO memory of size 12*48, Request Arbiter, system bus (STBUS T 2  in this particular case) I/F, system bus interconnect, configuration registers, SRAM controller, and Glue Logic and SRAM controller. The Write Channels#0 and 1 receive data and control signals and are coupled to bi-directional Write FIFO memories by read and write control blocks. The write channels are further coupled to the Request Arbiter, which in turn is connected to system bus I/F block. This in turn is connected bi-directionally to a system bus interconnect bus which also connects to the SRAM controller which transmits and receives data from the Glue Logic. The glue logic is connected to SRAMs with 6 sets of these signals. Configuration Registers are connected on the system register bus interface (STBUS T 1  in this particular case). In one embodiment, the Request Arbiter is coupled to a Read Channel for outputting data on receiving a read request. The Read Channel is also bi-directionally coupled to the Read FIFO.  
         [0022]      FIG. 3  shows the format of the address bus, in the preferred embodiment. The read and write to SRAM are performed in a manner such that only a small glue logic is required between the SRAM controller and the SRAM. This also allows the use of the existing SRAM Controllers. The address bus in system bus is 32-bit wide and all the bits are not used if we use a 256 KBytes memory. Hence, upper memory addresses can be used for sending data multiplexing and cut selection information. In one embodiment, the 32-bits of address bus are split as shown.  
         [0023]     Memory location address is the address passed to the memory cuts. The same address is also passed to all the memory cuts. The Cut selected field has one bit for each cut. If the bit is ‘1’ then corresponding memory cut is selected (chip select is asserted) and if the bit is ‘O’, memory cut is not selected (chip select de-asserted). Bit  13  corresponds to cut0,  14  to cut 1 and so on. Thus, bit  18  corresponds to cut5. According to one embodiment of the present disclosure, more than one cut may be selected at the same time.  
         [0024]      FIG. 4  shows the internal structure of the Data path multiplexers. Data multiplexing information has the multiplexing information that is to be used by the glue logic. Two level multiplexing is used. The first level decides which bytes of different cuts make a valid combination depending on modes (rotation etc.) and the second level decides which one of them is selected. The multiplexing modes are given in the Table 1 below.  
                                               TABLE 1                           Data Multiplexing During SRAM Reads                Bit 5:3            Bit 2:0   000   010   011   001 a , 100-111               000   D 05 D 04 D 03 D 02 D 01 D 00   b     D 21 D 20 D 11 D 10 D 01 D 00     D 12 D 11 D 10 D 02 D 01 D 00     RESERVED c         001   D 15 D 14 D 13 D 12 D 11 D 10     D 23 D 22 D 13 D 12 D 03 D 02     D 15 D 14 D 13 D 05 D 04 D 03     RESERVED       010   D 25 D 24 D 23 D 22 D 21 D 20     D 25 D 24 D 15 D 14 D 05 D 14     D 32 D 31 D 30 D 22 D 21 D 20     RESERVED       011   D 35 D 34 D 33 D 32 D 31 D 30     RESERVED   D 35 D 34 D 33 D 25 D 34 D 23     RESERVED       100   D 45 D 44 D 43 D 42 D 41 D 40     D 51 D 50 D 41 D 40 D 31 D 30     D 52 D 51 D 50 D 42 D 41 D 40     RESERVED       101   D 55 D 54 D 53 D 52 D 51 D 50     D 53 D 52 D 43 D 42 D 33 D 32     D 55 D 54 D 53 D 45 D 44 D 43     RESERVED       110   RESERVED   D 55 D 54 D 45 D 44 D35D 34     RESERVED   RESERVED       111   RESERVED   RESERVED   RESERVED   RESERVED                    
         [0025]     Still referring to Table 1, 010 and 011 are chosen so that BYTES_PER_PIXEL setting can directly be used (no logic required to generate select signals). 000 is used when the data read write is sequential (non-rotation modes) and 010 or 011 is used when rotation is required. D nm  means data byte m of memory cut n. The order is as it would appear in D[47:0]. Also in Table 1, “Reserved” indicates that it can be used if required for other modes  420  planar.  
         [0026]     The addressing scheme for writing data in different modes will be different and is shown in Table 2.  
                                                                                             TABLE 2                           Memory Access Example for Data Write                Cut no/               Address            Line/   Nor-   Line/   Cut no/Address   Line/   Cut no/Address            Data a     mal   Other   Data   Normal   Other   Data   Normal   Other               0, 0   0/0   0/0   1, 0   (j + 1)/k   1/0   2, 0   (j′ + 1)/k′   2/0       0, 1   1/0   0/1   1, 1   (j + 2)/k   1/1   2, 1   —   2/1       0, 2   210   0/2   1, 2   —   1/2   2, 2   5/k′   2/2       0, 3   3/0   0/3   1, 3   5/k b     1/3   2, 3   0/(k′ + 1)   2/3       0, 4   4/0   0/4   1, 4   0/(k + 1)   1/4   2, 4   1/(k′ + 1)   2/4       0, 5   5/0   0/5   1, 5   1/(k + 1)   1/5   2, 5   2/(k′ + 1)   2/5       0, 6   0/1   0/6   1, 6   2/(k + 1)   1/6   2, 6   3/(k′ + 1)   2/6       0, 7   1/1   0/7   1, 7   3/(k + 1)   1/7   2, 7   4/(k′ + 1)   2/7       . . .   . . .   . . .   . . .   . . .   . . .   . . .   . . .   . . .       . . .   . . .   . . .   . . .   . . .   . . .   . . .   . . .   . . .       0, n c     j/k d     0/m e     1, n   j′/k′   1/m   2, n   j″/k″   2/m                  
 
         [0027]     Still referring to Table 2, “Data” is 48-bits which means 2 or 3 pixels depending on 3 Bytes/pixel 2 Bytes/pixel. It (cut no=5) is not necessarily for 1,3 (line/data). It can be for any data depending on the value of j. It&#39;ll start here if j=1. Same is true for 2,2 (5/k′, it&#39;s only if j′=2). In Table 2, “n” is the data for last pixel of the line.  
         [0028]     In addition, j (or j′ or j″) and k (or k′ or k″) in Table 2 are the cut no. and address respectively for the last data of the line. Finally, m (or m′ or m″) is the address for the last data of the line. Note that the 6th line will start at (m+1) address of cut 0. Similarly, 7th at (m′+1) address of cut 1 and so on. m is also referred to as line_pitch in the following description and tables.  
         [0029]     For read operations, the address generation logic needs to take care of the image transformation mode. Following table shows an example of data read pattern for 90 degree rotated image.  
                                               TABLE 3                           Memory Access Example for Data Read            Output   Input           Line/   Line/   Cut no/Address a              pixel   pixel   16-bit Color Mode   24-bit Color Mode               0, 0   0, n   0, 1, 2/LINE_PITCH-1   0, 1/LINE_PITCH-1       0, 1   1, n       0, 2   2, n       2, 3/LINE_PITCH-1       0, 3   3, n   3, 4, 5/LINE_PITCH-1       0, 4   4, n       4, 5/LINE_PITCH-1       0, 5   5, n       0, 6   6, n   0, 1, 2/(2*LINE_PITCH)-1   0, 1/(2*LINE_PITCH)-1       0, 7   7, n                  
 
         [0030]     Table 3 above illustrates memory access examples for data read. Byte enabled must be asserted accordingly.  
         [0031]     Accordingly, one embodiment of the present disclosure provides a memory architecture that is efficient for image rotation by 90 degrees or a multiple of 90 degrees. It can also be extended to implement rotation by any amount with at par or better performance than the conventional architecture. It is also an object of the present disclosure to provide a memory architecture that is efficient for image mirroring, flipping and generating planar data (separating image into separate luma and chroma planes).  
         [0032]     In addition, one embodiment of the present disclosure provides a memory architecture in which the memory is arranged to provide multiple data paths of a wide multi-byte data width. The individual bytes of each data path are combined in a configurable manner based on the desired image processing operation to produce a variable data path of the desired multi-byte data width that provides efficient memory access for the desired operation. The multiplexing structure can be configured to provide different sets of byte permutations based on changing requirements  
         [0033]     It may be advantageous to set forth definitions of certain words and phrases used in this patent document. The term “couple” and its derivatives refer to any direct or indirect communication between two or more elements, whether or not those elements are in physical contact with one another. The terms “include” and “comprise,” as well as derivatives thereof, mean inclusion without limitation. The term “or” is inclusive, meaning and/or. The phrases “associated with” and “associated therewith,” as well as derivatives thereof, may mean to include, be included within, interconnect with, contain, be contained within, connect to or with, couple to or with, be communicable with, cooperate with, interleave, juxtapose, be proximate to, be bound to or with, have, have a property of, or the like.  
         [0034]     While this disclosure has described certain embodiments and generally associated methods, alterations and permutations of these embodiments and methods will be apparent to those skilled in the art. Accordingly, the above description of example embodiments does not define or constrain this disclosure. Other changes, substitutions, and alterations are also possible without departing from the spirit and scope of this disclosure, as defined by the following claims.