USPatent applicationPatented

Intra coding video data methods and apparatuses

Granted 20 Oct 2009 · no office action yet

Current assignee: Intel Corporation · originally RealNetworks, Inc.

Law firm: Law firm · Log in to unlock

Attorney: Attorney · Log in to unlock

Inventors: Gregory J. Conklin · Examiner: David Czekaj · AU 2621 · TC 2600

Life of the application

11 dated events
⤢ drag to zoom200220042006200820102012201420162018202020222024ProsecutionOwnershipTerm & fees
ProsecutionOwnershipTerm & feeshover for detail · click to open

Abstract

Streamlined prediction approaches are provided to predict pixel values of a 4×4 subblock of a macroblock of video data being encoded, under a number of prediction modes. Additionally, prediction approaches are provided to predict pixel values of a non-4×4 M×N subblock of a macroblock of video data being encoded, under a number of prediction modes, including 8×8, 8×4 and 4×8 subblocks. The invention may be practiced in an encoder and/or a decoder of a video apparatus.

Description

9 parts
›RELATED APPLICATION

This application is a continuation-in-part application of U.S. application Ser. No., 09/732,522, filed Dec. 6, 2000, now U.S. Pat. No. 6,765,964 entitled “System and Method for Intracoding Video Data”.

This application also claims priority to Provisional Applications:

No. 60/394,524, filed Jul. 8, 2002, entitled “Low Complexity Diagonal Mode for Intra-Prediction”; number 60/414,120, filed Sep. 27, 2002, entitled “Reducing Pixel Dependencies for Intra Prediction”; No. 60/415,447, filed Oct. 1, 2002, entitled “Reducing Pixel Dependencies for Intra Prediction With Varying Block Sizes”. The specifications of these applications are hereby fully incorporated by reference.

›BACKGROUND OF THE INVENTION

1. Field of the Invention

The invention pertains to a video system that compresses video data for transmission or storage and decompresses the video data for display. More particularly, the invention pertains to a video system and a method for intracoding video data.

2. Description of the Related Art

Video systems transmit, process and store large quantities of video data. To create a video presentation, such as a video movie, a rendering video system displays the video data as a plurality of digital images, also referred to as “frames,” thereby simulating movement. In order to achieve a video presentation with an acceptable video quality, or to enable transmission and storage at all, a conventional video system modifies the video data prior to transmission or storage. For instance, the video system compresses and encodes the video data to reduce the bit rate for storage and transmission.

In a conventional video system a video encoder is used to compress and encode the video data and a video decoder is used to decompress and to decode the video data. The video encoder outputs video data that has a reduced bit rate and a reduced redundancy. That is, the technique of video compression removes spatial redundancy within a video frame or temporal redundancy between consecutive video frames.

The video encoder and video decoder may be configured to apply one of two types of coding to compress the video stream, namely intracoding and interceding. These two types of coding are based on the statistical properties of the video frames. When the video frames are coded using intracoding, the compression is based on information contained in a single frame (the frame that is compressed) by using the spatial redundancy within the frame. Intracoding, thus, does not depend on any other frames. In contrast, intercoding uses at least one other frame as a reference and codes a difference between the frame to be compressed and the reference frame. Intercoding is thus based on a temporal redundancy between consecutive frames in the video data.

The field of video compression is subject to international standards, e.g., various International Telecommunications Union (ITU) standards that define uniform requirements for video coding and decoding. Typically, these standards evolve based on contributions from the industry. In addition, manufacturers of video coders and decoders also modify or build upon the international standards and implement additional proprietary techniques for video compression.

Despite the existence of the international standards and the proprietary techniques, there is still a need for improved techniques for video compression. For example, as the quality of a displayed video movie depends directly from the technique used for video compression, any improvement of the video compression technique makes the video movie more pleasing for the viewer.

›BRIEF DESCRIPTION OF THE DRAWINGS

These and other aspects, advantages, and novel features of the invention will become apparent upon reading the following detailed description and upon reference to the accompanying drawings.

FIG. 1 is a high-level block diagram of a system for video applications having an encoding side and a decoding side.

FIG. 2 is a high-level illustration of a frame and its division in macroblocks and subblocks.

FIG. 3 is a subblock illustrating the directions according to which the subblock can be encoded, wherein each direction represents one of eight prediction modes in accordance with the present invention.

FIG. 4 is a flow chart in accordance with an embodiment of the present invention that selects a prediction mode.

FIG. 5 is an illustration of three neighboring subblocks, wherein two subblocks are used to encode the third subblock.

FIG. 6 illustrates a video device having an encoder and a decoder incorporated with the encoding/decoding teachings of the present invention, in accordance with one embodiment.

FIG. 7 illustrates an article of manufacture with a recordable medium having a software implementation of the encoder/decoder of the present invention, designed for use to program a device to equip the device with the encoding/decoding capability of the present invention, in accordance with one embodiment.

FIG. 8 illustrates a system having a video sender device and a video receiver device incorporated with the encoding/decoding teachings of the present invention, in accordance with one embodiment.

FIGS. 9 a - 9 c illustrate the surrounding pixels used for predicting the pixel values of a 8×8, a 8×4 and a 4×8 subblock respectively, in accordance to three alternate embodiments.

›DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT · 1 of 5

In the following description, reference is made to the accompanying drawings, which form a part hereof, and which show, by way of illustration, specific embodiments in which the invention may be practiced. It is to be understood that other embodiments may be utilized and structural changes may be made without departing from the scope of the present invention. Where possible, the same reference numbers will be used throughout the drawings to refer to the same or like components. Numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, it will be obvious to one skilled in the art that the present invention may be practiced without the specific details or with certain alternative equivalent devices and methods to those described herein. In other instances, well-known methods, procedures, components, and devices have not been described in detail so as not to unnecessarily obscure aspects of the present invention.

Various operations will be described as multiple discrete steps in turn, in a manner that is helpful in understanding the present invention, however, the order of description should not be construed as to imply that these operations are necessarily order dependent. In particular, these operations need not be performed in the order of presentation.

The phrase “in one embodiment” is used repeatedly. The phrase generally does not refer to the same embodiment, however, it may. The terms “comprising”, “having” and “including” are synonymous, unless the context dictates otherwise.

FIG. 1 is a high-level block diagram of a video compression and decompression system 1 (hereinafter “video system 1 ”) having an encoder apparatus 3 and a decoder apparatus 5 that is coupled to the encoder apparatus 3 through a medium 9 . The encoder apparatus 3 includes a video encoder 2 , a mode selector 14 and a buffer 8 . The decoder apparatus 5 includes a buffer 10 , a video decoder 12 and a mode selector 16 . The encoder apparatus 3 receives a video sequence 20 (VIDEO IN) and encodes the video sequence 20 to generate an encoded and thus compressed representation in one of a number of possible formats. The format may be in an interleaved format tailored for “live” streaming of the encoded representation. The format may also be in a single file format in which each of the encoded representation is stored in a contiguous block within one file.

The video sequence 20 input to the encoder apparatus 3 may be either a live signal, e.g., provided by a video camera, or a prerecorded sequence in a predetermined format. The video sequence 20 includes frames of a digital video, an audio segment consisting of digital audio, combinations of video, graphics, text, and/or audio (multimedia applications), or analog forms of the aforementioned. If necessary, conversions can be applied to various types of input signals such as analog video, or previously compressed and encoded video to produce an appropriate input to the encoder apparatus 3 . In one embodiment, the encoder apparatus 3 may accept video in RGB or YUV formats. The encoder apparatus 3 , however, may be adapted to accept any format of input as long as an appropriate conversion mechanism is supplied. Conversion mechanisms for converting a signal in one format to a signal in another format are well known in the art.

The medium 9 may be a storage device or a transmission medium. In one embodiment, the video system 1 may be implemented on a computer. The encoder apparatus 3 sends an encoded video stream (representation) to the medium 9 that is implemented as a storage device. The storage device may be a video server, a hard disk drive, a CD rewriteable drive, a read/write DVD drive, or any other device capable of storing and allowing the retrieval of encoded video data. The storage device is connected to the decoder apparatus 5 , which can selectively read from the storage device and decode the encoded video sequence. As the decoder apparatus 5 decodes a selected one of the encoded video sequence, it generates a reproduction of the video sequence 20 , for example, for display on a computer monitor or screen.

In another embodiment, the medium 9 provides a connection to another computer, which may be a remote computer that receives the encoded video sequence. The medium 9 may be a network connection such as a LAN, a WAN, the Internet, or the like. The decoder apparatus 5 within the remote computer decodes the encoded representations contained therein and may generate a reproduction of the video sequence 20 on a screen or a monitor of the remote computer.

Aspects of the video system 1 illustrated in FIG. 1 and described above can be combined and supplemented to achieve other embodiments. Numerous other implementations are consistent with the scope of this invention. Such other implementations need not be restricted to video, but may include audio or other forms of media as well.

Pre-existing video encoding techniques typically break up a frame (picture) into smaller blocks of pixels called macroblocks. Each macroblock can consist of a matrix of pixels, typically a 16×16 matrix, defining the unit of information at which encoding is performed. The matrix of pixels is therefore referred to as a 16×16 macroblock. These video encoding techniques usually break each 16×16 macroblock further up into smaller matrices of pixels, e.g. 8×8 matrices of pixels or 4×4 matrices of pixels. Such matrices are hereinafter referred to as subblocks.

In one embodiment of the present invention, a 16×16 macroblock is divided into 16 4×4 subblocks. In other embodiments, a 16×16 marcoblock is divided into 8×8 subblocks, 8×4 subblocks, or 4×8 subblocks. Those skilled in the art will appreciate that the present invention is equally applicable or easily adaptable to systems that use other sublocks, or only 16×16 marcoblocks without breaking it up into subblocks.

Further, the pre-existing encoding techniques provide for motion compensation and motion estimation using motion vectors. The motion vectors describe the direction, expressed through an x-component and a y-component, and the amount of motion of the 16×16 macroblocks, or their respective subblocks, and are transmitted to the decoder as part of the bit stream. Motion vectors are used for bidirectionally encoded pictures (B-pictures) and predicted pictures (P pictures) as known in the art.

›DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT · 2 of 5

The video encoder 2 performs a discrete cosine transform (DCT) to encode and compress the video sequence 20 . Briefly, the video encoder 2 converts the video sequence 20 from the spacial, temporal domain into the frequency domain. The output of the video encoder 2 is a set of signal amplitudes, called “DCT coefficients.” A quantizer receives the DCT coefficients and assigns each of a range (or step size) of DCT coefficient values a single value, such as a small integer, during encoding. Quantization allows data to be represented more compactly, but results in the loss of some data. Quantization on a finer scale results in a less compact representation (higher bit-rate), but also involves the loss of less data. Quantization on a more coarse scale results in a more compact representation (lower bit-rate), but also involves more loss of data. The mode selector 14 communicates with the video encoder 2 and monitors and controls encoding of the video sequence 20 . The mode selector 14 determines in accordance with the present invention prediction modes according to which the video encoder 2 encodes the video sequence 20 . The mode selector 14 may be a processor or one or more software modules that are configured to operate in accordance with a method of the present invention. FIG. 1 shows the mode selector 14 for illustrative purposes as an element separate from the video encoder 2 . Those skilled in the art will appreciate that the functionality of the mode selector 14 may be combined with the functionality of the video encoder 2 .

The buffer 8 of the encoder apparatus 3 receives the encoded and compressed video sequence (hereinafter “encoded video sequence”) from the video encoder 2 and adjusts the bit rate of the encoded video sequence before it is sent to the medium 9 . Buffering may be required because individual video images may contain varying amounts of information, resulting in varying coding efficiencies from image to image. As the buffer 8 has a limited size, a feedback loop to the quantizer may be used to avoid overflow or underflow of the buffer 8 . The bit-rate of the representation is the rate at which the representation data must be processed in order to present the representation in real time.

The decoder apparatus 5 performs the inverse function of the encoder apparatus 3 . The buffer 10 serves also to adjust the bit rate of the incoming encoded video sequence. The video decoder 12 decodes and decompresses in combination with the mode selector 16 the incoming video sequence reconstructing the video sequence. The mode selector 16 determines the prediction modes according to which the video encoder 2 encoded the incoming video sequence. The decoder apparatus 5 outputs a decoded and decompressed video sequence 24 illustrated as “VIDEO OUT” (hereinafter “decoded video sequence 24 ”).

The video decoder 12 receives a bit stream that represents the encoded video sequence from the buffer 10 ( FIG. 1 ). In one embodiment, the video decoder is a conventional video decoder, e.g., a MPEG-x decoder, that includes a decoder controller, a VLC decoder (Variable Length Coding, VLC) and a reconstruction module. The operation and function of these components are known to those skilled in the art. These components are known to those skilled in the art and described in generally available MPEG documents and publications.

FIG. 2 is a diagram illustrating a video frame 30 that is part of the video sequence 20 . As described above, known video encoding techniques typically break up a video frame 30 into macroblocks 36 , 36 a , 36 b , 36 c , 36 d . For example, the video frame 30 is divided into a matrix of 16×16 macroblocks 36 , 36 a , 36 b , 36 c , 36 d . The video system 1 encodes the macroblocks 36 , 36 a , 36 b , 36 c , 36 d line by line, from top to bottom and from left to right, as indicated through a dashed line 34 that illustrates the sequence of, e.g., intra encoding. In the illustrated embodiment, the dashed line 34 ends at the macroblock 36 a , which is the next macroblock to be encoded. All prior macroblocks 36 , 36 b , 36 c , 36 d have already been encoded.

The macroblock 36 a , as a representative for all macroblocks 36 , 36 a , 36 b , 36 c , 36 d , is shown in greater detail below the video frame 30 . The video encoding technique of the video system 1 breaks each macroblock 36 , 36 a , 36 b , 36 c , 36 d further up into a matrix of pixels 38 , hereinafter referred to as a subblock 38 .

In one embodiment, the subblock 38 is a 4×4 matrix of pixels, wherein the 16 pixels are labeled as a, b, c, . . . , p (in a “row first” manner). Bordering pixels of an adjacent subblock of a neighboring macroblock 36 b , which is located directly above subblock 38 of macroblock 36 a , are labeled as A, B, C, D. Further, bordering pixels of a subblock of macroblock 36 b located above and to the right of the subblock 38 are labeled as E, F, G, H. Likewise, bordering pixels of an adjacent subblock of a neighboring macroblock 36 c , which is located directly to the left of subblock 38 of macroblock 36 a , are labeled as I, J, K, L. Bordering pixels of a subblock of marcoblock 36 c located to the left and below of subblock 38 are labeled as M, N, O, P. A bordering pixel of a subblock of a macroblock 36 d , which is located above and to the left of subblock 38 of the macroblock 36 a , is labeled as Q.

The video system 1 of the present invention codes each macroblock 36 as an intra macroblock. Intra macroblocks are transform encoded without motion compensated prediction. Thus, intra macroblocks do not reference decoded data from either previous or subsequent frames. An I-frame is a frame consisting completely of intra macroblocks. Thus, I-frames are encoded with no reference to previous or subsequent frames. I-frames are also known as “Intra-frames.”

FIG. 3 is a subblock 38 illustrating possible directions according to which the subblock 38 may be encoded. In accordance with the present invention, the subblocks of a macroblock 36 , 36 a , 36 b , 36 c , 36 d can be intra coded in one of nine modes (Modes 0, Mode 1, . . . , Mode 9) as listed hereinafter. That is, a particular subblock 38 may be predicted from a subblock above the current subblock that is currently decoded (“vertical prediction”), from the subblock to the left of the current subblock (“horizontal prediction”), or from both the left and the above subblocks (“diagonal prediction”). The Modes 1-8 predict the subblock in a predetermined direction and the Mode 0 uses a uniform average without prediction in a predetermined direction. In FIG. 3 , each direction represents one of the eight prediction modes in accordance with the present invention.

›DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT · 3 of 5

Mode 0:

In this mode, each pixel a-p is predicted by the following equation:

It is contemplated that in this mode as well as in the following modes, a “division” means to round the result down toward “minus infinity” (−∞). For instance, in mode 0, the term “+4” ensures that the division results in a rounding to the nearest integer. This applies also the other modes.

If four of the pixels a-p are outside the current picture (frame) that is currently encoded, the average of the remaining four pixels is used for prediction. If all eight pixels are outside the picture, the prediction for all pixels in this subblock is 128. A subblock may therefore always be predicted in mode 0.

Mode 1:

If the pixels A, B, C, D are inside the current picture, the pixels a-p are predicted in vertical direction as shown in FIG. 3 . That is, the pixels a-p are predicted as follows:

Mode 2:

If the pixels I, J, K, L are inside the current picture, the pixels a-p are predicted in horizontal direction. That is, the pixels a-p are predicted as follows:

Mode 3:

This mode is used if all pixels a-p are inside the current picture. This corresponds to a prediction in a diagonal direction as shown in FIG. 3 . The pixels a-p are predicted as follows:

Mode 4:

This mode is used if all pixels a-p are inside the current picture. This is also a diagonal prediction.

Mode 5:

This mode is used if all pixels a-p are inside the current picture. This is also a diagonal prediction.

Mode 6:

This mode is used if all pixels a-p are inside the current picture. This is a diagonal prediction.

Mode 7:

This mode is used if all pixels a-p are inside the current picture. This is a diagonal prediction.

Mode 8:

This mode is used if all pixels a-p are inside the current picture. This is a diagonal prediction.

In one embodiment of the present invention, a mode selection algorithm determines a criteria to select one of the nine modes. The subblock 38 is then encoded in accordance with the selected mode. The mode selection algorithm is described in detail below.

FIG. 4 is a flow chart of a procedure illustrating the method in accordance with the present invention that codes video data including a stream of video frames and that selects one of the prediction modes Modes 0-8. In one embodiment, the method codes a luminance portion (Y) of a video frame.

In a step 28 , e.g., when a user activates the video system 1 , the procedure initializes the video system 1 . The initialization procedure includes, for example, determining whether the encoder apparatus 3 is operating and properly connected to receive the stream of video frames.

In a step 30 , the procedure receives the stream of video frames and divides each video frame into a matrix of a plurality of subblocks, wherein each subblock includes a plurality of pixels. The matrix of a plurality of subblocks may include 4×4 subblocks 38 that are part of a macroblock as described above.

In a step 32 , the procedure defines the nine prediction modes Mode 0-8, wherein each prediction mode determines a mode according to which a present subblock is to be coded. For example, the procedure may execute a subroutine to calculate and define the modes Mode 0-8.

In a step 34 , the procedure selects one of the nine prediction modes Mode 0-8 to encode the present subblock 38 . In one embodiment, the procedure calculates for each mode an error value, determines which mode provides a minimum error value and selects that mode for encoding the present subblock 38 .

Once the procedure has selected the “best” prediction mode to encode the pixels of the present subblock 38 , the procedure encodes the minimum error value and transmits the encoded minimum error value within a compressed bitstream to the decoder. The minimum error value represents a difference between the predicted pixels of the present subblock and the original pixels of the subblock. The difference may be encoded using a DCT, coefficient quantization and variable length coding as known in the art. The decoder uses the predicted pixels and the difference to the original pixels to accurately reconstruct the video frame. The procedure ends at a step 36 .

The procedure provides that each of the 4×4 subblocks 38 is coded in accordance with one of the nine prediction modes Mode 0-8. As this may require a considerable number of bits if coded directly, the video system 1 in accordance with the present invention may apply a more efficient way of coding the mode information. A prediction mode of a subblock is correlated with the prediction modes of adjacent subblocks.

FIG. 5 illustrates this through three exemplary subblocks A, B, C. The subblock C is the subblock that is to be encoded (predicted) with the help of the subblocks A, B whose prediction modes are known. The subblock A is located above the subblock C and the subblock B is located left of the subblock C. In this case, an ordering of the most probable, next most probable etc. prediction mode for the subblock C is given. An example of such an ordering table is listed hereinafter. The table is divided into ten groups (Group 1-Group 10). In each group, the respective prediction mode for the subblock A is constant (e.g., Mode 0 of the subblock A is constant in Group 2), and the prediction mode for the subblock B varies. That is, the (constant) prediction mode for the subblock A within a group may be combined with one of the nine prediction modes for the subblock B within that group.

For each combination of the prediction modes of the subblocks A and B, a sequence of nine numbers is given, one number for each of the nine Modes 0-9. For example in Group 3, if the prediction modes for the subblock A and the subblock B are both Mode 1, a string “1 6 2 5 3 0 4 8 7” indicates that the Mode 1, i.e., the first number in the string, is the most probable mode for the subblock C. The Mode 6, i.e., the second number in the string, is the next most probable mode. In the exemplary string, the Mode 7 is the least probable since the number 7 is the last number in the string. The string will be part of the stream of bits that represents the encoded video sequence.

›DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT · 4 of 5

The stream of bits therefore includes information (Prob0=1 (see Table 1)) indicating the mode used for the subblock C. For example, the information may indicate that the next most probable intra prediction mode is Mode 6. Note that a “−” in the table indicates that this instance cannot occur. The term “outside” used in the Table 1 indicates “outside the frame.” If the subblock A or B is within the frame, but is not INTRA coded (e.g., in a P frame, the subblock C could be INTRA coded but either the subblock A or the subblock B may not be INTRA coded), there is no prediction mode. The procedure of the present invention assumes the Mode 0 for such subblocks.

The information about the prediction modes may be efficiently coded by combining prediction mode information of two subblocks 38 in one codeword. The stream of bits includes then the resulting codewords, wherein each codeword represents the prediction modes of the two subblocks. Table 2 lists exemplary binary codewords for code numbers (Code No.) between 0 and 80. The probability of a mode of the first subblock is indicated as Prob0 and the probability of a mode of the second subblock is indicated as Prob1.

With the nine prediction modes (Table 1) and the probabilities of the modes (Table 1, Table 2), a mode selection algorithm determines the mode according to which a particular subblock is predicted. In one embodiment of the present invention, the algorithm selects the mode using a sum of absolute differences (SAD) between the pixels a-p and the corresponding pixels in the original frame, and the above probabilities of the modes. The SAD and the probability table are used to select the mode for a particular subblock 38 . The algorithm calculates a parameter uError for each of the nine possible modes Mode 0-8. The mode that provides the smallest uError is the mode selected for the subblock 38 .

The uError is calculated as follows:

uError=SAD ({ a, . . . , p }, { original frame })+ rd — quant[uMBQP]*uProb,

where SAD({a, . . . , p}, {original frame} is the sum of absolute difference between the pixels a-p and the corresponding pixels in the original frame, where rd_quant[uMBQP] is a table of constant values indexed by a quantization parameter uMBQP. uMBQP is given by

const U 8 rd — quant[ 32]={1,1,1,1,1,1,2,2,2,2,3,3,3,4,4,5,5,6,7,7,8,9,11,12,13,15,17,19,21,24,27,30}; and

where uProb is the probability of the mode occurring, provided by the position in the mode probability table (Table 1).

For example, the prediction mode for the subblocks A is the Mode 1 and the prediction mode for the subblock B is the Mode 1. The string “1 6 2 5 3 0 4 8 7” indicates that the Mode 1 is also the most probable mode for the subblock C. The Mode 6 is the second most probable mode, etc. Thus, when the algorithm calculates uError for the Mode 0, the probability uProb is 5. Further, for the Mode 1 the probability uProb is 0, for the Mode 2 the probability uProb is 2, for the Mode 3 the probability uProb is 4, and so forth.

In addition to coding the luminance portion (Y) of the video frame, the video system 1 of the present invention may also predict the chrominance portions (U, V) of the video frame. The chrominance portions may be considered as chrominance planes (U and V-planes). Typically, the chrominance planes (U and V-planes) are a quarter of the size of a luminance plane. Thus, in a 16×16 macroblock a corresponding 8×8 block of pixels exists in both the U and V-planes. These 8×8 blocks are divided into 4×4 blocks. In general, separate prediction modes are not transmitted for chrominace blocks. Instead, the modes transmitted for the Y-plane blocks are used as prediction modes for the U and V-plane blocks.

FIG. 6 illustrates a video device incorporated with the teachings of the present invention, in accordance with one embodiment. As illustrated, video device 600 includes encoder 610 and decoder 620 coupled to the inputs and outputs of the device. As described earlier, encoder 610 is designed to receive video frame data, divide the respective frame data into macroblocks and subblocks, and selectively intracode the subblocks as earlier described. Decoder 620 is designed to receive the intracoded subblocks and recover the video frame data as earlier described.

Encoder 610 and decoder 620 are similarly constituted as the earlier described encoder apparatus 1 and decoder apparatus 5 . In various embodiments, encoder 610 and decoder 620 may share at least in part their constituting tables and coding/decoding logics (as denoted by the intersecting blocks of encoder 610 and decoder 620 ).

In various embodiments, video device 600 may be a wireless mobile phone, a palm sized computing device, such as a personal digital assistant, a laptop computing device, a desktop computing device, a server, and other computing devices of the like. In other embodiments, video device 600 may be a circuit board component, such as a video “add-on” circuit board (also referred to as a daughter circuit board), a motherboard, and other circuit boards of the like.

In yet other embodiments, instead of having both encoder 610 and decoder 620 , video device 600 may include encoder 610 only, as in the case of a video camera, or decoder 620 only, as in the case of a DVD player, a television, a display monitor, or a set-top box.

FIG. 7 illustrates an article of manufacture including a recordable medium 700 having programming instructions implementing a software embodiment of the earlier described encoder apparatus 1 and/or decoder apparatus 5 . The programming instructions are designed for use to program video device 710 to equip video device 710 with the encoding and decoding capabilities of the present invention.

For the embodiment, video device 710 include storage medium 712 to store at least a portion of a working copying of the programming instructions implementing the software embodiment of encoder apparatus 1 and/or decoder 5 , and at least one processor 714 coupled to storage medium 712 to execute the programming instructions.

›DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT · 5 of 5

Video device 712 may be any one of the earlier enumerated example device devices or other video devices of the like. Article 710 may e.g. be a diskette, a compact disk (CD), a DVD or other computer readable medium of the like. In other embodiments, article 710 may be a distribution server distributing encoder apparatus 1 and/or decoder apparatus 5 on line, via private and/or public networks, such as the Internet. In one embodiment, article 710 is a web server.

FIG. 8 illustrates an example system having video sender 802 and video receiver 804 communicatively coupled to each other as shown, with video sender 802 encoding a video in accordance with the teachings of the present invention, and providing the encoded video to video receiver 802 , and video receiver 802 , in turn decoding the encoded video to render the video. Video sender 802 and video receiver 804 are equipped with the earlier described encoder apparatus 1 and decoder apparatus 5 respectively.

An example of video sender 802 is a video server, whereas an example of a video receiver 804 is a client device coupled to video sender 802 .

In various alternate embodiments, encoding for Modes 4 and 6 are streamlined to employ only the pixels of the adjacent subblocks above the subblock being encoded in predicting the pixel values of the subblock being encoded. More specifically, the pixel values of the subblock being encoded are predicted under modes 4 and 6 as follows:

Streamlined Mode 4

a =( A+ 2 *B+C+ 2)/4;

b,e =( B+ 2 *C+D+ 2)/4;

c,f,i =( C+ 2 *D+E+ 2)/4;

d,g,j,m =( D+ 2 *E+F+ 2)/4;

h,k,n =( E+ 2 *F+G+ 2) 4;

l,o =( F+ 2 *G+H+ 2)/4;

p =( G+ 3 *H+ 2)/4;

Streamlined Mode 6

a =( A+B+ 1)/2;

b,i =( B+C+ 1)/2;

c,j =( C+D+ 1)/2;

d,k =( D+E+ 1)/2;

l =( E+F+ 1)/2;

e =( A+ 2 *B+C+ 2)/4;

f,m =( B+ 2 *C+D+ 2)/4;

g,n =( C+ 2 *D+E+ 2)/4;

h,o =( D+ 2 *E+F+ 2)/4;

p =( E+ 2 *F+G+ 2)/4;

Further, encoding for Mode 7 is streamlined to employ only the pixels of the adjacent subblock to the left of the subblock being encoded in predicting the pixel values of the subblock being encoded. More specifically, the pixel values of the subblock being encoded are predicted as follows:

Streamlined Mode 7

a =( I+J+ 1)/2;

b =( I+ 2 *J+K+ 2)/4;

c,e =( J+K+ 1)/2;

d,f =( J+ 2 *K+L+ 2)/4;

g,i =( K+L+ 1)/2;

h,j =( K+ 2 *L+L+ 2)/4;

l,n,k,

m,o,p=L;

In yet other embodiments, a macroblock may be subdivided into M×N subblocks where M×N may be 8×8, 8×4 or 4×8 instead. For the purpose of this portion of the description, as illustrated in FIGS. 9 a - 9 c , a pixel of a M×N subblock shall be referred to as p ij , where the index i denotes a row position of the subblock and may assume a value of 1 through 8 in the cases of 8×8 and 8×4 subblocks or 1 through 4 in the case of 4×8 subblocks, and the index j denotes a column position of the subblock and may likewise assume a value of 1 through 8 in the cases of 8×8 and 4×8 subblocks or 1 through 4 in the case of 8×4 subblocks.

As illustrated, the predictor pixels of the adjacent subblocks above the subblock being encoded are referred to as t 0 through t 15 , and the predictor pixels of the adjacent subblocks to the left of the subblock being encoded are referred to as l 0 through l 15 .

For Modes 0-2, pixel values of a M×N subblock, whether M×N is 8×8, 8×4, or 4×8, are predicted as follows:

Mode 0

Where t 0 -t N and l 0 -l M are available,

P ij =( t 0 + . . . +t N +l 0 +. . . +l M +N/ 2 +M/ 2)/( M+N );

Else if only t 0 -t N are available,

P ij =( t 0 + . . . +t N +N/ 2)/ N;

Else if only l 0 -l M are available,

P ij =( l 0 + . . . +l M +M/ 2)/ M;

Else

P ij =128;

i= 0−( N− 1), j= 0−( M− 1).

Mode 1

Where t 0 -t N are available

P ij =t j ;

i= 0−( N− 1), j= 0−( M− 1).

Mode 2

Where l0−lN are available

Pij=li;

i= 0−( N− 1), j=0−( M− 1).

For Modes 3-8, a pixel value of a M×N subblock is predicted as follows:

Mode 3

Where all t 0 -t N and l 0 -l M are available for prediction

Mode 4

Where all t 0 -t N and l 0 -l N are available for prediction,

Mode 5

Where all t 0 -t N and l 0 -l M are available for prediction, then

Mode 6

Where all t 0 -t N and l 0 -l M are available for prediction

Mode 7

Where all t 0 -t N and l 0 -l M are available for prediction

Mode 8

Where all t 0 -t N and l 0 -l M are available for prediction, then

›CONCLUSION AND EPILOGUE

Thus, it can be seen from the above descriptions, a novel method for intracoding and decoding video frame data, including encoders, decoders, devices and systems incorporated with the method have been described.

While the present invention has been described in terms of the foregoing embodiments and example applications, those skilled in the art will recognize that the invention is not limited to the embodiments and example application described. The present invention can be practiced with modification and alteration within the spirit and scope of the appended claims. In particular, some or all of the present invention (e.g. the various operational logic) may be implemented in Application Specific Integrated Circuits (ASIC).

Thus, the description is to be regarded as illustrative instead of restrictive on the present invention.

›Tables in the description — 16
a, e, i, m =A
b, f, j, n =B
c, g, k, o =C
d, h, l, p =D
a, b, c, d =I
e, f, g, h =J
i, j, k, l =K
m, n, o, p =L
m =(J + 2K + L + 2)/4
i, n =(I + 2J + K + 2)/4
e, j, o =(Q + 2I + J + 2)/4
a, f, k, p =(I + 2Q + A + 2)/4
b, g, l =(Q + 2A + B + 2)/4
c, h =(A + 2B + C + 2)/4
d =(B + 2C + D + 2)/4
a =(A + 2B + C + I + 2J + K + 4)/8
b, e =(B + 2C + D + J + 2K + L + 4)/8
c, f, i =(C + 2D + E + K + 2L + M + 4)/8
d, g, j, m =(D + 2E + F + L + 2M + N + 4)/8
h, k, n =(E + 2F + G + M + 2N + O + 4)/8
l, o =(F + 2G + H + N + 2O + P + 4)/8
p =(G + H + O + P + 2)/4
a, j =(Q + A + 1)/2
b, k =(A + B + 1)/2
c, l =(B + C + 1)/2
d =(C + D + 1)/2
e, n =(I + 2Q + A + 2)/4
f, o =(Q + 2A + B + 2)/4
g, p =(A + 2B + C + 2)/4
h =(B + 2C + D + 2)/4
i =(Q + 2I + J + 2)/4
m =(I + 2J + K + 2)/4
a =(2A + 2B + J + 2K + L + 4)/8
b, i =(B + C + 1)/2
c, j =(C + D + 1)/2
d, k =(D + E + 1)/2
l =(E + F + 1)/2
e =(A + 2B + C + K + 2L + M + 4)/8
f, m =(B + 2C + D + 2)/4
g, n =(C + 2D + E + 2)/4
h, o =(D + 2E + F + 2)/4
p =(E + 2F + G + 2)/4
a =(B + 2C + D + 2I + 2J + 4)/8
b =(C + 2D + E + I + 2J + K + 4)/8
c, e =(D + 2E + F + 2J + 2K + 4)/8
d, f =(E + 2F + G + J + 2K + L + 4)/8
g, i =(F + 2G + H + 2K + 2L + 4)/8
h, j =(G + 3H + K + 2L + M + 4)/8
k, m =(G + H + L + M + 2)/4
l, n =(L + 2M + N + 2)/4
o =(M + N + 1)/2
p =(M + 2N + O + 2)/2
a, g =(Q + I + 1)/2
b, h =(I + 2Q + A + 2)/4
c =(Q + 2A + B + 2)/4
d =(A + 2B + C + 2)/4
e, k =(I + J + 1)/2
f, l =(Q + 2I + J + 2)/4
i, o =(J + K + 1)/2
j, p =(I + 2J + K + 2)/4
m =(K + L + 1)/2
n =(J + 2K + L + 2)/2
TABLE 1
BA = outside
outside0 - - - - - - - -
mode 00 2 - - - - - - -
mode 1- - - - - - - - -
mode 22 0 - - - - - - -
mode 3- - - - - - - - -GROUP 1
mode 4- - - - - - - - -
mode 5- - - - - - - - -
mode 6- - - - - - - - -
mode 7- - - - - - - - -
mode 8- - - - - - - - -
BA = mode 0
outside0 1 - - - - - - -
mode 00 2 1 6 4 8 5 7 3
mode 11 0 2 6 5 4 3 8 7
mode 22 8 0 1 7 4 3 6 5
mode 32 0 1 3 8 5 4 7 6GROUP 2
mode 42 0 1 4 6 7 8 3 5
mode 50 1 5 2 6 3 8 4 7
mode 60 1 6 2 4 7 5 8 3
mode 72 7 0 1 4 8 6 3 5
mode 82 8 0 1 7 3 4 5 6
BA = mode 1
outside1 0 - - - - - - -
mode 01 2 5 6 3 0 4 8 7
mode 11 6 2 5 3 0 4 8 7
mode 22 1 7 6 8 3 5 0 4
mode 31 2 5 3 6 8 4 7 0GROUP 3
mode 41 6 2 0 4 5 8 7 3
mode 51 5 2 6 3 8 4 0 7
mode 61 6 0 2 4 5 7 3 8
mode 72 1 7 6 0 8 5 4 3
mode 81 2 7 8 3 4 5 6 0
BA = mode 2
outside- - - - - - - - -
mode 00 2 1 8 7 6 5 4 3
mode 11 2 0 6 5 7 4 8 3
mode 22 8 7 1 0 6 4 3 5
mode 32 0 8 1 3 7 5 4 6GROUP 4
mode 42 0 4 1 7 8 6 3 5
mode 52 0 1 5 8 4 6 7 3
mode 62 0 6 1 4 7 8 5 3
mode 72 7 8 1 0 5 4 6 3
mode 82 8 7 1 0 4 3 6 5
BA = mode 3
outside- - - - - - - - -
mode 00 2 1 3 5 8 6 4 7
mode 11 0 2 5 3 6 4 8 7
mode 22 8 1 0 3 5 7 6 4
mode 33 2 5 8 1 4 6 7 0GROUP 5
mode 44 2 0 6 1 5 8 3 7
mode 55 3 1 2 8 6 4 0 7
mode 61 6 0 2 4 5 8 3 7
mode 72 7 0 1 5 4 8 6 3
mode 82 8 3 5 1 0 7 6 4
BA = mode 4
outside- - - - - - - - -
mode 02 0 6 1 4 7 5 8 3
mode 11 6 2 0 4 5 3 7 8
mode 22 8 7 6 4 0 1 5 3
mode 34 2 1 0 6 8 3 5 7GROUP 6
mode 44 2 6 0 1 5 7 8 3
mode 51 2 5 0 6 3 4 7 8
mode 66 4 0 1 2 7 5 3 8
mode 72 7 4 6 0 1 8 5 3
mode 82 8 7 4 6 1 3 5 0
BA = mode 5
outside- - - - - - - - -
mode 05 1 2 3 6 8 0 4 7
mode 11 5 6 3 2 0 4 8 7
mode 22 1 5 3 6 8 7 4 0
mode 35 3 1 2 6 8 4 7 0GROUP 7
mode 41 6 2 4 5 8 0 3 7
mode 55 1 3 6 2 0 8 4 7
mode 61 6 5 2 0 4 3 7 8
mode 72 7 1 6 5 0 8 3 4
mode 82 5 1 3 6 8 4 0 7
BA = mode 6
outside- - - - - - - - -
mode 01 6 2 0 5 4 3 7 8
mode 11 6 5 4 2 3 0 7 8
mode 22 1 6 7 4 8 5 3 0
mode 32 1 6 5 8 4 3 0 7GROUP 8
mode 46 4 1 2 0 5 7 8 3
mode 51 6 5 2 3 0 4 8 7
mode 66 1 4 0 2 7 5 3 8
mode 72 7 4 6 1 5 0 8 3
mode 82 1 6 8 4 7 3 5 0
BA = mode 7
outside- - - - - - - - -
mode 02 0 4 7 6 1 8 5 3
mode 16 1 2 0 4 7 5 8 3
mode 22 7 8 0 1 6 4 3 5
mode 32 4 0 8 3 1 7 6 5GROUP 9
mode 44 2 7 0 6 1 8 5 3
mode 52 1 0 8 5 6 7 4 3
mode 62 6 4 1 7 0 5 8 3
mode 72 7 4 0 8 6 1 5 3
mode 82 8 7 4 1 0 3 6 5
BA = mode 8
outside- - - - - - - - -
mode 02 0 8 1 3 4 6 5 7
mode 11 2 0 6 8 5 7 3 4
mode 22 8 7 1 0 3 6 5 4
mode 38 3 2 5 1 0 4 7 6GROUP 10
mode 42 0 4 8 5 1 7 6 3
mode 52 1 0 8 5 3 6 4 7
mode 62 1 6 0 8 4 5 7 3
mode 72 7 8 4 0 6 1 5 3
mode 82 8 3 0 7 4 1 6 5
TABLE 2
Code No.Prob0Prob1Codeword
0001
101001
210011
31100001
40200011
52001001
60301011
7300000001
8120000011
9210001001
10040001011
11400100001
12310100011
13130101001
14050101011
1550000000001
1622000000011
1714000001001
1841000001011
1906000100001
2032000100011
2115000101001
2223000101011
2351010000001
2460010000011
2507010001001
2642010001011
2724010100001
2833010100011
2961010101001
3016010101011
317000000000001
320800000000011
335200000001001
344300000001011
352500000100001
363400000100011
371700000101001
384400000101011
397100010000001
408000010000011
416200010001001
423500010001011
435300010100001
442600010100011
451800010101001
462700010101011
477201000000001
488101000000011
495401000001001
504501000001011
513601000100001
526301000100011
538201000101001
544601000101011
555501010000001
566401010000011
572801010001001
587301010001011
593701010100001
606501010100011
615601010101001
627401010101011
63470000000000001
64830000000000011
65380000000001001
66750000000001011
67840000000100001
68570000000100011
69480000000101001
70660000000101011
71760000010000001
72580000010000011
73850000010001001
74670000010001011
75860000010100001
76770000010100011
77680000010101001
78870000010101011
79780001000000001
80880001000000011
4 × 8 subblock8 × 4 subblock8 × 8 subblockpredicted by
—p 07p 07(t 5 + t 6 << 1 + t 7 + 2) >> 2
—p 06 , p 17p 06 , p 17(t 4 + t 5 << 1 + t 6 + 2) >> 2
—p 05 , p 16 , p 27p 05 , p 16 , p 27(t 3 + t 4 << 1 + t 5 + 2) >> 2
—p 04 , p 15 , p 26 , p 37p 04 , p 15 , p 26 , p 37(t 2 + t 3 << 1 + t 4 + 2) >> 2
p 03p 03 , p 14 , p 25 , p 36p 03 , p 14 , p 25 , p 36 , p 47(t 1 + t 2 << 1 + t 3 + 2) >> 2
p 02 , p 13p 02 , p 13 , p 24 , p 35p 02 , p 13 , p 24 , p 35 , p 46 ,(t 0 + t 1 << 1 + t 2 + 2) >> 2
p 57
p 01 , p 12 , p 23p 01 , p 12 , p 23 , p 34p 01 , p 12 , p 23 , p 34 , ,(q + t 0 << 1 + t 1 + 2) >> 2
p 45 , p 56 , p 67
p 00 , p 11 , p 22 , p 33p 00 , p 11 , p 22 , p 33p 00 , p 11 , p 22 , p 33 ,(l 0 + q << 1 + t 0 + 2) >> 2
p 44 , p 55 , p 66 , p 77
p 10 , p 21 , p 32 , p 43p 10 , p 21 , p 32p 10 , p 21 , p 32 , , p 43 ,(l 1 + l 0 << 1 + q + 2) >> 2
p 54 , p 65 , p 76
p 20 , p 31 , p 42 , p 53p 20 , p 31p 20 , p 31 , p 42 , p 53 ,(l 2 + l 1 << 1 + l 0 + 2) >> 2
p 64 , p 75
p 30 , p 41 , p 52 , p 63p 30p 30 , p 41 , p 52 , p 63 , p 74(l 3 + l 2 << 1 + l 1 + 2) >> 2
p 40 , p 51 , p 62 , p 73—p 40 , p 51 , p 62 , p 73(l 4 + l 3 << 1 + l 2 + 2) >> 2
p 50 , p 61 , p 72—p 50 , p 61 , p 72(l 5 + l 4 << 1 + l 3 + 2) >> 2
p 60 , p 71—p 60 , p 71(l 6 + l 5 << 1 + l 4 + 2) >> 2
p 70—p 70(l 7 + l 6 << 1 + l 5 + 2) >> 2
4 × 8 subblock8 × 4 subblock8 × 8 subblockpredicted by
p 00p 00p 00(t 2 + t 1 << 1 + t 0 + 2) >> 2
p 01 , p 10p 01 , p 10p 01 , p 10(t 3 + t 2 << 1 + t 1 + 2) >> 2
p 02 , p 11 , p 20p 02 , p 11 , p 20p 02 , p 11 , p 20(t 4 + t 3 << 1 + t 2 + 2) >> 2
p 03 , p 12 , p 21 , p 30p 03 , p 12 , p 21 , p 30p 03 , p 12 , p 21 , p 30(t 5 + t 4 << 1 + t 3 + 2) >> 2
p 13 , p 22 , p 31 , p 40p 04 , p 13 , p 22 , p 31p 04 , p 13 , p 22 , p 31 , p 40(t 6 + t 5 << 1 + t 4 + 2) >> 2
p 23 , p 32 , p 42 , p 50p 05 , p 14 , p 23 , p 32p 05 , p 14 , p 23 , p 32 , p 41 , p 50(t 7 + t 6 << 1 + t 5 + 2) >> 2
p 33 , p 42 , p 51 , p 60p 06 , p 15 , p 24 , p 33p 06 , p 15 , p 24 , p 33 , p 42 , p 51 ,(t 8 + t 7 << 1 + t 6 + 2) >> 2
p 60
p 43 , p 52 , p 61 , p 70p 07 , p 16 , p 25 , p 34p 07 , p 16 , p 25 , p 34 , p 43 , p 52 ,(t 9 + t 8 << 1 + t 7 + 2) >> 2
p 61 , p 70
p 53 , p 62 , p 71p 17 , p 26 , p 35p 17 , p 26 , p 35 , , p 44 , p 53 ,(t 10 + t 9 << 1 + t 8 + 2) >> 2
p 62 , p 71
p 63 , p 72p 27 , p 36p 27 , p 36 , p 45 , p 54 , p 63 , p 72(t 11 + t 10 << 1 + t 9 + 2) >> 2
p 73p 37p 37 , p 46 , p 55 , p 64 , p 73(t 12 + t 11 << 1 + t 10 + 2) >> 2
——p 47 , p 56 , p 65 , p 74(t 13 + t 12 << 1 + t 11 + 2) >> 2
——p 57 , p 66 , p 75(t 14 + t 13 << 1 + t 12 + 2) >> 2
——p 67 , p 76(t 15 + t 14 << 1 + t 13 + 2) >> 2
——p 77(t 15 + t 15 << 1 + t 14 + 2) >> 2
4 × 88 × 4
subblocksubblock8 × 8 subblockpredicted by
—p 07p 07(t 6 + t 7 + 1) >> 1
—p 17p 17(t 5 + t 6 << 1 + t 7 + 2) >> 2
—p 06 , p 27p 06 , p 27(t 5 + t 6 + 1) >> 1
—p 16 , p 37p 16 , p 37(t 4 + t 5 << 1 + t 6 + 2) >> 2
—p 05 , p 25p 05 , p 26 , p 47(t 4 + t 5 + 1) >> 1
—p 15 , p 36p 15 , p 36 , p 57(t 3 + t 4 << 1 + t 5 + 2) >> 2
—p 04 , p 25p 04 , p 25 , p 46 , p 67(t 3 + t 4 + 1) >> 1
—p 14 , p 35p 14 , p 35 , p 56 , p 77(t 2 + t 3 << 1 + t 4 + 2) >> 2
p 03p 03 , p 24p 03 , p 24 , p 45 , p 66(t 2 + t 3 + 1) >> 1
p 13p 13 , p 34p 13 , p 34 , p 55 , p 76(t 1 + t 2 << 1 + t 3 + 2) >> 2
p 02 , p 23p 02 , p 23p 02 , p 23 , p 44 , p 65(t 1 + t 2 + 1) >> 1
p 12 , p 33p 12 , p 33p 12 , p 33 , p 54 , p 75(t 0 + t 1 << 1 + t 2 + 2) >> 2
p 01 , p 22 , p 43p 01 , p 22p 01 , p 22 , p 43 , p 64(t 0 + t 1 + 1) >> 1
p 11 , p 32 , p 53p 11 , p 32p 11 , p 32 , p 53 , p 74(q + t 0 << 1 + t 1 + 2) >> 2
p 00 , p 21 , p 42 ,p 00 , p 21p 00 , p 21 , p 42 , p 63(q + t 0 + 1) >> 1
p 63
p 10 , p 31 , p 52 ,p 10 , p 31p 10 , p 31 , p 52 , p 73(l 0 + q << 1 + t 0 + 2) >> 2
p 73
p 20 , p 41 , p 62p 20p 20 , p 41 , p 62(l 1 + l 0 << 1 + q + 2) >> 2
p 30 , p 51 , p 72p 30p 30 , p 51 , p 72(l 2 + l 1 << 1 + l 0 + 2) >> 2
p 40 , p 61—p 40 , p 61(l 3 + l 2 << 1 + l 1 + 2) >> 2
p 50 , p 71—p 50 , p 71(l 4 + l 3 << 1 + l 2 + 2) >> 2
p 60—p 60(l 5 + l 4 << 1 + l 3 + 2) >> 2
p 70—p 70(l 6 + l 5 << 1 + l 4 + 2) >> 2
8 × 4
4 × 8sub-
subblockblock8 × 8 subblockpredicted by
p 00p 00p 00(t 0 + t 1 + 1) >> 1
p 10p 10p 10(t 0 + t 1 << 1 + t 2 + 2) >> 2
p 01 , p 20p 01 , p 20p 01 , p 20(t 1 + t 2 + 1) >> 1
p 11 , p 30p 11 , p 30p 11 , p 30(t 1 + t 2 << 1 + t 3 + 2) >> 2
p 02 , p 21 , p 40p 02 , p 21p 02 , p 21 , p 40(t 2 + t 3 + 1) >> 1
p 12 , p 31 , p 50p 12 , p 31p 12 , p 31 , p 50(t 2 + t 3 << 1 + t 4 + 2) >> 2
p 03 , p 22 , p 41 ,p 03 , p 22p 03 , p 22 , p 41 , p 60(t 3 + t 4 + 1) >> 1
p 60
p 13 , p 32 , p 51 ,p 13 , p 32p 13 , p 32 , p 51 , p 70(t 3 + t 4 << 1 + t 5 + 2) >> 2
p 70
p 23 , p 42 , p 61p 04 , p 23p 04 , p 23 , p 42 , p 61(t 4 + t 5 + 1) >> 1
p 33 , p 52 , p 71p 14 , p 33p 14 , p 33 , p 52 , p 71(t 4 + t 5 << 1 + t 6 + 2) >> 2
p 43 , p 62p 05 , p 24p 05 , p 24 , p 43 , p 62(t 5 + t 6 + 1) >> 1
p 53 , p 72p 15 , p 34p 15 , p 34 , p 53 , p 72(t 5 + t 6 << 1 + t 7 + 2) >> 2
p 63p 06 , p 25p 06 , p 25 , p 44 , p 63(t 6 + t 7 + 1) >> 1
p 73p 16 , p 35p 16 , p 35 , p 54 , p 73(t 6 + t 7 << 1 + t 8 + 2) >> 2
—p 07 , p 26p 07 , p 26 , p 45 , p 64(t 7 + t 8 + 1) >> 1
—p 17 , p 36p 17 , p 36 , p 55 , p 74(t 7 + t 8 << 1 + t 9 + 2) >> 2
—p 27p 27 , p 46 , p 65(t 8 + t 9 + 1) >> 1
—p 37p 37 , p 56 , p 75(t 8 + t 9 << 1 + t 10 + 2) >> 2
——p 47 , p 66(t 9 + t 10 + 1) >> 1
——p 57 , p 76(t 9 + t 10 << 1 + t 11 + 2) >> 2
——p 67(t 10 + t 11 + 1) >> 1
——p 77(t 10 + t 11 << 1 + t 12 + 2) >> 2
4 × 88 × 4
subblocksubblock8 × 8 subblockpredicted by
p 00p 00p 00(l 0 + l 1 + 1) >> 1
p 01p 01p 01(l 0 + l 1 << 1 + l 2 + 2) >> 2
p 10 , p 02p 10 , p 02p 10 , p 02(l 1 + l 2 + 1) >> 1
p 11 , p 03p 11 , p 03p 11 , p 03(l 1 + l 2 << 1 + l 3 + 2) >> 2
p 20 , p 12p 20 , p 12 , p 04p 20 , p 12 , p 04(l 2 + l 3 + 1) >> 1
p 21 , p 13p 21 , p 13 , p 05p 21 , p 13 , p 05(l 2 + l 3 << 1 + l 4 + 2) >> 2
p 30 , p 22p 30 , p 22 , p 14 ,p 30 , p 22 , p 14 , p 06(l 3 + l 4 + 1) >> 1
p 06
p 31 , p 23p 31 , p 23 , p 15 ,p 31 , p 23 , p 15 , p 07(l 3 + l 4 << 1 + l 5 + 2) >> 2
p 07
p 40 , p 32p 32 , p 24 , p 16p 40 , p 32 , p 24 , p 16(l 4 + l 5 + 1) >> 1
p 41 , p 33p 33 , p 25 , p 17p 41 , p 33 , p 25 , p 17(l 4 + l 5 << 1 + l 6 + 2) >> 2
p 50 , p 42p 34 , p 26p 50 , p 42 , p 34 , p 26(l 5 + l 6 + 1) >> 1
p 51 , p 43p 35 , p 27p 51 , p 43 , p 35 , p 27(l 5 + l 6 << 1 + l 7 + 2) >> 2
p 60 , p 52p 36p 60 , p 52 , p 44 , p 36(l 6 + l 7 + 1) >> 1
p 61 , p 53p 37p 61 , p 53 , p 45 , p 37(l 6 + l 7 << 1 + l 7 + 2) >> 2
p 70 , p 62 ,—p 70 , p 71 , p 72 , p 73 ,l 7
p 71 , p 63 ,p 74 , p 75 , p 76 , p 77 ,
p 72 , p 73p 62 , p 63 , p 64 , p 65 ,
p 66 , p 67 , p 54 , p 55 ,
p 56 , p 57 , p 46 , p 47
4 × 88 × 4
subblocksubblock8 × 8 subblockpredicted by
—p 07p 07(t 4 + t 5 << 1 + t 6 + 2) >> 2
—p 06p 06(t 3 + t 4 << 1 + t 5 + 2) >> 2
—p 05 , p 17p 05 , p 17(t 2 + t 3 << 1 + t 4 + 2) >> 2
—p 04 , p 16p 04 , p 16(t 1 + t 2 << 1 + t 3 + 2) >> 2
p 03p 03 , p 15 , p 27p 03 , p 15 , p 27(t 0 + t 1 << 1 + t 2 + 2) >> 2
p 02p 02 , p 14 , p 26p 02 , p 14 , p 26(q + t 0 << 1 + t 1 + 2) >> 2
p 01 , p 13p 01 , p 13 , p 25 ,p 01 , p 13 , p 25 , p 37(l 0 + q << 1 + t 0 + 2) >> 2
p 37
p 00 , p 12p 00 , p 12 , p 24 ,p 00 , p 12 , p 24 , p 36(q + l 0 + 1) >> 1
p 36
p 10 , p 22p 10 , p 22 , p 34p 10 , p 22 , p 34 , p 46(l 0 + l 1 + 1) >> 1
p 11 , p 23p 11 , p 23 , p 35p 11 , p 23 , p 35 , p 47(q + l 0 << 1 + l 1 + 2) >> 2
p 20 , p 32p 20 , p 32p 20 , p 32 , p 44 , p 56(l 1 + l 2 + 1) >> 1
p 21 , p 33p 21 , p 33p 21 , p 33 , p 45 , p 57(l 0 + l 1 << 1 + l 2 + 2) >> 2
p 30 , p 42p 30p 30 , p 42 , p 54 , p 65(l 2 + l 3 + 1) >> 1
p 31 , p 43p 31p 31 , p 43 , p 55 , p 67(l 1 + l 2 << 1 + l 3 + 2) >> 2
p 40 , p 52—p 40 , p 52 , p 64 , p 76(l 3 + l 4 + 1) >> 1
p 41 , p 53—p 41 , p 53 , p 65 , p 77(l 2 + l 3 << 1 + l 4 + 2) >> 2
p 50 , p 62—p 50 , p 62 , p 74(l 4 + l 5 + 1) >> 1
p 51 , p 63—p 51 , p 63 , p 75(l 3 + l 4 << 1 + l 5 + 2) >> 2
p 60 , p 72—p 60 , p 72(l 5 + l 6 + 1) >> 1
p 61 , p 73—p 61 , p 73(l 4 + l 5 << 1 + l 6 + 2) >> 2
p 70—p 70(l 6 + l 7 + 1) >> 1
p 71—p 71(l 5 + l 6 << 1 + l 7 + 2) >> 2

Claims as granted

14 claims

Log in to read the claims of this application.

Log in to unlock

Classifications

12 codes
IPC · International Patent Classification
Section G — Physics
  • G11B20/10
  • G06T9/00
Section H — Electricity
  • H04N19/593
  • H04N5/92
  • H04N7/32
  • H04N7/12
  • H04N11/02
  • H03M7/36
  • H04N11/04
USPC · US Patent Classification
375/240.24375/240.25375/240.13

Claim changes

Soon
Coming soonHow the claims changed between publication and grant

See which claims were amended, added or cancelled during examination, with every added and removed word marked.

AmendedAddedCancelledUnchanged

The published claims of this application are not paired with the granted ones in what we hold.

File wrapper

⤢ drag to zoom2004200520062007200820092010USPTOApplicantNotice of allowance
USPTOApplicanthover for detail · click to open
Pendency
6.4 y
2,322 days filing → grant
Office actions
0
none on record
Responses
0
1 RCE
Examiner
David Czekaj
art unit 2621 · TC 2600
Citations: 7 back · 39 forward

See the full prosecution history — every USPTO and applicant action on this file, in order.

Log in to unlock

Documents

Log in to open the documents of this file: the application as filed, every office action and response, the notice of allowance.

Log in to unlock

Chain of title

⤢ drag to zoom201220142016201820202022Owner 3
Titlehover for detail · click to open

See the full assignment history — every owner this patent has passed through, with recordation dates and reel/frame numbers.

Log in to unlock