Abstract:
A method/system of transcoding an MPEG 2/4 bit stream into an H.264 format, handles an input MPEG 2/4 bit stream in a decoder, and identifies certain data in the input bit stream for reuse in the H.264 format; and, reuses the identified data in a re-encoder with assistance from a mapping module in transcoding by converting the input bit stream into an output H.264 format. The identified data includes information at a macrolevel and information at a picture level. The information at the macrolevel might comprise additional stages incorporated in the re-encoder module including a Mapping Process stage, a Sub Pixel Refinement stage, a Mode Selection stage to choose from Intra, Inter or Skip modes, followed by the standard H.264 encoding loop and the Entropy Coding Block. The information at the picture level might include; a) average quantizer of frame, and, b) total bits per frame.

Description:
FIELD OF THE INVENTION 
       [0001]    This invention relates generally to the field of video compression and more specifically to a technique for transcoding of a MPEG-2/MPEG-4 bit stream to a H.264 bit stream. 
       BACKGROUND OF THE INVENTION 
       [0002]    Digital video coding standards, like MPEG-1, MPEG-2, and MPEG-4 have been the engines behind the commercial success of digital video compression and are found in many application scenarios such as broadcast, satellite, cable and terrestrial transmission channels, wireless real-time conversational services, internet video streaming and storage formats (like DVD, and digital camcorders). 
         [0003]    MPEG-2 is the current video coding standard of choice of the broadcast video industry, operating at bit rates from around 3 to 10 Mbps, and provides inter-operable ways of representing audio visual content commonly used in digital media and in digital transmission. Also, MPEG-4 extends this to many more application areas through features including its extended bit rate range, scalability and error resilience. 
         [0004]    The emerging H.264 standard presents a rich collection of state-of-the-art video coding capabilities that can provide inter-operable video broadcast or communication with degrees of capability that far surpass those of prior standards. The H.264 standard was jointly developed by the Video Coding Experts Group (VCEG) of the ITU-T and the Moving Picture Experts Group (MPEG) of ISO/IEC to primarily achieve enhanced coding efficiency and to accommodate a wider variety of bandwidth requirements and picture formats. It uses state-of-the-art coding tools and provides enhanced coding efficiency for a wide range of applications, including video telephony, video conferencing, TV, storage (DVD and/or hard disk based, especially high-definition DVD), streaming video, digital video authoring, digital cinema, and many other applications. 
         [0005]    Conversion of existing MPEG-2/MPEG-4 content into H.264 format would open new possibilities in the areas of storage and broadcast, such as squeezing more TV programs into a given channel bandwidth, delivering quality video over bandwidth-constrained networks and fitting a high definition movie feature onto a standard DVD. Since MPEG-4 standard is a logical extension of MPEG-2, transcoding of MPEG-2 format content to MPEG-4 format is fairly straight forward. However, H.264 is a substantially more complex standard than MPEG-2/MPEG-4. Hence trans-coding a MPEG-2/MPEG-4 bit stream into H.264 format would involve a high degree of complexity. 
       SUMMARY OF THE INVENTION 
       [0006]    The present invention provides for transcoding an input MPEG-2/MPEG-4 bit stream into an H.264 format by reusing certain data in the input bit stream in a re-encoder. In one form, the invention resides in a system for transcoding an MPEG-2/MPEG-4 bit stream into an H.264 format, comprising: a decoder for handling an input MPEG-2/MPEG-4 bit stream and for identifying certain data in the input stream that can be reused; a re-encoder for reusing said certain identified data, and using the identified data with the help of a mapping module, for converting the input bit stream into the H.264 format. The identified data might include information at a macro-block (MB) level and information at a slice, picture or sequence level. The information at the MB level will be utilized by a mapping process stage and a trans-rating unit incorporated in the re-encoder module. The information at the picture level includes; a) total bits per frame b) Sum of Absolute Difference (SAD) of the residual over the entire picture c) average quantizer of frame and d) the number of intra MBs in the picture. Further, the system might include an image processing unit between the decoder and the re-encoder like a trans-scaler unit to change the resolution of input sequence, a coding artifact reduction unit or other video processing engines like a de-interlacer that converts interlaced output of decoder to a progressive input to the re-encoder. 
         [0007]    The invention in another form resides in a method of transcoding a first input block-based motion compensated transform coding based video format stream, into a second block-based motion compensated transform coding based output video format stream comprising the steps of: handling said first video format stream in a decoder and identifying certain data in said first video format stream that could be used in the second video format stream; and using a re-encoder with help from a mapping module for producing an output video stream conforming to said second video format. Variations and modifications to the above method are conceivable and are dealt with in the description that follows. Also taught herein is a computer readable medium encoded with data/instruction which when executed by a computing platform results in execution of the method of the invention. 
     
     
       BRIEF DESCRIPTION OF THE DRAWING 
         [0008]    A detailed description of one or more embodiments of the invention is provided hereinafter along with accompanying figures that illustrate by way of example the principles of the invention, wherein: 
           [0009]      FIG. 1  illustrates a brute force trans-coder that converts a MPEG-2/MPEG-4 stream to a H.264 stream; 
           [0010]      FIG. 2  illustrates an exemplary embodiment of an intelligent low complexity trans-coder that converts a MPEG-2/MPEG-4 stream to a H.264 stream; 
           [0011]      FIG. 3  contains tables that mention the different MB (Macro Block) modes that are supported by the three standards relating to MPEG-2, MPEG-4 and H.264; 
           [0012]      FIG. 4  illustrates the flow used by the trans-coder to decide the best coding mode for the MB in H.264 using data from the input MPEG-2/MPEG-4 stream; 
           [0013]      FIG. 5  shows how information is mapped from the input to the output MBs when the trans-scaler is configured in mode I; 
           [0014]      FIG. 6  illustrates how information is mapped from the input to the output MBs when the trans-scaler is configured in mode II; 
           [0015]      FIG. 7  shows how information is mapped from the input to the output MBs when the trans-scaler is configured in mode III; 
           [0016]      FIG. 8  shows how information is mapped from the input to the output MBs when the trans-scaler is configured in mode IV; 
           [0017]      FIG. 9  shows how information is mapped from the input to the output MBs when the trans-scaler is configured in mode V; 
           [0018]      FIG. 10  shows the top-level flow of the trans-coder to map the MB level information from the input to the output picture under different trans-scaler configurations and for different picture types—progressive frame/interlaced frame and field pictures; 
           [0019]      FIG. 11  shows the flow of the mapping stage to map the MB level information from the input to the output picture when the input picture is either a progressive frame picture or when the input picture of type field and is not being vertically down-scaled; 
           [0020]      FIG. 12  shows the flow of the mapping stage to map the MB level information from the input to the output picture when the input picture is an interlaced frame picture type and is being vertically down-scaled by a factor of 2; 
           [0021]      FIG. 13  shows the flow of the mapping stage to map the MB level information from the input to the output picture when the input picture is a field type and is being vertically down-scaled by a factor of 2; 
           [0022]      FIG. 14  shows the flow of the mapping stage to map the MB level information from the input to the output picture, in the case of an interlaced frame picture when it is known that the MB level information from the input picture can not be accurately mapped to the output picture, considering that this mapping is temporary in nature and the final modes are selected using the flow shown in  FIG. 15 ; 
           [0023]      FIG. 15  shows the flow of the mapping stage to decide on the final coding modes for MBs in an interlaced frame picture when it is known that the MB level information from the input picture can not be accurately mapped to the output picture; 
           [0024]      FIG. 16  shows the pixel grid that is searched during the MV refinement stage; 
           [0025]      FIG. 17  shows the two layer search done during the half pixel refinement stage in an effort to optimize it; and, 
           [0026]      FIG. 18  shows the two layer search done during the quarter pixel refinement stage in an effort to optimize it. 
       
    
    
       [0027]    While the invention is described in connection with certain exemplary embodiments, it should be understood that the invention is not limited to any specific embodiment. On the contrary, the scope of the invention is limited only by the appended claims and the claim equivalents, and the invention encompasses numerous alternatives, modifications and equivalents. For the purpose of example, numerous specific details are set forth in the following description in order to provide a thorough understanding of the present invention. 
       DETAILED DESCRIPTION 
       [0028]    In the following detailed description of the preferred embodiments, reference is made to the accompanying drawings that form a part hereof, and in which are shown by way of illustration, specific embodiments in which the invention may be practiced. It is understood that other embodiments may be utilized and certain changes may be made without departing from the scope of the present invention. 
         [0029]    The proposed technique provides a mechanism for a low complexity transcoding of MPEG-2/MPEG-4 format bit stream into H.264 format bit stream. 
         [0030]    With reference to  FIG. 1 , in its simplest form, transcoding from MPEG-2/MPEG-4 format to H.264 format would require a MPEG-2/MPEG-4 decoder (block  100 ) cascaded to a H.264 encoder (block  101 ) to do the H-264 encoding, as shown in  FIG. 1 . The MPEG-2/MPEG-4 decoder (block  100 ) decodes the MPEG-2/MPEG-4 stream respectively. The (Luminance-Bandwidth-Chrominance)YUV 4:2:0 reconstruction buffer available at the output of the MPEG-2/MPEG-4 decoder (block  100 ) is connected to the H.264 encoder (block  101 ). Inside the motion estimation stage (block  102 ), the full pixel motion estimation engine (block  103 ) finds a coarse motion vector to reduce the temporal redundancy in the sequence. The sub-pixel refinement stage (block  104 ) refines the coarse motion vector to quarter pixel accurate units. The mode selection stage (block  105 ) finally evaluates the coding cost of the different MB modes (intra, inter, skip) and selects the mode associated with the least cost. The H.264 coding block (block  107 ) forward-transforms and quantizes the residual information and sends the quantized coefficients to the entropy coding block (block  108 ) and the H.264 decoding block (block  111 ). The rate control engine (block  106 ) takes relevant input such as the number of syntactical and residual bits used from the entropy coding engine (block  108 ), to compute the quantizer scale that should be used for subsequent MBs and pictures and feeds the same to the H.264 coding engine (block  107 ).The H.264 entropy coding engine (block  108 ) encodes the residual information and the corresponding syntactical data in the H.264 format. The H.264 decoding block (block  111 ) de-quantizes and inverse transforms the residual information. If enabled, the de-blocking filter (block  110 ) is called to post-process the image. The reconstructed frames are finally stored in the YUV buffers (block  109 ) which is then fed back to the motion estimation engine (block  102 ). 
         [0031]    H.264 encoding is a highly computationally intensive operation. The proposed invention reduces the complexity of the trans-coding process by reusing certain data that is available in the input bit stream. By reusing the relevant data available in the input bit stream, this invention achieves a one-third reduction in implementation complexity. 
         [0032]      FIG. 2  illustrates an exemplary embodiment of the present invention in the form of an intelligent low complexity version of a Trans-coder. Referring to  FIG. 2 , at the decoder stage (block  201 ), side information ( 200 ) relevant to the H.264 re-encoding process is derived from the input bit stream as shown, which is reused by the H.264 re-encoder (block  203 ). Any error encountered by the MPEG-2 decoder is handled by the error handler (block  214 ). The YUV 4:2:0 reconstruction buffers available at the output of the decoder are optionally manipulated using an image/video processing filter (block  202 ). An image processing filter such as a scaler could be used to down-scale the resolution of the decoder&#39;s output YUV buffers. Post processing filters such as de-blocking filters and de-ringing filters could be used to reduce the coding noise present in the decoded output. Video processing filters like a de-interlacing filter could be used to reduce interlace coding artifacts in the sequence, if the output stream in H.264 is desired in the progressive format. Similarly, a 3:2 pull down detection block could be used to detect the 3:2 pull down pattern to convert 30 fps telecine content to 24 fps film content. The side information ( 200 ) and the YUV 4:2:0 reconstruction buffers are given as inputs to the H.264 re-encoder (block  203 ). The mapping stage (block  205 ) within the motion estimation engine (block  204 ) translates the information such as the motion vector and the mode in which the MB was coded in the input stream into the H.264 format. This helps the trans-coder to arrive at a coarse estimate for the motion vector by just reusing the information in the input stream. The MV refinement engine (block  206 ) refines the mapped motion vector at a full pixel and/or sub-pixel accuracy. The mode selection engine (block  207 ) computes the coding cost associated with each of the modes in which a MB can be coded, and selects the mode associated with the least cost. The residual information from the motion estimation engine (block  204 ) is sent to the H.264 coding engine (block  209 ), which forward-transforms and quantizes the residual information before sending it to the entropy coding engine (block  210 ) and the H.264 decoding engine (block  213 ). The trans-rater (block  208 ) takes in as input the side information ( 200 ) and information like the amount of syntactical and residual bits consumed from the entropy coding engine (block  210 ) to compute the quantizer scale for the subsequent MBs and pictures. The entropy coding engine (block  210 ) encodes the quantized residual information and the corresponding syntactical information in the H.264 format. The H.264 decoding engine (block  213 ) de-quantizes and inverse transforms the quantized residual information. If enabled, the de-blocking filter (block  212 ) is called to post-process the image. The reconstructed frames are finally stored in the YUV buffers (block  211 ) which is then fed back to the motion estimation engine (block  204 ). 
         [0033]    Comparing the H.264 encoder (block  101 ) in  FIG. 1  and the H.264 re-encoder (block  203 ) in  FIG. 2 , it is easy to see that low complexity trans-coder differs in the sense that it has replaced the full pixel motion estimation stage (block  103 ) with the mapping stage (block  205 ) inside the motion estimation modules (block  102  and block  204  in  FIG. 1  and  FIG. 2  respectively) and the rate-control engine (block  106 ) has been replaced by a trans-rater (block  208 ). Both the mapping stage (block  205 ) and the trans-rater engine (block  208 ) make use of the information present in the MPEG-2/MPEG-4 stream. 
         [0034]    The H.264 re-encoder uses the decisions made by the MPEG-2/MPEG-4 encoder as a starting point. These decisions are available in the input MPEG-2/MPEG-4 bit stream. Starting from these decisions the re-encoder refines them to select the best coding configuration. Since the re-encoder starts from a decision that was already proven good in the MPEG-2/MPEG-4 context, the complexity is reduced substantially as it now only has to refine them to select a better coding configuration. 
         [0035]    Information from the input MPEG-2/MPEG-4 bit stream, that can be reused at the MB level includes: 
       1. Motion vectors for all MB partitions. 
     2. MB coding mode—inter (forward, backward, bi-directional, no motion compensation) or intra mode. 
     3. Field/Frame coding mode. 
     4. Quantizer scale used for the MB. 
     5. Sum of Absolute Difference (SAD) of residuals over a MB. 
     6. Bits usage (syntactical+residuals). 
       [0036]    The proposed technique reuses the following data from the input MPEG-2/MPEG-4 bit stream, at the picture level: 
       1. Picture coding type. 
     2. Sum of Absolute Difference (SAD) of residual over the entire picture. 
     3. Number of Intra MBs present in the stream. 
     4. Average quantizer of frame. 
     5. Total bits per frame. 
       [0037]    The proposed invention expediently deals with three options, namely: 
       1. Trans-scaling—This involves changing (down-scaling) the resolution of the input sequence. 
     2. Trans-coding—This involves the mapping process and the associated algorithms to decide the best mode to code the MBs in besides the encoding and the entropy coding process to code the input data in the H.264 stream format. 
     3. Trans-rating—This process controls the rate at which the output stream is coded. 
       [0038]    Trans-Scaling 
         [0039]    In the trans-scaling method of approach, a trans-scaler unit (block  202 ) is used to down-scale the resolution of the MPEG-2/MPEG-4 decoder&#39;s output as shown in  FIG. 2 . Besides reducing the complexity of the trans-coding operation, the trans-scaler unit also helps in reducing the output bit-rate of the trans-coder, since the re-encoder would have to work on a smaller picture resolution. This embodiment of the current invention supports certain commonly applied scaling ratios to the horizontal and the vertical resolution of the input picture. 
         [0040]    The horizontal resolution can be down-scaled by a factor of ½, ⅔, ¾. The vertical resolution can be down-scaled by a factor of ½, when the horizontal scaling factor is set to ½ as mentioned in the table below. 
         [0000]    
       
         
               
               
               
               
             
           
               
                   
                   
               
               
                   
                 Configuration 
                 Horizontal scaling 
                 Vertical Scaling 
               
               
                   
                   
               
             
             
               
                   
                 I 
                 1 
                 1 
               
               
                   
                 II 
                 ¾ 
                 1 
               
               
                   
                 III 
                 ⅔ 
                 1 
               
               
                   
                 IV 
                 ½ 
                 1 
               
               
                   
                 V 
                 ½ 
                 ½ 
               
               
                   
                   
               
             
          
         
       
     
         [0041]    Trans-Coding 
         [0042]    The second approach referenced above is trans-coding which includes the process of mapping the relevant information from the MPEG-2/MPEG-4 stream in the H.264 format, deciding the best mode to code the MB in and then finally encoding and entropy coding the residual information to convert the data into the H.264 stream format. 
         [0043]    The mapping process intelligently handles the differences between the MPEG-2/MPEG-4 and the H.264 video coding standard. For example, MPEG-2 allows the MVs to be specified only in half pixel units. MPEG-4 allows the MVs to be specified in quarter pixel units though it is possible to specify the MVs in half pixel units as well. All MVs in H.264 are specified in quarter pixel units, the difference being that the quarter pixels in MPEG-4 and H.264 are derived using different spatial filters. 
         [0044]    Similarly there is no ‘one to one’ correspondence for all MB modes supported by MPEG-2/MPEG-4 and those supported by H.264.  FIG. 3  shows the different modes in which a MB can be coded in the three standards. For the case of progressive sequence a MB can be partitioned into 8×8 blocks in MPEG-4, while it can only be coded as a single 16×16 entity in MPEG-2. However, while coding interlaced sequences as frame pictures a MB can only be coded as a single 16×16 entity in both MPEG-4 and MPEG-2, with the two sets of alternating 8 pixel lines having a different MV. The H.264 standard allows a MB to be partitioned in any of the different ways mentioned in  FIG. 3  irrespective of whether the sequence is being coded in the progressive or the interlaced mode. 
         [0045]    Further, while coding interlaced sequences as frame pictures, both the MPEG-2 and MPEG-4 standards decide between the frame and the field coding mode on a MB by MB basis. In the H.264 standard however, this decision is done on a vertical pair of MBs. 
         [0046]    When the trans-scaling option is enabled, the mapping process becomes more complicated since one MB in the output stream derives its information from many MBs in the input stream. The number of MBs in the input stream that map to a single MB in the output stream and the way this mapping is done, depends upon the configuration of the trans-scaler. 
         [0047]    These and the other differences between the input and the output standards and the complexities introduced by scaling the resolution of the input sequence necessitates an intelligent mapping process and mode selection engine to optimally trans-code the MPEG-2/MPEG-4 stream into the H.264 format. 
         [0048]    The first step involved in the trans-coding operation is to map the relevant information from the input MPEG-2/MPEG-4 stream in the H.264 format. As mentioned before, at the picture level, information such as the picture coding type is used to decide the picture coding type of the picture in the output stream. In general the picture in the output stream is coded in the same mode as it was coded in the output stream. The trans-coder has the ability to code any picture as an intra picture (I) and may choose to do so whenever it decides that it is the most optimum coding mode decision to make. For instance, when the input stream is corrupted with errors, the trans-coder may choose to code an Intra (I) picture once it recovers from the errors over-riding the decision that was made in the input stream. Further, if desired, while trans-coding progressive refresh MPEG-2/MPEG-4 streams the trans-coder may insert intra pictures at regular intervals to facilitate random access. 
         [0049]    The flowchart in  FIG. 4  illustrates the exemplary process used to find the best coding mode for a MB in H.264 while reusing the information present in the MPEG-2/MPEG-4 stream. 
         [0050]    The re-encoder translates the relevant MB level information from the MPEG-2/MPEG-4 stream to the H.264 format. The information used at this stage includes the mode (intra, inter, skip) in which the MB was coded in the input stream, the MVs used over the different MB partitions in case the MB is coded as an inter coded MB and information on whether the MB was coded in the frame or the field coding mode in case an interlaced picture is being coded as a frame picture. 
         [0051]    A MB in H.264 can be coded as an inter, intra or a skip MB. The skip and the inter MB mode in MPEG-2/MPEG-4 are mapped to an inter MB in H.264. An intra MB in MPEG-2/MPEG-4 maps to an intra MB in H.264. To optimally trans-code the input stream, the trans-coder evaluates the mapped mode with the other two modes in which a MB could be coded. Thus, instead of blindly following the decisions made by the MPEG-2/MPEG-4 encoder, the trans-coder evaluates the different possible modes in which a MB could be coded before making the final decision. 
         [0052]    After mapping the relevant information from the input stream, the re-encoder first computes the skip mode MVs and the corresponding predictor. If the residual information corresponding to the skip mode gets quantized to zero at the active quantizer scale, it declares the skip mode to be the best mode to code the MB in and exits the MB mode evaluation loop immediately (early exit). 
         [0053]    However, if the residual information corresponding to the skip mode does not get quantized to zero at the active quantizer scale it stores the skip mode as one of the possible candidate modes to use for the current MB. 
         [0054]    MVs found for individual MB partitions during the mapping stage are usually not the MVs that would yield the best coding cost. Besides the noise that gets added to the sequence during the MPEG-2/MPEG-4 encoding process, the H.264 trans-coding process, and the trans-scaling operation and the fact that the H.264 standard allows the MVs to be specified in quarter pixel resolution necessitates the MV refinement stage (block  206 ). The MV refinement stage (block  206 ) refines the mapped MV mapped from the MPEG-2/MPEG-4 stream and those derived for intra MBs in the input stream at the full pixel and/or half pixel accuracy. The MV that results in the least cost during the MV refinement stage (block  206 ) is used as the final MV for the MB partition being refined. 
         [0055]    The intra coding mode supported in the H.264 coding standard has a better coding efficiency than the one supported in MPEG-2/MPEG-4. It is therefore possible that a MB coded as an inter or a skip MB in the MPEG-2/MPEG-4 stream may be better coded as an intra MB in the H.264 stream. Evaluating the intra MB mode for every inter or skip MB coded in the MPEG-2/MPEG-4 stream is computationally intensive and usually unnecessary. The re-encoder evaluates the intra MB mode conditioned on a criterion. If the lesser of the cost found for the skip and the inter MB mode is less than the average cost of the inter MBs coded in the previous picture of the same type, the re-encoder declares that either the skip or the inter MB mode results in a good enough match and hence the intra MB mode need not be evaluated. 
         [0056]    However, if this is not true, the re-encoder evaluates both the intra 4×4 and the intra 16×16 mode. 
         [0057]    The re-encoder finally compares the cost of all the MB modes evaluated until now and selects the mode associated with the least cost as the mode to code the MB in. 
         [0058]    Mapping Stage 
         [0059]    As mentioned before, there exist several differences between the MPEG-2/MPEG-4 and the H.264 standards. Further, when the trans-scaler is enabled, data from several MBs in the input picture is mapped to one MB in the output picture. Because of these complexities a ‘one to one’ mapping is usually not possible between the input and the output sequence. The mapping stage is therefore required to be intelligent to handle these differences to optimally translate the information present in the input sequence in the H.264 format. 
         [0060]    The mapping stage is best described in three different sections. First, the way the input MB partitions physically map to partitions in the output MB. Second, the algorithm used to map the information from the input MB partitions to their corresponding output MB partitions. Here, the manner of how differences between the input and the output standards are handled is explained. Lastly, the arithmetic used to translate the MV and other relevant information in the H.264 syntax. 
         [0061]    The MB level mapping stage re-uses information present in the input MPEG-2/MPEG-4 picture at the corresponding location in the H.264 picture.  FIG. 5  to  FIG. 9  pictorially illustrate how a MB or its partition in the input picture maps to a H.264 MB or one of its partitions under the different trans-scaler configurations. MBs in  FIG. 5  to  FIG. 9  are shown to be partitioned as 8×8 blocks, the finest MB partition possible in either the MPEG-2/MPEG-4 standard. 
         [0062]    In the most simple of all cases when the trans-scaler is disabled, mode-I, a MB in the input picture maps to a MB in the output picture. As shown in  FIG. 5 , if “a”, “b”, “c”, “d” are 8×8 MB partitions of a MB in the input picture, information from these partitions is used to form partitions “A”, “B”, “C”, “D” respectively. Each of the partitions “A”, “B”, “C”, “D” are of size 8×8 pixels and together form a MB in the output picture. 
         [0063]    When the trans-scaler is configured in mode-II, the horizontal dimension of the output picture is ¾ th  that of the input picture. The vertical dimension remains the same. In this mode, 4 horizontally contiguous MBs from the input picture map to 3 horizontally contiguous MBs in the output picture. In  FIG. 6  “a”, “b”, “c”, “d” are partitions of the first MB, “e”, “f”, “g”, “h” that of the second MB, “i”, “j”, “k”, “l” that of the third and the “m”, “n”, “o”, “p” those of the fourth. Each of these partitions is of size 8×8 pixels. Input MB partitions “a”, “b”, “e”, “c”, “d”, “g” are used to derive the information for the MB partitions “A”, “B”, “E”, “C”, “D”, “G” respectively. MB partitions “A”, “B”, “E”, “C”, “D”, “G” together form one MB in the output picture. MB partitions “A” and “C” are of size 8×8 pixels, while the partitions “B”, “E”, “D” and “G” are each of size 4×8 pixels. Similarly information from MB partitions “f”, “i”, “h”, “k” is used to derive the relevant data for the MB partitions “F”, “I”, “H”, “K” respectively, that together form the second MB in the output picture. All the MB partitions “F”, “I”, “H”, “K” are of size 8×8 pixels. Lastly, information from MB partitions “j”, “m”, “n”, “l”, “o”, “p” is used to form the MB partitions “J”, “M”, “N”, “L”, “O”, “P” respectively, that together form the third MB in the output picture. MB partitions “J”, “M”, “L”, “O” are each of size 4×8 pixels while MB partitions “N”, “P” are of size 8×8 pixels. 
         [0064]    When the trans-scaler is configured in mode-III, the horizontal dimension of the output picture is ⅔ rd  that of the input picture. The vertical dimension remains the same. In this mode, 3 horizontally contiguous MBs from the input picture map to 2 horizontally contiguous MBs in the output picture. In  FIG. 7 , “a”, “b”, “c”, “d” are partitions of the first MB, “e”, “f”, “g”, “h” are partitions of the second MB, while “i”, “j”, “k”, “l” are those of the third, each being of size 8×8 pixels. Input MB partitions “a”, “b”, “e”, “c”, “d”, “g” are used to derive the information for the MB partitions “A”, “B”, “E”, “C”, “D”, “G” respectively, that together form one MB in the output picture. MB partitions “A” and “C” are of size 8×8 pixels, while the partitions “B”, “E”, “D” and “G” are each of size 4×8 pixels. Input MB partitions “f”, “i”, “j”, “h”, “k”, “l” are used to derive the information for the output MB partitions “F”, “I”, “J”, “H”, “K”, “L” that together form the second MB in the output picture. MB partitions “F”, “I”, “H”, “K” are each of size 4×8 pixels, while MB partitions “J” and “L” are of size 8×8 pixels. 
         [0065]    When the trans-scaler is configured in mode-IV, the horizontal dimension of the output picture is half that of the input picture. The vertical dimension remains the same. In this mode, 2 horizontally contiguous MBs in the input picture form 1 MB in the output picture. In  FIG. 8 , “a”, “b”, “c”, “d” are partitions of the first MB, while “e”, “f”, “g”, “h” are those of the second, each of size 8×8 pixels. Input MB partitions “a”, “b”, “e”, “f”, “c”, “d”, “g”, “h” are used to derive the information for the MB partitions “A”, “B”, “E”, “F”, “C”, “D”, “G”, “H” respectively that together form one MB in the output picture. Each of these output MB partitions is of size 4×8 pixels. 
         [0066]    When the trans-scaler is configured in mode-V, both the horizontal and the vertical dimension of the output picture is half that of the input picture. In this mode two rows of two horizontally contiguous MBs from the input picture map to a single MB in the output picture. In  FIG. 9  “a”, “b”, “c”, “d” are partitions of the first MB, “e”, “f”, “g”, “h” are that of the second MB, “i”, “j”, “k”, “l” are that of the third and “m”, “n”, “o”, “p” are those of the fourth. Each of these MB partitions is of size 8×8 pixels. The third and the fourth MBs are horizontally contiguous to each other and vertically below the horizontally contiguous MBs one and two. Information from the input MB partitions “a”, “b”, “e”, “f”, “c”, “d”, “g”, “h”, “i”, “j”, “m”, “n”, “k”, “l”, “o”, “p” is used to derive the relevant information for the output MB partitions “A”, “B”, “E”, “F”, “C”, “D”, “G”, “H”, “I”, “J”, “M”, “N”, “K”, “L”, “O”, “P” respectively that together form one MB in the output picture. Each of these partitions is of size 4×4 pixels. 
         [0067]    With the above explanation for the mapping process using the 8×8 MB partitions, it should be relatively simple to infer from these figures how information from larger MB partitions (16×16, 16×8) in the input picture would be used in the output picture. As an example, consider that the input to the trans-coder is a progressive MPEG-2 picture where the only allowed MB partition is 16×16 and that the trans-scaler has been configured in mode II as shown in  FIG. 6 . The input MB partitions “a”, “b”, “c”, “d” will have the same MV information. So would be the case with each of the 4 8×8 blocks [“e”, “f”, “g”, “h”]; [“i”, “j”, “k”, “l”] and [“m”, “n”, “o”, “p”]. Similarly the following groups of output MB partitions [“A”, “B”, “C”, “D”] [“E”, “F”, “G”, “H”]; [“I”, “J”, “K”, “L”] and [“M”, “N”, “O”, “P”] will have the same MV information soon after the mapping stage and hence can be individually considered as 12×16 (width×height) MB partitions. While 12×16 is not a valid H.264 MB partition, the MV refinement stage (block  206 ) works on this partition size because it helps it reduce the number of MB partitions that it will have to refine and that too without altering the results. The entropy coding engine (block  210 ) however splits the MB into valid H.264 MB partitions hence ensuring a conformant H.264 stream at the output. 
         [0068]    The MB coding modes in the MPEG-2/MPEG-4 can be broadly classified into the following four categories—intra frame DCT mode, intra field DCT mode, inter frame MC mode, inter field MC mode. As mentioned before, with the trans-scaler enabled, an output MB in H.264 derives its information from several input MBs. 
         [0069]    For the case of an interlaced frame picture, the input MBs could be coded in any of the four modes mentioned above. Deciding on a single coding mode for the output MB therefore is a non-trivial effort. Taking  FIG. 8  as an example, it is possible that partitions “a”, “b”, “c”, “d” belonging to the first MB have been coded in the intra frame DCT mode while the MB partitions “e”, “f”, “g”, “h” belonging to the second MB have been coded in the inter field MC mode. Similarly, the bottom two MBs in the input picture (needed to form an output MB pair in H.264) could have been coded in the intra field DCT mode and the inter frame DCT mode respectively. The most obvious way of mapping this information from the input stream to the output MB partitions would be to code the MB partitions “A”, “B”, “C”, “D” in the intra frame prediction mode and MB partitions “E”, “F”, “G”, “H” as inter field prediction mode going by the physical mapping described above. This however does not result in a valid H.264 MB coding mode configuration. The trans-coder needs to decide on a single coding mode that optimally represents the information being mapped from all the different MBs present in the input stream that map to a single output MB pair. 
         [0070]    As shown in  FIG. 10 , this complexity in coding the interlaced frame picture sequence does not arise if the information from the input stream can be mapped as is (accurately) without any modification in the H.264 format. Information from the input stream can be mapped accurately in the H.264 stream if all the input MBs that map to the top MB in the MB pair are coded similarly (say coding_mode top     —     mb ) and all the input MBs that map to the bottom MB in the MB pair are coded similarly (say coding_mode bottom     —     mb ) and the coding modes—coding_mode top     —     mb  and coding_mode bottom     —     mb  are mentioned as coding mode combination in Table-1. 
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 1 
               
             
             
               
                   
               
               
                 Coding mode combinations for input MBs that map to 
               
               
                 the top and the bottom MB of a single output MB pair that 
               
               
                 ensures an accurate mapping from the input to the output. 
               
             
          
           
               
                   
                 Coding mode of all input 
                 Coding mode of all input 
               
               
                   
                 MBs that map to a top 
                 MBs that map to a bottom 
               
               
                   
                 MB in the output MB pair 
                 MB in the output MB pair 
               
               
                   
                   
               
               
                   
                 Intra Frame prediction mode 
                 Intra frame prediction mode 
               
               
                   
                   
                 Inter frame prediction mode 
               
               
                   
                 Intra field prediction mode 
                 Intra field prediction mode 
               
               
                   
                 Inter frame prediction mode 
                 Inter frame prediction mode 
               
               
                   
                   
                 Intra frame prediction mode 
               
               
                   
                 Inter field prediction mode 
                 Inter field prediction mode 
               
               
                   
                   
               
             
          
         
       
     
         [0071]    If that is not the case, the trans-coder computes the cost of coding the MB in several different modes and selects the mode that results in the least coding cost. As shown in  FIG. 14 , the trans-coder first maps the MB coding modes to the output H.264 MB partitions based on the trans-scaler configuration. As shown in  FIG. 15 , the trans-coder then makes a list of all the different MB coding modes that got mapped to a single output MB pair in the process. The trans-coder needs to select one of these modes to code the output MB pair in. To do so, the trans-coder runs a loop on all the MB coding modes that have been mapped from the input stream to the top MB of the output MB pair. The trans-coder computes the cost of coding the top MB in that particular mode and the bottom MB in all the valid MB coding modes listed in Table-1 corresponding to the coding mode selected for this loop iteration. Similarly it runs a loop on all the MB coding modes that have been mapped from the input stream to the bottom MB of the output MB pair and computes the cost of coding the bottom MB in that particular mode and the top MB in all the valid MB coding modes listed in Table-1 corresponding to the coding mode in which the bottom MB is being evaluated. The trans-coder avoids any duplicate cost computation by checking if the top or the bottom MB has been evaluated in a particular mode already. Once the cost of all the valid MB coding modes has been evaluated for the top and the bottom MB in the pair, the trans-coder sums up the cost for the top and the bottom MB for all valid MB coding mode pair combinations and selects the mode that results in the least cost. The output MB pair is then coded in this mode (field/frame) in the H.264 stream. 
         [0072]    Tables 2-5 below are expediently used to map information from the input stream to the output stream. In particular, Table-2 relates to the interframe coding mode, Table-3 relates to the interfield coding mode, Table-4 relates to the intraframe coding mode and Table 5 relates to the intrafield coding mode. These tables 2-5 are used by the trans-coder to decide the steps required to convert the MBs from one mode in H.264 to the other coding mode in H.264 in the case of an interlaced frame picture. 
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 2 
               
             
             
               
                   
               
               
                 Steps required to convert the information from the original MB coding mode to the 
               
               
                 inter frame coding mode: 
               
             
          
           
               
                   
                   
                 Steps required to convert the information from the original MB 
               
               
                 Idx 
                 Original MB coding mode 
                 coding mode to the Inter frame coding mode 
               
               
                   
               
               
                 1 
                 Inter frame prediction 
                 — 
               
               
                 2 
                 Intra frame prediction 
                 Compute frame MV candidates from the neighboring left, top, top- 
               
               
                   
                   
                 left 4 × 4 MB partitions besides the (0, 0) and the predictor MV and 
               
               
                   
                   
                 select the MV that results in the lest cost 
               
               
                 3 
                 Inter field prediction 
                 Select the MV that results in the best cost among all the MVs 
               
               
                   
                   
                 mentioned in #2. and the two field MVs that have been mapped 
               
               
                   
                   
                 from the input stream after they are converted to frame units. 
               
               
                 4 
                 Intra field prediction 
                 Same as in #2. 
               
               
                   
               
             
          
         
       
     
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 3 
               
             
             
               
                   
               
               
                 Steps required to convert the information from the original MB coding mode to the 
               
               
                 inter field coding mode: 
               
             
          
           
               
                   
                   
                 Steps required to convert the information from the original MB 
               
               
                 Idx 
                 Original MB coding mode 
                 coding mode to the Inter field coding mode 
               
               
                   
               
               
                 1 
                 Inter field prediction 
                 — 
               
               
                 2 
                 Intra field prediction 
                 Compute field MV candidates from the neighboring left, top, top- 
               
               
                   
                   
                 left 4 × 4 MB partitions besides the (0, 0) and the predictor MV and 
               
               
                   
                   
                 select the MV that results in the lest cost 
               
               
                 3 
                 Inter frame prediction 
                 Select the MV that results in the best cost among all the MVs 
               
               
                   
                   
                 mentioned in #2. and the frame MV that has been mapped from 
               
               
                   
                   
                 the input stream after converting it to field units. 
               
               
                 4 
                 Intra frame prediction 
                 Same as in #2. 
               
               
                   
               
             
          
         
       
     
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 4 
               
             
             
               
                   
               
               
                 Steps required to convert the information from the 
               
               
                 original MB coding mode to the intra frame coding mode: 
               
             
          
           
               
                   
                   
                 Steps required to convert the 
               
               
                   
                   
                 information from the 
               
               
                   
                 Original MB 
                 original MB coding mode partition to 
               
               
                 Idx 
                 coding mode 
                 the Intra frame coding mode 
               
               
                   
               
               
                 1 
                 Inter field prediction 
                 Evaluate the cost of coding the MB 
               
               
                 2 
                 Intra field prediction 
                 as an intra 16 × 16 and an intra 
               
               
                 3 
                 Inter frame prediction 
                 4 × 4 frame MB and select the mode 
               
               
                 4 
                 Intra frame prediction 
                 (16 × 16 or 4 × 4) that results 
               
               
                   
                   
                 in the least cost. 
               
               
                   
               
             
          
         
       
     
         [0000]    
       
         
               
             
               
               
               
             
           
               
                 TABLE 5 
               
             
             
               
                   
               
               
                 Steps required to convert the information from the 
               
               
                 original MB coding mode to the intra field coding mode: 
               
             
          
           
               
                   
                   
                 Steps required to convert the 
               
               
                   
                   
                 information from the 
               
               
                   
                 Original MB 
                 original MB coding mode to 
               
               
                 Idx 
                 coding mode 
                 the Intra field coding mode 
               
               
                   
               
               
                 1 
                 Inter field prediction 
                 Evaluate the cost of coding the MB as an 
               
               
                 2 
                 Intra field prediction 
                 intra 16 × 16 and an intra 4 × 4 field MB 
               
               
                 3 
                 Inter frame prediction 
                 and select the mode 
               
               
                 4 
                 Intra frame prediction 
                 (16 × 16 or 4 × 4) that 
               
               
                   
                   
                 results in the least cost. 
               
               
                   
               
             
          
         
       
     
         [0073]    Again as shown in  FIG. 10 , when the picture is not being down-scaled vertically, it is relatively simple to accurately map the MV information for a progressive or a field picture. For an interlaced frame picture too, when the input picture is not being down-scaled vertically, when coding_mode top     —     mb  and coding_mode bottom     —     mb  are mentioned as valid coding mode combinations in Table-1, mapping the information from the input stream to the output stream is relatively simple. For these cases, as shown in  FIG. 11 , the code loops over all input MB partitions that map to a single MB in the case of a progressive or a field picture or a MB pair in the case of an interlaced frame picture, to ascertain if the MB partition is a part of an intra MB in the input picture. If it is, the input bit stream does not give any information to temporally predict the output MB partition to which it maps. To avoid being forced to code the entire MB as an intra MB because some partitions could not derive information to temporally predict themselves, the re-encoder calculates a few candidate MVs—namely the (0,0) MV, the MV from the neighboring left, top, top-left 4×4 MB partitions and the predictor MV. These candidate MVs are converted to full pixel units and in the case of an interlaced frame picture, if required, is converted to the mode in which the MB would be coded. The candidate MV with the least coding cost is selected as the final MV for the output MB partition. If however, the input MB partition does not belong to an intra MB in the input stream the re-encoder maps the MV information to an output MB partition after scaling it according to the trans-scaler configuration. 
         [0074]    The re-encoder codes only half the vertical resolution of the input picture when the picture is being down-scaled by a factor of 2. For a progressive picture the trans-scaler is configured to down-scale the vertical resolution of the picture by 2. For an interlaced frame picture or a field picture the trans-scaler is not used to scale the vertical resolution. Instead, the trans-coder codes only one field (top/bottom) skipping the other. 
         [0075]    As shown in  FIG. 10 , for a progressive sequence in this particular case the algorithm used to map the MV information remains the same as in the case where the vertical resolution is not being down-scaled, noting that the number of input MB partitions that map to a single output MB will change because of the different trans-scaler configuration. 
         [0076]    For a field picture, once the second field is eliminated, the picture generated using just the first field can be viewed as a progressive frame picture with half the vertical resolution. Hence in this particular case the first field picture (top/bottom) in the input sequence is coded as a frame picture in the output sequence with half the vertical resolution. Referring to  FIG. 13 , for input MB partitions that belong to an inter MB in the input stream, the MVs corresponding to the first field are selected, converted to frame units and scaled according to the trans-scaler configuration before mapping them to the corresponding output MB partition. As before, the re-encoder calculates candidate MVs for those output MB partitions that derive their MVs from intra MBs in the input stream. Since the candidate MVs are computed from the neighboring MBs in the output stream they are already stored in the frame units and hence no mode conversion is required. The candidate MV resulting in the least coding cost is selected as the final MV for the output MB partition. 
         [0077]    For an interlaced frame picture sequence too, just one field (top/bottom) is coded. In this case also, the output picture is coded as a frame picture. As shown in  FIG. 12 , for all MBs in the input stream that map to partitions of a single MB in the output stream, the re-encoder checks whether or not the MB partition belongs to an intra MB in the input stream. If it does, as before the re-encoder calculates candidate MVs from neighboring left, top, top left 4×4 MB partitions in the output picture, the predictor MV besides the (0, 0) MV. Since the candidate MVs are derived from MB partitions in the output picture, they would be already stored in frame units and hence would not require any mode-conversion. The candidate MV resulting in the least coding cost is selected as the final MV for the output MB partition. If the input MB is not an intra MB, it is checked if it is coded in the field or the frame mode. If it is coded in the frame mode the MV information is mapped to the output MB partition after scaling them according to the trans-scaler configuration. Else, the MV corresponding to the top field is chosen, converted into frame units, scaled according to the trans-scaler configuration and then mapped to the output MB partition. 
         [0078]    MVs in the MPEG-2 are mentioned in half pixel accuracy units. MVs in MPEG4 stream can be mentioned in either half or quarter pixel accuracy. MVs in H.264 are coded with quarter pixel accuracy. The MV information are mapped to the H.264 format, based on the trans-scaler configuration, the accuracy with which the MVs are mentioned in the input stream and whether or not they need to be converted from the frame to the field mode or vice-versa. 
         [0079]    MPEG-4 quarter pixel accurate MVs are actually mentioned in half pixel units with a fractional component. MPEG-2 MVs are mentioned in half pixel units. The half pixel unit MVs are first converted to quarter pixel unit MVs using the following equation: 
         [0000]      quarter —   pel   —   mv ( x )=half —   pel   —   mv ( x )&lt;&lt;1 
         [0000]      quarter —   pel   —   mv ( y )=half —   pel   —   mv ( y )&lt;&lt;1  Eq (I)
 
         [0080]    These quarter pixel MVs are then approximated to the nearest half pixel location using the following equation: 
         [0000]      quarter —   pel   —   mv   —   appx _to_half —   pel ( x )=((quarter_pixel —   mv ( x )+1)&amp;0 xFFFE ) 
         [0000]      quarter —   pel   —   mv   —   appx _to_half —   pel ( y )=((quarter_pixel —   mv ( y )+1)&amp;0 xFFFE ).  Eq (II)
 
         [0081]    When the trans-scaler is configured in mode I, MVs from the input stream are first converted to quarter pixel units using Eq (I) and Eq (II): 
         [0000]        h 264_quarter —   pel   —   mv ( x )=quarter —   pel   —   mv   —   appx _to_half —   pel ( x ) 
         [0000]        h 264_quarter —   pel   —   mv ( y )=quarter —   pel   —   mv   —   appx _to_half —   pel ( y ).  Eq (III)
 
         [0082]    When the trans-scaler is configured in mode II, H.264 MVs are derived from half pixel accurate MVs derived using Eq (I) and Eq (II) follows: 
         [0000]        h 264_quarter —   pel   —   mv ( x )=[(quarter —   pel   —   mv   —   appx _to_half —   pel ( x )*3+2)&gt;&gt;2]&amp;0 xFFFE    
         [0000]        h 264_quarter —   pel   —   mv ( y )=quarter —   pel   —   mv   —   appx _to_half —   pel ( y ).  Eq (IV)
 
         [0083]    When the trans-scaler is configured in mode III, H.264 MVs are derived from the half pixel accurate MVs derived using Eq (I) and Eq (II) as follows: 
         [0000]        h 264_quarter —   pel   —   mv ( x )=[(quarter —   pel   —   mv   —   appx _to_half —   pel ( x )*4+3)/6]&amp;0 xFFFE    
         [0000]        h 264_quarter —   pel   —   mv ( y )=quarter —   pel   —   mv   —   appx _to_half —   pel ( y ).  Eq (V)
 
         [0084]    When the trans-scaler is configured in mode IV, H.264 MVs are derived from the half pixel accurate MVs using Eq (I) and Eq (II) as follows: 
         [0000]        h 264_quarter —   pel   —   mv ( x )=((quarter —   pel   —   mv   —   appx _to_half —   pel ( x )+1)&gt;&gt;1)&amp;0 xFFFE    
         [0000]        h 264_quarter —   pel   —   mv ( y )=quarter —   pel   —   mv   —   appx _to_half —   pel ( y ).  Eq (VI)
 
         [0085]    When the trans-scaler is configured in mode V, H.264 MVs are derived from half pixel accurate MVs using Eq (I) and Eq (II) as follows: 
         [0000]        h 264_quarter —   pel   —   mv ( x )=((quarter —   pel   —   mv   —   appx _to_half —   pel ( x )+1)&gt;&gt;1)&amp;0 xFFFE    
         [0000]        h 264_quarter —   pel   —   mv ( y )=((quarter —   pel   —   mv   —   appx _to_half —   pel ( y )+1)&gt;&gt;1)&amp;0 xFFFE.   Eq (VII)
 
         [0086]    Once mapped to the H.264 format, conversion of field mode MVs in quarter pixel units to frame mode in quarter pixel units is done using the following equation: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       quarter_pel 
                        
                       _mv 
                        
                       
                         ( 
                         x 
                         ) 
                       
                     
                     = 
                     
                       quarter_pel 
                        
                       _mv 
                        
                       
                         ( 
                         x 
                         ) 
                       
                     
                   
                    
                   
                     
 
                   
                    
                   
                     
                       quarter_pel 
                        
                       _mv 
                        
                       
                         ( 
                         y 
                         ) 
                       
                     
                     = 
                     
                       { 
                       
                         
                           
                             
                               
                                 ( 
                                 
                                   
                                     quarter_pel 
                                      
                                     _mv 
                                      
                                     
                                       ( 
                                       y 
                                       ) 
                                     
                                   
                                    
                                   2 
                                 
                                 ) 
                               
                                
                               3 
                             
                           
                           
                             
                               
                                 
                                   
                                     If 
                                      
                                     
                                         
                                     
                                      
                                     current 
                                      
                                     
                                         
                                     
                                      
                                     and 
                                      
                                     
                                         
                                     
                                      
                                     reference 
                                      
                                     
                                         
                                     
                                      
                                     fields 
                                   
                                 
                               
                               
                                 
                                   
                                     are 
                                      
                                     
                                         
                                     
                                      
                                     of 
                                      
                                     
                                         
                                     
                                      
                                     the 
                                      
                                     
                                         
                                     
                                      
                                     same 
                                      
                                     
                                         
                                     
                                      
                                     parity 
                                   
                                 
                               
                             
                           
                         
                         
                           
                             
                               
                                 ( 
                                 
                                   
                                     ( 
                                     
                                       
                                         quarter_pel 
                                          
                                         _mv 
                                          
                                         
                                           ( 
                                           y 
                                           ) 
                                         
                                       
                                        
                                       2 
                                     
                                     ) 
                                   
                                    
                                   3 
                                 
                                 ) 
                               
                               - 
                               4 
                             
                           
                           
                             
                               
                                 
                                   
                                     
                                       If 
                                        
                                       
                                           
                                       
                                        
                                       bottom 
                                        
                                       
                                           
                                       
                                        
                                       field 
                                        
                                       
                                           
                                       
                                        
                                       refers 
                                     
                                      
                                     
                                         
                                     
                                   
                                 
                               
                               
                                 
                                   
                                     to 
                                      
                                     
                                         
                                     
                                      
                                     the 
                                      
                                     
                                         
                                     
                                      
                                     top 
                                      
                                     
                                         
                                     
                                      
                                     field 
                                   
                                 
                               
                             
                           
                         
                         
                           
                             
                               
                                 ( 
                                 
                                   
                                     ( 
                                     
                                       
                                         quarter_pel 
                                          
                                         _mv 
                                          
                                         
                                           ( 
                                           y 
                                           ) 
                                         
                                       
                                        
                                       2 
                                     
                                     ) 
                                   
                                    
                                   3 
                                 
                                 ) 
                               
                               + 
                               4 
                             
                           
                           
                             
                               
                                 
                                   
                                     If 
                                      
                                     
                                         
                                     
                                      
                                     top 
                                      
                                     
                                         
                                     
                                      
                                     field 
                                      
                                     
                                         
                                     
                                      
                                     refers 
                                      
                                     
                                         
                                     
                                      
                                     to 
                                   
                                 
                               
                               
                                 
                                   
                                     the 
                                      
                                     
                                         
                                     
                                      
                                     bottom 
                                      
                                     
                                         
                                     
                                      
                                     field 
                                   
                                 
                               
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   
                     - 
                     Eq 
                   
                    
                   
                       
                   
                    
                   
                     ( 
                     VIII 
                     ) 
                   
                 
               
             
           
         
       
     
         [0087]    Similarly, once mapped to the H.264 format, conversion of the frame mode MVs to field mode MVs is done using the following equation: 
         [0000]      quarter —   pel   —   mv ( x )=quarter —   pel   —   mv ( x ) 
         [0000]      quarter —   pel   —   mv ( y )=(quarter —   pel   —   mv ( y )&gt;&gt;3)&lt;&lt;2  Eq (IX)
 
         [0088]    MV Refinement: 
         [0089]      FIG. 16  illustrates the grid that is searched during the MV refinement stage (block  206 ) for a MB partition.  FIG. 16  depicts two search windows, one when the pixel around which the search is centered is a full pixel location, and the other when the pixel around which the search is centered is a half pixel location. 
         [0090]    In  FIG. 16 , pixel locations marked “x” correspond to full pixel locations; “o” correspond to half pixel locations; “•” correspond to quarter pixel locations. 
         [0091]    The MV refinement stage (block  206 ) computes the cost of coding the MB partition at the closest half pixel location derived from the mapping stage. Quarter pixel accurate MVs computed for temporally predicting intra MBs in the input picture are approximated to the closest half pixel location for the purpose of refinement. Centered around this half pixel location, it then searches in a window that may span outside the boundaries of the picture for a full pixel location that results in a lesser coding cost. The MV associated with the least coding cost (say MV center ) is used as the center pixel for subsequent sub pixel refinements. 
         [0092]    The trans-coder searches a square grid (marked “green”) spaced at a distance of one half pixel unit around MV center .  FIG. 16  shows the windows that may be searched during the sub pixel refinement depending upon where the MV center  (marked “yellow”) points to a full pixel or a half pixel location. The half pixel location that results in the best cost (any of the pixels marked “green” or “yellow”) is then used as the center pixel to evaluate quarter pixels (any of the “blue” pixels) by searching on a quarter pixel square grid spaced at a distance of one quarter pixel unit from the center half pixel. Using this process the sub-pixel refinement stage could refine the MVs by ±0.75 pixels in either direction around MV center . Starting from MV center  (marked “yellow”) the search could result in any of the locations within the bounding rectangle to be selected. 
         [0093]      FIG. 17  illustrates how the half-pixel search during the sub-pixel refinement stage is optimized. The half pixel refinement search is expediently split into two layers. During layer I search, starting from MV center  (marked “yellow”) the coding cost is computed for each of the corner half-pixels on a square grid (marked “blue”). Coding cost for the half-pixels on the diamond gird (marked “green”) is estimated by interpolating (averaging) the coding cost of the nearest two half-pixels that were evaluated in layer  1 . Coding cost for the half-pixel on the diamond grid associated with the least interpolated cost is computed in layer II search. The half-pixel location associated with the least coding cost is used for centering the search on the quarter pixel grid. 
         [0094]      FIG. 18  shows how the quarter-pixel search during the sub-pixel refinement stage may be optimized. As in the half pixel refinement search, the quarter pixel refinement search also is split into two layers. During layer I search, starting from the center pixel (marked “yellow”) the coding cost is computed for each of the corner quarter-pixels on a square grid (marked “blue”). Coding cost for the quarter-pixels on the diamond gird (marked “green”) is estimated by interpolating (averaging) the coding cost of the nearest two quarter-pixels that were evaluated in layer  1 . Coding cost for the quarter-pixel on the diamond grid associated with the least interpolated cost is computed in layer II search. The quarter-pixel location associated with the least coding cost is selected as the final MV for the MB partition being evaluated. 
         [0095]    This step is repeated for all partitions into which a MB is divided during the mapping stage. 
         [0096]    It should be noted here that while the MPEG-2 standard does not allow unrestricted motion estimation, the trans-coder makes use of unrestricted motion estimation during the sub-pixel refinement stage, while evaluating the skip mode of coding and while converting intra MBs to inter MBs. 
         [0097]    Complexities introduced by trans-scaling and the differences between the two standards result in finer MB partitions and also different and multiple MVs to be evaluated for each MB partition. These multiple evaluations require a lot of data to be fetched from the external memory which is typically much slower than the processor clock. Optimizing accesses to the external memory hence optimizes the overall system. To do so, DMA (Direct Memory Access) is often employed to fetch data from the external to the internal memory where the internal memory works at a much faster speed. Configuring and triggering DMAs consume processor cycles and doing so multiple numbers of times for each individual partition consumes even more cycles. To optimize the number of DMAs that need to be triggered, the trans-coder fetches an area centered around a MB. The bounding rectangle is defined by the amount of internal memory that can be spared for the search area and by the typical range of MVs that the trans-coder might expect to encounter in the input stream. The typical range of MVs that the trans-coder expects to encounter in the input stream is derived intuitively by considering the application in which the trans-coder is to be used, and by considering the f_code parameter in the input stream. The f_code parameter in the input stream puts a constraint on the range of MVs in the input stream. Pixel data that lie outside of this area and are required by some MVs are then fetched individually by configuring and triggering a separate DMA. 
         [0098]    Transrating: 
         [0099]    Rate control is done in the feedback loop from the output of the entropy coder (block  210 ) to the H.264 coding engine (block  209 ) as shown in  FIG. 2 . The trans-rater (block  208 ) computes the quantizer scale at the picture and the MB level to meet the target output bit rate. The trans-rater uses the following information from the MPEG-2 stream to decide on the quantizer scale: 
         [0100]    Initial buffer fullness, 
         [0101]    Average bit rate at which the MPEG-2 stream has been encoded, 
         [0102]    SAD (Sum of Absolute Differences) at the picture and the MB level, 
         [0103]    Syntactical and the residual bits used at the picture and the MB level, 
         [0104]    Average quantizer scale used over the picture, and, 
         [0105]    Number of intra MBs in the input picture. 
         [0106]    Information like the SAD, and the number of intra MBs that are collected at the picture level in the input stream are used to decide whether or not a scene change occurred in the sequence. The scene change information is critical for the trans-rater (block  208 ) to shape the VBV (Video Buffer Verifier) trajectory so as to avoid any trans-coder buffer underflow. 
         [0107]    The SAD, the number of bits used for the picture and the average quantizer used over the picture is used by the trans-rater (block  208 ) to judge the complexity of the current picture to be coded and allocate bits to it. 
         [0108]    The SAD, the number of bits and the quantizer scale information at the MB level are used to judge the complexity of the MB to decide on the distribution of bits over the MBs in the picture. 
         [0109]    If required the Transcoder can be configured to closely track the VBV trajectory of the input MPEG-2/MPEG-4 stream. 
         [0110]    Similar to a rate-control engine (block  106 ), the trans-rater (block  208 ) is benefited by knowing the coding type and the complexity of the pictures in the input stream in advance. In systems where a low-latency between the input and the output is not a requirement, the input stream is parsed in advance to know the picture coding types and the bits used on each one of them Once the trans-coder begins decoding (block  201 ) and encoding (block  203 ) the input stream, this advance information helps the trans-rater (block  208 ) shape the VBV trajectory. The trans-coder ensures that the input stream is parsed in advance so that the collected information could be made use of later while trans-coding. 
         [0111]    In systems where a low-latency between the input and the output stream is desired, the trans-rater (block  208 ) maintains a histogram of the different GOP (Group Of Pictures) structures it has encountered over a sliding window of the last 16 GOP periods. The bin with the largest hit count is assumed to be the GOP structure for the next GOP to be coded. This helps the trans-rater (block  208 ) arrive at a reasonably good estimate of the GOP structure—the number of I, P, B pictures, the GOP duration and the sub GOP length which helps it shape the VBV trajectory to look close to the one in the input stream. 
         [0112]    Besides the GOP structure the trans-rater gets more real-time feedback on the sub GOP structure (PBB) by decoding the temporal-reference syntax element. This helps the trans-rater know the number of B pictures that follow a P picture which helps the trans-rater shape the VBV trajectory and also delay or avoid the skip of a reference picture (P) by skipping the non-reference picture. 
         [0113]    Error Handling: 
         [0114]    The trans-coder needs to be resilient to errors in the input picture. The decoder (block  201 ) while decoding the input stream expediently checks the bounds and the constraints imposed on all syntactical elements of the stream to decide if the input picture was in error. This error information is sent to the error handling engine (block  214 ) which takes the necessary steps based upon the severity of the error determined by the information in the stream that got corrupted. Errors in the input stream are categorized as either critical or non-critical. 
         [0115]    Information in the MPEG-2/MPEG-4 stream can be broadly classified into two types—header information and picture data information. Information such as the sequence header, the GOP header and the picture header all fall into the header information category. Information used to decode the MB in the input picture fall into the picture data category. An error in the header information is considered critical. Error in the picture data information of a reference picture is again considered critical whereas the same kind of an error in a non-reference picture is not considered critical. 
         [0116]    When the trans-coder encounters a critical error, it only decodes the incoming stream without encoding the pictures. It resumes encoding as soon as it finds an I picture or decodes around 0.5 sec of video without encountering any error. The encoder only inserts stuffing bits during this interval if the encoder buffer is going to underflow. 
         [0117]    When the trans-coder encounters a non-critical error, it skips coding the current picture and inserts stuffing bits if necessary. The trans-coder then resumes encoding from the next picture. 
         [0118]    In the foregoing detailed description of embodiments of the invention, various features are grouped together in a single embodiment for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments of the invention require more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter lies in less than all features of a single disclosed embodiment. Thus the following claims are hereby incorporated into the detailed description of embodiments of the invention, with each claim standing on its own as a separate embodiment. It is understood that the above description is intended to be illustrative, and not restrictive. The description is intended to cover all alternatives, modifications and equivalents as may be included within the spirit and scope of the invention as defined in the appended claims. Many other embodiments will be apparent to those of skill in the art upon reviewing the above description. The scope of the invention should therefore be determined with reference to the appended claims, along with the full scope of equivalents to which such claims are entitled.