Methods and apparatus for entropy decoding are disclosed. Compressed input data representing one or more signals is loaded into one or more registers. A first candidate value for a most probable signal case is prepared from the input data. A second candidate value for a least probable signal case is prepared from the input data. A final signal value for the one or more signals is selected from the first and second candidate values and an output bin value is generated based on the final signal value. A processor readable medium having embodied therein processor readable instructions for implementing the method for entropy decoding is also disclosed. In addition, a method of avoiding a branch instruction in an electronic processing algorithm is disclosed.
|
1. A method for entropy decoding, comprising:
loading compressed input data representing one or more signals into one or more registers of a processing module;
preparing a first candidate value for a most probable signal case from the input data with the processing module;
preparing a second candidate value for a least probable signal case from the input data with the processing module independently of preparing the first candidate value,
wherein the preparation of the first candidate value does not require the preparation of the second candidate value and vice versa;
selecting a final signal value for the one or more signals from the first and second candidate values; and
generating an output bin value based on the final signal value.
29. A processor non-transitory computer readable medium having embodied therein processor readable instructions for implementing a method for entropy decoding, the method comprising:
loading compressed input data representing one or more signals into one or more registers;
preparing a first candidate value for a most probable signal case from the input data;
preparing a second candidate value for a least probable signal case from the input data independently of preparing the first candidate value,
wherein the preparation of the first candidate value does not require the preparation of the second candidate value and vice versa;
selecting a final signal value for the one or more signals from the first and second candidate values; and
generating an output bin value based on the final signal value.
18. An apparatus for entropy decoding, comprising:
a processor module having a processor with one or more registers;
a memory operably coupled to the processor; and
a set of processor executable instructions adapted for execution by the processor, the processor executable instructions including:
one or more instructions that when executed on the processor load compressed input data representing one or more signals into the one or more registers from the memory;
one or more instructions that when executed on the processor prepare a first candidate value for a most probable signal case from the input data;
one or more instructions that when executed on the processor prepare a second candidate value for a least probable signal case from the input data independently of preparing the first candidate value,
wherein the preparation of the first candidate value does not require the preparation of the second candidate value and vice versa;
one or more instructions that when executed on the processor select a final signal value for the one or more signals from the first and second candidate values; and
one or more instructions that when executed on the processor generate an output bin value based on the final signal value.
2. The method of
3. The method of
a first set of bits representing a codIRange value,
a second set of bits representing a codIOffset value; and
a third set of bits representing the contents of an input stream buffer.
4. The method of
5. The method of
a first set of bits representing a Context_MPS Address,
a second set of bits representing a plurality of possible codIRangeLPS values,
a third set of bits representing a Context_LPS Address,
a fourth set of bits representing a bin_MPS value; and
a fifth set of bits representing a bin_LPS value.
6. The method of
7. The method of
8. The method of
9. The method of
10. The method of
11. The method of
12. The method of
13. The method of
14. The method of
generating a selection mask based on whether a value of a codIRange from the input data is less than a value of a codIOffset from the input data and selecting the final signal value from the first and second candidate values using the selection mask.
15. The method of
16. The method of
preparing the first and second candidate values, selecting the final signal value and
generating the output bin value are implemented on an SPE of a cell processor.
17. The method of
preparing the first and second candidate values, selecting the final signal value and
generating the output bin value are implemented on a microprocessor that utilizes a single instruction multiple data (SIMD) capability.
20. The apparatus of
21. The apparatus of
22. The apparatus of
23. The apparatus of
a first set of bits representing a codIRange value,
a second set of bits representing a codIOffset value; and
a third set of bits representing the contents of an input stream buffer.
24. The apparatus of
25. The apparatus of
a first set of bits representing a Context_MPS Address,
a second set of bits representing a plurality of possible codIRangeLPS values,
a third set of bits representing a Context_LPS Address,
a fourth set of bits representing a bin_MPS value; and
a fifth set of bits representing a bin_LPS value.
26. The apparatus of
27. The apparatus of
28. The apparatus of
|
|||||||||||||||||||||||||||||||||||
This application claims the benefit of priority provisional application No. 60/823,605, to Shan Liu, Jason Wang and Milan Mehta, entitled “SYSTEM AND METHODS FOR DETECTING AND HANDLING ERRORS IN A MULTI-THREADED VIDEO DATA DECODER” filed Aug. 25, 2006, the entire disclosures of which are incorporated herein by reference.
This application claims the benefit of priority provisional application No. 60/823,613, to Shan Liu, entitled “METHODS AND APPARATUS FOR CONCEALING CORRUPTED BLOCKS OF VIDEO DATA” filed Aug. 25, 2006, the entire disclosures of which are incorporated herein by reference.
This application claims the benefit of priority provisional application No. 60/823,620, to Xun Xu, entitled “ENTROPY DECODING METHODS AND APPARATUS”, filed Aug. 25, 2006, the entire disclosures of which are incorporated herein by reference.
This application claims the benefit of priority co-pending commonly assigned U.S. patent application Ser. No. 11/844,319, to Xun Xu, entitled “ENTROPY DECODING METHODS AND APPARATUS USING MOST PROBABLE AND LEAST PROBABLE SIGNAL CASES”, filed Aug. 23, 2007, the entire disclosures of which are incorporated herein by reference.
This application is related to provisional application No. 60/823,605, to Shan Liu, Jason Wang and Milan Mehta, entitled “SYSTEM AND METHODS FOR DETECTING AND HANDLING ERRORS IN A MULTITHREADED VIDEO DATA DECODER” filed Aug. 25, 2006, the entire disclosures of which are incorporated herein by reference.
This application claims the benefit of priority provisional application No. 60/823,613, to Shan Liu, entitled “METHODS AND APPARATUS FOR CONCEALING CORRUPTED BLOCKS OF VIDEO DATA” filed Aug. 25, 2006, the entire disclosures of which are incorporated herein by reference.
This application is related to commonly-assigned, co-pending application Ser. No. 11/844,287, to Shan Liu, Jason Wang and Milan Mehta, entitled “SYSTEM AND METHODS FOR DETECTING AND HANDLING ERRORS IN A MULTI-THREADED VIDEO DATA DECODER”, filed Aug. 23, 2007, the entire disclosures of which are incorporated herein by reference.
This application is related commonly-assigned, co-pending application Ser. No. 11/844,302, to Shan Liu, entitled “METHODS AND APPARATUS FOR CONCEALING CORRUPTED BLOCKS OF VIDEO DATA”, filed Aug. 23, 2007, the entire disclosures of which are incorporated herein by reference.
Embodiments of the present invention are related to streaming media and more particularly to entropy decoding of streaming media.
Digital signal compression using a coder/decoder (codec) allows streaming media, such as audio or video signals to be transmitted over the Internet or stored on compact discs. A number of different codecs have been developed that follow various compression standards. MPEG-4 AVC (Advanced Video Coding), also known as H.264, is a video compression standard that offers significantly greater compression than its predecessors. The H.264 standard is expected to offer up to twice the compression of the earlier MPEG-2 standard. The H.264 standard is also expected to offer improvements in perceptual quality. As a result, more and more video content is being delivered in the form of AVC(H.264)-coded streams. Two rival DVD formats, the HD-DVD format and the Blu-Ray Disc format support H.264/AVC High Profile decoding as a mandatory player feature. AVC(H.264) coding is described in detail in “Draft of Version 4 of H.264/AVC (ITU-T Recommendation H.264 and ISO/IEC 14496-10 (MPEG-4 part 10) Advanced Video Coding)” by Gary Sullivan, Thomas Wiegand and Ajay Luthra, Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG (ISO/IEC JTC1/SC29/WG11 and ITU-T SG16 Q.6), 14th Meeting: Hong Kong, CH 18-21 January, 2005, the entire contents of which are incorporated herein by reference for all purposes.
AVC(H.264), like many other codecs uses a layer of encoding referred to as entropy encoding. Entropy encoding is a coding scheme that assigns codes to signals so as to match code lengths with the probabilities of the signals. Typically, entropy encoders are used to compress data by replacing symbols represented by equal-length codes with symbols represented by codes proportional to the negative logarithm of the probability. AVC(H.264) supports 2 entropy encoding schemes, Context Adaptive Variable Length Coding (CAVLC) and Context Adaptive Binary Arithmetic Coding (CABAC). Since CABAC tends to offer about 10% more compression than CAVLC, CABAC is favored by many video encoders in generating AVC(H.264) bitstreams. Decoding the entropy layer of AVC(H.264)-coded data streams can be computationally intensive and may present challenges for devices that decode AVC(H.264)-coded bitstreams using general purpose microprocessors. To decode high bit-rate streams targeted by the Blu-ray or the HD-DVD standards, the hardware needs to be very fast and complex, and the overall system cost could be really high. One common solution to this problem is to design special hardware for CABAC decoding. However, such special hardware can increase the cost of devices such as DVD players, game consoles, and the like that need to decode AVC(H.264)-encoded bitstreams.
The Cell is a general purpose microprocessor and media processor jointly developed by Sony, Toshiba and IBM. The basic configuration of a current generation of the Cell is composed of 1 “Power Processor Element” (“PPE”), and 8 “Synergistic Processing Elements” (“SPE”). An SPE is a Reduced Instruction Set Computing (RISC) processor with 128-bit Single Instruction Multiple Data (SIMD) organization for single and double precision instructions. At 3.2 GHz, each SPE gives a theoretical 25.6 billion floating point operations per second (GFLOPS) of performance, which largely dwarfs the abilities of the SIMD unit in typical desktop CPUs like the Pentium 4 and the Athlon 64. This computing power makes a Cell processor potentially capable of decoding AVC (H.264) high definition streams in real time alone without any help from other hardware.
The Cell's enormous computing power may be attributed to the SIMD structure in SPEs. However, the SIMD structure becomes effective only when the algorithm that utilizes the SPEs is parallelizable. Since the process of CABAC decoding is genetically sequential, the speedup offered by SIMD has not heretofore been utilized to its fullest potential. While traditional performance bottlenecks like inverse discrete cosine transformation (IDCT) may be eliminated by the SIMD structure in SPEs, CABAC decoding presents a potential new bottleneck holding back the overall computational performance of AVC decoding using the Cell. If the task of CABAC decoding is not efficiently carried out, one Cell processor alone would not be able to decode high definition CABAC streams in real time.
It is within this context that embodiments of the present invention arise.
The teachings of the present invention can be readily understood by considering the following detailed description in conjunction with the accompanying drawings, in which:
Although the following detailed description contains many specific details for the purposes of illustration, anyone of ordinary skill in the art will appreciate that many variations and alterations to the following details are within the scope of the invention. Accordingly, the exemplary embodiments of the invention described below are set forth without any loss of generality to, and without imposing limitations upon, the claimed invention.
As used herein the following terms have the following meanings.
adaptive binary arithmetic decoding process: An entropy decoding process that derives the values of bins from a bitstream produced by an adaptive binary arithmetic encoding process.
adaptive binary arithmetic encoding process: An entropy encoding process, not normatively specified in this Recommendation|International Standard, that codes a sequence of bins and produces a bitstream that can be decoded using the adaptive binary arithmetic decoding process.
bin: One bit of a bin string.
binarization: A set of bin strings for all possible values of a syntax element.
binarization process: A unique mapping process of all possible values of a syntax element onto a set of bin strings.
bin string: A string of bins. A bin string is an intermediate binary representation of values of syntax elements from the binarization of the syntax element.
bitstream: A sequence of bits that forms the representation of coded pictures and associated data forming one or more coded video sequences. Bitstream is a collective term used to refer either to a NAL unit stream or a byte stream.
block: An M×N (M-column by N-row) array of samples, or an M×N array of transform coefficients.
bottom field: One of two fields that comprise a frame. Each row of a bottom field is spatially located immediately below a corresponding row of a top field.
bottom macroblock (of a macroblock pair): The macroblock within a macroblock pair that contains the samples in the bottom row of samples for the macroblock pair. For a field macroblock pair, the bottom macroblock represents the samples from the region of the bottom field of the frame that lie within the spatial region of the macroblock pair. For a frame macroblock pair, the bottom macroblock represents the samples of the frame that lie within the bottom half of the spatial region of the macroblock pair.
byte stream: An encapsulation of a NAL unit stream containing start code prefixes and NAL units
can: A term used to refer to behavior that is allowed, but not necessarily required.
coded picture: A coded representation of a picture. A coded picture may be either a coded field or a coded frame. Coded picture is a collective term referring to a primary coded picture or a redundant coded picture, but not to both together.
coded representation: A data element as represented in its coded form.
context variable: A variable specified for the adaptive binary arithmetic decoding process of a bin by an equation containing recently decoded bins.
chroma: An adjective specifying that a sample array or single sample is representing one of the two color difference signals related to the primary colors. NOTE—The term chroma is sometimes used rather than the term chrominance in order to avoid the implication of the use of linear light transfer characteristics that is often associated with the term chrominance.
decoded picture: A decoded picture is derived by decoding a coded picture. A decoded picture is either a decoded frame, or a decoded field. A decoded field is either a decoded top field or a decoded bottom field.
decoded picture buffer (DPB): A buffer holding decoded pictures for reference, output reordering, or output delay specified for the hypothetical reference decoder in Annex C.
decoder: An embodiment of a decoding process.
decoding order: The order in which syntax elements are processed by the decoding process.
decoding process: A process that reads a bitstream and derives decoded pictures from it.
encoder: An embodiment of an encoding process.
encoding process: A process that produces a bitstream.
field: An assembly of alternate rows of a frame. A frame is composed of two fields, a top field and a bottom field.
field macroblock: A macroblock containing samples from a single field. All macroblocks of a coded field are field macroblocks. When macroblock-adaptive frame/field decoding is in use, some macroblocks of a coded frame may be field macroblocks.
field macroblock pair: A macroblock pair decoded as two field macroblocks.
flag: A variable that can take one of the two possible values 0 and 1.
frame: A frame contains an array of luma samples and two corresponding arrays of chroma samples. A frame consists of two fields, a top field and a bottom field.
frame macroblock: A macroblock representing samples from the two fields of a coded frame. When macroblock-adaptive frame/field decoding is not in use, all macroblocks of a coded frame are frame macroblocks. When macroblock-adaptive frame/field decoding is in use, some macroblocks of a coded frame may be frame macroblocks.
frame macroblock pair: A macroblock pair decoded as two frame macroblocks.
informative: A term used to refer to content provided herein that is not an integral part of embodiments of the present invention. Informative content does not establish any mandatory requirements any embodiment of the present invention.
instantaneous decoding refresh (IDR) access unit: An access unit in which the primary coded picture is an IDR picture. NO
inverse transform: A part of the decoding process by which a set of transform coefficients are converted into spatial-domain values, or by which a set of transform coefficients are converted into DC transform coefficients.
layer: One of a set of syntactical structures in a non-branching hierarchical relationship. Higher layers contain lower layers. Examples of coding layers are the coded video sequence, picture, slice, and macroblock layers.
luma: An adjective specifying that a sample array or single sample is representing the monochrome signal related to the primary colors. NOTE—The term luma is sometimes used rather than the term luminance in order to avoid the implication of the use of linear light transfer characteristics that is often associated with the term luminance.
Macroblock (MB): A 16×16 block of luma samples and two corresponding blocks of chroma samples. The division of a slice or a macroblock pair into macroblocks is a partitioning.
macroblock-adaptive frame/field decoding: A decoding process for coded frames in which some macroblocks may be decoded as frame macroblocks and others may be decoded as field macroblocks.
macroblock pair: A pair of vertically contiguous macroblocks in a frame that is coupled for use in macroblock-adaptive frame/field decoding. The division of a slice into macroblock pairs is a partitioning.
macroblock partition: A block of luma samples and two corresponding blocks of chroma samples resulting from a partitioning of a macroblock for inter prediction.
may: A term used to refer to behavior that is allowed, but not necessarily required.
motion vector: A two-dimensional vector used for inter prediction that provides an offset from the coordinates in the decoded picture to the coordinates in a reference picture.
must: A term used in expressing an observation about a requirement or an implication of a requirement that is specified elsewhere in this application. This term is used exclusively in an informative context.
NAL unit: A syntax structure containing an indication of the type of data to follow and bytes containing that data in the form of an RBSP interspersed as necessary with emulation prevention bytes.
NAL unit stream: A sequence of NAL units.
note: A term used to prefix informative remarks. This term is used exclusively in an informative context.
picture: A collective term for a field or a frame.
raster scan: A mapping of a rectangular two-dimensional pattern to a one-dimensional pattern such that the first entries in the one-dimensional pattern are from the first top row of the two-dimensional pattern scanned from left to right, followed similarly by the second, third, etc. rows of the pattern (going down) each scanned from left to right.
raw byte sequence payload (RBSP): A syntax structure containing an integer number of bytes that is encapsulated in a NAL unit. An RBSP is either empty or has the form of a string of data bits containing syntax elements followed by an RBSP stop bit and followed by zero or more subsequent bits equal to 0.
raw byte sequence payload (RBSP) stop bit: A bit equal to 1 present within a raw byte sequence payload (RBSP) after a string of data bits. The location of the end of the string of data bits within an RBSP can be identified by searching from the end of the RBSP for the RBSP stop bit, which is the last non-zero bit in the RBSP.
should: A term used to refer to behavior that is encouraged to be followed under anticipated ordinary circumstances, but is not a mandatory requirement for an embodiment of the present invention.
slice: An integer number of macroblocks or macroblock pairs ordered consecutively in the raster scan within a particular slice group.
slice data partitioning: A method of partitioning selected syntax elements into syntax structures based on a category associated with each syntax element.
slice group: A subset of the macroblocks or macroblock pairs of a picture.
slice header: A part of a coded slice containing the data elements pertaining to the first or all macroblocks represented in the slice.
start code prefix: A unique sequence of three bytes equal to 0×000001 embedded in the byte stream as a prefix to each NAL unit. The location of a start code prefix can be used by a decoder to identify the beginning of a new NAL unit and the end of a previous NAL unit.
string of data bits (SODB): A sequence of some number of bits representing syntax elements present within a raw byte sequence payload prior to the raw byte sequence payload stop bit.
sub-macroblock: One quarter of the samples of a macroblock, i.e., an 8×8 luma block and two corresponding chroma blocks of which one corner is located at a corner of the macroblock. MAYBE
syntax element: An element of data represented in the bitstream.
syntax structure: Zero or more syntax elements present together in the bitstream in a specified order.
top field: One of two fields that comprise a frame. Each row of a top field is spatially located immediately above the corresponding row of the bottom field.
top macroblock (of a macroblock pair): The macroblock within a macroblock pair that contains the samples in the top row of samples for the macroblock pair. For a field macroblock pair, the top macroblock represents the samples from the region of the top field of the frame that lie within the spatial region of the macroblock pair. For a frame macroblock pair, the top macroblock represents the samples of the frame that lie within the top half of the spatial region of the macroblock pair.
transform coefficient: A scalar quantity, considered to be in a frequency domain that is associated with a particular one-dimensional or two-dimensional frequency index in an inverse transform part of the decoding process.
transform coefficient level: An integer quantity representing the value associated with a particular two-dimensional frequency index in the decoding process prior to scaling for computation of a transform coefficient value.
variable length coding (VLC): A reversible procedure for entropy coding that assigns shorter bit strings to symbols expected to be more frequent and longer bit strings to symbols expected to be less frequent.
The VCL decoding process 104 involves a process referred to as Entropy Decoding 106, which is used to decode the VCL syntax. This process may be implemented using methods or apparatus according to embodiments of the present invention, e.g., as indicated below. The VCL decoding process may also involve inverse quantization (IQ) and/or inverse discrete cosine transformation (IDCT) as indicated at 108. These processes may decode the headers from macroblocks 109. The decoded headers 109 may be used to assist in VCL decoding of neighboring macroblocks. The MV reconstruction process 110 may involve motion vector reconstruction 112 using headers from a given macroblock 111 and/or its neighbors 113. A motion vector describes apparent motion within an image. Such motion vectors allow reconstruction of an image (or portion thereof) based on knowledge of the pixels of a prior image and the relative motion of those pixels from image to image. Once the motion vector has been recovered pixels may be reconstructed at 116 using a process of pixel prediction based on residual pixels from the VCL decoding 104 and motion vectors from the MV reconstruction process 110. Pixel prediction and reconstruction 118 produces decoded pixels 119 that included neighbor pixels which may be used as inputs to the pixel prediction and reconstruction process 118 for a subsequent macroblock. The de-blocking task group 120 includes a de-blocking stage 122 that produces a decoded picture 124. The decoded picture may provide neighboring pixels for use in de-blocking a neighboring macroblock. In addition, decoded pictures 124 may provide reference pixels for pixel prediction and reconstruction 118 for subsequent macroblocks.
As discussed above, the entropy decoding process 106 may potentially produce a bottleneck and efforts at avoiding such bottlenecks give rise to embodiments of the present invention. The example that follows address the process of decoding an AVC(II.264) data stream that has been entropy coded using CABAC. In the process of decoding an AVC (H.264) CABAC stream, almost all of the bits in the bit-stream are consumed by a CABAC entropy decoder (CED). After each decoding, the CED outputs a binary symbol, called a “bin”, which is the fundamental building block of all syntax elements. These syntax elements include a lot of binary flags, as well as many non-binary values, such as DCT coefficients. While one bin is enough to determine a binary flag, a non-binary value needs to be constructed out of multiple bins.
Statistics show that on average, 1 bit of encoded signal generates roughly 1.7 binary CABAC bins. Also taking into account a 20% computational performance margin, an input of 40 mpbs HD CABAC stream would require the CABAC entropy decoder to decode about 40×1.7×1.2=81.6 million bins per second. Undoubtedly, the efficiency of CABAC entropy decoding (CED) determines how much computational power would be saved for other tasks, such as constructing output video content from the bins. In a worst case, CED could become a performance bottleneck of an entire AVC (H.264) decoder, preventing it from decoding input streams in real time, independent of the efficiency of other parts of the decoding program.
The process of arithmetic decoding such as CABAC decoding typically involves a single CABAC engine and hundreds of bin types. When a specific bin is decoded, the inputs are the CABAC engine, and a context associated with the type the decoded bin belongs to. Bin decoding produces the correct binary bin value. In addition, it is desirable to correctly reset the CABAC engine and the context in preparation for future decoding. To understand the nature of the potential bottleneck associated with CABAC decoding it is useful to explain the conventional flow of such decoding. The flow diagram of
Arithmetic coding is based on the principle of recursive interval subdivision. Given a probability estimation p(0) and p(1)=1−p(0) of a binary decision (0, 1), an initially given code sub-interval with the range codIRange will be subdivided into two sub-intervals having range p(0)*codIRange and codIRange−p(0)*codIRange, respectively. Depending on the decision, which has been observed, the corresponding sub-interval will be chosen as the new code interval, and a binary code string pointing into that interval will represent the sequence of observed binary decisions. It is useful to distinguish between the most probable symbol (MPS) and the least probable symbol (LPS), so that binary decisions may be identified as MPS or LPS, rather than 0 or 1. Given this terminology, each context may be specified by a probability pLPS of the LPS and a value of MPS (valMPS), which is either 0 or 1.
The arithmetic core engine used for decoding AVC(H.264) may be characterized by the following properties. The probability estimation may be performed by means of a finite-state machine with a table-based transition process between 64 different representative probability states {pLPS(pStateIdx)|0<=pStateIdx<64} for the LPS probability pLPS. The numbering of the states may be arranged in such a way that the probability state with index pStateIdx=0 corresponds to an LPS probability value of 0.5, with decreasing LPS probability towards higher state indices. The range codIRange representing the state of the coding engine may be quantized to a small set {Q1, . . . , Q4} of pre-set quantisation values prior to the calculation of the new interval range. Storing a table containing all 64×4 pre-computed product values of Qi*pLPS (pStateIdx) allows a multiplication-free approximation of the product codIRange*pLPS(pStateIdx). For syntax elements or parts thereof for which an approximately uniform probability distribution is assumed to be given a separate simplified encoding and decoding bypass process may be used. An arithmetic decoder may be regarded as a state machine that performs decoding utilizing syntax elements from the bitstream. The state may be reset at the beginning of each slice in the bitstream. A block of picture elements (e.g., pixels) within the slice may be represented in the bitstream by 16 coefficients. In arithmetic decoding, a syntax decoder tries to determine which of the coefficients has a non-zero value. The syntax elements may be regarded as questions asked of the arithmetic decoder. Each question has its own context which answers the question: what is the probability that the answer is 0 or 1?
At each decoding, the values of codIRange and codIOffset are updated. A context table that relates codIRange and codIOffset values to particular is initialized at the beginning of each slice of a picture according to a predetermined formula.
Given the values of qCodIRangeIdx and pStateIdx associated with ctxIdx, the value of the variable rangeTabLPS as specified in a lookup table may be assigned to codIRangeLPS, e.g., by executing the instruction: codIRangeLPS−rangeTabLPS[pStateIdx][qCodIRangeIdx]. An example of the lookup table is Table 9.35 of “Draft of Version 4 of H.264/AVC (ITU-T Recommendation H.264 and ISO/IEC 14496-10 (MPEG-4 part 10) Advanced Video Coding)” by Gary Sullivan, Thomas Wiegand and Ajay Luthra, Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG (ISO/IEC JTC1/SC29/WG11 and ITU-T SG16 Q.6), 14th Meeting: Hong Kong, CH 18-21 January, 2005 which has been incorporated herein by reference above.
The variable codIRange is set equal to codIRange−codIRangeLPS and the following applies. If at 206 codIOffset is greater than or equal to codIRange, the variable binVal is set equal to 1−valMPS, codIOffset is decremented by codIRange, and codIRange is set equal to codIRangeLPS at 208. Otherwise, the variable binVal is set equal to valMPS as indicated at 210.
Depending on the value of binVal, a state transition may be performed. Depending on the current value of codIRange, a renormalization may be performed at 218. Inputs to the state transition process may include a current value of an index pStateIdx, the decoded value binVal and valMPS values of the context variable associated with ctxIdx. Outputs of this process may include the updated pStateIdx and valMPS of the context variable associated with ctxIdx. Depending on the decoded value binVal, the update of the two variables pStateIdx and valMPS associated with ctxIdx may be derived as follows. If binVal is equal to valMPS the value of pStateIdx is set equal to transIdxMPS(pStateIdx) at 214 as determined by a lookup table. If binVal is not equal to valMPS and if at 212 pStateIdx is equal to 0 valMPS is set equal to 1−valMPS at 216. If at 212 pStateIdx is not equal to 0 then pStateIdx is set equal to transIdxLPS(pStateIdx) at 214 as determined by the lookup table. By way of example, Table 9-36 of “Draft of Version 4 of H.264/AVC (ITU-T Recommendation H.264 and ISO/IEC 14496-10 (MPEG-4 part 10) Advanced Video Coding)” is an example of a suitable lookup table specifying the transition rules transIdxMPS( )and transIdxLPS( )after decoding the value of vaIMPS and 1−vaIMPS, respectively.
The renormalization at 218 may be required if the decoding at 208 or 210 resets codIRange to some value that is less than 256, i.e., less than 9 bits. The renormalization process shifts the bits in codIRange to the left so that codIRange is greater than 256. By way of example the renormalization process 218 may proceed as shown in the flow diagram in
The bits that make up codIOffset may be drawn from a raw bitstream and temporarily stored in a buffer. Once the renormalization has been completed at 218, e.g., as illustrated in
The drawbacks to the above-described arithmetic decoding process may be seen from
The algorithm associated with
The packing of data the codIRange, codIOffset and buffered input stream data into a single vector can be configured to take advantage of the available space for data in registers used by a processor that implements embodiments of the invention. For example, the first, second and third sections may encompass a total number of bits less than or equal to the number of bits that can be stored in a register of the processor. Specifically, in the case of a process that utilizes 128-bit registers, the first section 402 may accommodate 16 bits for codIRange, the second section 404 may accommodate 16 bits for codIOffset and the third section 406 may accommodate 96 bits for buffered input data from the bitstream. Embodiments of the invention are not limited to this particular packing scheme. The sections 402, 404, 406 may include different numbers of bits and different entropy decoding data. In addition the engine vector 400 may include more or fewer than three sections. By packing the data into a vector of the type shown in
Data packing of the type depicted in
In embodiments of the present invention the first and third sections 412, 416 may include subsections of bits 413, 417 that provide indexes pointing to address for new contexts in the MPS and LPS cases respectively. Such indexes have conventionally been six bit values. If the value of an index was all zeros, this meant that the bin_MPS value associated with the new context should be flipped from 1 to 0 or from 0 to 1. However, determining whether to flip required a branch instruction. In some embodiments of the present invention, the value of the new bin_MPS may be absorbed into the new context addresses for the MPS and LPS cases. Specifically, the indexes within the first and third sections 412, 416 may contain an extra bit indicating whether the new context has a bin_MPS value of 1 or zero. The extra bit doubles the number of possible contexts. Consequently, twice as many contexts would be stored in memory with half of the contexts having a bin_MPS value of 0 and half having a bin_MPS value of 1. If the last bit of an index 413, 417 is a 0, the address of the new context contains a context having a bin_MPS of 0. If the last bit of the index is a 1, the address of the new context contains a context having a bin_MPS of 1. Such a configuration of the Context vector 400 and the contexts stored in memory avoids having to take a branch to determine whether to flip the bin_MPS value.
Once the first and second candidate values have been prepared a final signal value for the one or more signals may be selected from the first and second candidate values at 508. By way of example, selection of the final signal value may involve operating on one or both candidate values with a selection mask. An example of the use of such a selection mask is described with respect to
The memory 602 may be in the form of an integrated circuit, e.g., RAM, DRAM, ROM, and the like). The memory may also be a main memory or a local store of a synergistic processor element of a cell processor. A computer program 603 may be stored in the memory 602 in the form of processor readable instructions that can be executed on the processor module 601. The processor module 601 may include one or more registers 605 into which data 607, such as the compressed signal input data may be loaded. The compressed signal data may be packed, e.g., as described above with respect to
There are a number of different possible implementations of the processes within the method 500 of
The method 700 may be understood by referring simultaneously to
At 714 an interim value codIRangeLPS is extracted from the Context vector based on the value of codIRange from the CABAC_engine vector. The value of codIRange provides an index for picking one of four possible codIRangeLPS values. These possible values may be stored at different byte positions within codIRange. The index may be stored in a subset of the bits that make up codIRange, e.g., the leading three bits. Meaningless bits within codIRange may be removed by shifting codIRange to the right by a suitable number of bits. The remaining bits may then be used as an index for a table lookup that identifies a byte position within the Context vector containing the desired codeIRangeLPS value. This may be implemented very fast using registers. By way of example, codIRange may be configured such that the first bit of the index is always a 1, e.g., by ensuring that the leading bit of codIRange is always a 1. If codIRange has 9 bits with the leading bit being a 1, the index may be obtained by shifting codIRange by six bits to the right. In such a case, the index ranges from 4 to 7, which correspond to byte positions 4 to 7 within the Context vector.
At 716 an interim value codIRange_new is computed using codIRange_new=codIRange−codIRangeLPS. The interim values codIRangeLPS and codIRange_new are used in updating the CABAC_engine vector as described below.
At 718 the value of codIRange_new is used in conjunction with codIRangeLPS and codIRangeOffset to construct first and second candidate values for updates to the CABAC_engine vector. These candidate values are referred to as CABAC_engine_MPS and CABAC_engine_LPS in
At 722 it is determined whether if it is a MPS case or LPS case. For example if codIoffset is less than codIRange_new it is a MPS case and the value of the CABAC_engine vector is to be updated to the CABAC_engine_MPS candidate value. Otherwise, it is a LPS case and the value of the CABAC_engine vector is to be updated to the CABAC_engine_LPS candidate value. To facilitate updating at 722, a selection mask MPS_LPS_sel_mask may be constructed for later comparison against CABAC_engine_MPS and CABAC_engine_LPS and/or for comparison against Context_MPS and Context_LPS. If the selection mask MPS_LPS_sel_mask is used for comparison against CABAC_engine_MPS and CABAC_engine LPS and for comparison against Context_MPS and Context_LPS it may be desirable for MPS_LPS_sel_mask to have at least as many bits as the greatest number of bits in any of CABAC_engine MPS, CABAC_engine_LPS, Context_MPS and Context_LPS. The values of the bits in MPS_LPS_sel_mask may be based on whether codIOffset is less than codIRange_new. For example, if codIOffset is greater than codIRange_new every bit in MPS_LPS_sel_mask may be set to 1. Otherwise, every bit in MPS_LPS_sel_mask may be set to 0.
At 724 the correct update to the Context vector may be determined using Context_MPS, Context_LPS and the selection mask MPS_LPS_sel_mask. By way of example, a bitwise selection operation of the type Result=select(A, B, mask) may be used to select between Context_MPS and Context_LPS the correct value to update the Context vector. In this type of operation each bit of A and each corresponding bit of B may be compared against a corresponding bit in mask. If, for example, a given bit from mask is set equal to zero the corresponding bit in Result is equal to the value of the corresponding bit in A. If the given bit from mask is equal to one the corresponding bit in Result is set equal to the value of the corresponding bit in B. Thus, the updated value of Context may be determined using an instruction such as Context=select(Context_MPS, Context_LPS, MPS_LPS_sel_mask). Since the value of all the mask bits was set equal to either one or zero at 722 the result of this instruction will be equal to either Context_MPS or Context_LPS depending on whether codIOffset was less than codIRange_new at 722. The updated value of Context may be saved to memory 602 and/or mass storage 615 at 724.
A selection instruction utilizing the MPS_LPS_sel_mask may determine an output bin value bin Val from bin_MPS and bin_LPS at 726. By way of example, such an instruction may have the form:
binVal=select(bin_MPS, bin_LPS, MPS_LPS_sel_mask).
Furthermore, at 728, the correct pre-renormalized version of the update CABAC_engine may also be determined through use of a selection operation using the MPS_LPS_sel_mask. By way of example, such an instruction may have the form:
binVal=select(CABAC_engine_MPS, CABAC_engine LPS, MPS_LPS_sel_mask).
The pre-renormalized CABAC_engine vector may be then be renormalized as follows. At 730 gets the correct number of bits by which to shift the pre-renormalized CABAC_engine vector during renormalization may be determined by a selection operation using the MPS_LPS_sel_mask. Again this operation may use an instruction having the form:
num_bs=select(num_bs_MPS, num_bs_LPS, MPS_LPS_sel_mask).
The pre-renormalized CABAC_engine vector may then be renormalized at 732, e.g., by left-shifting the CABAC_engine vector by the number of bits num_bs calculated at 730. It is noted that this single shifting instruction performs function equivalent to the renormalization loop 300 of
It is noted that the above method 700 largely avoids the use of branch instructions except for checking the bit stream buffer at 734. It is noted that this particular branch instruction is a rather biased branch, i.e., a branch for which one particular path is much more likely than the other. In general, it is more likely that flushing the bit stream won't be required. Statistically, it is roughly 100 times more likely that bit stream flushing will not be required that that it will be required. In such a case branch stalls may be reduced through the use of branch prediction, such as a static branch prediction. The reduction in branch instructions can speed up the process of entropy decoding whether on a parallel processor or a conventional processor such as a PC.
As may be deduced from
The method of
1AFE1270EA2776387257060006E61BA/$ file/CBEA—01_pub.pdf, which is incorporated herein by reference.
For the purposes of example, the cell processor 800 is depicted as having only a single SPE group and a single PPE group with a single SPE and a single PPE. Alternatively, a cell processor can include multiple groups of power processor elements (PPE groups) and multiple groups of synergistic processor elements (SPE groups). Hardware resources can be shared between units within a group. However, the SPEs and PPEs must appear to software as independent elements.
The cell processor 800 includes a main memory 802, a single PPE 804 and eight SPEs 806. However, the cell processor 800 may be configured with any number of SPE's. With respect to
It is noted that a Cell's SPE becomes most efficient when it processes vectors in its register file and accesses its local memory by vectors. In CABAC decoding algorithms of the type described with respect to
Compared with the scalar style algorithm provided in the AYC(H.264) standard (e.g., as described with respect to
Experiments have been performed show that the new CABAC decoding algorithm greatly utilizes the computing power offered by SPEs and is over 5 times faster than the generic algorithm provided in the AVC (H.264) standard. As a result, a Cell processor alone is capable of decoding high bit rate streams targeted by the Blu-ray standard with reasonable performance margin.
While the above is a complete description of the preferred embodiment of the present invention, it is possible to use various alternatives, modifications and equivalents. Therefore, the scope of the present invention should be determined not with reference to the above description but should, instead, be determined with reference to the appended claims, along with their full scope of equivalents. Any feature described herein, whether preferred or not, may be combined with any other feature described herein, whether preferred or not. In the claims that follow, the indefinite article “A” or “An” refers to a quantity of one or more of the item following the article, except where expressly stated otherwise. The appended claims are not to be interpreted as including means-plus-function limitations, unless such a limitation is explicitly recited in a given claim using the phrase “means for.”
| Patent | Priority | Assignee | Title |
| 10349067, | Feb 17 2016 | Qualcomm Incorporated | Handling of end of bitstream NAL units in L-HEVC file format and improvements to HEVC and L-HEVC tile tracks |
| Patent | Priority | Assignee | Title |
| 5768481, | Jun 05 1995 | Apple Inc | Method and apparatus for compression of digitized image data using a dynamic band recompression scheme |
| 5805735, | Mar 02 1995 | Apple Inc | Method and apparatus for compression of digitized image data using variable color fidelity |
| 6115496, | Mar 02 1995 | Apple Inc | Method and apparatus for accelerating image data compression |
| 7554468, | Aug 25 2006 | SONY INTERACTIVE ENTERTAINMENT INC | Entropy decoding methods and apparatus using most probable and least probable signal cases |
| 7948408, | Aug 23 2007 | SONY INTERACTIVE ENTERTAINMENT INC | Entropy decoding methods and apparatus using most probable and least probable signal cases |
| 20020143792, | |||
| 20060126744, | |||
| 20070076729, | |||
| 20080048893, | |||
| 20080049844, | |||
| 20080049845, | |||
| 20120299757, |
| Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
| Jun 25 2013 | Sony Computer Entertainment Inc. | (assignment on the face of the patent) | / | |||
| Apr 01 2016 | Sony Computer Entertainment Inc | SONY INTERACTIVE ENTERTAINMENT INC | CHANGE OF NAME SEE DOCUMENT FOR DETAILS | 039239 | /0356 |
| Date | Maintenance Fee Events |
| Nov 24 2014 | M1551: Payment of Maintenance Fee, 4th Year, Large Entity. |
| Nov 26 2018 | M1552: Payment of Maintenance Fee, 8th Year, Large Entity. |
| Nov 23 2022 | M1553: Payment of Maintenance Fee, 12th Year, Large Entity. |
| Date | Maintenance Schedule |
| Jun 03 2017 | 4 years fee payment window open |
| Dec 03 2017 | 6 months grace period start (w surcharge) |
| Jun 03 2018 | patent expiry (for year 4) |
| Jun 03 2020 | 2 years to revive unintentionally abandoned end. (for year 4) |
| Jun 03 2021 | 8 years fee payment window open |
| Dec 03 2021 | 6 months grace period start (w surcharge) |
| Jun 03 2022 | patent expiry (for year 8) |
| Jun 03 2024 | 2 years to revive unintentionally abandoned end. (for year 8) |
| Jun 03 2025 | 12 years fee payment window open |
| Dec 03 2025 | 6 months grace period start (w surcharge) |
| Jun 03 2026 | patent expiry (for year 12) |
| Jun 03 2028 | 2 years to revive unintentionally abandoned end. (for year 12) |