EP3721630A1 - Context derivation for coefficient coding - Google Patents

Context derivation for coefficient coding

Info

Publication number
EP3721630A1
EP3721630A1 EP18779974.7A EP18779974A EP3721630A1 EP 3721630 A1 EP3721630 A1 EP 3721630A1 EP 18779974 A EP18779974 A EP 18779974A EP 3721630 A1 EP3721630 A1 EP 3721630A1
Authority
EP
European Patent Office
Prior art keywords
value
coding
transform
register
values
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP18779974.7A
Other languages
German (de)
English (en)
French (fr)
Inventor
Aki KUUSELA
Dake He
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Google LLC
Original Assignee
Google LLC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US15/835,501 external-priority patent/US10547869B2/en
Priority claimed from US16/033,582 external-priority patent/US10609421B2/en
Application filed by Google LLC filed Critical Google LLC
Publication of EP3721630A1 publication Critical patent/EP3721630A1/en
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/13—Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/124—Quantisation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/127—Prioritisation of hardware or computational resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/18—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a set of transform coefficients
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding

Definitions

  • Digital video streams may represent video using a sequence of frames or still images.
  • Digital video can be used for various applications including, for example, video conferencing, high definition video entertainment, video advertisements, or sharing of user generated videos.
  • a digital video stream can contain a large amount of data and consume a significant amount of computing or communication resources of a computing device for processing, transmission or storage of the video data.
  • Various approaches have been proposed to reduce the amount of data in video streams, including compression and other encoding techniques.
  • One aspect of the disclosed implementations is a method of coding a transform block having transform coefficients.
  • the method includes defining, based on at least one spatial template for a coding context, register arrays to each hold one or more stored values regarding the coding context (i.e., used to determine the coding context), wherein the register arrays include at least a first register array that has a first size and a second register array that has a second size that is different from the first size, initializing the register arrays by setting the stored values to default values, and coding, in a reverse scan order, values for the transform coefficients from the transform block that are indicative of magnitudes of the transform coefficients.
  • the coding includes, for each of one or more transform coefficients, determining the coding context using at least some of the stored values from the register arrays, entropy coding a value for the transform coefficient at a scan position using the coding context, and, subsequent to entropy coding the value for the transform coefficient, updating the register arrays.
  • a first register array has a different size from a second register array where, for example, the first register array is sized to store a cardinality of values different from the cardinality of values for which the second register array is sized.
  • the apparatus includes a memory and a processor configured to execute instructions stored in the memory.
  • the instructions when executed, cause the processor to define, based on at least one spatial template for a coding context, register arrays to each hold one or more stored values regarding the coding context, wherein the register arrays include at least a first register array that has a first size and a second register array that has a second size that is different from the first size, initialize the register arrays by setting the stored values to default values, and code, in a reverse scan order, values for the transform coefficients from the transform block that are indicative of magnitudes of the transform coefficients.
  • the instructions to code include instructions to, for each of one or more transform coefficients, determine the coding context using at least some of the stored values from the register arrays, entropy code a value for the transform
  • FIG. 1 Another apparatus for coding a transform block having transform coefficients that includes a memory and a processor configured to execute instructions stored in the memory is described.
  • the instructions when executed, cause the processor to define, based on at least one spatial template for a coding context, register arrays to each hold one or more stored values regarding the coding context, initialize the register arrays by setting the stored values to default values, and code values, in a reverse scan order, for the transform coefficients of the transform block indicative of magnitudes of the transform coefficients.
  • the coding instructions includes instructions to determine a first coding context using at least some of the stored values from the register arrays, entropy code a first value for the transform coefficient using the first coding context, the first value indicative of a magnitude of the transform coefficient, and the first value belonging to a set of positive integers ⁇ 0, ..., a first maximum value ⁇ , determine a second coding context using at least some of the stored values from the register arrays, entropy code a second value for the transform coefficient using the second coding context, the second value indicative of the magnitude of the transform coefficient, the second value belonging to a set of positive integers ⁇ 0, ..., a second maximum value ⁇ , and the second maximum value greater than the first maximum value, and, subsequent to entropy coding the first value and the second value, update the register arrays.
  • Another aspect of the disclosed implementations is a method of coding a transform block having transform coefficients.
  • the method includes defining, based on at least one spatial template for a coding context, register arrays to each hold one or more stored values regarding the coding context, initializing the register arrays by setting the stored values to default values, and coding, in a reverse scan order, values for the transform coefficients of the transform block indicative of magnitudes of the transform coefficients.
  • the coding includes determining a first coding context using at least some of the stored values from the register arrays, entropy coding a first value for the transform coefficient using the first coding context, the first value being indicative of a magnitude of the transform coefficient, and the first value belonging to a set of positive integers ⁇ 0, ..., a first maximum value ⁇ , determining a second coding context using at least some of the stored values from the register arrays, entropy coding a second value for the transform coefficient using the second coding context, the second value being indicative of the magnitude of the transform coefficient, the second value belonging to a set of positive integers ⁇ 0, ..., a second maximum value ⁇ , and the second maximum value being greater than the first maximum value, and, subsequent to entropy coding the first value and the second value, updating the register arrays.
  • FIG. 1 is a schematic of a video encoding and decoding system.
  • FIG. 2 is a block diagram of an example of a computing device that can implement a transmitting station or a receiving station.
  • FIG. 3 is a diagram of a video stream to be encoded and subsequently decoded.
  • FIG. 4 is a block diagram of an encoder according to implementations of this disclosure.
  • FIG. 5 is a block diagram of a decoder according to implementations of this disclosure.
  • FIG. 6 is a diagram showing scan orders that can be utilized when coding a block of transform coefficients in accordance with implementations of this disclosure.
  • FIG. 7 is a diagram illustrating the stages of transform coefficient coding using level maps in accordance with implementations of this disclosure.
  • FIG. 8 is a flowchart diagram of a process for encoding a transform block in an encoded video bitstream using level maps according to an implementation of this disclosure.
  • FIG. 9A is a diagram showing a first set of spatial neighboring templates that can be utilized in context-based arithmetic coding methods in accordance with implementations of this disclosure.
  • FIG. 9B is a diagram showing a second set of spatial neighboring templates that can be utilized in context-based arithmetic coding methods in accordance with
  • FIG. 10 is a diagram that shows a first example of a register set that corresponds to a horizontal template.
  • FIG. 11 is a diagram that shows a first example of a register set that corresponds to a vertical template.
  • FIG. 12 is a diagram that shows a first example of a register set that corresponds to a two-dimensional template.
  • FIG. 13 is a diagram that shows a second example of a register set that corresponds to a horizontal template.
  • FIG. 14 is a diagram that shows a second example of a register set that corresponds to a vertical template.
  • FIG. 15 is a diagram that shows a second example of a register set that corresponds to a two-dimensional template.
  • FIG. 16 is a diagram that shows a third example of a register set that corresponds to a horizontal template.
  • FIG. 17 is a diagram that shows a third example of a register set that corresponds to a vertical template.
  • FIG. 18 is a diagram that shows a third example of a register set that corresponds to a two-dimensional template.
  • FIG. 19 is a flowchart diagram of a process for coding a transform block according to an implementation of this disclosure.
  • FIG. 20 is a flowchart diagram of another process for coding a transform block according to an implementation of this disclosure.
  • compression schemes related to coding video streams may include breaking images into blocks and generating a digital video output bitstream (i.e., an encoded bitstream) using one or more techniques to limit the information included in the output bitstream.
  • a received bitstream can be decoded to re-create the blocks and the source images from the limited information.
  • Encoding a video stream, or a portion thereof, such as a frame or a block can include using temporal or spatial similarities in the video stream to improve coding efficiency. For example, a current block of a video stream may be encoded based on identifying a difference (residual) between the previously coded pixel values, or between a combination of previously coded pixel values, and those in the current block.
  • Intra prediction attempts to predict the pixel values of a block of a frame of video using pixels peripheral to the block; that is, using pixels that are in the same frame as the block but that are outside the block.
  • a prediction block resulting from intra prediction is referred to herein as an intra predictor.
  • Intra prediction can be performed along a direction of prediction where each direction can correspond to an intra prediction mode.
  • the intra prediction mode can be signaled by an encoder to a decoder.
  • Inter prediction attempts to predict the pixel values of a block using a possibly displaced block or blocks from a temporally nearby frame (i.e., reference frame) or frames.
  • the displacement is identified by a motion vector.
  • a temporally nearby frame is a frame that appears earlier or later in time in the video stream than the frame of the block being encoded.
  • Some codecs use up to eight reference frames, which can be stored in a frame buffer.
  • the motion vector can refer to (i.e., use) one of the reference frames of the frame buffer. As such, one or more reference frames can be available for coding a current frame.
  • a prediction block resulting from inter prediction is referred to herein as inter predictor.
  • a current block of a video stream may be encoded based on identifying a difference (residual) between the previously coded pixel values and those in the current block. In this way, only the residual and parameters used to generate the residual need be added to the encoded bitstream.
  • the residual may be encoded using a lossy quantization step.
  • the residual block can be in the pixel domain.
  • the residual block can be transformed into a transform domain, resulting in a transform block of transform coefficients.
  • the frequency domain is utilized as an example of the transform domain, but should be construed to refer generally to the domain in which the values are expressed after being transformed, including by Discrete Cosine Transform (DCT) and its variants, Discrete Sine Transform (DST) and its variants, and identity transform or its scaled variants.
  • DCT Discrete Cosine Transform
  • DST Discrete Sine Transform
  • the transform coefficients can be quantized resulting in a quantized transform block of quantized transform coefficients.
  • the quantized coefficients can be entropy encoded and added to an encoded bitstream.
  • a decoder can receive the encoded bitstream and entropy decode the quantized transform coefficients to reconstruct the original video frame.
  • Entropy coding is a technique for“lossless” coding that relies upon probability models that model the distribution of values occurring in an encoded video bitstream. By using probability models based on a measured or estimated distribution of values, entropy coding can reduce the number of bits required to represent video data close to a theoretical minimum. In practice, the actual reduction in the number of bits required to represent video data can be a function of the accuracy of the probability model, the number of bits over which the coding is performed, and the computational accuracy of fixed-point arithmetic used to perform the coding.
  • bitstream In an encoded video bitstream, many of the bits are used for one of two things: either content prediction (e.g., inter mode/motion vector coding, intra prediction mode coding, etc.) or residual coding (e.g., transform coefficient coding).
  • content prediction e.g., inter mode/motion vector coding, intra prediction mode coding, etc.
  • residual coding e.g., transform coefficient coding
  • the bits in the bitstream can include, for a block, the intra prediction mode used to encode the block.
  • the intra prediction mode can be coded (encoded by an encoder and decoded by a decoder) using entropy coding.
  • a context is determined for the intra prediction mode and a probability model, corresponding to the context, is used for coding the intra prediction mode.
  • Entropy coding a sequence of symbols is typically achieved by using a probability model to determine a probability for the sequence and then using binary arithmetic coding to map the sequence to a binary codeword at the encoder and to decode that sequence from the binary codeword at the decoder.
  • a context model can be a parameter in entropy coding.
  • a context model can be any parameter or method that affects probability estimation for entropy coding.
  • a purpose of context modeling is to obtain probability distributions for a subsequent entropy coding engine, such as arithmetic coding, Huffman coding, and other variable-length-to- variable-length coding engines.
  • a large number of contexts may be required. For example, some video coding systems can include hundreds or even thousands of contexts for transform coefficient coding alone. Each context can correspond to a probability distribution.
  • Residual coding involves transforming residuals for a block of video into transform blocks of transform coefficients.
  • the transform blocks are in the frequency domain, and one or more transform blocks may be generated for a block of video.
  • the transform coefficients are quantized and entropy coded into an encoded video bitstream.
  • a decoder uses the encoded transform coefficients and the reference frames to reconstruct the block.
  • Entropy coding a transform coefficient involves the selection of a context model (also referred to as probability context model or probability model) that provides estimates of conditional probabilities for coding the binary symbols of a binarized transform coefficient.
  • spatial templates are used during entropy coding to select context neighbors of the value being coded, and the context neighbors are used to determine the coding context. Accessing the values needed for determining the coding context can, however, lead to memory bottlenecks.
  • the values needed for determining the coding context are held in register arrays within memory, and at least some values therein are updated using the most recently coded value, which reduces the amount of information that must be obtained from base information such as the transform block or level maps.
  • these register arrays may be organized into one or more register sets, where the lengths of the arrays (i.e., the number of elements or stored context neighbor values) may be different.
  • a register array may comprise a shift register or any other memory where values may be shifted within and/or between arrays.
  • FIG. 1 is a schematic of a video encoding and decoding system 100.
  • a transmitting station 102 can be, for example, a computer having an internal configuration of hardware such as that described in FIG. 2. However, other suitable implementations of the transmitting station 102 are possible. For example, the processing of the transmitting station 102 can be distributed among multiple devices.
  • a network 104 can connect the transmitting station 102 and a receiving station 106 for encoding and decoding of the video stream.
  • the video stream can be encoded in the transmitting station 102 and the encoded video stream can be decoded in the receiving station 106.
  • the network 104 can be, for example, the Internet.
  • the network 104 can also be a local area network (LAN), wide area network (WAN), virtual private network (VPN), cellular telephone network or any other means of transferring the video stream from the transmitting station 102 to, in this example, the receiving station 106.
  • the receiving station 106 in one example, can be a computer having an internal configuration of hardware such as that described in FIG. 2. However, other suitable implementations of the receiving station 106 are possible. For example, the processing of the receiving station 106 can be distributed among multiple devices. [0046] Other implementations of the video encoding and decoding system 100 are possible. For example, an implementation can omit the network 104. In another
  • a video stream can be encoded and then stored for transmission at a later time to the receiving station 106 or any other device having memory.
  • the receiving station 106 receives (e.g., via the network 104, a computer bus, and/or some communication pathway) the encoded video stream and stores the video stream for later decoding.
  • a real-time transport protocol RTP
  • a transport protocol other than RTP may be used, e.g., an HTTP-based video streaming protocol.
  • the transmitting station 102 and/or the receiving station 106 may include the ability to both encode and decode a video stream as described below.
  • the receiving station 106 could be a video conference participant who receives an encoded video bitstream from a video conference server (e.g., the transmitting station 102) to decode and view and further encodes and transmits its own video bitstream to the video conference server for decoding and viewing by other participants.
  • FIG. 2 is a block diagram of an example of a computing device 200 that can implement a transmitting station or a receiving station.
  • the computing device 200 can implement one or both of the transmitting station 102 and the receiving station 106 of FIG. 1.
  • the computing device 200 can be in the form of a computing system including multiple computing devices, or in the form of a single computing device, for example, a mobile phone, a tablet computer, a laptop computer, a notebook computer, a desktop computer, and the like.
  • a CPU 202 in the computing device 200 can be a central processing unit.
  • the CPU 202 can be any other type of device, or multiple devices, capable of manipulating or processing information now-existing or hereafter developed.
  • the disclosed implementations can be practiced with a single processor as shown, e.g., the CPU 202, advantages in speed and efficiency can be achieved using more than one processor.
  • a memory 204 in the computing device 200 can be a read-only memory (ROM) device or a random access memory (RAM) device in an implementation. Any other suitable type of storage device can be used as the memory 204.
  • the memory 204 can include code and data 206 that is accessed by the CPU 202 using a bus 212.
  • the memory 204 can further include an operating system 208 and application programs 210, the application programs 210 including at least one program that permits the CPU 202 to perform the methods described here.
  • the application programs 210 can include applications 1 through N, which further include a video coding application that performs the methods described here.
  • the computing device 200 can also include a secondary storage 214, which can, for example, be a memory card used with a computing device 200 that is mobile. Because the video
  • communication sessions may contain a significant amount of information, they can be stored in whole or in part in the secondary storage 214 and loaded into the memory 204 as needed for processing.
  • the computing device 200 can also include one or more output devices, such as a display 218.
  • the display 218 may be, in one example, a touch sensitive display that combines a display with a touch sensitive element that is operable to sense touch inputs.
  • the display 218 can be coupled to the CPU 202 via the bus 212.
  • Other output devices that permit a user to program or otherwise use the computing device 200 can be provided in addition to or as an alternative to the display 218.
  • the output device is or includes a display
  • the display can be implemented in various ways, including by a liquid crystal display (LCD), a cathode-ray tube (CRT) display or light emitting diode (LED) display, such as an organic LED (OLED) display.
  • LCD liquid crystal display
  • CRT cathode-ray tube
  • LED light emitting diode
  • OLED organic LED
  • the computing device 200 can also include or be in communication with an image-sensing device 220, for example a camera, or any other image-sensing device 220 now existing or hereafter developed that can sense an image such as the image of a user operating the computing device 200.
  • the image-sensing device 220 can be positioned such that it is directed toward the user operating the computing device 200.
  • the position and optical axis of the image-sensing device 220 can be configured such that the field of vision includes an area that is directly adjacent to the display 218 and from which the display 218 is visible.
  • the computing device 200 can also include or be in communication with a sound sensing device 222, for example a microphone, or any other sound-sensing device now existing or hereafter developed that can sense sounds near the computing device 200.
  • the sound-sensing device 222 can be positioned such that it is directed toward the user operating the computing device 200 and can be configured to receive sounds, for example, speech or other utterances, made by the user while the user operates the computing device 200.
  • FIG. 2 depicts the CPU 202 and the memory 204 of the computing device 200 as being integrated into a single unit, other configurations can be utilized.
  • the operations of the CPU 202 can be distributed across multiple machines (each machine having one or more of processors) that can be coupled directly or across a local area or other network.
  • the memory 204 can be distributed across multiple machines such as a network- based memory or memory in multiple machines performing the operations of the computing device 200.
  • the bus 212 of the computing device 200 can be composed of multiple buses.
  • the secondary storage 214 can be directly coupled to the other components of the computing device 200 or can be accessed via a network and can comprise a single integrated unit such as a memory card or multiple units such as multiple memory cards.
  • the computing device 200 can thus be implemented in a wide variety of configurations.
  • FIG. 3 is a diagram of an example of a video stream 300 to be encoded and subsequently decoded.
  • the video stream 300 includes a video sequence 302.
  • the video sequence 302 includes a number of adjacent frames 304. While three frames are depicted as the adjacent frames 304, the video sequence 302 can include any number of adjacent frames 304.
  • the adjacent frames 304 can then be further subdivided into individual frames, e.g., a frame 306.
  • the frame 306 can be divided into a series of segments 308 or planes.
  • the segments 308 can be subsets of frames that permit parallel processing, for example.
  • the segments 308 can also be subsets of frames that can separate the video data into separate colors.
  • the frame 306 of color video data can include a luminance plane and two chrominance planes.
  • the segments 308 may be sampled at different resolutions.
  • the frame 306 may be further subdivided into blocks 310, which can contain data corresponding to, for example, 16x16 pixels in the frame 306.
  • the blocks 310 can also be arranged to include data from one or more segments 308 of pixel data.
  • the blocks 310 can also be of any other suitable size such as 4x4 pixels, 8x8 pixels, 16x8 pixels, 8x16 pixels, 16x16 pixels or larger.
  • FIG. 4 is a block diagram of an encoder 400 in accordance with implementations of this disclosure.
  • the encoder 400 can be implemented, as described above, in the transmitting station 102 such as by providing a computer software program stored in memory, for example, the memory 204.
  • the computer software program can include machine instructions that, when executed by a processor such as the CPU 202, cause the transmitting station 102 to encode video data in manners described herein.
  • the encoder 400 can also be implemented as specialized hardware included in, for example, the transmitting station 102.
  • the encoder 400 has the following stages to perform the various functions in a forward path (shown by the solid connection lines) to produce an encoded or compressed bitstream 420 using the video stream 300 as input: an intra/inter prediction stage 402, a transform stage 404, a quantization stage 406, and an entropy encoding stage 408.
  • the encoder 400 may also include a reconstruction path (shown by the dotted connection lines) to reconstruct a frame for encoding of future blocks.
  • the encoder 400 has the following stages to perform the various functions in the reconstruction path: a dequantization stage 410, an inverse transform stage 412, a reconstruction stage 414, and a loop filtering stage 416.
  • Other structural variations of the encoder 400 can be used to encode the video stream 300.
  • the frame 306 can be processed in units of blocks.
  • a block can be encoded using intra-frame prediction (also called intra-prediction) or inter-frame prediction (also called inter-prediction), or a combination of both.
  • intra-prediction also called intra-prediction
  • inter-frame prediction also called inter-prediction
  • a prediction block can be formed.
  • intra-prediction all or a part of a prediction block may be formed from samples in the current frame that have been previously encoded and reconstructed.
  • inter-prediction all or part of a prediction block may be formed from samples in one or more previously constructed reference frames determined using motion vectors.
  • the prediction block can be subtracted from the current block at the intra/inter prediction stage 402 to produce a residual block (also called a residual).
  • the transform stage 404 transforms the residual into transform coefficients in, for example, the frequency domain using block-based transforms.
  • block-based transforms include, for example, the DCT and the Asymmetric DST. Other block-based transforms are possible. Further, combinations of different transforms may be applied to a single residual.
  • the DCT transforms the residual block into the frequency domain where the transform coefficient values are based on spatial frequency. The lowest frequency (DC) coefficient is located at the top-left of the matrix and the highest frequency coefficient is located at the bottom-right of the matrix.
  • DC lowest frequency
  • the size of a prediction block, and hence the resulting residual block may be different from the size of the transform block.
  • the prediction block may be split into smaller blocks to which separate transforms are applied.
  • the quantization stage 406 converts the transform coefficients into discrete quantum values, which are referred to as quantized transform coefficients, using a quantizer value or a quantization level. For example, the transform coefficients may be divided by the quantizer value and truncated.
  • the quantized transform coefficients are then entropy encoded by the entropy encoding stage 408. Entropy coding may be performed using any number of techniques, including token and binary trees.
  • the entropy-encoded coefficients, together with other information used to decode the block, which may include for example the type of prediction used, transform type, motion vectors and quantizer value, are then output to the compressed bitstream 420.
  • the information to decode the block may be entropy coded into block, frame, slice and/or section headers within the compressed bitstream 420.
  • the compressed bitstream 420 can also be referred to as an encoded video stream or encoded video bitstream, and the terms will be used interchangeably herein.
  • the reconstruction path in FIG. 4 can be used to ensure that both the encoder 400 and a decoder 500 (described below) use the same reference frames and blocks to decode the compressed bitstream 420.
  • the reconstruction path performs functions that are similar to functions that take place during the decoding process that are discussed in more detail below, including dequantizing the quantized transform coefficients at the dequantization stage 410 and inverse transforming the dequantized transform coefficients at the inverse transform stage 412 to produce a derivative residual block (also called a derivative residual).
  • the prediction block that was predicted at the intra/inter prediction stage 402 can be added to the derivative residual to create a reconstructed block.
  • the loop filtering stage 416 can be applied to the reconstructed block to reduce distortion such as blocking artifacts.
  • encoder 400 can be used to encode the compressed bitstream 420.
  • a non-transform based encoder 400 can quantize the residual signal directly without the transform stage 404 for certain blocks or frames.
  • an encoder 400 can have the quantization stage 406 and the dequantization stage 410 combined into a single stage.
  • FIG. 5 is a block diagram of a decoder 500 in accordance with implementations of this disclosure.
  • the decoder 500 can be implemented in the receiving station 106, for example, by providing a computer software program stored in the memory 204.
  • the computer software program can include machine instructions that, when executed by a processor such as the CPU 202, cause the receiving station 106 to decode video data in the manners described below.
  • the decoder 500 can also be implemented in hardware included in, for example, the transmitting station 102 or the receiving station 106.
  • the decoder 500 similar to the reconstruction path of the encoder 400 discussed above, includes in one example the following stages to perform various functions to produce an output video stream 516 from the compressed bitstream 420: an entropy decoding stage 502, a dequantization stage 504, an inverse transform stage 506, an intra/inter-prediction stage 508, a reconstruction stage 510, a loop filtering stage 512 and a post filtering stage 514.
  • stages to perform various functions to produce an output video stream 516 from the compressed bitstream 420 includes in one example the following stages to perform various functions to produce an output video stream 516 from the compressed bitstream 420: an entropy decoding stage 502, a dequantization stage 504, an inverse transform stage 506, an intra/inter-prediction stage 508, a reconstruction stage 510, a loop filtering stage 512 and a post filtering stage 514.
  • Other structural variations of the decoder 500 can be used to decode the compressed bitstream 420.
  • the data elements within the compressed bitstream 420 can be decoded by the entropy decoding stage 502 to produce a set of quantized transform coefficients.
  • the dequantization stage 504 dequantizes the quantized transform coefficients (e.g., by multiplying the quantized transform coefficients by the quantizer value), and the inverse transform stage 506 inverse transforms the dequantized transform coefficients using the selected transform type to produce a derivative residual that can be identical to that created by the inverse transform stage 412 in the encoder 400.
  • the decoder 500 can use the intra/inter-prediction stage 508 to create the same prediction block as was created in the encoder 400, e.g., at the intra/inter prediction stage 402.
  • the prediction block can be added to the derivative residual to create a reconstructed block.
  • the loop filtering stage 512 can be applied to the reconstructed block to reduce blocking artifacts. Other filtering can be applied to the reconstructed block.
  • the post filtering stage 514 is applied to the reconstructed block to reduce blocking distortion, and the result is output as an output video stream 516.
  • the output video stream 516 can also be referred to as a decoded video stream, and the terms will be used interchangeably herein.
  • the decoder 500 can be used to decode the compressed bitstream 420.
  • the decoder 500 can produce the output video stream 516 without the post filtering stage 514.
  • the post filtering stage 514 is applied before the loop filtering stage 512.
  • the encoder 400 includes a deblocking filtering stage in addition to the loop filtering stage 416.
  • blocks of transform coefficients may be determined by transforming residual values according to a transform type.
  • a transform type may be one or more one-dimensional transform types, including a one-dimensional horizontal transform type, referred to herein as TX_CLASS_HORIZ, where identity transform is applied to columns, or a one-dimensional vertical transform type, referred to herein as TX_CLASS_VERT, where identity transform is applied to rows.
  • TX_CLASS_HORIZ a one-dimensional horizontal transform type
  • TX_CLASS_VERT a one-dimensional vertical transform type
  • identity transform is applied to rows.
  • a transform type may also be a two-dimensional transform type, referred to herein as TX_CLASS_2D.
  • Whichever transform type is selected is used to transform the residual values into the frequency domain during encoding and to inverse-transform from the frequency domain during decoding.
  • the transform coefficients may be quantized.
  • the quantized transform coefficients may be represented using level maps and encoded or decoded using context-based arithmetic coding methods. These coding and operations are performed, for example, in the entropy encoding stage 408 of the encoder 400 and the entropy decoding stage 502 of the decoder 500.
  • Context-based arithmetic coding methods code values using a probability model that is selected based on a coding context or simply a context.
  • the coding context includes values that are within a spatial area near the value being coded. Selecting the probability model based on the coding context allows for better modelling of probabilities given that a high level of correlation between coding modes is typically present in a given spatial area.
  • the context is determined based on a template. The template may be selected based on the transform type.
  • the transform block is decomposed into multiple level maps such that the level maps break down (i.e., reduce) the coding of each transform coefficient value into a series of binary decisions each corresponding to a magnitude level (i.e., a map level).
  • the decomposition can be done by using a multi-run process.
  • a transform coefficient of the transform block is decomposed into a series of level maps, which may be level binaries, and a residue according to the equation:
  • T is the maximum map level
  • level k is the level map corresponding to map level k
  • residue is a coefficient residual map
  • sign is the sign map of the transform coefficients.
  • the transform coefficients of a transform block can be re-composed using the same equation, such as by a decoder, from encoded level k maps, residual map residue, and sign map sign. Level map coding will be explained further with reference to FIGS. 6 and 7.
  • FIG. 6 is a diagram showing scan orders that can be utilized when coding a block of transform coefficients in accordance with implementations of this disclosure.
  • the scan orders include a zig-zag scan order 601, a horizontal scan order 602, and a vertical scan order 603.
  • the blocks are 4x4 blocks that each include 16 values.
  • Each has four rows, labelled R0-R3 in left-to-right order, and four columns, labelled C0-C3 in top- to-bottom order.
  • Individual locations in each block correspond to individual transform coefficients, and can be addressed in the format [r, c], where r represents the row number and c represents the column number.
  • Each of the zig-zag scan order 601, the horizontal scan order 602, and the vertical scan order 603 starts at position [0, 0], and the numbers shown indicate the order in which locations in the block are visited/processed subsequent to position [0, 0], according to the scan order.
  • the zig-zag scan order 601 visits locations in the block along diagonals, proceeding in a left-to-right and top-to-bottom manner.
  • the horizontal scan order 602 proceeds left-to-right along each row before proceeding to the next row in top-to-bottom order.
  • the vertical scan order 603 proceeds top-to-bottom along each column before proceeding to the next column in left-to-right order.
  • FIG. 7 is a diagram illustrating the stages of transform coefficient coding using level maps in accordance with implementations of this disclosure.
  • FIG. 7 shows a transform block 704 and level maps that represent the transform block, including an end-of-block map 706, a non-zero map 708, a sign map 710, a level- 1 map 712, a level-2 map 714, and a coefficient residue or residual map 716.
  • the transform block 704 is an example of a block of transform coefficients that can be received from the quantization step of an encoder, such as the quantization stage 406 of the encoder 400 of FIG. 4.
  • the transform block 704 includes zero and non-zero transform coefficients. Some of the non-zero coefficients may be negative values.
  • the end-of-block map 706 indicates the end-of-block position for the transform block 704.
  • the end-of-block position is the position at which there are no further non-zero values in the transform block 704, as determined when the transform coefficient positions are visited in the scan order being used. Thus, at and after the end-of-block position, all values are from the transform block 704 are zero.
  • the zig-zag scan order 601 is used, non-zero coefficients that are other than the end-of-block position are indicated with a value of zero, and the end-of-block position is indicated with a value of one (1).
  • the non-zero map 708 is a level map that indicates, for each position in the transform block 704, whether the corresponding transform coefficient is equal to zero or is a non-zero value.
  • the non-zero map 708 includes a zero at the location of each transform coefficient that has a zero value and is located before the end-of- block position, and the non-zero map 708 includes the value one (1) at all locations that have a non-zero value in the transform block 704.
  • the non-zero map 708 may also be referred to as a level-zero map.
  • the sign map 710 indicates, for each position of the transform block 704 that has a non-zero value, whether the corresponding transform coefficient has a positive value or a negative value.
  • the value -1 indicates that the corresponding transform coefficient has a negative value
  • the value one indicates that the corresponding transform coefficient has a positive value.
  • Other symbols can be utilized, such as zero and one.
  • the non-zero map 708, the level- 1 map 712, the level-2 map 714, and the coefficient residual map 716, in combination, define the absolute value for the transform coefficients from the transform block 704.
  • the non-zero map 708, the level- 1 map 712, the level-2 map indicate, using only binary values, whether the corresponding transform coefficients from the transform block 704 have an absolute value that is equal to zero, one, or two, or is greater than or equal to three.
  • the level- 1 map 712 includes the value zero if the absolute value of the
  • the level-2 map 714 includes the value zero if the absolute value of the corresponding transform coefficient is equal to two, or includes the value one if the absolute value of the transform coefficient is greater than or equal to three.
  • a single level map can replace the non-zero map 708, the level- 1 map 712, and the level-2 map, by using a two bit value to indicate, for each transform coefficient from the transform block 704, whether the absolute value of the transform coefficient is equal to zero, one, or two, or is greater than or equal to three.
  • a different number of level maps can be used, in which case the threshold at which a residual value is present will change.
  • the coefficient residual map 716 includes the residue for each transform coefficient from the transform block 704.
  • the residue for each transform coefficient from the transform block 704 is the magnitude of the transform coefficient in excess of the representation of the magnitude in the level maps.
  • residue for each transform coefficient from the transform block 704 is calculated as the absolute value of the transform coefficient from the transform block 704 minus three.
  • FIG. 8 is a flowchart diagram of a process 800 for encoding a transform block in an encoded video bitstream using level maps according to an implementation of this disclosure.
  • the process 800 can be implemented in an encoder such as the encoder 400.
  • the encoded video bitstream can be the compressed bitstream 420 of FIG. 4.
  • the process 800 can be implemented, for example, as a software program that can be executed by computing devices such as transmitting station 102.
  • the software program can include machine-readable instructions that can be stored in a memory such as the memory 204 or the secondary storage 214, and that can be executed by a processor, such as CPU 202, to cause the computing device to perform the process 800.
  • the process 800 can be performed in whole or in part by the entropy encoding stage 408 of the encoder 400.
  • the process 800 can be implemented using specialized hardware or firmware. Some computing devices can have multiple memories, multiple processors, or both. The steps or operations of the process 800 can be distributed using different processors, memories, or both. Use of the terms“processor” or“memory” in the singular encompasses computing devices that have one processor or one memory as well as devices that have multiple processors or multiple memories that can be used in the performance of some or all of the recited steps.
  • the process 800 can receive a transform block, such as the transform block 704 of FIG. 7.
  • the transform block 704 can be received as the output from the quantization step of an encoder, such as the quantization stage 406 of the encoder 400 of FIG. 4.
  • the transform block 704 includes zero and non-zero transform coefficients. Some of the non-zero coefficients may be negative values.
  • the end-of-block position (EOB) is encoded by generating and including values in the encoded video bitstream that indicate the end-of-block position.
  • operation 802 can include generating an end-of-block map for the transform block, as explained with respect to the end-of-block map 706. At and after EOB, all coefficients are zeroes.
  • the value BL[i] is coded in operation 802 using level maps, such as the non-zero map 708, the level- 1 map 712, and the level-2 map 714.
  • the value BL[i] is coded into the video bitstream in operation 802 using context- based arithmetic coding methods.
  • Context-based arithmetic coding methods utilize a context model, which can be determined based on the binary values of any number of previously coded neighbors, and can fully utilize information from all these neighbors.
  • the previously coded neighbors can be neighbors in the same level map or a preceding level map, such as an immediately preceding level map.
  • the level- 1 map 712 can provide context information for coding the level-2 map 714.
  • operation 801 and operation 802 are combined by interleaving the end-of-block map 706 into the non-zero map 708.
  • a residual value referred to as BR[i] is coded for all transform coefficients that have an absolute value for its magnitude greater than what is represented by the value BL[i], which in the present example represents quantized transform coefficients having an absolute value of 0, 1, and 2 without use of a residual value.
  • BL[i] the value BR[i] denotes the magnitude of the quantized transform coefficient at scan position i, and is equal to the magnitude value of the quantized transform coefficient for scan position i minus three.
  • the residual values BR[i] can be coded into the video bitstream in operation 803 using context-based arithmetic coding methods.
  • Context-based arithmetic coding methods utilize a context model, which can be determined based on the binary values of any number of previously coded neighbors, and can fully utilize information from all these neighbors.
  • the previously coded neighbors can be neighbors in the same level map or a preceding level map, such as an immediately preceding level map.
  • the residual values BR[i] can be encoded in the encoded video bitstream using binary coding or multi symbol coding. A probability distribution that fits the statistics of the residual coefficients of the coefficients residue map can be used.
  • the probability distribution can be a geometric distribution, a Laplacian distribution, a Pareto distribution, or any other distribution.
  • a value is coded for each non-zero quantized transform coefficient indicating whether the sign of the quantized transform coefficient is positive or negative. This value may be referred to as Sign[i], where i denotes the scan position and Sign[i] denotes the sign of the non-zero coefficient at scan position i. Operation 804 may be performed using the sign map 710. Coding Sign[i] may be performed using context-based or non-context-based entropy coding techniques.
  • the available values for BR(i) may include a maximum value.
  • BR(i) may take any of the values from 0 to 12 when BL(i) is equal to 3. Together with BL(i), this corresponds to absolute values for the magnitude L(i) of the quantized transform coefficient at scan position i of 0 through 15.
  • a value of 12 for BL(i) can indicate that the residual value is greater than or equal to 15.
  • the magnitude of the quantized transform coefficient minus 15 (L(i) - 15) is coded in operation 805.
  • the magnitudes can be encoded in the encoded video bitstream using binary coding or multi-symbol coding.
  • a probability distribution that fits the statistics of the residual coefficients of the coefficients residue map can be used.
  • the probability distribution can be a geometric distribution, a Laplacian distribution, a Pareto distribution, or any other distribution. Coding the resulting symbols may not require any context derivation. That is, the symbols may not be context-coded.
  • coding of BL and BR symbols may have its own loop for the current block followed by another loop for coding of applicable signs and the magnitude of the quantized transform coefficient minus 15 in the same block.
  • the quantized transform coefficients may be reconstructed using the coded values to verify the encoding after operation 805.
  • spatial neighboring templates can be utilized for determining context models used in context-based arithmetic coding methods.
  • the context used to code the value BL[i] is derived by using a spatial template anchored to the block position (r_i, c_i) corresponding to the scan position i, where r_i denotes the row index and c_i denotes the column index.
  • FIG. 9A is a diagram showing a first set of spatial neighboring templates that can be utilized in context-based arithmetic coding methods in accordance with implementations of this disclosure.
  • a horizontal template 901 includes multiple context neighbors that are in the same row as the position of a transform coefficient to be coded (i.e., a transform coefficient to be encoded or decoded that may be referred to herein as a position to be coded for brevity), and one context neighbor in the same column as the position to be coded.
  • the horizontal template 901 includes four context neighbors to the right of the position to be coded and one context neighbor below the position to be coded.
  • a vertical template 902 includes one context neighbor that is in the same row as the position to be coded, and multiple context neighbors in the same column as the position to be coded.
  • the vertical template 902 includes one context neighbor to the right of the position to be coded and four context neighbors below the position to be coded.
  • a two- dimensional template 903 includes context neighbors in a triangular pattern that is anchored at the position to be coded.
  • the two-dimensional template 903 includes two context neighbors to the right of the position to be coded, two context neighbors below the position to be coded, and one context neighbor that is located diagonally downward and rightward relative to the position to be coded.
  • the first set of spatial neighboring templates illustrated in FIG. 9A may be used to derive contexts for BL[i].
  • the same or a different set of spatial neighboring templates may be used to derive contexts for BR[i].
  • FIG. 9B is a diagram showing a second set of spatial neighboring templates that can be utilized in context-based arithmetic coding methods in accordance with implementations of this disclosure.
  • the second set of spatial neighboring templates may be used to derive contexts for BR[i].
  • a horizontal template 905 includes multiple context neighbors that are in the same row as a position to be coded, and one context neighbor in the same column as the position to be coded.
  • the horizontal template 905 includes two context neighbors to the right of the position to be coded and one context neighbor below the position to be coded.
  • a vertical template 906 includes one context neighbor that is in the same row as the position to be coded, and multiple context neighbors in the same column as the position to be coded.
  • the vertical template 906 includes one context neighbor to the right of the position to be coded and two context neighbors below the position to be coded.
  • a two- dimensional template 907 includes context neighbors in a triangular pattern that is anchored at the position to be coded.
  • the two-dimensional template 907 includes one context neighbor to the right of the position to be coded, one context neighbor below the position to be coded, and one context neighbor that is located diagonally downward and rightward relative to the position to be coded.
  • the spatial neighboring template that is used in a specific coding operation may be selected based on the transform type used to determine the quantized transform coefficients. For example, if the transform type is a one-dimensional horizontal transform (TX_CLASS_HORIZ) type, the horizontal template 901 and/or the horizontal template 905 may be used. If the transform type is a one-dimensional vertical transform type
  • TX_CLASS_VERT the vertical template 902 and/or the vertical template 906 may be used. If the transform type is a two-dimensional transform type (TX_CLASS_2D), the two- dimensional template 903 and/or the two-dimensional template 907 may be used.
  • obtaining the values to be used in the selected template as context neighbors may become costly in a naive implementation, such as one that obtains the needed values by a table lookup. That is, for example, there are three transform type classes, each of which has its own templates, a straightforward implementation may need at least three arrays to store the neighborhood positions for each valid transform size. A practical implementation is further complicated where the codec specifies a number of scan orders. In this situation, the arrays may need to be defined based on block positions instead of scan positions to avoid being scan order dependent. Accordingly, table lookups can result in performance issues, such as memory bottlenecks. Performance issues may be more common, for example, when the block size is large (e.g., a 32x32 transform block, which has 1024 positions).
  • performance can be improved by storing needed information in memory registers arrays, or simply register arrays.
  • register arrays for this purpose, the scan orders used for coding of transform
  • coefficients such as the zig-zag scan order 601, the horizontal scan order 602, and the vertical scan order 603, share common properties in that the coefficients in a row are visited from left to right and coefficients in a column are visited from top to bottom in the scan order.
  • iS[r, c] denotes the scan position for a valid block position [r, c], where r denotes the row index and c denotes the column index in a transform block.
  • iS[r, c] ⁇ iS[r, c'] for any c' > c.
  • FIG. 10 is a diagram that shows a first example of a register set that corresponds to a horizontal template.
  • FIG. 11 is a diagram that shows a first example of a register set that corresponds to a vertical template.
  • FIG. 12 is a diagram that shows a first example of a register set that corresponds to a two- dimensional template.
  • the example of FIGS. 10-12 uses the first set of spatial neighboring templates of FIG. 9A to derive the contexts for base level symbols (i.e., BL[i]).
  • the register sets implement template-based coding by holding values for locations in the template being used, such as the horizontal template 901, the vertical template 902, and the two-dimensional template 903 in this example.
  • the register sets can correspond to the size and shape of the template being used, with each register value corresponding to a particular spatial location (e.g., a context neighbor) in the template. Accordingly, a value within a register array may be referred to herein as a context neighbor value.
  • the register sets include at least a first register array that has a first size (e.g., for storing a first number of values) and a second register array that has a second size (e.g., for storing a second number of values) that is different from the first size.
  • a register set includes one 8-bit register array and one 2-bit register array, which hold values corresponding to the horizontal template 901 on a per-row basis.
  • the register set is used for coding a particular value in a row of the transform block.
  • the number of register arrays in a register set is equal to the number of columns M.
  • a register set includes one 8-bit register array and one 2- bit register array, which hold values corresponding to the vertical template 902 on a per- column basis.
  • the register set is used for coding a particular value in a column of the transform block.
  • the number of register arrays in a register set is equal to the lower of the number of columns M and the number of rows N.
  • a register set includes two 4-bit register arrays and one 2-bit register array, which hold values corresponding to the two-dimensional template 903.
  • context neighbor values are stored in the register set for the context neighbors defined by the shape of the two-dimensional template 903, on either of a per-column or per-row basis (dependent on the smaller dimension of the transform), and a register set is used for coding a particular value in a column or row of the transform block.
  • the register sets described above all store values using 2-bit precision (e.g., an 8-bit register stores four 2-bit values and a 2-bit register stores one 2-bit value). It should be understood, however, that values of differing precisions could be utilized. It should further be understood that the number of values held in each register array can be changed according to the geometry of a particular spatial template.
  • FIG. 10 is a diagram that shows an example of a register set that corresponds to the horizontal template 901.
  • Each register set includes two register arrays, including a first register array S0 and a second register array Sl, which are defined respectively as:
  • the register array S0 stores values for the same row and to the right of a scan position i of one or more values for the transform coefficient being coded that indicates the magnitude of the transform coefficient
  • the register array S 1 stores a single value in the same column and one row below the scan position i of the one or more values for the transform coefficient being coded that indicates the magnitude of the transform coefficient.
  • the scan position i is labeled BL[i] here and in FIGS. 11-15 discussed below because it is the value BL[i] for the transform coefficient at the scan position i that is being coded (i.e., either encoded or decoded) in these examples. Accordingly, the scan position i may be referred to as the position of the value BL[i] being coded herein.
  • FIG. 11 is a diagram that shows an example of a register set that corresponds to the vertical template 902.
  • Each register set includes two register arrays, including a first register array S0 and a second register array Sl, which are defined respectively as:
  • the register array S0 stores values for the same column and below the position of the value BL[i] being coded
  • the register array S 1 stores a single value in the same row and one row to the right of the position of the value BL[i] being coded.
  • FIG. 12 is a diagram that shows an example of a register set that corresponds to the two-dimensional template 903.
  • Each register set includes three registers arrays, including a first register array S0, a second register array Sl, and a third register array S3, which are defined respectively as:
  • each register set is organized into three arrays, where in the first array (for S0) has size 2 (i.e., stores two coefficient neighbor values), the second array (for Sl) has size 2 (i.e., stores two coefficient neighbor values), and the third array (for S2) has size 1 (i.e., stores one coefficient neighbor value).
  • the register set is defined according to the transform type that was used to determine the transform coefficients for the transform block, and all of the values in a register set are initialized to zero.
  • the value BL[i] to be coded at scan position i, where BL[i] is from ⁇ 0, 1, 2, 3 ⁇ , is assigned a block position corresponding to the scan position i denoted by row r_i and column c_i.
  • the value BL[i] is obtained from base information, such as the level maps.
  • the input is the portion of the encoded bitstream from which the value BL[i] is derived.
  • the context to entropy code the value BL[i] is determined by combining (e.g., summing) the values from the register arrays, which represent the spatial context neighbors of the value BL[i] according to the template that corresponds to the transform type.
  • the values in a register array are updated to assume the values of their immediate neighbors, which in this case are values of the positions to the immediate left of the locations represented by each of the values in the register array.
  • the first value S0[r_l, 0] is updated to the value at the position that was just coded BL[i].
  • the remaining values in register array S0 assume the values from the preceding value in the register array (i.e., values in the register array are shifted by one position).
  • the sole value is updated using base information obtained from the level maps, namely the value to be coded for the cell located one row below and one column to the left of the position of the value BL[i] that was just coded, which is labeled with as value
  • this register set is ready for use in coding the next value in the same row (i.e., the value in the position directly to the left of the position of the value BL[i] that was just coded).
  • the values in the register arrays are updated to assume the values of their immediate neighbors, which in this case are values of the positions immediately above the locations represented by each of the values in the register array.
  • the first value S0[c_i, 0] is updated to the value BL[i] that was just coded.
  • the remaining values in the register array S0 assume the values from the preceding value in the register array (i.e., values in the register array are shifted by one position).
  • register array Sl the sole value is updated using base information obtained from the level maps, namely the value to be coded for the cell located one row above and one column to the right of the position of the value BL[i] that was just coded, which is value BL[iS[r_i-1, c_i-1 ]]. After updating, this register set is ready for use in coding the next value in the same column (i.e., the value in the position directly above the position of the value BL[i] that was just coded).
  • the context used to code the value BL[i] is derived by:
  • the register arrays are updated as follows.
  • the values in the register arrays are updated to assume the values of their immediate neighbors, which in this case are values of the positions immediately above the locations represented by each of the values in the register arrays.
  • the first value S0[c_i, 0] is updated to the value that was just coded BL[i]
  • the second value in register array S0 denoted by S0[c_i, 1]
  • assumes the value from the preceding value in the register array i.e., values in the register array are shifted by one position
  • the first value is updated using base information obtained from the level maps, namely the value to be coded for the cell located one row above and one column to the right of the position of the value BL[i] that was just coded, which is value BL[iS[r_i-1, c_i-1 ]], and the second value assumes the value from the first value of the second register array Sl[c_i, 0].
  • the sole value is updated using base information obtained from the level maps, namely the value to be coded for the cell located one row above and two columns to the right of the position of the value BL[i] that was just coded, which is value BL[iS[r_i-1, c_i+2]].
  • this register set is ready for use in coding the next value in the same column (i.e., the value in the position directly above the position of the value BL[i] that was just coded).
  • the register arrays can instead be defined on a per-row basis, with each register set being used to provide context for coding values in a row.
  • the contexts may be derived similarly to the contexts for base level symbols as described above with regard to FIGS. 10-12.
  • the contexts may be derived using different templates, such as those shown in FIG. 9B, and register arrays appropriate to the number and locations of the context neighbors.
  • a first group of register values e.g., a register array
  • a second group of register values e.g., a register array
  • This implementation reduces reliance on base information, which can increase efficiency and avoid performance issues such as memory bottlenecks while accurately modelling the context for each value being coded.
  • FIGS. 13-15 A second example in which information needed for context derivation is stored in register sets is shown in FIGS. 13-15.
  • FIG. 13 is a diagram that shows a second example of a register set that corresponds to a horizontal template.
  • FIG. 14 is a diagram that shows a second example of a register set that corresponds to a vertical template.
  • FIG. 15 is a diagram that shows a second example of a register set that corresponds to a two-dimensional template.
  • the first set of templates of FIG. 9A are used as an example. This
  • implementation avoids accessing previously coded base information, other than the value BL[i] being coded, to update register arrays after the value BL[i] is coded. Instead, the values that are not obtained by shifting of other values through the register arrays are based on the value BL[i]. This implementation may be preferable in cases where accessing the base information is costly.
  • one 8-bit register array may be defined to hold four 2-bit values for each row and one 2-bit register array may be defined to hold one 2-bit value for each column to hold values that correspond spatially to the horizontal template 901, with the values to the right of the value being coded stored on a per- row basis, and the value below the value being coded stored on a per-column basis.
  • one 8-bit register array may be defined to hold four 2-bit values for each column and one 2-bit register array may be defined to hold one 2- bit value for each row, with these register arrays holding values that correspond spatially to the vertical template 902, with the values below the value being coded stored on a per- column basis, and the value to the right of the value being coded stored on a per-row basis.
  • one 4-bit register array may be defined to hold two 2-bit values for each row, one 4-bit register array may be defined to hold two 2-bit values for each column, and one 2-bit register array may be defined to hold one 2-bit value for each diagonal to hold values that correspond spatially to the two-dimensional template 903, with the values to the right of the value being coded stored on a per-row basis, the values below the value being coded stored on a per-column basis, and the value diagonally below and to the right of the value being coded stored on a per-diagonal basis.
  • the foregoing examples utilize registers that have 2 bits of precision for each value. It should be understood, however, that values of differing precisions could be utilized. It should further be understood that the number of values held in each register can be changed according to the geometry of a particular spatial template.
  • the first register array S0 and the second register array Sl are defined respectively as:
  • the register array S0 includes values for the same row and to the right of the position of the value BL[i] being coded
  • the register array Sl includes a single value in the same column and one row below the position of the value BL[i] being coded.
  • the first register array S0 and the second register array Sl are defined respectively as:
  • the register array S0 includes values for the same column and below the position of the value BL[i] being coded
  • the register array S 1 includes a single value in the same row and one column to the right of the position of the value BL[i] being coded.
  • the first register array S0, the second register array Sl, and the third register array S2 are defined respectively as:
  • d is the index of the diagonal line, and can be determined based on the row index [r] and the column index [c] as follows:
  • the code (r ⁇ c) evaluates to zero when r ⁇ c is false and to one when r ⁇ c is true. Note that any bijective mapping of (r-c) to ⁇ 0, 1, ... , M+N-2 ⁇ can be used to define the index d. In cases where negative indices are allowed, r-c or c-r can be used directly as definition of the index d. As shown in FIG.
  • the first register array S0 includes values for the same column and below the position of the value BL[i] being coded
  • the second register array S 1 includes values for the same row and to the right of the position of the value BL[i] being coded
  • the third register array S2 includes a single value diagonally below and to the right of the position of the value BL[i] being coded.
  • the register sets are defined according to the transform type that was used to determine the transform coefficients for the transform block, and all of the values in the register arrays are initialized to zero.
  • the value BL[i] being coded is for scan position i, where the value BL[i] is an integer from ⁇ 0, 1, 2, 3 ⁇ .
  • the block position corresponding to the scan position i is denoted by row r_i and column c_i, as with the earlier examples.
  • the value BL[i] is obtained from base information, such as the level maps.
  • the value BL[i] is derived from a portion of the encoded bitstream using the context.
  • the context to code the value BL[i] is determined by summing the values from the register arrays, which represent the spatial context neighbors of the value BL[i] according to the template that corresponds to the transform type.
  • the first value S0[r_l, 0] is updated to the value BL[i] that was just coded.
  • the remaining values in the register array S0 assume the values from the preceding value in the register array (i.e., values in the register array are shifted by one position).
  • the sole value is updated to the value BL[i] that was just coded.
  • the register arrays are updated as follows.
  • the first value S0[c_i, 0] is updated to the value BL[i] that was just coded.
  • the remaining values in the register array S0 assume the values from the preceding value in the register array (i.e., values in the register array are shifted by one position).
  • the register array S0 is updated in a first-in-first-out (FIFO) manner by shifting out the oldest value and adding the value BL[i] as the newest entry.
  • the sole value is updated to the value BL[i] that was just coded.
  • the register arrays are updated as follows.
  • the code (r_i ⁇ c_i) evaluates to zero when r_i ⁇ c_i is false and to one when r_i ⁇ c_i is true.
  • FIG. 16 is a diagram that shows a third example of a register set that corresponds to a horizontal template.
  • FIG. 17 is a diagram that shows a third example of a register set that corresponds to a vertical template.
  • FIG. 18 is a diagram that shows a third example of a register set that corresponds to a two-dimensional template.
  • the example of FIGS. 16-18 uses the second set of spatial neighboring templates of FIG. 9B to derive the contexts for range level symbols (i.e., BR[i]).
  • This implementation avoids accessing previously coded base information, other than the value BR[i] being coded, to update a register set after the value BR[i] is coded. Instead, the values that are not obtained by shifting of other values through the register arrays are based on the value BR[i]. This implementation may be preferable in cases where accessing the base information is costly.
  • one 8-bit register array may be defined to hold two 4-bit values for each row and one 4-bit register array may defined to hold one 4-bit value for each column to hold values that correspond spatially to the horizontal template 905, with the values to the right of the value being coded stored on a per-row basis, and the value below the value being coded stored on a per-column basis.
  • one 8-bit register array may be defined to hold two 4-bit values for each column and one 4-bit register array may be defined to hold one 4-bit value for each row, with these register arrays holding values that correspond spatially to the vertical template 906, with the values below the value being coded stored on a per-column basis, and the value to the right of the value being coded stored on a per-row basis.
  • one 4-bit register array may be defined to hold one 4-bit value for each row
  • one 4-bit register array may be defined to hold one 4-bit value for each column
  • one 4-bit register array is defined to hold one 4-bit value for each diagonal to hold values that correspond spatially to the two-dimensional template 907, with the values to the right of the value being coded stored on a per-row basis, the values below the value being coded stored on a per-column basis, and the value diagonally below and to the right of the value being coded stored on a per-diagonal basis.
  • the foregoing examples utilize register arrays that have 4 bits of precision for each value. It should be understood, however, that values of differing precisions could be utilized. It should further be understood that the number of values held in each register array can be changed according to the geometry of a particular spatial template.
  • the first register array S0 and the second register array Sl are defined respectively as:
  • the register array S0 includes values for the same row and to the right of a scan position i of one or more values for the transform coefficient being coded that indicates the magnitude of the transform coefficient
  • the register array S 1 includes a single value in the same column and one row below the scan position i of the one or more values for the transform coefficient being coded that indicates the magnitude of the transform coefficient.
  • the scan position i is labeled BR[i] here and in FIGS. 17 and 18 because it is the value BR[i] for the transform coefficient at the scan position i that is being coded (i.e., either encoded or decoded) in these examples. Accordingly, the scan position i may be referred to as the position of the value BR[i] being coded herein.
  • the first register array S0 and the second register array Sl are defined respectively as:
  • the register array S0 includes values for the same column and below the position of the value BR[i] being coded
  • the register array S 1 includes a single value in the same row and one column to the right of the position of the value BR[i] being coded.
  • d is the index of the diagonal line, and can be determined based on the row index [r] and the column index [c] as follows:
  • the code (r ⁇ c) evaluates to zero when r ⁇ c is false and to one when r ⁇ c is true. Note that any bijective mapping of (r-c) to ⁇ 0, 1, .. M+N-2 ⁇ can be used to define the index d. In cases where negative indices are allowed, r-c or c-r can be used directly as definition of the index d.
  • the first register array S0 includes values for the same column and below the position of the value BR[i] being coded
  • the second register array S 1 includes values for the same row and to the right of the position of the value BR[i] being coded
  • the third register array S2 includes a single value diagonally below and to the right of the position of the value BR[i] being coded.
  • the register set is defined according to the transform type that was used to determine the transform coefficients for the transform block. Similar to the description above in regards to FIGS. 10-15, the values in the register arrays of a register set for a current block being encoded or decoded are initially set to a default value (e.g., zero).
  • the value BR[i] for the transform coefficient at scan position i is a value from ⁇ 0, 1, 2, ... 12 ⁇ .
  • the block position corresponding to the scan position i is denoted by row r_i and column c_i.
  • the value BR[i] being coded is obtained from base information, such as the level maps.
  • the value BR[i] being coded is derived from the encoded bitstream using entropy coding.
  • the context to code the value BR[i] is determined by summing the values from the register arrays, which represent the spatial context neighbors of the position of the value BR[i] according to the template that corresponds to the transform type.
  • the first value S0[r_l, 0] is updated to the value BR[i] that was just coded.
  • the remaining value in the register array S0 assumes the value from the preceding value in the register array (i.e., the value in the register array is shifted by one position).
  • the sole value is updated to the value BR[i] that was just coded.
  • the register arrays are updated as follows.
  • the first value S0[c_i, 0] is updated to the value BR[i] that was just coded.
  • the remaining value in register array S0 assumes the value from the preceding value in the register array (i.e., a value in the register array is shifted by one position).
  • the register array S0 is updated in a first-in-first-out (FIFO) manner by shifting out the oldest value and adding the value BR[i] as the newest entry.
  • the sole value is updated to the value BR[i] that was just coded.
  • the register arrays are updated as follows.
  • the code (r_i ⁇ c_i) evaluates to zero when r_i ⁇ c_i is false and to one when r_i ⁇ c_i is true.
  • the sole value S0[c_i, 0] is updated to the value BR[i] that was just coded.
  • the sole value S1[r_i, 0] is updated to the value BR[i] that was just coded.
  • the sole value is updated to the value BR[i] that was just coded.
  • one or more spatial templates used for determining the context neighbors for the quantized transform coefficients may be selected. Selecting the one or more spatial templates may include determining the transform type(s) available to generate the quantized transform coefficients in the transform block that is being coded. That is, the transform types indicate what spatial templates may be used for selecting context neighbors for coding one or more values representing the magnitude of a transform coefficient, here the value BL(i) and optionally the value BR(i).
  • the transform types may be a one-dimensional horizontal transform type, such as one from TX_CLASS_HORIZ, a one-dimensional vertical transform type, such as one from TX_CLASS_VERT, and a two-dimensional transform type, such as one from TX_CLASS_2D.
  • the spatial templates of FIGS. 9A and 9B may be used in this example.
  • the one or more spatial templates may be used to define the register arrays.
  • a register set of 5 register arrays are defined to derive context for base level symbols (i.e., BL[i]) and base range symbols (i.e., BR[i]).
  • Defining the register set includes determining the number and sizes of the register arrays that form the register set.
  • the number and sizes of the register arrays may be defined based on the sizes and shapes of the spatial templates and the largest expected size MxN of the transform block.
  • the cardinality (i.e., the number) of arrays may be equal to the number of context neighbors defined in the spatial templates.
  • the cardinality of the register arrays may comprise one plus a largest number of context neighbors in a row or column of the one or more spatial templates.
  • the largest number of context neighbors along the vertical or horizontal dimension is 4, and the templates 903, 907 include a diagonal context.
  • the register set includes 5 register arrays.
  • the largest expected size MxN for a transform block may be used to define sizes of the register arrays.
  • the largest dimension of the largest expected size may be used as the number of elements (i.e., context neighbor values) for 4 of the register arrays (where 4 is the largest vertical or horizontal dimension of the spatial templates).
  • the largest expected size also referred to as the largest transform size
  • the largest transform size is 32x32
  • 4 of the 5 register arrays have 32 elements each.
  • the number of elements (i.e., context neighbor values) of the fifth, final array is based on the expected number of diagonal elements for the largest transform size.
  • the remaining array has 63 elements in the range ⁇ 0, 1, ..., 62 ⁇ according to R - C + 31, where R comprises the row positions of the value BL or BR being coded in the range (0, 1, ..., 31) and C comprises the column positions of the value BL or BR to be coded in the range (0, 1, ..., 31).
  • the remaining array may have 64 elements (more generally, a multiple of 2 elements) instead of 63 elements.
  • a single register array of the register arrays has a size sufficient to store a number (i.e., a cardinality) of stored values corresponding to a number of values in a diagonal of a largest available transform size and remaining ones of the register arrays have an array size sufficient to store a number of stored values corresponding to a largest dimension of the largest available transform size.
  • the five register arrays are defined as follows:
  • uai4 indicates unsigned 4-bit integer type.
  • uai4 may be replaced by unsigned char or unsigned 8-bit integer type. That is, each element of a register array is sized to support at least one value, where the value is the largest expected value to be coded. In the examples herein, the largest expected value for the value BL is 3 and the largest expected value for the value BR is 12. Accordingly, a 4-bit register array element may be used to store one value, and an 8-bit register array element may be used to store two values.
  • the register arrays are initialized to a default value, desirably 0.
  • Deriving or determining the coding contexts used to code one or more values for a transform coefficient that indicate the magnitude of the transform coefficient at scan position i, where (r_i, c_i) denotes the block position corresponding to the scan position i following a given scan order, may be achieved using the defined register set. That is, the coding context may be determined using at least one of the stored values from the register arrays of the register set.
  • the register arrays of the register set may be used to compute two magnitude values, mag and br_mag, which are in turn used to derive the coding contexts for the value BL[i] and the value BR[i], respectively.
  • the magnitude values mag and br_mag may be determined based on the transform type of the transform block being coded.
  • the magnitude values may be determined according to the following pseudocode:
  • mag MIN(reg32_0[r_i], uai4(3)) + MIN(reg32_l[r_i], uai4(3)) +
  • mag MIN((mag+l)>>1, 4);
  • br_mag MIN((br_mag + l)>>1, 6).
  • the function reg32_0[r_i] returns the value in the first register array reg32_0 at the array position corresponding to the row r_i
  • the function reg32_l[r_i] returns the value in the second register array reg32_l at the array position corresponding to the row value r_i
  • the function reg32_2[r_i] returns the value in the third register array reg32_2 at the array position corresponding to the row value r_i
  • the function reg32_3[r_i] returns the value in the fourth register array reg32_3 at the array position corresponding to the row value r_i.
  • the function reg64[c_i] returns the value in the fifth register array reg64 at the array position corresponding to the column value c_i. For example, if the scan position i is at the block position (4, 0), the value at array position 4 in each of the first register array reg32_0, the second register array reg32_l, the third register array reg32_2, and the fourth register array reg32_3 is returned by the function reg32_0[r_i], the function reg32_l[r_i], the function reg32_2[r_i], and the function reg32_3[r_i] respectively. Similarly, the function reg64[c_i] returns the value at array position 0 in the fifth register array reg64.
  • the function uai4(3) returns the binary value for 3 in 4 bits, namely 0011.
  • the value 3 is used because it is the highest value for BL, and is hence the highest value for the context neighbors of BL(i). In alternative implementations, this value may be different.
  • the function MIN(a, b) returns the smaller value between a and b.
  • the function operator“>>” right-shifts a value by a designated number of bits, here 1 bit).
  • mag MIN(0, 0011) + MIN(0, 0011) + MIN(0, 0011) + MIN(0, 0011) + MIN(0, 0011) + MIN(0, 0011) + MIN(0, 0011) + MIN(0,
  • mag MIN((0+l)»1, 4);
  • mag MIN(0, 4);
  • br_mag MIN((0 + l)»l, 6);
  • the magnitude values may be determined according to the following pseudocode:
  • mag MIN(reg32_0[c_i], uai4(3)) + MIN(reg32_l[c_i], uai4(3)) +
  • br_mag reg32_0[c_i] + reg32_l[c_i] + reg64[r_i];
  • mag MIN((mag+l)>>l, 4);
  • br_mag MIN((br_mag + l)>>1, 6).
  • the function reg32_0[c_i] returns the value in the first register array reg32_0 at the array position corresponding to the column value c_i
  • the function reg32_l[c_i] returns the value in the second register array reg32_l at the array position corresponding to the column value c_i
  • the function reg32_2[c_i] returns the value in the third register array reg32_2 at the array position corresponding to the column value c_i
  • the function reg32_3[c_i] returns the value in the fourth register array reg32_3 at the array position corresponding to the column value c_i.
  • the function reg64[r_i] returns the value in the fifth register array reg64 at the array position corresponding to the row value r_i. For example, if the scan position i is at the block position (6, 2), the value at array position 6 (e.g., the seventh value) in each of the first register array reg32_0, the second register array reg32_l, the third register array reg32_2, and the fourth register array reg32_3 is returned by the function reg32_0[c_i], the function reg32_l[c_i], the function reg32_2[c_i], and the function reg32_3[c_i] respectively. Similarly, the function reg64[r_i] returns the value at array position 2 (e.g., the third value) in the fifth register array reg64.
  • the function reg64[r_i] returns the value at array position 2 (e.g., the third value) in the fifth register array reg64.
  • mag MIN(0l00, 0011) + MIN(0l00, 0011) + MIN(0, 0011) + MIN(0, 0011) + MIN(0, 0011);
  • mag MIN((0110+1)» 1, 4);
  • mag MIN(0111»1, 4);
  • mag MIN(00l l, 4);
  • br_mag MIN((1000 + 1)»1, 6);
  • br_mag MIN((100l)»1, 6);
  • the magnitude values may be determined according to the following pseudocode:
  • mag MIN(reg32_0[c_i], uai4(3)) + MIN(reg32_l[c_i], uai4(3)) +
  • mag MIN((mag+l)>>l, 4);
  • br_mag MIN((br_mag + l)>>l, 6).
  • diag r_i - c_i + 31, and is the index for the fifth register array reg64. Accordingly, the function reg64[diag] returns the value in the fifth register array at the array position corresponding to the index value diag.
  • the calculations are performed similarly to those where the transform type is one in TX_CLASS_HORIZ or
  • determining the coding context using at least some of the stored values includes determining, based on a transform type used for the transform block, a respective index for each of the register arrays using a column and/or a row of the scan position.
  • a stored value from each of the register arrays to determine the coding context is then selected using a respective index of each of the register arrays.
  • Selected stored values from each of the register arrays are summed to generate a first magnitude value (e.g., mag), while limiting each of the selected stored values to a first maximum value (e.g., 3) while summing. Then, the first magnitude value is normalized.
  • a second magnitude value e.g., br_mag
  • a first coding context for entropy coding a first value for the transform coefficient (e.g., BL[i]) indicative of a magnitude of the transform coefficient that is no greater than the first maximum value (e.g., 3) may be determined using the normalized first magnitude value
  • a second coding context for entropy coding a second value (e.g., BR[i]) for the transform coefficient indicative of the magnitude of the transform coefficient that is up to a second maximum value (e.g., 12) is determined using the normalized second magnitude value.
  • a context offset ctx_offset used to code the value BL[i] may be determined, also based on the transform type. If the transform type is one in TX_CLASS_2D, the following pseudocode may be used to determine ctx_offset:
  • w is the width of the transform block being coded
  • h is the height of the transform block being coded
  • && is a Boolean operator such that (a && b) evaluates to true when a and b are true and evaluates to false when either a or b is false.
  • the value of ctx_offset is based on the value of r_i and c_i.
  • the value of ctx_offset is based on the width and height of the transform block being coded.
  • ctx_offset is equal to zero. If r_i and c_i are both equal to 0, the remaining conditions are considered in order. Once a value is determined for ctx_offset in response to a condition, further processing of the conditions ends. For example, if w is less than h, but r_i is not less than 2, the next condition (i.e., whether (w > h && c_i ⁇ 2) evaluates to true) is considered. On the other hand, if w is less than h, and r_i is less than 2, ctx_offset is equal to 11 + mag. The next condition (i.e., whether (w > h && c_i ⁇ 2) evaluates to true) is not considered, nor are the subsequent conditions.
  • a context offset br_ctx_offset used to code BR[i] may be determined. If r_i and c_i are both equal to zero, the context coefficient br_ctx_offset is set equal to the magnitude value br_mag. Otherwise, the context coefficient br_ctx_offset is based on the transform type. If the transform type is one in TX_CLASS_2D, the context coefficient br_ctx_offset is set to br_mag + 7 if r_i and c_i are both less than 2. Otherwise, the context coefficient br_ctx_offset is set to br_mag + 14.
  • the context coefficient br_ctx_offset is set to br_mag + 7 if c_i is equal to 0. Otherwise, the context coefficient br_ctx_offset is set to br_mag + 14. Finally, if the transform type is one in TX_CLASS_VERT, the context coefficient br_ctx_offset is set to br_mag + 7 if r_i is equal to 0. Otherwise, the context coefficient br_ctx_offset is set to br_mag + 14.
  • the context offset ctx_offset is used, along with other information like transform size and whether the transform block is a luma or chroma block, to determine a context for the value BL[i].
  • a context specifies the probability distribution used in arithmetic coding. In the case for the value BL[i], the probability distribution is a 4-tuple.
  • arithmetic encoding codes the value BL[i] into a binary codeword by using the probability distribution given by the context.
  • arithmetic decoding decodes the value BL[i] from a binary codeword and the probability distribution.
  • the context offset br_ctx_offset is similarly used to determine a context for the value BR[i].
  • the register arrays are updated to prepare for context derivation at scan position i-1 if i > 0.
  • level BL[i] if BL[i] ⁇ 3
  • the register arrays may be updated as shown in the following pseudocode depending upon the transform type of the transform block:
  • reg32_3[r_i] reg32_2[r_i];
  • reg32_2[r_i] reg32_l[r_i];
  • reg32_l[r_i] reg32_0[r_i];
  • transform type is one in TX_CLASS_VERT:
  • reg32_l[c_i] reg32_0[c_i];
  • reg32_l[c_i] reg32_0[c_i];
  • reg32_3[r_i] reg32_2[r_i];
  • the values in the first register array at position r_i reg32_0[r_i] and the fifth register array at position c_i reg64[c_i] are updated to level, which value is based on the value BL[i] that was just coded as described above.
  • the value in the second register array at position r_i reg32_l[r_i] is updated to the value in the first register array at position r_i reg32_0[r_i].
  • the remaining values in the remaining register arrays at position r_i assume the values from the preceding register array at position r_i. That is, values in the register array are shifted by one array position.
  • the array position shift is a shift in position within an array.
  • the array position shift is a shift in position between arrays.
  • the values in the first register array at position c_i reg32_0[c_i] and the fifth register array at position r_i reg64[r_i] are updated to level, which value is based on the value at the position that was just coded BL[i] as described above.
  • the value in the second register array at position c_i reg32_l[c_i] is updated to the value in the first register array at position c_i reg32_0[r_i].
  • the remaining values in the remaining register arrays at position c_i assume the values from the preceding register array at position c_i (i.e., values in the register array are shifted by one array position).
  • the values in the first register array at position c_i reg32_0[c_i], the third register array at position r_i, and the fifth register array at position diag reg64[diag] are updated to level, which value is based on the value BL[i] that was just coded as described above.
  • the value in the second register array at position c_i reg32_l[c_i] is updated to the value in the first register array at position c_i reg32_0[r_i].
  • the remaining value in the fourth register array at position r_i assumes the value from the preceding (third) register array at position r_i reg32_2[r_i].
  • values in the register array are shifted by one array position.
  • FIG. 19 is a flowchart diagram of a process for coding a transform block according to an implementation of this disclosure.
  • the process 1900 can be implemented in an encoder such as the encoder 400.
  • the process 1900 is utilized in the process 800, for example, to implement coding of the value BL[i] in operation 802, the coding of the value BR[i] in operation 803, or both.
  • the process 1900 can be implemented, for example, as a software program that can be executed by computing devices such as transmitting station 102.
  • the software program can include machine-readable instructions that can be stored in a memory such as the memory 204 or the secondary storage 214, and that can be executed by a processor, such as CPU 202, to cause the computing device to perform the process 1900.
  • the process 1900 can be performed in whole or in part by the entropy encoding stage 408 of the encoder 400.
  • the process 1900 can be implemented using specialized hardware or firmware. Some computing devices can have multiple memories, multiple processors, or both. The steps or operations of the process 1900 can be distributed using different processors, memories, or both. Use of the terms“processor” or“memory” in the singular encompasses computing devices that have one processor or one memory as well as devices that have multiple processors or multiple memories that can be used in the performance of some or all of the recited steps.
  • the process 1900 can receive information that describes the magnitudes of transform coefficients.
  • the process 1900 can receive a transform block, such as the transform block 704, or level maps that represent values from the transform block 704, such as the non-zero map 708, the level-l map 712, and the level-2 map 714.
  • one or more spatial templates for a coding context may be determined or selected. This determination can be made based on the transform type that was used to determine the quantized transform coefficients in the transform block that is being coded.
  • the spatial templates are spatial arrangements of cells, anchored at the value being coded at the current scan position, from which the coding context is determined.
  • the templates may be horizontal, vertical, or two-dimensional templates, selected on the basis of use of a one-dimensional horizontal transform type, such as one from TX_CLASS_HORIZ, a one-dimensional vertical transform type, such as one from TX_CLASS_VERT, or a two- dimensional transform type, such as one from TX_CLASS_2D, respectively.
  • each of a plurality of differently transform types may correspond to selection of a different spatial template.
  • Examples of spatial templates that can be selected in operation 1901 include the horizontal templates 901, 905, the vertical template 902, 906, and the two-dimensional template 903, 907.
  • the spatial template for the coding context corresponds to an area that includes positions from at least two rows and positions from at least two columns, and a top-left position of the spatial template corresponds to the scan position.
  • the transform type may be a horizontal transform type, a vertical transform type, a two- dimensional transform type, or any combination thereof.
  • only one template may be selected for each of the determination of a context for coding the value BL, and where applicable the value BR.
  • all available templates may be selected.
  • all available templates for only the transform type may be selected. The selection of one or more templates at 1901 may be omitted where, for example all available templates are used, as the templates may be known a priori.
  • a spatial template determined in operation 1901 may include plural values from a same row as the scan position and a single value from a same column as the scan position when the transform type is the horizontal transform type.
  • a spatial template selected in operation 1901 may include plural values from a same column as the scan position and a single value from a same row as the scan position when the transform type is the vertical transform type.
  • a spatial template selected in operation 1901 may include plural values from a same column as the scan position, plural values from a same row as the scan position, and a single value from a same diagonal as the scan position when the transform type is the two- dimensional transform type.
  • register arrays are defined to hold values for the coding context.
  • the values held in the register arrays may be referred to herein as stored values.
  • the register arrays are defined based on, at least in part, the geometry of the spatial template(s) selected in operation 1901.
  • the values in the register arrays may each correspond to a position in the spatial template selected in operation 1901.
  • the stored values from the register arrays will each correspond to a respective position from the spatial template, and a particular value in each register array position will therefore correspond to a particular spatial location within the spatial template.
  • the values for the spatial template are stored in two or more register arrays, which each can hold values for a single row, column, or diagonal of the spatial template.
  • the register arrays may each correspond to a column index, a row index, or a diagonal index of the transform block.
  • the register arrays can be defined, for example, as described with reference to the examples shown in FIGS. 10-18.
  • the register arrays may be defined at operation 1902 based on the geometry of the spatial templates and based on the largest available transform size.
  • the largest available transform size may be 32x32.
  • the cardinality or number of register arrays may be defined by an array that has a size sufficient to store a number of values corresponding to the largest number of values in a diagonal of the largest available transform size and a number of arrays that correspond to the larger number of the largest number of columns or the largest number of rows of the spatial templates determined at 1901, where each of the latter register arrays has an array size sufficient to store a number of values corresponding to the larger of the largest number of columns or the largest number of rows of the largest available transform size.
  • the register arrays are initialized. Initializing the register arrays can include setting all of the values in the register arrays to a default value, such as zero.
  • entropy coding of values for transform coefficients indicative of magnitudes of the transform coefficients from the transform block begins by setting the scan position to a next position to be coded, referred to herein as the scan position i.
  • Various scan orders may be used for predicting a block that is used to produce the transform block.
  • Entropy coding is performed using the reverse of this scan order (referred to herein as a reverse scan order). Therefore, the first position to be coded corresponds to the first non-zero value that appears in the reverse scan order.
  • the scan position is decremented in operation 1904, such that operations 1905-1908 are performed again, which continues until all of the values from the transform block are coded.
  • a value for the transform coefficient being coded is obtained.
  • the value is indicative of a magnitude of the transform coefficient at the current scan position i within the current transform block being coded.
  • the value may be obtained from the transform block 704 and/or from level maps that represent the transform block.
  • the value being coded may be a single value corresponding to BL or BR, or may be two values corresponding to BL and BR.
  • the coding context is determined using the values from the register arrays.
  • the coding context may be determined by summing values from the register arrays, as described with reference to FIGS. 10-18.
  • the coding context for BL may be determined by summing values from the register arrays after those values are compared to the highest value for BL. The lower values from each of the comparisons are summed, and used to generate a magnitude value mag that is used to generate the coding context, a context offset ctx_offset.
  • the coding context for BR may be determined by summing values from fewer than all of the register arrays, which sum is then used to generate a magnitude value br_mag for generating the coding context, a context offset br_ctx_offset.
  • the coding contexts ctx_offset and br_ctx_offset also depend upon the scan position (r_i, c_i, or both).
  • the coding context ctx_offset may also depend upon the dimensions of the transform block (the width, the height, or both).
  • determining the coding context using the stored values from the register arrays includes selecting one or more register array positions that correspond to one of the column index, the row index, or the diagonal index for the scan position.
  • Operation 1907 includes entropy coding the one or more values (BL, BR, or both) using the coding context that was determined in operation 1906.
  • the coding context is used to select a statistical model for use in entropy coding, which is then performed, for example, as described with respect to the entropy encoding stage 408 of the encoder 400.
  • the output of operation 1907 may be inserted into an encoded bitstream.
  • Updating at least some of the stored values in the register arrays may include shifting one or more values by one register array position. This shifting may occur between register array positions within a single register array. The shifting may occur between register array positions of two register arrays. The register array positions of the two register arrays may be the same position (e.g., a common index or the same register index) in the two register arrays. That is, for example, shifting one or more stored values may comprise shifting the one or more stored values from an array position at an index within a first register array to an array position at a common index within a second register array.
  • Updating at least some of the stored values in the register arrays may include setting one or more values in the register arrays equal to the value that was coded in operation 1907. Where a single set of register arrays are used to determine a coding context for both values BL[i] and BR[i] at scan position i, updating at least some of the stored values in the register arrays may include setting one or more values in the register arrays equal to the value BL[i] that was coded in operation 1907 as long as the value BL[i] is less than the maximum value for BL[i] (e.g., 3) and otherwise setting the one or more values in the register arrays equal to the value BR[i] plus the maximum value for the value BL[i].
  • the maximum value for BL[i] e.g., 3
  • updating at least some of the stored values in the shift registers includes obtaining information from the values indicative of the magnitudes of the transform coefficients from the transform block.
  • These values may be the transform coefficient values themselves, absolute values of the transform coefficients, and/or values from level maps.
  • the values may be numbers or may be expressions, such as Boolean expressions. For example, the values can indicate whether the absolute value of each transform coefficient is equal to zero, equal to one, equal to two, or is greater than or equal to three.
  • FIG. 20 is a flowchart diagram of a process for coding a transform block according to another
  • the process 2000 can be implemented in a decoder such as the decoder 500.
  • the process 2000 is utilized in the process 800, for example, to implement coding of the value BL[i] in operation 802, the coding of the value BR[i] in operation 803, or both.
  • the process 2000 can be implemented, for example, as a software program that can be executed by computing devices such as receiving station 106.
  • the software program can include machine-readable instructions that can be stored in a memory such as the memory 204 or the secondary storage 214, and that can be executed by a processor, such as CPU 202, to cause the computing device to perform the process 2000.
  • the process 1900 can be performed in whole or in part by the entropy decoding stage 502 of the decoder 500.
  • the process 2000 can be implemented using specialized hardware or firmware. Some computing devices can have multiple memories, multiple processors, or both. The steps or operations of the process 2000 can be distributed using different processors, memories, or both.
  • the process 2000 can receive information that describes the magnitudes of transform coefficients.
  • the process 2000 can receive a portion of an encoded bitstream that includes an encoded transform block, such as the transform block 704, or encoded level maps that represent values from the transform block 704, such as the non-zero map 708, the level- 1 map 712, and the level-2 map 714.
  • operation 2001 one or more spatial templates for a coding context are determined or selected.
  • the operation 2001 may be the same as the operation 1901 described above.
  • register arrays are defined to hold stored values for the coding context.
  • the operation 2002 may be the same as the operation 1902 described above.
  • the register arrays are initialized. Initializing the register arrays can include setting all of the values in the register arrays to a default value, such as zero, as described above with regard to operation 1903.
  • entropy coding of values for transform coefficients indicative of magnitudes of the transform coefficients from the transform block begins by setting the scan position to the next position (e.g., in reverse scan order starting at the first non-zero value as described with regard to operation 1904.
  • the coding context is determined using the values from the register arrays.
  • the operation 2006 may be the same as the operation 1906 described above.
  • Operation 2007 includes entropy coding the one or more values (BL, BR, or both) for the transform coefficient at the scan position i set at operation 2004.
  • Entropy coding is performed using the coding context that was determined in operation 2006 with the encoded bitstream, such as the compressed bitstream 420, as input.
  • the coding context together with other information such as transform block size, prediction mode, etc., is used to select a statistical model for use in entropy coding.
  • Entropy coding may be performed, for example, as described with respect to the entropy decoding stage 502 of the encoder 400.
  • the output of operation 2007 is the value or values for the transform coefficient at the scan position i.
  • the process 2000 may be used to code the values BL and BR as described in operation 802 and 803, which values are then combined to produce the transform coefficient once the process 800 is completed for a transform coefficient.
  • Implementations of transmitting station 102 and/or receiving station 106 can be realized in hardware, software, or any combination thereof.
  • the hardware can include, for example, computers, intellectual property (IP) cores, application-specific integrated circuits (ASICs), programmable logic arrays, optical processors, programmable logic controllers, microcode, microcontrollers, servers, microprocessors, digital signal processors or any other suitable circuit.
  • IP intellectual property
  • ASICs application-specific integrated circuits
  • programmable logic arrays optical processors
  • programmable logic controllers programmable logic controllers
  • microcode microcontrollers
  • servers microprocessors, digital signal processors or any other suitable circuit.
  • processors should be understood as encompassing any of the foregoing hardware, either singly or in combination.
  • the terms“signal” and“data” are used interchangeably. Further, portions of transmitting station 102 and receiving station 106 do not necessarily have to be implemented in the same manner.
  • transmitting station 102 or receiving station 106 can be implemented using a general purpose computer or general purpose processor with a computer program that, when executed, carries out any of the respective methods, algorithms and/or instructions described herein.
  • a special purpose computer/processor can be utilized which can contain other hardware for carrying out any of the methods, algorithms, or instructions described herein.
  • Transmitting station 102 and receiving station 106 can, for example, be implemented on computers in a video conferencing system.
  • transmitting station 102 can be implemented on a server and receiving station 106 can be implemented on a device separate from the server, such as a hand-held communications device.
  • transmitting station 102 can encode content using an encoder 400 into an encoded video signal and transmit the encoded video signal to the communications device.
  • the communications device can then decode the encoded video signal using a decoder 500.
  • the communications device can decode content stored locally on the communications device, for example, content that was not transmitted by transmitting station 102.
  • Other transmitting station 102 and receiving station 106 implementation schemes are available.
  • receiving station 106 can be a generally stationary personal computer rather than a portable communications device and/or a device including an encoder 400 may also include a decoder 500.
  • implementations of the present disclosure can take the form of a computer program product accessible from, for example, a tangible computer- usable or computer-readable medium.
  • a computer-usable or computer-readable medium can be any device that can, for example, tangibly contain, store, communicate, or transport the program for use by or in connection with any processor.
  • the medium can be, for example, an electronic, magnetic, optical, electromagnetic, or a semiconductor device. Other suitable mediums are also available.
  • Example 1 A method of coding a transform block having transform coefficients, comprising: selecting, based on a transform type used for the transform block, a spatial template for a coding context; defining shift registers to each hold one or more stored values regarding the coding context; initializing the shift registers by setting the stored values to default values; and coding values indicative of magnitudes of the transform coefficients from the transform block in a reverse scan order including, for each of one or more values:
  • obtaining a value to be coded at a scan position determining the coding context using the stored values from the shift registers, entropy coding the value to be coded using the coding context, and subsequent to entropy coding the value to be coded, updating at least some of the stored values in the shift registers.
  • Example 2 The method of Example 1, wherein the shift registers are defined to correspond to a geometric arrangement of the spatial template, such that the stored values from the shift registers each correspond to a respective position from the spatial template.
  • Example 3 The method of Example 1 or 2, wherein the shift registers include at least a first shift register that has a first size and a second shift register that has a second size that is different from the first size.
  • Example 4 The method of any of Examples 1 to 3, wherein the shift registers each correspond to a column index, a row index, or a diagonal index of the transform block.
  • Example 5 The method of Example 4, wherein determining the coding context using the stored values from the shift registers includes selecting one or more of the shift registers that correspond to one of the column index, the row index, or the diagonal index for the scan position.
  • Example 6 The method of any of Examples 1 to 5, wherein updating at least some of the stored values in the shift registers includes shifting one or more values by one position.
  • Example 7 The method of any of Examples 1 to 6, wherein updating at least some of the stored values in the shift registers includes setting one or more values in the shift registers equal to the value to be coded.
  • Example 8 The method of any of Examples 1 to 7, wherein updating at least some of the stored values in the shift registers includes obtaining information from the values indicative of the magnitudes of the transform coefficients from the transform block.
  • Example 9 The method of any of Examples 1 to 8, wherein the spatial template for the coding context corresponds to an area that includes positions from at least two rows and positions from at least two columns, and a top-left position of the spatial template corresponds to the scan position.
  • Example 11 An apparatus for coding a transform block having transform coefficients, comprising: a memory; and a processor configured to execute instructions stored in the memory to: select, based on a transform type used for the transform block, a spatial template for a coding context; define shift registers to each hold one or more stored values regarding the coding context; initialize the shift registers by setting the stored values to default values; and code values indicative of magnitudes of the transform coefficients from the transform block in a reverse scan order, wherein the instructions further cause the processor to, for each of one or more values: obtain a value to be coded at a scan position, determine the coding context using the stored values from the shift registers, entropy code the value to be coded using the coding context, and subsequent to entropy coding the value to be coded, update at least some of the stored values in the shift registers.
  • Example 12 The apparatus of Example 11, wherein the shift registers are defined to correspond to a geometric arrangement of the spatial template, such that the stored values from the shift registers each correspond to a respective position from the spatial template.
  • Example 13 The apparatus of Example 11 or 12, wherein the shift registers include at least a first shift register that has a first size and a second shift register that has a second size that is smaller than the first size.
  • Example 14 The apparatus of any of Examples 11 to 13, wherein the shift registers each correspond to a column index, a row index, or a diagonal index of the transform block, and the instructions further cause the processor to determine the coding context using the stored values from the shift registers includes selecting one or more of the shift registers that correspond to one of the column index, the row index, or the diagonal index for the scan position.
  • Example 15 The apparatus of any of Examples 11 to 14, wherein the instructions cause the processor to update at least some of the stored values in the shift registers includes shifting one or more values by one position, and the instructions cause the processor to update at least some of the stored values in the shift registers includes setting one or more values in the shift registers equal to the value to be coded.
  • Example 16 The apparatus of any of Examples 11 to 15, wherein the instructions cause the processor to update at least some of the stored values in the shift registers includes obtaining information from the values indicative of the magnitudes of the transform coefficients from the transform block.
  • Example 17 The apparatus of any of Examples 11 to 16, wherein the spatial template for the coding context corresponds to an area that includes positions from at least two rows and positions from at least two columns, and a top-left position of the spatial template corresponds to the scan position.
  • Example 18 A non-transitory computer-readable storage device including program instructions executable by one or more processors that, when executed, cause the one or more processors to perform operations for coding a transform block having transform coefficients, the operations comprising: selecting, based on a transform type used for the transform block, a spatial template for a coding context; defining shift registers to each hold one or more stored values regarding the coding context; initializing the shift registers by setting the stored values to default values; and coding values indicative of magnitudes of the transform coefficients from the transform block in a reverse scan order including, for each of one or more values: obtaining a value to be coded at a scan position, determining the coding context using the stored values from the shift registers, entropy coding the value to be coded using the coding context, and subsequent to entropy coding the value to be coded, updating at least some of the stored values in the shift registers.
  • Example 19 The non-transitory computer-readable storage device of Example 18, wherein the shift registers each correspond to a column index, a row index, or a diagonal index of the transform block, and determining the coding context using the stored values from the shift registers includes selecting one or more of the shift registers that correspond to one of the column index, the row index, or the diagonal index for the scan position.
  • Example 20 The non-transitory computer-readable storage device of Example 18 or 19, wherein updating at least some of the stored values in the shift registers includes shifting one or more values by one position, and updating at least some of the stored values in the shift registers includes setting one or more values in the shift registers equal to the value to be coded.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Computing Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
EP18779974.7A 2017-12-08 2018-09-14 Context derivation for coefficient coding Withdrawn EP3721630A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US15/835,501 US10547869B2 (en) 2017-12-08 2017-12-08 Template-based entropy coding of quantized transform coefficients
US16/033,582 US10609421B2 (en) 2018-07-12 2018-07-12 Context derivation for coefficient coding
PCT/US2018/051041 WO2019112669A1 (en) 2017-12-08 2018-09-14 Context derivation for coefficient coding

Publications (1)

Publication Number Publication Date
EP3721630A1 true EP3721630A1 (en) 2020-10-14

Family

ID=63714136

Family Applications (1)

Application Number Title Priority Date Filing Date
EP18779974.7A Withdrawn EP3721630A1 (en) 2017-12-08 2018-09-14 Context derivation for coefficient coding

Country Status (3)

Country Link
EP (1) EP3721630A1 (zh)
CN (2) CN114449277B (zh)
WO (1) WO2019112669A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117097905B (zh) * 2023-10-11 2023-12-26 合肥工业大学 一种无损图像分块压缩方法、设备、存储介质

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6549666B1 (en) * 1994-09-21 2003-04-15 Ricoh Company, Ltd Reversible embedded wavelet system implementation
TWI348653B (en) * 2006-06-08 2011-09-11 Via Tech Inc Decoding of context adaptive binary arithmetic codes in computational core of programmable graphics processing unit
GB201007406D0 (en) * 2010-05-04 2010-06-16 Aspex Semiconductor Ltd Block motion estimation
US20130003858A1 (en) * 2011-06-30 2013-01-03 Vivienne Sze Simplified Context Selection For Entropy Coding of Transform Coefficient Syntax Elements
US10390046B2 (en) * 2011-11-07 2019-08-20 Qualcomm Incorporated Coding significant coefficient information in transform skip mode
US9363510B2 (en) * 2012-03-02 2016-06-07 Qualcomm Incorporated Scan-based sliding window in context derivation for transform coefficient coding
US9781424B2 (en) * 2015-01-19 2017-10-03 Google Inc. Efficient context handling in arithmetic coding

Also Published As

Publication number Publication date
WO2019112669A1 (en) 2019-06-13
CN110710219B (zh) 2022-02-11
CN110710219A (zh) 2020-01-17
CN114449277A (zh) 2022-05-06
CN114449277B (zh) 2024-06-07

Similar Documents

Publication Publication Date Title
US11477462B2 (en) Entropy coding using transform class
EP3590258B1 (en) Transform kernel selection and entropy coding
US11039131B2 (en) Intra-prediction for smooth blocks in image/video
US10609421B2 (en) Context derivation for coefficient coding
EP3677027A1 (en) Mixing of probabilities for entropy coding in video compression
EP3685586A1 (en) Coding of last significant coefficient flags
WO2019152570A1 (en) Efficient context model computation design in transform coefficient coding
US11917156B2 (en) Adaptation of scan order for entropy coding
WO2018222238A1 (en) Improved coding of intra-prediction modes
US20170164007A1 (en) Mixed boolean-token ans coefficient coding
US10547869B2 (en) Template-based entropy coding of quantized transform coefficients
US11991392B2 (en) Efficient context model computation design in transform coefficient coding
EP3673653B1 (en) Embedding information about token tree traversal
CN110710219B (zh) 用于系数代码化的上下文推导的方法和设备
CN110692247B (zh) 复合运动补偿的预测
CN116830574A (zh) 具有指定比特深度精度的调色板模式代码化

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20191213

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20210924

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20220205

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230525