Methods and systems for intra prediction

[0001] Embodiments of the present invention relate generally to encoding and decoding of video data and, in particular, to methods and systems for intra prediction.

[0002] State-of-the-art video-coding standards, for example, H.264/AVC and other video-coding standards, may provide higher coding efficiency at the expense of higher computational complexity, which may result in slower encoding and/or decoding speeds. Additionally, computational complexity may increase with increasing quality and resolution requirements. Parallel decoding and parallel encoding may improve decoding and encoding speeds, respectively. Additionally, parallel decoding and parallel encoding may reduce memory bandwidth requirements for decoding and encoding processes, respectively. Furthermore, with advances in multi-core processors, parallel decoding and parallel encoding may be desirable in order to fully use the power of a multi-core processor.

[0003] Some embodiments of the present invention comprise methods and systems for intra prediction.

[0004] According to a first aspect of the present invention, a macroblock may be partitioned into two, or more, sets of blocks. A set of blocks may be referred to as a plurality of blocks or a group of blocks. The sets of blocks may be referred to as a partition of the macroblock.

[0005] According to a second aspect of the present invention, for a block in a first set of blocks, pixel values may be predicted using reconstructed pixel values from only one or more neighboring macroblocks. The pixel values within a block in another set of blocks may be subsequently predicted using reconstructed pixel values from blocks in previously reconstructed sets of blocks, in the partition of the macroblock, and/or reconstructed pixel values in neighboring macroblocks.

[0006] According to a third aspect of the present invention, the blocks within a set of blocks, in the partition of the macroblock, may be encoded in parallel.

[0007] According to a fourth aspect of the present invention, the blocks within a set of blocks, in the partition of the macroblock, may be decoded in parallel.

[0008] The foregoing and other objectives, features, and advantages of the invention will be more readily understood upon consideration of the following detailed description of the invention taken in conjunction with the accompanying drawings.

[0046] Embodiments of the present invention will be best understood by reference to the drawings, wherein like parts are designated by like numerals throughout. The figures listed above are expressly incorporated as part of this detailed description.

[0047] It will be readily understood that the components of the present invention, as generally described and illustrated in the figures herein, could be arranged and designed in a wide variety of different configurations. Thus, the following more detailed description of the embodiments of the methods and systems of the present invention is not intended to limit the scope of the invention but it is merely representative of the presently preferred embodiments of the invention.

[0048] Elements of embodiments of the present invention may be embodied in hardware, firmware and/or software. While exemplary embodiments revealed herein may only describe one of these forms, it is to be understood that one skilled in the art would be able to effectuate these elements in any of these forms while resting within the scope of the present invention.

[0049] State-of-the-art video-coding standards, for example, H.264/AVC and other video-coding standards, may provide higher coding efficiency at the expense of higher computational complexity, which may result in slower encoding and/or decoding speeds. Additionally, computational complexity may increase with increasing quality and resolution requirements. Parallel decoding and parallel encoding may improve decoding and encoding speeds, respectively. Additionally, parallel decoding and parallel encoding may reduce memory bandwidth requirements for decoding and encoding processes, respectively. Furthermore, with advances in multi-core processors, parallel decoding and parallel encoding may be desirable in order to fully use the power of a multi-core processor.

[0050] Intra prediction may be an important contributing factor in video-coding inefficiency. Many state-of-the-art video codecs (coder/decoders) use intra prediction to reduce spatial redundancy. In the encoder and the decoder, intra prediction may use reconstructed neighboring blocks to predict a current block. Thus, the encoder need signal only the prediction mode and the prediction residual. However, the dependency on reconstructed neighboring blocks prevents intra prediction from being parallelized. The serial dependency may be more problematic for the intra-prediction modes of smaller block sizes. Many video codecs organize blocks of pixels into larger blocks referred to as macroblocks. For example, if a 16×16 macroblock uses intra 8×8 prediction, then the four 8×8 blocks which make up the macroblock must be processed sequentially. However, if a 16×16 macroblock uses intra 4×4 prediction, then the sixteen 4×4 blocks must be processed sequentially. The serial design of current intra-prediction schemes may result in unbalanced loads when processing macroblocks associated with different prediction modes, for example, intra 4×4 decoding, intra 8×8 decoding and intra 16×16 may take different decoding cycles. Further, if all macroblocks are intra 4×4 coded, all blocks must be processed sequentially.

[0051] Some embodiments of the present invention comprise methods and systems for intra prediction that allow parallel implementation with negligible impact on coding efficiency.

[0052] Some embodiments of the present invention may be described herein in relation to luminance-channel signals. This is for purposes of illustration and not limitation. As readily appreciated by a person having ordinary skill in the art, embodiments of the present invention, described herein in relation to luminance-channel signals, may be used in conjunction with chrominance-channel, disparity-channel and other signal sources.

[0053] Embodiments of the present invention may relate to a video device. Exemplary video devices may include a video encoder, a video decoder, a video transcoder and other video devices.

[0054] Some embodiments of the present invention may be described in relation to H.264/AVC. The following section provides a brief introduction to intra prediction in H.264/AVC.

Introduction to Intra Prediction in H.264/AVC

[0055] Intra prediction exploits spatial relationships within a frame, or an image. At an encoder, a current block may be predicted from neighboring previously encoded blocks, also considered reconstructed blocks, located above and/or to the left of the current block, and the prediction mode and the prediction residual may be coded for the block. At a decoder, a current block may be predicted, according to a prediction mode, from neighboring reconstructed blocks located above and/or to the left of the current block, and the decoded prediction residual for the block may be added to the prediction to obtain the block signal values. There are three types of intra luma prediction, for example, defined in H.264/AVC: intra 4×4, intra 8×8 and intra 16×16 prediction. Larger block sizes also may be desirable.

[0056] In a 16×16 macroblock, there are four 8×8 blocks or sixteen 4×4 blocks. FIG. 1 depicts the processing order for intra 8×8 2 prediction and intra 4×4 4 prediction for H.264/AVC, and other coding standards. This processing order may be referred to as a zig-zag processing order. In these standards, a current block may be predicted using previously reconstructed neighboring blocks. Thus, the processing of previous blocks in the scan order must be completed before a current block may be processed. Intra 4×4 prediction has more serial dependency compared to intra 8×8 and 16×16 prediction. This serial dependency may cause an increase of operating cycles, a slowdown of intra prediction, an uneven throughput of different intra-prediction types and other undesirable processing characteristics.

[0057] In H.264/AVC, intra 4×4 prediction and intra 8×8 prediction have nine prediction modes 10 as shown in FIG. 2. Pixel values in a current block may be predicted from pixel values in a reconstructed upper and/or left neighboring block(s) relative to the current block. The direction of the arrow depicting a mode indicates the prediction direction for the mode. In FIG. 2, the center point 11 does not represent a direction so this point may be associated with a DC prediction mode, also referred to as “mode 2.” A horizontal arrow 12 extending to the right from the center point 11 may represent a horizontal prediction mode, also referred to as “mode 1.” A vertical arrow 13 extending down from the center point 11 may represent a vertical prediction mode, also referred to as “mode 0.” An arrow 14 extending from the center point 11 diagonally downward to the right at approximately a 45 degree angle from horizontal may represent a diagonal down-right (DDR) prediction mode, also referred to as “mode 4.” An arrow 15 extending from the center point 11 diagonally downward to the left at approximately a 45 degree angle from horizontal may represent a diagonal down-left (DDL) prediction mode, also referred to as “mode 3.” Both the DDR and DDL prediction modes may be referred to as diagonal prediction modes. An arrow 16 extending from the center point 11 diagonally upward to the right at approximately a 22.5 degree angle from horizontal may represent a horizontal up (HU) prediction mode, also referred to as “mode 8.” An arrow 17 extending from the center point 11 diagonally downward to the right at approximately a 22.5 degree angle from horizontal may represent a horizontal down (HD) prediction mode, also referred to as “mode 6.” An arrow 18 extending from the center point 11 diagonally downward to the right at approximately a 67.5 degree angle from horizontal may represent a vertical right (VR) prediction mode, also referred to as “mode 5.” An arrow 19 extending from the center point 11 diagonally downward to the left at approximately a 67.5 degree angle from horizontal may represent a vertical left (VL) prediction mode, also referred to as “mode 7.” The HU, HD, VR and VL prediction modes may be referred to collectively as intermediate-angle prediction modes.

[0058] FIG. 3A shows an exemplary 4×4 block 20 of samples, labeled a-p, that may be predicted from reconstructed, neighboring samples, labeled A-M. When samples E-H are not available, in some implementations of the standard, the unavailable samples may be replaced by sample D. In alternative implementations, unavailable samples may be replaced with a fixed, default value, which may be related to the bit depth of the data. For example, for 8-bit data, the default value may be 128, for 10-bit data, the default value may be 512 and, in general, the default value may be 2^b-1 where b is the bit depth of the image data. Alternative implementations may use other values, as defined by the specification of the standard, to replace unavailable samples.

[0059] Intra-prediction mode 0 (prediction-mode direction indicated as 13 in FIG. 2) may be referred to as vertical-mode intra prediction. In mode 0, or vertical-mode intra prediction, the samples of a current block may be predicted in the vertical direction from the reconstructed samples in the block above the current block. FIG. 3B illustrates an exemplary vertical-mode intra prediction 21 of the samples in a 4×4 block. In FIG. 3B, the samples labeled a-p in FIG. 3A are shown replaced with the label of the sample label from FIG. 3A from which they are predicted.

[0060] Intra-prediction mode 1 (prediction-mode direction indicated as 12 in FIG. 2) may be referred to as horizontal-mode intra prediction. In mode 1, or horizontal-mode intra prediction, the samples of a block may be predicted in the horizontal direction from the reconstructed samples in the block to the left of the current block. FIG. 3C illustrates an exemplary horizontal prediction 22 of the samples in a 4×4 block. In FIG. 3C, the samples labeled a-p in FIG. 3A are shown replaced with the label of the sample label from FIG. 3A from which they are predicted.

[0061] Intra-prediction mode 3 (prediction-mode direction indicated as 15 in FIG. 2) may be referred to as diagonal-down-left-mode intra prediction. In mode 3, the samples of a block 23 may be predicted from neighboring blocks in the direction shown in FIG. 3D.

[0062] Intra-prediction mode 4 (prediction-mode direction indicated as 14 in FIG. 2) may be referred to as diagonal-down-right-mode intra prediction. In mode 4, the samples of a block 24 may be predicted from neighboring blocks in the direction shown in FIG. 3E.

[0063] Intra-prediction mode 5 (prediction-mode direction indicated as 18 in FIG. 2) may be referred to as vertical-right-mode intra prediction. In mode 5, the samples of a block 25 may be predicted from neighboring blocks in the direction shown in FIG. 3F.

[0064] Intra-prediction mode 6 (prediction-mode direction indicated as 17 in FIG. 2) may be referred to as horizontal-down-mode intra prediction. In mode 6, the samples of a block 26 may be predicted from neighboring blocks in the direction shown in FIG. 3G.

[0065] Intra-prediction mode 7 (prediction-mode direction indicated as 19 in FIG. 2) may be referred to as vertical-left-mode intra prediction. In mode 7, the samples of a block 27 may be predicted from neighboring blocks in the direction shown in FIG. 3H.

[0066] Intra-prediction mode 8 (prediction-mode direction indicated as 16 in FIG. 2) may be referred to as horizontal-up-mode intra prediction. In mode 8, the samples of a block 28 may be predicted from neighboring blocks in the direction shown in FIG. 3I.

[0067] In intra-prediction mode 2, which may be referred to as DC mode, all samples labeled a-p in FIG. 3A may be replaced with the average of samples labeled A-D and I-L in FIG. 3A.

[0068] The nine intra-prediction modes described above correspond to the nine intra-prediction modes for luminance samples in the 4×4 sub-blocks of a 16×16 macroblock in H.264/AVC.

[0069] H.264/AVC also supports four 16×16 luma intra prediction modes in which the 16×16 samples of the macroblock are extrapolated from the upper and/or left-hand encoded and reconstructed samples adjacent to the macroblock. The samples may be extrapolated vertically, mode 0 (similar to mode 0 for the 4×4 size block), or the samples may be extrapolated horizontally, mode 1 (similar to mode 1 for the 4×4 size block). The samples may be replaced by the mean, mode 2 (similar to the DC mode for the 4×4 size block), or a mode 3, referred to as plane mode, may be used in which a linear plane function is fitted to the upper and left-hand samples. This concludes the brief introduction to H.264/AVC intra prediction.

[0070] In some embodiments of the present invention, the blocks within a macroblock may be partitioned into a first plurality of blocks, also considered a first group of blocks or a first set of blocks, and a second plurality of blocks, also considered a second group of blocks or a second set of blocks, in order to break the serial dependency, among blocks, of intra prediction. A block may be an m×n size block of pixels. In some of these embodiments, the blocks within the first plurality of blocks may be encoded using reconstructed pixel values from only one or more previously encoded neighboring macroblocks, and then the blocks within the second plurality of blocks may be encoded using the reconstructed pixel values from previously encoded blocks associated with the first plurality of blocks and/or neighboring macroblocks.

[0071] Correspondingly, in some embodiments of the present invention, the blocks within the first plurality of blocks may be decoded using reconstructed pixel values from only neighboring macroblocks, and then the blocks within the second plurality of blocks may be decoded using the reconstructed pixel values from reconstructed blocks associated with the first plurality of blocks and/or neighboring macroblocks.

[0072] Blocks within the first plurality of blocks may be encoded, fully or partially, in parallel, and blocks within the second plurality of blocks may be encoded, fully or partially, in parallel. Blocks within the first plurality of blocks may be decoded, fully or partially, in parallel, and blocks within the second plurality of blocks may be decoded, fully or partially, in parallel.

[0073] In some embodiments of the present invention, all of the blocks within a macroblock may be encoded using reconstructed pixel values from only one or more previously encoded neighboring macroblocks. Thus, the blocks within the macroblock may be encoded, fully or partially, in parallel.

[0074] Correspondingly, in some embodiments of the present invention, all of the blocks within a macroblock may be decoded using reconstructed pixel values from only one or more neighboring macroblocks. Thus, the blocks within the macroblock may be decoded, fully or partially, in parallel.

[0075] For a macroblock with N blocks, the degree of parallelism may be N/2. For example, the speed up for 4×4 intra prediction for a 16×16 macroblock may be close to a factor of eight.

[0076] One exemplary partition 40, for

[0077] $\frac{M}{4}\times \frac{N}{4}$
intra prediction of an M×N macroblock, is shown in FIG. 4. In some embodiments, M and N may be equal. In other embodiments, M and N may be unequal. In this exemplary partition, the sixteen blocks 41-56 may be grouped into two sets of eight blocks each according to a checker-board pattern. The eight blocks in one set are shown in white 41, 44, 45, 48, 49, 52, 53, 56, and the eight blocks in the other set are shown in cross-hatch 42, 43, 46, 47, 50, 51, 54, 55. One set of blocks may be decoded, or encoded, in parallel first using previously reconstructed macroblocks, and then the second set of blocks may be decoded, or encoded, in parallel using the reconstructed blocks associated with the first set and/or previously reconstructed macroblocks. Either set may be the first set in the processing order. In some embodiments, the first set to be processed may be predefined, which may not require bitstream signaling. In alternative embodiments, the choice of which set to process first may be signaled in the bitstream.

[0078] Bitstream signaling may refer to signaling information in a bitstream or signaling information in a stored memory.

[0079] Alternative exemplary partitions 60, 80, 100, 120 are shown in FIGS. 5A-5D. In the exemplary partition 60 shown in FIG. 5A, the blocks 61-76 within a macroblock may be grouped into two sets of blocks: one set 61-64, 69-72 shown in white; and another set 65-68, 73-76 shown in cross-hatch. In the exemplary partition 80 shown in FIG. 5B, the blocks 81-96 within a macroblock may be grouped into two sets of blocks: one set 81, 84, 86, 87, 90, 91, 93, 96 shown in white; and another set 82, 83, 85, 88, 89, 92, 94, 95 shown in cross-hatch. In the exemplary partition 100 shown in FIG. 5C, the blocks 101-116 within a macroblock may be grouped into two sets of blocks: one set 101-108 shown in white; and another set 109-116 shown in cross-hatch. In the exemplary partition 120 shown in FIG. 5D, the blocks 121-136 within a macroblock may be grouped into two sets of blocks: a one set 121, 123, 125, 127, 129, 131, 133, 135 shown in white; and another set 122, 124, 126, 128, 130, 132, 134, 136 shown in cross-hatch. As appreciated by a person of ordinary skill in the art, the exemplary partitions shown in FIG. 4 and FIGS. 5A-5D may be readily extended to other macroblock and block sizes.

[0080] In alternative embodiments of the present invention, a macroblock may be partitioned into three pluralities of blocks. In some of these embodiments, a first plurality of blocks may be predicted in the encoding process using reconstructed pixel values from only previously encoded neighboring macroblocks. A second plurality of blocks may be subsequently predicted in the encoding process using reconstructed pixel values from the previously encoded blocks associated with the first plurality of blocks and/or using reconstructed pixel values from previously encoded neighboring macroblocks. Then a third plurality of blocks may be subsequently predicted in the encoding process using reconstructed pixel values from the previously encoded blocks associated with the first plurality of blocks, reconstructed pixel values from the previously encoded blocks associated with the second plurality of blocks and/or reconstructed pixel values from previously encoded neighboring macroblocks. In some embodiments, the blocks within a plurality of blocks may be encoded, fully or partially, in parallel.

[0081] Correspondingly, in some embodiments of the present invention, a first plurality of blocks may be predicted in the decoding process using reconstructed pixel values in only neighboring macroblocks. A second plurality of blocks may be subsequently predicted in the decoding process using the reconstructed pixel values in the reconstructed blocks associated with the first plurality of blocks and/or reconstructed pixel values in neighboring macroblocks. Then a third plurality of blocks may be subsequently predicted in the decoding process using reconstructed pixel values from the previously decoded blocks associated with the first plurality of blocks, reconstructed pixel values from the previously decoded blocks associated with the second plurality of blocks and/or reconstructed pixel values from previously decoded neighboring macroblocks. In some embodiments, the blocks with a plurality of blocks may be decoded, fully or partially, in parallel.

[0082] FIG. 6A and FIG. 6B depict exemplary three-group partitions 140, 160 of a macroblock. In the exemplary partition 140 shown FIG. 6A, the blocks shown in negative-slope hatching 146, 148, 154, 156 are allocated to a one group of blocks; the blocks shown in white 141, 143, 149, 151 are allocated to another group of blocks; and the blocks shown in cross-hatch 142, 144, 145, 147, 150, 152, 153, 155 are allocated to yet another group of blocks. In the exemplary partition 160 shown FIG. 6B, the blocks shown negative-slope hatching 166, 167, 168, 170, 174 are allocated to one group of blocks; the blocks shown in cross-hatch 162, 164, 165, 172, 173, 175 are allocated to a another group of blocks; and the blocks shown in white 161, 163, 169, 171, 176 are allocated to yet another group of blocks.

[0083] In alternative embodiments of the present invention, a macroblock may be partitioned into two or more pluralities of blocks. In some of these embodiments, a first plurality of blocks may be predicted at the encoder using reconstructed pixel values from only previously encoded neighboring macroblocks. A subsequent plurality of blocks may be predicted at the encoder using reconstructed pixel values from previously encoded blocks from previously encoded partitions and/or reconstructed pixel values from previously encoded neighboring macroblocks. Correspondingly, in some embodiments of the present invention, the first plurality of blocks may be predicted at the decoder using reconstructed pixel values from only neighboring macroblocks, and a subsequent plurality of blocks associated with a partition may be predicted at the decoder using reconstructed pixels from previously decoded blocks, from previously decoded partitions and/or previously decoded reconstructed pixel values in neighboring macroblocks. In some embodiments, the blocks with a plurality of blocks may be encoded, fully or partially, in parallel. In some embodiments, the blocks with a plurality of blocks may be decoded, fully or partially, in parallel.

[0084] FIG. 7 shows an exemplary partition 200 of 4×4 blocks in a 32×32 macroblock. In this exemplary partition 200, the sixty-four 4×4 blocks 201-264 are partitioned into four 32×8 sub-macroblocks: a first sub-macroblock 270 consisting of sixteen 4×4 blocks 201-216 shown in negative-slope hatching; a second sub-macroblock 272 consisting of sixteen 4×4 blocks 217-232 shown in cross-hatch; a third sub-macroblock 274 consisting of sixteen 4×4 blocks 233-248 shown in positive-slope hatching; and a fourth sub-macroblock 276 consisting of sixteen 4×4 blocks 249-264 shown in vertical-hatch. Each sub-macroblock 270, 272, 274, 276 may be partitioned into three sets of blocks: a first set of blocks shown with light shading (blocks 210, 212, 214, 216 in the first sub-macroblock 270; blocks 226, 228, 230, 232 in the second sub-macroblock 272; blocks 242, 244, 246, 248 in the third sub-macroblock 274; blocks 258, 260, 262, 264 in the fourth sub-macroblock 276); a second set of blocks shown with dark shading (blocks 201, 203, 205, 207 in the first sub-macroblock 270; blocks 217, 219, 221, 223 in the second sub-macroblock 272; blocks 233, 235, 237, 239 in the third sub-macroblock 274; blocks 249, 251, 253, 255 in the fourth sub-macroblock 276); and a third set of blocks shown with no shading (blocks 202, 204, 206, 208, 209, 211, 213, 215 in the first sub-macroblock 270; blocks 218, 220, 222, 224, 225, 227, 229, 231 in the second sub-macroblock 272; blocks 234, 236, 238, 240, 241, 243, 245, 247 in the third sub-macroblock 274; blocks 250, 252, 254, 256, 257, 259, 261, 263 in the fourth sub-macroblock 276).

[0085] In some embodiments, the set processing order may be predefined, which may not require bitstream signaling. In alternative embodiments, the choice of processing order may be signaled in the bitstream.

[0086] In some embodiments of the present invention, sub-macroblocks may be processed, fully or partially, in parallel. In some embodiments, at the encoder, the first plurality of blocks in each sub-macroblock may be predicted from pixel values in only previously encoded neighboring macroblocks. Subsequent groups of blocks may be predicted from pixel values in previously encoded groups of blocks and/or pixel values in previously encoded neighboring macroblocks. In some embodiments, at the decoder, the first plurality of blocks in each sub-macroblocks may be decoded using pixel values from only previously reconstructed neighboring macroblocks. Subsequent groups of blocks may be reconstructed from pixel values in previously reconstructed groups of blocks and/or pixel values in previously reconstructed neighboring macroblocks.

[0087] One exemplary partition 280, for

[0088] $\frac{M}{4}\times \frac{N}{4}$
intra prediction of an M×N macroblock, is shown in FIG. 8. In some embodiments, M and N may be equal. In other embodiments, M and N may be unequal. In this exemplary partition, the sixteen blocks 281-296 of the macroblock may be grouped into four sets of four blocks each according to an alternating row, alternating pattern. The four blocks: in one set are shown in white 281, 283, 289, 291; in a second set are shown in cross-hatch 282, 284, 290, 292; in a third set are shown in negative-slope cross-hatch 286, 288, 294, 296; and in a fourth set are shown in vertical hatching 285, 287, 293, 295. One set of blocks may be decoded first, followed by a second set of blocks, then a third set and finishing with a fourth set. In some embodiments, the blocks within a set of blocks may be decoded, fully or partially, in parallel. In some embodiments, the set processing order may be predefined, which may not require bitstream signaling. In alternative embodiments, the choice of processing order may be signaled in the bitstream.

[0089] According to exemplary embodiments of the present invention, at the encoder, the pixel values in the blocks in a first plurality of blocks may be predicted using the pixel values from only the neighboring left and/or upper encoded macroblocks using the nine prediction modes defined for H.264/AVC. The mode for each block in the first plurality of blocks may be selected according to mode-selection methods known in the art, and the residual for each block may be encoded. Correspondingly, at the decoder, the pixel values in the blocks in the first plurality of blocks may be predicted using the pixel values from only the reconstructed neighboring left and/or upper macroblocks.

[0090] The encoding and decoding of the blocks in the set of blocks processed first may be understood in relation to FIG. 9. FIG. 9 depicts an exemplary portion 300 of an image comprising two 16×16 macroblocks 302, 304. In the encoding and decoding of the macroblock on the left 302 (pixels shown in white, for example, 306 and pixels shown in dotted-hash, for example, 307), the pixel values in the macroblock on the right 304 (pixels shown in negative-slope hatching, for example, 308) are unavailable since this macroblock 304 has not been reconstructed. However, the pixels in the neighboring macroblocks above and to the left of the current macroblock 302 are available. The pixels in the neighboring macroblocks above and to the left, for example, 310, 312, 314, of the current macroblock 302 are shown in cross-hatch. For a block, for example, 316 (shown in dotted-hatch), in the set of blocks encoded first, the pixel values may be predicted from the available pixel values in the neighboring macroblocks above and to the left of the current macroblock (for example, the pixels shown in cross-hatch). In some embodiments of the present invention, at the encoder, the values may be predicted for each prediction mode, and the mode yielding the smallest residual error may be selected. In alternative embodiments, other mode selection methods known in the art may be used to select the prediction mode.

[0091] In some embodiments of the present invention, the predicted pixel values may be determined according to H.264/AVC 4×4 prediction equations extended to a macroblock.

[0092] In some embodiments of the present invention, prediction, for an N×N block, according to mode 0—vertical-mode intra prediction—may be performed according to the pseudo code, where pred[y][x] denotes the predicted pixel value, y denotes the row index and x denotes the column index:

[0093]

	// Vertical
	// pU array holds upper neighbors
	BLOCK_SIZE = N ;
	for (y=0; y<BLOCK_SIZE; y++)
	for (x=0; x<BLOCK_SIZE; x++)
	pred[y][x] = pU[x];
	// end pseudo code.

[0094] In some embodiments of the present invention, prediction, for an N×N block, according to mode 1—horizontal-mode intra prediction—may be performed according to the pseudo code, where pred[y][x] denotes the predicted pixel value, y denotes the row index and x denotes the column index:

[0095]

	// Horizontal
	// pL array holds left neighbors
	BLOCK_SIZE = N ;
	for (y=0; y<BLOCK_SIZE; y++)
	for (x=0; x<BLOCK_SIZE; x++)
	pred[y][x] = pL[y];
	// end pseudo code.

[0096] In some embodiments of the present invention, prediction, for an N×N block, where N=2ⁿ, according to mode 2—DC-mode intra prediction—may be performed according to the pseudo code, where pred[y][x] denotes the predicted pixel value, y denotes the row index and x denotes the column index:

[0097]

// DC
// pU array holds upper neighbors
// pL array holds left neighbors
BLOCK_SIZE = N ;
if all pU samples and all pL samples are available then
for (y=0; y<BLOCK_SIZE; y++)
for (x=0; x<BLOCK_SIZE; x++)
{
pred[y][x] = (pU[0] + pU[1] + ... + pU[N −1] +
pL[0] + pL[1] + ... + pL[N − 1] + (1<<n )) >> (n +1);
}
if any pU samples are unavailable and all pL samples are available then
for (y=0; y<BLOCK_SIZE; y++)
for (x=0; x<BLOCK_SIZE; x++)
{
pred[y][x] = (pL[0] + pL[1] + ... + pL[N −1] + (1<<(n −1))) >> n
}
if all pU samples are available and any pL samples are unavailable then
for (y=0; y<BLOCK_SIZE; y++)
for (x=0; x<BLOCK_SIZE; x++)
{
pred[y][x] = (pU[0] + pU[1] + ... + pU[ N −1] + (1<<( n −1))) >> n ;
}
if any pU samples are unavailable and any pL samples are unavailable then
for (y=0; y<BLOCK_SIZE; y++)
for (x=0; x<BLOCK_SIZE; x++)
{
pred[y][x] = DefaultValue; // DefaultValue = 2{circumflex over ( )}(b−1) for an
image with
bitdepth = b
}
// end pseudo code.

[0098] In some embodiments of the present invention, prediction, for an N×N block, according to mode 3—diagonal-down-left-mode intra prediction—may be performed according to the pseudo code, where pred[y][x] denotes the predicted pixel value, y denotes the row index and x denotes the column index:

[0099]

	// Diagonal Down Left
	// pU array holds upper neighbors
	// pL array holds left neighbors
	BLOCK_SIZE = N ;
	bound = BLOCK_SIZE-1;
	for (y=0; y<BLOCK_SIZE; y++)
	for (x=0; x<BLOCK_SIZE; x++)
	{
	if (x!=bound||y!=bound)
	pred[y][x] = (pU[x+y] + 2*pU[x+y+1] + pU[x+y+2] +2) >> 2;
	else
	pred[y][x] = (pU[bound*2] + 3*pU[bound*2+1] +2) >> 2;
	}
	// end pseudo code.

[0100] In some embodiments of the present invention, prediction, for an N×N block, according to mode 4—diagonal-down-right-mode intra prediction—may be performed according to the pseudo code, where pred[y][x] denotes the predicted pixel value, y denotes the row index and x denotes the column index:

[0101]

		// Diagonal Down Right
		// pU array holds upper neighbors
		// pL array holds left neighbors
		BLOCK_SIZE = N ;
		bound = BLOCK_SIZE-1;
		if (x>y)
		pred[y][x] = (pU[x−y−2] + 2*pU[x−y−1] + pU[x−y] +2) >> 2;
		else if (x<y)
		pred[y][x] = (pL[y−x−2] + 2*pL[y−x−1] + pL[y−x] +2) >> 2;
		else
		pred[y][x] = (pU[0] + 2*pU[−1] + pL[0] +2) >> 2;
		// end pseudo code.

[0102] In some embodiments of the present invention, prediction, for an N×N block, according to mode 5—vertical-right-mode intra prediction—may be performed according to the pseudo code, where pred[y][x] denotes the predicted pixel value, y denotes the row index and x denotes the column index:

[0103]

	// Vertical Right
	// pU array holds upper neighbors
	// pL array holds left neighbors
	BLOCK_SIZE = N ;
	bound = BLOCK_SIZE-1;
	zVR = 2*x−y;
	if ( ((zVR&0xl) == 0) && (zVR>=0) && zVR<=2*bound )
	pred[y][x] = (pU[x−(y>>1)−1] + pU[x−(y>>1)] +1) >> 1;
	else if ( ((zVR&0x1) == 1) && (zVR> 0) && zVR<2*bound)
	pred[y][x] = (pU[x−(y>>1)−2] + 2*pU[x−(y>>1)−1] +
	pU[x−(y>>1)] +2) >> 2;
	else if (zVR == −1)
	pred[y][x] = (pL[0] + 2*pU[−1] + pU[0] +2) >> 2;
	else
	pred[y][x] = (pL[y−(x<<1)−1] + 2*pL[y−(x<<1)−2] +
	pL[y−(x<<1)−3] +2) >> 2;
	// end pseudo code.

[0104] In some embodiments of the present invention, prediction, for an N×N block, according to mode 6—horizontal-down-mode intra prediction—may be performed according to the pseudo code, where pred[y][x] denotes the predicted pixel value, y denotes the row index and x denotes the column index:

[0105]

	// Horizontal Down
	// pU array holds upper neighbors
	// pL array holds left neighbors
	BLOCK_SIZE = N ;
	bound = BLOCK_SIZE-1;
	zHD = 2*y−x;
	if ( ((zHD&0x1) == 0) && (zHD>=0) && zHD<=2*bound )
	pred[y][x] = (pL[y−(x>>1)−1] + pL[y−(x>>1)] +1) >> 1;
	else if ( ((zHD&0x1) == 1) && (zHD>0) && zHD<2*bound)
	pred[y][x] = (pL[y−(x>>1)−2] + 2*pL[y−(x>>1)−1] +
	pL[y−(x>>1)] +2) >> 2;
	else if (zHD == −1)
	pred[y][x] = (pL[0] + 2*pU[−1] + pU[0] +2) >> 2;
	else
	pred[y][x] = (pU[x−(y<<1)−1] + 2*pU[x−(y<<1)−2] +
	pU[x−(y<<1)−3] +2) >> 2;
	// end pseudo code.

[0106] In some embodiments of the present invention, prediction, for an N×N block, according to mode 7—vertical-left-mode intra prediction—may be performed according to the pseudo code, where pred[y][x] denotes the predicted pixel value, y denotes the row index and x denotes the column index:

[0107]

		// Vertical Left
		// pU array holds upper neighbors
		// pL array holds left neighbors
		BLOCK_SIZE = N ;
		bound = BLOCK_SIZE-1;
		if ((y&0x1) == 0) //even
		pred[y][x] = (pU[x+(y>>1)] + pU[x+(y>>1)+1] +1) >> 1;
		else //odd
		pred[y][x] = (pU[x+(y>>1)] + 2*pU[x+(y>>1)+1] +
		pU[x+(y>>1)+2] +2) >> 2;
		// end pseudo code.

[0108] In some embodiments of the present invention, prediction \, for an N×N block, according to mode 8—horizontal-up-mode intra prediction—may be performed according to the pseudo code, where pred[y][x] denotes the predicted pixel value, y denotes the row index and x denotes the column index:

[0109]

// Horizontal Up
// pU array holds upper neighbors
// pL array holds left neighbors
BLOCK_SIZE = N ;
bound = BLOCK_SIZE-1;
zHU = x+2*y;
if ( ((zHU&0x1) == 0) && zHU<=2*(bound−1) )
pred[y][x] = (pL[y+(x>>1)] + pL[y+(x>>1)+1]+1) >> 1;
else if ( ((zHU&0x1) ==1) && zHU<2*(bound−1))
pred[y][x] = (pL[y+(x>>1) + 2*pL[y+(x>>1)+1] +
pL[y+(x>>1)+2] +2) >>2;
else if (zHU>2*bound−1)
pred[y][x] = pL[bound];
else // (zHU==2*bound−1) 29 for MB, 13 for 8×8 block, 5 for 4×4 block
pred[y][x] = (pL[bound−1] + 3*pL[bound] +2) >>2;
// end pseudo code.

[0110] The above-listed pseudo code is provided for illustration and not for limitation, and there is no intention to exclude alternative implementations and extensions of the above-described prediction formulae.

[0111] In some embodiments of the present invention, in DC prediction (mode 2), and other prediction modes, the neighboring upper and left macroblock pixel values may be weighted according to their distance to the block that is being predicted. For example, when predicting the pixel values in the exemplary block 316 in FIG. 9, the pixel values in the left neighboring macroblock may be given more weight than the pixel values in the upper neighboring macroblocks. In some embodiments of the present invention, the distance may be defined as the number of macroblocks plus one between the block being predicted and the neighboring upper macroblock and the number of macroblocks plus one between the block being predicted and the neighboring left macroblock In alternative embodiments of the present invention, the distance may be defined as the number of macroblocks between the block being predicted and the neighboring upper/left macroblock in the order of a zig-zag scan. In some embodiments of the present invention, a weight assigned to the neighboring upper block pixel values may be the ratio of the distance between the block being predicted and the neighboring left macroblock and the sum of the distances between the block being predicted and both the neighboring left and upper macroblocks. In some embodiments of the present invention, a weight assigned to the neighboring left block pixel values may be the ratio of the distance between the block being predicted and the neighboring upper macroblock and the sum of the distances between the block being predicted and both the neighboring left and upper macroblocks.

[0112] Some embodiments of the present invention may comprise mode prediction. To reduce the bits used to signal the intra modes, in H.264/AVC the intra prediction mode for a block may be predicted from the modes of the upper neighboring block and the left neighboring block according to Min(intraM×MPredModeA, intraM×MPredModeB), where intraM×MPredModeA denotes the mode of the left neighbor block and intraM×MPredModeB denotes the mode of the upper neighbor block. A rate-distortion optimized (RDO) decision may be made at an encoder when determining the intra modes. In the RDO decision step, a rate calculation may be made to calculate the rate used by sending intra modes.

[0113] According to some embodiments of the present invention, for blocks in a first plurality of blocks encoded first using reconstructed pixels from neighboring macroblocks, the modes of the closest available blocks that are also within the first plurality of blocks or neighboring macroblocks may be used during mode prediction and during rate-distortion optimization. An available block may refer to a block for which an intra-prediction mode has been determined.

[0114] These embodiments may be understood in relation to an example shown in FIG. 10. FIG. 10 depicts an exemplary macroblock 330. The blocks 331-346 of the macroblock 330 may be partitioned, for example, according to a checker-board pattern, into two pluralities of blocks: a first plurality 332, 334, 335, 337, 340, 342, 343, 345 and a second plurality 331, 333, 336, 338, 339, 341, 344, 346. For this example, all of the blocks within the first plurality of blocks may be processed, in a zig-zag order 332, 335, 334, 337, 340, 343, 342, 345, before the blocks within the second plurality of blocks.

[0115] According to some embodiments of the present invention, during mode prediction, block 337 may use, for its upper mode, the mode of block 332 since block 333 has not been processed, and block 332 is the nearest available block, for the zig-zag processing order of this example, above the block 337 for which mode prediction is being performed. In some embodiments of the present invention, the nearest block may be determined based on the Euclidean distance between the blocks. For its left mode, block 337 may use the mode of block 335 since block 336 has not been processed, and block 335 is the nearest available block, for the zig-zag processing order of this example, to the left of the block 337 for which mode prediction is being performed. In these embodiments of the present invention, mode prediction may use a block above, but not directly above, the block for which the mode prediction is being performed. In these embodiments of the present invention, mode prediction may use a block to the left of, but not directly to the left of, the block for which the mode prediction is being performed.

[0116] For further illustration, according to some embodiments of the present invention in which an intra-prediction mode is predicted from a block above and a block to the left of the block for which the mode prediction is being performed, mode prediction for block 335 in FIG. 10 may use, for its left mode, the mode of block 348 in the neighboring available macroblock and, for its upper mode, the mode of block 347 in the neighboring available macroblock. In alternative embodiments of the present invention, the mode of block 351 in the neighboring available macroblock may be used for the upper mode.

[0117] For further illustration, according to some embodiments of the present invention in which an intra-prediction mode is predicted from a block above and a block to the left of the block for which the mode prediction is being performed, mode prediction for block 334 in FIG. 10 may use, for its left mode, the mode of available block 332 and, for its upper mode, the mode of block 349 in the neighboring available macroblock. In alternative embodiments of the present invention, the mode of block 350 in the neighboring available macroblock may be used for the left mode.

[0118] In alternative embodiments, mode prediction may use the modes of other available blocks located directionally relative to the block for which the mode is being predicted. For example, an intra-prediction mode for a block may be predicted from the mode of a lower block and a right block.

[0119] In alternative embodiments, the modes of blocks in previously encoded neighboring macroblocks may be used in mode prediction. These embodiments may be understood in relation to an example shown in FIG. 10. According to these embodiments of the present invention, during mode prediction, block 337 may use, for its upper mode, the mode of block 350 from the previously encoded, upper neighboring macroblock, and for its mode, the mode of block 348 from the previously encoded, left neighboring macroblock.

[0120] In some embodiments of the present invention, both of the above-described methods of mode prediction may be available. An encoder may signal, in the bitstream, the mode-prediction method used for a plurality of blocks. In some embodiments of the present invention, the signaling may occur with meta-data which may include a picture parameter set, a sequence parameter set or other parameter set. In some embodiments of the present invention, the signaling may occur at the macroblock level. In alternative embodiments of the present invention, the signaling may occur at the slice level.

[0121] In some embodiments of the present invention, for blocks in a plurality of blocks processed subsequent to a first plurality of blocks, the modes of the closest available blocks that are in the current or preceding plurality of blocks or neighboring macroblocks may be used during mode prediction and rate-distortion optimization. In alternative embodiments of the present invention, for blocks in a plurality of blocks processed subsequent to a first plurality of blocks, only the modes of the closest available blocks that are in the current plurality of blocks or neighboring macroblocks may be used during mode prediction and rate-distortion optimization. In some embodiments of the present invention, blocks in different pluralities of blocks may use different methods for intra prediction. For these blocks, only the modes of the closest available blocks that are in the current or neighboring macroblocks and that use the same method for intra prediction may be used during mode prediction and rate-distortion optimization. In some embodiments of the present invention, the different method for intra-prediction may be signaled with a flag. In some embodiments of the present invention, the different methods for intra-prediction may be signaled with multiple flags.

[0122] For blocks in a set of blocks reconstructed subsequent to the first set of blocks reconstructed, in addition to previously reconstructed upper and/or left neighboring blocks, previously reconstructed right and bottom neighboring blocks may be available for intra prediction. These additional reconstructed blocks may be used to improve the intra prediction and, therefore, improve the coding efficiency due to the high correlation between blocks.

[0123] In some embodiments of the present invention, a previously reconstructed non-neighboring block may be used in intra prediction. In some of these embodiments, the contribution of a previously reconstructed signal value to the prediction value may be weighted by the distance of the reconstructed block to the current block.

[0124] In some embodiments of the present invention, the equations related to the previously described nine prediction mode directions, which may be referred to as standard-defined prediction-mode directions associated with standard-defined prediction modes, may be modified to use previously encoded blocks to the right of and/or below a current block for intra prediction. An exemplary modification of the prediction formulas for the exemplary partition shown in FIG. 4 may be illustrated for intra 4×4 prediction and may be understood in relation to FIG. 11 and Table 1.

[0125] FIG. 11 shows an exemplary 4×4 block 360 of sixteen pixels 361-376, where a pixel in column x and row y is denoted p (x,y). If the block 360 is one 4×4 block in a 16×16 macroblock partitioned in a checker-board pattern according to FIG. 4, and the block 360 is in the second plurality of blocks encoded, previously reconstructed pixels 381-396 are available above (381-384), below (385-388), to the right (389-392) and to the left (393-396) of the macroblock 360. The values of the corner pixels 397-400 may not be available. In some embodiments, these unavailable corner pixel values may be interpolated from the neighboring, available pixel values. In some embodiments, the pixel values may be interpolated according to:
X=(A+I+1)>>1
E=(D+II+1)>>1
X2=(L+AA+1)>>1
X3=(DD+LL+1)>>1,
where the pixel values are as indicated in FIG. 11. Table 1 shows both the original prediction equations and the modified, also considered extended, prediction equations. In some embodiments, if a pixel value required for an intra-prediction mode is not available, then the mode may not be used. Note that for some prediction modes, no modification of the original prediction formula is made.

[0126]

TABLE 1
Prediction Formulas - Original and Modified
ORIGINAL FORMULAS	MODIFIED FORMULAS
Intra_4×4_DC	Intra_4×4_DC_modified
(Mode 2)	(Mode 2 - modified)
p(0, 0) = p(1, 0) = P(2, 0) = P(3, 0) =	p(0, 0) = p(1, 0) = P(2, 0) = P(3, 0) =
p(0, 1) = p(1, 1) = P(2, 1) = P(3, 1) =	p(0, 1) = p(1, 1) = P(2, 1) = P(3, 1) =
p(0, 2) = p(1, 2) = P(2, 2) = P(3, 2) =	p(0, 2) = p(1, 2) = P(2, 2) = P(3, 2) =
p(0, 3) = p(1, 3) = P(2, 3) = P(3, 3) =	p(0, 3) = p(1, 3) = P(2, 3) = P(3, 3) =
(A + B + C + D + I + J + K + L + (1 << 2)) >> 3	(A + AA + B + BB + C + CC + D + DD +
If all neighbors are available.	I + II + J + JJ + K + KK + L + LL + (1 << 3)) >> 4
	If all neighbors are available.
Intra_4×4_Diagonal_Down_Left	Intra_4×4_Diagonal_Down_Left_modified
(Mode 3)	(Mode 3 - modified)
p(0, 0) = (A + C + 2*B + 2) >> 2	p(0, 0) = (A + C + 2*B + 2) >> 2
p(1, 0) = p(0, 1) = (B + D + 2*C + 2) >> 2	p(1, 0) = p(0, 1) = (B + D + 2*C + 2) >> 2
p(2, 0) = p(1, 1) = p(0, 2) = (C + E + 2*D + 2) >> 1	p(2, 0) = p(1, 1) = p(0, 2) = (C + E + 2*D + 2) >> 1
p(3, 0) = p(2, 1) = p(1, 2) = p(0, 3) = (D + F + 2*E + 2) >> 2	p(3, 0) = p(2, 1) = p(1, 2) = p(0, 3) = (D + 2*E + II + 2) >> 2
p(3, 1) = p(2, 2) = p(1, 3) = (E + G + 2*F + 2) >> 2	p(3, 1) = p(2, 2) = p(1, 3) = (E + 2*II + JJ + 2) >> 2
p(3, 2) = p(2, 3) = (F + H + 2*G) >> 2	p(3, 2) = p(2, 3) = (II + 2*JJ + KK) >> 2
p(3, 3) = (G + 3*H + 2) >> 2	p(3, 3) = (JJ + 2*KK + LL + 2) >> 2
Intra_4×4_Vertical_Left	Intra_4×4_Vertical_Left _modified
(Mode 7)	(Mode 7 - modified)
p(0, 0) = (A + B + 1) >> 1	p(0, 0) = (A + B + 1) >> 1
p(1, 0) = p(0, 2) = (B + C + 1) >> 1	p(1, 0) = p(0, 2) = (B + C + 1) >> 1
p(2, 0) = p(1, 2) = (C + D + 1) >> 1	p(2, 0) = p(1, 2) = (C + D + 1) >> 1
p(3, 0) = p(2, 2) = (D + E + 1) >> 1	p(3, 0) = p(2, 2) = (D + E + 1) >> 1
p(3, 2) = (E + F + 1) >> 1	p(3, 2) = (E + 2*II + JJ + 2) >> 2
p(0, 1) = (A + 2*B + C + 2) >> 2	p(0, 1) = (A + 2*B + C + 2) >> 2
p(1, 1) = p(0, 3) = (B + 2*C + D + 2) >> 2	p(1, 1) = p(0, 3) = (B + 2*C + D + 2) >> 2
p(2, 1) = p(1, 3) = (C + 2*D + E + 2) >> 2	p(2, 1) = p(1, 3) = (C + 2*D + E + 2) >> 2
p(3, 1) = p(2, 3) = (D + 2*E + F + 2) >> 2	p(3, 1) = p(2, 3) = (D + 2*E + II + 2) >> 2
p(3, 3) = (E + 2*F + G + 2) >> 2	p(3, 3) = (II + 2*JJ + KK + 2) >> 2
Intra_4×4_Horizontal_Up	Intra_4×4_Horizontal_Up_modified
(Mode 8)	(Mode 8 - modified)
p(0, 0) = (I + J + 1) >> 1	p(0, 0) = (I + J + 1) >> 1
p(1, 0) = (I + 2*J + K + 2) >> 2	p(1, 0) = (I + 2*J + K + 2) >> 2
p(2, 0) = p(0, 1) = (J + K + 1) >> 1	p(2, 0) = p(0, 1) = (J + K + 1) >> 1
p(3, 0) = p(1, 1) = (J + 2*K + L + 2) >> 2	p(3, 0) = p(1, 1) = (J + 2*K + L + 2) >> 2
p(2, 1) = p(0, 2) = (K + L + 1) >> 1	p(2, 1) = p(0, 2) = (K + L + 1) >> 1
p(3, 1) = p(1, 2) = (K + 3*L + 2) >> 2	p(3, 1) = p(1, 2) = (K + 2*L + X2 + 2) >> 2
p(0, 3) = p(1, 3) = p(2, 2) = p(2, 3) = p(3, 2) = p(3, 3) = L	p(2, 2) = p(0, 3) = (L + X2 + 1) >> 1
	p(1, 3) = p(3, 2) = (L + 2*X2 + AA + 2) >> 2
	p(2, 3) = (X2 + 2*AA + BB + 2) >> 2
	p(3, 3) = (AA + 2*BB + CC + 2) >> 2

[0127] In some embodiments of the present invention, nine directional intra-prediction modes opposite in direction to the nine intra-prediction mode directions previously described may be defined. These opposite-direction modes may be described in relation to FIG. 12. Pixel values in a current block may be predicted from pixel values in reconstructed blocks above, to the left of, below and/or to the right of the current block. In FIG. 12, the direction of the arrow depicting the mode indicates the prediction direction for each mode.

[0128] In FIG. 12, the center point 422 does not represent a direction so this point may be associated with DC prediction modes, which may be referred to as “mode 2” and “mode 11.” In some embodiments of the present invention, “mode 2” predicted values may be predicted, for 4×4 intra prediction, according to:
p(0,0)=p(1,0)=P(2,0)=P(3,0)=
p(0,1)=p(1,1)=P(2,1)=P(3,1)=
p(0,2)=p(1,2)=P(2,2)=P(3,2)=
p(0,3)=p(1,3)=P(2,3)=P(3,3)=
(A+B+C+D+I+J+K+L+(1<<2))>>3,
and “mode 11” predicted values may be predicted, for 4×4 intra prediction, according to:
p(0,0)=p(1,0)=P(2,0)=P(3,0)=
p(0,1)=p(1,1)=P(2,1)=P(3,1)=
p(0,2)=p(1,2)=P(2,2)=P(3,2)=
p(0,3)=p(1,3)=P(2,3)=P(3,3)=
(AA+BB+CC+DD+II+JJ+KK+LL+(1<<2))>>3,
where the pixel locations and values may be as shown in FIG. 11. In alternative embodiments, “mode 2” and “mode 11” predicted values may be predicted, for 4×4 intra prediction, according to:
p(0,0)=p(1,0)=P(2,0)=P(3,0)=
p(0,1)=p(1,1)=P(2,1)=P(3,1)=
p(0,2)=p(1,2)=P(2,2)=P(3,2)=
p(0,3)=p(1,3)=P(2,3)=P(3,3)=
(A+AA+B+BB+C+CC+D+DD+
I+II+J+JJ+K+KK+L+LL+(1<<3))>>4.

[0129] A vertical arrow 420 extending in the downward direction from the center point 422 may represent a first vertical prediction mode, which may be referred to as “mode 0,” and a vertical arrow 429 extending in the upward direction from the center point 422 may represent a second vertical prediction mode, which may be referred to as “mode 9.” In some embodiments of the present invention, “mode 0” predicted values may be predicted, for 4×4 intra prediction, according to:
p(0,0)=p(0,1)=P(0,2)=P(0,3)=A
p(1,0)=p(1,1)=P(1,2)=P(0,3)=B
p(2,0)=p(2,1)=P(2,2)=P(2,3)=C
p(3,0)=p(3,1)=P(3,2)=P(3,3)=D,
and “mode 9” predicted values may be predicted, for 4×4 intra prediction, according to:
p(0,0)=p(0,1)=P(0,2)=P(0,3)=AA
p(1,0)=p(1,1)=P(1,2)=P(0,3)=BB
p(2,0)=p(2,1)=P(2,2)=P(2,3)=CC
p(3,0)=p(3,1)=P(3,2)=P(3,3)=DD,
where the pixel locations and values may be as shown in FIG. 11.

[0130] A horizontal arrow 421 extending to the right from the center point 422 may represent a first horizontal prediction mode, which may be referred to as “mode 1.” A horizontal arrow 430 extending to the left from the center point 422 may represent a second horizontal prediction mode, which may be referred to as “mode 10.” In some embodiments of the present invention, “mode 1” predicted values may be predicted, for 4×4 intra prediction, according to:
p(0,0)=p(1,0)=P(2,0)=P(3,0)=I
p(0,1)=p(1,1)=P(2,1)=P(3,1)=J
p(0,2)=p(1,2)=P(2,2)=P(3,2)=K
p(0,3)=p(1,3)=P(2,3)=P(3,3)=L,
and “mode 10” predicted values may be predicted, for 4×4 intra prediction, according to:
p(0,0)=p(1,0)=P(2,0)=P(3,0)=II
p(0,1)=p(1,1)=P(2,1)=P(3,1)=JJ
p(0,2)=p(1,2)=P(2,2)=P(3,2)=KK
p(0,3)=p(1,3)=P(2,3)=P(3,3)=LL,
where the pixel locations and values may be as shown in FIG. 11.

[0131] An arrow 423 extending from the center point 422 diagonally downward to the left at approximately a 45 degree angle from horizontal may represent a diagonal down-left (DDL) prediction mode, also referred to as “mode 3,” and an arrow 432 extending from the center point 422 in a direction 180 degrees opposite may represent a diagonal up-right (DUR) prediction mode, which may be referred to as “mode 12” or a DDL 2 mode. In some embodiments of the present invention, “mode 3” predicted values may be predicted, for 4×4 intra prediction, according to:
p(0,0)=(A+C+2*B+2)>>2
p(1,0)=p(0,1)=(B+D+2*C+2)>>2
p(2,0)=p(1,1)=p(0,2)=(C+E+2*D+2)>>1
p(3,0)=p(2,1)=p(1,2)=p(0,3)=(D+2*E+II+2)>>2
p(3,1)=p(2,2)=p(1,3)=(E+2*H+JJ+2)>>2
p(3,2)=p(2,3)=(II+2*JJ+KK)>>2
p(3,3)=(JJ+2*KK+LL+2)>>2,
where the pixel locations and values may be as shown in FIG. 11. In some embodiments of the present invention, “mode 12” predicted values may be predicted, for 4×4 intra prediction, by rotating the block data and the neighboring data by 90 degrees clockwise and using the “mode 4” prediction equations:
p(0,0)=p(1,1)=p(2,2)=p(3,3)=(I+2*X+A+2)>>2
p(1,0)=p(2,1)=p(3,2)=(X+2*A+B+2)>>2
p(2,0)=p(3,1)=(A+2*B+C+2)>>2
p(3,0)=(B+2*C+D+2)>>2
p(0,1)=p(1,2)=p(2,3)=(J+2*I+X+2)>>2
p(0,2)=p(1,3)=(K+2*J+I+2)>>2
p(0,3)=(L+2*K+J+2)>>2,
where the pixel locations and values may be as shown in FIG. 11.

[0132] FIG. 13A and FIG. 13B illustrate this process. As depicted in FIG. 13A, a 4×4 block 450 of sixteen pixels 451-466 may be predicted in the diagonal up-right direction 479 from the reconstructed pixel values to the left 470-473 and below 475-478 and an interpolated corner pixel value 474. FIG. 13B depicts the pixels of FIG. 13A after a 90 degree clockwise rotation. A 4×4 block 480 of sixteen pixels 481-496 may be predicted in the diagonal down-right direction 509 from the reconstructed pixels to the left 505-508 and above 501-504 and an interpolated corner pixel 500 using the “mode 4” prediction equations. These predicted pixel values 481-496 may be mapped back to the proper pixels by a 90 degree counter-clockwise rotation. In some embodiments of the present invention, the “mode 12” predicted values may be predicted through rotation and using the “mode 4” prediction equations. In alternative embodiments, the “mode 12” predicted values may be directly predicted, for 4×4 intra prediction, according to:
p(0,3)=p(1,2)=p(2,1)=p(3,0)=(AA+2*X2+L+2)>>2
p(0,2)=p(1,1)=p(2,0)=(X2+2*L+K+2)>>2
p(1,0)=p(0,1)=(L+2*K+J+2)>>2
p(0,0)=(K+2*J−F1−F2)>>2
p(3,1)=p(1,3)=p(2,2)=(BB+2*AA+X2+2)>>2
p(2,3)=p(3,2)=(CC+2*BB+AA+2)>>2
p(3,3)=(DD+2*CC+BB+2)>>2,
where the pixel values and locations are shown in FIG. 13A.

[0133] An arrow 424 extending from the center point 422 diagonally downward to the right at approximately a 45 degree angle from horizontal may represent a diagonal down-right (DDR) prediction mode, also referred to as “mode 4,” and an arrow 433 extending from the center point 422 in a direction 180 degrees opposite may represent a diagonal up-left (DUL) prediction mode, which may be referred to as “mode 13” or a DDR 2 mode. In some embodiments of the present invention, “mode 4” predicted values may be predicted, for 4×4 intra prediction, according to:
p(0,0)=p(1,1)=p(2,2)=p(3,3)=(I+2*X+A+2)>>2
p(1,0)=p(2,1)=p(3,2)=(X+2*A+B+2)>>2
p(2,0)=p(3,1)=(A+2*B+C+2)>>2
p(3,0)=(B+2*C+D+2)>>2
p(0,1)=p(1,2)=p(2,3)=(J+2*I+X+2)>>2
p(0,2)=p(1,3)=(K+2*J+I+2)>>2
p(0,3)=(L+2*K+J+2)>>2,
where the pixel locations and values may be as shown in FIG. 11. In some embodiments of the present invention, “mode 13” predicted values may be predicted, for 4×4 intra prediction, by rotating the block data and the neighboring data by 180 degrees and using the “mode 4” prediction equations.

[0134] FIG. 14A and FIG. 14B illustrate this process. As depicted in FIG. 14A, a 4×4 block 520 of sixteen pixels 521-536 may be predicted in the diagonal up-left direction 549 from the reconstructed pixel values to the right 545-548 and below 540-543 and an interpolated corner pixel value 544. FIG. 14B depicts the pixels of FIG. 14A after a 180 degree rotation. A 4×4 block 550 of sixteen pixels 551-566 may be predicted in the diagonal down-right direction 579 from the reconstructed pixels to the left 575-578 and above 571-574 and an interpolated corner pixel 570 using the “mode 4” prediction equations. These predicted pixel values 551-566 may be mapped back to the proper pixels by a 180 degree rotation. In some embodiments of the present invention, the “mode 13” predicted values may be predicted through rotation and using the “mode 4” prediction equations. In alternative embodiments, the “mode 13” predicted values may be directly predicted, for 4×4 intra prediction, according to:
p(3,3)=p(2,2)=p(1,1)=p(0,0)=(LL+2*X3+DD+2)>>2
p(2,3)=p(0,1)=p(1,2)=(X3+2*DD+CC+2)>>2
p(1,3)=p(0,2)=(DD+2*CC+BB+2)>>2
p(0,3)=(CC+2*BB+AA+2)>>2
p(3,2)=p(2,1)=p(1,0)=(K+2*LL+X3+2)>>2
p(3,1)=p(2,0)=(JJ+2*KK+LL+2)>>2
p(3,0)=(II+2*JJ+KK+2)>>2,
where the pixel values and locations are shown in FIG. 14A.

[0135] An arrow 425 extending from the center point 422 diagonally downward to the right at approximately a 67.5 degree angle from horizontal may represent a vertical right (VR) prediction mode, which may be referred to as “mode 5,” and an arrow 434 extending from the center point 422 in a direction 180 degrees opposite may represent vertical right 2 prediction mode, which may be referred to as “mode 14” or a VR 2 mode. In some embodiments of the present invention, “mode 5” predicted values may be predicted, for 4×4 intra prediction, according to:
p(0,0)=p(1,2)=(X+A+1)>>1
p(1,0)=p(2,2)=(A+B+1)>>1
p(2,0)=p(3,2)=(B+C+1)>>1
p(3,0)=(C+D+1)>>1
p(0,1)=p(1,3)=(I+2*X+A+2)>>2
p(1,1)=p(2,3)=(X+2*A+B+2)>>2
p(2,1)=p(3,3)=(A+2*B+C+2)>>2
p(3,1)=(B+2*C+D+2)>>2
p(0,2)=(X+2*I+J+2)>>2
p(0,3)=(I+2*J+K+2)>>2,
where the pixel locations and values may be as shown in FIG. 11. In some embodiments of the present invention, “mode 14” predicted values may be predicted, for 4×4 intra prediction, by rotating the block data and the neighboring data by 180 degrees and using the “mode 5” prediction equations.

[0136] FIG. 15A and FIG. 15B illustrate this process. As depicted in FIG. 15A, a 4×4 block 590 of sixteen pixels 591-606 may be predicted in the vertical right 2 direction 619 from the reconstructed pixel values to the right 615-618 and below 610-613 and an interpolated corner pixel value 614. FIG. 15B depicts the pixels of FIG. 15A after a 180 degree rotation. A 4×4 block 620 of sixteen pixels 621-636 may be predicted in the vertical right direction 649 from the reconstructed pixels to the left 645-648 and above 641-644 and an interpolated corner pixel 640 using the “mode 5” prediction equations. These predicted pixel values 621-636 may be mapped back to the proper pixels by a 180 degree rotation. In some embodiments of the present invention, the “mode 14” predicted values may be predicted through rotation and using the “mode 5” prediction equations. In alternative embodiments, the “mode 14” predicted values may be directly predicted, for 4×4 intra prediction, according to:
p(3,3)=p(2,1)=(X3+DD+1)>>1
p(2,3)=p(1,1)=(DD+CC+1)>>1
p(1,3)=p(0,1)=(CC+BB+1)>>1
p(0,3)=(BB+AA+1)>>1
p(3,2)=p(2,0)=(LL+2*X3+DD+2)>>2
p(2,2)=p(1,0)=(X3+2*DD+CC+2)>>2
p(1,2)=p(0,0)=(DD+2*CC+BB+2)>>2
p(3,1)=(X3+2*LL+KK+2)>>2
p(3,0)=(LL+2*KK+JJ+2)>>2
where the pixel values and locations are shown in FIG. 15A.

[0137] An arrow 426 extending from the center point diagonally downward to the right at approximately a 22.5 degree angle from horizontal may represent a horizontal down (HD) prediction mode, which may be referred to as “mode 6,” and an arrow 435 extending from the center point 422 in a direction 180 degrees opposite may represent a horizontal down 2 prediction mode, which may be referred to as “mode 15” or an HD 2 mode. In some embodiments of the present invention, “mode 6” predicted values may be predicted, for 4×4 intra prediction, according to:
p(0,0)=p(2,1)=(X+I+1)>>1
p(1,0)=p(3,1)=(I+2*X+A+2)>>2
p(2,0)=(X+2*A+B+2)>>2
p(3,0)=(A+2*B+C+2)>>2
p(0,1)=p(2,2)=(I+J+1)>>1
p(1,1)=p(3,2)=(X+2*I+J+2)>>2
p(0,2)=p(2,3)=(J+K+1)>>1
p(1,2)=p(3,3)=(I+2*J+K+2)>>2
p(0,3)=(K+L+1)>>1
p(1,3)=(J+2*K+L+2)>>2
where the pixel locations and values may be as shown in FIG. 11. In some embodiments of the present invention, “mode 15” predicted values may be predicted, for 4×4 intra prediction, by rotating the block data and the neighboring data by 180 degrees and using the “mode 6” prediction equations.

[0138] FIG. 16A and FIG. 16B illustrate this process. As depicted in FIG. 16A, a 4×4 block 660 of sixteen pixels 561-676 may be predicted in the horizontal down 2 direction 689 from the reconstructed pixel values to the right 685-688 and below 680-683 and an interpolated corner pixel value 684. FIG. 16B depicts the pixels of FIG. 16A after a 180 degree rotation. A 4×4 block 690 of sixteen pixels 691-706 may be predicted in the horizontal down direction 719 from the reconstructed pixels to the left 715-718 and above 711-714 and an interpolated corner pixel 710 using the “mode 6” prediction equations. These predicted pixel values 691-706 may be mapped back to the proper pixels by a 180 degree rotation. In some embodiments of the present invention, the “mode 15” predicted values may be predicted through rotation and using the “mode 6” prediction equations. In alternative embodiments, the “mode 15” predicted values may be directly predicted, for 4×4 intra prediction, according to:
p(3,3)=p(1,2)=(X3+LL+1)>>1
p(2,3)=p(0,2)=(LL+2*X3+DD+2)>>2
p(1,3)=(X3+2*DD+CC+2)>>2
p(0,3)=(DD+2*CC+BB+2)>>2
p(3,2)=p(1,1)=(LL+KK+1)>>1
p(2,2)=p(0,1)=(X3+2*LL+KK+2)>>2
p(3,1)=p(1,0)=(KK+JJ+1)>>1
p(2,1)=p(0,0)=(LL+2*KK+JJ+2)>>2
p(3,0)=(JJ+II+1)>>1
p(2,0)=(KK+2*JJ+II+2)>>2,
where the pixel values and locations are shown in FIG. 16A.

[0139] An arrow 427 extending from the center point 422 diagonally downward to the left at approximately a 67.5 degree angle from horizontal may represent a vertical left (VL) prediction mode, which may be referred to as “mode 7,” and an arrow 436 extending from the center point 422 in a direction 180 degrees opposite may represent a vertical left 2 prediction mode, which may be referred to as “mode 16” or a VL 2 mode. In some embodiments of the present invention, “mode 7” predicted values may be predicted, for 4×4 intra prediction, according to:
p(0,0)=(A+B+1)>>1
p(1,0)=p(0,2)=(B+C+1)>>1
p(2,0)=p(1,2)=(C+D+1)>>1
p(3,0)=p(2,2)=(D+E+1)>>1
p(3,2)=(E+2*II+JJ+2)>>2
p(0,1)=(A+2*B+C+2)>>2
p(1,1)=p(0,3)=(B+2*C+D+2)>>2
p(2,1)=p(1,3)=(C+2*D+E+2)>>2
p(3,1)=p(2,3)=(D+2*E+II+2)>>2
p(3,3)=(II+2*JJ+KK+2)>>2,
where the pixel locations and values may be as shown in FIG. 11. In some embodiments of the present invention, “mode 16” predicted values may be predicted, for 4×4 intra prediction, by rotating the block data and the neighboring data by 90 degrees clockwise and using the “mode 6” prediction equations.

[0140] FIG. 17A and FIG. 17B illustrate this process. As depicted in FIG. 17A, a 4×4 block 730 of sixteen pixels 731-746 may be predicted in the vertical left 2 direction 758 from the reconstructed pixel values to the left 750-752 and below 754-757 and an interpolated corner pixel value 753. FIG. 17B depicts the pixels of FIG. 17A after a 90 degree clockwise rotation. A 4×4 block 760 of sixteen pixels 761-776 may be predicted in the horizontal down direction 798 from the reconstructed pixels to the left 794-797 and above 791-793 and an interpolated corner pixel 790 using the “mode 6” prediction equations. These predicted pixel values 761-776 may be mapped back to the proper pixels by a 90 degree clockwise rotation. In some embodiments of the present invention, the “mode 16” predicted values may be predicted through rotation and using the “mode 6” prediction equations. In alternative embodiments, the “mode 16” predicted values may be directly predicted, for 4×4 intra prediction, according to:
p(0,3)=p(1,1)=(X2+AA+1)>>1
p(0,2)=p(1,0)=(AA+2*X2+L+2)>>2
p(0,1)=(X2+2*L+K+2)>>2
p(0,0)=(L+2*K+J+2)>>2
p(1,3)=p(2,1)=(AA+BB+1)>>1
p(1,2)=p(2,0)=(X2+2*AA+BB+2)>>2
p(2,3)=p(3,1)=(BB+CC+1)>>1
p(2,2)=p(3,0)=(AA+2*BB+CC+2)>>2
p(3,3)=(CC+DD+1)>>1
p(3,2)=(BB+2*CC+DD+2)>>2,
where the pixel values and locations are shown in FIG. 17A.

[0141] An arrow 428 extending from the center point diagonally upward to the right at approximately a 22.5 degree angle from horizontal may represent a horizontal up (HU) prediction mode, also referred to as “mode 8,” and an arrow 437 extending from the center point 422 in a direction 180 degrees opposite may represent a horizontal up 2 prediction mode, which may be referred to as “mode 17” or an HU 2 mode. In some embodiments of the present invention, “mode 8” predicted values may be predicted, for 4×4 intra prediction, according to:
p(0,0)=(I+J+1)>>1
p(1,0)=(I+2*J+K+2)>>2
p(2,0)=p(0,1)=(J+K+1)>>1
p(3,0)=p(1,1)=(J+2*K+L+2)>>2
p(2,1)=p(0,2)=(K+L+1)>>1
p(3,1)=p(1,2)=(K+2*L+X2+2)>>2
p(2,2)=p(0,3)=(L+X2+1)>>1
p(1,3)=p(3,2)=(L+2*X2+AA+2)>>2
p(2,3)=(X2+2*AA+BB+2)>>2
p(3,3)=(AA+2*BB+CC+2)>>2,
where the pixel locations and values may be as shown in FIG. 11. In some embodiments of the present invention, “mode 17” predicted values may be predicted, for 4×4 intra prediction, by flipping the block data and the neighboring data across the right-side boundary and using the “mode 6” prediction equations.

[0142] FIG. 18A and FIG. 18B illustrate this process. As depicted in FIG. 18A, a 4×4 block 810 of sixteen pixels 811-826 may be predicted in the horizontal up 2 direction 838 from the reconstructed pixel values to the right 834-837 and above 830-832 and an interpolated corner pixel value 833. FIG. 18B depicts the pixels of FIG. 18A after a flip across the right-side boundary. A 4×4 block 840 of sixteen pixels 841-856 may be predicted in the horizontal down direction 868 from the reconstructed pixels to the left 864-867 and above 861-863 and an interpolated corner pixel 860 using the “mode 6” prediction equations. These predicted pixel values 841-856 may be mapped back to the proper pixels by an inverse flip across the left-side boundary. In some embodiments of the present invention, the “mode 17” predicted values may be predicted through flipping and using the “mode 6” prediction equations. In alternative embodiments, the “mode 17” predicted values may be directly predicted, for 4×4 intra prediction, according to:
p(3,0)=p(1,1)=(E+II+1)>>1
p(2,0)=p(0,1)=(II+2*E+D+2)>>2
p(1,0)=(E+2*D+C+2)>>2
p(0,0)=(D+2*C+B+2)>>2
p(3,1)=p(1,2)=(II+JJ+1)>>1
p(2,1)=p(0,2)=(E+2*II+JJ+2)>>2
p(3,2)=p(1,3)=(JJ+KK+1)>>1
p(2,2)=p(0,3)=(II+2*JJ+KK+2)>>2
p(3,3)=(KK+LL+1)>>1
p(2,3)=(JJ+2*KK+LL+2)>>2,
where the pixel values and locations are shown in FIG. 18A.

[0143] An advantage of intra prediction using an opposite-direction mode may be understood in relation to FIG. 19. FIG. 19 depicts an exemplary block 900 of sixteen pixels 901-916. When the block 900 is in a set of blocks reconstructed subsequent to the reconstruction of all blocks within a first set of blocks in a macroblock partitioned according to a checker-board pattern, reconstructed pixel values (for example, 931-938) in neighboring blocks other than the left-neighboring block and the above neighboring-block may be available to use for intra prediction in addition to pixels 925-928 within the left-neighboring block and pixels 921-924 within the above-neighboring block. For images with luminance content, for example, that as illustrated in FIG. 19 by white pixels 901-907, 909, 910, 913, 931, 921-928, 935, 940-942 and gray pixels 908, 911, 912, 914-916, 932-934, 936-938, 943, 950-957 the pixel values of the gray pixels 908, 911, 912, 914-916, 932-934 within the block 900 may be better predicted from the reconstructed pixel values in the right-neighboring block and the below-neighboring block. Thus, the use of the opposite-direction prediction modes may increase the compression efficiency due to the higher correlation between the pixel values being predicted and the reconstructed pixel values used in the prediction.

[0144] In general, with increased number of prediction modes to select from, encoding efficiency may be increased due to better pixel value prediction. However, with more prediction modes, there may be increased signaling requirements. In some embodiments of the present invention, an encoder may balance the number of modes with the increased overhead associated with additional prediction modes.

[0145] In some embodiments of the present invention, a pixel value in a block in a set of blocks reconstructed subsequent to the first set of blocks reconstructed may be predicted according to a prediction mode, wherein the prediction mode is one of the standard-defined prediction modes.

[0146] In alternative embodiments of the present invention, a pixel value in a block in a set of blocks reconstructed subsequent to the first set of blocks reconstructed may be predicted according to a prediction mode, wherein the prediction mode is one of the above-defined opposite-direction modes.

[0147] In still alternative embodiments of the present invention, a pixel value in a block in a set of blocks reconstructed subsequent to the first set of blocks reconstructed may be predicted by weighted interpolation of the values predicted by two modes that are of 180 degrees different in prediction direction. In some embodiments, a pixel value may be predicted according to:
p(y,x)=w_p1(y,x)*p1(y,x)+(1−w_p1(y,x))p2(y,x),
where p(y,x) may denote the predicted pixel value at location (y,x), p1 and p2 may denote two prediction modes with opposite prediction directions and w_p1(y,x) may denote a weight associated with prediction mode p1 at location (y,x). In some embodiments of the present invention, the weights may be approximately proportional to the distance to the prediction neighbors. Table 2 shows exemplary weights for 4×4 intra prediction. In some embodiments of the present invention, the weights may be stored for each prediction-mode direction. In alternative embodiments of the present invention, weights for a subset of prediction-mode directions may be stored, and weights for an un-stored prediction-mode direction may be generated by a transformation, for example, a rotation or flipping, of an appropriate stored weighting table.

[0148]

TABLE 2
Exemplary Weights for Opposite-
Direction-Mode Interpolation
Weighted Interpolated Modes
Mode 0 and Mode 9
w m ⁡ ( 0 ⁢ , ⁢ 0 ) w m ⁡ ( 1 ⁢ , ⁢ 0 ) w m ⁡ ( 2 ⁢ , ⁢ 0 ) w m ⁡ ( 3 ⁢ , ⁢ 0 ) w m ⁡ ( 0 ⁢ , ⁢ 1 ) w m ⁡ ( 1 ⁢ , ⁢ 1 ) w m ⁡ ( 2 ⁢ , ⁢ 1 ) w m ⁡ ( 3 ⁢ , ⁢ 1 ) w m ⁡ ( 0 ⁢ , ⁢ 2 ) w m ⁡ ( 1 ⁢ , ⁢ 2 ) w m ⁡ ( 2 ⁢ , ⁢ 2 ) w m ⁡ ( 3 ⁢ , ⁢ 2 ) w m ⁡ ( 0 ⁢ , ⁢ 3 ) w m ⁡ ( 1 ⁢ , ⁢ 3 ) w m ⁡ ( 2 ⁢ , ⁢ 3 ) w m ⁡ ( 3 ⁢ , ⁢ 3 )
p(y, x) = w0 (y, x) p0 (y, x) + w9 (y, x) p9 (y, x)
w0 (y, x) = 1 − w9 (y, x)
Mode 1 and Mode 10
w m ⁡ ( 0 ⁢ , ⁢ 0 ) w m ⁡ ( 1 ⁢ , ⁢ 0 ) w m ⁡ ( 2 ⁢ , ⁢ 0 ) w m ⁡ ( 3 ⁢ , ⁢ 0 ) w m ⁡ ( 0 ⁢ , ⁢ 1 ) w m ⁡ ( 1 ⁢ , ⁢ 1 ) w m ⁡ ( 2 ⁢ , ⁢ 1 ) w m ⁡ ( 3 ⁢ , ⁢ 1 ) w m ⁡ ( 0 ⁢ , ⁢ 2 ) w m ⁡ ( 1 ⁢ , ⁢ 2 ) w m ⁡ ( 2 ⁢ , ⁢ 2 ) w m ⁡ ( 3 ⁢ , ⁢ 2 ) w m ⁡ ( 0 ⁢ , ⁢ 3 ) w m ⁡ ( 1 ⁢ , ⁢ 3 ) w m ⁡ ( 2 ⁢ , ⁢ 3 ) w m ⁡ ( 3 ⁢ , ⁢ 3 )
p(y, x) = w1 (y, x) p1 (y, x) + w10 (y, x) p10 (y, x)
w1 (y, x) = 1 − w10 (y, x)
Mode 3 and Mode 12
w m ⁡ ( 0 ⁢ , ⁢ 0 ) w m ⁡ ( 1 ⁢ , ⁢ 0 ) w m ⁡ ( 2 ⁢ , ⁢ 0 ) w m ⁡ ( 3 ⁢ , ⁢ 0 ) w m ⁡ ( 0 ⁢ , ⁢ 1 ) w m ⁡ ( 1 ⁢ , ⁢ 1 ) w m ⁡ ( 2 ⁢ , ⁢ 1 ) w m ⁡ ( 3 ⁢ , ⁢ 1 ) w m ⁡ ( 0 ⁢ , ⁢ 2 ) w m ⁡ ( 1 ⁢ , ⁢ 2 ) w m ⁡ ( 2 ⁢ , ⁢ 2 ) w m ⁡ ( 3 ⁢ , ⁢ 2 ) w m ⁡ ( 0 ⁢ , ⁢ 3 ) w m ⁡ ( 1 ⁢ , ⁢ 3 ) w m ⁡ ( 2 ⁢ , ⁢ 3 ) w m ⁡ ( 3 ⁢ , ⁢ 3 )
p(y, x) = w3 (y, x) p3 (y, x) + w12 (y, x) p12 (y, x)
w3 (y, x) = 1 − w12 (y, x)
Mode 4 and Mode 13
w m ⁡ ( 0 ⁢ , ⁢ 0 ) w m ⁡ ( 1 ⁢ , ⁢ 0 ) w m ⁡ ( 2 ⁢ , ⁢ 0 ) w m ⁡ ( 3 ⁢ , ⁢ 0 ) w m ⁡ ( 0 ⁢ , ⁢ 1 ) w m ⁡ ( 1 ⁢ , ⁢ 1 ) w m ⁡ ( 2 ⁢ , ⁢ 1 ) w m ⁡ ( 3 ⁢ , ⁢ 1 ) w m ⁡ ( 0 ⁢ , ⁢ 2 ) w m ⁡ ( 1 ⁢ , ⁢ 2 ) w m ⁡ ( 2 ⁢ , ⁢ 2 ) w m ⁡ ( 3 ⁢ , ⁢ 2 ) w m ⁡ ( 0 ⁢ , ⁢ 3 ) w m ⁡ ( 1 ⁢ , ⁢ 3 ) w m ⁡ ( 2 ⁢ , ⁢ 3 ) w m ⁡ ( 3 ⁢ , ⁢ 3 )
p(y, x) = w4 (y, x) p4 (y, x) + w13 (y, x) p13 (y, x)
w4 (y, x) = 1 − w13 (y, x)
Mode 5 and Mode 14
w m ⁡ ( 0 ⁢ , ⁢ 0 ) w m ⁡ ( 1 ⁢ , ⁢ 0 ) w m ⁡ ( 2 ⁢ , ⁢ 0 ) w m ⁡ ( 3 ⁢ , ⁢ 0 ) w m ⁡ ( 0 ⁢ , ⁢ 1 ) w m ⁡ ( 1 ⁢ , ⁢ 1 ) w m ⁡ ( 2 ⁢ , ⁢ 1 ) w m ⁡ ( 3 ⁢ , ⁢ 1 ) w m ⁡ ( 0 ⁢ , ⁢ 2 ) w m ⁡ ( 1 ⁢ , ⁢ 2 ) w m ⁡ ( 2 ⁢ , ⁢ 2 ) w m ⁡ ( 3 ⁢ , ⁢ 2 ) w m ⁡ ( 0 ⁢ , ⁢ 3 ) w m ⁡ ( 1 ⁢ , ⁢ 3 ) w m ⁡ ( 2 ⁢ , ⁢ 3 ) w m ⁡ ( 3 ⁢ , ⁢ 3 )
p(y, x) = w5 (y, x) p5 (y, x) + w14 (y, x) p14 (y, x)
w5 (y, x) = 1 − w14 (y, x)
Mode 6 and Mode 15
w m ⁡ ( 0 ⁢ , ⁢ 0 ) w m ⁡ ( 1 ⁢ , ⁢ 0 ) w m ⁡ ( 2 ⁢ , ⁢ 0 ) w m ⁡ ( 3 ⁢ , ⁢ 0 ) w m ⁡ ( 0 ⁢ , ⁢ 1 ) w m ⁡ ( 1 ⁢ , ⁢ 1 ) w m ⁡ ( 2 ⁢ , ⁢ 1 ) w m ⁡ ( 3 ⁢ , ⁢ 1 ) w m ⁡ ( 0 ⁢ , ⁢ 2 ) w m ⁡ ( 1 ⁢ , ⁢ 2 ) w m ⁡ ( 2 ⁢ , ⁢ 2 ) w m ⁡ ( 3 ⁢ , ⁢ 2 ) w m ⁡ ( 0 ⁢ , ⁢ 3 ) w m ⁡ ( 1 ⁢ , ⁢ 3 ) w m ⁡ ( 2 ⁢ , ⁢ 3 ) w m ⁡ ( 3 ⁢ , ⁢ 3 )
p(y, x) = w6 (y, x) p6 (y, x) + w15 (y, x) p15 (y, x)
w6 (y, x) = 1 − w15 (y, x)
Mode 7 and Mode 16
w m ⁡ ( 0 ⁢ , ⁢ 0 ) w m ⁡ ( 1 ⁢ , ⁢ 0 ) w m ⁡ ( 2 ⁢ , ⁢ 0 ) w m ⁡ ( 3 ⁢ , ⁢ 0 ) w m ⁡ ( 0 ⁢ , ⁢ 1 ) w m ⁡ ( 1 ⁢ , ⁢ 1 ) w m ⁡ ( 2 ⁢ , ⁢ 1 ) w m ⁡ ( 3 ⁢ , ⁢ 1 ) w m ⁡ ( 0 ⁢ , ⁢ 2 ) w m ⁡ ( 1 ⁢ , ⁢ 2 ) w m ⁡ ( 2 ⁢ , ⁢ 2 ) w m ⁡ ( 3 ⁢ , ⁢ 2 ) w m ⁡ ( 0 ⁢ , ⁢ 3 ) w m ⁡ ( 1 ⁢ , ⁢ 3 ) w m ⁡ ( 2 ⁢ , ⁢ 3 ) w m ⁡ ( 3 ⁢ , ⁢ 3 )
p(y, x) = w7 (y, x) p7 (y, x) + w16 (y, x) p16 (y, x)
w7 (y, x) = 1 − w16 (y, x)
Mode 8 and Mode 17
w m ⁡ ( 0 ⁢ , ⁢ 0 ) w m ⁡ ( 1 ⁢ , ⁢ 0 ) w m ⁡ ( 2 ⁢ , ⁢ 0 ) w m ⁡ ( 3 ⁢ , ⁢ 0 ) w m ⁡ ( 0 ⁢ , ⁢ 1 ) w m ⁡ ( 1 ⁢ , ⁢ 1 ) w m ⁡ ( 2 ⁢ , ⁢ 1 ) w m ⁡ ( 3 ⁢ , ⁢ 1 ) w m ⁡ ( 0 ⁢ , ⁢ 2 ) w m ⁡ ( 1 ⁢ , ⁢ 2 ) w m ⁡ ( 2 ⁢ , ⁢ 2 ) w m ⁡ ( 3 ⁢ , ⁢ 2 ) w m ⁡ ( 0 ⁢ , ⁢ 3 ) w m ⁡ ( 1 ⁢ , ⁢ 3 ) w m ⁡ ( 2 ⁢ , ⁢ 3 ) w m ⁡ ( 3 ⁢ , ⁢ 3 )
p(y, x) = w8 (y, x) p8 (y, x) + w17 (y, x) p17 (y, x)
w8 (y, x) = 1 − w17 (y, x)
Weights
					Mode 0	Mode 9
					w0 (y, x)	w9 (y, x)
	4 5 4 5 4 5 4 5 3 5 3 5 3 5 3 5 2 5 2 5 2 5 2 5 1 5 1 5 1 5 1 5 ⁢ ⁢ 1 5 1 5 1 5 1 5 2 5 2 5 2 5 2 5 3 5 3 5 3 5 3 5 4 5 4 5 4 5 4 5
					Mode 1	Mode 10
					w1 (y, x)	w10 (y, x)
	4 5 3 5 2 5 1 5 4 5 3 5 2 5 1 5 4 5 3 5 2 5 1 5 4 5 3 5 2 5 1 5 ⁢ ⁢ 1 5 2 5 3 5 4 5 1 5 2 5 3 5 4 5 1 5 2 5 3 5 4 5 1 5 2 5 3 5 4 5
					Mode 3	Mode 12
					w3 (y, x)	w12 (y, x)
	4 8 5 8 6 8 7 8 3 8 4 8 5 8 6 8 2 8 3 8 4 8 5 8 1 8 2 8 3 8 4 8 ⁢ ⁢ 4 8 3 8 2 8 1 8 5 8 4 8 3 8 2 8 6 8 5 8 4 8 3 8 7 8 6 8 5 8 4 8
					Mode 4	Mode 13
					w4 (y, x)	w13 (y, x)
	7 8 6 8 5 8 4 8 6 8 5 8 4 8 3 8 5 8 4 8 3 8 2 8 4 8 3 8 2 8 1 8 ⁢ ⁢ 1 8 2 8 3 8 4 8 2 8 3 8 4 8 5 8 3 8 4 8 5 8 6 8 4 8 5 8 6 8 7 8
					Mode 5	Mode 14
					w5 (y, x)	w14 (y, x)
	10 12 9 12 8 12 7 12 8 12 7 12 6 12 5 12 6 12 5 12 4 12 3 12 4 12 3 12 2 12 1 12 ⁢ ⁢ 2 12 3 12 4 12 5 12 4 12 5 12 6 12 7 12 6 12 7 12 8 12 9 12 8 12 9 12 10 12 11 12
					Mode 6	Mode 15
					w6 (y, x)	w15 (y, x)
	10 12 8 12 6 12 4 12 9 12 7 12 5 12 3 12 8 12 6 12 4 12 2 12 7 12 5 12 3 12 1 12 ⁢ ⁢ 2 12 4 12 6 12 8 12 3 12 5 12 7 12 9 12 4 12 6 12 8 12 10 12 5 12 7 12 9 12 11 12
					Mode 7	Mode 16
					w7 (y, x)	w16 (y, x)
	7 12 8 12 9 12 10 12 5 12 6 12 7 12 8 12 3 12 4 12 5 12 6 12 1 12 2 12 3 12 4 12 ⁢ ⁢ 5 12 4 12 3 12 2 12 7 12 6 12 5 12 4 12 9 12 8 12 7 12 6 12 11 12 10 12 9 12 8 12
					Mode 8	Mode 17
					w8 (y, x)	w17 (y, x)
	7 12 5 12 3 12 1 12 8 12 6 12 4 12 2 12 9 12 7 12 5 12 3 12 10 12 8 12 6 12 4 12 ⁢ ⁢ 5 12 7 12 9 12 11 12 4 12 6 12 8 12 10 12 3 12 5 12 7 12 9 12 2 12 4 12 6 12 8 12

[0149] In some embodiments of the present invention, an encoder may perform RDO mode selection between the modified previously existing nine modes (mode 0-mode 8), the nine opposite directional modes (mode 9-mode 17) and the weighted interpolated modes.

[0150] In some embodiments, to save the overhead of mode signaling, nine modes may be used and weighted interpolated modes may be used when available.

[0151] In alternative embodiments of the present invention, the modified previously existing nine modes (mode 0-mode 8) and the nine opposite directional modes (mode 9-mode 17) may be used. One additional bit, also referred to as a flag, may be used to signal whether the mode is one of the previously existing nine modes or one of the opposite directional modes. In some embodiments of the present invention, the bit value, also referred to as the flag value, may not be signaled for every block. In these embodiments, the flag value may be predicted from the flag values of neighboring blocks within the currently processed plurality of blocks in the macroblock partition. In other embodiments, the flag value may be predicted from the flag values of neighboring blocks in pluralities of blocks that also use a flag value to signal alternative intra-prediction modes. By way of illustration, a first plurality of blocks within a macroblock may not use a flag value to signal alternative intra-prediction modes, while a second plurality of blocks within a macroblock may use a flag value to signal alternative intra-prediction modes. In alternative embodiments, the flag value may be predicted from the nearest block that uses a flag value. In yet alternative embodiments, the flag value may be predicted from the nearest block, in the horizontal direction, that uses a flag value and the nearest block, in the vertical direction, that uses a flag value. In still alternative embodiments, the flag value may be predicted using the nearest block in a neighboring macroblock that uses a flag value. In further alternative embodiments, the flag value may be predicted using the nearest block that uses a flag value in the macroblock that is the left neighbor of the current macroblock. In other embodiments, the flag value may be predicted using the nearest block in the macroblock that uses a flag value in the macroblock that is the upper neighbor of the current macroblock. In some embodiments of the present invention, the flag value may be predicted from the same blocks used for mode prediction. In some embodiments of the present invention, an encoder may signal whether or not a predicted flag value is correct or not. In some embodiments of the present invention, a decoder may decode information from a received bitstream as to whether or not a predicted flag value is correct or not.

[0152] In yet alternative embodiments of the present invention, the modified previously existing nine modes (mode 0-mode 8) and the weighted interpolated modes may be used. An additional bit, also referred to as a flag, may be used to signal whether the mode is one of the modified previously existing nine modes or one of the weighted interpolated modes. In some embodiments of the present invention, the bit value, also referred to as the flag value, may not be signaled for every block. In these embodiments, the flag value may be predicted from the flag values of neighboring blocks within the currently processed plurality of blocks in the macroblock partition. In other embodiments, the flag value may be predicted from the flag values of neighboring blocks in pluralities of blocks that also use a flag value to signal alternative intra-prediction modes. By way of illustration, a first plurality of blocks within a macroblock may not use a flag value to signal alternative intra-prediction modes, while a second plurality of blocks within a macroblock may use a flag value to signal alternative intra-prediction modes. In alternative embodiments, the flag value may be predicted from the nearest block that uses a flag value. In yet alternative embodiments, the flag value may be predicted from the nearest block, in the horizontal direction, that uses a flag value and the nearest block, in the vertical direction, that uses a flag value. In still alternative embodiments, the flag value may be predicted using the nearest block in a neighboring macroblock that uses a flag value. In further alternative embodiments, the flag value may be predicted using the nearest block that uses a flag value in the macroblock that is the left neighbor of the current macroblock. In other embodiments, the flag value may be predicted using the nearest block in the macroblock that uses a flag value in the macroblock that is the upper neighbor of the current macroblock. In some embodiments of the present invention, the flag value may be predicted from the same blocks used for mode prediction. In some embodiments of the present invention, an encoder may signal whether or not a predicted flag value is correct or not. In some embodiments of the present invention, a decoder may decode information from a received bitstream as to whether or not a predicted flag value is correct or not.

[0153] In yet alternative embodiments of the present invention, the opposite directional modes (mode 9-mode 17) and the weighted interpolated modes may be used. An additional bit, also referred to as a flag, may be used to signal whether the mode is one of the modified previously existing nine modes or one of the weighted interpolated modes. In some embodiments of the present invention, the bit value, also referred to as the flag value, may not be signaled for every block. In these embodiments, the bit value may be predicted from the bit values of neighboring blocks within the currently processed plurality of blocks in the macroblock partition. In other embodiments, the flag value may be predicted from the flag values of neighboring blocks in pluralities of blocks that also use a flag value to signal alternative intra-prediction modes. By way of illustration, a first plurality of blocks within a macroblock may not use a flag value to signal alternative intra-prediction modes, while a second plurality of blocks within a macroblock may use a flag value to signal alternative intra-prediction modes. In alternative embodiments, the flag value may be predicted from the nearest block that uses a flag value. In yet alternative embodiments, the flag value may be predicted from the nearest block, in the horizontal direction, that uses a flag value and the nearest block, in the vertical direction, that uses a flag value. In still alternative embodiments, the flag value may be predicted using the nearest block in a neighboring macroblock that uses a flag value. In further alternative embodiments, the flag value may be predicted using the nearest block that uses a flag value in the macroblock that is the left neighbor of the current macroblock. In other embodiments, the flag value may be predicted using the nearest block in the macroblock that uses a flag value in the macroblock that is the upper neighbor of the current macroblock. In some embodiments of the present invention, the flag value may be predicted from the same blocks used for mode prediction. In some embodiments of the present invention, an encoder may signal whether or not a predicted flag value is correct or not. In some embodiments of the present invention, a decoder may decode information from a received bitstream as to whether or not a predicted flag value is correct or not.

[0154] In yet alternative embodiments of the present invention, pixel values may be predicted using weighted interpolation of any two independent intra modes.

[0155] In some embodiments of the present invention a mode may be numbered between “0” and “8.” In these embodiments, the mode prediction of the first set of intra blocks will not be affected by the mode numbering. Table 3 shows exemplary syntax for intra 4×4 prediction. The italicized text is a new addition, to the existing H.264/AVC syntax, in accordance with embodiments of the present invention.

[0156]

TABLE 3
Example syntax table for parallel intra 4×4 prediction
	C	Descriptor
mb_pred(mb_type)
...................
	if( MbPartPredMode( mb_type, 0 ) = = Intra_4×4) {
	MB—has—weighted—intra—block—flag	2	u(1) | ae(v)
	for( luma4×4BlkIdx=0; luma4×4BlkIdx<16;
luma4×4BlkIdx++ ) {
	If (!MB—has—weighted—intra—block—flag ||
	!weighted—intra—possible(luma4×4BlkIdx)) {
	prev_intra4×4_pred_mode_flag[ luma4×4BlkIdx ]	2	u(1) | ae(v)
	if( !prev_intra4×4_pred_mode_flag[ luma4×4BlkIdx ] )
	rem_intra4×4_pred_mode[ luma4×4BlkIdx ]	2	u(3) | ae(v)
	} else {
	intra4×4—pred—weighted—flag[ luma4×4BlkIdx ]	2	u(1) | ae(v)
	prev_intra4×4_pred_mode_flag[ luma4×4BlkIdx ]	2	u(1) | ae(v)
	if( !prev_intra4×4_pred_mode_flag[ luma4×4BlkIdx ] )
	rem_intra4×4_pred_mode[ luma4×4BlkIdx ]	2	u(3) | ae(v)
	}
	}

[0157] The flag “MB_has_weighted_intra_block_flag” may specify whether any block in the Macroblock uses the weighted intra prediction mode. If “MB_has_weighted_intra_block_flag” is equal to 0, then no block in the Macroblock uses weighted intra prediction mode. If the flag “MB_has_weighted_intra_block_flag” is equal to 1, then the Macroblock contains at least one block that uses weighted intra prediction mode.

[0158] The flag “intra4×4_pred_weighted_flag” may specify whether an intra4×4 prediction mode is the weighted intra-prediction mode. This flag may only be present when “MB_has_weighted_intra_block_flag” is equal to 1 and the 4×4 block is in a position it which it is possible to have the weighted intra prediction mode. Blocks that can possibly have the weighted intra prediction mode may be blocks in the second set of blocks except block 15 which does not have right and bottom neighbors. If the flag “intra4×4_pred_weighted_flag” is equal to 0, then the intra-prediction mode of the block may be the original intra prediction mode which is predicted from upper and left neighbors. If the flag “intra4×4_pred_weighted_flag” is equal to 1, then the intra prediction mode of the block may be the weighted intra-prediction mode, which predicts the block values using a weighted combination between a prediction from the upper and left neighbors and a prediction from the bottom and right neighbors. In some embodiments of the present invention, the flag value may not be signaled for every block. In these embodiments, the flag value may be predicted from the flag values of neighboring blocks within the currently processed plurality of blocks in the macroblock partition. In other embodiments, the flag value may be predicted from the flag values of neighboring blocks in pluralities of blocks that also use a flag value to signal alternative intra-prediction modes. By way of illustration, a first plurality of blocks within a macroblock may not use a flag value to signal alternative intra-prediction modes, while a second plurality of blocks within a macroblock may use a flag value to signal alternative intra-prediction modes. In alternative embodiments, the flag value may be predicted from the nearest block that uses a flag value. In yet alternative embodiments, the flag value may be predicted from the nearest block, in the horizontal direction, that uses a flag value and the nearest block, in the vertical direction, that uses a flag value. In still alternative embodiments, the flag value may be predicted using the nearest block in a neighboring macroblock that uses a flag value. In further alternative embodiments, the flag value may be predicted using the nearest block that uses a flag value in the macroblock that is the left neighbor of the current macroblock. In other embodiments, the flag value may be predicted using the nearest block in the macroblock that uses a flag value in the macroblock that is the upper neighbor of the current macroblock. In some embodiments of the present invention, the flag value may be predicted from the same blocks used for mode prediction. In some embodiments of the present invention, an encoder may signal whether or not a predicted flag value is correct or not. In some embodiments of the present invention, a decoder may decode information from a received bitstream as to whether or not a predicted flag value is correct or not.

[0159] In some embodiments of the present invention, the intra-prediction mode, Intra4×4 PredMode[luma4×4BlkIdx], for a block may be derived according to the following pseudo code:

[0160]

predIntra4x4PredMode = Min( intraMxMPredModeA,
intraMxMPredModeB )
if( prev_intra4x4_pred_mode_flag[ luma4x4BlkIdx ] )
Intra4x4PredMode[ luma4x4BlkIdx ] = predIntra4x4PredMode
else
if( rem_intra4x4_pred_mode[ luma4x4BlkIdx ]
< predIntra4x4PredMode )
Intra4x4PredMode[ luma4x4BlkIdx ] = rem_intra4x4_pred_mode[
luma4x4BlkIdx ]
else
Intra4x4PredMode[ luma4x4BlkIdx ] = rem_intra4x4_pred_mode[
luma4x4BlkIdx ] + 1.

[0161] Where in the pseudo code, intraM×MPredModeA and Intra M×MPredModeB are the prediction modes of a first and a second neighboring block, for which the intra-prediction mode is available, and prev_intra4×4_pred_mode_flag[luma4×4BlkIdx] and rem_intra4×4_pred_mode[luma4×4BlkIdx] specify the Intra_—4×4 prediction of the 4×4 luma block with index luma4×4BlkIdx=0, . . . , 15.

[0162] An available intra-prediction mode may refer to the intra-prediction mode for a block for which an intra-prediction mode has been determined. An available block may refer to a block for which an intra-prediction mode has been determined.

[0163] In some embodiments of the present invention, residual data of the first set of blocks and the second set of blocks may be signaled as specified in H.264/AVC and other video standards. In alternative embodiments of the present invention, the residual data may be signaled in block-coding order. For example, in some embodiments, the residuals of the first set of blocks may be sent in the bitstream first, and the residuals of the second set of blocks may be subsequently sent in the bitstream In some of these embodiments, the decoder may start reconstructing the first set of blocks immediately after entropy decoding the residual data. Some embodiments of the present invention may comprise a bit flag “parallelResidualSignaling” which may specify whether the residual data of the first set of blocks and the second set of intra 4×4 block are sent separately. The flag “If the flag “parallelResidualSignaling” is equal to 0, then the residual data of the Macroblock may be sent as one Macroblock as specified in H.264/AVC. If the flag “parallelResidualSignaling” is equal to 1, then the residual data of the first set of intra 4×4 blocks in a Macroblock may be sent first, and the residual data of the second set of parallel intra 4×4 blocks may be sent subsequently. Table 4 lists exemplary syntax comprising the flag “parallelResidualSignaling.” The flag bit “parallelResidualSignaling” may be sent in the sequence parameter set in some embodiments of the present invention. In alternative embodiments, the flag bit “parallelResidualSignaling” may be sent in the picture parameter set.

[0164]

TABLE 4
Example syntax table for parallel intra
4×4 prediction residual signaling
	C	Descriptor
residual( ) {
........
if( MbPartPredMode( mb_type, 0 ) = = Intra_4×4
	&& parallelResidualSignaling ) {
	for( 4×4 block in 1st set of blocks) {
	residual_block( )
	}
	for( 4×4 block in 2nd set of blocks) {
	residual_block( )
	}
}
......

[0165] In some embodiments of the present invention, the prediction modes for a plurality of blocks may be signaled interleaved with the block residuals. In alternative embodiments, the prediction modes may be signaled for all of the blocks within the plurality of blocks prior to the signaling of the residuals for the blocks within the plurality of blocks.

[0166] In some embodiments of the present invention, an encoder may determine a macroblock partition and signal the partition choice in a bitstream. In alternative embodiments, an encoder may use a default partition.

[0167] In some embodiments of the present invention, a decoder may decode, from a bitstream, information identifying a macroblock partition. In alternative embodiments, a partition may be determined at a decoder to be a default partition.

[0168] Some embodiments of the present invention may comprise a computer program product comprising a computer-readable storage medium having instructions stored thereon/in which may be used to program a computing system to perform any of the features and methods described herein. Exemplary computer-readable storage media may include, but are not limited to, flash memory devices, disk storage media, for example, floppy disks, optical disks, magneto-optical disks, Digital Versatile Discs (DVDs), Compact Discs (CDs), micro-drives and other disk storage media, Read-Only Memory (ROMs), Programmable Read-Only Memory (PROMs), Erasable Programmable Read-Only Memory (EPROMS), Electrically Erasable Programmable Read-Only Memory (EEPROMs), Random-Access Memory (RAMS), Video Random-Access Memory (VRAMs), Dynamic Random-Access Memory (DRAMs) and any type of media or device suitable for storing instructions and/or data.

[0169] The terms and expressions which have been employed in the foregoing specification are used therein as terms of description and not of limitation, and there is no intention in the use of such terms and expressions of excluding equivalence of the features shown and described or portions thereof, it being recognized that the scope of the invention is defined and limited only by the claims which follow.