This disclosure relates to video coding and more particularly to techniques for signaling buffering information for coded video.
Digital video capabilities can be incorporated into a wide range of devices, including digital televisions, laptop or desktop computers, tablet computers, digital recording devices, digital media players, video gaming devices, cellular telephones, including so-called smartphones, medical imaging devices, and the like. Digital video may be coded according to a video coding standard. Video coding standards define the format of a compliant bitstream encapsulating coded video data. A compliant bitstream is a data structure that may be received and decoded by a video decoding device to generate reconstructed video data. Video coding standards may incorporate video compression techniques. Examples of video coding standards include ISO/IEC MPEG-4 Visual and ITU-T H.264 (also known as ISO/IEC MPEG-4 AVC) and High-Efficiency Video Coding (HEVC). HEVC is described in High Efficiency Video Coding (HEVC), Rec. ITU-T H.265, December 2016, which is incorporated by reference, and referred to herein as ITU-T H.265. Extensions and improvements for ITU-T H.265 are currently being considered for the development of next generation video coding standards. For example, the ITU-T Video Coding Experts Group (VCEG) and ISO/IEC (Moving Picture Experts Group (MPEG) (collectively referred to as the Joint Video Exploration Team (JVET)) are working to standardized video coding technology with a compression capability that significantly exceeds that of the current HEVC standard. The Joint Exploration Model 7 (JEM 7), Algorithm Description of Joint Exploration Test Model 7 (JEM 7), ISO/IEC JTC1/SC29/WG11 Document: JVET-G1001, July 2017, Torino, IT, which is incorporated by reference herein, describes the coding features that were under coordinated test model study by the JVET as potentially enhancing video coding technology beyond the capabilities of ITU-T H.265. It should be noted that the coding features of JEM 7 are implemented in JEM reference software. As used herein, the term JEM may collectively refer to algorithms included in JEM 7 and implementations of JEM reference software. Further, in response to a “Joint Call for Proposals on Video Compression with Capabilities beyond HEVC,” jointly issued by VCEG and MPEG, multiple descriptions of video coding tools were proposed by various groups at the 10th Meeting of ISO/IEC JTC1/SC29/WG11 16-20 Apr. 2018, San Diego, CA. From the multiple descriptions of video coding tools, a resulting initial draft text of a video coding specification is described in “Versatile Video Coding (Draft 1),” 10th Meeting of ISO/IEC JTC1/SC29/WG11 16-20 Apr. 2018, San Diego, CA, document JVET-J1001-v2, which is incorporated by reference herein, and referred to as JVET-J1001. The current development of a next generation video coding standard by the VCEG and MPEG is referred to as the Versatile Video Coding (VVC) project. “Versatile Video Coding (Draft 9),” 18th Meeting of ISO/IEC JTC1/SC29/WG11 15-24 Apr. 2020, Teleconference, document JVET-R2001-vA, which is incorporated by reference herein, and referred to as JVET-R2001, represents the current iteration of the draft text of a video coding specification corresponding to the VVC project.
Video compression techniques enable data requirements for storing and transmitting video data to be reduced. Video compression techniques may reduce data requirements by exploiting the inherent redundancies in a video sequence. Video compression techniques may sub-divide a video sequence into successively smaller portions (i.e., groups of pictures within a video sequence, a picture within a group of pictures, regions within a picture, sub-regions within regions, etc.). Intra prediction coding techniques (e.g., spatial prediction techniques within a picture) and inter prediction techniques (i.e., inter-picture techniques (temporal)) may be used to generate difference values between a unit of video data to be coded and a reference unit of video data. The difference values may be referred to as residual data. Residual data may be coded as quantized transform coefficients. Syntax elements may relate residual data and a reference coding unit (e.g., intra-prediction mode indices, and motion information). Residual data and syntax elements may be entropy coded. Entropy encoded residual data and syntax elements may be included in data structures forming a compliant bitstream.
In general, this disclosure describes various techniques for coding video data. In particular, this disclosure describes techniques for signaling buffering period information for coded video data. It should be noted that although techniques of this disclosure are described with respect to ITU-T H.264, ITU-T H.265, JEM, and JVET-R2001, the techniques of this disclosure are generally applicable to video coding. For example, the coding techniques described herein may be incorporated into video coding systems, (including video coding systems based on future video coding standards) including video block structures, intra prediction techniques, inter prediction techniques, transform techniques, filtering techniques, and/or entropy coding techniques other than those included in ITU-T H.265, JEM, and JVET-R2001. Thus, reference to ITU-T H.264, ITU-T H.265, JEM, and/or JVET-R2001 is for descriptive purposes and should not be construed to limit the scope of the techniques described herein. Further, it should be noted that incorporation by reference of documents herein is for descriptive purposes and should not be construed to limit or create ambiguity with respect to terms used herein. For example, in the case where an incorporated reference provides a different definition of a term than another incorporated reference and/or as the term is used herein, the term should be interpreted in a manner that broadly includes each respective definition and/or in a manner that includes each of the particular definitions in the alternative.
In one example, a method of decoding video data includes: receiving a buffering period message; parsing a first syntax element in the buffering period message, wherein the first syntax element plus one specifies a maximum number (M) of temporal sublayers for which coded picture buffer removal delay and coded picture buffer removal offset are indicated in the buffering period message; and parsing a second syntax element in the buffering period message, in a case that a value of the first syntax element is greater than a threshold value, wherein the second syntax element specifies whether decoded picture buffer output time offsets are present for temporal sublayer representations.
In one example, the method further includes: parsing a third syntax element in the buffering period message, in a case that a value of the first syntax element is greater than the threshold value, wherein the third syntax element specifies whether initial coded picture buffer removal delay related syntax elements are present for temporal sublayer representations in the range of 0 to M−1 or initial coded picture buffer removal delay related syntax elements are present for (M−1)-th temporal sublayer representations.
In one example, the method further includes: parsing a fourth syntax element in the buffering period message, in a case that a value of the first syntax element is greater than the threshold value, wherein the fourth syntax element specifies the buffering period message contains coded picture buffer removal delay deltas or no coded picture buffer removal delay deltas are present in the buffering period message.
In one example, a device includes one or more processors configured to: receive a buffering period message; parse a first syntax element in the buffering period message, wherein the first syntax element plus one specifies a maximum number of temporal sublayers for which coded picture buffer removal delay and coded picture buffer removal offset are indicated in the buffering period message; and parse a second syntax element in the buffering period message, in a case that a value of the first syntax element is greater than a threshold value, wherein the second syntax element specifies whether decoded picture buffer output time offsets are present for temporal sublayer representations.
In one example, a method of encoding image data includes signaling a buffering period message. The buffering period message includes (i) a first syntax element, wherein the first syntax element plus one specifies a maximum number of temporal sublayers for which coded picture buffer removal delay and coded picture buffer removal offset are indicated in the buffering period message and (ii) a second syntax element specifying whether decoded picture buffer output time offsets are present for temporal sublayer representations, in a case that a value of the first syntax element is greater than a threshold value.
The details of one or more examples are set forth in the accompanying drawings and the description below. Other features, objects, and advantages will be apparent from the description and drawings, and from the claims.
Video content includes video sequences comprised of a series of frames (or pictures). A series of frames may also be referred to as a group of pictures (GOP). Each video frame or picture may divided into one or more regions. Regions may be defined according to a base unit (e.g., a video block) and sets of rules defining a region. For example, a rule defining a region may be that a region must be an integer number of video blocks arranged in a rectangle. Further, video blocks in a region may be ordered according to a scan pattern (e.g., a raster scan). As used herein, the term video block may generally refer to an area of a picture or may more specifically refer to the largest array of sample values that may be predictively coded, sub-divisions thereof, and/or corresponding structures. Further, the term current video block may refer to an area of a picture being encoded or decoded. A video block may be defined as an array of sample values. It should be noted that in some cases pixel values may be described as including sample values for respective components of video data, which may also be referred to as color components, (e.g., luma (Y) and chroma (Cb and Cr) components or red, green, and blue components). It should be noted that in some cases, the terms pixel value and sample value are used interchangeably. Further, in some cases, a pixel or sample may be referred to as a pel. A video sampling format, which may also be referred to as a chroma format, may define the number of chroma samples included in a video block with respect to the number of luma samples included in a video block. For example, for the 4:2:0 sampling format, the sampling rate for the luma component is twice that of the chroma components for both the horizontal and vertical directions.
A video encoder may perform predictive encoding on video blocks and sub-divisions thereof. Video blocks and sub-divisions thereof may be referred to as nodes. ITU-T H.264 specifies a macroblock including 16×16 luma samples. That is, in ITU-T H.264, a picture is segmented into macroblocks. ITU-T H.265 specifies an analogous Coding Tree Unit (CTU) structure (which may be referred to as a largest coding unit (LCU)). In ITU-T H.265, pictures are segmented into CTUs. In ITU-T H.265, for a picture, a CTU size may be set as including 16×16, 32×32, or 64×64 luma samples. In ITU-T H.265, a CTU is composed of respective Coding Tree Blocks (CTB) for each component of video data (e.g., luma (Y) and chroma (Cb and Cr). It should be noted that video having one luma component and the two corresponding chroma components may be described as having two channels, i.e., a luma channel and a chroma channel. Further, in ITU-T H.265, a CTU may be partitioned according to a quadtree (QT) partitioning structure, which results in the CTBs of the CTU being partitioned into Coding Blocks (CB). That is, in ITU-T H.265, a CTU may be partitioned into quadtree leaf nodes. According to ITU-T H.265, one luma CB together with two corresponding chroma CBs and associated syntax elements are referred to as a coding unit (CU). In ITU-T H.265, a minimum allowed size of a CB may be signaled. In ITU-T H.265, the smallest minimum allowed size of a luma CB is 8×8 luma samples. In ITU-T H.265, the decision to code a picture area using intra prediction or inter prediction is made at the CU level.
In ITU-T H.265, a CU is associated with a prediction unit structure having its root at the CU. In ITU-T H.265, prediction unit structures allow luma and chroma CBs to be split for purposes of generating corresponding reference samples. That is, in ITU-T H.265, luma and chroma CBs may be split into respective luma and chroma prediction blocks (PBs), where a PB includes a block of sample values for which the same prediction is applied. In ITU-T H.265, a CB may be partitioned into 1, 2, or 4 PBs. ITU-T H.265 supports PB sizes from 64×64 samples down to 4×4 samples. In ITU-T H.265, square PBs are supported for intra prediction, where a CB may form the PB or the CB may be split into four square PBs. In ITU-T H.265, in addition to the square PBs, rectangular PBs are supported for inter prediction, where a CB may be halved vertically or horizontally to form PBs. Further, it should be noted that in ITU-T H.265, for inter prediction, four asymmetric PB partitions are supported, where the CB is partitioned into two PBs at one quarter of the height (at the top or the bottom) or width (at the left or the right) of the CB. Intra prediction data (e.g., intra prediction mode syntax elements) or inter prediction data (e.g., motion data syntax elements) corresponding to a PB is used to produce reference and/or predicted sample values for the PB.
JEM specifies a CTU having a maximum size of 256×256 luma samples. JEM specifies a quadtree plus binary tree (QTBT) block structure. In JEM, the QTBT structure enables quadtree leaf nodes to be further partitioned by a binary tree (BT) structure. That is, in JEM, the binary tree structure enables quadtree leaf nodes to be recursively divided vertically or horizontally. In JVET-R2001, CTUs are partitioned according a quadtree plus multi-type tree (QTMT or QT+MTT) structure. The QTMT in JVET-R2001 is similar to the QTBT in JEM. However, in JVET-R2001, in addition to indicating binary splits, the multi-type tree may indicate so-called ternary (or triple tree (TT)) splits. A ternary split divides a block vertically or horizontally into three blocks. In the case of a vertical TT split, a block is divided at one quarter of its width from the left edge and at one quarter its width from the right edge and in the case of a horizontal TT split a block is at one quarter of its height from the top edge and at one quarter of its height from the bottom edge.
As described above, each video frame or picture may be divided into one or more regions. For example, according to ITU-T H.265, each video frame or picture may be partitioned to include one or more slices and further partitioned to include one or more tiles, where each slice includes a sequence of CTUs (e.g., in raster scan order) and where a tile is a sequence of CTUs corresponding to a rectangular area of a picture. It should be noted that a slice, in ITU-T H.265, is a sequence of one or more slice segments starting with an independent slice segment and containing all subsequent dependent slice segments (if any) that precede the next independent slice segment (if any). A slice segment, like a slice, is a sequence of CTUs. Thus, in some cases, the terms slice and slice segment may be used interchangeably to indicate a sequence of CTUs arranged in a raster scan order. Further, it should be noted that in ITU-T H.265, a tile may consist of CTUs contained in more than one slice and a slice may consist of CTUs contained in more than one tile. However, ITU-T H.265 provides that one or both of the following conditions shall be fulfilled: (1) All CTUs in a slice belong to the same tile; and (2) All CTUs in a tile belong to the same slice.
With respect to JVET-R2001, slices are required to consist of an integer number of complete tiles or an integer number of consecutive complete CTU rows within a tile, instead of only being required to consist of an integer number of CTUs. It should be noted that in JVET-R2001, the slice design does not include slice segments (i.e., no independent/dependent slice segments). Thus, in JVET-R2001, a picture may include a single tile, where the single tile is contained within a single slice or a picture may include multiple tiles where the multiple tiles (or CTU rows thereof) may be contained within one or more slices. In JVET-R2001, the partitioning of a picture into tiles is specified by specifying respective heights for tile rows and respective widths for tile columns. Thus, in JVET-R2001 a tile is a rectangular region of CTUs within a particular tile row and a particular tile column position. Further, it should be noted that JVET-R2001 provides where a picture may be partitioned into subpictures, where a subpicture is a rectangular region of a CTUs within a picture. The top-left CTU of a subpicture may be located at any CTU position within a picture with subpictures being constrained to include one or more slices Thus, unlike a tile, a subpicture is not necessarily limited to a particular row and column position. It should be noted that subpictures may be useful for encapsulating regions of interest within a picture and a sub-bitstream extraction process may be used to only decode and display a particular region of interest. That is, as described in further detail below, a bitstream of coded video data includes a sequence of network abstraction layer (NAL) units, where a NAL unit encapsulates coded video data, (i.e., video data corresponding to a slice of picture) or a NAL unit encapsulates metadata used for decoding video data (e.g., a parameter set) and a sub-bitstream extraction process forms a new bitstream by removing one or more NAL units from a bitstream.
For intra prediction coding, an intra prediction mode may specify the location of reference samples within a picture. In ITU-T H.265, defined possible intra prediction modes include a planar (i.e., surface fitting) prediction mode, a DC (i.e., flat overall averaging) prediction mode, and 33 angular prediction modes (predMode: 2-34). In JEM, defined possible intra-prediction modes include a planar prediction mode, a DC prediction mode, and 65 angular prediction modes. It should be noted that planar and DC prediction modes may be referred to as non-directional prediction modes and that angular prediction modes may be referred to as directional prediction modes. It should be noted that the techniques described herein may be generally applicable regardless of the number of defined possible prediction modes.
For inter prediction coding, a reference picture is determined and a motion vector (MV) identifies samples in the reference picture that are used to generate a prediction for a current video block. For example, a current video block may be predicted using reference sample values located in one or more previously coded picture(s) and a motion vector is used to indicate the location of the reference block relative to the current video block. A motion vector may describe, for example, a horizontal displacement component of the motion vector (i.e., MVx), a vertical displacement component of the motion vector (i.e., MVy), and a resolution for the motion vector (e.g., one-quarter pixel precision, one-half pixel precision, one-pixel precision, two-pixel precision, four-pixel precision). Previously decoded pictures, which may include pictures output before or after a current picture, may be organized into one or more to reference pictures lists and identified using a reference picture index value. Further, in inter prediction coding, uni-prediction refers to generating a prediction using sample values from a single reference picture and bi-prediction refers to generating a prediction using respective sample values from two reference pictures. That is, in uni-prediction, a single reference picture and corresponding motion vector are used to generate a prediction for a current video block and in bi-prediction, a first reference picture and corresponding first motion vector and a second reference picture and corresponding second motion vector are used to generate a prediction for a current video block. In bi-prediction, respective sample values are combined (e.g., added, rounded, and clipped, or averaged according to weights) to generate a prediction. Pictures and regions thereof may be classified based on which types of prediction modes may be utilized for encoding video blocks thereof. That is, for regions having a B type (e.g., a B slice), bi-prediction, uni-prediction, and intra prediction modes may be utilized, for regions having a P type (e.g., a P slice), uni-prediction, and intra prediction modes may be utilized, and for regions having an I type (e.g., an I slice), only intra prediction modes may be utilized. As described above, reference pictures are identified through reference indices. For example, for a P slice, there may be a single reference picture list, RefPicList0 and for a B slice, there may be a second independent reference picture list, RefPicList1, in addition to RefPicList0. It should be noted that for uni-prediction in a B slice, one of RefPicList0 or RefPicList1 may be used to generate a prediction. Further, it should be noted that during the decoding process, at the onset of decoding a picture, reference picture list(s) are generated from previously decoded pictures stored in a decoded picture buffer (DPB).
Further, a coding standard may support various modes of motion vector prediction. Motion vector prediction enables the value of a motion vector for a current video block to be derived based on another motion vector. For example, a set of candidate blocks having associated motion information may be derived from spatial neighboring blocks and temporal neighboring blocks to the current video block. Further, generated (or default) motion information may be used for motion vector prediction. Examples of motion vector prediction include advanced motion vector prediction (AMVP), temporal motion vector prediction (TMVP), so-called “merge” mode, and “skip” and “direct” motion inference. Further, other examples of motion vector prediction include advanced temporal motion vector prediction (ATMVP) and Spatial-temporal motion vector prediction (STMVP). For motion vector prediction, both a video encoder and video decoder perform the same process to derive a set of candidates. Thus, for a current video block, the same set of candidates is generated during encoding and decoding.
As described above, for inter prediction coding, reference samples in a previously coded picture are used for coding video blocks in a current picture. Previously coded pictures which are available for use as reference when coding a current picture are referred as reference pictures. It should be noted that the decoding order does not necessary correspond with the picture output order, i.e., the temporal order of pictures in a video sequence. In ITU-T H.265, when a picture is decoded it is stored to a decoded picture buffer (DPB) (which may be referred to as frame buffer, a reference buffer, a reference picture buffer, or the like). In ITU-T H.265, pictures stored to the DPB are removed from the DPB when they been output and are no longer needed for coding subsequent pictures. In ITU-T H.265, a determination of whether pictures should be removed from the DPB is invoked once per picture, after decoding a slice header, i.e., at the onset of decoding a picture. For example, referring to
As described above, intra prediction data or inter prediction data is used to produce reference sample values for a block of sample values. The difference between sample values included in a current PB, or another type of picture area structure, and associated reference samples (e.g., those generated using a prediction) may be referred to as residual data. Residual data may include respective arrays of difference values corresponding to each component of video data. Residual data may be in the pixel domain. A transform, such as, a discrete cosine transform (DCT), a discrete sine transform (DST), an integer transform, a wavelet transform, or a conceptually similar transform, may be applied to an array of difference values to generate transform coefficients. It should be noted that in ITU-T H.265 and JVET-R2001, a CU is associated with a transform tree structure having its root at the CU level. The transform tree is partitioned into one or more transform units (TUs). That is, an array of difference values may be partitioned for purposes of generating transform coefficients (e.g., four 8×8 transforms may be applied to a 16×16 array of residual values). For each component of video data, such sub-divisions of difference values may be referred to as Transform Blocks (TBs). It should be noted that in some cases, a core transform and subsequent secondary transforms may be applied (in the video encoder) to generate transform coefficients. For a video decoder, the order of transforms is reversed.
A quantization process may be performed on transform coefficients or residual sample values directly (e.g., in the case, of palette coding quantization). Quantization approximates transform coefficients by amplitudes restricted to a set of specified values. Quantization essentially scales transform coefficients in order to vary the amount of data required to represent a group of transform coefficients. Quantization may include division of transform coefficients (or values resulting from the addition of an offset value to transform coefficients) by a quantization scaling factor and any associated rounding functions (e.g., rounding to the nearest integer). Quantized transform coefficients may be referred to as coefficient level values. Inverse quantization (or “dequantization”) may include multiplication of coefficient level values by the quantization scaling factor, and any reciprocal rounding or offset addition operations. It should be noted that as used herein the term quantization process in some instances may refer to division by a scaling factor to generate level values and multiplication by a scaling factor to recover transform coefficients in some instances. That is, a quantization process may refer to quantization in some cases and inverse quantization in some cases. Further, it should be noted that although in some of the examples below quantization processes are described with respect to arithmetic operations associated with decimal notation, such descriptions are for illustrative purposes and should not be construed as limiting. For example, the techniques described herein may be implemented in a device using binary operations and the like. For example, multiplication and division operations described herein may be implemented using bit shifting operations and the like.
Quantized transform coefficients and syntax elements (e.g., syntax elements indicating a coding structure for a video block) may be entropy coded according to an entropy coding technique. An entropy coding process includes coding values of syntax elements using lossless data compression algorithms. Examples of entropy coding techniques include content adaptive variable length coding (CAVLC), context adaptive binary arithmetic coding (CABAC), probability interval partitioning entropy coding (PIPE), and the like. Entropy encoded quantized transform coefficients and corresponding entropy encoded syntax elements may form a compliant bitstream that can be used to reproduce video data at a video decoder. An entropy coding process, for example, CABAC, may include performing a binarization on syntax elements. Binarization refers to the process of converting a value of a syntax element into a series of one or more bits. These bits may be referred to as “bins.” Binarization may include one or a combination of the following coding techniques: fixed length coding, unary coding, truncated unary coding, truncated Rice coding, Golomb coding, k-th order exponential Golomb coding, and Golomb-Rice coding. For example, binarization may include representing the integer value of 5 for a syntax element as 00000101 using an 8-bit fixed length binarization technique or representing the integer value of 5 as 11110 using a unary coding binarization technique. As used herein each of the terms fixed length coding, unary coding, truncated unary coding, truncated Rice coding, Golomb coding, k-th order exponential Golomb coding, and Golomb-Rice coding may refer to general implementations of these techniques and/or more specific implementations of these coding techniques. For example, a Golomb-Rice coding implementation may be specifically defined according to a video coding standard. In the example of CABAC, for a particular bin, a context provides a most probable state (MPS) value for the bin (i.e., an MPS for a bin is one of 0 or 1) and a probability value of the bin being the MPS or the least probably state (LPS). For example, a context may indicate, that the MPS of a bin is 0 and the probability of the bin being 1 is 0.3. It should be noted that a context may be determined based on values of previously coded bins including bins in the current syntax element and previously coded syntax elements. For example, values of syntax elements associated with neighboring video blocks may be used to determine a context for a current bin.
With respect to the equations used herein, the following arithmetic operators may be used:
Further, the following mathematical functions may be used:
With respect to the example syntax used herein, the following definitions of logical operators may be applied:
Further, the following relational operators may be applied:
Further, it should be noted that in the syntax descriptors used herein, the following descriptors may be applied:
As described above, video content includes video sequences comprised of a series of pictures and each picture may be divided into one or more regions. In JVET-R2001, a coded representation of a picture comprises VCL NAL units of a particular layer within an AU and contains all CTUs of the picture. For example, referring again to
Multi-layer video coding enables a video presentation to be decoded/displayed as a presentation corresponding to a base layer of video data and decoded/displayed one or more additional presentations corresponding to enhancement layers of video data. For example, a base layer may enable a video presentation having a basic level of quality (e.g., a High Definition rendering and/or a 30 Hz frame rate) to be presented and an enhancement layer may enable a video presentation having an enhanced level of quality (e.g., an Ultra High Definition rendering and/or a 60 Hz frame rate) to be presented. An enhancement layer may be coded by referencing a base layer. That is, for example, a picture in an enhancement layer may be coded (e.g., using inter-layer prediction techniques) by referencing one or more pictures (including scaled versions thereof) in a base layer. It should be noted that layers may also be coded independent of each other. In this case, there may not be inter-layer prediction between two layers. Each NAL unit may include an identifier indicating a layer of video data the NAL unit is associated with. As described above, a sub-bitstream extraction process may be used to only decode and display a particular region of interest of a picture. Further, a sub-bitstream extraction process may be used to only decode and display a particular layer of video. Sub-bitstream extraction may refer to a process where a device receiving a compliant or conforming bitstream forms a new compliant or conforming bitstream by discarding and/or modifying data in the received bitstream. For example, sub-bitstream extraction may be used to form a new compliant or conforming bitstream corresponding to a particular representation of video (e.g., a high quality representation).
In JVET-R2001, each of a video sequence, a GOP, a picture, a slice, and CTU may be associated with metadata that describes video coding properties and some types of metadata an encapsulated in non-VCL NAL units. JVET-R2001 defines parameters sets that may be used to describe video data and/or video coding properties. In particular, JVET-R2001 includes the following four types of parameter sets: video parameter set (VPS), sequence parameter set (SPS), picture parameter set (PPS), and adaption parameter set (APS), where a SPS applies to apply to zero or more entire CVSs, a PPS applies to zero or more entire coded pictures, a APS applies to zero or more slices, and a VPS may be optionally referenced by a SPS. A PPS applies to an individual coded picture that refers to it. In JVET-R2001, parameter sets may be encapsulated as a non-VCL NAL unit and/or may be signaled as a message. JVET-R2001 also includes a picture header (PH) which is encapsulated as a non-VCL NAL unit. In JVET-R2001, a picture header applies to all slices of a coded picture. JVET-R2001 further enables decoding capability information (DCI) and supplemental enhancement information (SEI) messages to be signaled. In JVET-R2001, DCI and SEI messages assist in processes related to decoding, display or other purposes, however, DCI and SEI messages may not be required for constructing the luma or chroma samples according to a decoding process. In JVET-R2001, DCI and SEI messages may be signaled in a bitstream using non-VCL NAL units. Further, DCI and SEI messages may be conveyed by some mechanism other than by being present in the bitstream (i.e., signaled out-of-band).
JVET-R2001 defines NAL unit header semantics that specify the type of Raw Byte Sequence Payload (RBSP) data structure included in the NAL unit. Table 1 illustrates the syntax of the NAL unit header provided in JVET-R2001.
JVET-R2001 provides the following definitions for the respective syntax elements illustrated in Table 1.
forbidden_zero_bit shall be equal to 0.
nuh_reserved_zero_bit shall be equal to ‘0’. The value 1 of nuh_reserved_zero_bit may be specified in the future by ITU-T ISO/IEC. Decoders shall ignore (i.e. remove from the bitstream and discard) NAL units with nuh_reserved_zero_bit equal to ‘1’.
nuh_layer_id specifies the identifier of the layer to which a VCL NAL unit belongs or the identifier of a layer to which a non-VCL NAL unit applies. The value of nuh_layer_id shall be in the range of 0 to 55, inclusive. Other values for nuh_layer_id are reserved for future use by ITU-T|ISO/IEC.
The value of nuh_layer_id shall be the same for all VCL NAL units of a coded picture. The value of nuh_layer_id of a coded picture or a PU is the value of the nuh_layer_id of the VCL NAL units of the coded picture or the PU.
When nal_unit_type is equal to PH_NUT, EOS_NUT, or FD_NUT, nuh_layer_id shall be equal to the nuh_layer_id of associated VCL NAL unit.
nuh_temporal_id_plus1 minus 1 specifies a temporal identifier for the NAL unit.
The value of nuh_temporal_id_plus1 shall not be equal to 0.
The variable TemporalId is derived as follows:
TemporalId=nuh_temporal_id_plus1−1
When nal_unit_type is in the range of IDR_W_RADL to RSV_IRAP_12, inclusive, TemporalId shall be equal to 0.
When nal_unit_type is equal to STSA_NUT and vps_independent_layer_flag[GeneralLayerIdx[nuh_layer_id] ] is equal to 1, TemporalId shall not be equal to 0.
The value of TemporalId shall be the same for all VCL NAL units of an AU. The value of TemporalId of a coded picture, a PU, or an AU is the value of the TemporalId of the VCL NAL units of the coded picture, PU, or AU. The value of TemporalId of a sublayer representation is the greatest value of TemporalId of all VCL NAL units in the sublayer representation.
The value of TemporalId for non-VCL NAL units is constrained as follows:
NOTE—A clean random access (CRA) picture may have associated RASL or RADL pictures present in the bitstream.
NOTE—An instantaneous decoding refresh (TDR) picture having nal_unit_type_equal to IDR_N_LP does not have associated leading pictures present in the bitstream. An IDR picture having nal_unit_type_equal to IDR_W_RADL does not have associated RASL pictures present in the bitstream, but may have associated RADL pictures in the bitstream.
The value of nal_unit_type shall be the same for all VCL NAL units of a subpicture. A subpicture is referred to as having the same NAL unit type as the VCL NAL units of the subpicture.
When any two subpictures in a picture have different NAL unit types, the value of sps_subpic_treated_as_pic_flag[ ] shall be equal to 1 for all subpictures in the picture that contain at least one P or B slice.
For VCL NAL units of any particular picture, the following applies:
It should be noted that generally, an Intra Random Access Point (IRAP) picture is a picture that does not refer to any pictures other than itself for prediction in its decoding process. In JVET-R2001, an TRAP picture may be a clean random access (CRA) picture or an instantaneous decoder refresh (IDR) picture. In JVET-R2001, the first picture in the bitstream in decoding order must be an IRAP or a gradual decoding refresh (GDR) picture. JVET-R2001 describes the concept of a leading picture, which is a picture that precedes the associated IRAP picture in output order. JVET-R2001 further describes the concept of a trailing picture which is a non-IRAP picture that follows the associated IRAP picture in output order. Trailing pictures associated with an IRAP picture also follow the IRAP picture in decoding order. For IDR pictures, there are no trailing pictures that require reference to a picture decoded prior to the IDR picture. JVET-R2001 provides where a CRA picture may have leading pictures that follow the CRA picture in decoding order and contain inter picture prediction references to pictures decoded prior to the CRA picture. Thus, when the CRA picture is used as a random access point these leading pictures may not be decodable and are identified as random access skipped leading (RASL) pictures. The other type of picture that can follow an IRAP picture in decoding order and precede it in output order is the random access decodable leading (RADL) picture, which cannot contain references to any pictures that precede the IRAP picture in decoding order. A GDR picture, is a picture for which each VCL NAL unit has nal_unit_type equal to GDR_NUT. If the current picture is a GDR picture that is associated with a picture header which signals a syntax element recovery_poc_cnt and there is a picture picA that follows the current GDR picture in decoding order in the CLVS and that has PicOrderCntVal equal to the PicOrderCntVal of the current GDR picture plus the value of recovery_poc_cnt, the picture picA is referred to as the recovery point picture.
As described above, JVET-Q2001 enables SEI messages to be signaled which assist in processes related to decoding, display or other purposes. Further, a type of SEI message for VCL HRD operations includes buffering period SEI messages. As provided in Table 2, a NAL unit may include a supplemental enhancement information (SEI) syntax structure. An sei_payload( ) syntax structure may include a buffering_period( ) syntax structure. Table 3 illustrates the buffering_period( ) syntax structure provided in JVET-R2001.
With respect to Table 3, JVET-R2001 provides the following semantics:
A BP SEI message provides initial CPB removal delay and initial CPB removal delay offset information for initialization of the BHRD at the position of the associated AU in decoding order.
When the BP SEI message is present, a picture is said to be a notDiscardablePic picture when the picture has TemporalId equal to 0 and is not a RASL or RADL picture.
When the current picture is not the first picture in the bitstream in decoding order, let prevNonDiscardablePic be the preceding picture in decoding order with TemporalId equal to 0 that is not a RASL or RADL picture.
The presence of BP SEI messages is specified as follows:
It should be noted that with respect to the semantics provided above for buffering_period( ), JVET-R2001 provides the following definitions:
access unit (AU): A set of PUs that belong to different layers and contain coded pictures associated with the same time for output from the DPB.
coded picture buffer (CPB): A first-in first-out buffer containing DUs in decoding order specified in the hypothetical reference decoder.
decoded picture buffer (DPB): A buffer holding decoded pictures for reference, output reordering, or output delay specified for the hypothetical reference decoder.
decoding unit (DU): An AU if DecodingUnitHrdFlag is equal to 0 or a subset of an AU otherwise, consisting of one or more VCL NAL units in an AU and the associated non-VCL NAL units.
hypothetical reference decoder (HRD): A hypothetical decoder model that specifies constraints on the variability of conforming NAL unit streams or conforming byte streams that an encoding process may produce.
picture unit (PU): A set of NAL units that are associated with each other according to a specified classification rule, are consecutive in decoding order, and contain exactly one coded picture.
The signaling of buffer period information in JVET-R2001 may be less than ideal. In particular, syntax elements may be signaled unnecessarily in some cases.
Communications medium 110 may include any combination of wireless and wired communication media, and/or storage devices. Communications medium 110 may include coaxial cables, fiber optic cables, twisted pair cables, wireless transmitters and receivers, routers, switches, repeaters, base stations, or any other equipment that may be useful to facilitate communications between various devices and sites. Communications medium 110 may include one or more networks. For example, communications medium 110 may include a network configured to enable access to the World Wide Web, for example, the Internet. A network may operate according to a combination of one or more telecommunication protocols. Telecommunications protocols may include proprietary aspects and/or may include standardized telecommunication protocols. Examples of standardized telecommunications protocols include Digital Video Broadcasting (DVB) standards, Advanced Television Systems Committee (ATSC) standards, Integrated Services Digital Broadcasting (ISDB) standards, Data Over Cable Service Interface Specification (DOCSIS) standards, Global System Mobile Communications (GSM) standards, code division multiple access (CDMA) standards, 3rd Generation Partnership Project (3GPP) standards, European Telecommunications Standards Institute (ETSI) standards, Internet Protocol (IP) standards, Wireless Application Protocol (WAP) standards, and Institute of Electrical and Electronics Engineers (IEEE) standards.
Storage devices may include any type of device or storage medium capable of storing data. A storage medium may include a tangible or non-transitory computer-readable media. A computer readable medium may include optical discs, flash memory, magnetic memory, or any other suitable digital storage media. In some examples, a memory device or portions thereof may be described as non-volatile memory and in other examples portions of memory devices may be described as volatile memory. Examples of volatile memories may include random access memories (RAM), dynamic random access memories (DRAM), and static random access memories (SRAM). Examples of non-volatile memories may include magnetic hard discs, optical discs, floppy discs, flash memories, or forms of electrically programmable memories (EPROM) or electrically erasable and programmable (EEPROM) memories. Storage device(s) may include memory cards (e.g., a Secure Digital (SD) memory card), internal/external hard disk drives, and/or internal/external solid state drives. Data may be stored on a storage device according to a defined file format.
Television service network 404 is an example of a network configured to enable digital media content, which may include television services, to be distributed. For example, television service network 404 may include public over-the-air television networks, public or subscription-based satellite television service provider networks, and public or subscription-based cable television provider networks and/or over the top or Internet service providers. It should be noted that although in some examples television service network 404 may primarily be used to enable television services to be provided, television service network 404 may also enable other types of data and services to be provided according to any combination of the telecommunication protocols described herein. Further, it should be noted that in some examples, television service network 404 may enable two-way communications between television service provider site 406 and one or more of computing devices 402A-402N. Television service network 404 may comprise any combination of wireless and/or wired communication media. Television service network 404 may include coaxial cables, fiber optic cables, twisted pair cables, wireless transmitters and receivers, routers, switches, repeaters, base stations, or any other equipment that may be useful to facilitate communications between various devices and sites. Television service network 404 may operate according to a combination of one or more telecommunication protocols. Telecommunications protocols may include proprietary aspects and/or may include standardized telecommunication protocols. Examples of standardized telecommunications protocols include DVB standards, ATSC standards, ISDB standards, DTMB standards, DMB standards, Data Over Cable Service Interface Specification (DOCSIS) standards, HbbTV standards, W3C standards, and UPnP standards.
Referring again to
Wide area network 408 may include a packet based network and operate according to a combination of one or more telecommunication protocols. Telecommunications protocols may include proprietary aspects and/or may include standardized telecommunication protocols. Examples of standardized telecommunications protocols include Global System Mobile Communications (GSM) standards, code division multiple access (CDMA) standards, 3rd Generation Partnership Project (3GPP) standards, European Telecommunications Standards Institute (ETSI) standards, European standards (EN), IP standards, Wireless Application Protocol (WAP) standards, and Institute of Electrical and Electronics Engineers (IEEE) standards, such as, for example, one or more of the IEEE 802 standards (e.g., Wi-Fi). Wide area network 408 may comprise any combination of wireless and/or wired communication media. Wide area network 408 may include coaxial cables, fiber optic cables, twisted pair cables, Ethernet cables, wireless transmitters and receivers, routers, switches, repeaters, base stations, or any other equipment that may be useful to facilitate communications between various devices and sites. In one example, wide area network 408 may include the Internet. Local area network 410 may include a packet based network and operate according to a combination of one or more telecommunication protocols. Local area network 410 may be distinguished from wide area network 408 based on levels of access and/or physical infrastructure. For example, local area network 410 may include a secure home network.
Referring again to
Referring again to
Video encoder 500 may perform intra prediction coding and inter prediction coding of picture areas, and, as such, may be referred to as a hybrid video encoder. In the example illustrated in
In the example illustrated in
Referring again to
Referring again to
Referring again to
Referring again to
As described above, the buffering period information in the VPS in JVET-R2001 may be less than ideal. In one example, according to the techniques herein, syntax element bp_sublayer_dpb_output_offsets_present_flag may be conditionally signaled only when bp_max_sublayers_minus1 is greater than 0. bp_sublayer_dpb_output_offsets_present_flag controls the presence of bp_dpb_output_tid_offset[i] for i in the range of 0 to bp_max_sublayers_minus1−1, inclusive. As a result, when bp_max_sublayers_minus1 is equal to 0, none of bp_dpb_output_tid_offset[i] syntax elements are actually signaled. Thus, there is no need to waste signaling and parsing bp_sublayer_dpb_output_offsets_present_flag in this case and its value can be inferred. Table 4A and Table 4B illustrate examples of the relevant portion of a buffering period syntax structure where bp_sublayer_dpb_output_offsets_present_flag is conditionally signaled according to the techniques herein.
With respect to Table 4A and Table 4B, the semantics may be based on the semantics provided above and based on the following:
bp_sublayer_dpb_output_offsets_present_flag equal to 1 specifies that DPB output time offsets are present for temporal sublayer representation(s) in the range of 0 to bp_max_sublayers_minus1−1, inclusive. bp_sublayer_dpb_output_offsets_present_flag equal to 0 specified that no such DPB output time offsets are present. When not present bp_sublayer_dpb_output_offsets_present_flag is inferred to be equal to 0.
Alternatively, in one example, a conformance constraint may be imposed on bp_sublayer_dpb_output_offsets_present_flag based on the value of bp_max_sublayers_minus1. In one example, the conformance constraint may be expressed as follows:
It is a requirement of bitstream conformance that when bp_max_sublayers_minus1 is equal to 0, bp_sublayer_dpb_output_offsets_present_flag shall be equal to 0.
In another example:
It is a requirement of bitstream conformance that when bp_max_sublayers_minus1 is equal to 0, bp_sublayer_dpb_output_offsets_present_flag shall be equal to 1.
In one example, according to the techniques herein, bp_sublayer_initial_cpb_removal_delay_present_flag, may be conditionally signaled only when bp_max_sublayers_minus1 is greater than 0. bp_sublayer_initial_cpb_removal_delay_present_flag determines for which temporal sublayers VCL and NAL initial buffering delay syntax elements are signaled. When bp_max_sublayers_minus1 is equal to 0, this information is already known, as there is only one temporal sublayer. As a result, when bp_max_sublayers_minus1 is equal to 0, there is no need to waste signaling and parsing of bp_sublayer_initial_cpb_removal_delay_present_flag in this case and its value can be inferred. Table 5 illustrates an example of the relevant portion of a buffering period syntax structure where bp_sublayer_initial_cpb_removal_delay_present_flag is conditionally signaled according to the techniques herein.
With respect to Table 5, the semantics may be based on the semantics provided above and based on the following semantics:
bp_sublayer_initial_cpb_removal_delay_present_flag equal to 1 specifies that initial CPB removal delay related syntax elements are present for temporal sublayer representation(s) in the range of 0 to bp_max_sublayers_minus1, inclusive. bp_sublayer_initial_cpb_removal_delay_present_flag equal to 0 specifies that initial CPB removal delay related syntax elements are present for the bp_max_sublayers_minus1-th temporal sublayer representation. When not present bp_sublayer_initial_cpb_removal_delay_present_flag is inferred to be equal to 0.
In a variant example, a conformance constraint may be specified as follows:
It is a requirement of bitstream conformance that when bp_max_sublayers_minus1 is equal to 0, bp_sublayer_initial_cpb_removal_delay_present_flag shall be equal to 0.
OR
It is a requirement of bitstream conformance that when bp_max_sublayers_minus1 is equal to 0, bp_sublayer_initial_cpb_removal_delay_present_flag shall be equal to 1.
Further, in one example, according to the techniques herein, syntax element bp_alt_cpb_params_present_flag may be located near syntax element bp_use_alt_cpb_params_flag, that is, as follows:
Referring to Table 3, such a syntax sequence may be achieved by relocating the condition if(bp_alt_cpb_params_present_flag) and syntax element bp_alt_cpb_params_present_flag within a buffering period syntax structure (i.e., moving upward) or by relocating the syntax element bp_alt_cpb_params_present_flag (i.e., moving downward) in a buffering period syntax structure.
An sei_payload(syntax structure may include a pic_timing( ) syntax structure. Table 6 illustrates the pic_timing( ) syntax structure provided in JVET-R2001.
With respect to Table 6, JVET-R2001 provides the following semantics:
The PT SEI message provides CPB removal delay and DPB output delay information for the AU associated with the SEI message.
If bp_nal_hrd_params_present_flag or bp_vcl_hrd_params_present_flag of the BP SEI mesage applicable for the current AU is equal to 1, the variable CpbDpbDelaysPresentFlag is set equal to 1. Otherwise, CpbDpbDelaysPresentFlag is set equal to 0.
The presence of PT SEI messages is specified as follows:
Referring to Table 3, in syntax element bp_cpb_removal_delay_deltas_present_flag controls the presence of bp_cpb_removal_delay_delta_val[i] syntax elements. However, referring to Table 6, an index to these bp_cpb_removal_delay_delta_val[i] syntax elements is only signaled in a picture timing SEI message for i in the range of TemporalID to bp_max_sublayers_minus1-1, inclusive. As a result, when bp_max_sublayers_minus1 is equal to 0, an index to the candidate syntax elements (bp_cpb_removal_delay_delta_val[i]) is never signaled. Thus, in this case, there is no need to signal any bp_cpb_removal_delay_delta_val[i] syntax elements, syntax element bp_num_cpb_removal_delay_deltas_minus1, and syntax element bp_cpb_removal_delay_deltas_present_flag and its value can be inferred. In one example, according to the techniques herein, syntax element bp_max_sublayers_minus1 may occur before syntax element bp_cpb_removal_delay_deltas_present_flag and bp_cpb_removal_delay_deltas_present_flag may be conditionally signaled only when bp_max_sublayers_minus1 is greater than 0. Table 7A and Table 7B illustrate examples of the relevant portion of a buffering period syntax structure according to the techniques herein.
With respect to Table 7A and Table 7B, the semantics may be based on the semantics provided above and based on the following:
bp_cpb_removal_delaymdeltas_present_flag equal to 1 specifies that the BP SEI message contains CPB removal delay deltas. bp_cpb_removal_delay_delta_present_flag equal to 0 specifies that no CPB removal delay deltas are present in the BP SE message. When not present bp_cpb_removaldelay_deltas_present_flag is inferred to be equal to 0.
In one example, according to the techniques herein, syntax element bp_max_sublayers_minus1 may occur before the signaling of syntax element bp_cpb_removal_delay_deltas_present_flag and a conformance constraint may be added on syntax element bp_cpb_removal_delay_deltas_present_flag based on the value of bp_max_sublayers_minus1. Table 8 illustrates an example of the relevant portion of a buffering period syntax structure according to the techniques herein.
With respect to Table 8, the semantics may be based on the semantics provided above and based on the following:
bp_cpb_removal_delay_deltas_present_flag equal to 1 specifies that the BP SEI message contains CPB removal delay deltas. bp_cpb_removal_delay_deltas_present_flag equal to 0 specifies that no CPB removal delay deltas are present in the BP SEI message.
It is a requirement of bitstream conformance that when bp_max_sublayers_minus1 is equal to 0, bp_cpb_removal_delay_deltas_present_flag shall be equal to 0.
In general, syntax element bp_max_sublayers_minus1 may occur anywhere before syntax element bp_cpb_removal_delay_deltas_present_flag in the buffering period SEI message. For example, in one example, bp_max_sublayers_minus1 may immediately precede syntax element bp_cpb_removal_delay_delta_minus1. In one example, bp_max_sublayers_minus1 may immediately precede syntax element bp_concatenation_flag. In one example, bp_max_sublayers_minus1 may immediately precede syntax element bp_cpb_initial_removal_delay_length_minus1. In one example, bp_max_sublayers_minus1 may be the very first syntax element in the buffering period syntax structure.
With respect to Table 6, in one example according to the techniques herein, the syntax element pt_cpb_removal_delay_minus1[bp_max_sublayers_minus1] may be located in the syntax structure to be near the other CPB removal delay syntax elements, in particular, near pt_cpb_removal_delay_minus1[i] and pt_cpb_removal_delay_delta_idx[i] syntax elements. Table 9 illustrates an example of the relevant portion of a picture timing syntax structure according to the techniques herein.
With respect to Table 9, the semantics may be based on the semantics provided above.
In one example, according to the techniques herein, the other CPB removal delay syntax elements may be moved in the syntax structure to be near the syntax element pt_cpb_removal_delay_minus1[bp_max_sublayers_minus1]. Table 10 illustrates an example of the relevant portion of a picture timing syntax structure according to the techniques herein.
With respect to Table 10, the semantics may be based on the semantics provided above.
In another example, the collocation of relevant syntax elements may be achieved by signaling pt_cpb_removal_delay_minus1[bp_max_sublayers_minus1] immediately after the related syntax elements. Table 11 illustrates an example of the relevant portion of a picture timing syntax structure according to the techniques herein.
With respect to Table 11, the semantics may be based on the semantics provided above.
In another example, syntax element pt_cpb_removal_delay_minus1[bp_max_sublayers_minus1] may be removed as a standalone syntax element from the syntax structure and its function may be expressed inside a for-loop. Table 12 illustrates an example of the relevant portion of a picture timing syntax structure according to the techniques herein.
With respect to Table 12, the semantics may be based on the semantics provided above.
In this manner, source device 102 represents an example of a device configured to signal a syntax element in a buffering information syntax structure specifies a maximum number of temporal sublayers for which coded picture buffer removal delay and coded picture buffer removal offset are indicated in the buffering information syntax structure and conditionally signal one or more syntax element elements in the buffering information syntax structure only when specifies a maximum number of temporal sublayers is greater than one.
Referring again to
Referring again to
Video decoder 124 may include any device configured to receive a bitstream (e.g., a sub-bitstream extraction) and/or acceptable variations thereof and reproduce video data therefrom. Display 126 may include any device configured to display video data. Display 126 may comprise one of a variety of display devices such as a liquid crystal display (LCD), a plasma display, an organic light emitting diode (OLED) display, or another type of display. Display 126 may include a High Definition display or an Ultra High Definition display. It should be noted that although in the example illustrated in
In the example illustrated in
As illustrated in
Referring again to
In one or more examples, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium and executed by a hardware-based processing unit. Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol. In this manner, computer-readable media generally may correspond to (1) tangible computer-readable storage media which is non-transitory or (2) a communication medium such as a signal or carrier wave. Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the techniques described in this disclosure. A computer program product may include a computer-readable medium.
By way of example, and not limitation, such computer-readable storage media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage, or other magnetic storage devices, flash memory, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium. For example, if instructions are transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. It should be understood, however, that computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other transitory media, but are instead directed to non-transitory, tangible storage media. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
Instructions may be executed by one or more processors, such as one or more digital signal processors (DSPs), general purpose microprocessors, application specific integrated circuits (ASICs), field programmable logic arrays (FPGAs), or other equivalent integrated or discrete logic circuitry. Accordingly, the term “processor,” as used herein may refer to any of the foregoing structure or any other structure suitable for implementation of the techniques described herein. In addition, in some aspects, the functionality described herein may be provided within dedicated hardware and/or software modules configured for encoding and decoding, or incorporated in a combined codec. Also, the techniques could be fully implemented in one or more circuits or logic elements.
The techniques of this disclosure may be implemented in a wide variety of devices or apparatuses, including a wireless handset, an integrated circuit (IC) or a set of ICs (e.g., a chip set). Various components, modules, or units are described in this disclosure to emphasize functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require realization by different hardware units. Rather, as described above, various units may be combined in a codec hardware unit or provided by a collection of interoperative hardware units, including one or more processors as described above, in conjunction with suitable software and/or firmware.
Moreover, each functional block or various features of the base station device and the terminal device used in each of the aforementioned embodiments may be implemented or executed by a circuitry, which is typically an integrated circuit or a plurality of integrated circuits. The circuitry designed to execute the functions described in the present specification may comprise a general-purpose processor, a digital signal processor (DSP), an application specific or general application integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic devices, discrete gates or transistor logic, or a discrete hardware component, or a combination thereof. The general-purpose processor may be a microprocessor, or alternatively, the processor may be a conventional processor, a controller, a microcontroller or a state machine. The general-purpose processor or each circuit described above may be configured by a digital circuit or may be configured by an analogue circuit. Further, when a technology of making into an integrated circuit superseding integrated circuits at the present time appears due to advancement of a semiconductor technology, the integrated circuit by this technology is also able to be used.
Various examples have been described. These and other examples are within the scope of the following claims.
The present application is a continuation application of U.S. patent application Ser. No. 17/323,534, filed on May 18, 2021, which claims priority from Provisional Application Nos. 63/027,768, 63/034,287, 63/036,851, and 63/037,380, the contents of which are hereby incorporated by reference into this application.
Number | Name | Date | Kind |
---|---|---|---|
20140355692 | Ramasubramonian | Dec 2014 | A1 |
Number | Date | Country |
---|---|---|
WO 2021194558 | Sep 2021 | WO |
Number | Date | Country | |
---|---|---|---|
20220385918 A1 | Dec 2022 | US |
Number | Date | Country | |
---|---|---|---|
63037380 | Jun 2020 | US | |
63036851 | Jun 2020 | US | |
63034287 | Jun 2020 | US | |
63027768 | May 2020 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 17323534 | May 2021 | US |
Child | 17880422 | US |