DETERMINING FILTER LENGTH FOR DEBLOCKING DURING ENCODING AND/OR DECODING OF VIDEO

A method of processing a video sequence including images, wherein each image includes blocks of sample values, is provided. The method includes determining input and output lengths for deblocking filtering of the sample values for a first and second side of a potential blocking boundary. The input and output lengths are a number of consecutive sample values, from a sample value closest to the potential blocking boundary to one or more other sample values spaced from the potential blocking boundary. The input and output lengths are determined based on a number of consecutive smooth sample values perpendicular to the potential blocking boundary on respectively the first and/or second side of the potential blocking boundary. The method includes deblocking filtering of the sample values on the at least one of the first and second side of the potential blocking boundary, using the input and output lengths, to generate deblocked sample values.

TECHNICAL FIELD

The present disclosure relates generally to video processing, and more particularly, video encoding and/or decoding and related methods and devices.

BACKGROUND

A video sequence is a series of images (also referred to as pictures) where each image includes one or more components. Each component can be described as a two-dimensional rectangular array of sample values. An image in a video sequence may include three components; one luma component Y where the sample values are luma values and two chroma components Cb and Cr, where the sample values are chroma values. The dimensions of the chroma components may be smaller than the luma components by a factor of two in each dimension. For example, the size of the luma component of a high definition HD image may be 1920×1080 and the chroma components may each have the dimension of 960×540. Components are sometimes referred to as color components.

A block is one two-dimensional array of samples (also referred to as pixels). In video coding, each component is split into blocks and the coded video bitstream is a series of blocks. In video coding, the image may be split into units that cover a specific area of the image. Each unit includes all blocks that make up that specific area and each block belongs fully to one unit. The macroblock in H.264 and the Coding unit (CU) in High Efficiency Video Coding HEVC are examples of units.

A block can be defined as a two-dimensional array that a transform used in coding is applied to. These blocks may be known as “transform blocks”. Alternatively, a block can be defined as a two-dimensional array that a single prediction mode is applied to. These blocks may be known as “prediction blocks”. In the present disclosure, the word block is not tied to one of these definitions, but descriptions herein can apply to either definition. Moreover, blocking artifacts may occur at both prediction block boundaries and transform block boundaries.

There are two types of prediction: intra prediction and inter prediction. Inter prediction predicts blocks of the current picture using blocks coming from previous decoded pictures. The previous decoded pictures that are used for prediction are referred to as reference pictures. The location of the referenced block inside the reference picture is indicated using a motion vector (MV).FIG. 1shows an example of a MV. As shown in the example ofFIG. 1, motion vector MV=(3,1), the current prediction block is C, and its best matching block in the reference picture is D.

MVs can point to fractional sample positions to better capture displacement. Those fractional samples may be generated from nearby integer samples using interpolation. In HM, MV can point to ¼th sample, and in JEM (Joint Exploratory Model), MV can point to 1/16th sample.

When encoding an inter block, the encoder may search for a best matching block from the reference pictures. The resulted MV is a hypothesis of motion of the block moving between the current picture and the reference picture.

To reduce overhead of signaling MV, there are two MV prediction tools, i.e. merge and advanced MV prediction (AMVP). Both tools use the fact that MVs inside a picture can be viewed as a stochastic process and there exist correlations among the MVs. When the current block is in merge mode, then one of its neighboring block's MV is fully reused. When the current block is in AMVP mode, then one of its neighboring blocks' MV is treated as a predictor and the resulting MV difference is explicitly signaled. The decoder follows the same MV prediction procedure to reconstruct the MV. After the MV is reconstructed, motion compensation process is invoked to derive the prediction block.

In JEM, there also exist 4×4 sub-blocks of a block that can have different motion information although no partitioning parameters are signalled, e.g. FRUC (Frame Rate Up Conversion), AFFINE, the alternative temporal motion vector prediction (ATMVP) or spatial-temporal motion vector predictor (STMVP).

A residual block includes samples that represents the sample value differences between the samples of the original source blocks and the prediction blocks. The residual block is processed using a spatial transform. The transform coefficients are then quantized according to a quantization parameter (QP) which controls the precision of the quantized coefficients. The quantized coefficients can be referred to as residual coefficients. A high QP would result in low precision of the coefficients and thus low fidelity of the residual block. A decoder then receives the residual coefficients, and applies inverse quantization and inverse transform to derive the residual block.

Local illumination compensation (LIC) is applied on the prediction block after motion compensation. It is a linear model-based tool and is used for tackling local illumination change within a certain area.

FIG. 2is a schematic diagram illustrating a reference picture and a current picture and an interaction therebetween for local illumination compensation. The current block is denoted C and the prediction block generated from its MV is D. B represents C's top and left neighboring reconstructed samples. A represents the top and left neighboring area of C's referenced block in the reference picture. LIC derives a weight (W) value and an offset (O) value by minimizing the sum of |(W*A+O)−B| for all samples in A and B. After W and O are derived, W and O are then applied on the prediction block, i.e. the modified prediction block is W*D+O.

After blocks have been reconstructed, deblocking is applied to reduce boundaries between coded blocks.

In HEVC and JEM, deblocking is first applied on vertical boundaries and then on horizontal boundaries. The boundaries are either transform block boundaries or prediction block boundaries. To enable parallel friendly deblocking, the deblocking may be performed on an 8×8 sample grid.

A deblocking filter strength parameter (bs) is set for each boundary. If the value of bs is larger than 0, then deblocking may be applied. The larger the boundary strength is, the stronger filtering is applied. First it is checked, if any of the blocks at a boundary between the blocks is an intra coded block then (bs is set to=2), or if both blocks use inter prediction and they use different reference frames or have significantly different motion vectors or if a residual is coded, then (bs is set to =1). This first check sets a boundary strength (bs) which is larger than 0 to indicate that deblocking should be applied. The larger the boundary strength is the stronger filtering is applied. To reduce/avoid removing natural structures when deblocking, a check that there are not any natural structures on respective sides of the boundary is then applied for luma. In HEVC, gradient calculations are used on respective sides of the boundary using the following inequality: d=abs(p0−2*p1+p2)+abs(q0−2*q1+q2)<beta, where beta is a parameter based on the quantization parameter for the block and p0, p1, to p2 are samples on one side of the block boundary and q0, q1, to q2 are samples on the other side of the block boundary. The condition is checked at two positions along the boundary, and if both conditions are true, then the luma samples are deblocked for that 4-sample part of the boundary. Chroma boundaries may always be filtered if any of the neighboring blocks are intra coded.

Some more details on the HEVC deblocking filter for luma as discussed below. In HEVC, a strong or weak filter decision may be determined as follows:

If dpq is less than (β>>2), Abs(p3−p0)+Abs(q0−q3) is less than (β>>3) and Abs(p0−q0) is less than (5*tC+1)>>1, the strong filter is applied. Otherwise, the weak filter is applied. HEVC strong filtering may be performed as follows:

In the strong filtering discussed above, p* pixels belong to block P where pixel p0 is the closest pixel to the block boundary with block Q, and q* pixels belong to block Q where q0 is closest to the block boundary with block P as shown below:

HEVC weak filtering may be performed as follows:

Δ=(9*(q0−p0)−3*(q1−p1)+8)>>4When Abs(Δ) is less than tC*10, the following ordered steps apply:The filtered sample values p0′ and q0′ are specified as follows:

When dp is less than (β+(β>>1))>>3, the variable dEp is set equal to 1.
When dq is less than (β+(β>>1))>>3, the variable dEq is set equal to 1.When dEp is equal to 1, the filtered sample value p1′ is specified as follows:

Δp=Clip3(−(tC>>1),tC>>1,(((p2+p0+1)>>1)−p1+Δ)>>1)p1′=Clip1Y(p1+)When dEq is equal to 1, the filtered sample value q1′ is specified as follows:

Although some blocks (CUs) may have internal edges due to different prediction parameters in 4×4 sub-blocks those internal edges are not deblocked in JEM.

Another problem is that deblocking on a four-pixel grid can result in recursive filtering for luma since the strong filter in JEM uses 4 pixels on each side of the boundary as part of deblocking 3 pixels on each side of the block boundary.

The problem of recursive filtering may be reduced in the operations by restricting the deblocking on transform and prediction boundaries that overlap an 8×8 grid as in HEVC. However, that approach is unacceptable because it would maximally allow for deblocking filtering using 4 samples on respective side of such boundaries. Additionally, that would not remedy blocking artifacts that occur at any multiple of 4 inside the current block.

SUMMARY

Some embodiments disclosed herein are directed to determining filter length for deblocking during encoding and/or decoding of video. In some embodiments, a method of processing a video sequence including a plurality of images is provided. Each image of the plurality of images includes a plurality of blocks of sample values. The method includes determining an input length and an output length for deblocking filtering of the sample values for respectively a first side and a second side of a potential blocking boundary. The input length and the output length can be different and are a number of consecutive sample values, from a sample value that is closest to the potential blocking boundary to one or more other sample values spaced from the potential blocking boundary. According to some embodiments, the input length and the output length are determined based on determining a number of consecutive smooth sample values perpendicular to the potential blocking boundary on respectively the first side and/or the second side of the potential blocking boundary. The method further includes performing deblocking filtering of the sample values on the at least one of the first side and the second side of the potential blocking boundary, using the input length and the output length that are determined, to generate deblocked sample values.

The method may provide a potential advantage of reducing occurrence of discontinuities and providing deblocking filtering while avoiding undesirable recursive operations and avoiding over-smoothing of the natural texture of an image. One importance of avoiding recursive operations is that deblocking filtering of video data may be performed by processors that are operating in parallel. Further, such operations may allow for the use of a longer filter, which may be beneficial when larger blocks are used.

In some other embodiments, an electronic device is provided. The electronic device is configured to perform operations that include determining an input length and an output length for deblocking filtering of the sample values on respectively a first side and a second side of a potential blocking boundary. The input length and the output length can be different and are a number of consecutive sample values from a sample value that is closest to the potential blocking boundary to one or more other sample values spaced from the potential blocking boundary. The input length and the output length can be determined based on a number of consecutive smooth sample values perpendicular to the potential blocking boundary on respectively the first side and/or the second side of the potential blocking boundary. The operations further include performing deblocking filtering of the sample values on the at least one of the first side and the second side of the potential blocking boundary, using the input length and the output length that are determined, to generate deblocked sample values.

DETAILED DESCRIPTION

Electronic Devices, Encoders, and Decoders

FIG. 5is a block diagram illustrating an electronic device500(which may be a wireless device, a 3GPP user equipment or UE device, etc.) according to some embodiments disclosed herein. As shown, electronic device500may include processor503coupled with communication interface501, memory505, camera507, and screen509. Communication interface501may include one or more of a wired network interface (e.g., an Ethernet interface), a WiFi interface, a cellular radio access network (RAN) interface (also referred to as a RAN transceiver), and/or other wired/wireless network communication interfaces. Electronic device500can thus provide wired/wireless communication over one or more wire/radio links with a remote storage system to transmit and/or receive an encoded video sequence. Processor503(also referred to as a processor circuit or processing circuitry) may include one or more data processing circuits, such as a general purpose and/or special purpose processor (e.g., microprocessor and/or digital signal processor). Processor503may be configured to execute computer program instructions from functional modules in memory505(also referred to as a memory circuit or memory circuitry), described below as a computer readable medium, to perform some or all of the operations and methods that are described herein for one or more of the embodiments. Moreover, processor503may be defined to include memory so that separate memory505may not be required. Electronic device500including, communication interface501, processor503, and/or camera507may thus perform operations, for example, discussed below with respect to the figures and/or Example Embodiments.

According to some embodiments, electronic device500(e.g., a smartphone) may generate an encoded video sequence that is either stored in memory505and/or transmitted through communication interface501over a wired network and/or wireless network to a remoted device. In such embodiments, processor503may receive a video sequence from camera509, and processor may encode the video sequence to provide the encoded video sequence that may be stored in memory505and/or transmitted through communication interface501to a remote device.

According to some other embodiments, electronic device500may decode an encoded video sequence to provide a decoded video sequence that is rendered on display509for a user to view. The encoded video sequence may be received from a remote communication device through communication interface501and stored in memory505before decoding and rendering by processor503, or the encoded video sequence may be generated by processor503responsive to a video sequence received from camera507and stored in memory505before decoding and rendering by processor503. Accordingly, the same device may thus encode a video sequence and then decode the video sequence.

Operations of encoding and decoding performed by processor503will now be discussed with reference toFIGS. 6 and 7. Modules (also referred to as units) may be stored in memory505ofFIG. 5, and these modules may provide instructions so that when the instructions of a module are executed by processor503, processor503performs respective operations according to any one or more of the embodiments disclosed herein.

FIG. 6is a schematic block diagram of an encoder640which may be implemented by processor503to encode a block of pixels in a video image (also referred to as a frame) of a video sequence according to some embodiments of inventive concepts.

A current block of pixels is predicted by performing a motion estimation using motion estimator650from an already provided block of pixels in a previous frame. The result of the motion estimation is a motion or displacement vector associated with the reference block, in the case of inter prediction. The motion vector may be used by motion compensator650to output an inter prediction of the block of pixels.

Intra predictor649computes an intra prediction of the current block of pixels from already provided pixels in the same frame. The outputs from the motion estimator/compensator650and the intra predictor649are input in selector651that either selects intra prediction or inter prediction for the current block of pixels. The output from the selector651is input to an error calculator in the form of adder641that also receives the pixel values of the current block of pixels. Adder641calculates and outputs a residual error as the difference in pixel values between the block of pixels and its prediction.

The error is transformed in transformer642, such as by a discrete cosine transform, and quantized by quantizer643followed by coding in encoder644, such as by entropy encoder. In inter coding, also the estimated motion vector is brought to encoder644to generate the coded representation of the current block of pixels.

The transformed and quantized residual error for the current block of pixels is also provided to an inverse quantizer645and inverse transformer646to retrieve the original residual error. This error is added by adder647to the block prediction output from the motion compensator650or intra predictor649to create a reconstructed block of pixels that can be used for reference in the prediction and coding of a next block of pixels. This new reconstructed is first processed by a deblocking filter600according to examples/embodiments discussed below to perform deblocking filtering to reduce/combat blocking artifacts. The processed new reconstructed block is then temporarily stored in frame buffer648, where it is available to intra predictor649and motion estimator/compensator650.

FIG. 7is a corresponding schematic block diagram of decoder760including deblocking filter600which may be implemented by processor503according to some embodiments of inventive concepts. Decoder760includes decoder761, such as entropy decoder, to decode an encoded representation of a block of pixels to get a set of quantized and transformed residual errors. These residual errors are dequantized by inverse quantizer762and inverse transformed by inverse transformer763to provide a set of residual errors.

These residual errors are added by adder764to the pixel values of a reference block of pixels. The reference block is determined by a motion estimator/compensator767or intra predictor766, depending on whether inter or intra prediction is performed. Selector768is thereby interconnected to adder764and motion estimator/compensator767and intra predictor766. The resulting decoded block of pixels output form adder764is input to deblocking filter600according to some embodiments of inventive concepts to provide deblocking filtering of blocking artifacts. The filtered block of pixels is output from decoder760and may be furthermore temporarily provided to frame buffer765to be used as a reference block of pixels for a subsequent block of pixels to be decoded. Frame buffer765is thereby connected to motion estimator/compensator767to make the stored blocks of pixels available to motion estimator/compensator767.

The output from adder764may also be input to intra predictor766to be used as an unfiltered reference block of pixels.

In embodiments ofFIGS. 6 and 7, deblocking filter600may perform deblocking filtering as so called in-loop filtering. In alternative embodiments at decoder760, deblocking filter600may be arranged to perform so called post-processing filtering. In such a case, deblocking filter600operates on the output frames outside of the loop formed by adder764, frame buffer765, intra predictor766, motion estimator/compensator767, and selector768. In such embodiments, no deblocking filtering is typically done at the encoder.

Operations of deblocking filter600will be discussed in greater detail below.

Deblocking Filter Length Determination

Various embodiments of the inventive concepts are directed to determining the input and output length for deblocking filtering for a first and a second side of a current potential blocking boundary. A potential blocking boundary corresponds to a discontinuity between sample values along the boundary of a first block (first side) and sample values along the block boundary of a second block (second side) that either will be deblocked or likely will be deblocked by deblocking filtering. For example if deblocking is performed on transform and prediction boundaries that are aligned with an 8×8 grid a potential deblocking boundary cannot happen on a boundary that not is aligned with the 8×8 grid. For example if deblocking is performed on transform and prediction boundaries that are aligned with an 4×4 grid a potential deblocking boundary cannot happen on a boundary that not is aligned with the 4×4 grid.

Input length for a first or a second side of the current potential blocking boundary refers to the distance in samples from and including the sample closest to the current potential blocking boundary on a first or a second side to the sample furthest away from the boundary on a first or a second side of the current potential blocking boundary that is read by deblocking filtering. Output length for a first or a second side of the current potential blocking boundary refers to the number of consecutive samples from and including the sample closest to the current potential blocking boundary on a first or a second side to the sample furthest away from the boundary on the first or the second side of the current potential blocking boundary that are modified by deblocking filtering. Accordingly, the input length and the output lengths can be different and are each defined as a number of consecutive samples values from a sample value that is closest to the potential blocking boundary to another sample value (either the same other sample value or respectively different other sample values) away from the potential blocking boundary.

The input length and the output length for a first side and/or a second side of the current potential blocking boundary can be determined based on at least one of the following:1. The existence of a discontinuity between at least one sample on the first side and one sample on the second side both adjacent to the current potential blocking boundary.2. The number of consecutive smooth samples perpendicular to the potential blocking boundary on the first and the second side respectively.3. The number of consecutive lines along the current potential blocking boundary that both conform to the above two conditions.4. The width and height of the block on the first side and the width and height of the block on the second side.5. Whether the current potential blocking boundary is an internal sub-block boundary or not.6. Distance to a neighboring potential blocking boundary, i.e., a number of consecutive samples values from the sample value closest to the potential blocking boundary to another sample value closest to a neighboring potential blocking boundary.

Deblocking filtering is then applied for at least one side of the current potential blocking boundary using the input and output length that was determined for that side of the boundary.

FIG. 8illustrates potential vertical blocking boundaries of a current block. A vertical potential blocking boundary can correspond to a coding unit block, prediction block or transform block and an internal vertical potential blocking boundary can correspond to prediction block or transform block inside the coding unit block.

FIG. 9illustrates block and sub-block boundaries from prediction and transform blocks.

FIG. 10illustrates operations that control input and output deblocking filter length for a current potential blocking boundary.

FIG. 11is a flowchart of operations for processing a video sequence that includes a plurality of images, with each image of the plurality of images including a plurality of blocks of sample values. Referring toFIG. 11, the operations include determining (1100) an input length and an output length for deblocking filtering of the sample values on respectively a first side and a second side of a potential blocking boundary. The input length and the output lengths can be different and are a number of consecutive samples values from a sample value that is closest to the potential blocking boundary to one or more other sample values spaced from the potential blocking boundary. The input length can be at least one sample on respective side of the potential blocking boundary and the output length can be at least non-zero for one side of the potential blocking boundary.

The input length and the output length are determined based on at least one of:

determining (1102) whether a discontinuity is identified between at least one sample value on the first side and adjacent to the potential blocking boundary and at least one sample value on the second side and adjacent to the potential blocking boundary, where the determination may determine whether the discontinuity is less than a defined threshold value;

determining (1104) a number of consecutive smooth sample values on the at least one of the first side and the second side of the potential blocking boundary;

determining (1106) width and height of the block on the first side of the potential blocking boundary and width and height of the block on the second side of the potential blocking boundary;

determining (1108) whether the potential blocking boundary is identified as an internal sub-block boundary; and

determining (1110) a number of consecutive samples values from the sample value closest to the potential blocking boundary to another sample value closest to a neighboring potential blocking boundary.

Deblocking filtering of the sample values on the at least one of the first side and the second side of the potential blocking boundary is then performed (1112) using the input length and the output length that are determined, to generate deblocked sample values.

The output length that is determined for deblocking filtering may be restricted to not being greater than the input length that is determined for deblocking filtering.

A decoded video sequence can be generated including a decoded image containing the deblocked sample values. Alternatively or additionally, an encoded video sequence can be generated based on the deblocked sample values.

Potential Advantages

The operations disclosed herein for determining deblocking filter length can reduce discontinuities across both block and internal sub-block boundaries, and still enable deblocking filtering without undesirable recursive operations and without over smoothing natural texture. Avoiding recursive operations allows the deblocking filtering of video data to be performing in parallel processors. The operations disclosed herein may allow for use of a longer filter which is subjectively beneficial when larger blocks are used.

Example Embodiments for Determining Deblocking Filter Lengths

Embodiments disclosed herein may be performed by an encoder and/or a decoder for reducing discontinuities between blocks and sub-blocks. The filter coefficients that are used for deblocking filter can be determined as needed for a particular encoder and/or decoder application. The present embodiments provide operational conditions that are used for determining the input and output lengths for deblocking filtering using such filter coefficients.

A potential blocking boundary can be identified as a boundary when at least one of the following characteristics is satisfied:1. At least one side of the boundary is intra predicted.2. There is a difference in prediction parameters on respective side of the boundary, such as motion vector, reference picture, LIC parameters, weighted prediction parameters, scaling or offset in motion compensated prediction.3. There is a difference in residual parameters on respective side of the boundary, such as the one side belongs to one transform block and the other side belongs to another transform block where at least one of the side has non-zero residual parameters, e.g. transform coefficients.4. It is a boundary of a transform block or a prediction block.

For example, in at least one embodiment, a potential blocking boundary can be identified as a boundary when at least one of the following characteristics is satisfied: at least one side of the potential blocking boundary is intra predicted; a difference exists between prediction parameters on each respective side of the potential blocking boundary, wherein prediction parameters comprise at least one of a motion vector, a reference picture, a local illumination compensation, LIC, parameter, a weighted prediction parameter, scaling, and/or an offset in motion-compensated prediction; a difference exists between residual parameters on each respective side of the potential blocking boundary, wherein a difference in residual parameters comprises one side of the potential blocking boundary belonging to one transform block and another side of the potential blocking boundary belonging to another transform block, wherein at least the one of the sides has non-zero residual parameters; and/or the potential blocking boundary is a boundary of a transform block and/or a prediction block.

At least one of following additional criterions that may need to be true for identification of a potential blocking boundary are:1. Blocking artifact detected, e.g. absolute pixel difference from pixels from respective side of the boundary larger than 0.2. Blocking artifact detected but absolute pixel difference from respective side of the boundary is less than a threshold based on QP, to avoid determining potential blocking boundary that actually correspond to natural variations.3. Existence of smooth samples on at least one side of the block boundary.

The input and output length for deblocking filtering of a first side of the current potential blocking boundary is determined based on the distance between the current potential blocking boundary and the closest neighboring potential blocking boundary on the first side. The input and output length for deblocking filtering of a second side of the current potential blocking boundary is determined based on the distance between the current potential blocking boundary and the closest neighboring potential blocking boundary on the second side.

Thus, the operations can include determining the input length and the output length for deblocking filtering based on a number of consecutive samples values from the sample value closest to the potential blocking boundary to another sample value closest to a closest neighboring potential blocking boundary.

Input length for a first or a second side of the current potential blocking boundary refers to the distance in samples from and including the sample closest to the current potential blocking boundary on a first or a second side to the sample furthest away from the boundary on a first or a second side of the current potential blocking boundary that is read by deblocking filtering. Output length for a first or a second side of the current potential blocking boundary refers to the number of consecutive samples from and including the sample closest to the current potential blocking boundary on a first or a second side to the sample furthest away from the boundary on the first or the second side of the current potential blocking boundary that are modified by deblocking filtering. Typically, the output length is shorter than the input length of deblocking filtering.

FIG. 3illustrates a current potential boundary, a neighboring potential boundary, and the result of operations according to Embodiment 1 for determining the input and output length for deblocking filtering of a first and second side of the current potential blocking boundary.

In this embodiment, the input length of deblocking filtering is determined to be equal to half of the distance between the current potential blocking boundary and the neighbouring potential blocking boundary in that direction. The output length for deblocking filtering can in this case either be identical to the input length or at least one sample shorter. For example, if the distance from the current potential blocking boundary to the neighboring potential blocking boundary on a first side of the current blocking boundary is 4 samples and the distance from the current potential blocking boundary to the neighboring potential blocking boundary on a second side of the current potential blocking boundary is 8 samples, the input length of deblocking filtering for the first side is set to 2 samples and the input length of deblocking filtering for the second side is set to 4 samples.

In a variant of this embodiment, that also avoids recursive filtering and enables parallel deblocking filtering as the above embodiment, the input length of deblocking filtering is determined such that it only covers samples that are not modified by deblocking of the neighboring potential blocking boundary. The output length for deblocking filtering can in this case either be identical to the input length or at least one sample shorter.FIG. 4illustrates operations for using neighboring input and output length on a first and second side of the current potential blocking boundary.

With reference toFIG. 4, when the neighboring deblocking filter on a first side has an input length of 3 samples and an output length of 1 samples in a direction towards the current potential blocking boundary the input length for deblocking filtering of the current boundary on the first side is determined to be the distance between the current potential blocking boundary and the neighboring potential blocking boundary on the first side minus the output length for the neighbor deblocking filter.

For example, when the distance is 4 the input length for deblocking of the first side of the current boundary is 4 minus 1 is equal to 3. The output length is the distance minus the input length for the neighboring deblocking filter, e.g. 4 minus 3 equal to 1. Similarly, when the neighboring deblocking filter on the second side has an input length of 4 samples and an output length of 3 sample towards the current potential blocking boundary the input length for deblocking filtering of the current boundary on the second side is determined to be the distance between the current potential blocking boundary and the neighboring potential blocking boundary on the second side minus the output length for the neighboring deblocking filter. In a further example, when the distance is 8 the input length for deblocking of the second side of the current boundary is 8 minus 3 equal to 5. The output length for the deblocking of the second side of the current boundary is the distance minus the input length of the neighboring deblocking on the second side, e.g. 8 minus 4 equal to 4 in this case.

Further illustrative examples are provided below where “|” indicates a neighbouring boundary, “∥” indicates current boundary, “n” indicates a sample output by deblocking of a neighboring blocking boundary, “i” corresponds to a sample that only is used as input for deblocking but is not output by any deblocking, and “c” corresponds to samples that are output by deblocking of the current potential blocking boundary. The first side is to the right of current boundary and the second side is to the left of the current boundary.

|n n n i c c c c∥c i i n|

Embodiment 2 is similar to Embodiment 1, however the input and output deblocking filtering length is set to be same for both sides of the current potential blocking boundary.

Thus, the operations determine a same value for the input length for deblocking filtering for the first and second sides of the potential blocking boundary, and determine a same value for the output length for deblocking filtering for the first and second sides of the potential blocking boundary.

The operation can include determining the input length for deblocking filtering on the first and second sides of the potential blocking boundary based on steps that include: determining a first number of consecutive samples values from the sample value closest to the potential blocking boundary on the first side to another sample value closest to a neighboring potential blocking boundary on the first side; determining a second number of consecutive samples values from the sample value closest to the potential blocking boundary on the second side to another sample value closest to a neighboring potential blocking boundary on the second side; and determining the input length based on the lesser one of the first and second numbers.

For example, when the distance from the current potential blocking boundary to the neighboring potential blocking boundary on a first side of the current boundary is 8 samples and the distance from the current potential blocking boundary to the neighboring potential blocking boundary on the second side is 16 samples, the input length for deblocking filtering for the current potential blocking boundary can be set to half of the minimum of both distances, e.g. is set to 4 samples in the given example. The output length for deblocking filtering can in this case either be identical to the input length or at least one sample shorter.

Similarly, when the neighboring potential blocking boundary has an input length of deblocking filtering of 4 samples on each side of the boundary, and an output length of deblocking filtering of 3 samples, the input length for deblocking of the current potential blocking boundary can be set to 5. The output length for deblocking filtering can in this case either be identical to the input length or at least one sample shorter.

In accordance with Embodiment 3, the input length and the output length for deblocking filtering are determined based on the length of the current potential blocking boundary.

For example, to determine the input filter length to be between 4 and 8 samples the length of the current potential blocking boundary should be at least 16 samples long. The output length for deblocking filtering can in this case either be identical to the input length or at least one sample shorter. The reason for this is to avoid frequent switching between very strong deblocking filtering (long deblocking filter length) and weaker deblocking filtering (short deblocking filter length) to avoid introducing edges between very strong and weaker deblocking filtering.

If even longer filter lengths are used, the length of the current potential blocking boundary should be at least 32 or 64 samples long.

In accordance with Embodiment 4, the input and output deblocking filter length on the first side and the second side of the current potential blocking boundary is determined by the number of consecutive smooth samples in a direction perpendicular to the current potential blocking boundary on the first and second side and optionally also that there is a difference between the sample closest to the boundary on the first side and the sample closest to the boundary on the second side.

Thus, the operations for determining the input length and the output length for deblocking filtering of one of the blocks can be based on a number of consecutive smooth sample values in a direction perpendicular to the potential blocking boundary and optionally also based on a difference between the sample value that is closest to the potential blocking boundary on the first side and the sample value that is closest to the potential blocking boundary on the second side.

For example, to determine the input deblocking filter length to be 4 on a side of the boundary the number of consecutive smooth samples perpendicular to the boundary on that side starting from and including the sample closest to the boundary and at least three more samples further away from the boundary, e.g. in total 4 samples. Smooth samples can be determined by for example according some metric, for example Laplacian metric and the difference between two samples metric as used in HEVC for strong/weak filter decision. With the only difference that they can be computed separately for respective side of the boundary to determine the input length on respective side of the boundary. The output length for deblocking filtering can in this case either be identical to the input length or at least one sample shorter.

Further operations are now explained in the example context of an HEVC condition for strong/weak filter decision but here used to determine 4 smooth samples on respective side of the boundary.

For first side (q), the operations perform:

For second side (p), the operations perform:

For input deblocking filter lengths larger than 4 samples on a side, a new metric which is insensitive to ramps is defined for the additional samples. Conditions for the 4 samples closest to the boundary, q0 to q3 or p0 to p3 as indicated below, can be based on state of the art, for example the strong/weak decision in HEVC, see numerical example above. The new metric for the additional samples is designed such that it uses two middle samples to “share” the middle coefficient of the Laplacian filter for a sample that are at an even number of samples from the boundary sample and where the middle samples use the middle coefficient of the Laplacian for samples that are an odd number of samples from the boundary.

Example for determining an input deblocking filter length of 8:

For the first side (q), the operations perform:

Is sample q7 smooth? Odd samples away from the boundary, set the two middle coefficients between q0 and q7 to half of the middle coefficient of the Laplacian to “share” the Laplacian coefficient, e.g. abs(q0−q3−q4+q7)<thr7

Is sample q6 smooth? Even samples away from boundary, set the middle coefficient of the Laplacian in the middle between q0 and q6, e.g. abs(q0−2*q3+q6)<thr6

Is sample q5 smooth? Odd samples away from the boundary, set the two middle coefficients between q0 and q5 to half of the middle coefficient of the Laplacian to “share” the Laplacian coefficient, e.g. abs(q0−q2−q3+q5)<thr5

Is sample q4 smooth? Even samples away from boundary, set the middle coefficient of the Laplacian in the middle between q0 and q4, e.g. abs(q0−2*q2+q4)<thr4

Similarly for the second side (p) as for the first side just using p* instead of q*.

The thresholds thr7, thr6, thr5 and thr4 can be set to a threshold that depends on the QP (quantization parameter) that would be used for deblocking of the potential blocking boundary. If all conditions, including conditions for the 4 samples closest to the boundary, are true for the first side the determined input deblocking filter length is 8 samples for the first side and if all conditions are true for the second side, including conditions for the 4 samples closest to the boundary, the determined input deblocking filter length is 8 samples for the second side. It can also happen that the input length is determined to 6 samples for the first side and 8 samples for the second side due to two conditions furthest away from the boundary are false e.g. they are larger than thr7 and thr6.

A variation of these operations that can be used requires that both sides of the boundary should have smooth samples. Then the conditions for the first 4 samples closest to the boundary on respective side can use the HEVC strong/weak filter decision as is. Then the additional conditions apply for the 4 outmost samples on respective side e.g. both for p7 to p4 and for q7 to q4 as below:

In one example thr4=thr5=thr6=thr7=(3*beta)>>6, thr4a=thr5a=thr6a=thr7a=(3*beta)>>5 where beta is defined in a lookup table where beta is larger for larger QP. The lookup table could for example be same/similar as the one in HEVC.

If all conditions are true including the conditions for the samples closest to the boundary the determined input deblocking filter length is 8 samples for both sides of the blocking boundary.

A variation of these operations that can be used makes the ramp sensitive metric for q7, q5 also sensitive for an edge between q3 and q4:

If all conditions are true for the first side, including conditions for the 4 samples closest to the boundary on the first side, the determined input deblocking filter length is 8 samples for the first side and if all conditions are true for the second side, including conditions for the 4 samples closest to the boundary on the second side, the determined input deblocking filter length is 8 samples for the second side.

Similarly, for the case where the conditions apply for both sides:

In one example thr7c=2*thr7a, thr5c=2*thr5a thr7b=2*thr7

If all conditions are true, including the conditions for the samples closest to the boundary, the determined input deblocking filter length is 8 samples for both sides of the blocking boundary.

It can also happen that conditions for q7 and p7, respectively for q6 and p6 are false but all the conditions for the pixels closer to the block boundary are true. In that case the determined input deblocking filter length is 6 samples for both sides of the blocking boundary.

Here follows an example for a determining an input deblocking filter length of 4:

The first three samples from the block border can use conditions as in prior art e.g. q0 to q2 and p0 to p2. Here we introduce a new smoothness criterion for the fourth sample e.g. q3 and p3 which is insensitive to a ramp:

First side (q):

Corresponding operations can be performed for the second side.

If all conditions are true for the first side including conditions for the first three samples closest to the boundary the determined input deblocking filter length is 4 samples for the first side and if all conditions are true for the second side including conditions for the first three samples closest to the boundary the determined input deblocking filter length is 4 samples for the second side.

A variation of these operations that can be used is to require that both sides of the boundary should have smooth samples. Then the conditions apply both for p3 and for q3 as below:

If all conditions are true, including conditions for the first three samples on respective side, the determined input deblocking filter length is 4 samples for both sides of the blocking boundary.

One alternative design that also is sensitive to an edge between q1 and q2.

First side:

Corresponding operations can be performed for the second side.

If all conditions are true for the first side including conditions for the first three samples closest to the boundary the determined input deblocking filter length is 4 samples for the first side and if all conditions are true for the second side including conditions for the first three samples closest to the boundary the determined input deblocking filter length is 4 samples for the second side.

Similarly for the case where the conditions apply for both sides:

If all conditions are true including conditions for the first three samples on respective side the determined input deblocking filter length is 4 samples for both sides of the blocking boundary.

The thresholds thr3, thr3b and thr3c can be set to a threshold that depends on the QP (quantization parameter) that would be used for deblocking of the potential blocking boundary.

In one embodiment, the operation for the deblocking filtering of the sample values on the at least one of the first side and the second side of the potential blocking boundary, includes linearly interpolating from a virtual sample value on one side of the potential blocking boundary toward another virtual sample value that is centered in a middle of the potential blocking boundary along a line of sample values perpendicular to the potential blocking boundary.

Embodiment 5 can use similar operations to any of the above embodiments, however the input and output deblocking filter length on one side of the current potential blocking boundary is determined based on the width and height of the block on that side.

The output length for deblocking filtering can in this case either be identical to the input length or at least one sample shorter.

Thus, the operations for determining the input length and the output length for deblocking filtering of one of the blocks can be based on width and height of the block on the first side of the potential blocking boundary and width and height of the block on the second side of the potential blocking boundary.

One example operation is to determine the input deblocking filter length to be 8 samples for the side of the current potential blocking boundary that is in the current block when both the width and height of current block is equal or larger than 32. Similarly determine the input deblocking filter length to be 8 samples for the side of the current potential blocking boundary that is in the neighboring block when both the width and height of neighboring block is equal or larger than 32. If the current block is smaller, the input length for deblocking for that side is shorter. If the neighboring block is smaller, the input length for deblocking for that side is shorter.

Another example is to determine the input deblocking filter length to be 6 samples for the side of the current potential blocking boundary that is in the current block when both the width and height of current block is equal or larger than 16. Similarly, the operations determine the input deblocking filter length to be 6 samples for the side of the current potential blocking boundary that is in the neighboring block when both the width and height of neighboring block is equal or larger than 16. If the current block is smaller, the input length for deblocking for that side is shorter. If the neighboring block is smaller, the input length for deblocking for that side is shorter.

Alternative operations that can be used with this embodiment determine the input deblocking filter length based on the width and the height of both the current and the neighboring block.

One example is to determine the input deblocking filter length to be 8 samples on both sides of the current blocking boundary when both the width and height of current block and the neighboring block are equal or larger than 32. If one of the current block or neighboring block is smaller, a shorter input length for deblocking is used.

Another example is to determine the input deblocking filter length to be 6 samples on both sides of the current blocking boundary when both the width and height of current block and the neighboring block are equal or larger than 16. If one of the current block or neighboring block is smaller, a shorter input length for deblocking is used.

In this embodiment, the determination of the input and output deblocking filter length may be performed as in any of above embodiments along the whole current potential blocking boundary covering the full width (if the edge to filter is horizontal) or height (if the edge to be filtered is vertical) of the current block.

Thus, the operations for determining the input length and the output length for deblocking filtering of one of the blocks can use the sample values along the whole potential blocking boundary extending along one of: width of the block when the horizontal edge will be deblocking filtered; and height of the block when the vertical edge will be deblocking filtered.

The distance is determined to the closest neighboring potential blocking boundary that exists at some part of the current potential blocking boundary instead of having a specific distance for each sample or part of samples along the current potential blocking boundary to the closest neighboring potential blocking boundary.

For example, if the current potential blocking boundary is 32 samples long and there is a neighboring potential blocking boundary at some part of the 32 samples at a distance of 4 samples from the current potential blocking boundary, then the input and output deblocking filter length is based on a distance of 4 for all samples along the current potential blocking boundary.

Alternative operations that may be used with this embodiment require that at least a specific number of samples belongs to the neighboring potential blocking boundary to compute the distance to it. One example is 4 samples. Another example is 16 samples. One benefit of this embodiment is that it avoids frequent switching between different deblocking filter lengths along a current potential block boundary unless there is some significant edge. It can also favourize the use deblocking filtering with shorter input and output lengths.

In Embodiment 7, the deblocking filter length is determined to be longer for current potential blocking boundaries that coincide with block boundaries compared to current potential blocking boundaries close to the block boundary inside the blocks. The reason for this is to guarantee that the determined output deblocking filter length can be large across a block boundary and still avoid recursive filtering and thus enable parallel deblocking. The output deblocking filter length at an internal blocking boundary can still be as long as the length of the deblocking filter at the block boundary if it is sufficient far away from the block boundary.

The operation for determining the input length and the output length for deblocking filtering of one of the blocks are determined to be larger values responsive to the potential blocking boundary coinciding with a block boundary of one of the blocks and, in contrast, are determined to be smaller values responsive to the potential blocking boundary not coinciding with the block boundary of the one of the blocks.

A block boundary could here correspond to a coding unit boundary and a block boundary inside a block can correspond to a boundary from a prediction block or a transform block inside the coding unit block. Alternatively, a block boundary could correspond to a coding tree unit (CTU) boundary and a block boundary inside the block can correspond to a boundary from a coding unit block or transform block or a prediction block.

One way of enabling a larger output deblocking filter length is to omit filtering samples adjacent to internal potential blocking boundaries that exist sufficiently close to the block boundary so it can be avoided that deblocking of samples adjacent to internal block boundary reach filtered samples of the deblocking filtering of the block boundary. In some cases it is only possible to filter one side of the internal blocking boundary, e.g., the side that is further away from the block boundary.

For example, if the determined input length for deblocking filtering of a block boundary is N samples and the determined output length is K samples, there must be at least N+1 samples between the block boundary and an internal potential blocking boundary to avoid recursive filtering when deblocking the internal potential blocking boundary, and which thus enables parallel deblocking of vertical edges or horizontal edges.

An internal potential blocking boundary that then is filtered needs to determine the output length for deblocking filtering to M to avoid recursive filtering. M is determined by the difference between the distance between the block boundary and the internal potential blocking boundary and the input length for deblocking filtering of the block boundary N, e.g., D minus N. The determined input length for deblocking of the internal potential blocking boundary is then the distance minus the output length of deblocking filtering of the block boundary, e.g., D minus K. The determination applies to both an internal potential blocking boundary close to the current block boundary but also to an internal potential blocking boundary close to the block boundary on the opposite side of the block.

For example if the determined input length for deblocking of a block boundary is 8 and the output length for deblocking of a block boundary is 7, then the closest internal block boundary that is allowed to be deblocked must be at least 9 samples away. Considering sub-blocks of 4×4 this then correspond to a distance of 12 samples from the block boundary. Then the output deblocking filter length can be determined to be 4 samples and the input deblocking filter length can be determined to be 5 samples for the closest internal block boundary.

In another example, if the determined input length for deblocking of a block boundary is 5 and the determined output length for deblocking is 4, then the closest internal block boundary that is allowed to be deblocked must be at least 6 samples away. Considering sub-blocks of 4×4 this then correspond to a distance of 8 samples from the block boundary. Then can the determined input deblocking filter length can be 4 samples and the determined output length can be 3 samples for the closest internal block boundary.

The operations can start by defining a determined input length for deblocking of the side of the internal boundary closest to the block boundary to be M and the determined output length to be K. Then the determined input length for deblocking for the side of the block boundary adjacent to the internal boundary is the distance D between the boundaries minus K and the determined output length is D minus M. If K is 1 and D is 4 then the input length is 3 and if M is 2 the output length is 2.

Some examples of variants that favor the deblocking filter length for the block boundary compared to an internal boundary. Where “I” indicates an internal boundary, “II” indicates a block boundary, “n” indicates a sample output by deblocking of a neighboring blocking boundary, “o” corresponds to a sample that is used for input for deblocking but is not output by any deblocking, and “c” corresponds to samples that are output by deblocking of the current boundary.

When D is 16 and the determined input length for deblocking of a block boundary is 9 and the determined output length for deblocking of a block boundary is 8:

|n n n n n n n o c c c c c c c c∥c c c c c c c c o n n n n n n n|

When D is 8 and the determined input length for deblocking of a block boundary is 5 and the determined output length for deblocking of a block boundary is 4:

|n n n o c c c c∥c c c c o n n n|

When D is 4 and the determined input length for deblocking of a block boundary is 3 and the determined output length for deblocking of a block boundary is 2:

|n o c c∥c c o n|

In the previous Embodiment 7, it is noted that by determining the output deblocking filter length to be longer for the block boundary can result in that some internal boundaries are not deblocked or that they only can be deblocked by a short deblocking filter. In contrast for operations according to Embodiment 8, potential blocking boundaries that coincide with the current block boundary are de-blocked together with potential neighboring blocking boundaries inside the current block and inside the neighboring block. These operations adapt the smoothness metric such that it will be true even though there is a discontinuity at an internal potential blocking boundary close to the block boundary.

In a further embodiment, responsive to the potential blocking boundary coinciding with a block boundary of one of the blocks, the input length and the output length for deblocking filtering of one of the blocks are determined so that the sample values along block boundary inside the one of the blocks are deblocking filtered with sample values within a block along a neighboring potential blocking boundary.

When the distance between the current boundary and the neighboring potential block boundaries is 4 samples, a deblocking is performed using a determined input length of 6 samples and a determined output length of 5 samples to deblock both the current boundary and the close neighboring boundary. This can be performed and still allow for modification of 2 pixel of a potential blocking boundary at a distance of 8 samples from the current boundary with non-recursive filtering, which allows parallel processing deblocking filtering of all vertical edges respectively horizontal edges.

o c|c c c c∥c c c c|c o n n|

The adaptation of the smoothness metric for this example can be as follows. Consider labeling of the samples q0 to q7 on first side of the block boundary and p0 to p7 on the other side of the block boundary:

The first four consecutive samples adjacent to the block boundary, e.g. q0 to q3 and/or p0 to p3 can use same conditions as in other embodiments or in prior art. Then the smoothness of samples q4 to q5 and/or p4 to p6 is considered by only considering q3 to q5 and/or p3 to p6.

For first side q:

If all conditions are true included the conditions for the first four samples adjacent to the block boundary the input length can be 6 samples and the output length can be 5 samples for the first side.

For second side p:

If all conditions are true included the conditions for the first four samples adjacent to the block boundary the input length can be 6 samples and the output length can be 5 samples for the second side.

Alternative operations that can be used for Embodiment 8 apply the conditions on both sides and use same filter length on both sides:

Are both p4 and p5 smooth and also q4 and q5 smooth?:

If all conditions are true included the conditions for the first four samples adjacent to the block boundary on both sides the input length can be 6 samples and the output length can be 5 samples for both sides of the block boundary.

The thresholds thrA, thrB, thrC can be set to a threshold that depends on the QP (quantization parameter) that would be used for deblocking of the potential blocking boundary.

One example of threshold thrA is ((5*tC+1)>>1) as used in HEVC. Where tC is based on table lookup based on QP.

One example of thrC is beta as used in HEVC. Where beta is based on a table lookup based on QP.

One example of thrB is thrC>>1.

Another example using a determined input length of 8 samples and a determined output length of 7 samples can deblock both the current boundary and the close neighboring boundary.

The adaptation of the smoothness metric for this example can be as follows. Consider labeling of the samples q0 to q7 on first side of the block boundary and p0 to p7 on the other side of the block boundary:

The first four consecutive samples adjacent to the block boundary, e.g. q0 to q3 and/or p0 to p3 can use same conditions as in other embodiments or in prior art. Then the smoothness of samples q4 to q7 and/or p4 to p7 is considered by only considering q3 to q7 and/or p3 to p7.

For first side q:

If all conditions are true included the conditions for the first four samples adjacent to the block boundary the input length can be 8 samples and the output length can be 7 samples for the first side.

For second side p:

If all conditions are true included the conditions for the first four samples adjacent to the block boundary the input length can be 8 samples and the output length can be 7 samples for the second side.

Some other alternative operations that can be used for Embodiment 8 apply the conditions on both sides and use same filter length on both sides:

Are both p4 to p7 smooth and also q4 and q7 smooth?:

If all conditions are true included the conditions for the first four samples adjacent to the block boundary on both sides the input length can be 6 samples and the output length can be 5 samples for both sides of the block boundary.

Example of thresholds thrA, thrB and thrC where given above. Examples of thresholds thrD and thrE are: thrD=thrB and thrE=thrC.

The operations of Embodiment 9 determine the input length and the output length for deblocking filtering of one of the blocks based on distance between current potential blocking boundary and a neighboring potential blocking boundary.

The minimum distance between all pseudo potential blocking boundaries inside the current block is determined. A pseudo potential blocking boundary is a boundary along which it exists at least one part that fulfills at least one criterion to be a potential blocking boundary. Based on the minimum distance between pseudo potential blocking borders of the current block, the deblocking filter length can be determined as half of the minimum distance and be used for deblocking of all potential blocking boundaries inside the current block.

One example of criterion to determine potential blocking boundaries inside the current block is to compare the prediction parameters at respective side of internal boundaries of the block. If prediction parameters differ, the boundary is determined as a potential blocking boundary.

An example grid to use to determine internal boundaries is 4.

Thus, the operation for determining the input length and the output length for deblocking filtering of one of the blocks, can include determining a minimum distance between all pseudo potential blocking boundaries inside the one of the blocks, where a pseudo potential blocking boundary is a boundary having a least a portion of which fulfills at least one criterion to be a potential blocking boundary. The input length and the output length for deblocking filtering of one of the blocks is determined as half of the minimum distance. The deblocking filtering is performed to deblock all pseudo potential blocking boundaries inside the one of the blocks.

The operations of Embodiment 9 determine the input and output deblocking filter length based on distance between current potential blocking boundary and a neighboring potential blocking boundary.

The potential blocking boundaries can be determined as explained in any of above embodiments if the current block or a neighboring block use one of the following sub-block coding modes FRUC, AFFINE, the alternative temporal motion vector prediction (ATMVP) or spatial-temporal motion vector predictor (STMVP).

The size for which potential blocking boundaries are determined depends on the smallest sub-block size that the motion compensation methods use. One example that can be used is 4×4.

One example of criterion to determine potential blocking boundaries inside a block predicted with a sub-block mode is to compare the prediction parameters at respective side of the sub-block boundary. If prediction parameters differ, the boundary is determined as a potential blocking boundary.

The operations of Embodiment 9 are directed to determining the filter length for a first and second side of a potential blocking boundary. These operations may be, but not necessarily are, first applied for vertical boundaries and then for horizontal boundaries:

Step 1: A first operation locates transform and prediction block boundaries in one direction, e.g. vertical boundaries or horizontal boundaries, for a CU, CTU or a picture or slice.

Step 2: A second operation locates parts of the vertical boundaries that were determined in the first operation that fulfill at least one of the following criterions (a part is at least one sample along the boundary):1. At least one side of the boundary is intra predicted.2. There is a difference in prediction parameters on respective side of the boundary, such as motion vector, reference picture, LIC parameters, weighted prediction parameters, scaling or offset in motion compensated prediction.3. There is a difference in residual parameters on respective side of the boundary, such as the one side belongs to one transform block and the other side belongs to another transform block where at least one of the side has non-zero residual parameters, e.g. transform coefficients.4. There is a difference in pixel values from pixels on respective side of the boundary (this criterion is typically used together with one of the above three criterions).

Step 3: For parts determined in Step 2, determine the input and output length for deblocking filtering of a first side of a current potential blocking boundary based at least on the distance between the current potential blocking boundary to the closest neighboring potential blocking boundary on the first side and the input and output length for deblocking filtering of a second side of a current potential blocking boundary based at least on the distance between the current potential blocking boundary to the closest neighboring potential blocking boundary on the second side.

Step 4: For parts determined in Step 2, determine the number of consecutive smooth samples perpendicular to the potential blocking boundary on respective sides of the boundary. In one embodiment, for each of the parts of vertical boundaries, Step 4 determines a number of consecutive smooth samples perpendicular to the potential blocking boundary on both of the first and second sides.

Step 5: For parts determined in Step 2, determine the width and height of current transform block and the width and the height of the neighboring transform block.

Step 6: Count the number of parts that fulfills the determinations performed in Step 3, Step 4 and Step 5.

Step 7: Determine the length of the deblocking filter for the first side and the length of the deblocking filter for the second side based on Steps 3 to 6.

Step 8: Deblock first side and second side based on Step 7.

The operations according to Embodiment 12 first deblock potential blocking boundaries (vertical or horizontal) inside the current block and then deblock the current block boundary (vertical or horizontal). By current block, we here mean one component of a unit. The luma component of a CU is an example of a current block. The current block boundary refers to the top and left border of the current block for deblocking of horizontal and vertical boundaries respectively.

These operations may be performed by first filtering across vertical potential deblocking boundaries inside the current block. In this embodiment, filtering of all vertical internal potential deblocking boundaries is designed such that filtering is done by only reading and modifying samples that are inside the current block. Additionally, filtering of the vertical internal potential deblocking boundaries is designed such that filtering of any particular vertical internal boundary does not modify any sample that is read during filtering of any other vertical internal boundary.

Then a second filtering of the current block boundary is done such that it only reads samples that are not modified by the filtering of the current block boundary of a neighboring current block (e.g. by the filtering of the boundaries of any neighboring CU). The design of the first and second filtering means that filtering of vertical potential deblocking boundaries can be done in parallel, and that filtering of current blocks (e.g. filtering of CUs) can be done in parallel. Note that the second filtering may read samples that are modified by the first filtering.

One benefit of this approach is that it can address both blocking artifacts inside blocks due to, for example, boundaries between sub-block with different motion and also address blocking artifacts from boundaries between large blocks (e.g. CUs). By doing the deblocking first internally in the block can help to apply longer deblocking filters on the block boundary. By doing the filtering of internal sub-block boundaries inside the block without overlap in filtering of other internal sub-block boundaries inside the block such filtering can be performed in parallel.

Example of operations for deblocking of vertical boundaries, include:

A first filter operation is performed across vertical potential deblocking boundaries inside the current block without overlap in filtering with neighboring block's vertical boundary samples. The filtering may be performed by limiting the maximum input and output deblocking filter length for a potential blocking boundary to the distance from the potential internal blocking boundary to the closest vertical current block boundary. For example, if the distance is 4 the input filter length is set to be a maximum 4 samples and the output length to maximum 4 samples. If the distance is 8 the input filter length is set to be a maximum 8 samples and the output length to maximum 8 samples.

A second filter operation is then performed across the vertical boundary of the current block without overlap to filtering of vertical boundaries of other current blocks (e.g. other CUs). The filtering may be performed by limiting the maximum input and output deblocking filter length for current block's vertical boundary to half the distance from the current block boundary to the closest neighboring current block's vertical boundary. For example, if the distance is 8 the input and output filter length is set to be a maximum of 4 samples. If the distance is 16, the input and output filter length is set to be a maximum of 8 samples.

Deblocking of horizontal boundaries is done similar to what is described for vertical boundaries above. These operations may be performed by first filtering across horizontal potential deblocking boundaries inside the current block. In this embodiment, filtering of all horizontal internal potential deblocking boundaries is designed such that filtering is done by only reading and modifying samples that are inside the current block. Additionally, filtering of the horizontal internal potential deblocking boundaries is designed such that filtering of any particular horizontal internal boundary does not modify any sample that is read during filtering of any other horizontal internal boundary.

Then a second filtering of the current block boundary is done such that it only reads samples that are not modified by the filtering of the current block boundary of a neighboring current block (e.g. by the filtering of the boundaries of any neighboring CU). The design of the first and second filtering means that filtering of horizontal potential deblocking boundaries can be done in parallel, and that filtering of current blocks (e.g. filtering of CUs) can be done in parallel. Note that the second filtering may read samples that are modified by the first filtering.

This embodiment contains a specific implementation of deblocking decisions for super strong deblocking and deblocking of internal CU boundaries before deblocking CU boundaries. The implementation supports parallel friendly deblocking. The super strong deblocking filters and the HEVC deblocking filters are used here as an example of deblocking filters.

The super strong deblocking filters are designed to linearly interpolate from a virtual sample value on respective side of the block boundary (refQ, refP) towards a virtual sample value centered in the middle of the block boundary (refMiddle) along a line of sample values perpendicular to the block boundary. The filtering of one sample along the i:th line of samples is described below:

where pi(0) is the sample value closest to the block boundary in block P and qi(0) is the sample value closest to the block boundary in block Q for line i, where for 3 sample filtering on each side:

x ranges from 0 to 2

In this example input length is equal to 4 on respective side and output length is 3 on respective side.

where for 5 sample filtering on each side:

x ranges from 0 to 4

In this example input length is equal to 6 on respective side and output length is 5 on respective side.

where for 7 sample filtering on each side:

x ranges from 0 to 6

In this example input length is equal to 8 on respective side and output length is 7 on respective side.

To determine when to use the super strong filters some additional conditions in addition to boundary strength larger than 0 and that d is less than beta (for two lines a four-sample part of the block boundary) needs to be true (as for HEVC deblocking filtering) as follows.

A super strong filter that filters seven pixels on each side of the block boundary is used when both current CU and neighboring CU has a width>=32 and a height>=32 and an additional metric (dss7i) based on the HEVC strong deblocking filter decision (dsi) and a second decision are true for 8 lines of a 16-sample part of the block boundary. A 16 sample part j corresponds to 8 lines where i can have the following values 16*j+0, 16*j+3, 16*j+4, 16*j+7, 16*j+8, 16*j+11, 16*j+12 and 16*j+15 where j can be 0 to N−1 where N is the length of the block boundary divided by 16.

If the above super strong filter decision is false a super strong filter that filters five pixels on each side of the block boundary is used when both current CU and neighboring CU has a width>=16 and a height>=16 and an additional metric (dss5i) based on the HEVC strong deblocking filter decision (dsi) and a second decision are true for 8 lines of a 16 sample part of the block boundary.

If none of above super strong filter decision are true a super strong filter that filters three pixels on each side of the block boundary is used when both current CU and neighboring CU has a width>=8 and a height>=8 and an additional metric (dss3i) based on the HEVC strong deblocking filter decision (dsi) and a second decision are true for 8 lines of a 16 sample part of the block boundary.

If none of above super strong filter decisions are true the HEVC deblocking filter and decisions are used for respective 4 lines part of the block boundary with a constraint on the number of samples to read and modify on respective side of the CU boundary to avoid recursive filtering between CUs since the filtering is here applied down to a 4 sample grid (HEVC used a 8 sample grid). For a vertical boundary the number of samples to read and modify for the line in block P is constrained to half the width of block P and for block Q it is constrained to half the width of block Q. For a horizontal boundary this corresponds to constraining the number of samples to read and modify for filtering the line in block P to the half the height of block P and for the line in block Q it is constrained to half the height of block Q. The HEVC strong deblocking filter can be used if both blocks can read at least four samples on the line. Two sample HEVC weak deblocking filtering can be used for side Q if at least three samples from the line in the block Q can be read and two sample HEVC weak deblocking filtering can be used for side P if at least three samples from the line in the block P can be read. One sample HEVC weak deblocking filtering can be used for side Q if at least two samples can be read from the line in the block Q and one sample HEVC weak deblocking filtering can be used for side P if at least two samples can be read from the line in the block P. In the example of one sample HEVC weak deblocking filter the input length is 2 and the output length is 1 on respective side.

To combat blocking artifacts inside luma coded blocks originating from sub-block motion compensation inside the prediction block of a CU, vertical internal potential blocking boundaries are filtered before the vertical CU boundaries of the luma coded blocks are filtered. Similarly, are horizontal internal potential blocking boundaries filtered before the horizontal CU boundaries of luma coded blocks are filtered. The description below describes on filtering of vertical internal boundaries and vertical CU boundaries of the luma coded blocks. Horizontal filtering is done similarly.

A vertical internal blocking boundary may be filtered if at least one of the following conditions trueif any of the absolute value the difference between motion vector components for the two sides of the internal boundary exceeds a thresholdif different reference pictures are used for the two sides of the internal boundary orif different number of reference pictures are used for the two sides of the internal boundary.

Deblocking of vertical internal potential blocking boundaries use a boundary strength equal to 1 and only read and modifies samples within luma coded blocks of the CU. The number of samples to read and modify as part of the filtering is at most equal to half of the minimal distance between the current vertical internal blocking boundary and the closest neighboring vertical internal potential deblocking boundary to avoid reading samples that are modified by filtering of the closest neighboring vertical internal blocking boundary. Thus, the filtering of vertical internal blocking boundaries for different CUs can be done in parallel.

The filtering of vertical CU boundaries of luma coded blocks can be done in parallel after internal boundaries of luma coded blocks have been filtered.

In some embodiments, the input length and the output length for deblocking filtering are determined (1100) based on a number of consecutive sample values from the sample value closest to the potential blocking boundary to another sample value closest to a closest neighboring potential blocking boundary, wherein the input length is determined to be 8 and the output length is determined to be 7, and wherein deblocking filtering comprises linearly interpolating from a virtual sample value on one side of the potential blocking boundary (refQ, refP) towards a virtual sample value centered in the middle of the potential blocking boundary (refMiddle) along a line of sample values perpendicular to the potential blocking boundary. In some embodiments, deblocking filtering of one sample along the line of samples is operated according to:

wherein x ranges from 0 to 6, p(0) is the sample value closest to the potential blocking boundary in a block P, and q(0) is the sample value closest to the potential blocking boundary in a block Q for the line of samples.

Listing of Example Embodiments

Example Embodiments are discussed below. Reference numbers/letters are provided in parenthesis by way of example/illustration without limiting example embodiments to particular elements indicated by reference numbers/letters.

1. A method of processing a video sequence including a plurality of images, with each image of the plurality of images including a plurality of blocks of sample values, the method comprising:

determining (1100) an input length and an output length for deblocking filtering of the sample values for respectively a first side and a second side of a potential blocking boundary, wherein the input length and the output lengths can be different and are a number of consecutive samples values from a sample value that is closest to the potential blocking boundary to one or more other sample values spaced from the potential blocking boundary, and wherein the input length and the output length are determined based on at least one of:determining (1102) whether a discontinuity is identified between at least one sample value on the first side and adjacent to the potential blocking boundary and at least one sample value on the second side and adjacent to the potential blocking boundary;determining (1104) a number of consecutive smooth sample values perpendicular to the potential blocking boundary on respectively the first side and the second side of the potential blocking boundary;determining (1106) width and height of the block on the first side of the potential blocking boundary and width and height of the block on the second side of the potential blocking boundary;determining (1108) whether the potential blocking boundary is identified as an internal sub-block boundary; anddetermining (1110) a number of consecutive samples values from the sample value closest to the potential blocking boundary to another sample value closest to a neighboring potential blocking boundary; and

performing (1112) deblocking filtering of the sample values on the at least one of the first side and the second side of the potential blocking boundary, using the input length and the output length that are determined, to generate deblocked sample values.

2. The method of Embodiment 1, wherein the output length that is determined for deblocking filtering is restricted to not being greater than the input length that is determined for deblocking filtering.

3. The method of any of Embodiments 1 to 2, wherein the input length and the output length for deblocking filtering are determined based on a number of consecutive samples values from the sample value closest to the potential blocking boundary to another sample value closest to a closest neighboring potential blocking boundary.

4. The method of any of Embodiments 1 to 3, wherein a same value is determined for the input length for deblocking filtering for the first and second sides of the potential blocking boundary, and a same value is determined for the output length for deblocking filtering for the first and second sides of the potential blocking boundary.

5. The method of Embodiment 4, the input length for deblocking filtering on the first and second sides of the potential blocking boundary is determined based on:

determining a first number of consecutive samples values from the sample value closest to the potential blocking boundary on the first side to another sample value closest to a neighboring potential blocking boundary on the first side;

determining a second number of consecutive samples values from the sample value closest to the potential blocking boundary on the second side to another sample value closest to a neighboring potential blocking boundary on the second side; and

determining the input length based on the lesser one of the first and second numbers.

6. The method of any of Embodiments 1 to 5, the input length and the output length for deblocking filtering are determined based on length of the potential blocking boundary.

7. The method of any of Embodiments 1 to 6, the input length and the output length for deblocking filtering are determined based on a number of consecutive smooth sample values in a direction perpendicular to the potential blocking boundary.

8. The method of any of Embodiments 1 to 7, the input length and the output length for deblocking filtering are determined based on width and height of the block on the first side of the potential blocking boundary and width and height of the block on the second side of the potential blocking boundary.

9. The method of any of Embodiments 1 to 8, the input length and the output length for deblocking filtering of one of the blocks are determined based on the sample values along the whole potential blocking boundary extending along one of: width of the block when the horizontal edge will be deblocking filtered; and height of the block when the vertical edge will be deblocking filtered.

10. The method of any of Embodiments 1 to 9, the input length and the output length for deblocking filtering of one of the blocks are determined to be longer responsive to the potential blocking boundary coinciding with a block boundary of one of the blocks and are determined to be shorter responsive to the potential blocking boundary not coinciding with the block boundary of the one of the blocks.

11. The method of any of Embodiments 1 to 10, responsive to the potential blocking boundary coinciding with a block boundary of one of the blocks, the input length and the output length for deblocking filtering of one of the blocks are determined so that the determination of the number of consecutive smooth samples perpendicular to the block boundary is adapted to also be true although it crosses an neighboring potential blocking boundary within a block.

12. The method of any of Embodiments 1 to 11, wherein the determination of the input length and the output length for deblocking filtering of one of the blocks, comprises:

determining a minimum distance between all pseudo potential blocking boundaries inside the one of the blocks, wherein a pseudo potential blocking boundary is a boundary having a least a portion of which fulfills at least one criterion to be a potential blocking boundary; and

determining the input length and the output length for deblocking filtering of one of the blocks as half of the minimum distance,

wherein the deblocking filtering is performed to deblock all pseudo potential blocking boundaries inside the one of the blocks.

13. The method of any of Embodiments 1 to 12, wherein size of the potential blocking boundary is determined based on a smallest sub-block size used by a motion compensation method performed on the blocks of the video sequence.

14. The method of any of Embodiments 1 to 13, determination of the input length and the output length for deblocking filtering of one of the blocks, comprises:

1) locating transform and prediction block boundaries in one direction;

2) locating parts of vertical boundaries that fulfill at least one of the following criterion:at least one side of the vertical boundary is intra predicted;a difference exists between prediction parameters on opposite sides of the vertical boundary;a difference exists between residual parameters on opposite sides of the vertical boundary; anda difference exists between pixel values from pixels on opposite sides of the vertical boundary;

3) for each of the parts of vertical boundaries, determining the input length and the output length for deblocking filtering of the first side of the potential blocking boundary based at least on the distance between the potential blocking boundary to the neighboring potential blocking boundary on the first side;

4) for each of the parts of vertical boundaries, determining the input length and the output length for deblocking filtering of the second side of the potential blocking boundary based at least on the distance between the potential blocking boundary to the neighboring potential blocking boundary on the second side;

5) for each of the parts of vertical boundaries, determining a number of consecutive smooth samples perpendicular to the potential blocking boundary on both of the first and second sides;

6) for each of the parts of vertical boundaries, determining the width and height of a current transform block and the width and the height of a neighboring transform block;

7) counting the number of the parts that satisfy the determinations in 3) through 6); and

8) determining the input length and the output length for deblocking filtering of the first side and the determining the input length and the output length for deblocking filtering of the second side based on 3) through 7),

wherein the deblocking filtering is performed using the input lengths and the output lengths that are determined.

15. The method of any of Embodiments 1 to 14, wherein the deblocking filtering of the sample values on the at least one of the first side and the second side of the potential blocking boundary, comprises:

performing a first filtering of all vertical internal potential deblocking boundaries by only reading and modifying sample values that are inside the one of the blocks, and then performing a second filtering across at least one vertical potential deblocking boundary of the one of the blocks by only reading and modifying sample values that have not been modified during filtering of any other vertical potential deblocking boundary.

16. The method of any of Embodiments 1 to 15, wherein the deblocking filtering of the sample values on the at least one of the first side and the second side of the potential blocking boundary, comprises:

linearly interpolating from a virtual sample value on one side of the potential blocking boundary toward another virtual sample value that is centered in the middle of the potential blocking boundary along a line of sample values perpendicular to the potential blocking boundary.

17. The method of any of Embodiments 1 to 16, further comprising:

generating a decoded video sequence including a decoded image containing the deblocked sample values.

18. The method of any of Embodiments 1 to 16, further comprising:

generating an encoded video sequence based on the deblocked sample values.

19. An electronic device (500) adapted to perform operations according to any of Embodiments 1 through 18.

a processor (503) configured to perform operations according to any of Embodiments 1 through 18.

21. An electronic device configured to perform operations comprising:

determining an input length and an output length for deblocking filtering of the sample values on respectively a first side and a second side of a potential blocking boundary, wherein the input length and the output lengths can be different and are a number of consecutive samples values from a sample value that is closest to the potential blocking boundary to one or more other sample values spaced from the potential blocking boundary, and wherein the input length and the output length are determined based on at least one of:whether a discontinuity is identified between at least one sample value on the first side and adjacent to the potential blocking boundary and at least one sample value on the second side and adjacent to the potential blocking boundary;a number of consecutive smooth sample values perpendicular to the potential blocking boundary on respectively the first side and the second side of the potential blocking boundary;width and height of the block on the first side of the potential blocking boundary and width and height of the block on the second side of the potential blocking boundary;whether the potential blocking boundary is identified as an internal sub-block boundary; anda number of consecutive samples values from the sample value closest to the potential blocking boundary to another sample value closest to a neighboring potential blocking boundary; and

performing deblocking filtering of the sample values on the at least one of the first side and the second side of the potential blocking boundary, using the input length and the output length that are determined, to generate deblocked sample values.

Additional Explanation

FIG. QQ1: A wireless network in accordance with some embodiments.

InFIG. QQ1, network node QQ160includes processing circuitry QQ170, device readable medium QQ180, interface QQ190, auxiliary equipment QQ184, power source QQ186, power circuitry QQ187, and antenna QQ162. Although network node QQ160illustrated in the example wireless network ofFIG. QQ1may represent a device that includes the illustrated combination of hardware components, other embodiments may comprise network nodes with different combinations of components. It is to be understood that a network node comprises any suitable combination of hardware and/or software needed to perform the tasks, features, functions and methods disclosed herein. Moreover, while the components of network node QQ160are depicted as single boxes located within a larger box, or nested within multiple boxes, in practice, a network node may comprise multiple different physical components that make up a single illustrated component (e.g., device readable medium QQ180may comprise multiple separate hard drives as well as multiple RAM modules).

Processing circuitry QQ170is configured to perform any determining, calculating, or similar operations (e.g., certain obtaining operations) described herein as being provided by a network node. These operations performed by processing circuitry QQ170may include processing information obtained by processing circuitry QQ170by, for example, converting the obtained information into other information, comparing the obtained information or converted information to information stored in the network node, and/or performing one or more operations based on the obtained information or converted information, and as a result of said processing making a determination.

Processing circuitry QQ170may comprise a combination of one or more of a microprocessor, controller, microcontroller, central processing unit, digital signal processor, application-specific integrated circuit, field programmable gate array, or any other suitable computing device, resource, or combination of hardware, software and/or encoded logic operable to provide, either alone or in conjunction with other network node QQ160components, such as device readable medium QQ180, network node QQ160functionality. For example, processing circuitry QQ170may execute instructions stored in device readable medium QQ180or in memory within processing circuitry QQ170. Such functionality may include providing any of the various wireless features, functions, or benefits discussed herein. In some embodiments, processing circuitry QQ170may include a system on a chip (SOC).

In some embodiments, processing circuitry QQ170may include one or more of radio frequency (RF) transceiver circuitry QQ172and baseband processing circuitry QQ174. In some embodiments, radio frequency (RF) transceiver circuitry QQ172and baseband processing circuitry QQ174may be on separate chips (or sets of chips), boards, or units, such as radio units and digital units. In alternative embodiments, part or all of RF transceiver circuitry QQ172and baseband processing circuitry QQ174may be on the same chip or set of chips, boards, or units.

In certain embodiments, some or all of the functionality described herein as being provided by a network node, base station, eNB or other such network device may be performed by processing circuitry QQ170executing instructions stored on device readable medium QQ180or memory within processing circuitry QQ170. In alternative embodiments, some or all of the functionality may be provided by processing circuitry QQ170without executing instructions stored on a separate or discrete device readable medium, such as in a hard-wired manner In any of those embodiments, whether executing instructions stored on a device readable storage medium or not, processing circuitry QQ170can be configured to perform the described functionality. The benefits provided by such functionality are not limited to processing circuitry QQ170alone or to other components of network node QQ160, but are enjoyed by network node QQ160as a whole, and/or by end users and the wireless network generally.

Interface QQ190is used in the wired or wireless communication of signalling and/or data between network node QQ160, network QQ106, and/or WDs QQ110. As illustrated, interface QQ190comprises port(s)/terminal(s) QQ194to send and receive data, for example to and from network QQ106over a wired connection. Interface QQ190also includes radio front end circuitry QQ192that may be coupled to, or in certain embodiments a part of, antenna QQ162. Radio front end circuitry QQ192comprises filters QQ198and amplifiers QQ196. Radio front end circuitry QQ192may be connected to antenna QQ162and processing circuitry QQ170. Radio front end circuitry may be configured to condition signals communicated between antenna QQ162and processing circuitry QQ170. Radio front end circuitry QQ192may receive digital data that is to be sent out to other network nodes or WDs via a wireless connection. Radio front end circuitry QQ192may convert the digital data into a radio signal having the appropriate channel and bandwidth parameters using a combination of filters QQ198and/or amplifiers QQ196. The radio signal may then be transmitted via antenna QQ162. Similarly, when receiving data, antenna QQ162may collect radio signals which are then converted into digital data by radio front end circuitry QQ192. The digital data may be passed to processing circuitry QQ170. In other embodiments, the interface may comprise different components and/or different combinations of components.

In certain alternative embodiments, network node QQ160may not include separate radio front end circuitry QQ192, instead, processing circuitry QQ170may comprise radio front end circuitry and may be connected to antenna QQ162without separate radio front end circuitry QQ192. Similarly, in some embodiments, all or some of RF transceiver circuitry QQ172may be considered a part of interface QQ190. In still other embodiments, interface QQ190may include one or more ports or terminals QQ194, radio front end circuitry QQ192, and RF transceiver circuitry QQ172, as part of a radio unit (not shown), and interface QQ190may communicate with baseband processing circuitry QQ174, which is part of a digital unit (not shown).

Antenna QQ162, interface QQ190, and/or processing circuitry QQ170may be configured to perform any receiving operations and/or certain obtaining operations described herein as being performed by a network node. Any information, data and/or signals may be received from a wireless device, another network node and/or any other network equipment. Similarly, antenna QQ162, interface QQ190, and/or processing circuitry QQ170may be configured to perform any transmitting operations described herein as being performed by a network node. Any information, data and/or signals may be transmitted to a wireless device, another network node and/or any other network equipment.

Power circuitry QQ187may comprise, or be coupled to, power management circuitry and is configured to supply the components of network node QQ160with power for performing the functionality described herein. Power circuitry QQ187may receive power from power source QQ186. Power source QQ186and/or power circuitry QQ187may be configured to provide power to the various components of network node QQ160in a form suitable for the respective components (e.g., at a voltage and current level needed for each respective component). Power source QQ186may either be included in, or external to, power circuitry QQ187and/or network node QQ160. For example, network node QQ160may be connectable to an external power source (e.g., an electricity outlet) via an input circuitry or interface such as an electrical cable, whereby the external power source supplies power to power circuitry QQ187. As a further example, power source QQ186may comprise a source of power in the form of a battery or battery pack which is connected to, or integrated in, power circuitry QQ187. The battery may provide backup power should the external power source fail. Other types of power sources, such as photovoltaic devices, may also be used.

Alternative embodiments of network node QQ160may include additional components beyond those shown inFIG. QQ1that may be responsible for providing certain aspects of the network node's functionality, including any of the functionality described herein and/or any functionality necessary to support the subject matter described herein. For example, network node QQ160may include user interface equipment to allow input of information into network node QQ160and to allow output of information from network node QQ160. This may allow a user to perform diagnostic, maintenance, repair, and other administrative functions for network node QQ160.

As illustrated, wireless device QQ110includes antenna QQ111, interface QQ114, processing circuitry QQ120, device readable medium QQ130, user interface equipment QQ132, auxiliary equipment QQ134, power source QQ136and power circuitry QQ137. WD QQ110may include multiple sets of one or more of the illustrated components for different wireless technologies supported by WD QQ110, such as, for example, GSM, WCDMA, LTE, NR, WiFi, WiMAX, or Bluetooth wireless technologies, just to mention a few. These wireless technologies may be integrated into the same or different chips or set of chips as other components within WD QQ110.

Antenna QQ111may include one or more antennas or antenna arrays, configured to send and/or receive wireless signals, and is connected to interface QQ114. In certain alternative embodiments, antenna QQ111may be separate from WD QQ110and be connectable to WD QQ110through an interface or port. Antenna QQ111, interface QQ114, and/or processing circuitry QQ120may be configured to perform any receiving or transmitting operations described herein as being performed by a WD. Any information, data and/or signals may be received from a network node and/or another WD. In some embodiments, radio front end circuitry and/or antenna QQ111may be considered an interface.

As illustrated, interface QQ114comprises radio front end circuitry QQ112and antenna QQ111. Radio front end circuitry QQ112comprise one or more filters QQ118and amplifiers QQ116. Radio front end circuitry QQ114is connected to antenna QQ111and processing circuitry QQ120, and is configured to condition signals communicated between antenna QQ111and processing circuitry QQ120. Radio front end circuitry QQ112may be coupled to or a part of antenna QQ111. In some embodiments, WD QQ110may not include separate radio front end circuitry QQ112; rather, processing circuitry QQ120may comprise radio front end circuitry and may be connected to antenna QQ111. Similarly, in some embodiments, some or all of RF transceiver circuitry QQ122may be considered a part of interface QQ114. Radio front end circuitry QQ112may receive digital data that is to be sent out to other network nodes or WDs via a wireless connection. Radio front end circuitry QQ112may convert the digital data into a radio signal having the appropriate channel and bandwidth parameters using a combination of filters QQ118and/or amplifiers QQ116. The radio signal may then be transmitted via antenna QQ111. Similarly, when receiving data, antenna QQ111may collect radio signals which are then converted into digital data by radio front end circuitry QQ112. The digital data may be passed to processing circuitry QQ120. In other embodiments, the interface may comprise different components and/or different combinations of components.

Processing circuitry QQ120may comprise a combination of one or more of a microprocessor, controller, microcontroller, central processing unit, digital signal processor, application-specific integrated circuit, field programmable gate array, or any other suitable computing device, resource, or combination of hardware, software, and/or encoded logic operable to provide, either alone or in conjunction with other WD QQ110components, such as device readable medium QQ130, WD QQ110functionality. Such functionality may include providing any of the various wireless features or benefits discussed herein. For example, processing circuitry QQ120may execute instructions stored in device readable medium QQ130or in memory within processing circuitry QQ120to provide the functionality disclosed herein.

As illustrated, processing circuitry QQ120includes one or more of RF transceiver circuitry QQ122, baseband processing circuitry QQ124, and application processing circuitry QQ126. In other embodiments, the processing circuitry may comprise different components and/or different combinations of components. In certain embodiments processing circuitry QQ120of WD QQ110may comprise a SOC. In some embodiments, RF transceiver circuitry QQ122, baseband processing circuitry QQ124, and application processing circuitry QQ126may be on separate chips or sets of chips. In alternative embodiments, part or all of baseband processing circuitry QQ124and application processing circuitry QQ126may be combined into one chip or set of chips, and RF transceiver circuitry QQ122may be on a separate chip or set of chips. In still alternative embodiments, part or all of RF transceiver circuitry QQ122and baseband processing circuitry QQ124may be on the same chip or set of chips, and application processing circuitry QQ126may be on a separate chip or set of chips. In yet other alternative embodiments, part or all of RF transceiver circuitry QQ122, baseband processing circuitry QQ124, and application processing circuitry QQ126may be combined in the same chip or set of chips. In some embodiments, RF transceiver circuitry QQ122may be a part of interface QQ114. RF transceiver circuitry QQ122may condition RF signals for processing circuitry QQ120.

In certain embodiments, some or all of the functionality described herein as being performed by a WD may be provided by processing circuitry QQ120executing instructions stored on device readable medium QQ130, which in certain embodiments may be a computer-readable storage medium. In alternative embodiments, some or all of the functionality may be provided by processing circuitry QQ120without executing instructions stored on a separate or discrete device readable storage medium, such as in a hard-wired manner. In any of those particular embodiments, whether executing instructions stored on a device readable storage medium or not, processing circuitry QQ120can be configured to perform the described functionality. The benefits provided by such functionality are not limited to processing circuitry QQ120alone or to other components of WD QQ110, but are enjoyed by WD QQ110as a whole, and/or by end users and the wireless network generally.

Processing circuitry QQ120may be configured to perform any determining, calculating, or similar operations (e.g., certain obtaining operations) described herein as being performed by a WD. These operations, as performed by processing circuitry QQ120, may include processing information obtained by processing circuitry QQ120by, for example, converting the obtained information into other information, comparing the obtained information or converted information to information stored by WD QQ110, and/or performing one or more operations based on the obtained information or converted information, and as a result of said processing making a determination.

Device readable medium QQ130may be operable to store a computer program, software, an application including one or more of logic, rules, code, tables, etc. and/or other instructions capable of being executed by processing circuitry QQ120. Device readable medium QQ130may include computer memory (e.g., Random Access Memory (RAM) or Read Only Memory (ROM)), mass storage media (e.g., a hard disk), removable storage media (e.g., a Compact Disk (CD) or a Digital Video Disk (DVD)), and/or any other volatile or non-volatile, non-transitory device readable and/or computer executable memory devices that store information, data, and/or instructions that may be used by processing circuitry QQ120. In some embodiments, processing circuitry QQ120and device readable medium QQ130may be considered to be integrated.

User interface equipment QQ132may provide components that allow for a human user to interact with WD QQ110. Such interaction may be of many forms, such as visual, audial, tactile, etc. User interface equipment QQ132may be operable to produce output to the user and to allow the user to provide input to WD QQ110. The type of interaction may vary depending on the type of user interface equipment QQ132installed in WD QQ110. For example, if WD QQ110is a smart phone, the interaction may be via a touch screen; if WD QQ110is a smart meter, the interaction may be through a screen that provides usage (e.g., the number of gallons used) or a speaker that provides an audible alert (e.g., if smoke is detected). User interface equipment QQ132may include input interfaces, devices and circuits, and output interfaces, devices and circuits. User interface equipment QQ132is configured to allow input of information into WD QQ110, and is connected to processing circuitry QQ120to allow processing circuitry QQ120to process the input information. User interface equipment QQ132may include, for example, a microphone, a proximity or other sensor, keys/buttons, a touch display, one or more cameras, a USB port, or other input circuitry. User interface equipment QQ132is also configured to allow output of information from WD QQ110, and to allow processing circuitry QQ120to output information from WD QQ110. User interface equipment QQ132may include, for example, a speaker, a display, vibrating circuitry, a USB port, a headphone interface, or other output circuitry. Using one or more input and output interfaces, devices, and circuits, of user interface equipment QQ132, WD QQ110may communicate with end users and/or the wireless network, and allow them to benefit from the functionality described herein.

Power source QQ136may, in some embodiments, be in the form of a battery or battery pack. Other types of power sources, such as an external power source (e.g., an electricity outlet), photovoltaic devices or power cells, may also be used. WD QQ110may further comprise power circuitry QQ137for delivering power from power source QQ136to the various parts of WD QQ110which need power from power source QQ136to carry out any functionality described or indicated herein. Power circuitry QQ137may in certain embodiments comprise power management circuitry. Power circuitry QQ137may additionally or alternatively be operable to receive power from an external power source; in which case WD QQ110may be connectable to the external power source (such as an electricity outlet) via input circuitry or an interface such as an electrical power cable. Power circuitry QQ137may also in certain embodiments be operable to deliver power from an external power source to power source QQ136. This may be, for example, for the charging of power source QQ136. Power circuitry QQ137may perform any formatting, converting, or other modification to the power from power source QQ136to make the power suitable for the respective components of WD QQ110to which power is supplied.

FIG. QQ2: User Equipment in accordance with some embodiments

InFIG. QQ2, UE QQ200includes processing circuitry QQ201that is operatively coupled to input/output interface QQ205, radio frequency (RF) interface QQ209, network connection interface QQ211, memory QQ215including random access memory (RAM) QQ217, read-only memory (ROM) QQ219, and storage medium QQ221or the like, communication subsystem QQ231, power source QQ233, and/or any other component, or any combination thereof. Storage medium QQ221includes operating system QQ223, application program QQ225, and data QQ227. In other embodiments, storage medium QQ221may include other similar types of information. Certain UEs may utilize all of the components shown inFIG. QQ2, or only a subset of the components. The level of integration between the components may vary from one UE to another UE. Further, certain UEs may contain multiple instances of a component, such as multiple processors, memories, transceivers, transmitters, receivers, etc.

RAM QQ217may be configured to interface via bus QQ202to processing circuitry QQ201to provide storage or caching of data or computer instructions during the execution of software programs such as the operating system, application programs, and device drivers. ROM QQ219may be configured to provide computer instructions or data to processing circuitry QQ201. For example, ROM QQ219may be configured to store invariant low-level system code or data for basic system functions such as basic input and output (I/O), startup, or reception of keystrokes from a keyboard that are stored in a non-volatile memory. Storage medium QQ221may be configured to include memory such as RAM, ROM, programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), magnetic disks, optical disks, floppy disks, hard disks, removable cartridges, or flash drives. In one example, storage medium QQ221may be configured to include operating system QQ223, application program QQ225such as a web browser application, a widget or gadget engine or another application, and data file QQ227. Storage medium QQ221may store, for use by UE QQ200, any of a variety of various operating systems or combinations of operating systems.

InFIG. QQ2, processing circuitry QQ201may be configured to communicate with network QQ243busing communication subsystem QQ231. Network QQ243aand network QQ243bmay be the same network or networks or different network or networks. Communication subsystem QQ231may be configured to include one or more transceivers used to communicate with network QQ243b. For example, communication subsystem QQ231may be configured to include one or more transceivers used to communicate with one or more remote transceivers of another device capable of wireless communication such as another WD, UE, or base station of a radio access network (RAN) according to one or more communication protocols, such as IEEE 802.QQ2, CDMA, WCDMA, GSM, LTE, UTRAN, WiMax, or the like. Each transceiver may include transmitter QQ233and/or receiver QQ235to implement transmitter or receiver functionality, respectively, appropriate to the RAN links (e.g., frequency allocations and the like). Further, transmitter QQ233and receiver QQ235of each transceiver may share circuit components, software or firmware, or alternatively may be implemented separately.

The features, benefits and/or functions described herein may be implemented in one of the components of UE QQ200or partitioned across multiple components of UE QQ200. Further, the features, benefits, and/or functions described herein may be implemented in any combination of hardware, software or firmware. In one example, communication subsystem QQ231may be configured to include any of the components described herein. Further, processing circuitry QQ201may be configured to communicate with any of such components over bus QQ202. In another example, any of such components may be represented by program instructions stored in memory that when executed by processing circuitry QQ201perform the corresponding functions described herein. In another example, the functionality of any of such components may be partitioned between processing circuitry QQ201and communication subsystem QQ231. In another example, the non-computationally intensive functions of any of such components may be implemented in software or firmware and the computationally intensive functions may be implemented in hardware.

FIG. QQ3: Virtualization environment in accordance with some embodiments

In some embodiments, some or all of the functions described herein may be implemented as virtual components executed by one or more virtual machines implemented in one or more virtual environments QQ300hosted by one or more of hardware nodes QQ330. Further, in embodiments in which the virtual node is not a radio access node or does not require radio connectivity (e.g., a core network node), then the network node may be entirely virtualized.

The functions may be implemented by one or more applications QQ320(which may alternatively be called software instances, virtual appliances, network functions, virtual nodes, virtual network functions, etc.) operative to implement some of the features, functions, and/or benefits of some of the embodiments disclosed herein. Applications QQ320are run in virtualization environment QQ300which provides hardware QQ330comprising processing circuitry QQ360and memory QQ390. Memory QQ390contains instructions QQ395executable by processing circuitry QQ360whereby application QQ320is operative to provide one or more of the features, benefits, and/or functions disclosed herein.

Virtualization environment QQ300, comprises general-purpose or special-purpose network hardware devices QQ330comprising a set of one or more processors or processing circuitry QQ360, which may be commercial off-the-shelf (COTS) processors, dedicated Application Specific Integrated Circuits (ASICs), or any other type of processing circuitry including digital or analog hardware components or special purpose processors. Each hardware device may comprise memory QQ390-1which may be non-persistent memory for temporarily storing instructions QQ395or software executed by processing circuitry QQ360. Each hardware device may comprise one or more network interface controllers (NICs) QQ370, also known as network interface cards, which include physical network interface QQ380. Each hardware device may also include non-transitory, persistent, machine-readable storage media QQ390-2having stored therein software QQ395and/or instructions executable by processing circuitry QQ360. Software QQ395may include any type of software including software for instantiating one or more virtualization layers QQ350(also referred to as hypervisors), software to execute virtual machines QQ340as well as software allowing it to execute functions, features and/or benefits described in relation with some embodiments described herein.

Virtual machines QQ340, comprise virtual processing, virtual memory, virtual networking or interface and virtual storage, and may be run by a corresponding virtualization layer QQ350or hypervisor. Different embodiments of the instance of virtual appliance QQ320may be implemented on one or more of virtual machines QQ340, and the implementations may be made in different ways.

During operation, processing circuitry QQ360executes software QQ395to instantiate the hypervisor or virtualization layer QQ350, which may sometimes be referred to as a virtual machine monitor (VMM). Virtualization layer QQ350may present a virtual operating platform that appears like networking hardware to virtual machine QQ340.

As shown inFIG. QQ3, hardware QQ330may be a standalone network node with generic or specific components. Hardware QQ330may comprise antenna QQ3225and may implement some functions via virtualization. Alternatively, hardware QQ330may be part of a larger cluster of hardware (e.g. such as in a data center or customer premise equipment (CPE)) where many hardware nodes work together and are managed via management and orchestration (MANO) QQ3100, which, among others, oversees lifecycle management of applications QQ320.

In the context of NFV, virtual machine QQ340may be a software implementation of a physical machine that runs programs as if they were executing on a physical, non-virtualized machine. Each of virtual machines QQ340, and that part of hardware QQ330that executes that virtual machine, be it hardware dedicated to that virtual machine and/or hardware shared by that virtual machine with others of the virtual machines QQ340, forms a separate virtual network elements (VNE).

Still in the context of NFV, Virtual Network Function (VNF) is responsible for handling specific network functions that run in one or more virtual machines QQ340on top of hardware networking infrastructure QQ330and corresponds to application QQ320inFIG. QQ3.

In some embodiments, one or more radio units QQ3200that each include one or more transmitters QQ3220and one or more receivers QQ3210may be coupled to one or more antennas QQ3225. Radio units QQ3200may communicate directly with hardware nodes QQ330via one or more appropriate network interfaces and may be used in combination with the virtual components to provide a virtual node with radio capabilities, such as a radio access node or a base station.

In some embodiments, some signalling can be affected with the use of control system QQ3230which may alternatively be used for communication between the hardware nodes QQ330and radio units QQ3200.

With reference toFIGURE QQ4, in accordance with an embodiment, a communication system includes telecommunication network QQ410, such as a 3GPP-type cellular network, which comprises access network QQ411, such as a radio access network, and core network QQ414. Access network QQ411comprises a plurality of base stations QQ412a, QQ412b, QQ412c, such as NBs, eNBs, gNBs or other types of wireless access points, each defining a corresponding coverage area QQ413a, QQ413b, QQ413c. Each base station QQ412a, QQ412b, QQ412cis connectable to core network QQ414over a wired or wireless connection QQ415. A first UE QQ491located in coverage area QQ413cis configured to wirelessly connect to, or be paged by, the corresponding base station QQ412c. A second UE QQ492in coverage area QQ413ais wirelessly connectable to the corresponding base station QQ412a. While a plurality of UEs QQ491, QQ492are illustrated in this example, the disclosed embodiments are equally applicable to a situation where a sole UE is in the coverage area or where a sole UE is connecting to the corresponding base station QQ412.

Telecommunication network QQ410is itself connected to host computer QQ430, which may be embodied in the hardware and/or software of a standalone server, a cloud-implemented server, a distributed server or as processing resources in a server farm. Host computer QQ430may be under the ownership or control of a service provider, or may be operated by the service provider or on behalf of the service provider. Connections QQ421and QQ422between telecommunication network QQ410and host computer QQ430may extend directly from core network QQ414to host computer QQ430or may go via an optional intermediate network QQ420. Intermediate network QQ420may be one of, or a combination of more than one of, a public, private or hosted network; intermediate network QQ420, if any, may be a backbone network or the Internet; in particular, intermediate network QQ420may comprise two or more sub-networks (not shown).

The communication system ofFIG. QQ4as a whole enables connectivity between the connected UEs QQ491, QQ492and host computer QQ430. The connectivity may be described as an over-the-top (OTT) connection QQ450. Host computer QQ430and the connected UEs QQ491, QQ492are configured to communicate data and/or signaling via OTT connection QQ450, using access network QQ411, core network QQ414, any intermediate network QQ420and possible further infrastructure (not shown) as intermediaries. OTT connection QQ450may be transparent in the sense that the participating communication devices through which OTT connection QQ450passes are unaware of routing of uplink and downlink communications. For example, base station QQ412may not or need not be informed about the past routing of an incoming downlink communication with data originating from host computer QQ430to be forwarded (e.g., handed over) to a connected UE QQ491. Similarly, base station QQ412need not be aware of the future routing of an outgoing uplink communication originating from the UE QQ491towards the host computer QQ430.

Example implementations, in accordance with an embodiment, of the UE, base station and host computer discussed in the preceding paragraphs will now be described with reference toFIG. QQ5. In communication system QQ500, host computer QQ510comprises hardware QQ515including communication interface QQ516configured to set up and maintain a wired or wireless connection with an interface of a different communication device of communication system QQ500. Host computer QQ510further comprises processing circuitry QQ518, which may have storage and/or processing capabilities. In particular, processing circuitry QQ518may comprise one or more programmable processors, application-specific integrated circuits, field programmable gate arrays or combinations of these (not shown) adapted to execute instructions. Host computer QQ510further comprises software QQ511, which is stored in or accessible by host computer QQ510and executable by processing circuitry QQ518. Software QQ511includes host application QQ512. Host application QQ512may be operable to provide a service to a remote user, such as UE QQ530connecting via OTT connection QQ550terminating at UE QQ530and host computer QQ510. In providing the service to the remote user, host application QQ512may provide user data which is transmitted using OTT connection QQ550.

Communication system QQ500further includes base station QQ520provided in a telecommunication system and comprising hardware QQ525enabling it to communicate with host computer QQ510and with UE QQ530. Hardware QQ525may include communication interface QQ526for setting up and maintaining a wired or wireless connection with an interface of a different communication device of communication system QQ500, as well as radio interface QQ527for setting up and maintaining at least wireless connection QQ570with UE QQ530located in a coverage area (not shown inFIG. QQ5) served by base station QQ520. Communication interface QQ526may be configured to facilitate connection QQ560to host computer QQ510. Connection QQ560may be direct or it may pass through a core network (not shown inFIG. QQ5) of the telecommunication system and/or through one or more intermediate networks outside the telecommunication system. In the embodiment shown, hardware QQ525of base station QQ520further includes processing circuitry QQ528, which may comprise one or more programmable processors, application-specific integrated circuits, field programmable gate arrays or combinations of these (not shown) adapted to execute instructions. Base station QQ520further has software QQ521stored internally or accessible via an external connection.

Communication system QQ500further includes UE QQ530already referred to. Its hardware QQ535may include radio interface QQ537configured to set up and maintain wireless connection QQ570with a base station serving a coverage area in which UE QQ530is currently located. Hardware QQ535of UE QQ530further includes processing circuitry QQ538, which may comprise one or more programmable processors, application-specific integrated circuits, field programmable gate arrays or combinations of these (not shown) adapted to execute instructions. UE QQ530further comprises software QQ531, which is stored in or accessible by UE QQ530and executable by processing circuitry QQ538. Software QQ531includes client application QQ532. Client application QQ532may be operable to provide a service to a human or non-human user via UE QQ530, with the support of host computer QQ510. In host computer QQ510, an executing host application QQ512may communicate with the executing client application QQ532via OTT connection QQ550terminating at UE QQ530and host computer QQ510. In providing the service to the user, client application QQ532may receive request data from host application QQ512and provide user data in response to the request data. OTT connection QQ550may transfer both the request data and the user data. Client application QQ532may interact with the user to generate the user data that it provides.

It is noted that host computer QQ510, base station QQ520and UE QQ530illustrated inFIG. QQ5may be similar or identical to host computer QQ430, one of base stations QQ412a, QQ412b, QQ412cand one of UEs QQ491, QQ492ofFIG. QQ4, respectively. This is to say, the inner workings of these entities may be as shown inFigure QQ5and independently, the surrounding network topology may be that ofFIG. QQ4.

InFIG. QQ5, OTT connection QQ550has been drawn abstractly to illustrate the communication between host computer QQ510and UE QQ530via base station QQ520, without explicit reference to any intermediary devices and the precise routing of messages via these devices. Network infrastructure may determine the routing, which it may be configured to hide from UE QQ530or from the service provider operating host computer QQ510, or both. While OTT connection QQ550is active, the network infrastructure may further take decisions by which it dynamically changes the routing (e.g., on the basis of load balancing consideration or reconfiguration of the network).

Wireless connection QQ570between UE QQ530and base station QQ520is in accordance with the teachings of the embodiments described throughout this disclosure. One or more of the various embodiments may improve the performance of OTT services provided to UE QQ530using OTT connection QQ550, in which wireless connection QQ570forms the last segment. More precisely, the teachings of these embodiments may improve the deblock filtering for video processing and thereby provide benefits such as improved video encoding and/or decoding.

A measurement procedure may be provided for the purpose of monitoring data rate, latency and other factors on which the one or more embodiments improve. There may further be an optional network functionality for reconfiguring OTT connection QQ550between host computer QQ510and UE QQ530, in response to variations in the measurement results. The measurement procedure and/or the network functionality for reconfiguring OTT connection QQ550may be implemented in software QQ511and hardware QQ515of host computer QQ510or in software QQ531and hardware QQ535of UE QQ530, or both. In embodiments, sensors (not shown) may be deployed in or in association with communication devices through which OTT connection QQ550passes; the sensors may participate in the measurement procedure by supplying values of the monitored quantities exemplified above, or supplying values of other physical quantities from which software QQ511, QQ531may compute or estimate the monitored quantities. The reconfiguring of OTT connection QQ550may include message format, retransmission settings, preferred routing etc.; the reconfiguring need not affect base station QQ520, and it may be unknown or imperceptible to base station QQ520. Such procedures and functionalities may be known and practiced in the art. In certain embodiments, measurements may involve proprietary UE signaling facilitating host computer QQ510's measurements of throughput, propagation times, latency and the like. The measurements may be implemented in that software QQ511and QQ531causes messages to be transmitted, in particular empty or ‘dummy’ messages, using OTT connection QQ550while it monitors propagation times, errors etc.

FIG. QQ6is a flowchart illustrating a method implemented in a communication system, in accordance with one embodiment. The communication system includes a host computer, a base station and a UE which may be those described with reference toFIGS. QQ4and QQ5. For simplicity of the present disclosure, only drawing references toFIG. QQ6will be included in this section. In step QQ610, the host computer provides user data. In substep QQ611(which may be optional) of step QQ610, the host computer provides the user data by executing a host application. In step QQ620, the host computer initiates a transmission carrying the user data to the UE. In step QQ630(which may be optional), the base station transmits to the UE the user data which was carried in the transmission that the host computer initiated, in accordance with the teachings of the embodiments described throughout this disclosure. In step QQ640(which may also be optional), the UE executes a client application associated with the host application executed by the host computer.

FIG. QQ8is a flowchart illustrating a method implemented in a communication system, in accordance with one embodiment. The communication system includes a host computer, a base station and a UE which may be those described with reference toFIGS. QQ4and QQ5. For simplicity of the present disclosure, only drawing references toFIG. QQ8will be included in this section. In step QQ810(which may be optional), the UE receives input data provided by the host computer. Additionally or alternatively, in step QQ820, the UE provides user data. In substep QQ821(which may be optional) of step QQ820, the UE provides the user data by executing a client application. In substep QQ811(which may be optional) of step QQ810, the UE executes a client application which provides the user data in reaction to the received input data provided by the host computer. In providing the user data, the executed client application may further consider user input received from the user. Regardless of the specific manner in which the user data was provided, the UE initiates, in substep QQ830(which may be optional), transmission of the user data to the host computer. In step QQ840of the method, the host computer receives the user data transmitted from the UE, in accordance with the teachings of the embodiments described throughout this disclosure.

FIG. QQ9: Methods implemented in a communication system including a host computer, a base station and a user equipment in accordance with some embodiments.

ABBREVIATIONS

At least some of the following abbreviations may be used in this disclosure. If there is an inconsistency between abbreviations, preference should be given to how it is used above. If listed multiple times below, the first listing should be preferred over any subsequent listing(s).1×RTT CDMA20001×Radio Transmission Technology3GPP 3rd Generation Partnership Project5G 5th GenerationABS Almost Blank SubframeARQ Automatic Repeat RequestAWGN Additive White Gaussian NoiseBCCH Broadcast Control ChannelBCH Broadcast ChannelCA Carrier AggregationCC Carrier ComponentCCCH SDU Common Control Channel SDUCDMA Code Division Multiplexing AccessCGI Cell Global IdentifierCIR Channel Impulse ResponseCP Cyclic PrefixCPICH Common Pilot ChannelCPICH Ec/No CPICH Received energy per chip divided by the power density in the bandCQI Channel Quality informationC-RNTI Cell RNTICSI Channel State InformationDCCH Dedicated Control ChannelDL DownlinkDM DemodulationDMRS Demodulation Reference SignalDRX Discontinuous ReceptionDTX Discontinuous TransmissionDTCH Dedicated Traffic ChannelDUT Device Under TestE-CID Enhanced Cell-ID (positioning method)E-SMLC Evolved-Serving Mobile Location CentreECGI Evolved CGIeNB E-UTRAN NodeBePDCCH enhanced Physical Downlink Control ChannelE-SMLC evolved Serving Mobile Location CenterE-UTRA Evolved UTRAE-UTRAN Evolved UTRANFDD Frequency Division DuplexPPS For Further StudyGERAN GSM EDGE Radio Access NetworkgNB Base station in NRGNSS Global Navigation Satellite SystemGSM Global System for Mobile communicationHARQ Hybrid Automatic Repeat RequestHO HandoverHSPA High Speed Packet AccessHRPD High Rate Packet DataLIC Local Illumination CompensationLOS Line of SightLPP LTE Positioning ProtocolLTE Long-Term EvolutionMAC Medium Access ControlMBMS Multimedia Broadcast Multicast ServicesMBSFN Multimedia Broadcast multicast service Single Frequency NetworkMBSFN ABS MBSFN Almost Blank SubframeMDT Minimization of Drive TestsMIB Master Information BlockMME Mobility Management EntityMSC Mobile Switching CenterNPDCCH Narrowband Physical Downlink Control ChannelNR New RadioOCNG OFDMA Channel Noise GeneratorOFDM Orthogonal Frequency Division MultiplexingOFDMA Orthogonal Frequency Division Multiple AccessOSS Operations Support SystemOTDOA Observed Time Difference of ArrivalO&M Operation and MaintenancePBCH Physical Broadcast ChannelP-CCPCH Primary Common Control Physical ChannelPCell Primary CellPCFICH Physical Control Format Indicator ChannelPDCCH Physical Downlink Control ChannelPDP Profile Delay ProfilePDSCH Physical Downlink Shared ChannelPGW Packet GatewayPHICH Physical Hybrid-ARQ Indicator ChannelPLMN Public Land Mobile NetworkPMI Precoder Matrix IndicatorPRACH Physical Random Access ChannelPRS Positioning Reference SignalPSS Primary Synchronization SignalPUCCH Physical Uplink Control ChannelPUSCH Physical Uplink Shared ChannelRACH Random Access ChannelQAM Quadrature Amplitude ModulationRAN Radio Access NetworkRAT Radio Access TechnologyRLM Radio Link ManagementRNC Radio Network ControllerRNTI Radio Network Temporary IdentifierRRC Radio Resource ControlRRM Radio Resource ManagementRS Reference SignalRSCP Received Signal Code PowerRSRP Reference Symbol Received Power OR Reference Signal Received PowerRSRQ Reference Signal Received Quality OR Reference Symbol Received QualityRSSI Received Signal Strength IndicatorRSTD Reference Signal Time DifferenceSCH Synchronization ChannelSCell Secondary CellSDU Service Data UnitSFN System Frame NumberSGW Serving GatewaySI System InformationSIB System Information BlockSNR Signal to Noise RatioSON Self Optimized NetworkSS Synchronization SignalSSS Secondary Synchronization SignalTDD Time Division DuplexTDOA Time Difference of ArrivalTOA Time of ArrivalTSS Tertiary Synchronization SignalTTI Transmission Time IntervalUE User EquipmentUL UplinkUMTS Universal Mobile Telecommunication SystemUSIM Universal Subscriber Identity ModuleUTDOA Uplink Time Difference of ArrivalUTRA Universal Terrestrial Radio AccessUTRAN Universal Terrestrial Radio Access NetworkWCDMA Wide CDMAWLANWide Local Area Network
Further definitions are provided below.

Many variations and modifications can be made to the embodiments without substantially departing from the principles of the present inventive concepts. All such variations and modifications are intended to be included herein within the scope of present inventive concepts. Accordingly, the above disclosed subject matter is to be considered illustrative, and not restrictive, and the examples of embodiments are intended to cover all such modifications, enhancements, and other embodiments, which fall within the spirit and scope of present inventive concepts. Thus, to the maximum extent allowed by law, the scope of present inventive concepts is to be determined by the broadest permissible interpretation of the present disclosure including the examples of embodiments and their equivalents and shall not be restricted or limited by the foregoing detailed description.