METHOD AND APPARATUS FOR. VIDEO CODING

INCORPORATIO BY REFERENCE

f OOOl] This preset appl ication claims the benefit of priority to IIS Patent Application No. ίό/884 _; 9?1 ,“METHOD AND APPARATUS FOR VIDEO CODING” filed on May 27, 2020, which claims the benefit of priority to LIS. Provisional Application No. 62/857,141 , “IMPLICIT TRANSFORM FOR INTER PREDICTION MODES” filed on June 04, 2019, and ITS. Provisional Application No. 62/892,238,“HIGH-LEVEL SYNTAX ON PRIMARY TRANSFORM” filed on August 27, 2019. The entire disclosures of the prior applications are hereby incorporated by reference in their entirety.

TECHNICAL FIELD

{0002] The present disclosure describes embodiments generally related to video coding.

BACKGROUND

[8003] The background description provided herein is for the purpose of generally presenting the context of the disclosure. Work of the presently named inventors, to the extent the work is described in this background section, as well as aspects of the description that may not Otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admi tted as prior art against the present disclosure.

[0004] Video coding and decoding can be performed usin inter-picture prediction with motion compensation. Uncompressed digital video can include a series of pictures, each picture having a spatial dimension of, for example, 1920 x; 1080 luminance samples and associated chrominance samples. The series of pictures can have a fixed or variable picture rate (informally also known as fra e fate), of, for example 60 pictures per secon or 60 Hz. Uncompressed video has significant bitrate requirements. For example, 1080p6O 4;2:0 video at 8 bit per sample (1920x1080 luminance sample resolution at 60 Hz frame rate) requires close to 1.5 Gbit/s bandwidth. An hour of such video requires more than 600 gigabytes (GB) of storage space.

[0005] One purpose of video coding an decodin can be the reduction of redundancy in the input video signal, through compression. Compression can help reduce the aforementioned bandwidth or storage space requirements, in some eases by two orders of magnitude or more. Both lossless and lossy compression, as well as a combination thereof can he employed. Lossless compression refers to techniques where an exact copy of the original signal can he reconstructed from the compressed original signal. When using loss compression, the reconstructed signal may not be identical to the original signal, but the distortion between original and reconstructe signals is small enough to make the reconstructed signal useful for die intended application. In the case of video, lossy compression is widely employed. The amount of distortion tolerated depends on the application; for example, users of certain consumer streaming applications may tolerate higher distortion than users of television di stribution applications. The compression ratio achievable can reflect that: higher aliowab!e/tolerable distortion can yiel higher compression ratios.

|Mb6] A video encoder and decoder can tilize techniques from several broad categories, including, for example, motion compensation, transform, quantization, and entropy coding.

1*1807] Video codec technologies can include techniques known as intra coding, In intra coding, sample values are represented without reference to samples or other data from previously reconstructed reference pictures in some video codecs, the picture is spatially subdivided into blocks of samples. When all blocks of samples are coded In intra mode, that pic ture can be an intra picture Intra pictures and their derivations such as independent decoder refresh pictures, can be used to reset the decoder state and can, therefore, be used as the first picture in a coded video bitstream and a video session, or as a still image. The samples of an intra block can be ex posed to a transform, and the transform coefficien ts can be quantized before entropy coding. Intra prediction can be a technique that minimizes sample values in the pre-transform domain.

In some cases, the smaller the DC value after a transform is, and the smaller the AC coefficients are, the fewer the bits that are required at a given quantization step size to represent the block after entropy coding.

fOOOS] Traditional intra coding such as known from, for example MPEG~2 generation coding technologies, does not use intra prediction. However, some newer video compression technologies include techniques that attempt, from, for example, surrounding sample data and/or metadata obtained during the encoding/decoding of spatially neighboring, and preceding in decoding order, blocks of data. Such techniques are henceforth called 'intra rediction”

techniques. Note that in at least some cases, intra prediction is only using reference data from the current picture under reconstruction and not from reference pictures.

{8009] There can be many di fferent forms of intra prediction. When more than one of such techniques can be used in a given video coding technology, the technique in use can be ceded in an liit prediction mode. In certain cases, modes can have submodes aud/or parameters, and those can be coded individually or included in the mode codeword. Which codeword to use for a given mode/submode/paiarnetef combination can have an impact in the coding efficiency gain through infra prediction, and so can the entropy coding technology used to translate the codewords into a bitstream.

|O t0f A certain mode of iiitra prediction was introduced with 11264, refined in H.265, and further refined in newer coding technologies suc as joint exploration model (JEM), versatile video coding (VVC), and benchmark set (BM S). A predictor block can be formed using neighboring sample values belonging to already available samples. Sample values of neighboring samples are copied into the predictor block according to a direction. A reference to the direction in use can be coded in the bi tstream or may itself be predicted

SUMMARY

(0011] Aspec ts of the disclosure provide a modified implicit transform method. In addition, an implicit transform selection method for an inter position dependent prediction combination (PDPC) prediction mode is provided.

|00l 2 | According to an. aspect o f the disclosure, a method of video decoding for a decoder is provided. In the method, prediction information of a current block in a current picture Is decoded from a coded video bi tstream, where the predi ction information is Indicati ve of an inter prediction mode. Whether a filtering process is applied on the current block is determined, where the filtering process adjusts inter prediction samples of the current block based o neighboring reconstructed samples of the current block. A primary transform is thus performed for a transform block according to pre-defmed primary transform type based on that the filtering process is determined to be applied on the current block, where the transform block is partitioned .from the current block.

pel 3] In some embodiments, the fi ltering process can be operated based on a position dependent prediction combination (PDPC) mode or a combined inter and intra prediction (CUP) mode,

jCM)14 j In some embodiments the pre-defined primary transform type c n be a type-7 discrete sine transform (DST-7) mode for a horizont l transform that is applied to the transform block responsive to a width of file current block being smaller than or equal to a threshold value. The pre-defined primary transfor type can be the DST-7 mode for a vertical transform that is applied to the transform block responsive to a height of the eun-ent block being smaller than or equal to the threshold value. The threshold value can include one of 4 pixels, 8 pixels, 16 pixels. or 32 pixels,

fOOI.5) In the method, the pre-derined primary transform type can he a type-2 discrete cosine transform (DCT-2) mode for a horizontal transform that is applied to the transform block responsi ve to a width of the current block being bigger than to a threshold value. The predefined primary transform type can be the DCT-2 mode for a vertical transform is applied to the transform block responsive to a height of the curren t b lock being larger than the threshold valne. The threshold value can include one of 4 pixels, 8 pixels, 16 pixels, or 32 pixels.

|¾0tdj In some embodiments, the pre-defmed primary transform type can be a transform skip mode (TSM), a DCT-2 mode, or a/DST-7 mode

[0017] In some embodiments, the filtering process can be a boundary filtering process in which at least one of rows adjacent to a boundary of the current block or at least one of columns adjacent to the boundary of the current bloc are adjusted based on the filtering process,

jOOtSJ in some embodiments, the filtering process applies position-dependent weightings between the inter prediction samples of the current block and the neighboring reconstructed samples of the current block.

}00J5>] In the method, the pre-derined primar' transform type can be implicit for a luma component of the current block, and a DCT-2 mode or a transform skip mode (TSM) for a chroma component of the current block

[O020J In the method, the pre-derined primary transfor type can be a type-7 discrete slue transform (DST~7) mode for a horizontal transform that is applied to the transform block responsive to (i) the filtering process being operated in the CUP mode with ratio of W _it¾ Wi, _¾tel· being larger than a first threshold, and (ii) a width of the current block being smaller than or equal to a second threshold value. The primary bans form type can be the PST-? mode for a vertical transform that is applied to the transform block responsi ve to (i) the filtering process being operate in the CUP mode with the ratio ofW^ _t r/W- _a » _* * being larger than the first threshold, and (11) a height of the current block being smaller than or equal to the second threshold value. The first threshold valne can include one of 2, 2 5, 3, or 7, The second

threshold value can include one of 4 pixels, 8 pixels, 16 pixels, or 32 pixels, W- * can be an. intra weighting factor applied on an intra prediction information of the current block, and W; _0¾;r can he an inter weighting factor appli ed on an inter prediction information of the current block. [9921] in some e bodituemts _· , the pre-d&fitted primary transfor type can be a type-7 discrete sine transform (DST-7) mode for a horizontal transform that is applied to the transform block responsive to (i) the filtering process being operated based on the CUP mode _» both above and left neighboring blocks of the current block being intra coded, and (in) a width of the current block being smaller than or equal to a threshold value. The pfe-defined primary

transform type can be the DST-7 inode for a vertical transform that is applied to the transform block responsiv to (i) the filtering process being operated In the CUP mode, (u) both the above and the left neighboring blocks of the current block being intra coded, and (ii) a height of the current block being smaller than or equal to the threshold value. The threshold value can Include one of 4 pixels, 8 pixels, 16 pixels, or 32 pixels.

{09221 In some embodiments, the pre-defmed primary transform type can be a ty e ? discrete sine t ransform (DST-7) mode for a horizontal transform that is applied to th transform block responsive to (I) th filtering process being operated based on the CUP mode, (ii) a subset of above and left neighboring blocks of the current block being intra coded, (in) a width of the current block being smaller than or equal to a threshold value. The pre-defined primary

transform type ca be the DST-7 mode for a vertical transform that is applied to the transform block responsi ve to (i) the filtering process being operated based on the CIIP mode, (ii) the subset of the above and the left neighboring blocks of the current block being intra coded, an a height of the current block being smaller than or equal to the threshold value. The threshold value cau include one of 4 pixels, S pixels, 16 pixels, or 32 pixels.

[ 9 31 In the method, a con text model can be determined from a set of context models based on the prediction information, where the prediction Information indicates the filtering process that is based on the PDPC mode is applied to the current block, rimary transform type information can be decoded based o the determined context model w here the primar transform type information indicates whether the pre-defined primary transfor type includes one of a transform skip mode (TSM), a DCT-2 mode, a DST-7 mode, o a DCT-S mode.

100241 According to another aspect of the disclosure, a method of video decoding for a decoder is provided in th method, prediction information of a current block can be acquired from a coded video bitstream. A determination can be made as to whether foe prediction information indicates (i) an inter prediction merge mode, and (it) a combine Inter and intra prediction (COP) mode. An intra prediction mode can be determined from an intra prediction mode candidate list responsive to the prediction information indicating the inter predictio merge "mode and the CO mode jhtra prediction information according io the intra prediction inode and infer prediction information according to die inter prediction merge mode can be determined. A weighting factor can further be determined responsive to neighboring blocks of the current block being coded according to the CUP mode or an inter position dependent prediction

combination (PDPC) mode, CUP prediction information ca thus be determined based on a sum of a weighted intra prediction information and weighted inter prediction information, where the weighted infra prediction information is based cm the intra prediction information and the weighting factor, an the weighted inter prediction information is based on the inter prediction information an the weighting factor. Further, a sample of the current block can be

reconstructed according to the COP prediction information,

j0025j In some embodiments, weighted inter prediction information can be based on the inter predictio information and a constant value minus the weighting factor, the constant value including one of 2, 4, 8, or 16.

(0926] In some embodiments, the weighting factor can be 3 responsive to both top- right top and boitom-left/leff neighboring blocks of the current block bein coded rising the GIF mode. In some embodiment, the weighting factor ca be 2 responsive to one of the top-right/top and the boitonideft/left neighboring blocks of the current block being coded using the COP mode. I some embodiments, the weighting factor can be 1 responsive to the top-right/top and the bottom-ieft/Ieft: neighboring blocks of the current block being coded using the GIF mode {0927 In some embodiments, the weighting factor can he 3 responsi ve to both top- rightdop and bottoni-left/teft. neighboring blocks of the current block bei ng coded us ing the PDPC mode. The Weighting factor can be 2 responsive to one of the fop~right/tep and the botto -left/Ieft neighboring blocks of the current block being coded using the PDPC mode. Th weighting factor can be 1 responsive to none of the top-right/top and the bottom-ieft/left neighboring blocks of the current block bein coded using the PDPC mode

|0il28{ According to yet another aspect o f the disclosure, a method of video decoding for a decoder is provided. In the method, transform block signaling information can be acquired from a coded video bitstream, where the transform block signaling infor mation includes first information associate with an inter prediction transform and second information associated with an intra prediction transform, A first value of the first information and a second value of the second Information can subsequently be determined. A first transform block coded i an inter prediction mode can be transformed according to die first value and a first pre-defined transform type in an implicit multiple transfonn selection (MTS) mode. A second transform block coded in am inira prediction mode can be transformed according to a second value and a second predefined transform type in tie implicit MTS mode.

[0629] In some embodiments, the first value of the first information can be equal to 1 and the second value of t he second information: can be equal to I.

|:0030] In some embodiments, the first value of die first information can be greater than 0, and the second value of (he second information can be equal to

10031 ] In some embodiments, the second transform block coded in the intra prediction mode can be transformed according to the secon value, the second pm-defined transform type in the implicit MTS mode, an a coding unit that incl udes the second transfonn Hock being intra sub-partitioning (ISP) coded. The second value is larger than 0.

[0032] Aspects of the disclosure also provide a non -transitory conipuier-readahle medium storing instructions which when executed by a computer for video decoding cause the computer to perform any one or a combinatio of the methods for video decodin

BRIEF DESCRIPTION OF THE DRAWINGS

[0033] Furthe features, the nature, and variou advantages of the disclosed subject matter will be more apparent from the following detailed description and the accompanying drawings in which.

[0034] FIG. 1 is a schematic illustration of a simplified block diagram of a

communication syste (100) in accordance with an embodiment.

[0035] FIG. 2 is a schematic illustration of a simplified Hoc diagram of a

communication system (200) in accordance with an embodiment

[0036] FIG. 3 is a schematic illustration of a simplified block diagram of a decoder in accordance with an embodiment.

[0037] FIG . 4 is a schematic illustration of a sim plified Hock diagram of an encoder in accordance with an embodiment.

(0038J FIG. 5 shows a block diagram of an encoder in accordance with anothe embodiment.

[0039] FIG . 6 shows a block diagram of a decoder in ac cordance with ano t her embodiment

[0040] FIGS, 7A-7D show four exemplary sub-block transfor modes. S

10041 j FIG. 8 shows a first exemplary division of a luma intm-predicted block based on lntra Sub-Partitions (ISP) coding mode.

[0042] FIG . 9 shows a second exemplary division of a luma ira-predicted block based on ISP coding mode.

[0043] FIG. ID shows an example of reduced secondary transform. (RST) using a 16x64 secondary transform core.

[00441 FIG _* 11 shows an example of RST using a 16x48 secondary transform core.

[0045] FIG . 12.4 shows an example of a forward reduced transform,

[0046] FIG. 12B shows an example of an inverse reduced transform

[0047] FIG. 13 A shows a first embodiment of RSTSxS.

[0048| FIG. 13B shows a secon embodiment of RSTSxS.

[0049] FIG . 14 shows a Matrix-based intxa prediction (MIPJ mode.

[0050] FIG . 15 shows 35 infra prediction modes in accordance with an embodiment.

[0051] FIG. 16 shows 95 ultra prediction modes in accordance with an embodiment:.

[0052] FIG. 1 ?A shows a first example of position dependent prediction combination (PDPC) weights in accordance with an embodiment.

[0053] FIG . 17B sho ws a second exampl of PDPC «'ei ghts in accordance with an embodiment.

[0054] FIG. I SA shows a first example of triangle partition based inter prediction.

[0055] FIG. 188 shows a secon example of triangle partition based inter prediction.

[0Q56] FIG. 19 shows flow chart outlining a first process example according to some embodiments of the disclosure,

[0057] FIG. 20 shows a flow chart outlining a second process example accor ing to some embodiments of the disclosure.

[0058] FIG .21 shows a flow chart outlining a third process example according to some embodiments of the disclosure,

[0059] FIG. 22 is schematic illustration of a computer system in accordance with an embodiment.

DETAILED DESCRIPTION OF EMBODIMENTS

[0060] FIG . 1 illustrates a simplified block diagram of a communication system (100) according to aft et»bottt»eftt of tbe preseat disclosure. The co naunication system ( ^" 100) includes a plurality of terminal devices that can communicate with each other, via, for example, a network ( 150). For example, the communication system (100) includes a first pair of terminal devices (110) and (120) interconnected via the network (150), In the FIG. 1 example, the first pair of terminal de vices (110) and (120) performs unidirectional transmission of data. For example* the terminal device (1 10) may code video data (e.g., a stream of video pictures tha are captured by the terminal device (1.10)) for transmission to the other term inal device (120) via the network (150). The encoded video data can he transmitted in the form of one or more code video bitstreams. The terminal device (120) may receive the coded video data from the network (150), decode the coded video data to recover the video pictures aid display video pictures according to the recovered video data. Unidirectional data transmission may be commo in media serving applications and the like.

|0061| In another example, the communication system (100) includes a second pair of terminal de vices ( 130) and ( 140) that performs bidirectional transmissio of coded video data that may occur for example, during videocon ferencing, For bidirec tional transmission of data, i an example, each terminal device of the terminal devices (130) and (140) may code video data (e.g , a stream of video pictures that are captured by the terminal device) for transmission to the other terminal device of the terminal devices (130) and (140) via the network (150). Each terminal device of the terminal devices (130) and (140) also may receive the coded video data transmitted by the other terminal device of the terminal devices (130) and (140), and may decode the coded video data to recover the video pictures and may display video pictures at an accessible display device according to the recovered video data.

|Q062] In the FIG. 1 example, the terminal devices (110), (120), (130) and (140) may be illustrated as Servers, personal computers and smart phones but foe principles of foe present disclosure ma be not so limited. Embodiments of the present disclosure find application with laptop computers, tablet computers, media players and/or dedicated video conferencing equipmen t Tire network (150) represents any number of networks that convey code video data among the terminal devices (110), (120), (130) and (140), including for example wireline (wired) andfor wireless communication networks. The communication network (150) may exchange data in circuit-switched andfor packet-switched channels. Representative networks include teieconimunications networks, local area networks, wide area networks andfor the internet. For foe purposes of the present discussion, the architecture and topology of the network (150) may be immaterial to foe operation of the present disclosure unless explained herein below. (O063| IG. 2 illustrates, as an example for aft application for the disclosed subject matter, the placement of a video encoder and a video decoder in a streaming environment Th disclosed Subject matter can be equally applicable to other video enabled applications, including, for example, video conferencing. digital TV, storing of compressed video on digital media including CD, DVD, memory stick and the like, and so on.

}0O64j A streaming system may include a capture subsystem (213), that can include a video source (201), tor example a digital camera, creating for example stream of video pictures (202) that are uncompressed in an example, the stream of video pictures (202) includes samples that are taken by the digital camera. The stream of video pictures (202), depicted as a bold l ine to emphasize a high data volume when compared to encoded video data (204) (or coded video bitstreams), can he processed by an electronic device (220) that includes a video encoder (203) coup led to the video source (201). The video encode (203) ca include hardware, software, or a combination thereof to enable or implement aspects of the disclosed subject matter as described in more detail below. The encoded video data (204) (or encoded video bitstream (204)), depicted as a thin line to emphasize the lower data volume when compared to the stream of video pictures (202), can he stored on a streaming server (205) tor future use. One or more streaming client subsystems, such as client subsystems (206) and (208) in FIG. 2 can access the streaming server (205) to retrieve copies (207) and (209) of the encode video data (204) A client subsystem (206) can Include a video decoder (210), for example, in an electronic device (230). The video decoder (210) decodes the incoming copy (207) of the encoded video data and creates an outgoing s trea of video pictures (211) that can he rendere o a display (212) (e,g„ display screen) or other rendering device (not depicted). In some streaming systems, the encoded video data (204), (207), and (209) (e.g., video bitstreams) can be encoded according to certain video eoding/compression standards. Examples of those standards include 1TIJ-T Recommendation i?126S in an example, video coding standard under development Is informally known as Versatile Video Coding (V VC). The disclosed subject matter may be used In the context of we.

(006SJ It is noted that the electronic devices (220) and (230) can include other components (not shown). For example, the electronic device (220) can include a video decoder (not show») and the electronic device (230) can include a video encoder (not shown) as well.

[0066} FIG . 3 shows a block diagram of a vi deo decoder (310) according to an embodiment of the present disclosure. The video decoder (310) can he included in an electronic 1 !

device (330). The electronic device (330) can include a r ceiver (331) (e.g., receiving circuitry). The video decoder (310) can he used in the place of the video decoder (210) in th FIG. 2 example.

[0067] The receiver (331) may receive one or more coded video sequences to he decodedby the video decoder (310); in the same Or another embodiment, one coded video sequence at a time, where the decoding of each coded video sequence is independent from other coded video sequences. The coded video sequence _· may be receive from a channel (301), which may he a hardware/software link to a storage device which stores the encoded video data. The receiver (331) may receive the encode video data with other data for example, coded audio data and or ancillary data streams, that may be .forwarded to their respective using enti ties (not depicted).

The receiver (331) may separate the coded video sequence from the other data. To combat network jitter, a buffer memory (315) may be coupled in between the receiver (331) and an entropy decoder / parser (320) ("parser (320)" henceforth) in certain applications, the buffer memory' (315) is part of the video decoder (310), In others, i t can he outside of the video decoder (310) (not depicted). In still others, there can be a buffer memory (not depicted) outside of the video decoder (310), for example to combat network ji tter, and in addition another buffer memory (315) inside the video decoder (310), for example to handle p layout timing. When th receiver (331) is receiving data from a store/forward device of sufficient bandwidth and

controllability, or from an isosyndiroftous network, the buffer memory (315) may not he needed, or can be small For use on best effort packet networks such as the Internet, the buffer memory (315) ma be required, can he comparatively large and can be advantageously of adaptive size, and may at least partially be implemented in an operating system or similar elements (not depleted) outside of the video decoder ( 10).

[0068] The video decoder (310) may include the parser (320) to reconstruct symbols (321) from the coded video sequence. Categories of thos symbols include information used to manage operation of foe video decoder (3 !ø), and potentially information to control a rendering device such as a render de vice (312) (e.g., a display screen) that is not an integral part of the electronic device (330) but can he coupled to the electronic device (330), as was shown in FIG.

3. The control Information for the rendering device(s) may be in the form of Supplemental Enhancement Information (SB! messages) or Video Usability Information (VUI) parameter set fragments (not depicted). The parser (320) may parse / entropy-deeode the code video sequence that is received. The coding of the coded video sequence ca be in accordance with a video coding technology or standard and can follow various principles, including variable lengthcoding, Huffman coding, arithmetic coding with or without context sensitivity, and so forth. The parser (320) may extract from the coded video sequence, a set of subgroup parameters for at least one of the subgroups of pixels in the video dec oder, based upon at least one parameter

corresponding to the group. Subgroups can include Groups of Pictures (GOPs), pictures, tiles, slices, macroblocks. Coding Units (CUs), blocks, Transform Units (Tils), Prediction Units (PUs) and so forth. The parser (320) may also extract front the coded video sequence information such as transform coefficients, quantizer parameter values. _, motion vectors, and so forth.

10069] The parser (320) may perform an entropy decodin / parsing operation on the video sequence received from the buffer memory (315). $o as to create symbols (321),

]00?0] Reconstruction of the symbols (321) can involve multiple different units depending on the type of the coded video picture or parts thereof (such as : inter a d infra picture, inter and intra block), and other factors. Which units are involved, and how, can be controlled by the? subgroup control information that was parsed from the coded video sequence by the parser (320). The flow of such subgroup control information between the parser (320) and the multiple units below is not depicted for clarity

10071] Beyond the .functional blocks already mentioned, the video decoder (310) ca be conceptuall subdivi ded into a number of functional units as describe below. In a practical impiementat.ion operating under commercial constraints, many of these units interact closely with each other and can, at least partly, be integrated into each other. However, for foe purpose of describing the disclosed subject matter, the conceptual subdiv ision into the functional units below is appropriate.

(0072] A first unit is the scaler / inverse transform unit (351), The scaler / inverse transform uni (351) receives a quantized transform coefficient as well as control information, including which transform to use, block size, quantization f ctor, quantization scaling matrices, etc. as symboi(s) (32.1 ) from the parser (320). The scaler / inverse transform unit (351) can output blocks comprising sample values, that can be input into aggregator (355).

(0073] In some cases, the output- samples of the scaler / in verse transfor (351) can pertain to an infra code block; that is: a block that is not using predictive information from previously reconstructe pictures, but can use predictive information fro previously

reconstructed parts of the current picture. Such predicti ve information can be pro vided by an infra picture prediction unit (352). In some oases* the infra picture prediction afrit (352) generates a block of the same size and shape of the block under reconstruction, «sing surrounding already reconstructed information fetched from th current picture buffer (358).

The current picture buffer (358) buffers, for example, partly reconstructed current picture and or felly reconstructed current picture. The aggregator (355), in some cases adds, on a per sample basis, the prediction information the iutra prediction unit (352) has generated to the output sample information as provided by the sealer / inverse transform unit (351).

[0074 _. 1 In other eases, the output samples of the scaler / inverse transform unit (351 ) can pertain to an inter coded, an potentially motion compensated block. In such a ease, a motion compensation prediction unit (353) can access reference picture memory (357) to fetch samples used for prediction. After motion compensating the fetched samples ki accordance with the symbols (321 ) pertaining to the block, these samples can be added by the aggregator (355) to the output of the scaler / inverse trans form uni t (351 ) (in this case called the resi dual samples or residual signal) so as to generate output sample information. The addresses within the reference picture memory (357) from where the motion compensation prediction unit (353) fetche prediction samples can. be controlled by motion vectors, available to the motion compensation prediction unit (353) in the form of symbols (321) that can have, for example X, Y, and reference picture components. Motion compensation also can include interpolation of sample values as fetched from the reference picture emory (357) when sub-sample exact motion vectors are in use, motion vecto prediction mechanisms, and so forth.

[0075) The output samples of the aggregator (355) can be subject to various loop filtering techniques in the loop filter unit (356). Video compression technologies can include in-loop filter technologies that are controlled by parameters include in the coded video sequence ( also referred to as coded video bitstream) and made available to the loop filter unit (356) as symbols (321 ) front the parser (320), but can also be responsi ve to meta-information obtained during the decoding of previous (in decoding order) parts of the coded picture or coded video sequence, as well as responsive to previously reconstructed and loop-filtered sample values.

j 00761 The output of the loop filter unit (356) can be a sample stream that can be output to the render device (31:2) as well as stored in the reference picture memory (357) for use in future inter-picture prediction.

[0077) Certain coded pic totes, once ful ly reconstructed, can be used as reference pictures for i ure prediction. For example, once a coded picture corresponding to a current picture is felly reconstructed and the coded picture has been identifie as a reference picture (by, for example the parser (320)} _* the current pictur buffer (350) can become a part of the reference picture memory (357), and a fresh current picture buffer can be reallocated before commencing the reconstruction off he following coded picture,

(0678) The video decoder (310) may perform decoding operations according to a predetermined video compression technology hi a standard, such as ITU-T Ree.1126$. The coded video sequence may confor to a syntax specified by the video compression technology or standard being used, in the sense that the coded video sequence adheres to both th syntax of the video compression technology or standard and the prof les as documented in the video compression technology or standard. Specifically, a profile can select certain tools as the only tools available for use under that profile from all the tools available in the video compression technology or standard. Also necessary for compliance can he that the complexity of the coded video sequence is wi thin bounds as defined b the level of the video compression technology or standard. In some cases, levels restrict the maximum picture size, maximum frame rate, maximum reconstruction sample rate (measured in, for example megasamples per second), maximum reference picture size, and so on. Limits set by levels can, in some cases, be iurfher restricted through Hypothetical Reference Decoder (HRD) specifications and metadata for HRD buffer management signaled in the coded video sequence.

1007? ⁾ ] In an embodiment, the recei ver (331 ) may recei ve additional (redundant) data with the encoded video. The additional data ma be Included as part of the coded video sequence(s). The additional data may be used by the video decoder (310) to properly decode the data and/or to more accurately reconstruct the original video data. Additional data can be in the form of, for example, temporal, spatial, or signal noise ratio (SNR) enhancement layers, redundant slices, redundant pictures, fo w ard error correction codes, and so on,

| OO80J FIG: 4 shows a block diagram of a video encoder (403) according to an embodiment of the present disclosure. The video encoder (403) is included in a electronic device (420). The electronic device (420) .includes a transmitter (440) (e.g,, transmitting circuitry). The video encoder (403) can be used in the place of the video encoder (203) in the FIG . 2 example.

[OOSi I The video encoder (403) may receive video samples front a video source (401) (that is not part of the electronic device (420) i the FIG, 4- example) that may capture video image(s) to be coded by the video encoder (403): In another example, the video source (401 ) is a part of the elec tronic device (420), [0082] Tile video source (40 ) may provide the source video sequence to be coded by the video encoder (403) in the form of a digital video sample stream that can he of any suitable bit depth (far example; 8 bit, 10 bit 12 bit, , ), any colorspace (for example, BT.601 Y CrCB,

RGB, .), and any suitable sampling structure (for example Y CrCb 4:2:0, Y CrCb 4:4:4). In a media serving system, the video source (401) may be a storage device storing previouslyprepared video in a videoconferencing system, the video source (401) may be a camera that capture local image information as a video sequence, Video data may be provided as a plurality of indi vidual pictures that impart motion when viewe in sequence. The pictures themselves may be organi zed as a spatial arra of pixel s, wherein each pixel can comprise one or more samples depending on the sampling structure, color space, etc. in use. A person skilled in the art can readily understan the relationship between pixels and samples. The description below focuses on samples.

(00831 According to an embodiment, the video encoder (403) may code and compress the pictures of the source video sequence into a coded video sequence (443) i real time or under any other time constraints as required by the application. Enforcing appropriate coding speed Is one function of a controller (450). hi some embodiments, the controller (450) controls other functional units as described below and Is functionally coupled to the other functional units. The coupling is not depicted for clarity. Parameters set by the controller (450) can include rate control related parameters (picture skip, quantizer, lambda value of rate-distortion optimizatio techniques. ...), picture size, group of pictures (GOP) layout, maximum motion vector search range, and so forth . The controller (450) can be configure to have other suitable functions that pertain to the video encoder (403) optimized for a certain system design.

[0084] In some embodiments, d e video encoder (40:3) is configured to operate in a coding loop. As an oversimplified description, in an example, the coding loop can include a source coder (430) (e,g., responsible for creating symbols, such as a symbol stream, based on an input picture to be coded, and a reference picture(s)), and a (local) decoder (433 embedded in the video encoder (403). The decoder (433) reconstructs the symbols to create the sample dat in a similar manner as a (remote) decoder also would create (as any compression between symbols and coded video bitstream is lossless in the video compression technologies considered in the disclosed subject matter). The reconstructed sample stream (sample data) is input to the reference picture memory (434) . As the decoding of a symbol stream leads to bit-exact results independent of decoder location (local or remote), the content in the reference picture memory (434) is also bit exact between the local encoder and remote encoder, In other words, die prediction part of an encoder "sees” as reference picture samples exactly the same sample values as a decode would "see" when using prediction during decoding. This fundamental principle of reference picture synchromcity (and resulting drift, if synchronicify cannot be maintained, for example because of channel errors) is used in some relate arts as well,

|O085| The operation of the "local" decoder (433) can be the same as of a "remote" decoder, such as the video decoder (310), which has already been described in detail above in conjunction with FIG. 3. Briefly referring also to FIG. 3, however, as symbols are available and eneoding/decodiug of symbols to a coded video sequence by an entropy coder (445) and the parser (320) can be l ossless, the en tropy decoding parts of the video decoder (310), including the buffer memory (315), and parser (320) may not be full implemented in the local decoder (433).

|{1086J An observation that can be made at this point is that any decoder technology except the parsing/entropy decoding that is present in a decoder also necessarily needs to he present, in substantially identical inneiional form, in a corresponding encoder. For this reason, the disclosed subj ct matter focuses on decoder operation. The description of encoder technologies can he abbreviated as they are the invers of the comprehensivel described decoder technologies. Only in certain areas a more detail description is required and provided below.

{0087] During operation, in some examples, the source coder (430) may perform motion compensated predictive coding, which codes an input picture predictive!y with reference to one or more previously-coded picture from the video sequence that were designated as "reference pictures”. In this manner, the coding engine (432) codes di fferences between pixel blocks of an inpu t picture and pixel blocks of reference pieiure(s) that may be selected as prediction reference(s) to the Input picture.

f0088i The local video decoder (433) may decode coded video data of pictures that may be designated as reference pktnres, based on symbols created by the source coder (430), Operations of the coding en gin e (432) may ad vantageously be lossy processes. When the coded video data may be decoded at a video decoder (not shown in FIG, 4 ), the reconstructed video sequence typically may be a replica of the source video sequence with so e errors. The local video decoder (433) replicates decoding processes that may be performed by the video decoder on reference pictures and may cause reconstructed reference pictures to be stored in the reference picture cache (434). lit this manner the video encoder (403) may store copies of reconstructed refetfcnte pictures locally that have common content as the reconstructed reference pictures that will be obtained by far-end video decoder (absent transmission errors)

fQe§9] The predictor (435) may perform prediction searches for the coding engine (432). That is, for a new picture to be coded, the predictor (435) may search die reference picturememory (434) for sample data (as candidate reference pixel blocks) or certain metadata such as reference picture motion vectors, block shapes, and so on, that may serve as an appropriate prediction reference for the new pictures _* The predictor (435) may operate on a sample block- by-pixei block basis to find appropriate prediction references. In some cases, as determined by search results obtained by the predictor (435), an input picture may have prediction references drawn from multiple reference pictures Stored in the reference picture memory (434).

f O90| The controller (450) may manage coding operations of the source coder (430), including, for example:, setting of parameters and subgroup parameters used for encoding the video data,

f 091 ] Output of ail aforementioned functional units may be subjected to entropy coding in the entropy coder (445). The entropy coder (445) translates the symbols as generated by the various functional units into a coded video sequence, by lossless compressing the symbol according to technologies such as Huffman coding, variable length coding, arithmetic coding, and so forth.

100923 The transmitter (440) may buffer the coded video sequence(s) as created by the entropy coder (445) to prepare for transmission via a communication channel (460), which may be a hardware/software link to a storage device which would store the encoded video data. The transmitter (440) may merge coded video data from the video coder (403) with other data to be transmitted, for example, coded audio data and/or ancillary data streams (sources not shown).

|O093J The controller (450) may manage operation of the video encoder (403), During coding, the controller (450) may assign to each coded picture a certain coded picture type, which may affect the coding techniques that may be appl ied to the respective picture. For example, pictures often may be assigned as one of the following picture types:

|0094J An Inira Picture (1 picture) may be one that may be coded and decoded without using any other picture in the sequence as a source of predic tion . Some video codecs allow for different types of Infra pictures, including, for example Independent Decoder Refresh (“IDR”) Pictures. A person skill ed in the art is aware of those variants of f pictures and their respective applications and features. 10095] A predictive picture (P picture) m y be one that may he coded and decoded using infra prediction or inter prediction «sing at most one motion vector and reference index to predict the sample values of each block,

[0096] A bi-directionally predictive picture (B Picture) may be one that may he coded an decoded using intra prediction or inter prediction using at most two motion vectors and reference indices to predict the sample values of each block . Similarl y, multiple-predictive pictures can use more _· than two reference pictures and associated metadata for the reconstruction of a single block

[0097] Source pictures commonly may be subdi vided spatially into a plurality of sample blocks (for example, blocks of 4x4, 8x8, 4x8, or 16x16 samples each) and coded on a h!oek-by- block basis. Blocks may be coded predicti vely with reference to other (already coded) blocks as determined by the coding assignment applied to the blocks’ respective pictures. For example, blocks of f pictures may be coded non-predictively or they may be coded predicti vely with reference to alrea dy coded blocks of the same picture (spatial prediction or mftra prediction).

Pixel blocks of P pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one previously coded reference picture Blocks of B picture may be coded predictively, via spatial prediction or via temporal predictio with reference to one or two previousl coded reference pictures

[0098] The video encoder (403) may perform coding operations according to a predetermined video coding technology or standard, such as ITU-T Rec B.265. I its operation, the video encoder (403) may perform various compression operations, including predictive coding operations that exploit temporal and spatial redundancies tit the Input video sequence.

The coded video data, therefore, may conform to a syntax specified by the video coding technology or standard being used

10099) In an embodiment, the transmitter (440) may transmit additional data with the encoded video, Tire source coder (430) may include such data as part of the coded video sequence. Additional data may comprise temporahspatiabSNR enhancement layers, other forms of red undant data such as redundant pictures and slices, SEI messages, VUI parameter set fragmen ts, and so on,

10100) A video may he captured as a plural ity of source pictures (video pictures) in a temporal sequence. Intra-picture prediction (often abbreviated to intra prediction) makes use of spatial correlation in a gi ven picture, and inter-picture prediction makes uses of the (temporal or other) correlation between the pictures. In an example, a specific picture un er

encoding/decoding, which is referred to as a current picture, is partitioned into blocks. When a block in tire current picture is similar to reference block in. a previously coded and still buffered reference picture in the video, the block in the current picture can be coded by a vector that is referred to as a motion vector. The motion vector points to the reference block in the reference picture, and can have a third dimension identifying the reference picture, in case multiple reference pictures are in use.

{0101 j In some embodiments, a bi-predictio technique ca be used in die inter-picture prediction. According to the bi-prediction technique, t o reference pictures, such as a first reference picture and a second reference picture that are both prior in decoding order to the current picture in the video (but may be in the past and future, respecti vely, in display order) are used,. A block in the current picture can be coded by a first motion vector that points to a first reference block in the first reference picture, and a second motion vector that points to a second reference block in the secon reference picture. The block can be predicted by a combination of the first reference block and the second reference block.

|0102| Further, a. merge mode technique can be used in the inter-picture prediction to improve coding efficiency.

(0103] According to some embodiments of the disclosure, predictions, such as inter- picture predictions and intra-picture predicti ons are performed in the unit of blocks. For example, according to the HEVC standard, a picture in a sequence of video pictures i partitioned into coding tree units (CTU) for compression, the CTUs i a picture have the same size, such as 64x64 pixels, 32x32 pixels, or 16 16 pixels in general, a CTU includes three coding nee blocks (CTBs), which ate one luma CTB and two chroma CTBs Each CTU can be recursi vely quadtree split into one or multiple coding units (CUs). For example, a CTU of 64x64 pixels can be split into one CU of 64x64 pixels* or 4 CUs of 32x32 pixels, or 16 CDs of 16x16 pixels. In an example, each CU is analyzed to determine prediction type for the CU, such as an inter predictio type or an infra prediction type. The CU is split into one or more prediction units (PCs) depending on the temporal and/or spatial predictability. Generally, each PU includes a luma prediction bloc (FB), and two chroma PBs. In an embodiment, a prediction operation in coding (encoding/decoding) is performed in the ntiit of a prediction block. Using a luma prediction block as an example of a prediction bloc k, the predi ction block incl udes a matrix of values (e.g., kuna vahtes) for pixels, such as 8x8 pixels, 16x16 pixels, 8x16 pixels, 16x8 pixels, and the like.

f OlIM] FIG, 5 shows a diagram of a video encoder (503) according to another

embodiment of the disclosure. The video encoder (503) is configured to receive a processing block (e g , a predictio block) of sample values within a current video picture in a sequence of video pictures, and encode the processing block into a code picture that is part of a coded video sequence. I an example, the video encoder (503) is use i the place of the video encoder (203) in the FIG, 2 example.

10105) In an HEVC example, die video encoder (503) receives a matrix of sample values tor a processing block, such as a prediction block of 8x8 samples, and the like. The video encoder (503) determines whether the processing block is best coded using intra mode, inter inode, or bi-prediction mode using, for example, rate-distortion optimisation. When the processing block is to be coded in intra mode, the video encoder (503) may use an intra prediction technique to encode the processing block into the coded picture; and when the processing block is to be coded in inter mode or bi-prediction mode, the video encoder (503) may use an inter prediction or bi-prediction technique, respectively, to encode the processing block into the coded picture. I certain video coding technologies, merge mode can be an inter picture prediction submode where th motion vector is derive fro one or more motion vector predictors without the benefit of a coded motion vector component outside the predictors. In certain other video coding technologies, a motion vector component applicable to the subject block may be present in an example, the video encoder (503) includes other components, such as a mode decision module (not shown) to determine tire mode ofthe processing blocks.

f 0i06] In the FIG. 5 example, the video encoder (503) includes the inter encoder (530), an intra encode (522), residue calculator (523), switch (526), a residue encoder (524), a general controller (521 ), and an entropy encoder (525) coupled together as shown in FIG. S,

|0107| The inter encoder (530) is configured to receive the samples of the current block (e.g. _s a processing block), compare the block to one or more reference blocks in reference pictures (e.g,, blocks in previous pictures and later pictures), generate inter prediction

information (e.g., descriptio of redundant information according to inter encoding technique, motion vectors, merge mode information), and calculate inter prediction results (e.g _* , predicted block) based on the inter prediction information using any suitable technique. In some examples, the reference pictures are decoded reference pictures that are decoded based on the encoded video information.

fOiOSJ The intra encoder (522) is configured to receive the samples of the current block (e.g., a processing block), in some cases compare the block to blocks already coded in the same picture, generate quantized coefficients after transform, and in some cases also intra prediction information (e.g., an intra prediction direction informatio according to one or more intra encoding techniques). In an example, the intra encoder (522) also calculates intra prediction results (e.g., predicted block) based on the intra prediction information and reference blocks i the same picture.

|¾109j The general controller (521) is configured to determine general control data andcontrol other components of the video encoder (503) based on the general control data. In an example, the general controller (521) determines the mode of the block, and provides a control signal to the switch (526) based on th mode. For example, when die mode is the intra mode, the general controller (521) controls the switch (526) to select the intra mode result for use by the residue calculator (523), and controls the entropy encoder (525) to select the intra prediction information and include the intra prediction informatio in the bitstream; and when the mode is the inter mode, the general controller (521) controls the switch (526) to select the inter prediction result for use by the residue calculator (523), and controls the entropy encoder (525) to select the inter prediction information and include the inter prediction information in the bitstream

[0110] The residue calculator (523) is configured to calculate a difference (residue data) between the received block and prediction results selected from the intra encoder (522) or the inter encoder (530). The residue encoder (524) is configured to operate based on the residue data to encode the residue data to generate the transfor coefficients, In an example, the residue encoder (524) is configured to convert the residue data from a spatial domain to a frequency domain, and generate the transfor coefficients, The transfor coefficients are then subject to quantization processing to obtain quantized transform coefficients. In various embodiments _* the video encoder (503) also includes a residue decoder (528). The residu decoder (528) is configured to perform inverse-transform, and generate the decoded residue data. The decoded residue data can be suitably used by the intra encoder (522) and the inter encoder (530). For example, the inter encoder (530) can generate decoded blocks base on the decoded residue data and inter prediction information, and the intra encoder (522) can generate decoded blocks based On the decoded residue data and the intra prediction information. The decoded blocks are suitabl processed to generate decoded pictures and the decoded pictures can be buffere in a memory circuit (not show) and used as reference pictures in some examples

(0111] The entropy encoder (525) is configured to format the bitstream to include the encoded block. The entropy encoder (525) is configured to include various information according to a suitable standard, such as the TIEVC standard. In an example, the entropy encoder (525) is configured to include the general control data, the selected prediction

information (e,g„ intra prediction information or inter prediction information), the residue information, and other suitable information in the bitstream. Note that,, according to the disclosed subject matter, when coding a block in the merge submode of either inter mode or bi- prediction mode, there is no residue information,

(01i2j FIG. 6 shows a diagram of a video decoder (610) according to another

embodiment of the disclosure. The video decoder (610) is configure to recei ve coded pictures that are part of a coded video sequence, and decode the coded pictures to generate reconstructed pictures in an example, the video decoder (610) is used in the place of the video decoder (210) in the FIG 2 example.

(8113] I the FIG, 6 example, the video decoder (610) includes an entropy decoder (671 ), an inter decoder (680), a residue decoder (673), a reconstruction module (674), and an intra decoder (672) couple together as shown in FIG. 6.

1011 The entropy decoder (671) can be confi gured to reconstruct, from the coded picture, certain symbols that represent the syntax elements of which the coded picture is made up. Such symbols can include, fo example, the mode in which block is coded (such as, for example, intra mode, inter mode, bi-predleted inode, the latter two in merge submode or another submode), prediction informatio (such as, for example, intra prediction information or inter prediction information) that can identify certain sample or metadata that is used for prediction b the intra decoder (672) or the inter decoder (680)* respectively, residual information. In the form of for example, quantized transform coefficients* and the like. In an example, when the prediction mode is inter or hi-predieted mode, die inter prediction information is provided to the inter decoder (680); and when the prediction type is the intra prediction type, the intra prediction information is provided to the intra decoder (672). The residual information can be subject to inverse quantization and is provided to the residue decoder (673).

(0115] The inter decoder (680) is configured to receive the inter prediction information, and generate inter prediction results based on the inter prediction information. 101 tb| The intra decoder (672) is configured to receive the ultra prediction information, and generate prediction results based on the infra prediction information.

f 0117] The residue decoder (673) is configured to perform inverse quantization to extract de-quantized transform coefficients, and process the de-quantized transform coefficients to convert the residual from the frequency domain to the spatial domain. The residue decoder (673) may also require certain control information (to include the Quantizer Parameter (QP)), and that information tnay he provided by the entropy decoder (671) (data path not depicted as this may he low volume control information only)

J0118) The reconstruction module (674) is configured to combine, in the spatial domain, the residual as output by the residue decoder (673) an the prediction results (as Output by the inter or infra prediction modules as the case may be) to form a reconstructed block, that may be part of the reconstructed picture , which in turn may be part of the recon structed video it is noted that other suitable operations, such as a deblocking operation and the like, can be performed to improve the visual quality.

ji1I9| it is noted that the video encoders (203), (403), and (503), and the video decoders (210), (310), and (610) can be implemented using any suitable technique. In an embodiment, the video encoders (203), (403), and (503), and the video decoders (210), (3.10), and (6 ! 0) can be implemented using on or more integrated circuits. In another embodiment, the video encoders (203), (403), and (403), and the video decoders (210), (310), and (610) can be implemented using one or more processors that execute software instructions.

[0120] Primary' transforms, such as in HEYC, can include 4-point, 8-point, lb-point, and 32-poinf type~2 discrete cosine transform 2), and the transform core matrices can be represented using 8-bit integers, i.e,, 8-bit transform core. The transform core matrices of smaller OCT-2 transforms can be part of larger DCT-2, transforms as sho wn be low.

4x4 transform

{64, 64, 64, 64}

|83, 36,-36,-83}

{ 64, -64, -64, 64}

{36, - 83, 33,-36}

8x8 transform

i 64, 64, «4, 64 , 64, 64, 64, 64}

(89, 75, 50, 18, -35, -SO, -75, -S 9 }

{33, 36,-36,-83,-33,-36, 36, 83}

{75,-18,-89,-50, 50, 89, 18,-75}

{64,-64,-64, 64, 64,-64,-64, 64}

{50,-89, 18, 75,-75,-18, 89,-50}

{36,-83, 83,-36,-36, 83,-83, 36}

{18,-50, 75,-89, 89,-75, 50,-18} 16x16 transform

fOJJl] The DCT-2 cores show syimnetry/anti-synimeiry characteristics. Thus _» a so- called“partial buterfly” HBpIemeotation is supported to reduce the number of operation counts (e g multiplications, adds/suhs, shifts), and identical results of matrix multiplication cars be obtained using partial buterfly.

|0 T22] Two sub-block transforms can be provided, such as I WC. 2V first sub-block transform is SVT or SET. For example, in IVET-J0024, J¥ET-Ki)i39, and IVET-L035B, a spatially varying transform! (SVT) scheme is proposed. With SY1\ for inter prediction residuals, there may be only a residual block in the coding block. Since the residual block is smaller than the coding block, the transform size in SVT is Smaller than die coding block si m. For the region which is not covered by the residual block or transform, zero residual may be assumed

[0123] SVT can also be called Sub-block Transform (SBT) such as in JVET-L03S8 Examples of the sub-block types (e.g., SVT-H, SVT-V), sizes, an positions (e.g., left half, left quarter, right half, right quarter, top half top quarter, bottom half, bottom quarter) supported in SBT are shown in FIGS. 7A-7D. FIBS. 7A-7D illustrate the sub-block types (SVT-B, SVT-V), and the positions (left half, right half, top half, bottom half) supported in SBT respectively. The shaded region labeled by the letter“A” is a residual block with transform, an the other region is assume to be zero residual without transform.

[0124] A second sub-block transform is Ini Sub-Partitions (ISP). The ISP coding mode divides luma intra-predieted blocks vertically or horizontally into 2 or 4 sub-partitions depending on the block size dimensions, as show Jn Table 1. FIG 8 and FIG. 9 show examples of the two possibilities FIG. 8 illustrates a exemplary division of a 4x8 block or an 8x4 block FIG. 9 i llustrates a exem plary division of a block t hat is not one of a 4x8 block, an 8x4 block, or a 4x4 block. All sub-partitions can fulfill the condition of having at least 16 samples. For chrom components. ISP is not applied.

Table T: Number of sub-partitions depending on the block size

[0125] in some embodiments , for each of these sub-partitions, a residual signal can be generated by entropy decoding the coefficients sent by foe encoder and then inverse quantizing and inverse transforming the coefficients. Then, the sub-partition is iutra predicted, and finally, the corresponding reconstructed samples are obtained by adding the residual signal to the prediction signal Therefore, the reconstructed values of each sub-partition can be available to generate the prediction of the next one, which can repeat the process an so on. All subpartitions can share the same infra mode

[0126] In some embodiments, the ISP algorithm will only he tested with intra modes that are part of the MPM list. For this reason, if a block uses ISP, then the MPM flag can be inferred to be one _* If ISP is used for a certain block then the MPM list can be modified to exclude the DC mode and to prioritize horizontal intra modes for the ISP horizontal split and vertical intra modes for the vertical one.

f0127] In ISP, each sub-partition can be regarded as a sub-TU, since the transform andreconstruction is performed individually for each sub-partition.

|012S| Besides 4-point, 8-point, 16-point and 32-point DCT-2 transforms such as in HEVC, additional 2-point and 64-point DCT-2 can also be included as primary ransforms, such as in. WC. The 64-point DO ^' -2 core defined in VVC can be shown belo as a 64x64 matrix;

I

{ aa, aa, aa, aa, aa. aa, aa, aa, aa. aa, aa, aa, aa. aa, aa, aa, aa, aa, aa, aa, aa, aa. aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa, aa }

{ bf, bg, bh, bi, bj, bk, bf bm, bn, bo, bp, bq, br, bs, bt, bu, bv, bw, bx, by, bz, ca, cb, cc, cd, ce, cf eg, ch, cf cj, ok, -ok, -eg -eg -ch, -eg, -of, -ce, -ed, -ce, _. -eb, -ca, -b , -by, - bx, -bw, -bv, -bu, -bt, -bs, -br, -bq, -bp, -bo, -bn, -bm.. _“ bi, -bk, -bj, -hi,

-bh, -bg, -bf )

{ ap, aq, ar, as, at, an, av, aw, ax, ay, az, ba, bb, be, bd, be, -be, -bd, -be, -bb, -ba, -az, - ay, -ax, -aw, -av, -an, -at, -as, -ar,

-aq, -ap, -ap, -aq, -ar, -as, -at, -an, -av, -aw, -ax, -ay, -az, -ba, -bb, -be, -bd, -be, be, bd, be, bb, ba, az, ay, ax, aw, av, au, at, as, ar, aq, a }

{ bg, bj, bm, bp, bs, bv, by, cb, ce, ch, ck, -ci, -of, -ce, -b¾, -bw, -bt, -bq, -bn, -bk, -bh, -bf,

-bi, -bl, -bo, -br, -bu, -bx, -ca, -cd,

-eg, -cj, cj, eg, cd, ca, bx, bu, br, bo, bi, bi, bf, bb, bk, bn, bq, bt, bw, bz, ce, cf ci, - ck, -ch, -ce, -cb, -by, -bv, -bs, -bp, -b , -bj, -bg }

{ ah, af aj, ak, al am, an, ao, ~ao, -an, -ant, -al, -ak, -aj, -ai, -ah, -ah, -ai, -aj, -ak, -al, -am, - an, -ao, ao, an, am, al, ak, aj, ai, ah, ab, at, aj, ak, al, am, an, ao, -ao, -an, -am, -al, -ak, - aj, -al, -ah, -ah, -ai, -aj, -ak, -al, -am, -an, -ao, ao, an, am, al, ak, aj, ai, ah }

( bh, bm, br, bw, cb, eg, -ck, -cf, -ca, -bv, -bq, -hi, -bg, -bi, -bn, -bs, -bx, -cc, -ch, cj, ce, bz, bu, bp, bk, bf, bj, bo, bf by, cd, ci, -ci, -cd, -by, -bf -bo, -bj, -bf -bk, -bp, -bu, -bz, -ce, -cj, ch, ec, bx, bs, bn, bi, bg, bl, bq, bv, ca, cf ck, -eg, -cb, -bw,

-br, -b , -bh }

( aq, at aw, az, be, -be _* -bb, -ay, -av, -as, -ap, -ar, -au, -ax, -ba, -bd, bd, ba, ax, an, ar, ap, as, av, ay, bb, be, -be, -az, -aw,

-at, -aq, -aq, -at, -aw, -az, -be, be, bb, ay, av, as, ap, ar, au, ax, ba, bd, -bd, -ba, -ax, -au, - ar, -ap, -as, -av, -ay, -bb, -be, be, az, aw, at, aq }

{ i, bp, bw, cd, ck, -ce, -bx, -bq, -bj, -bh, -bo, -bv, -cc, -cj, cf, by, br, bk, bg, bn, bu, cb, ci, -eg, -bz, -bs, -bl, -bf, -bm, -bt, -ca, -ch, eh, ca, bf b , bf, bl, bs, bz, eg, -ci, -cb, -bu, - bn, -bg, -bk, -br, -by, -cf, cf, cc, bv, bo, bh, bj, bq, bx, ce, -ck, -od, -bw, -bp, -bi }

{ ad, ae, af, ag, -ag, -af -ae, -ad, -ad, -ae, -af -ag, ag, af ae, ad, ad, ae, af, ag, -ag, -af - ae, -ad, -ad, -ae, -af -ag, ag, af ae, ad, ad, ae, af ag, -ag, -af, -ae, -ad, -ad, -ae, -af, -ag, ag, af ae, ad, ad, ae, af ag, -ag, -af -ae, -ad, -ad, -ae, -af -ag, ag, af ae, ad }

{ bj, bs, cb, ck, -cc, -bg -bk, -bi, -br, -ca, -cj, cd, bn, bl, bh, bq, bz, ci, -ce, -bv, -bm, -bg, - bp, -by, -ch, cf bw, bn, bf bo, bx, eg, -eg, -bx, -bo, -bf -bn, -bw, -ef, ch, by, bp, bg, bm, bv, ee, -ci, -bz, -bq, -bh, -bi -bn, _“C d, cj, ca, br, bi, bk, bt, cc, k, -ch, -bs, -hj } ( ar, aw, bb, -bd, -ay, -at, -ap, -an, -az, -be, ba, av, aq, as, ax, be, -be, -ax, -as, -aq, -av, -ba, be, ax, m, ap, at, ay, bd, -bb, -aw, -ar, -ar, -aw, ~bb, bd, ay, at, ap, »«, ax, be, -ba, -av, - aq, -as, -ax, -be, be, ax, as, aq, av, ba, -be, -ax, -an, -ap, -at, -ay, -bd, bb, aw, ar }

{ bk, bv, eg, -ee, -bl, -hi, -bm, -bx, -ci, ee, br, bg, bo, bx, ck, -ea, -bp, -bl -bq, -cb, ej, by, bn, bb, bs, ed, -ch, -bw, -bl, -bj, -bu, -cf, cl bn, bj, bl, bw, cb, -cd, hs, -bb, -bn, -by, -cj, cb, bq, bf, bp, ea, -ck, -bz, -bo, -bg, -br, -ce, cl, bx, bra, bl, bt, ce, -eg, -bv, -bk }

( al at, ao, -am, -aj, -ah, -ak, -an, an, ak, ah, aj, ni, -ao, -al, -ai, -at, -al, -ao, am, aj, air, ak, an, -an, -ak, -ah, -aj, -anr, ao, al, ai, ai, al, ao, - i», -aj, -ab, -ak, -an, an, ak, ab, aj, am, -ao, -al -ai, -ai, -al, -ao, am, aj, ah, ak, an, -an, -ak, -ah, -aj, -am, ao, al, al }

{ l, by, -ck, -bx, -bk, -bm, -bx, ej, bw, bj, bn, ea, -ci, -bv, -bl, -bo, -cb, cb, bn, bb, bp, ce, -eg, -bt, -bg, -bq, -ed, cl bs, bf, br, ee, -ce, -br, -hi -bs, -el cd, bq, bg, bp eg, -ce, -bp, -bb, -bu, -eb, cb, bo, bi, bv, cl, -ea, -bn, -bj, -bw, -cj, bz, bin, bk, bx, ck, -by, -bl }

{ as, ax, -bd, -aw, -ap, -av, -be, ba, at, ar, ay, -be, -ax, -aq, -an, -bb, bb, an, aq, ax, be, -ay, -ar, -at, -ba, he, av, ap, aw, bd, -ax, -as, -as, ~az, bd, aw, ap, av, be, -ba, -at, -ar, -ay, be, ax, aq, an, bb, -bb, -ao, -aq, -ax, -be, a , ar, ai, ba, -be, -av, -ap, -aw, -bd, ax, as }

f btn, eb, -cl -bq, -bi, -bx, cj, bn, bl bt, ci, -by, -bj, -bp, -ee, ce, bn, bi, ca, -eg, -br, -bit, - bw, ck, bv, bg, bs, eb, -bx, -bk, -bo, -ed, ed, bo, bk, bz, -eb, -bs, -bg, -bv, -ck, bw, bb, br, eg, -ca, -bl, -bn, -cc, ee, bp, bj, by, -ci, -bt, -hi -bu, -cj, bx, bi, bq, cf, -cb, -bm }

{ ab, ac, -ae -ab, -ab, -ac, ae, ab, ab, ac, -ac, -ab, -ab, -ac, ac, ab, ab, ac, -ac, -ab, -ab, -ac, ac, ab, a ac, -ac, -ab, -ab, -ac, ac, ab, ab, ae, -ac, -ab, -ab, -ac, ac, ab, ab, ac, -ac, -ab, -ab, -ac, ae, ab, ab, ac, -ac, -ab, -ab, -ac, ac, ab, ab, ac, -ac, -ab, -ab, -ac, ae, ab }

{ bn, ce, -ca, -bj, -br, -ci, bw, b bv, -ej, -bs, -bi, -bz, cf, bo, bm, cd, -cb, -bk, -bq, -ch, bx, bg, bn, -ck, -bt, -bb, -by, eg, bp, bl, cc, -ce, -bl, -bp, -eg, by, bh, bt, ck, -bn, -bg, -bx, cb, bq, bk, cb, -cd, -bm, -bo, -cf, bx, bi, bs, cj, -bv, -bf, -bw, ci, br, bj, ca, -ce, -bn {

{ at, be, -ay, -ap, -ax, bd, ao, as, bb, -ax, -aq, -aw, be, av, ar, ha, ~ha, -at, -av, -be, aw, aq, ax, -bb, -as, -an, -bd, ax, ap, ay, -be, -at, -at, -be, ay, ap, ax, -bd, -an, -as, -bb, az, aq, aw* - be, -av, -ar, -ba, ba, ar, av, be, -aw, -aq, -az, bb, as, an, bd, -ax, -ap, -ay, be, at }

( bo, ch, -bv, -bb, -ca, cc, bj, bt, -cj, -bq, -bin, -cl l>x„ bf, by, -ce, -bl, -br, -ck, bs, bk, cd, - bz, -bg, -bw, eg, bn, bp, cl, -bn, -bi, -cb, cb, bi, bu, -ci, -bp, -bn, -eg, bw, bg, bx, -cd, -bk, -bs, ck, br, bl, ce, -by, -bl -bx, el bm, bq, cj, -bt, -bj, -ee, ca, bb, bv, -cb, -bo }

{ aj, ao, -ak, -ai, -an, al, ah, am, -am, -ab, -al, an, ai, ak, -ao, -aj, -aj, -ao, ak, ai, an, -al, ~ ah, -am, am, ah, al, -an, -ai, -ak, ao, aj, aj, ao, -ak, -ai, -an, al, ah, am, -am, -ah, -al, an, ai, ak, -ao, -aj, -aj, -ao, ak, ai, an, -al, -ah, -am, am, ab, al, -an, -ai, -ak, ao, aj }

{ bp, ck, -bq, -bo, -cj, br, bn, ci, -bs, -bm, -cb, bt, bl, eg, -bn, -bk, -cf bv, bj, ce, -bw, -bi, - ed, bx, bb, cc, -by, -bg, -cb, bz, bf, ca, -ca, -bl -bx, cb, bg, by, -cc, -bb, -bx, ed, bi, bw, - ce, -bj, -bv, cf, bk, bu, -eg, -bf, -bt, cb, bin, bs, -ci, -bn, -br, cj, bo, bq, -ck, -bp }

{ an, -be, -at, -av, bd, as, aw, -be, -ar, -ax, bb, aq, ay, -ba, -ap, -ax, ax, ap, ba, -ay, -aq, -bb, ax, ar, be, -aw, -as, -bd, av, at, be, -an, -an, be, at, av, -bd, -as, -aw, be, ar, ax, -bb, -aq, -ay, ba, ap, az, -az, -ap, -ba, ay, aq, bb, -ax, -ar, -be, aw, as, bd, -av, -at, -be, an }

{ bq, -ci, -bl, -bv, ed, bg, ca, -by, -bi, -cf, bt, bn, ck, -bo, -bs, eg, bj, bx, -cb, -bf, -cc, bw, bk, cb, -br, -bp, cj, bm, bn, -ce, -bh, -bx, bx, bh, ce, -bn, -bm, -cj, bp, br, -ch, -bk, -bw, ce, bl cb, -bx, -bj, -eg, bs, bo, -ck, -ba, -bt, cl bi, by, -ca, -bg, -cd, bv, bl, ci, -bq }

{ ae, -ag, -ad, -ai af, ad, ag, -ae, -ae, ag, ad, af, -af, -ad, -ag, ae, ae, -ag, -ad, -al af, ad, ag, -ae, -ae, ag, ad, af -af -ad, -ag, ae, ae, -ag, -ad, -a af ad, ag, -ae, -ae, ag, ad, af -al

-ad, -ag, ae, ae, -ag, -ad, -al al ad, ag, -ae, -ae, ag, ad, al -a -ad, -ag, ae }

{ br, -cl -bg, -cc, bu, bo, -ci, -bj, -bz, bx, bl, ck, -bm, -bw, ca, bl, ch, -bp, -bi cd, bf ce, - bs, -bq, eg, bh, cb, -bv, -bn, ej, bk, by, -by, -bk, -cj, bn, bv, -eb, -bh, -eg, bq, bs, -ce, -bf - ed, bt, bp, -ch, -hi, -ca, bw, bm, -ck, -bl, -bx, bz, bj, ci, -bo, -bu, cc, bg, cl -br } { av, -bb, ~ap _s -be, am, aw; -ha, -aq, -bd, at, ax, -ax, -ar, -be, as, ay, -ay, -as, be, ax, £z, -ax, -at, bd aq, ba, -aw, -a«, be, ap, bb, -av, -av; bb, ap, be, -an, -aw, ba, aq, bd, -at, -ax, az, ar, be, -as, -ay, ay, as, -be, -ar, -az, ax, at, -bd. -aq, -ba, aw, an, -be, -ap, -bb, av }

{ bs, -cc, -bf -cf bl, bz, -bv, -bp, ef, bf eg, -bo, -bw, by, bm, -ef -bh, -ed, hr, bg ~eb, -hi ck, bk, ea, -bn, -bq, ce, bg, eh, -bn, -bx, bx, bn, -ch, -bg, -ce, bq, bit, -ca, -bk, ck, bj, cb, - bt, -br, cd, bh, ef -bm, -by, bm; bo, -eg, -bf, -ef bp, bv, -bz, -bl, ej, bf cc, -bs }

{ ak, -ami, -af ao, ah, an, -a], -af at, aj, -an, -ah, -ao, ai, am, -ak, -ak, am, af -ap, -ah, -an, aj, af -ai, -aj, an, ah, ao, -ai, -am, ak, ak, -am, -at, ao, ah, an, -aj, -al, al, af -an, -ah, -ao, ai, am, -ak, -ak, am, as, -ao, -air, -an, aj, al, -al, -aj, an, ah, ao, -ai, -ant, ak }

{ t, -bx, -bn, cf bit, ok, -bi, -ee, bo, by, -bn, -bs, ea, b , -eg, -bg, ~cj, bj, ed, -bp, -bx, bv, br, -cb, -bl, cb, bf, ei, -bk, -ce, bq, bw, -bw, -bq, ee, bk, -ei, -bf, -eh, bl, cb, -br, -bv, bx, bp, -ed, -bj, cj, bg, eg, -bm, -ea, bs, bn, -by, -bo, ce, bi, -ck, -bh, -ef, bn, bz, -bt }

{ aw, -ay, -an, ba, as, -be, -aq, be, ap, bd, -ar, -bb, at, az, -av, -ax, ax, av, -az, -at, bb, ar, - bd, -ap, -be, aq, be, -as, -ba, an, ay, -aw, -aw, ay, aa, -ha, -as, be, aq, -be, -ap, -bd, ar, bb, - at, -az, av, ax, -ax, -av, az, at, -bb, -ar, bd, ap, be, -aq, -bo, as, ba, -an, -ay, aw }

{ bu, -bw, -bs, by, bq, -ea, -bo, cc, bm, -ce, -bk, eg, hi, -cf -bg, ck, bf, cj, -bb, -eb, bj, cf, -bl, -ed, bn, cb, -bp, -bz, br, bx, -bt, -bv, bv, bt, -bx, -br, bz, bp, -eb, -bn, cd, bl, -ef, -bj, eh, bh, -cj, -bf ~ek, bg, ei, -bi, -eg, bk, ee, -bm, ~eo, bo, ea, -bq, -by, bs, bw, -bn }

{ aa, -aa, -aa, aa, aa, -aa, -aa, aa, aa, -aa, -aa, aa, aa, -aa, -aa, aa, aa, -aa, -aa, aa, aa, -aa, - aa, aa, aa, -aa, -aa, aa, aa, -aa, -aa, aa, aa, -aa, -aa, aa, aa, -aa, -aa, aa, aa, -aa, -aa, aa, aa, -aa, -aa, aa, aa, -aa, -aa, aa, aa, -aa, -aa, aa, aa, -aa, -aa, aa, aa, -aa, -aa, a }

{ bv, -bt, -bx, hr, bz, -bp, -eb, bn, cd, -bl, -cf, bj, eh, -bh, -cj, bf, -ck, -bg, ei, bi, -eg, -bk, ce, bm, -cc, -bo, ea, bq, -by, -bs, bw, ba, -bu, -bw, bs, by, -bq, -ea, bo, cc, -bm, -ce, bk, eg, -bi, -ei, bg, ck, -bf ej, bb, -eb, -bj, cf, bf -cd, -bm, eb, bp, -bz, -bx, bx, bt, -bv }

{ ax, -av, -az, at, bb, -ar, -bd, ap, -be, -aq, be, as, ~ba, -au, ay; aw, -aw, -ay, an, ba, -as, -be, aq, bcy -ap, bd, ar, -bb, -at az, av, -ax, -ax, av, az, -at -bb, ar, bd, -ap, be, aq, -be, -as, ba, am, -ay, -aw, aw, ay, -am, -ba, as, be, -aq, -be, ap, -bd, -ar, bb, at, -az, -av ax }

{ bw, -bq, -cc, bk, cl, -bl; ch, bl, -eb, -br, bv, bx, -bp, -ed, bj, ej, -bg, eg, bm, -ca, -bs, bu, by, -bo, -ee, bi, ck, -bb, cf, bm, -bz, -bt, bt, bz, -bn, -cf, bh, -ck, -bi, ce, bo, -by, -bn, bs, ea, -bm, -eg, bg, -ej, -bj, cd, bp, -bx, -bv, br, cb, -bl, -ch, bf, -ci, -bk, ce, bq, -bw }

{ ai, -aj, -an, ah, -ao, -ai am, ak, -ak, -am, ai, ao, -ah, an, aj, -al, -al, aj, an, -ah, ao, ai, - am, -ak, ak, am, -ai, -ao, ah, -an, -aj, al, al, -aj, -an, ah, -ao, -ai, am, ak, -ak, -am, ai, ao, - ah, an, aj, -al, -al, aj, an, -ah, ao, ai, -am, -ak, ak, am, -ai, -ao, ah, -an, -aj, al }

{ bx, -bn, -ch, bg, -ce, -bq, bn, ea, -bk, -ck, bj, -eb, -bt, br, cd, -bh, of bm, -by, -bw, bo, eg, -bf, cl bp, -bv, -bz, bl, cj, -bi, ec, bs, -bs, -cc, bi, -ej, -bi, bz, bv, -bp, -cf, bf -eg, -bo, bw, by, -bm, -ci, bh, -cd, -br, bt, eb, -bj, ek, bk, -ea, -bu, bq, ee, -bg, ch, bn, -bx }

f ay, -as, -be, ar, -az, -ax, at, bd, -aq, ba, aw, -an, -be, ap, -bb, -av, av, bb, -ap, be, an, -aw, -ba, aq, -bd, -at, ax, az, -ar, be, as, -ay, -ay, as, be, -ar, az, ax, -at, -bd, aq, -ba, -aw; an, be, -ap, bb, ay, -av, -bb, ap, -be, -an, aw, ba, -aq, bd, at, -ax, -az, ar, -be, -as, ay }

{ y, -bk, cj, bn, -bv, -cb, bh, -eg, -bq, bs, ce, -bf ed, bt, -bp, -ch, hi, -ca, -bw, bm, ck, -bl, bx, bz, -bj, ei, bo, -bu, -cc, bg, -cf, -br, br, ef, -bg, cc, bu, -bo, -ci, bj, -bz, -bx, bl, -ek, - bm, bw, ea, -bi, cb, bp, -bt, -cd, bf, -ce, -bs, bq, eg, -bh, cb, bv, -bn, -cj, bk, -by }

f af -ad, ag, ae, -ae, -ag, ad, -af -ai ad, -ag, -ae, ae, ag, -ad, af af -ad, ag, ae, -ae, -ag, ad, -af -af, ad, -ag, -ae, ae, ag, -ad, af af -ad, ag, ae, -ae, -ag, ad, -af -af ad, -ag, -ae, ae, ag, -ad, af a -ad, ag, ae, ~ae, -ag, ad, -af -af ad, -ag, -ae, ae, ag, ~ad, af }

f bz, -bh, ee, bm, -bm, ej, bp, -br, -cb, bk, -bw, -ce, b -cb, -bx, bj, -eg, -bs, bo, ek, -bm, bf cf -bf by, ca, -bg, cd, bv, -bl, ei bq, -bq, -cf bl, -bv, -cd, bg, -ca, -by, bi, -cf -bt, bn, -ck, - bo, bs, eg, -bj, bx, cb, -bf, ce, bw, -bk, cb, br, -bp, -ej, bm, -bm, -ce, bh, -bz } W

{ ax, -ap, ha, ay, -tq, bb, ax. -at, he, aw, -as., hd, av; -af be, an, -au, -be, at, ~av, -bd, as, - aw, -be, at, -ax, -bb, aq* -ay* ~ba, ap, -ax, -ax, ap _* -ba* -ay, aq, ~bb, -ax, at, -be, -aw, as, -hd, - av, at, -be, -au, au, be, -at, av, bd, -as, aw, be, -at, ax, bb, -aq, ay, ba, -ap, ax }

{ ea, ~h£ bz, eb, -bg, by, ee _* -bb, bx, cd _* -hi _* bw, ce, -bj, bv, cf -bk, bu, eg, -b!, bt, elf - brn, bs, cf -bu, hr, ej, -bo, bq, ck, -bp, bp, -ek, -bq, bo, -cj, -br, bn, -ci, -bs _* bm, -ch, -bt, bl, -eg, -bu, bk, -cf, -bv, bj, -ee, -bw, bf -cd, -bx, bb, -ee, -by, bg, -eb, -bz, bf, -e }

j am, -aii, af an, -af ak, ao, -aj _* af -ao, -ak, af -an, -al, ah, -am, -am, ah, -af -an _* af -ak, - ao, aj, -aj _* ao, ak, -a£ an, ai, -ah, am, am, -ah, al, an, -af ak, ao, -aj, aj, -ao, -ak, af -an, - ai, ah, -am, -am, ah, -al, -an, ai, -ak, -ao, aj, -aj, ao, ak, -ai, an, al, -ah, am }

{ eb, -bi, bu, ci, -bp, bn, -eg, -bw, bg, -bx, -cd, bk, -bs, -ck, bf, -bi, ee, by, -hf bx, cf -bra, bq, -cj, -bt, bj, ~ce _* -ea, bb, -hv _* -ch, bo, -bo, ch, bv, -bb, ca, cc, -bj, bt, cj, bm, -cf ~ hx, h -by, -ce, bl, ~br, ck, bs, -bk, cd, bx, -bg, bw, eg, -bn, bp, -ci, -bu, bi, -ch }

{ ba, -at, av, -be, -aw, aq, -ax, -bb, as, -an, bd, ax, -ap, ay, be, -at, at, -be, -ay, ap, -ax, -bd, au, -as, bb, az, -aq, aw, be, -av, ar _* -ba, -ba, ar, -ay, be, aw, -aq, az, bb, -as, au, -bd, -ax, ap, -ay, -be, at, -at, be, ay, -ap, ax, hd, -au, a , -bb, -ax, aq, -aw, -be, av, -ar, ha )

{ cc, -bi, bp, -eg, -by, bb, -bt, ek _* bu, -bg, bx, ch, -bq, bk, -cb, -cd, bra, -bo, cf, bx, -bi, bs, -cj, -bv, bf -bw, -ci, hr, -bj, ca, ce, -bn, bn, -ce, -ca, bj, -bt, cf bw, -bf, bv, cj, -bs, bi, -bz, - cf bo, -bra, cd, cb, -bk, bq, -ch, -bx, bg, -bu, -ck, bt, -bh, by, eg, -bp, bi, -cc }

{ ac, ab _* ab _* -ac, *ac, ab, -ab, ac, ae, ab, ab, -ac _* -ae _* ab, -ah, ae, ac, -ab, ah, -ac, ac, ah, - ab, ac, ac, -ab, 3b, -ae, -ac. ab, -ab, ac. ac, -ab, ab, ~ac -ac, ab. -ab, ac, ac, -ab, ab, -ae. - ac, ab, -ah, ac, ac, -ab, ab, -ac, -ac, ab, -ab, ac, ae, -ab, ab, -ac, -ae, ab, -ab, ac }

{ cd, -bo, bk, -bz, -ch, bs, -bg, bv, -ck, -bw, bh, -hr _* eg, ea, -hi, bn, -cc, -ce, bp, -bj, by, ci, -bf bf -b , cj, bx, -bf bq, -cf, -eh, bm, -bm, cb, c -bq, hf ~hx, ~cj _* bu, -bf bf -ci, -by, bj, -bp, ce, ce, -bn, bl, -ea, -eg, br, -bh, bw ek, -bv, bg, -bs, ch, bz, -bk, bo, -cd }

{ bb, -an, aq, -ax, be, ay, -at, at, -ba, -be, av, -ap, aw, -bd, -ax, as, -as, ax, bd, -aw, ap, -av, be, ba, ~af ar -ay, -be, ax, -aq, au, -bb, -bb, an, -aq, ax, -be, -ay, at, -at, ba, he, -av, ap, - aw, bd, ax, -as, as, -ax, -bd, aw, -ap, av, -be, -ba, at, -ar, ay, be, -ax, aq, -an, bb }

{ ce, -bg bf -bs, cf cd, -bq, bg, -bt, eg, cc, -bp, bb, -bu, ch, cb, -ho, bi, -hv, ci, ca, -bn, bj, -bw, cj, bz, -bm, bk, -bx, ck, by, -hi, bl, -by, -ck, bx, -bk, bra, -bz, -cj, bw, -bj, bn, -ca, - ci, bv, -hi, bo, -cb, -cb, bn, -bh, hp, -ce, -eg, hf -bg, hq _* -ed,-cf bs _* -bf bt, -ce )

f an, -ak, ah, -aj, am, ao, -al, ai, -af at -ao, -am, aj, -ah, ak, -an, -an, ak, -ah, aj, -am, -ao, ai, -ai, ai, -al, ao, am, -aj, ah, -ak, an, an, -ak, ah, -aj, am, ao, -al, ai, -ai, al, -ao, -am, aj, - ah, ak, -an, -an, ak. -all, aj, -am, -ao, al, -ai, ai, -ai, ao, am, -aj, ab, -ak, an }

f cf -hn, bj, -bi, bw; ~ch _* ~ed* hs, -bh, bu, -by, cj, cb, -bq, bf -bp* ca, ck, -bx, bo, -bg, br* -ce, -cf bx, -bra, bf -bt, ce, eg, -bv, bk, -bk, bv, -eg, -ee, bf -hi, bm, -bx, ci, ce, -bt, bg, - bo, bx, -ck, -ca, bp, -bf bq, -cb, -cj, by, -bn, bb, -bs, cd, cb, -bw, bf ~bj _* bu, ~e,f }

{ e, -ax, as, -aq, av, -ba, -be, az, -an, ap, -at, ay, -bd, -bb, aw, -ar, ar, -aw, bb, bd, -ay, at, -ap, au, -az, be, ba, -av, aq, -as, ax, -be, -be, ax, -as, aq, -av, ba, be, -az, an, -ap, at, -ay, bd, bb, -aw, ar, -ar, aw, -bh, -bd, ay, -at, ap, -an, az, -he, -ba, av, -aq, as, -ax, be }

{ eg _* -bx, bo, -bf, bn, -bw, c ch, -by, bp, -bg, bra, -bv, ce, ci, -bz, bq, -bh, hi, -bu, cd, cj, -ca, br, -bf bk; -bf ce, ck, ~cb, bs, -bj, hf -bs, cb, -ck, -ce, bt, -bk _* bi, -br, ca, -ej, -cd, bu, - bf bb, -bq, bz, -ci, -ce, bv, -bm, hg, -bp, by, -cb, -cf bw, -bn, bf -bo, bx, -eg }

j ag. -af ae, -ad, ad, -ae, af -ag, -ag, a -ae, ad, -ad, ae, -af ag, ag, -af ae, -ad, ad, -ae, af -ag, -ag, af -ae, ad, -ad, ae, -af ag, ag, -af ae, -ad, ad, -ae, af -ag, -ag, af -ae, ad, -ad _* ae, -af ag. ag, -af ae, -ad* ad, -ae, af -ag* -ag, af -ae, ad* -ad, ae, -af a }

{ eb, -ea; bf -bm, bf -bl, bs, -bz, eg, ci, -cb, bu, -bn, bg, -bk, bt, -by, cf cj, -cc, bv, -bo, bh, -bj, bq, -bx, ce, ck, -cd, bw, -bp, bi, -bi, bp, -bw, cd, -ck _* -ee, bx, -bq, bj, -bb, bo, -bv, cc, -cj, -cf by, -br, bk, -bg, bn _* -bu, cb, -cf -cg, bz, -bs, bl, -bf bm _* -bt _* ca, -ch } { bd, -ba, ax, -au, af -ap, s. -av, ay, -bb, be, be, -az, aw, -at, aq, -aq, at, -aw, az, -be, -be, bb, -ay, av, -as, ap* -at, an, -ax, ba, -bd, -bd, ba, -ax, au, -at, ap, -as, av, -ay, bb, -be, -be, az, -aw, at, -aq, aq, -at, aw, -az, be, be, -bb, ay, -av, as, -ap, at, -au, ax, -ba, bd }

{ ei, -cd, by, -bt, bo, -bj, bf -bfc, bp, -bu, bz, -ce, ej, ch, -ce, bx, -bs, bn, -bi bg, -bi bq, - bv, ea, -cf ck, eg, -cb, bw, -hr, bra, -bb, bb, -bro, br, -bw, cb, -eg, -ek, of, -ea, bv, -bq, bi, - bg, bi, -bn, bs, -bx, ce, -eb, -ej, ce, -bz, bu, -bp, bk, -hi, bj, -bo, bt, -by, ed, -ei }

{ ao, -an, am, ~al, ak, -aj, ai, -ah, ah, -ai, aj, -ak, at, -am, an, -ao, -ao, an, -am, af -ak, aj, - ai, ah, -ah, ai, -aj, ak, -al, am, -an, ao, ao, -an, am, -al, ak, -aj, ai, -ah, ah, -ai, aj, -ak, al, - am, an, -ao, -ao, an, -am, al, -ak, aj, -al, alt, -ait, ai -aj, ak, -al, am, -an, ao }

{ cj, -eg, ed, -ea, bx, -bu, br, -bo, bi, -bt, bf -bh, bk, -bn, bq, -bt, bw, -bz, ec, -cf, ei, ck, - dr, ce, -eb, by, -bv, bs, -bp, bin, -bj, bg, -bg, bj, -bm, bp, -bs, bv, -by, cb, -ce, eh, -ek, -ei, of, ~cc, bz, -bw, bt, -bq, bn, -bk, bh, -bf, bi, -bi , bo, -br, bu, -bx, ea, -ed, eg, -cj )

{ be, -bd, be, -bb, ba, -az, ay, -ax, aw, -av, an, -at, as, -ar, aq, -ap, ap, -aq, ar, -as, at, -au, av, -aw, ax, -ay, az, -ba, bb, -be, bd, -be, -be, bd, -be, bb, -ba, az, -ay, ax, -aw, av, -au, at, - as, ar, -aq, ap, -ap, aq, -at, as, -at, an, -av, aw, -ax, ay, -az, ba, -bb, be, -bd, be }

{ ck, -cj, ci -ch, eg, -ef ce, -cd, ec, -cb, ea, -bz, by, -bx, bw, -bv, bu, -hi, bs, -br, bq, -bp, bo, -bn, bm, -bi, bk, -bj. bi, -bb, bg, -bf, bf, -bg, bh, -bi bj, -bk, bl, -bm, bn, -bo, bp, -bq, br, -bs, bt, -bn, bv, -bw, bx, -by, bz, -ea, cb, -ec, ed, -ee, cf -eg, ch, -ci, ej, -ck } where

{ aa, ab, ac, ad, ae, af, ag, ah, ai, aj, ak, al, am, an, ao, ap, aq, an as, at, au, av, aw, ax, ay, az, ba, bh, be, bd, be, bf bg, bh, bi, bj, bk, hi, bm, bn, bo, bp, bq, br, bs, bt, bu, bv, b , bx, by, bz, ca, cb, ce, cd, ce, cf eg, ch, of ej, ck) - {64, S3, 36, 89, 75, 50, 18, 90, 87, 80, 70, 57, 43, 25, 9, 90,

90, 88, 85, 82, 78, 73, 67, 61, 54, 46, 38, 31, 22, 13, 4, 91, 90, 90, 90, 88, 87, 86, 84, 83, 81, 79, 77, 73, 71 , 69, 65, 62, 59, 56, 52, 48, 44, 41, 37, 33, 28, 24, 20, 15, 11, 7, 2}

i 29] In addition to DCT-2 and 4x4 DST-7 which have been employed in. HE VC, an

Adaptive Multiple Transform (AMT, or also known as Enhanced Multiple Transform (EMT) or Multiple Transform Selection (MTS j) scheme has been used in WC for residual coding for both inter and iutra coded blocks. The MTS uses multiple selected transforms from the DCT70ST families other than the current transforms in HEVC, The newly introduced transform matrices are DST-7, DCT-S Table 2 shows the basis func tions of the selected DST/DCT.

Table 2: Transform basis functions of DCT-2, DST-7 and DCT-8 for M-point input 3:1

10.130] All die primary transform matrices, such as in VVC, may be used with 8-hit representation The AMT applies to the CUs with both width and height smaller than or equal to 32 and whether applying AMT or not is controlle by a flag calle mis liag. When the mtsjf!ag is equal to 0, only DCT-2 may be applie for coding the residue. When the mtsjlag is equal to 1 , m index: mts Jdx is further signalled using 2 bins to specify the horizontal and vertical transform to be used according to Table 3, where value 1 means using DST-7 and value 2 means using DCT-S

Table 3: Specification of trTypefior and trTypeVer depending on ts jdx[ x j[ y jf eidx j

101311 An implicit MTS, such as in VVC Draft 4, may also be applied in case that the above signaling based MTS (be,, explicit MTS) is not used. With implicit MTS, the transform selection is made according to the block width and height instead of signaling. More

specifically, with implicit MTS for example as proposed in JVET-MO303, DST-7 is selected for the shorter side of the block and DCT-2 is selected for the longer side of the block. The transform core, which is a matrix com posed by the basis vectors, of DST-7 can be represented below:

4-point DST-7: V>

where {a, b, e, d, e, f} g, h} ~ { 17, 32, 46, 60, 71, 78, 85, 86}.

6~pomt DST-7:

{ a, b, c, d, e, f, g, h, L j, k, t, ra, a, o, p,}

( e, f, i, 1, o, o, 1, i f, c, 0, -e, -C 4, 4, -o,}

{ e, j, ø, ra, h, c, - -g, -I, -p, -k, -ft -a, d, i, a,}

{ g, B. I, e, -b, -i, -p, -j, -c, d, k, o, h, a, -f, -m,}

{ }, o, ft -e, -ft -1, -c, ft o, .ft 0, -i, -o, -ft e, I,}

{ k, k. 0, -k, ~k, 0, k, k, 0, -k, -k, 0, k, k. 0, -k,}

{ m, g, -ft -a, -a, ft h, -e, -o, -b, k, i, -d, -p, -e, j,}

{ ø, c, -ft -ft i, -ft -ft c, ø, 0, -o, -c, ft ft -ft)

{ p, -a, 0, b, a, -c, -m, d, 1, -e, -k, ft j, -g, -i, h,}

{ a, -e, -i, j, d, -o, a, tra -ft -k k, c, -p, b, ft -g,}

f i, -ft -e, o, -ft -ft o, -c, -ft ft 0, -1, ft c, -o, ft}

{ j, -m, c, g, -p, ft d, ft a, -k, ft -b, -h, o, -e,}

i b, -p, i -a, -g, o, -ft b, ft ~n, k, -c, ~e, m, -ft d,}

{ ft -l, o, -ft e, c, -ft o, -!, ft 0, -ft ft -o, ft -c,}

1 d, -b, ft -p, m, -ft e, -a, -e, g, -k, o, -a, j, -ft b,}

f b, -d, ft -b, j, -I, a, -p, ø, -m, k, 4, g, -e, c, -a,} wher {a, b, c, d, e, ft g, h, ft j, k, ft m, a, o, p} = { 9, 1.7, 25, 33, 4ft, 49, 56, 62, 66, 72, 77, 81, 83,

87, 89, 90}.

32-poiaf DST-7 ^" :

{ a, b, e, d, e, ft g, ¾, ft j, k, i, JM, a, o, p, q, r, a, ft «, v, w, x, y, x, A, B, C, D, E, E,}

{ c, ft ft i, o, r, a, x. A, B, F, C, ¾ w, ft q, a, k, ¾, e, b, -¾, -d, -g, -ft -m. -p. -s, -v, -y, -B. -E,}

{ e, j, o, t, y, D, D, y. ft o, j. e, 0, -e, -j, -o, -ft -y, -D. -D, -y. -ft -o, -j, -e, 0, e, _. ft o, ft y, D,}

i g _> » _s a, B, D, w, p, i, k -e, 4, -s, -x, -F, -y, -r, -k, -d, c, j, q, x, E, A, t, ra, ft -a, -b, -o, -v, -€,}

C ft r, A. C, t, k, b, -g, -p, -y, -E, -v, ~m, -d, e, a, w, F, x, o, ft -c, -ft -u, -D, -x, -q, 4ft a, j, s, B,}

} k, v, F, a, j, -a, -1, -w, -E, -ft -i, b, ra, x, D, s, b, -e, -is, -y. -C, -r, -g, d, o, x, B, q, ft -e, -f), -A,}

{ m, x, x, lift (ft -m, -x, -x, -m, 0, in, x, x, ra, O, -ra, -x, -x, -m, (ft ra, x, x, m, (ft -m, -x, -x, -m, 0, aft z,} f o, D, ft e, -j, -y, -y, -j, e, t, D, o, 0, -o, -D, -I, -e, .ft y, y, j, -e, -ft -D, -o, (ft o, D, ft e, -ft -y,}

{ _> E, a, -c, -t, -B, -k, ft w, y, h, -s, -x, -v, -e, ft C, s, b, -p, ^' , -p, a, r, D, m, -d, -u, -A, -ft g, s:,} { s, A, -k, 4¾ -p, e, v, :x, e, -n, -F, -m, f, y, a, b, -q, -C,·& i, B, r, -a, 4, -* _» -g, 1 E _s o, -d _s -\y _» }

{ a, w, h,~s, -y, q, A, f. -o. -C.¾ m, E, j,4q ~F, 4, i, D, n, -g, -B, -p, e, z, r,-e _s -x ₅ 4, a, v,}

{ w, s, -4. -A, -o k E, k, 4, -D, -g, p, z, c, -g -v, a, x, r. ~e, -B, -a, i, F, j, -m, -C, 4 ^' , q, y, b, -¾}

f y _> o, k -D, -s, t, g -e, 4X ~j* o, y, O,-g,-o, j, .6 _» e _: 4 _s -k A B, j, -o, -y, 0, y, o,-j, -D,-e _{s k} } i A, _* -p, -v, e, F, E-a.-q, j, B, ¾-¾, -L o, \v, -d, -B, -g k ,-€,4Ϊ, y, ai, -B, -X, C, B, -s,}

{ g, -v, -a, o, u _> 4i _»* B, a, D, f, -w p, E 4, -A, b, E, e, -x, 4, q, s, -j, -x, c, F, d,-y, -k, r,}

ί E, c, -B, -f, y, i, -v, 1, s„ o, -p, -r, m, a -j, -x, g. A, -d, -D, a, F. h,-C, -e, z, tk-w, -k, k n,-q,}

{ F, -a, 42, b. B, -c, -C, d, B, -e, -A, F z, -g, -y, b, x, 4, -vv, j, v, ~k ~W i, E-n -s, a, r,-o,-q, pj

{ , -e, - _{* >} k -o, O, k j, -y, -e, D, 0, -D, e, y, -j, -q o, o _s ~E -j, y, e, -D _* 0..D, -e, -y, j, E -ø,} i B, -i, -s, x, j, -A, , C,- 4, q, k,-k -b, D,-¾,-II p, E-y,-c, E, 4; -v, o, m, -x-d, F,-e,-w, n,}

{ z, -ra, ~ra, z, k~JE in, ,-*, 0, z, ~ra,-m, z„ 9,-z, ta, ra, ~z, 0, z, -m, -ra, , 0,-z, m, ih,-z, 0, z, -tnj { x _> -i iE E, -j, -n, A, -c, -a, i 4,43, m, k, -D. f, r, -w, -a, y,-p,4>, F, 4, -o„ z, -b, -v, s, e, -C, !,}

{ v, -si, -a, w, ~E -b, x, -s, -c, y, r, d, z,~q _t ~e, A, -p, 4 ^' B, -o, -g, C, ~a,4x D, -nxd, E, 4, -j, F,~k _x j f t, -y, e, 0, 3, j, j,-», o, e,-y, E 0,4, y _; ~e, -o, D,-j _> ~j _> k-E 0, i -y, e, o,4X ],}

C A-C, k, g,-y, v, -d, -a, F, -o, -c, u.-x, in s,-A Q _> 0, 4,4, x,-w, s, ra, -E, p, b, 4, A, 4.)

13, 17, 21, 26, 30, 34, 38, 42, 45, 50, 53, 56, 60, 63, 66, 68, 72, 74, 77, 78, 80, 82, 84, 85, 86, 88,

88, 89, 90, 90 }

4~poiiit DCT~8:

{ a, b, e, d j

{ b, 0, -b, -b,}

{ c, -b, -d, a,}

{ d, -b, k-kj

where (a, b, c, d} - { 84,74,55,29}.

{ d, L -p, 4, 4i, -tip g, a, ø, 4, ~e, ~e, )

e, t, -k, ~b, 4i, 0, h, k _* ~n, -e, -e, -n, k, b, }

{ f, o 4 -i , f, f, o _s o, f, E o, -4 -f _s

{ g, ~in-¾,~«7 b, f, ~o, -b, -I, I, e, -p, ~c, - , j, }

{ k -k, -e, n, b, 0, 4>,-B, e, k, -k ~h _t k, e _s -n, 4),}

{ i, -h, g, k _s 4 -I, e, m, -d, -a, e, o, -b, -p, a,}

{ j, -e, -o, a, -n, 4 t, k, -d, -p, b, -ftp -g, b, I, -c,}

{ k, -b, a, b, -e, 0, e _: , -b, -a, b, -k, -k, k -n, -b, e

{ i-k i 0,-e _* f _> ~, 4i, e, ~m, -k, a, -j, -», 4~g

{ t», -e, , 4 b, b -k k, O _j ~g, k 4 -p, b, -a i,}

1 k-b, b, ~e, k, 0, -k _? e, ~k -n,-n, k-k e, -k,}

{ 0,4 g, -e, k 4 jv~o, -p, ! _s 4i, d, -a, e, ffi,}

{ p,-n, 1, 4 d, a, -c, e, -g, i,4q m, -o,}

where (a, b, c, d, e4 g, k L j, k, L , n, o, p} = { 90,89,E7 _? B3 ₅ Bί,77,?2 _: 66 _? 62 _! 56,49,41 3,25,I7,

9}.

32-poiBt DCX-8:

where (a, b, c, d, e, f. g, h, i, j, k, k ng n, o, , q, r, $, t u, v, w, x, y, z _* A, B, C, D, E, F }

{90,90,89,88,88,86,85,84,82,80,78,77,74,72,68,66,63,60,56 ,53,50,4542,38,34,30,26,2147,13, 9, 4} - fll32 j In some examples, such as in VVC, when both the height and width of the coding block is smaller than or equal to 64, the transform size can always the same as the coding block size. When either the height or width of the coding bloc is larger than 64 _s whe performing the transform or intra prediction _* the coding block can be .further split into multiple sob-blocks, where the width and height of each sub-block is smaller than or equal to 64, and one transform is performed on eac sub-block. fO.1.33] MTS ca« be enabled or disabled id SPS, such as in VVC Draft v5, with the following syntaxes in Table 4.

Table 4; Syntax for enabling MTS in SPS

In addition, syntaxes elements for controlling implicit MTS, explicit MTS for intra coding and explicit MTS for inter coding can be described in Table 5.

Table $: Syntax elements for enabling implicit MTS, explicit MI ^' S for intra and explicit MI ^' S

jllMj For some cases, DST-7 and/or JDCT-8 can be used without being explicitly signaled, such as in VVC Draft v5. For example, DST-7 and/or DCT-8 can be use implicitly base on information that is available for both an encoder and a decoder. Exemplary cases include:

(a) ISP: For IS P mode, tire horizontal transform is selected as DST-7 as long as the block width is greater than or equal to 4 and less than or equal to 16, and the vertical transform is selected as DST-7 as long as the block height is greater than or equal to 4 and less than or equal to 16.

(b) SBT: For SBT mode, for a. sub-TO located at the left half (or quarter} or right half (or quarter) of current CU, the horizontal transform is DCT-8 and DST-7, respectively. Otherwise, when sub~TU has a same width as the current CU, DCT-2 is used. For a sub- TU located at the top half (or quarter) or bottom half (or quarter) of thecurrem CO, the vertical transform is D€T~3 and DST-7, respectively. Otherwise, when a sub-TO has a same height as the current CU, DCT-2 is used. (c) MTS disabled in EPS; When sps ts enabled flag is signaled as true, but both sps _^ expHcitjntsJctra enabied _^ f!ag aiidsps e-xpKcit ntsJiiter enabied flag are Signaled as false for luira prediction residuals, fo horizontal transibnn is selected as DST-7 as long as foe block width is greater than or equal to 4 and less than or equal to 1:6, and foe vertical transform is selected as DST-7 as long as the block: height is greater than or equal to 4 and less than or equal to 16

[01351 A inode-dependent non-separable secondary transform (NS ST), such as In WC, can be applied between the forward core transform and quantization (at foe encoder), and between foe de-quantization an inverse core transform (at foe decoder). To keep complexity low, SST can only be applied to the low frequency coefficients after foe primary transform. If both a width (W) and a height (H i of a transform coefficient: block is larger than or equal to 8, then 8*8 non-separable secondary transform can be applied to the top-left 8x8 region of foe transform coefficients block. Otherwise, if either W or H of a transform coefficient block is equal to 4, a 4x4 non-separable secondary transform can be applied and the 4x4 non-separable transform can he performed on the top-left rai»(8,W) ^x mi«(8, H) region of the transform coefficient block. The above transform selection rule can be applied for both luma and chroma components.

[01361 Matrix multiplication implementation of a non-separable transform ca be described as follows in formula (1 ) by using a 4*4 input block as an example.. To ap ly the non- separable transform, the 4*4 input block

Is represented as a vector X:

[01371 The non-separable transform can be calculated as F = 7 X, where F indicates foe transform coefficient vector, id .71$ a 16*16 transform: matrix. The 16* I coefficient vector F is subsequently re-organized as 4*4 block using the scannin order for that block (horizontal, vertical or diagonal). The coefficients with smaller indices can be placed with foe smaller scanning indices In foe 4*4 coefficient block. A Ilyperenbe-Grvens Transform (HyGT) with buterfly implementation, such as in JEM, can be used instead of matrix multiplication to reduce the complexity of the non-separable transform . 10138| In one design of NSST _s a total of 35 3 non-separable secondary transforms can be applied for both 4 ^c 4 and $ ^x 8 block sizes, where 35 is the number of transform sets specified by the intra prediction mode, denote as set, and 3 Is th number ofNSST candidates for each infra prediction mode. The mapping from the intra prediction mode to the transform set is defined in Table 6 tor example. The transform set applied to Iitma/chroma transform coefficients can be specified by the corresponding iuma/ehxoma intra prediction modes, according to Table 6. For intra prediction modes larger than 34 (diagonal prediction direction), the transform coefficient block can be transposed before/after the secondary transform at the encoder/decoder.

Table 6: Mapping from intra prediction mode to transform set index

[0139) For each transfor set, the selected non-separable secondary transform candidate can be further specified by the explicitly signalled CD-level NSST index. The index may be signalled in a bitstream one time for each intra CU alter transform coefficients and truncatedunary blnsfization is used. The truncated value is 2 in case of planar or DC mode, and 3 for angular intra prediction mode. This NSS T index may be signalled only when there is more than one nonzero coefficient in a CU. The default value may he zero when it is not signalled. A zero value of this syntax element may indicate that the secondary transfor is not applied to the current CU, values 1-3 indicate which secondary' transform from the set should be applied,

|:bί.4b| lu some embodiments, NSST cannot be applied for a block coded with transform skip mode. When the NSST index is signalled for a CU and not equal to zero, NSST is not used for a block with a component (e.g,, chroma compoeut, or kuna component) that is coded with transfor skip mode in the CU. When a CU with blocks having all components are code in transfor skip mode or the number of non-zero coefficients of non -transform-skip mode CBs i s less tha 2, the NSST index is not signalled for the CU .

[01411 A variant of NSST using transform zero-out scheme, namely Reduced Size

Transform (RST), which is also called Low-Frequency Non-Separable Secondary' Transform (LFNST) such as in VVC Draft 5, has been proposed in JVBT-N0193. In RST, whether the intra prediction mode is Planar or DC can be checked for entropy coding the transform inde of NSST. Four transform sets can be applied, and each transferal set can include three RST transform cores. The three RST transform cores can be either size 16x48 (or 16x64) (applied for a transform coefficient block with a height and a width both being greater than or equal to 8) or 16x16 (applied for a transform coefficient block with either a height or a width being equal to 4) For notadonal convenience, the 16x48 (or 16x64) transform is denoted as RSTSxS and the .16x 16 transform is denote as S ^' T4x4. For RSTSxB, the two alternatives using 16x64 transform cores and 16x48 transform cores are shown in FIG. 10 and FIG. 1 1 , respectively. FIG. 10 shows a an RST using a 16x64 secondary transform core FIG. 11 shows an RST using a 16x48 secondary transform core. The transform using 16x48 transform cotes is adopted in VVC Draft 5 for example. [0.142] The index .indicating the selection of LF ST kernel (e.g,, Hiistjdx) can be signaled at the en of CLMevei syntax. as indicate in Table 7. Table 7 provides syntax at a CLL level.

Table 7: Syntax of signaling an index for selection of LFNST kernel

[01431 some examples, a Reduced Transform (RT) maps an N dimensional vector to an R dimensional vector in a different space, where R (ft < ) is the reductio factor.

The RST matrix is an RxN matrix as follows in formula (2): where the R rows of the transform are R bases of the N dimensional space. The inverse transfor matrix fo R.T is the transpose of its forward transform, FIG. 12,4 is a schematic view of forward and transform and FIG. 12B is a schematic view of inverse reduced transform.

[0144] The RSTSxS with a reduction factor of 4 (1/4 size) can be applied. Hence, instead of 64x64, which is a typical 8x8 non-separable transform matrix size, a 16x64 direct matrix is used in other words, the 64*· 16 inverse RST matrix is used at the decoder side to generate core (primary) transform coefficients in 8><8 trip-left regions. The forward RST8 8 uses 16x64 (or 8x64 for 8x8 block) matrices so that the forward RST8x8 produces non-zero coefficients only in the top-left 4x4 region within the given 8x8 region. In other words, if RST is applied te the 8 8 region except the top-left 4*4 region can have only zero coefficients. For RST4x4, 16x16 (or 8x16 for a 4x4 block) direct matri multiplication can be applied

|0:t4Sf In addition, for KST8x8, to further reduce the transform matrix size, instead of using the whole top-left 8x8 coefficients as input for calculating a secondary transform, the top- left three 4x4 coefficients can be used as the input for calculating the secondary transform.

FIGS. 13A-13B show differen alternatives ofRSTSxS. FIG 13 A shows an example for 16x64 tr nsform matrices and the whole top-lef 8x8 coefficients are applied as input for calculating the secondary transform. FIG. 1 B shows an example for 16x46 transfor matrices and the top-left three 4x4 coefficients are used as the input for calculating secondary transform,

f 0146] In some embodiments, an inverse RST can be conditionally applied when the following two conditions are satisfied: (a) block size is greater than or equal to the given threshold fW>=4 && H> ^ss 4); and (b) transform skip mode flag is equal to zero. If both width (W) an height (Hj of a transform coefficient block is greater than 4, then the RSTSxS is applied to the top-left 8x8 region of the trans orm coeffi cient block. Otherwise, the RST4x4 i s applied on the top- left: mm(8, W) x min(8 _: , H) region of the transform coefficient block

f 0147] If the RST index is equal to 0, RST is not applied. Otherwise, if the RST index is equal to one, RST is applied, and a corresponding kernel (or transform set) can be chosen in accordance with the RST index.

f 0148] Furthermore, RST can be applied for intra GU in both intra arid inter sl ices, and for both Luma and Chroma. If a dual tree is enabled, RST indices for Luma and Chroma are signaled separately. For inter slice (the dual tree is disabled)., a single RST index is signaled and used for both luma an chroma components. When the ISF mode is selected, RST is disabled, and RST index is not signaled.

f0l49] In some embodiments, an RST matrix can be chosen from four transform sets, and each of the transform sets includes, or consists of, two transforms. Which transform set is applied can be determined front an intra prediction mode as follows: (a) if one of three CCLM modes is indicated, transform set 0 is selected., or (b) otherwise, transform set selection is per forme according to Table 8:

Table 8: The transform set selection table

The index (ie,, intraPredMode ) to access Table 8 has a range of [-14, 83], which is a

transformed mode index used for wide angle Intra prediction

|9159] A Matrix-based intra prediction (MIF) mode can be provided such as in VVC.

For predicting the samples of a rectangular block of width (W) and height (H), M1P takes one line of H reconstructe neighbouring boundary samples that are located to the left of the block, and one line of W reconstructed neighbouring boundary samples above the block as input If thereconstructe samples are unavailable, they can he generated, for example as it is done in the conventional intra prediction.

(8151 j The generation of the prediction signal can he based on the fol lowing three steps;

(a) Out of the boundary samples, four samples in the case of W - H ~ 4 and eight samples in all other cases are extracted by averaging

(b) A matrix vector multiplication, followed by addition of an offset, is carrie out with the averaged samples as an input. Th result i a reduced prediction signal on a subsampled set of samples in the original block

(c) The prediction signal at the remaining positions is generated from the prediction signal on the subsampled set. by linear interpolation whic is a single step linear interpolation in each direction.

[0152] The matrices and offset vectors needed to generate the prediction signal are taken fro three sets So, Sfo S ₂ of matrices. The set S ₀ incluedes, or consists of, 18 matrices ,40, l & (0, 17} Each of the matrices has 16 rows, 4 columns, and 18 offset vectors i

6 {ø, 17}, Each of the of&et vectors has a size 16, Matrices and offset vectors of the set S _Q are used for blocks of size 4x4, The set Si includes, or consists of. 10 matrices A\, i

E (0, 9}. Each of the matrices has 16 rows, 8 columns, and 10 offset vectors b i€ {0, 9}

. Each of the offset vectors b has a size 16. Matrices and offset vectors of the set Si are used for blocks of sizes 4x8, 8x4, an 8x8. filially, the set ¾ includes, of consists off 6 matrices d :, i 6 {0, $}, Each of the matrices has 64 rows. 8 col nns, and 6 offset vectors ί€ {0, 5} of size 64 Matrices and offset vectors of the set Sg or parts Of these matrices and offset vectors are use for all other block-shapes

(0153] FIG. 14 is an illustration of an example MIP for 8x8 blocks. As shown in FIG.

14, given air 8x8 block, MIP takes torn averages along each axis of the boundary. The resulting eight input samples enter the matrix, vector multiplication, The matrices are taken from the set 5c This yield 16 samples on the odd positions of the prediction block. Thus, a total of

(8 16)/{8*8) ^::: 2 multiplications per sample are performed. After adding an off et, these samples are interpolated vertically by using the reduced top boundary. Horizontal interpolation follows by using the original left boundary . The interpolatio process does not require any

multiplications in this ease

(0154] In terms of signaling of MIP mode, for each CU in intra mode, a flag indicating whether an M IP mode is applied on the corresponding FO or not can be sent in the bitstream if an MIP mode is applied, the index predmode of the MIP mode can be signale using an MEM- list including 3 MPMs

(0155j he derivation of the M PM s can be performed using the intra-modes of the above and the left PU as follows There are three fixed mapping tables map ng kirjojnipu _x , idx e {0,1,2}, a d each table can be associated with a conventional intra prediction mode

predmode _ngu}<ir with a specific MIP mode, as described in the following formula {3)

where pjmgvlarjojnip is a fixed lobk-up table. The index of die mapping table can be decided based on the width (W) and height (H) of PU, and in total three Indices are available, as described below in formula (4)

tdx(PiJ) « idx(W.H) 6 {0,1,2} (4)

The formula (4) indicates from which of the three sets the MIP parameters are to be take»

{0156] To generate th MPM list for a curren block which is coded by MIP mode, at above MIP mode, namel and a left MIP mode, namely are firstly derived.

The value of can be derived as follows: (a) If the above FO PU _{aj 0Ve} is available, and it belongs to the same CTU where the current FU resides, and PU _af y ₀ is coded by MIP using ax MIP mode predmode and

idx(PU) = i d n( PU _{ab 0Vi} d

ode$ /j> ^we =* predmode T (5)

(b) If the above FU PU _{aiK m} is available, and it belongs to the same CTU where the content FU resides, and PU _a t _<nm is coded using a conventional intra prediction mode

(c) Otherwise _»

rn&defg* - -1 (?)

which means that this mode is unavailable. The value of mo e J> can be derived in the same way as deriving but without checking whether the left FU belongs to the same CTU where the current PIJ resides.

|0157| Finally, given the derived modef p^ and mo efffl and three pre-defined feed default MPM lists fist^ idx€ {0,1,2} , where each of the MPM lists contains three distinct MIP modes, an MPM list is constructed. The MPM list can be constructed based on the given default list listutxtfv ₎ and mo e _f fi?* and mode^ by substituting-! by default values .as well as removing duplicate MIP modes

10158] Exemplary flags for signaling MIP modes are Illustrated in Table 9 which i a CU-level syntax table.

Table 9; Syntax of flags signaling MIP modes

[0159] ϊii some embodiments, the MIP modes can be harmonized ith the MPM-base coding of the conventional intra-prediction modes as follows. The lama an chroma MPM-list derivation processes ter the conventional intra-prediction modes use separate fixed tables mafijmp ojmg lar _tf tx, idx 6 {0,1,2}, which map an MIP-mode predmodepup to one of the convents onal intra-predi ebon modes

predmode _A n _g ui _a r mapjnip_tojmgular[predmode _Mip ] (8)

where mapjnipjojmgulw is a fixed look-u table. For the luma MPM-list derivation, whenever a neighboring luma block is coded by ir MIP mod& redmade _M f _Pi this block can be treated as i f i t was using the con ventional intra-prediction mode predmode _{Anqui r,} For tbe chroma MPM-list derivation, wheneve the current luma block uses an. MIP-mode, the same mapping can be used to translate the MlP-mode to a conventional infra prediction mode.

[6160] Exemplary intea prediction modes are illustrated in FIG. 15. A total of 35 intra prediction modes is illustrated in FIG. 15, tor example as used in EVC. Among the 35 intra prediction modes, mode 10 is a horizontal mode an mode 26 is a vertical mode. Modes 2, 18, ami 34 axe diagonal modes. The 35 intra prediction. modes can be signalled by three most probable modes fMFMs) and 32 remaining modes

[016! I A total Of 95 intra prediction modes is illustrated in in FIG. 16, fbr example as used in WC. Mode I B is a horizontal mode and mode 50 is a vertical mode. Modes 2, 34, and 66 are diagonal modes. Modes -I to - 14 and Modes 67 to SO can be referred to as Wide-Angle tra Prediction (WA1P) modes.

[0162] Position dependent prediction conbination (PDPC), such as in WC, can be appl ed to the folio wing intra modes without signaling: planar, DC, WAIP modes, horizontal, vertical, bottom-left angular mode (mode 2), 8 adjacent angular modes (mode 3- 10) of the bottom-left angular mode, top-right angular mode (mode 66), and 8 adjacent angular modes (mode 58 5) of the top-right angular mode. A prediction sample pred(x,y) located at position (x, y) of a current block can be predicted usin an intra prediction mode (e g. _s DC, planar, angular) and a linear combination of reference samples according to the PDPC expression that is shown in formula (9).

predfx.y) (64 ^. wL - wT 4 wTL) x pred(x,y)f 32 ) » (9)

where R _{s,, j} and R. _J<y represent reference samples located a the top and left of a current sample (x, y), respectively, and R _{{ ,} represents a reference sample located at the top-left corner of the current block,

[0163| The weights applied in the DC mode can be calculated according to formula (TO) for a block with a width and a height,

WT ~ 32 » ( ( y«l ) » nScale j, wL ~ 32 >> f ( x«l ) » nScale ), wTL ( wL»4 ) + ( wT»4 ) (10)

In formula (10), nScale ~ { iog2( width > ^. 2 + g2( height ) - 2 + 2 ) >> 2, wT denotes the weighting (actor for the reference sample located in the above reference line with the same horizontal coordinate, wL denotes toe weighting factor for the reference sample located in the left reference line wit the same vertical coordinate an wTL denotes the weighting factor for the top-left reference sample of the current block, nScale can specify how last the weighting factors (e.g„ wL, wTL, and wT) decrease along the axis (wL decreasing from left to right or wT decreasing from top to bottom), and denote a weighting factor decrement rate. The weighting factor decrement rate weighting factor decrement rate nScale Is the same along x-axls (from left to right) and y-axis (from top to bottom) in WC In addition, 32 denotes the initial weighting factors for the neighboring samples, and the initial weighting factors are also the fop (left or top- left} weightings assigned to top-left samples in current CB. The weighting factors of neighboring samples in a PD PC process should he equal to o less than the initial weighting factors

f f 64) In some embodiments, TL ~ 0 in Planar mode, wTL ~ wT in horizontal mode, and wTL ~ wL in vertical mode. The FDPC weights (or weighting factors) can be calculated with adds and shifts. The value of predfx, y) can be computed in. a single step using formula (9) for exam le.

f 0165) FIG . 17 A illustrates the PDPC weights (wL, wT, wTL) in DC mode for sample 1702 located in (0, 0) inside a 4x4 block 1700, As shown in FIG, .17 A, wl> ^: 32, wT ^:K 32, and wTL 4 FIG. I7B illustrates the PDPC weights (wL, wT, wTL) in DC mode for a sample 1704 located in (I, 0} inside the 4x4 block 1700. As shown in FIG. 17B, wL ^::K 8, wT ^::: 32 _; and TL ^:::: ~2. if PDPC is applied to DC , planar, horizontal, or vertical intra modes, additional boundary filters are not needed, such as the HE VC DC mode boundary filter or horizontal/vertical mode edge filters.

|0166J FIG. 17 A ca also illustrate the definition of reference sampl es R.|. _y , and R_ i _,.¾ whe PDPC is applied to the top-right diagonal mode. The prediction sample pred(x\ y ^* ) is located at (x ⁵ , y’} within the prediction block (or the 4x4 block) 1700. The coordinate x of the reference sample R _¾-, -i is gi ven by: x ^:::: x ^? t y’+· I, an the coordinate of the reference sample PL; _, ,, is similarly given by: y = x’ + y ^* + 1.

i 67) The following clause describes an example of the PDPC, such a in VVC draft 2, where: .«Scale is use to specify the weighting factor decrement rate, and“32* in formulas (14), (15), (19), and (20) specifies the initial weighting factors. Inputs to the position-dependent Intra prediction combination process can include; the infra prediction mode predModelntra: a variable nXbW specifying the transfor block width; a variable nTbl! specifying foe transform block height; a variable relAV specifying foe reference sam les width; a variable refB specifying the reference samples height; the predicted samples predSamples[ x )[ y ], with x ~ <1.nTbW - 1 and y ^:s 0..nTbH - 1; the neighbouring samples p( )[ y j, with

x ~ -1 , y ~ ~i„refH - I and x - CLtefVV - I, y ~ -I; and a variable cldx specifying the colour component of the current bloc k,

J0168) Outputs of the position-dependent intra prediction combination process can include the modified predicted samples predSamples[ x ][ y J with 4 _· 9 x ~ 0,.:n.Tb - I , y ^:::: 0,,hTH! - 1 , Depending on t e value of Cldx _s the fuiiction clip] Crop can set as follows. If cldx is equal to 0, cliplCm can he set equal to Clipl Y. Otherwise, cliplCmp can he set equal to Clip 1C. The variable «Scale can be set to { ( Log2( nThW )

Log2( nTbH )~ 2) » 2 ).

[01691 The reference sample arrays rnainReif j and sideRef[ y ], with x ~ 0..refW and y fLteffl can be derived as fellows:

rnainReif x j p( x ] ] (11) sldeRefl y ] - p;[ 1 ly]

[01703 The variables refL[ x ][ y ], ref i ^' [ x ][ y ], wT[ y ], wL[ y ] and wTL[ x ][ y ] with x ^:::: G .nThW - 1, y ^:::: 0.nTb!I · 1 can he derived as follows, if predModelntra .is equal to NTRAJPLANAR, tltAJDC, 1NTRA_ ANGULAR 18, or 1NTRA_ ANGULAR50, the following applies;

refL[ x }[ y ] ~ p[ ^~ 1 [[y] (12) reff[ x ][ y ] p[ x ];[ ! j (B)

wL[ x ) - 32 » ((x « 1) » «Scale (15) wTL[ x ][ y j ^:::: ( predModelntra ^{:::: :tt:} INTRAJDC ) 7 ( ( wL[x ] » 4 ) -f

(wT[y]» 4)) : 0 (16)

[0171] Otherwise, if predModelntr Is equal to INTRA ANGULARl or

!NTRA_ANGULAR66 ₅ the following applies:

refLf x J[ y j p[ 1 ] [ x + y + 1 ] (17 refr[ x ][ y 1 = p[ x + y + 1 ][ - 1 ] (is) wT[yj ^« ( 32 » 1 ) » ((y « 1 ) » «Scale ) (19) wL[x] ^“ ( 32 » ) » (( x « 1 ) » nScale) (20) wTL[ x ][ y ]— 0 (21)

[0172} Otherwise, if prdModelntra is less than or equal to 1. TR A ANGOL AR10, the following ordered steps apply;

The variables dXPos[ y }, dXFrac[ y j, dXint[ y J and t!X[ y ] ate derived as follows using inv Angle depending on intraPredMode;

dXPos[ y ) - ( ( y + 1 ) * inv ngle F 2 ) »

dXFtaef y } - dXPosi y j & 63 (22) dXlntfy ] -d Pos [ y j » 6

dX[ y 3 ~ x XInif y ]

The variables reiLf x ][ y ], reTT[x][y3 _> T[yj* wLfy] and wTL[x ][y] ate derived as follows:

refit xj[ y] ^ 0 (23) refit x I y ! ( clX! y ] < re£W - 1 } ?

( ( 64 - dXFrac[ y j ) * mamReff dX[ y 1 j ¥ dXFrac y ] * it mRef dX[ y j ¥ ! ] ¥

32 ) » 6: 0 (24) wT[ y ] - ( dX[ y ] < refW -· 1 ) ? 32 » ( ( y « 1 ) » nScale ) : 0 (25» wL{ x ] - 0 (26) wTL[x][y]-0 (27)

|8173 j Otherwise·, if predModelntra is greater than or equal to INTRA ANC JL AE58, the following ordered steps apply:

The variables dVPos[x ], dYFraef x], dYIrrtf ] and d¥(x] are derived as follows using inv Angle depending on miraPredMode

dYPosf x j { ( x ¥ 1. ) inv Angle * 2 ) » 2

dYFraef x J = dYPosf x ] & 63 (28) dYlnt[ x J ^:::: dYPosf x ] » 6

dY[ x ~ x - dYXntf x ]

The variables refLf x ][ y ], refTf x ][ y ], wT[ y ], wL[ y ] and wTL[ x J[ y 1 are derived a follows:

refLf x I y ] - ( dYf ] < reffi - 1 ) ?

( ( 64 dYFraef x j ) * sideReff dY[ x | J + dYFraef x } * sideRefj; dY[ ) ¥ I ] ¥ 32 ) » 6 -0 (29) reff[x)[yJ-0 (30) wT[ y J 0 (31) wLf x f ^::1: ( dY[ j < tefH -1 ) ? 32 » ((x « 1 ) » «Scale) : 0 (32) wTL[ x ][ y 3 ~ 0 (33)

[01743 Otherwise, refLf x I ] _» i¾FF[ x ][ y ], wT[ y ], wL[ y ] and wTL[ x ][ y ] are all set equal to 0. 5}

|0I7S| The values of the filtered samples fiitSa.mples| % ]{ y with

x = O.jiTb - i, y =0. nTbfi - 1 can derived as follows:

filtSamples[ x J j ^:::: cliplCmpC ( refL[ x j[ y ] * wL + relT[ x y ] wT - p[” 1 ][ ~i 1 wTLf x I y ] ( 64 - wLj x J - wT[ y ] +

wTL[ xjf y ] } * predSamplesl }[ y ] - 32 ) » 6 )

|0176| For the chroma component of an Intra coded block, the encoder selects the best chroma prediction modes among five modes including Planar (mode index 0) DC (mode Index 1), Horizontal (mode index 18), Vertical (mode Index 50), Diagonal (mode index 66), and a direct copy of the intra prediction mode for the associated luma component, namely DM mode. An example eof the mapping between intra prediction direction and intra prediction mode number for chroma is shown in Table 10

Tabic 10: Mapping between Inter prediction direction and intra prediction mode for chroma

As shown in Table 10, the intra prediction directions for a chroma component can be indicated «sing a syntax element intra itonia jrred node [xC¾j[yCh| _s which can have five valu s (e g„ 0-5), and each value ca indicate a respective intea prediction direction for the chorma component A syntax element lMraPied odeY[ xCb + cbWidih / 2 ]| yCb + chMeight / 2 j ca indicate corresponding intra prediction modes for the chrom component responsive to the intra predion directions for chorma component

01771 To avoid a duplicate mode, the four modes other than DM can be assigned according to the intr prediction mode of th associated lum component. When the intra prediction mode number for the chroma component is 4, the intra prediction direction for the lu a component can be used for th intra prediction sample generation for the chroma component. When the intra prediction inode number for the chroma component is not 4 and is identical to th intra redic ion mode number for the luma component, the mtra prediction direction of 66 can be used for the intra prediction sample generation for the chroma component.

[0178] Merge mode for .mtsr-pieture prediction indicates that the motion data is inferred instead of being explici tly si gnaled for a block . A merge c andidate list of candidate motion parameters can be firstly constructed, and theft an index can be signaled to identify which candidate in the merge candidate list is to be used.

[0179] The merge candidate list can include a non sub-CU merge candidate list and a sub~OU merge candidate list. The non sub-CU merge candidates can be constructed based on the spatial neighboring motion vectors, collocated temporal motion vectors, and history based motion vectors. The sub-CU Merge candidate list can include affine merge candidates and ATMVP merge candidates. A sub-CU merge candidate can be use to derive multiple MVs for a current CO, and a different par of the samples in the current CU can have different motion vectors.

[01:80] Skip mode for mter-picinre prediction indicates that the motion data for a block is inferred instead of being explicitly signaled, and that the prediction residual is zero, i.e., no transform coefficients are transmited. At the beginning of each CU in an inter-picture

prediction slice, a ski jfotg can be signaled that implies: (a) the merge mode is used to der ve the motion data; and (b) no residual data is present in the bitstream.

f 0181] Mrdii-hypothesis Intra-inter prediction (also referred to as combined intra-inter prediction (COP) mode) combines one intra prediction and one merge indexed prediction (or one inter prediction i merge mode), namely intra-inter prediction mode. Whe a CU is coded in the merge mode, and if the CU contains at least 64 luma samples (ie ,€U width times CD height is equal to or larger titan 64), an additional flag can be signaled to indicate if the combined inter/intra prediction (ClIP) mode is applied to the CO. The additional flag can be signaled to select an intra mode from an intra candidate list when the additional dag is true. For a Ionia component of the CU, the intra. candidate lis t can be der i ved from 4 intra predictio modes including DC, planar, horizontal, and vertical inodes, and the size of the intra candidate list can be 3 or 4 depending on the block shape. When the CO width is larger than a double value of CD height, horizontal mode is remove from the intra mode list. When th CU height i larger than the double value of CU width, vertical mode is removed from foe intra mode list. Further, one intra prediction mode selected by foe intra mode index and one merge indexed predictio selected by the merge index can be combined using a weighted average. For a chroma component of the CO, DM can be always applied without extra signaling.

f 0182] The weights (or weighting Victors) for combining predictions can be described as follows. When DC or planar inode is selected or a Coding Block (CB) with a width or a height smaller than 4, equal weights are appli d. For a CB with a widt and a height larger than or equal to 4, when horizooial/vertkal mode is selected, the CB is first vertically/horiaontally split into four equal-area regions. Bach weight set, denoted as (wjntf¾, w _. jntep), where ί is from 1 to 4 and {w trai, wjnter ) ~ (6, 2), (wjujtraj, w ntef ₂ ) ^¥ (5, 3), (wjintraj, wjnter ₃ } (3, 5), an (w intra*, w inter·*) - (2, 6), can be applied to a corresponding region (wjutraj, w inter j) is applied to a region closest to the reference samples and (wjtatra*, wjnter*) is applied to a region farthest away from the reference samples. Then, the combined prediction can be

Calcula ed by summing up the two weighted predictions (e,g. _s the inter prediction and the intra prediction in merge mode) and right-shifting 3 bits. Moreover. _, the intra prediction mode for the infra hypothesis of predictors can be saved for the intra mode codin of the following neighboring CBs if they are intra coded.

|0183] Inter PDPC mode can apply a PDPC filtering process directly to inter prediction samples (or reconstructed samples of an inter coded€11), sack as in V VC, One flag, namely interPDPCFlag. can be signaled to indicate whether to apply the PDPC filtering process or not. Whe interPDPCFlag is tnre, the prediction samples (or reconstructed samples of an inter coded CU) are further modified in th PDPC process. Inter PDPC mode can be combined with any infer coded modes to farther improve the inter prediction samples. However, in some

embodiments, restrictions can be applie to prohibit the inter PDPC modes from com!ng!ing with certain inter coded modes. In one example, inter PDPC mode can only be applie to regular merge mode and/or sub-block merge mode. In another example, inter PDPC mode cannot be applied to merge skip inode.

J0184] A triangle partition mode for inter prediction, such as in VTM3, can only be applied to€Us that are 8x8 or larger an are coded in skip or merge mode for a€U satisfying these conditions, a C!Mevel flag can be signalled to indicate whether the triangle partition mode is applied or not. When the triangle panion mode is applied, a CO can be split evenly into two triangle-shaped partitions, using either the diagonal split or the anti-diagonal split that are illustrated for example in FIG, 18 A and FIG 18B respectively. Each triangle partition in the CtJ can he inter-predicted using its own motion, in addition, only a uni-prediction can be allowed for each partition. That is, each partition can have one motion vector and one reference index. The uni-prediction motion constraint can be applied to ensure that, same as a conventional bi- prediction only two motion compensated predictions are needed for each CU . The uniprediction motion for each partition can he derived from a uni-prediction candidate list that can he constructed using a construction process. In the construction process, the uni-prediction candidate list can include five uni-prediction motion vector candidates. The urn-prediction candidate list can be derived from seven neighboring blocks including five spatial neighboring blocks and two temporal eo-located blocks.

f0185) if the CU-level flag indicates that the current CU is coded using the triangle partition mode, an index (or triangle partition index) in the range of [0, 39] can be further signalled. Using the triangle partition index, a direction o f the triangle partition (e.g., diagonal or anti-diagonal), as w ell as a moti on fo each of the partitions can be obtained t hrough a look-up table. After each of the triangle partitions is predicted, the sampl values along the diagonal or anti-diagonal edge can be adjusted using a blending processing with adaptive weights.

Accordingly , the prediction signal for the whole CU can be obtained A transform and quantization process can further be applied to the whole CU as i other prediction modes.

Finally, the motion field of a CU that is predicted using the triangle partition mode can be stored in 4x4 units,

(#186] Embodiments of the present disclosure include implicit transform selection methods for an inter PDPC prediction mode, The method can be based on inter PDPC mode and a CIIP mode, for example as proposed for WC

f 0X87] In a case that MTS is not used (e g., disabled by high level syntax (HLS)

dieatrag MTS cannot he applied for coding the current bitstream segment) or an ISP prediction mode is applied, an implicit MIS method ca be used suc as in V VC, When implicit MTS is enabled, for an intra prediction residual, the horizontal transform can be set as DST-7 as long a the block width is smaller than or equal to 16 and greater tha or equal to 4, the vertical transform can be set as DST-7 as long as the block height is smaller than or equal to 16 and greater than or equal to 4.

|M 88j Since inter PDPC mode can be combined with different modes of an inter-coded CU, Such as regular merge mode or sub- lock merge mode, the energy distribution of inter predicted residuals after applying a PDPC filter can he different for different modes. Therefore, different transform designs shoul be considered for the different combinations of inter PDPC mode a i other inter modes. Hie consideration of different transform designs lias not been addressed for inter PDPC mode.

[0189} In die disclosure, inter PDPC mode and/or CUP mode can generate prediction residuals which have similar statistics of an intra prediction residual. Therefore, DST-7 may he a more efficient transform other than DCT-2 In some embodiments, DST-4 may be used to replace DST-7 for certain small block sizes or all block sizes. Further, in some embodiments, PDPC refers to simplied PDPC.

[0190] In the disclosure, the transform design used for inter predicted residuals after applying the PDPC filter can be dependent on the coded information of a current block and neighboring blocks of the current block, which includes but is not limited to inter predictio mode, merge flag, block size, color component, etc.

[0191] Is. one embodiment, when the inter PDPC mode i on, sub-block transform (SBT) is always on/off regardless which inter code modes the inter PDPC is applied to. In another embodiment, when inter PDPC is applied to sub-block merge mode, SBT is allowed. Otherwise, when inter PDPC is applied to the merge mode except the sub-block merge mode, SBT is always off In another embodiment, when inter PDPC is applied to triangle merge mode, SBT is allowed. Alternatively, when interPDPC is applied to triangle merge mode, SBT is not allowed,

[0192] In another embodiment, when inter PDPC mode is on, only a subset of SBT types can be allowed hi a first example, when the inter PDPC mode and a SBT flag are both on, the resi dual partition fe.g., partition that is allowed to have non-zero coefficients) of the current CU is always the rightmost or bottommost partition. In a second example, when the inter PDPC mode and the SBT flag are both on, the leftmost or topmost partition of the current CU is always the zero-residual partition.

[0193] in another embodiment, when the inter PDPC mode is on, only a subset of available transform types can be used. In a first example, when the PDPC mode is on, type~8 discrete cosine transfor (DCT-S) is excluded rom the allowed transform types. For example, when the PDPC mode is on, only type-2 discrete cosine transform (DCT-2) and type-7 discrete sine traufonn (DST-7) can he used for the inter predicted residuals. In a secon example, when the PDPC mode is on, DST-7 is excluded from the allowed transform types. For example, when the PDPC mode is on, only DCT-2 and DCT-8 can be used for the inter predicted residuals. In a third example, when the PDPC mode is on, only DST-7 ca be applied. (0.194J In a fourth example, when. the inter FDPC mode is on, DST-7 is always used as both the horizontal and vertical transform for some block sizes, and DCT is used as both the horizontal and vertical transform for other block sizes. In a first embodiment, implicit transfor scheme (or mode) is applied for the inter FDPC mode. For example, the horizontal transform is set as DST-7 as long as the block width is smaller than or equal to a threshold T, and the vertical transform is set as DST-7 as long as the block height is smaller than or equal to the threshold T. Example values of the threshold T include, but are not limited to 4 pixels, 8 pixel s, 16 pixel s, and 32 pixels. In. a second embodiment implicit transfor scheme can only be applied for a luma component of the current€U, and only DCT-2 and/or TSM can he applie for a chroma

component of the current CU .

(019SJ In another embodiment, when the inter FDPC mode is on, in addition to TSM. two transform schemes can be applied for the prediction residual and the selection is signaled in an example, the two transform schemes can include: (1) DCT-2 as both horizontal and vertical transforms, and (2) DST-7 as both horizontal and. vertical transforms,

|f 19S| In yet another one embodiment, when inter FDPC mode is on, MI ^' S is always on/off regardless which inter coded modes the inter FDPC is applied to.

(01971 A selection of a context that is applied to entropy code an index for transfor signaling (e.g., a flag/ index indicating whether orwhich of DCT2, TSM, DST7, DOTS is applied) can depend on. whether the COP is applied for current block, and/or whether the inter FDPC mode is applied for a current block.

(dI98j The flag of the inter FDPC mode can be context coded and the context used can be dependent on the coded information of a current block and neighboring blocks of the curent block, including but not limited to intra-inter flag, intra mode flag, inter mode flag, skip Sag, merge flag, inter FDPC flag, etc. In one embodiment, only one context is used for the entropy coding of inter FDPC mode in another embodiment M contexts are used for the entropy coding of inter FDPC mode M can fee any positive Integer greater than L such as 2 or 3. in a fast example, if one of the neighboring modes is intr coded intra- inter coded, or inter FDPC coded, a first context is used. O therwise, a second con text Is used. In a second e am le, i f both neighboring modes are intra coded, inira-hiter coded, or inter FDPC coded, the first context is used _* Otherwise If only one of the neighboring modes is intra coded, intra-inter coded, or inter FDPC coded, the second context is used. Otherwise, none of the neighboring modes Is intra coded, intra-inter coded, or inter PDPC coded the thir context is used, 10199] in some embodiments, the M r PDFC mode cannot be used together with Intra Block. Copy (IBC) mode

|0200] In the disclosure, tire weightings applied in the rater PDPC mode (e.g.,, wL, vvT and/or wTL) can depend on coded information, including whether a neighboring block Is coded by intra-inter mode, intra prediction mode, inter prediction mode, skip mode, merge mode, of inter PDPC mode.

|020I] An implicit transform scheme can he used for predictio residuals of CUP. In on embodiment, for predictio residuals of C!IP, the horizontal transform can he set as DST-7 as long as the block width is smaller than or equal to a threshold T, and the vertical transform can be set as DST-7 as long as the block height is smaller than or equal to the threshold T. Example values of the threshold T include, but are not limited to 4 pixels, 8 pixels, 16 pixels, an 32 pixels. In one embodiment, the transfor selection of CUP ca depend on the weightings between intra prediction part ($? _{ ¥ ) and inter prediction part {¾¾«*), I one example, if

w _¾ Wi _ntei· is larger than a given threshold Ti, the horizontal transform is set as DST-7 as long as the block widt is smaller than or equal to a threshold T2, and the vertical transform is set as DST-7 as long as the block height is smaller than or equal to the threshold T2. Example values of the TI can include, but are not limited to 2, 2,5, 3, and 7, Example values of the T2 ca include, but are not limited to 4 pixels, 8 pixels, 16 pixels, and 32 pixels.

|0202| In one embodiment the transform selection of CIIP can depend on the number of intra coded neighboring blocks. In a first example, if both the above and left neighboring blocks are intra coded, th horizontal transform is set as DST-7 as long as the block width is smaller than or equal to a threshold T2, and the vertical transform is set as DST-7 as long as the block height Is smaller than o equal to a threshold T2. Otherwise, DCT2 is used as the horizontal and vertical transforms. Example values of the T2 include, but are not limited to 4 pixels, 8 pixels,

16 pixels, and 32 pixels. In a second example, if more than N of the above and left neighboring blocks axe intra coded, the horizontal transform is set as DST-7 as long as the block width Is smaller than or equal to a threshol T2, and the vertical transform is set as DST-7 as long as the block height is smaller than or equal to a threshold T2, Otherwise, DCT2 Is used as the horizontal and vertical transforms. Example values of the T2 include, but are not limited to 4 pixels, 8 pixels, 16 pixels, an 32 pixels. Example values of N include, but are not limi ted to 1, 2, 3, and 4. |0203] In the disclosure, the weightings (or weighting factors) applied on intra prediction part (Wi _jt a) and weightings applied on inter prediction part (w «) in CUP can also depend on whether neighboring blocks ar coded using the CUP inode and/or the inter PDPC mode in one embodiment, if both the top-right (or top) and bottom-left (or left) neighbori ng blocks are coded «sing the CMP mode, tile is assigned as a first value (e.g , 3). If one of the top-righ an bottom-left neighboring blocks are coded using the CUP mode, the w _in(fS is assigned as a second value (e.g,, 2) If none of the top-right and bottom-left neighboring blocks are coded using the COP mode, then the w¾ _stol is assigned as a third value (e.g,, 1). The value Of can be

assigned according to Example values of N include but are not limited to 2, 4, 8. and 16. In one embodiment, if both the top-right for top) an bottom-left (or left) neighboring blocks are code using the inter PDPC mode, then the w _¾jte , is assigned as a first value (e,g, _; 3). If one of the top-right and bottom-left neighboring blocks are coded using the inter PDPC mode, then the %¾** _» is assigned as a second value (e.g., 2). If none of the top- right and bottom-left neighboring blocks are coded using the inter PDPC mode, the w _i¾(fi5 is assigned as a third value (e.g., 1 ). The value of w _ifltSf can be assigned according to w _¾tr3! e.g., N - w _hta, Example values of M include ut are not limited to 2, 4, 8, and 16.

(0204] in the disclosure, if a filtering process is appli ed on the inter prediction block and the filtering process uses the neighboring reconstructed samples to further adjust the inter prediction samples of the current block, a default primary transform can be applied. In one embodiment, the pie-defined primary transform is DST-7 for both horizontal and vertical transforms. In one embodiment, the predefined primary transform is DCT-2 for both horizontal and vertical transforms in one embodiment, the predefined horizontal primary transform is DST-7 as long as the block width is smaller than o equal to a threshold T. Otherwise, DCT-2 is used. Example values of the threshold T include, but are not limited to 4 pixels, 8 pixels, 16 pixels, and 32 pixels. In one embodiment* ihe predefined vertical primary transform is DST-7 as long as the block height is smaller than or equal to the threshold T. Otherwise, DCT-2 is used.

(0205] In one embodiment, the filtering process can be a boundary filtering process, in which only a few of first rows and/or a few of first columns of inter prediction samples that are adjacent to the boundary of a inter preicfion block can be further adjuste using the neighboring reconstructed samples, but the whole inter prediction block is not modified. In one embodiment, the filtering process can apply position-dependent weightings between the inter prediction samples and the neighboring reconstructed samples used tor the filtering. I one embodiment, impli cit transform scheme can on ly be appl ied lot a luma component of the Met prediction block and: only DCT-2 and/or TSM can be applied for a chroma component of the inter prediction block. In. one embodiment, MTS is not signaled when the filtering process is applied. In a first example, the filtering process refers to the inter-PDPC mode. In a second example, the filtering process refers to the CUP mode,

[0206] Embodiments of the present disclosure include .modifications to an implicit transform. The semantics of MTS related syntax elements, such as in VVC can be confusing, For example, to enable explicit intra MI ^' S, both spsjfot$_enabledjftag and

sps_expiieit_i»ts nira_enahled_flag need to be I However, to enable implicit MTS, spsjmts je»abkd_li»g needs to be I but sps ex licit _i nts intra enafoled flag needs to be 0. In another example, to enable explicit inter MTS, both sps_mt$_ na&ied_ftag and

s s_ex lkit 4s lflter enabk i3ag nee to be 1, but only one coding tool (or one syntax element) is under eontroll

[0207] In the disclosure, MTS selection for intra prediction esi ual (whether DCT-2, implicit MTS or explicit intra MI ^' S) and inter prediction residua! (whether DCT-2, or explicit inter MTS and implicit MTS for SBT) can be indicated using separate syntax elements

[0208] In one embodiment, the following OLS syntaxes are designed lor indicating the

«sage of MTS, as shown i Table 11 for example.

Table 11: Syntaxes elments indicating the usage of MTS

As shown in Table 1 1, spsMnfra mts selection can have a value of 0, 1 , and 2. Whe spS_tntra_fflis_selectton is equal to 0 or 1 , tu mis. jdx is not present in die transform rait syntax for intra coding units , When sps _t ntrajtnis seIeetioH is equal to 2 , in ttsjidx ear be present in the transform unit syntax for intra coding units. Moreover, when sps Intra iHlsjkketwu is equal to 0, implicit MTS is not applied for intra prediction residuals. When

sp$_intra mts_ selection is equal to I, implicit MTS is applied for intra prediction residuals. sps__i«ter__mts_seIectH>«__fIag can have a value of 0 and 1. When sps_infer_.nits_seIeidion__f¾g is equal to 1, tujmtsjdx can be present in the transform unit syntax for inter coding units. When spsMiiierjmts_seteettmt_S»g is equal to 0, to jilts dx is not present in the transform unit syntax for inter coding units. Exemplary syntax designed for indicating the usage of MTS based on the syntax elements in Table 1 1 is shown in Table 12.

^" Fable 12 Syntaxes designe for indicating the usage of MTS

(0209] An example of a modified transformation process for sealed transform

coefficients according to some embodiments is describe below, inputs to this process can include a luma location ( xTbY . yTb Y } specifying the top-left sample of the current luma transform block relati ve to the top-left luma sample of the current picture; a v ariable nTbW specifying the width of the current transform block; a vari able nlbil specifying the height o f the current transform block; a variable cldx specifying tire colour component of the current block; and/or an (nTb V)x(nll>H) aw y d[ x ][ y ] of seale transform coeffici ents wi th

x.~ O-.nTbW ~ 1, y ~O..itTbH ~ 1. An ontpnt of this process is foe (at¾W)x(nTbH) array *t ][ y 1 of residual samples with x ~ O.mTbW ~ 1, y O. tTbH— 1.

(0 19] The variable impk tMtsEnabled can be derived as follows. If one of a plurality of conditions is hue, ImplicitMisEoahled is set equal to L The plurali ty of condi tions can include IntraSubPartitionsSplitType is not equal to iSP MQ JSPLIT; cit sbt flag is equal to 1 and Max( nTbW, riTbH } is less than or equal to 32 and sps inter mis selection flag is equal to 1 ; and/or sps.jntrajrats_seleetion is equal to 1 and CuP:re<iMode[ 0 ][ xTbY ]( yTbY ] is equal to MODE 1NTRA and Ifnst idx[ xO 1 yO 1 is equal to 0 and intra raip flag] x0 jf yO ] is equal to 0 Otherwise, impficitMtsEnabled. is set equal to 0.

fl2I l| in another embodiment, the exemplary HLS syntaxes in Table 13 are designed tor indicating th usage of MTS, where implicit MTS can be enable for SBT without enabling explicit MTS.

Table 13 Syntaxes elmcnts designed for indicating the usage of MTS

As show» in Table 13, sps iitra _^ mts selection can have a value of 0. 1 , or 2. When sj s__i«tra jfntsjse!eetio» is equal to D or 1. tu ruts Jdx is not present In the transform unit syntax for intra coding units. When sps ntrajrntsjs ection is equal to 2, tu mis Jdx can be present in the transform uni syntax for intra coding units. Moreover, when sps_lntra_ints_srfectii is equal to 0, implicit MTS is not applied for intra prediction residuals. When

sps_*»tr»_:«ife selectiei is equal to 1 implicit MTS is applied for intra prediction residuals. spsJnterjratsjselecf!oR can have a value of 0, I, or 2. When s _|i sJtiter_mts seleetion is equal to 0 or 1, tn nits Jdx can he present in the transform unit synta for inter coding units. When sps nter nits selecii0» is equal to 2, tujnats dx can be present in. the transform taut syntax for inter coding units. Further, when sps »ter__mts_selectioii is equal to 0, implicit MTS is not: applie for inter prediction residuals. When sps iite mts seleetion is equal to 1, implicit MTS is applied for inter prediction residuals. An exemplary synatax designed for indicting the usage of MTS based on the syntax elements in Table 13 is shown in Table .14 for example.

Table 14; Syntaxes designed for Indicating the usage of MTS

10212] An examp l e of modi fle transformation pro ces s for scaled transform

coefficients for some embodiments is described below. Inputs to this process can include a luma location ( xThY, yTbY ) specifying the top-left sample of the current luma transform block relative to the top-left kuna sample of the current picture: a variable nTbW specifying the width of the current transform block; a variable nTbli speci fying the height of the current transform block; a variable cldx. specifying the colour component of the current block; and/or an

(nTbW)x(nl¾B) array df x J[ y J of scaled transform coefficients with x ~ CLnTbW - 1, y ~ O pTMI - I An output of this proces is the (nXbW)x(»XbH) array r x ][y ] of residual samples with x ~ 0..n TbW ^~ l, y ^~ 0;.»TbH - 1,

f02l3j The variable implicitMtsEnabled can be derived as follows. If one of a plurality of conditions is true, implicitMtsEnabled Is set equal to 1 , The plurali ty of condi tions can include IntraSribPattjtionsSpiitType is not equal to ISPJNOJSPUT; carsbt iag is equal to 1 and Max( nTbW, nTbll ) is less than or equal to 32 and sps ntet mts_seleetion is no equal to 0; rind/or spsffiritfa nts_srilection Is equal to I arid CuFtedMode[ 0 ][ xTbY ] vTbY j is equal to MODE JNTRA and Ifnst Jdxl xO ][ yO ] is equal to 0 an intxa Bΐίr J!ag[ x0 ][ yO j is equal to 0. Otherwise.. implieiiMtsEi bied is set equal to 0.

f 0234] In the disclosure, a transform selection for ISP coded blocks can be controlled by

MTS related H S to i ndicate whether implici t MTS or DCT-2 is applied. An example of a modified transformation process for scaled transform coefficients according to some

embodiments is described below, inputs to this process ca include a luma location

( xTbY, yfbY ) specifyin the top-left sample of the current luma transform block relative to the top-left luma sample of die current picture; a variable riXbW specifying the width of the current transform block; a variable iiTbH specifying the height of the current transform block; a variable cldx specifying the colour component of the current block; and/or an (nTbW)x(nTbH) array d[ x ] y j of scaled transform coefficients with ^:::: (k.nTbW - 1, y ^::: OmTbl l - 1. An output of this process is the (nXbW)x(nTI>B) array r[ x ][ y j of residual samples with x ~ {LnTbVV - 1, y = O .nTbH - 1.

ji2tS| The variable irapii tMtsEnabled can be derived as follows. If one of a plurality of conditions is true, imphcitMts Enabled is set equal to 1. The plurality of conditions can include intraSubPartitionsSplitType is not equal to ISP_NO_.SP.OT and spsfyntra_mts_selection is not equal to 0; cu_sbtjflag is equal to 1 and Max( uTbW, uTfeH ) is less than or equal to 32 and sps Mer ots se lection is not equal to 0; and/or sps Jntra_mfs_selection is equal to 01 and CuPredModef 0 ]f xTbY ][ y ^' TbY ] is equal to M0DEJMTRA and Ifnstjdxf x0 ][ yO j is equal to 0 and infra mip flag[ xO ][ yO ] is equal to 0. Otherwise, miplicitMtsEnabled is set equal to 0.

j 0216] In some embodiments, the PDPC refers to a simplified PDPC mentioned above or a variant thereof in some embodiments, PST-4 may be used to replace DS ~7 for certain small block sizes or all block sixes.

j 02171 in the disclosure, an implicit translornr’ can indicate a transform schemeselecting a group of non~DCT2 transforms (such as DST~i, PCT-S, DST~7, DCT~8. DST-4, DCT-4) without any transform index signaling. For example, a group of non-DCT2 transforms can be selected using already coded information that is available to both encoder and decoder, including but not limited to iutra prediction mode (Planar mode, DC mode, Angular modes), block size, block width, block height, block aspect ratio, block area size, Intra coding mode (whether MRL, IS P, MIP is used), position of selected spatial Merge candidates (top Merge candidate, left Merge candidate), and/or inter prediction mode (inter-PDPC mode, CHP inode etc,).

18 18] In file disclosure, an“explicit transform’ can indicate a transfonn scheme selecting one transform from a group of transform type candidates (such as DCT-2, DST-1, DCT-S, DST-7, DCT-8, DST-4, DCT-4) with an index signaled to indicate which transform type is selected.

[02191 In the disclosure, explicit MTS applied for an intra rediction residual can he called explicit intra M TS, and MTS applied for an inter prediction residual can he called explicit inter MTS,

|0220J FIG. 19 shows a flow chart outlining a process (1900) according to an

embodiment of the disclosure. FIG. 20 shows a flow chart outlining a proce ss (2000) according to an embodiment of the disclosure. FiG. 21 shows a flow chart outlining a process ( 100) according to an embodiment of the disclosure i n various embodiments. _, the process (1900) , the process (2000), an the process (2100) can he executed by processing circuitry', such as the processing circuitry in the terminal device (110), (120), (130) an (1 0), the processing circuitry that performs functions of the video encoder (203), the processing circuitry that performs functions of the video decoder (210), the processing circuitry that performs functions of th video decoder (310), the processing circuitr that performs functions of the video encoder (403), and the like, In some embodiments, the process (1900) , the process (2000), and the process (2100) can be implemented in software instructions, thus when the processing circuitry executes the software instructions, the processing circuitry performs the process (1900), the process (2000), and/or the process (2100) respectively.

10221 ] As shown in FiG. 19, the process ( 1 00) starts at (S 1901 ) an proceeds to

($1910), At ($1910), prediction information of a current block in a current picture can be decoded from a coded video bitstream _* The prediction information is Indicative of an inter prediction mode

f 0222] At (S 1920), whether a filtering process is applied on the current block can be determined. The filtering process can adjust Inter prediction samples of the current block based on neighboring reconstructed samples of the current block. In some embodiments, the filtering process can be operate based on a position dependent prediction combination fPDPC) mode or a combined inter and intra prediction (COP) mode. (0223) At (S 1930), a primary transform can be performed for a transform Mock according to a pre-defined primary transform type based on the filtering process being determined to be applied on the current block, where the transform block is partitioned from the current block

|0224] In some embodiments, the primary transform type can be a type-? discrete sine transform (DST~7) mode for a horizontal transform that is applied to the transform block responsive to a width of th current block being smaller than or equal to a threshold value. The primary transform type can he the DST-7 mode for a vertical transform that is applied to th transform block responsive to a height of the current block being smaller than or equal to the threshold value. The threshold value can Include one of 4 pixels _* 8 pixels, 16 pixels, or 32 pixels

[8225] In some embodiments, the primary transform type can be a type-2 discrete cosine transform (DCT-2) mode for a horizontal transform that is applied to the transform block responsi ve to a width of the current block being bigger tha to a threshold value. The primary transform type can he the DCT-2 mode for a vertical transform and can he applied to the transform block responsive to a height of the current block being larger than the threshold value. The threshold value can include one of 4 pixels, 8 pixels, 16 pixels, or 32 pixels

[0226] As s ow in FIG 20, the process (2000) starts at (82001) an proceeds to

(S20I.0), At (82010), predic tion information o f a current block can he acquired from a coded video bitstream.

[0227j At (82020), whether the prediction information indicates (i) an inter prediction merge mode, and (I i) a combined inter and intra prediction mode can be determined.

[0228] At ($2030), an intra prediction mode can he determined from a intra prediction mode candidate list responsive to the prediction information indicating the inter prediction merge mode an the CIIP mode.

(8229) At ($2040), intra prediction information can he determined according to the intra prediction mode and inter prediction information according to the inter prediction merge mode.

10230 J At ($2050), a weighting factor can he determined responsive to neighboring blocks of the current block being coded accordin to the CUP mode or an inter position dependent prediction combination (PDPC) mode. 0231 j In some e bodi ents _· , the weighted inter prediction information is based on the inter prediction information and a constant value minus the weighting factor, where the constant value includes one of 2, 4, 8, or 16.

[0232] In some embodiments, die weighting factor ca be 3 responsive to both top- oght/top and botom-lefi/left neighboring blocks of the current block being code using the CUP mode. In some embodiments, the weighting factor can he 2 responsiv to on of di top- right/top and the bottomdrfMefi neighboring blocks of the current block being coded using the COP mode. In some embodiments, the weighting factor can be 1 responsive to the top-riglidtop and die bottom-left/lefl neighboring blocks of the current block being coded using the CUP mode

(0233 In some embodiments, the weighting factor can be 3 responsive to both top- righf/top and bottom-IefMeff neighboring blocks of the current block being coded using ie PDPC mode. The weighting factor ca be 2 responsive to one of the topfogbt/top and the botom-left/left neighboring blocks of the current block being coded using the PDPC mode. The weighting factor can be I responsive to none of die top-right/top and d e bottom-ieft left neighbori ng blocks of the current block being code using the PDPC mode

(0234] At (82060), CMP prediction information can be determined based o a su a of weighted intra prediction information and weighted inter prediction information, where the weighte intra prediction information is based on the k ¾ prediction information and die weighting factor, and the weighted inter prediction Information is based on the inter prediction information and the weighting factor.

10235] The process (2000) then proceeds to ($2070) where a sample of d e current block can be reconstructed according to die CUP prediction information.

10236] FIG. 21 illustrates the process (2100) that starts at (S2I0I) and proceeds to

(52! 10). At (S2110), transform block signaling informaiiou can be acqui ed horn a coded video bitstream. Tire transform block signaling information can include first information associated with an inter prediction transform and second information associated with an intra prediction transform.

(12371 At (52126), a first value of the first information and a secon value of die secon information can be determined. [02383 At (S2130), a first transform block coded in an inter prediction mode can. be transformed according to the first value and a first pre-defined transform type in an implicit multiple transform selection (MTS) inode.

f 0239] At (S2140), a second transform block coded in an intra prediction mode can be transformed according to a second value and a second pre-defined transform type in the implicit MTS mode.

[0240] In some embodiments, foe first value of the first Information can be equal to 1 and the second value of the second informati on can be equal to L

[0241] In some embodiments, tire first value of the first information can he greater than G, and the second value of the second information can be equal to I .

[0242] In some embodiments foe second transform block coded in the intra prediction inode can be transformed according to the second value, th second pre-defined transform type in the implicit MTS mode, and a coding unit drat includes the second transform block being intra sub-partitioning (ISP) coded. The second value is larger than 0.

f0243| The proposed methods may be used separately or combined in any order. Further, each of the methods (or embodiments), encoder, and decoder may be implemented by processin circuitry (tog,, one or more processors or one or more integrated circuits}. In one example, the one or more processors execute a prograta that is stored i anon-transitory computer-readable medium. For example, the techniques described above, can he implemented as computer software using computer-readable instructions and physically stored in one or more computer- readable media. FIG 22 shows a exemplary computer system (2200) suitable for implementing certain embodiments of the disclosed subject matter.

f 0244] The computer software can be coded using any suitable machine code or computer language, that may be subject to assembly; compilation, linking, or like mechanisms to create code comprising instructions that can be executed directly, or through interpretation, iniero-eode execution, and the like, by one or more computer central processing units (CPUs), Graphics Processing Units (GPUs), and foe like

(0245] The instructions can. be executed on. various types of computers or components thereof including, for example, personal computers, tablet computers, servers, smartphones, gaming devices, internet of things devices, and the like,

[0240] The components shown in FIG. 22 for computer system (2200) are exemplary in nature and are not intended to suggest any limitation as to the scope of use or functionality of foe computer software implementing embodiments of the present disclosure. Neither should the configuration of components he interpreted as having any dependency or requirement relating to any one or combination of components ilfusimted i the exemplary embodiment of a computer system. (2200).

|0 4 ] Compute system (2200) may include certain human int rface input devices.

Such a human interface input device may he responsive to input by one or more human users through, for example, tactile input (such as: keystrokes., swipes, data glove movements), audio input (such as: voice, clapping), visual inpu (such as; gestures), olfactor input (not depicted). The human interface devices can also be used to capture certain media not necessarily directly related to conscious input by a human, such as audio (such as: speech, music, ambient sound), images (such as: scanned images, photographic images obtain from a still image camera), video (such as two-dimensional video, three-dimensional video including stereoscopic video).

)0248j Input human interface devices may include one or more of (only one of each depicted): keyboard (2201 ), mouse (2202), trackpad (2203), touch screen (2210), dam-glove (not shown), joystick (2205), microphone (2206), scanner (2207), camera (2208).

(02491 Computer system (2200) may also include certain human interface output devices. Such human interlace output de vi ces may be stim ulating the senses of one or more h uman users through, for example, tactile output, sound, light, and sme!l/tasfe. Such human interface output devices may include tactile output devices (for example tactile feedback by the touch-screen (2210), data-glove (not shown), or j oystick (2205), but there can also be tactile feedback devices that do not serve as input devices), audio output devices (such as: speakers (2209), headphones (not depicted)), visual output devices (such as screens (2210) to include CRT screens, LCD screens, plasma screens, OL8D screens, each with or without touch-screen input capability, each with or without tactile feedback capability . some of which may be capable to output two dimensional visual output or more than three dimensional output through means such as siereogmphic output; virtual-reality glasses (not depicted), holographic displays and smoke tanks (not depicted)), an printers (not depicted).

(8250 j Compute system (2200) eau also include human accessible storage devices and their associated media such as optical media including CD/DVD ROM/RW (2020) with

CD/DVD or the Eke media (22 1), thumb-drive (2222), removable har drive or solid state drive (2223), legacy magnetic media such as tape and floppy disc (not depicted), specialized

ROM/ASIC/FLD based devices such as security dongles (not depicted), and the like. m

[0251] Those skillet! in. the ait should also understand that term "computer readable media” as used is connection with the presently disclosed subject matter does not encompass transmission media, carrier waves, or other iransiiory signals.

[0252] Computer system (2200) can also include an interface to one or more

communication networks. Networks can for example be wireless, wireline, optical. Networks can further be local wide-area, metropolitan, vehicular and industrial real-time, delay-tolerant, and so on. Examples of networks include local area networks such as Ethernet, wireless L ANs, cellular networks to include GSM, 3G, 46, SG, LIE and the like, TV wireline or wireless wide area digital networks to include cable TV, satellite TV, and terrestrial broadcast TV, vehicular and industrial to include CANBus, and so forth, Certain networks commonly require external network interface adapters that attache to certain general purpose data ports or peripheral buses (2249) (such as, for example U SB ports of the computer system (2200)); others are commonly integrated into the core of the computer system (2200) by attachment to a system bus as describe below (for example Ethernet interface into a PC computer system or cellular network interface into a smartphone computer system). Using any of these networks, computer syste (2200) can communicate with other entities. Such communication can be uni-directional, receive only (for example, broadcast TV), uni-directional send-only (fo example CA hus to certain CANbus devices) or bi-directional for example to other computer systems using local or wide area digital networks. Certain protocols and protocol stacks can be used on each of those networks and network interfaces as describe above.

[0253] Aforementioned human interface devices, human-accessible storage devices, and network interlaces can he attached to a core (2240 ) of the computer sy stem (2200).

[0254] The core (2240) can include oue or more Central Processing Units (CPU) (2241), Graphics Processing Units (GPU) (2242), specialized programmable processing units in the form of Field. Programmable Gate Areas (FPG ) (2:243), hard ware accelerator s for certain tasks (2244), and so forth, These devices, along with Read-only memory (ROM) (2245), Random- access memory (2246), internal mass storage such as internal non-user accessible hard drives, SSDs, and the like (2247), may be connected through a system bus (2248). in some computer systems the system bus (2248) can be accessible in the form of one or more physical plugs to enable extensions by additional CPUs, GPU, an the like. The peripheral devices can be attached eithe directl to the core’s syste bus (2248), or through a peripheral bus (2249). Architectures for a peripheral bus include PCI, USB, and the like. m

f!255J CPUs (2241), GPUs (2242), P.PGAs (2243), and accelerators (2244) can execute certain instructions that, in combination, can make up the aforementioned computer code. Thatcomputer code can be stored in ROM (2245) or RAM (2246) Transitional data can be also be stored in RAM (2246), whereas permanent data can be stored for example, in the internal mass storage (2247) Past storage and retrieve to any of the memory devices can he enabled through the use of cache memory, that can be closely associated with one or more CPU (2241), GPU (2242), mass Storag (2247), ROM (2245), RAM (2246), and the like

{0256} The computer readable media can have computer code thereon for performing various computer-impiemented operations. The media and computer code can be those specially designed and constructe for th purposes of the present disclosure;, or they can be of the hind well known and available to those having skill in the computer software arts.

{0257} As an exampl and not by way of limitation, the computer system ha ing architecture (2200), and specifically the core (2240) can provide functionality as a result of processors) (Including CPUs, GPUs, FS?GA, accelerators, and the like) executing software embodied in one or more tangible, computer-readable media. Such computer-readable medi can be media associated with user-accessible mass storage as introduced above, as well as certain Storage of the core (2240) that are oftion-iransitory nature, such as core-internal mass storage (2247) or ROM (2245) The software implementing various embodiments of the present disclosure can be stored in such devices and executed by core (2240). A computer-readable medium can include one or more memory devices or chips, according to particular needs. The software can cause the core (2240) and specifically the processors therein (including CPU, GPl¾ FPGA, and the like) to execute particular processes or particular parts of particular processes described herein, including defining data structures store in RAM (2246) an modifying such data structures according to the processes defined by the software _» In addition or as an alternative, the computer system can provide functionality as a result of logic hardwired or otherwise embodied in circuit (for example; accelerator (2244)), which can operate in place of or together with software to execute particular processes or particular parts of particular processes described herein. Reference to software can encompass logic, and vice versa, where appropriate. Reference to a computer-readable media can encompass a circuit (such as an integrated circuit (IQ) storing software for execution, a circuit embodying logic for execution, or both, where appropriate. The present disclosure encompasses any suitable combination of hardware and software. Appendix A Acronyms

JEM: joint exploration model

VVC: versatile video coding

BMS; ben chm ark set

MV: Motion Vector

HE VC: High Efficiency Video Coding

SEE Supplementary Enhancement Information ViJI: Video Usability Information

G OPs: Groups of Pictures

TU$: Transform Units,

PUs: Prediction Units

CTUsr Coding Tree Units

(/ I Bs: Coding Tree Blocks

PBs; Prediction Blocks

HRD: Hypothetical Reference Decoder

SNR: Signal Noise Ratio

CPUs: Central Processing Units

GPUs: Graphics Processing Units

CRT; Cathode Ray Tube

LCD: Liquid-Crystal Display

GLED; Organic Light- Emitting Diode

CD: Compact Disc

DVD: Digital Video Disc

ROM: Read-Only Memory

RAM: Random Access Memory

ASIC AppBeaiion-Speeife Integrated Circuit

FED: Programmable Logic Device

LAN; Local Area Network

GSM: Global System for Mobile communications

LIE; Long-Term Evolution

CANBus: Controller Area Network Bus

USB; Universal Serial Bus 7!

PCI: Peripheral Component Interconnect

FPGA: Field Programmable Gate Areas

SSD; solid-state drive

IC; integrated Circuit

CU : Coding Unit

}0258j While this disclosure has described several exemplary embodiments, there are alterations;, permutations, and various substitute equivalents, which fail within the scope of the disclosure, it will thus be appreciated that those skille in the art will be able to devise numerous systems and methods which, although not explicitly shown or described herein, embody the principles of the disclosure and are thus within the spirit and scope thereof.