Abstract:
An apparatus and a method for quarter-pel motion compensated search are described in the context of an array processor with tightly coupled, multi-cycle hardware assist attached to each node. A quarter-pel motion compensated search (QPMCS) instruction initiates the quarter-pel motion compensated search pipeline operation. An instruction decode and instruction operation control unit generates a starting address for a 4×4 block of a current macro block search operation indicating where to fetch the pel values. An interpolation unit determines at least eight neighboring quarter-pels per pipeline stage based on the 4×4 block of pel values. An absolute value of difference function computes the absolute value of difference values between a current macro block pel and the at least eight neighboring quarter-pels per pipeline stage. An accumulator accumulates at least eight summation values for the 4×4 block at quarter-pel positions per pipeline stage.

Description:
RELATED U.S. APPLICATION DATA 
       [0001]    The present application claims the benefit of U.S. Provisional Application No. 60/797,558, filed May 04, 2006, which is incorporated by reference herein in its entirety. 
     
     FIELD OF THE INVENTION 
       [0002]    The present invention relates generally to improvements in parallel data processing architectures for video processing and more particularly to apparatus and methods for quarter pixel (quarter-pel) refinement in a single instruction multiple data (SIMD) array processor. 
       BACKGROUND OF THE INVENTION 
       [0003]    Increasing demand for high definition TV products, including interactive TV in a HD format and HD video compression encoding and decoding, requires increasing sophistication, flexibility, and performance in the supporting electronics. The sophistication, flexibility, and performance requirements for HD digital video processing, exceeds the capabilities of current generations of processor architectures by, in many cases, orders of magnitude. 
         [0004]    The demands of video encoding for HD formats are both memory and data processing intensive, requiring efficient and high bandwidth memory organizations coupled with compute intensive capabilities. In addition, a video encoding product must be capable of supporting multiple standards each of which includes multiple optional features which can be supported to improve image quality and further reductions in compression bandwidth. Due to these multiple demands, a flexible parallel processing approach must be found to meet the demands in a cost effective manner. 
         [0005]    A number of algorithmic capabilities are generally common between multiple video encoding standards, such as MPEG-2, H.264, and SMPTE-VC-1. Motion estimation/compensation and deblocking filtering are two examples of general algorithms that are required for video encoding. To efficiently support motion estimation algorithms and other complex programmable functions which may vary in requirements across the multiple standards, a processor by itself would require significant parallelism and very high clock rates to meet the requirements. A processor of this capability would be difficult to develop in a cost effective manner for commercial products. 
         [0006]    A digital video sequence consists of a series of pictures (combined luminance and chrominance samples) arranged in a temporal succession. It may contain either progressive or interlaced frames, which may be mixed together within the same video stream. 
         [0007]    Motion estimation/compensation methods used by video coding algorithms exploit this temporal picture structure by reducing the redundancy inherent in the video sequences of this type. They represent a central part of the video encoding process of MPEG-4 AVC H.264 and SMPTE-VC-1 video encoding standards. 
         [0008]    Motion estimation is computationally the most expensive part of a video encoding process. On average it takes about 60-80% of the total available computational time, thus having the highest impact on the speed of the overall encoding process. It also has a major impact on the visual quality of encoded video sequences. 
         [0009]    The most common motion estimation algorithms are block matching algorithms operating in the time domain. Here motion vectors are used to describe the best temporal prediction for a current block of pixels to be encoded. A time domain prediction error between the current block of pixels and the reference block of pixels is formed, and a search is performed to minimize this value. In general, motion search is divided up into a first full pixel search, followed by a half pixel refined search which is followed by a quarter pixel search. 
         [0010]    The motion search process is computationally intensive and represents a bottleneck in efficient real-time execution of video encoding at high definition formats. 
         [0011]    It will be highly advantageous to efficiently address such problems as the quarter pixel search process discussed in greater detail below. 
       SUMMARY OF THE INVENTION 
       [0012]    In one or more of its several aspects, the present invention addresses problems such as those described above. In one of its aspects, the present invention describes an apparatus that allows improvements in processor node capability in a SIMD array processor. 
         [0013]    An embodiment of the present invention addresses a method for quarter-pel motion compensated search. Issuing a quarter-pel motion compensated search (QPMCS) instruction to initiate the quarter-pel motion compensated search pipeline operation. Interpolating a 4×4 block of current macro block pel positions to produce at least eight neighboring quarter-pels per pipeline stage. Computing at least eight absolute value of difference values between a current macro block pel and the at least eight neighboring quarter-pels per pipeline stage. Accumulating at least eight summation values for the 4×4 block at quarter-pel positions per pipeline stage. 
         [0014]    In another embodiment, the present invention addresses an apparatus for quarter-pel motion compensated search. An instruction decode and instruction operation control unit generates a starting address for a 4×4 block of a current macro block search operation indicating where to fetch the pel values. An interpolation unit determines at least eight neighboring quarter-pels per pipeline stage based on the 4×4 block of pel values. An absolute value of difference function computes the absolute value of difference values between a current macro block pel and the at least eight neighboring quarter-pels per pipeline stage. An accumulator accumulates at least eight summation values for the 4×4 block at quarter-pel positions per pipeline stage. 
         [0015]    These and other features, aspects, techniques and advantages of the present invention will be apparent to those skilled in the art from the following detailed description, taken together with the accompanying drawings and claims. 
     
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0016]      FIG. 1  illustrates a sixteen node video signal processor (VSP 16 ) in accordance with one or more embodiments of the present invention; 
           [0017]      FIG. 2  illustrates a grid of integer (A) and fractional sample positions, ½ (b, c) and ¼ (d, e, f, g, h), for luminance interpolation; 
           [0018]      FIG. 3  illustrates a relationship matrix of fractional sample position dependent variables in chrominance interpolation and surrounding integer position samples A, B, C, and D; 
           [0019]      FIG. 4  illustrates a grid for a 4×4 block of the current MB pixel positions and supporting the computation of SAD values for each of the 8 quarter-pel positions and each block of 4×4 of the current MB pixels; 
           [0020]      FIG. 5  illustrates a first portion of a quarter-pel motion compensated search hardware assist pipeline in accordance with the present invention; and 
           [0021]      FIG. 6  illustrates the quarter-pel motion compensated search hardware assist pipeline in further detail including the first portion of the pipeline illustrated in  FIG. 5  in accordance with the present invention. 
       
    
    
     DETAILED DESCRIPTION 
       [0022]    The present invention will now be described more fully with reference to the accompanying drawings, in which several embodiments of the invention are shown. This invention may, however, be embodied in various forms and should not be construed as being limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. 
         [0023]    Further details of attaching an application specific hardware assist function within an array processor for use in conjunction with the present invention is found in U.S. Provisional Application Ser. No. 60/795,140 entitled “Methods and Apparatus for Attaching Application Specific Functions Within an Array Processor” filed Apr. 26, 2006 and incorporated by reference herein in its entirety. 
         [0024]      FIG. 1  illustrates a sixteen-node video signal processor (VSP 16 )  100  in accordance with one or more embodiments of the present invention. The VSP 16    100  contains four transform engine (TE) clusters  101 - 104 , an interconnection network cluster switch  105 , a multi-channel direct memory access (DMA) controller  106 , and an external memory  107 . The DMA controller  106  interfaces with the external memory  107  over an external memory bus  108  to transfer data to and from the external memory to each of the TE clusters over a multi-channel DMA bus  109 . 
         [0025]    Sixteen processor engines (PEs)  110 - 125  are partitioned in groups of four PEs per cluster as a 4×4 array organization. Each PE provides programmable processing and hardware assist functions. SP/PE 0   110  is unique as compared to the other fifteen PEs  111 - 125 , having an array controlling function combined with the PE function of PE 0 . The common features of the sixteen PEs  110 - 125  include a set of instruction, execution units including a multiply accumulate unit (MAU)  130 , an arithmetic logic unit (ALU)  131 , a store unit (SU)  132 , a load unit (LU)  133 , a hardware assist (HA)  134 , a data select unit (DSU)  135 , a 256×5 slot very long instruction word memory (VIM)  136 , a local PE register file  137 , and a data memory  138  local to each PE and HA. Each PE also contains local pipeline controls, decode logic, and control logic appropriate for each PE. All VSP 16  instructions are executed in a simple pipeline with a majority of instructions requiring a single execution stage and a few instructions requiring two execution stages that are pipelined. 
         [0026]    The unique SP/PE 0   110  combines a controlling function sequence processor (SP) combined with PE 0  functions. To support the SP and PE 0 , a separate SP register file and a separate PE 0  register file, illustrated in one block as SP/PE 0  register files  140  are used to maintain the processing context of the SP and PE 0 . Though not limited to this, the SP/PE 0  shares a single VIM  141 . To control the VSP 16  the SP has a single thread of control supported by an SP instruction memory  142  and an SP data memory  144 . The SP provides program control, contains instruction and data address generation units, supports interrupts, provides DMA control, and dispatches instructions to the PEs  110 - 125 . The SP executes branches and controls the fetching and issuing of instructions such as load VLIW and execute VLIW instructions. The load VLIW instruction provides an indirect VIM address and is used to load the instruction slots at the specified VIM address. The execute VLIW instruction causes a VLIW to be selected at a specified indirect VIM address and executed. 
         [0027]    The single SP thread of control supports 4×4 sub-threads which operate synchronously in lock step single instruction multiple data (SIMD) fashion. Each sub-thread uses very long instruction words (VLIWs) which are indirectly selected and executed by the single SP thread. Each VLIW in each PE at the same VIM address may be different but all unmasked PEs access the same VIM address when executing a VLIW. Five 32-bit instruction slots are provided in each PE, such that with 16 PEs  80  32-bit instructions can execute simultaneously. In addition single, dual, quad, and octal packed data operations may be specified independently by each slot instruction thereby supporting up to 8*80=640 instruction specified operations per cycle. As an example of the processing power this provides, a VSP 16  operating at 250 Mhz may achieve 640*250 Mhz−160 Giga operations per second. 
         [0028]    The VSP 16  processor also uses an interconnection network, cluster switch  105  providing single cycle data transfers between PEs within clusters and between PEs in orthogonal clusters. The communication operations are controlled by a DSU instruction which can be included in a VLIW thereby overlapping communications with computations which with proper software pipelining the communication latency can be reduced to zero. The communication operations operate independently of the DMA which may operate in the background to stream data between the local PE memories and the external memories. 
         [0029]    To support additional processing capability for application specific functions such as motion estimation/compensation and other high compute functions, a hardware assist (HA) unit with advantageous independent connections to local PE memory is provided. A HA unit has one or more multi-cycle tightly coupled state machine functions which provide memory intensive application, specific operational capability to each of the PEs in the VSP 16 . For example, HA unit  147  interfaces with DSU  148  and LU  149  and the local data memory associated with PE 4   114  as a transform engine  150 . 
       Hardware Assist for Quarter Pixel Motion Search Refinement 
       [0030]    In general, the motion search is performed on three different levels: 
         [0031]    1. Full pixel search, where the comparison of the current and reference macroblocks are performed on integer pixel positions. The prediction values at integer positions are obtained by using the samples of the reference picture without alteration; 
         [0032]    2. Half pixel refined search, where the prediction values at half pixel (sample) positions are obtained by applying a multi-lap finite impulse response (FIR) filter to produce interpolated pixels. 
         [0033]    3. Quarter pixel search, where pixel at quarter sample positions are generated by averaging pixel, at integer and half sample positions. 
         [0034]    After the search at full/integer pixel positions, and follow on search refinement at half pixel positions, further search refinement is often needed at quarter pixel position with reference to the full/integer pixel positions. This step requires generation of pixels at quarter-pel positions and it is the subject of this disclosure. 
         [0035]    For each full pixel position a set of 8 new, interpolated pixels at quarter pixel position is generated and the sum of absolute difference (SAD) between the current MB pixels and pixels at quarter pixel position is computed. This is done in 8 different directions by displacing the current MB pixels by a quarter-pel distance horizontally in left and right directions, vertically in up and down direction, and 4 diagonal directions. This step allows for 8 SAD values to be computed for each block of 4×4 pixels. Next, the smallest SAD value is selected and a motion vector is generated describing the best matched quarter pixel MB position. 
         [0036]    A hardware assist module for quarter-pel motion search refinement is an autonomous multi-cycle execution unit for computing motion compensated search refinement with quarter pixel accuracy. 
         [0037]      FIG. 2  illustrates a grid  200  of integer (A) and fractional sample positions, ½ (b, c) and ¼ (d, e, f, g, h), for luminance interpolation. As shown in  FIG. 2  pixels at half pixel positions labeled as ‘b h ’ are obtained by first calculating intermediate value b applying the 6-tap filter to the nearest pixels ‘A’ at integer positions in horizontal direction. The final values are calculated using b h =((b+16)&gt;&gt;5). The pixels at half pixel positions labeled as ‘b v ’ are obtained equivalently with the filter applied in vertical direction. 
         [0038]    The pixel, at half pixel position labeled as ‘c m ’ is obtained by applying the 6-tap filter to intermediate values b of the closest half pixel positions in either vertical or horizontal direction to form an intermediate result c. The final value is calculated using c m =((c+512)&gt;&gt;10). 
         [0039]    The prediction values at quarter pixel positions are generated by averaging pixels at integer and half pixel positions. The process for each position is described below. 
         [0040]    Pixels at quarter pixel positions labeled as ‘d’, ‘g’, ‘e’ and ‘f’ are obtained by averaging with truncation the two nearest pixels at integer or half pixel position using d=(A+b h )&gt;&gt;1, g=(b v +c m )&gt;&gt;1, e=(A+b v )&gt;&gt;1, f=(b h +c m )&gt;&gt;1. 
         [0041]    Pixels at quarter pixel, positions labeled as ‘h’ are obtained by averaging with truncation the closest ‘b h ’ and ‘b v ’ pixels in diagonal direction using h=(b h +b v )&gt;&gt;1. 
       Chrominance Interpolation for Fractional Pixel Position 
       [0042]      FIG. 3  illustrates a relationship matrix  300  of fractional sample position dependent variables in chrominance interpolation and surrounding integer position samples A, B, C, and D. Fractional chrominance pixels are obtained by using the equation: 
         [0000]        v =(( s−d   x )( s−d   y ) A+d   x ( s−d   y ) B+ ( s−d   x ) d   y   C+d   x   d   y   D+s   2 /2)/ s   2 , 
         [0000]    where A, B, C and D are the integer position reference picture pixels surrounding the fractional pixel location, d x  and d y  are the fractional parts of the pixel position in units of one eighth pixels for quarter pixel interpolation, and s is 8 for quarter pixel interpolation. Relationships between the variables in the above equation and reference picture positions are illustrated in  FIG. 3 . 
         [0043]      FIG. 4  illustrates a grid  400  for a 4×4 block of the current MB pixel positions and supporting the computation of SAD values for each of the 8 quarter-pel positions and each block of 4×4 of the current MB pixels. The grid  400  illustrates full-pel, half-pel and quarter-pel positions within the search window, with the current MB pixels placed (based on the previous search results) at the full/half-pel positions. An exemplary set of eight quarter-pel positions are numbered from 1 to 8 in the outlined box  404  of the grid  400  of  FIG. 4 . The quarter pixels are produced by averaging neighboring full and ½ pixels in vertical, horizontal, and diagonal directions. When the SAD values for the quarter-pel refinement are calculated, each current MB pixel is subtracted from 8 quarter-pel values in the surrounding area, and the absolute value of each difference is formed. These absolute values are used next to accumulate the sum of absolute difference (SumABSDIFF) for each of the 4×4 blocks of the current MB of 16×16 pixels, and at each of the 8 quarter-pel positions. 
         [0044]      FIG. 5  illustrates a first portion, of a quarter-pel motion compensated search hardware assist pipeline  500  in accordance with the present invention. The quarter-pel motion compensated search. (QPMS) operation is initiated by use of a QPMS instruction which may combine features of a processing element load instruction for passing commands, address generation values, and compute register file values to the quarter-pel motion compensated search hardware assist state machine and control  502 . The quarter-pel motion compensated search hardware assist pipeline  500  produces in parallel 8 interpolated 1 quarter pixels for each of the 4 MB pixel positions in a MB row, and then produces 8 SADs for all 4 pixels at 8 quarter-pel positions. Each SAD is accumulated in a 16 bit register/accumulator to form a SAD for a 4×4 block of pixels in 4 passes of the inner execution loop. A quarter-pel residue (the difference between each quarter-pel value and the corresponding current MB pixel) is saved in the DIFF-REG and then saved in the local PE/HA memory. 
         [0045]    The data path in  FIG. 5  consists of five stages:
   1. load pixel registers  504 ;   2. quarter-pel simultaneous computation at 8 quarter-pel positions for 4 pixels  506 ;   3. 4×8 ABSDIFF formation and quarter-pel residue extraction to be stored in the local PE/HA memory  508 ;   4. eight simultaneous sums of ABSDIFF formation  510 ; and   5. eight simultaneous accumulate/store result operations  512 .   
 
         [0051]    The quarter-pel motion compensated search computational hardware assist pipeline  500  produces in parallel 8 interpolated quarter pixels for each of the 4 MB pixel positions in a MB row, and then produces 8 SADs for all 4 pixels at 8 quarter-pel positions. Each SAD is accumulated in a 16-bit register/accumulator to form a SAD for a 4×4 block of pixels in 4 passes of the inner execution loop. 
         [0052]      FIG. 6  illustrates the quarter-pel motion compensated search hardware assist pipeline  600  in further detail including the first portion of the pipeline illustrated in  FIG. 5  in accordance with the present invention. It contains 4 groups of 8 16 bit registers/accumulators, allowing for each group to form 8 SAD results for a 4×4 block of pixels at 8 quarter-pel displacements. The execution for a 16×16 MB is staged in 4×4 inner loops, computing 4×8 SADs for four horizontally aligned 4×4 blocks of the current MB. The outer loop repeats 4 times, once for each row of 4×4 blocks. Each quarter-pel residue is also extracted and stored in the local PE/HA memory such as PE 8  and hardware assist data memory  138 . The starting position of the search window is determined based on the best matching result previously calculated for full pel and half-pel current MB displacement. 
         [0053]    The quarter-pel motion compensated search (QPMS) operation is initiated by use of a QPMS instruction as discussed above. 
         [0054]    The pipeline executes the following steps:
   1. Load three quarter-pel search window rows into 3 internal HA registers  604 ;   2. Load current MB row into a dedicated internal HA register  606 ;   3. Simultaneously compute eight neighboring quarter-pels for four horizontal pixel positions of the current MB  608 ;   4. For each of the four contiguous horizontal current MB pixels compute in parallel 8 absolute differences (ABSDIFF) between the current MB pixel and 8 corresponding quarter pixels. Extract and store in the local PE/HA memory computed quarter-pel residues for each current MB pel  610 ;   5. Simultaneously form 8 ABSDIFF sums for each quarter pixel position 1 through 8, and four current MB pixels  612 ;   6. Accumulate 8 ABSDIFF sums in the set of eight 16-bit accumulator-registers (REG  11   614 ,  21   615 ,  31   616 ,  41   617 ,  51   618 ,  61   619 ,  71   620 , and  81   621 );   7. Load the next four (shift right) pixels from the three SW registers into the pipeline;   8. Repeat steps 3, 4, 5;   9. Accumulate 8 ABSDIFF sums in the set of eight 16-bit accumulator-registers (REG  12   622 ,  22   623 ,  32   624 ,  42   625 ,  52   626 ,  62   627 ,  72   628 , and  82   629 );   10. Load the next four (shift right) pixels from the three SW registers into the pipeline;   11. Repeat steps 3, 4, 5;   12. Accumulate 8 ABSDIFF sums in the set of eight 16-bit accumulator-registers (REG  13   630 ,  23   631 ,  33   632 ,  43   633 ,  53   634 ,  63   635 ,  73   636 , and  83   637 );   13. Load the next four (shift right) pixels from the three SW registers into the pipeline;   14. Repeat steps 3, 4, 5;   15. Accumulate 8 ABSDIFF sums in the set of eight 16-bit accumulator-registers (REG  14   638 ,  24   639 ,  34   640 ,  44   641 ,  54   642 ,  64   643 ,  74   644 , and  84   645 );   16. Load the next two rows of the search window. Load the next MB row;   17. Repeat steps 3 through 15 three more times;   18. Store 32 SAD values for the four 4×4 blocks of the current MB in the PE/HA memory  650 ;   19. Repeal steps 3 through 18 three more limes using the 4-way mux  652  to select the appropriate values.   
 
         [0074]    A total of 128 SAD values are produced and stored in the PE/HA local memory for further processing by the PE. Arithmetic compute flags (ACFs) may be set at the end of the quarter-pel motion compensated search operation and passed to the DSU to register the flags. 
         [0075]    While the present invention has been disclosed in the context of various specific illustrative embodiments, it will be recognized that the invention may be suitably applied to other environments and applications consistent with the claims which follow.