Latency constrained template-based operations

Abstract

Systems, methods, and instrumentalities are disclosed for delaying constrained template-based operations. A device (e.g., a video decoding device, a video encoding device) may perform fast template reconstruction. The device may obtain motion information associated with the first block. The device may obtain a list of motion vector candidates for the first block. The motion information may be determined based on the list of motion vector candidates. The device may partially reconstruct the first block based on the motion information associated with the first block. The motion information used to partially reconstruct the first block may be unrefined motion information. The device may obtain a template for the second block based on the partially reconstructed first block. The device may reconstruct the second block using a template-based coding tool. The reconstruction of the second block may be performed before or in parallel (e.g., independently) with the refined motion information reconstructing the first block.

Description

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims the benefit of European Patent Application No. 22305508.8 filed on April 8, 2022, the contents of which are incorporated herein by reference in their entirety. Background Art

[0003] Video coding systems may be used to compress digital video signals, for example, to reduce the storage and / or transmission bandwidth required for such signals. Video coding systems may include, for example, block-based, wavelet-based, and / or object-based systems. Summary of the invention

[0004] Disclosed are systems, methods, and means for time-delay constrained template-based operations. A device (e.g., a video decoding device, a video encoding device) may perform fast template reconstruction. For example, the device may obtain motion information associated with a first block. The device may obtain a motion vector candidate list for the first block. The motion information associated with the first block may be determined based on the motion vector candidate list. The device may partially reconstruct the first block based on the motion information associated with the first block. The motion information used to partially reconstruct the first block may be unrefined and / or may be initial motion information. The device may obtain a template of a second block based on the partially reconstructed first block (e.g., before performing a full reconstruction of the first block using the refined motion information). The template may include partially reconstructed samples of the first block adjacent to the second block. The device may reconstruct the second block using a template-based coding tool (e.g., based on the obtained template of the second block). The reconstruction of the second block using the template may be performed before or in parallel with the reconstruction of the first block using the refined motion information (e.g., fully reconstructing the first block). The second block may be reconstructed independently of the fully reconstructed first block (eg, the second block is reconstructed based on a template, which may occur before or in parallel with fully reconstructing the first block using the refined motion information).

[0005] For example, the device may refine initial motion information associated with the first block (e.g., to fully reconstruct the first block). The device may reorder the motion vector candidate list of the first block, e.g., based on adaptive merge candidate reordering (ARMC). The first block may be fully reconstructed based on the reordered motion vector candidate list, e.g., in parallel with reconstruction of the second block. The first block may be reconstructed, e.g., based on a prediction of the first block and a residual of the first block (e.g., in parallel with reconstruction of the second block).

[0006] The device may obtain first motion information associated with a first sub-block and second motion information associated with a second sub-block. The device may be configured to determine a first template of the first sub-block. The device may be configured to determine the first template of the first sub-block using the first motion information associated with the first sub-block. The first motion information may include a first portion of motion information associated with residual information and a second portion of motion information not associated with the residual information. The first template may be determined using the second portion of motion information not associated with the residual information. The device may determine a second template of the second sub-block. The device may determine the second template of the second sub-block using the second motion information associated with the second sub-block. The second motion information may include a third portion of motion information associated with the residual information and a fourth portion of motion information not associated with the residual information. The second template may be determined using the fourth portion of motion information not associated with the residual information. The device may be configured to generate a first reconstructed sub-block, for example, using a first template and an operation based on the first template. The device may be configured to generate a second reconstructed sub-block, for example, using a second template and an operation based on the second template. The operation based on the first template may be an operation based on the second template. The template-based operation may be template matching (TM) or ARMC.

[0007] The device may be configured to obtain a video block. The video block may include a first sub-block and a second sub-block. The device may be configured to determine first motion information associated with the first sub-block and second motion information associated with the second sub-block. The device may be configured to determine to use a template-based operation for the first sub-block and the second sub-block. The device may be configured to encode the first sub-block and the second sub-block using the template-based operation. The device may be configured to encode the block based on the first set of motion information and / or the second motion information.

[0008] The systems, methods, and means described herein may relate to decoders. In some examples, the systems, methods, and means described herein may relate to encoders. In some examples, the systems, methods, and means described herein may relate to signals (e.g., signals from encoders and / or received by decoders). A computer-readable medium may include instructions for causing one or more processors to perform the methods described herein. A computer program product may include instructions that, when executed by one or more processors, cause one or more processors to perform the methods described herein. BRIEF DESCRIPTION OF THE DRAWINGS

[0009] Figure 1A is a system diagram illustrating an example communication system in which one or more disclosed embodiments may be implemented.

[0010] Figure 1B is an example of a method that can be used according to an embodiment of the present invention. Figure 1A A system diagram of an example wireless transmit / receive unit (WTRU) for use within the illustrated communication system.

[0011] Figure 1C is an example of a method that can be used according to an embodiment of the present invention. Figure 1A System diagram of an example Radio Access Network (RAN) and an example Core Network (CN) for use within the illustrated communication system.

[0012] Figure 1D is an example of a method that can be used according to an embodiment of the present invention. Figure 1A System diagram of yet another example RAN and yet another example CN for use within the illustrated communication system.

[0013] Figure 2 An example video encoder is illustrated.

[0014] Figure 3 An example video decoder is illustrated.

[0015] Figure 4 Examples of systems in which various aspects and examples may be implemented are illustrated.

[0016] Figure 5 An example decoding pipeline for inter blocks is illustrated.

[0017] Figure 6 An example TM-based decoding pipeline is illustrated.

[0018] Figure 7 An example of template matching performed on a search area around an initial motion vector is illustrated.

[0019] Figure 8 An example of a diamond-shaped area in the search area is illustrated.

[0020] Fig. 9 An example template and a reference sample of the template in a reference picture are illustrated.

[0021] Fig.10 An example template for a block having sub-block motion using motion information of a sub-block of a current block and a reference sample of the template are illustrated.

[0022] Fig.11 An example of spatially neighboring blocks for deriving spatial merging candidates is illustrated.

[0023] Fig.12 An example fast template reconstruction pipeline is illustrated.

[0024] Fig.13 An example block template reconstruction is illustrated.

[0025] Fig.14 An example adaptive reordering (ARMC) of merging candidate workflows is illustrated.

[0026] Fig.15 An example candidate propagation is illustrated.

[0027] Fig.16 Example motion vector propagation is illustrated.

[0028] Fig.17 An example of adaptive merging candidate reordering and template matching TM operation coordination is illustrated.

[0029] Fig.18 Examples of spatial motion vector candidates are illustrated.

[0030] Fig.19 An example of non-adjacent motion vector updating is illustrated.

[0031] Fig. 20 An example of a delay-space candidate update pipeline is illustrated.

[0032] Fig.21 An example of block delay in reconstructed samples is illustrated. DETAILED DESCRIPTION

[0033] A more detailed understanding may be obtained from the following description given by way of example in conjunction with the accompanying drawings.

[0034] Figure 1A 1 is a diagram illustrating an example communication system 100 in which one or more disclosed embodiments may be implemented. The communication system 100 may be a multiple access system that provides content such as voice, data, video, messaging, broadcast, etc. to multiple wireless users. The communication system 100 may enable multiple wireless users to access such content through sharing of system resources (including wireless bandwidth). For example, the communication system 100 may employ one or more channel access methods such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal FDMA (OFDMA), single carrier FDMA (SC-FDMA), zero tail unique word DFT spread OFDM (ZT UW DTS-s OFDM), unique word OFDM (UW-OFDM), resource block filtered OFDM, filter bank multi-carrier (FBMC), etc.

[0035] like Figure 1AAs shown, the communication system 100 may include wireless transmit / receive units (WTRUs) 102a, 102b, 102c, 102d, RAN 104 / 113, CN 106 / 115, public switched telephone network (PSTN) 108, Internet 110 and other networks 112, but it should be understood that the disclosed embodiments contemplate any number of WTRUs, base stations, networks, and / or network elements. Each of the WTRUs 102a, 102b, 102c, 102d may be any type of device configured to operate and / or communicate in a wireless environment. By way of example, the WTRUs 102a, 102b, 102c, 102d (any of which may be referred to as a “station” and / or “STA”) may be configured to send and / or receive wireless signals and may include user equipment (UE), a mobile station, a fixed or mobile subscriber unit, a subscription-based unit, a pager, a cellular phone, a personal digital assistant (PDA), a smart phone, a laptop, a netbook, a personal computer, a wireless sensor, a hotspot or Mi-Fi device, an Internet of Things (IoT) device, a watch or other wearable device, a head-mounted display (HMD), a vehicle, a drone, medical devices and applications (e.g., remote surgery), industrial devices and applications (e.g., robots and / or other wireless devices operating in an industrial and / or automated process chain environment), a consumer electronic device, a device operating on a commercial and / or industrial wireless network, etc. Any of the WTRUs 102a, 102b, 102c, and 102d may be interchangeably referred to as a UE.

[0036] The communication system 100 may also include a base station 114a and / or a base station 114b. Each of the base stations 114a, 114b may be any type of device that is configured to wirelessly interface with at least one of the WTRUs 102a, 102b, 102c, 102d to facilitate access to one or more communication networks, such as the CN 106 / 115, the Internet 110, and / or other networks 112. By way of example, the base stations 114a, 114b may be a base transceiver station (BTS), a Node B, an eNode B, a Home Node B, a Home eNode B, a gNB, an NR Node B, a site controller, an access point (AP), a wireless router, and the like. While the base stations 114a, 114b are each depicted as a single element, it will be appreciated that the base stations 114a, 114b may include any number of interconnected base stations and / or network elements.

[0037] The base station 114a may be part of the RAN 104 / 113, which may also include other base stations and / or network elements (not shown), such as a base station controller (BSC), a radio network controller (RNC), a relay node, etc. The base station 114a and / or the base station 114b may be configured to send and / or receive wireless signals on one or more carrier frequencies (which may be referred to as cells (not shown)). These frequencies may be in a licensed spectrum, an unlicensed spectrum, or a combination of licensed and unlicensed spectrums. A cell may provide coverage of wireless services to a specific geographic area, which may be relatively fixed or may change over time. The cell may be further divided into cell sectors. For example, a cell associated with the base station 114a may be divided into three sectors. Therefore, in one embodiment, the base station 114a may include three transceivers, i.e., one transceiver for each sector of the cell. In an embodiment, the base station 114a may employ multiple-input multiple-output (MIMO) technology and may utilize multiple transceivers for each sector of the cell. For example, beamforming may be used to send and / or receive signals in a desired spatial direction.

[0038] The base stations 114a, 114b may communicate with one or more of the WTRUs 102a, 102b, 102c, 102d over an air interface 116, which may be any suitable wireless communication link (e.g., radio frequency (RF), microwave, centimeter wave, micrometer wave, infrared (IR), ultraviolet (UV), visible light, etc.). The air interface 116 may be established using any suitable radio access technology (RAT).

[0039] More specifically, as noted above, the communication system 100 may be a multiple access system and may employ one or more channel access schemes such as CDMA, TDMA, FDMA, OFDMA, SC-FDMA, etc. For example, the base station 114a in the RAN 104 / 113 and the WTRUs 102a, 102b, 102c may implement a radio technology such as Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access (UTRA), which may use Wideband CDMA (WCDMA) to establish the air interface 115 / 116 / 117. WCDMA may include communication protocols such as High Speed ​​Packet Access (HSPA) and / or Evolved HSPA (HSPA+). HSPA may include High Speed ​​Downlink (DL) Packet Access (HSDPA) and / or High Speed ​​UL Packet Access (HSUPA).

[0040] In an embodiment, the base station 114a and the WTRUs 102a, 102b, 102c may implement a radio technology such as Evolved UMTS Terrestrial Radio Access (E-UTRA) that may establish the air interface 116 using Long Term Evolution (LTE) and / or Advanced LTE (LTE-A) and / or Advanced LTE Pro (LTE-APro).

[0041] In an embodiment, the base station 114a and the WTRUs 102a, 102b, 102c may implement a radio technology such as NR radio access, which may establish the air interface 116 using New Radio (NR).

[0042] In an embodiment, the base station 114a and the WTRUs 102a, 102b, 102c may implement multiple radio access technologies. For example, the base station 114a and the WTRUs 102a, 102b, 102c may together implement LTE radio access and NR radio access, for example using the dual connectivity (DC) principle. Thus, the air interface used by the WTRUs 102a, 102b, 102c may be characterized by multiple types of radio access technologies and / or transmissions transmitted to / from multiple types of base stations (e.g., eNBs and gNBs).

[0043] In other embodiments, the base station 114a and the WTRUs 102a, 102b, 102c may implement radio technologies such as IEEE 802.11 (i.e., Wireless Fidelity (WiFi)), IEEE 802.16 (i.e., Worldwide Interoperability for Microwave Access (WiMAX)), CDMA2000, CDMA2000 1X, CDMA2000 EV-DO, Interim Standard 2000 (IS-2000), Interim Standard 95 (IS-95), Interim Standard 856 (IS-856), Global System for Mobile Communications (GSM), Enhanced Data rates for GSM Evolution (EDGE), GSM EDGE (GERAN), etc.

[0044] Figure 1AThe base station 114b in the may be, for example, a wireless router, a Home NodeB, a Home eNodeB, or an access point, and may utilize any suitable RAT to facilitate wireless connectivity in a local area, such as a business location, a home, a vehicle, a campus, an industrial facility, an air corridor (e.g., for use by drones), a road, and the like. In one embodiment, the base station 114b and the WTRUs 102c, 102d may implement a radio technology (such as IEEE 802.11) to establish a wireless local area network (WLAN). In an embodiment, the base station 114b and the WTRUs 102c, 102d may implement a radio technology (such as IEEE 802.15) to establish a wireless personal area network (WPAN). In yet another embodiment, the base station 114b and the WTRUs 102c, 102d may utilize a cellular-based RAT (e.g., WCDMA, CDMA2000, GSM, LTE, LTE-A, LTE-A Pro, NR, etc.) to establish a picocell or a femtocell. As Figure 1A As shown, base station 114b may have a direct connection to Internet 110. Therefore, base station 114b may not need to access Internet 110 via CN 106 / 115.

[0045] The RAN 104 / 113 may be in communication with the CN 106 / 115, which may be any type of network configured to provide voice, data, applications, and / or Voice over Internet Protocol (VoIP) services to one or more of the WTRUs 102a, 102b, 102c, 102d. The data may have different quality of service (QoS) requirements, such as different throughput requirements, latency requirements, error tolerance requirements, reliability requirements, data throughput requirements, mobility requirements, etc. The CN 106 / 115 may provide call control, billing services, mobile location-based services, prepaid calling, Internet connectivity, video distribution, etc., and / or perform advanced security functions, such as user authentication. Although not described in detail in the text, the CN 106 / 115 may be configured to provide voice, data, applications, and / or Voice over Internet Protocol (VoIP) services to one or more of the WTRUs 102a, 102b, 102c, 102d. The data may have different quality of service (QoS) requirements, such as different throughput requirements, latency requirements, error tolerance requirements, reliability requirements, data throughput requirements, mobility requirements, etc. The CN 106 / 115 may provide call control, billing services, mobile location-based services, prepaid calling, Internet connectivity, video distribution, etc., and / or perform advanced security functions, such as user authentication. Figure 1A Although not shown in the figure, it will be appreciated that the RAN 104 / 113 and / or the CN 106 / 115 may be in direct or indirect communication with other RANs that employ the same RAT as the RAN 104 / 113 or a different RAT. For example, in addition to being connected to the RAN 104 / 113, which may utilize NR radio technology, the CN 106 / 115 may also be in communication with another RAN (not shown) that employs GSM, UMTS, CDMA 2000, WiMAX, E-UTRA, or WiFi radio technology.

[0046] The CN 106 / 115 may also serve as a gateway for the WTRUs 102a, 102b, 102c, 102d to access the PSTN 108, the Internet 110, and / or other networks 112. The PSTN 108 may include a circuit-switched telephone network that provides plain old telephone service (POTS). The Internet 110 may include a global system of interconnected computer networks and devices that use common communication protocols, such as the Transmission Control Protocol (TCP), the User Datagram Protocol (UDP), and / or the Internet Protocol (IP) in the TCP / IP Internet protocol suite. The networks 112 may include wired communication networks and / or wireless communication networks owned and / or operated by other service providers. For example, the networks 112 may include another CN connected to one or more RANs, which may employ the same RAT as the RAN 104 / 113 or a different RAT.

[0047] Some or all of the WTRUs 102a, 102b, 102c, 102d in the communication system 100 may include multi-mode capabilities (e.g., the WTRUs 102a, 102b, 102c, 102d may include multiple transceivers for communicating with different wireless networks via different wireless links). Figure 1A The illustrated WTRU 102c may be configured to communicate with the base station 114a, which may employ a cellular-based radio technology, and with the base station 114b, which may employ an IEEE 802 radio technology.

[0048] Figure 1B is a system diagram illustrating an example WTRU 102. Figure 1B As shown, the WTRU 102 may include, among other things, a processor 118, a transceiver 120, a transmit / receive element 122, a speaker / microphone 124, a keypad 126, a display / touchpad 128, non-removable memory 130, removable memory 132, a power source 134, a global positioning system (GPS) chipset 136, and / or other peripherals 138. It will be appreciated that the WTRU 102 may include any sub-combination of the foregoing elements while remaining consistent with an embodiment.

[0049] The processor 118 may be a general purpose processor, a special purpose processor, a conventional processor, a digital signal processor (DSP), a plurality of microprocessors, one or more microprocessors associated with a DSP core, a controller, a microcontroller, an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) circuit, any other type of integrated circuit (IC), a state machine, etc. The processor 118 may perform signal decoding, data processing, power control, input / output processing, and / or any other functionality that enables the WTRU 102 to operate in a wireless environment. The processor 118 may be coupled to the transceiver 120, which may be coupled to the transmit / receive element 122. Although Figure 1B The processor 118 and the transceiver 120 are depicted as separate components, but it is understood that the processor 118 and the transceiver 120 may be integrated together in an electronic package or chip.

[0050] The send / receive element 122 may be configured to send a signal to a base station (e.g., base station 114a) or receive a signal from the base station by an air interface 116. For example, in one embodiment, the send / receive element 122 may be an antenna configured to send and / or receive an RF signal. In an embodiment, the send / receive element 122 may be a transmitter / detector configured to send and / or receive, for example, IR, UV or visible light signals. In another embodiment, the send / receive element 122 may be configured to send and / or receive both RF signals and optical signals. It should be understood that the send / receive element 122 may be configured to send and / or receive any combination of wireless signals.

[0051] Although the transmit / receive element 122 Figure 1B 1 as a single element, the WTRU 102 may include any number of transmit / receive elements 122. More specifically, the WTRU 102 may employ MIMO technology. Thus, in one embodiment, the WTRU 102 may include two or more transmit / receive elements 122 (e.g., multiple antennas) for transmitting and receiving wireless signals over the air interface 116.

[0052] The transceiver 120 may be configured to modulate signals to be transmitted by the transmit / receive element 122 and to demodulate signals received by the transmit / receive element 122. As noted above, the WTRU 102 may have multi-mode capabilities. For example, the transceiver 120 may include multiple transceivers for enabling the WTRU 102 to communicate via multiple RATs, such as NR and IEEE 802.11.

[0053] The processor 118 of the WTRU 102 may be coupled to and may receive user input data from a speaker / microphone 124, a keypad 126, and / or a display / touchpad 128 (e.g., a liquid crystal display (LCD) display unit or an organic light emitting diode (OLED) display unit). The processor 118 may also output user data to the speaker / microphone 124, the keypad 126, and / or the display / touchpad 128. In addition, the processor 118 may access information from and store data in any type of suitable memory, such as a non-removable memory 130 and / or a removable memory 132. The non-removable memory 130 may include a random access memory (RAM), a read-only memory (ROM), a hard disk, or any other type of memory storage device. The removable memory 132 may include a subscriber identity module (SIM) card, a memory stick, a secure digital (SD) memory card, and the like. In other embodiments, the processor 118 may access information from and store data in a memory that is not physically located on the WTRU 102, such as on a server or a home computer (not shown).

[0054] The processor 118 may receive power from the power source 134, and may be configured to distribute and / or control power to other components in the WTRU 102. The power source 134 may be any suitable device for powering the WTRU 102. For example, the power source 134 may include one or more dry cell batteries (e.g., nickel-cadmium (NiCd), nickel-zinc (NiZn), nickel-metal hydride (NiMH), lithium-ion (Li-ion), etc.), solar cells, fuel cells, etc.

[0055] The processor 118 may also be coupled to the GPS chipset 136, which may be configured to provide location information (e.g., longitude and latitude) regarding the current location of the WTRU 102. In addition to or in lieu of the information from the GPS chipset 136, the WTRU 102 may receive location information from a base station (e.g., base stations 114a, 114b) over the air interface 116 and / or determine its location based on the timing of signals received from two or more nearby base stations. It will be appreciated that the WTRU 102 may acquire location information by any suitable location-determination method while remaining consistent with an embodiment.

[0056] The processor 118 may also be coupled to other peripherals 138, which may include one or more software modules and / or hardware modules that provide additional features, functionality, and / or wired or wireless connectivity. For example, the peripherals 138 may include an accelerometer, an electronic compass, a satellite transceiver, a digital camera (for photos and / or video), a universal serial bus (USB) port, a vibration device, a television transceiver, a hands-free headset, module, a frequency modulation (FM) radio unit, a digital music player, a media player, a video game player module, an Internet browser, a virtual reality and / or augmented reality (VR / AR) device, an activity tracker, etc. Peripheral device 138 may include one or more sensors, which may be one or more of the following: a gyroscope, an accelerometer, a Hall effect sensor, a magnetometer, an orientation sensor, a proximity sensor, a temperature sensor, a time sensor; a geolocation sensor; an altimeter, a light sensor, a touch sensor, a magnetometer, a barometer, a gesture sensor, a biometric sensor, and / or a humidity sensor.

[0057] The WTRU 102 may include a full-duplex radio for which transmission and reception of some or all signals (e.g., associated with specific subframes for UL (e.g., for transmission) and downlink (e.g., for reception)) may be concurrent and / or simultaneous. The full-duplex radio may include an interference management unit for reducing and / or substantially eliminating self-interference via signal processing performed via hardware (e.g., a choke) or via a processor (e.g., a separate processor (not shown) or via the processor 118). In an embodiment, the WRTU 102 may include a half-duplex radio for which transmission and reception of some or all signals (e.g., associated with specific subframes for UL (e.g., for transmission) or downlink (e.g., for reception)) may be concurrent and / or simultaneous.

[0058] Figure 1C 1 is a system diagram illustrating the RAN 104 and the CN 106 in accordance with an embodiment. As noted above, the RAN 104 may employ an E-UTRA radio technology to communicate with the WTRUs 102a, 102b, 102c over the air interface 116. The RAN 104 may also be in communication with the CN 106.

[0059] The RAN 104 may include evolved Node-Bs 160a, 160b, 160c, though it will be appreciated that the RAN 104 may include any number of evolved Node-Bs while remaining consistent with an embodiment. The evolved Node-Bs 160a, 160b, 160c may each include one or more transceivers for communicating with the WTRUs 102a, 102b, 102c over the air interface 116. In one embodiment, the evolved Node-Bs 160a, 160b, 160c may implement MIMO technology. Thus, the evolved Node-B 160a, for example, may use multiple antennas to transmit wireless signals to and / or receive wireless signals from the WTRU 102a.

[0060] Each of the evolved Node Bs 160a, 160b, 160c may be associated with a particular cell (not shown) and may be configured to handle radio resource management decisions, handover decisions, scheduling of users in UL and / or DL, etc. Figure 1C As shown, the eNode-Bs 160a, 160b, 160c may communicate with one another via an X2 interface.

[0061] Figure 1C The illustrated CN 106 may include a mobility management entity (MME) 162, a serving gateway (SGW) 164, and a packet data network (PDN) gateway (or PGW) 166. While each of the foregoing elements is depicted as being part of the CN 106, it should be understood that any of these elements may be owned and / or operated by an entity other than the CN operator.

[0062] The MME 162 may be connected to each of the evolved Node-Bs 162a, 162b, 162c in the RAN 104 via an S1 interface and may serve as a control node. For example, the MME 162 may be responsible for authenticating users of the WTRUs 102a, 102b, 102c, bearer activation / deactivation, selecting a particular serving gateway during an initial attach of the WTRUs 102a, 102b, 102c, etc. The MME 162 may provide a control plane function for switching between the RAN 104 and other RANs (not shown) that employ other radio technologies, such as GSM and / or WCDMA.

[0063] The SGW 164 may be connected to each of the evolved Node-Bs 160a, 160b, 160c in the RAN 104 via an S1 interface. The SGW 164 may generally route and forward user data packets to / from the WTRUs 102a, 102b, 102c. The SGW 164 may perform other functions, such as anchoring the user plane during inter-evolved Node-B handovers, triggering paging when DL data is available for the WTRUs 102a, 102b, 102c, managing and storing the context of the WTRUs 102a, 102b, 102c, and the like.

[0064] The SGW 164 may be connected to the PGW 166, which may provide the WTRUs 102a, 102b, 102c with access to packet-switched networks, such as the Internet 110, to facilitate communications between the WTRUs 102a, 102b, 102c and IP-enabled devices.

[0065] The CN 106 may facilitate communications with other networks. For example, the CN 106 may provide the WTRUs 102a, 102b, 102c with access to circuit-switched networks, such as the PSTN 108, to facilitate communications between the WTRUs 102a, 102b, 102c and traditional land-line communications devices. For example, the CN 106 may include, or may be in communication with, an IP gateway (e.g., an IP Multimedia Subsystem (IMS) server) that acts as an interface between the CN 106 and the PSTN 108. In addition, the CN 106 may provide the WTRUs 102a, 102b, 102c with access to other networks 112, which may include other wired networks and / or wireless networks owned and / or operated by other service providers.

[0066] Although the WTRU Figures 1A to 1D Although described as wireless terminals, it is contemplated that in certain representative embodiments, such terminals may (eg, temporarily or permanently) use a wired communications interface with a communications network.

[0067] In a representative embodiment, the other network 112 may be a WLAN.

[0068] A WLAN in infrastructure basic service set (BSS) mode may have an access point (AP) for the BSS and one or more stations (STA) associated with the AP. The AP may have access or an interface to a distribution system (DS) or another type of wired / wireless network that carries traffic to and / or carries traffic away from the BSS. Traffic originating from outside the BSS and leading to the STA may be reached by the AP and may be delivered to the STA. Traffic originating from the STA and leading to a destination outside the BSS may be transmitted to the AP to be delivered to the corresponding destination. Traffic between STAs within the BSS may be transmitted by the AP, for example, wherein the source STA may transmit traffic to the AP, and the AP may deliver traffic to the destination STA. Traffic between STAs within the BSS may be considered and / or referred to as point-to-point traffic. Point-to-point traffic may be transmitted between the source STA and the destination STA (e.g., directly between them) using a direct link establishment (DLS). In certain representative embodiments, the DLS may use 802.11e DLS or 802.11z tunnel DLS (TDLS). A WLAN using an independent BSS (IBSS) mode may not have an AP, and STAs within or using the IBSS (eg, all STAs in the STA) may communicate directly with each other. The IBSS communication mode may sometimes be referred to herein as an "ad hoc" communication mode.

[0069] When using the 802.11ac infrastructure operating mode or a similar operating mode, the AP may send beacons on a fixed channel (such as a primary channel). The primary channel may be a fixed width (e.g., a 20 MHz wide bandwidth) or a width dynamically set via signaling. The primary channel may be an operating channel of the BSS and may be used by the STA to establish a connection with the AP. In certain representative embodiments, carrier sense multiple access / collision avoidance (CSMA / CA) may be implemented, for example, in an 802.11 system. For CSMA / CA, a STA (e.g., each STA) (including the AP) may listen to the primary channel. In the case where the primary channel is listened / detected and / or determined to be busy by a specific STA, the specific STA may back off. One STA (e.g., only one station) may transmit at any given time in a given BSS.

[0070] High throughput (HT) STAs may communicate using a 40 MHz wide channel, for example, via a combination of a primary 20 MHz channel and adjacent or non-adjacent 20 MHz channels to form a 40 MHz wide channel.

[0071] Very high throughput (VHT) STA can support 20MHz, 40MHz, 80MHz and / or 160MHz wide channels. 40MHz channels and / or 80MHz channels can be formed by combining continuous 20MHz channels. 160MHz channels can be formed by combining 8 continuous 20MHz channels, or by combining two non-continuous 80MHz channels (this can be called 80+80 configuration). For 80+80 configuration, after channel coding, the data can pass through a segment parser that can divide the data into two streams. Each stream can be processed by inverse fast Fourier transform (IFFT) and time domain processing separately. These streams can be mapped to two 80MHz channels, and data can be sent by the transmitter STA. At the receiver of the receiver STA, the above-mentioned operation for the 80+80 configuration can be reversed, and the combined data can be transmitted to the medium access control (MAC).

[0072] 802.11af and 802.11ah support operating modes below 1GHz. Channel operating bandwidths and carriers are reduced in 802.11af and 802.11ah relative to those used in 802.11n and 802.11ac. 802.11af supports 5MHz, 10MHz, and 20MHz bandwidths in the TV White Space (TVWS) spectrum, and 802.11ah supports 1MHz, 2MHz, 4MHz, 8MHz, and 16MHz bandwidths using non-TVWS spectrum. According to a representative embodiment, 802.11ah may support instrument type control / machine type communications, such as MTC devices in macro coverage areas. MTC devices may have certain capabilities, such as limited capabilities, including support for (e.g., only support for) certain bandwidths and / or limited bandwidths. MTC devices may include batteries with battery life above a threshold (e.g., to maintain very long battery life).

[0073] WLAN systems that can support multiple channels and channel bandwidths (such as 802.11n, 802.11ac, 802.11af, and 802.11ah) include channels that can be designated as primary channels. The primary channel may have a bandwidth equal to the maximum common operating bandwidth supported by all STAs in the BSS. The bandwidth of the primary channel may be set and / or limited by a STA (which supports the minimum bandwidth operating mode) from all STAs operating in the BSS. In the example of 802.11ah, for STAs (e.g., MTC-type devices) that support (e.g., only support) a 1MHz mode, the primary channel may be 1MHz wide, even if the AP and other STAs in the BSS support 2MHz, 4MHz, 8MHz, 16MHz, and / or other channel bandwidth operating modes. Carrier sensing and / or network allocation vector (NAV) settings may depend on the state of the primary channel. If the primary channel is busy, for example, because a STA (supporting only a 1MHz operating mode) is sending to the AP, the entire available frequency band may be considered busy even if most of the frequency bands remain idle and may be available.

[0074] In the United States, the available frequency band for 802.11ah is 902MHz to 928MHz. In South Korea, the available frequency band is 917.5MHz to 923.5MHz. In Japan, the available frequency band is 916.5MHz to 927.5MHz. The total bandwidth available for 802.11ah is 6MHz to 26MHz, depending on the country code.

[0075] Figure 1D 1 is a system diagram illustrating the RAN 113 and the CN 115 in accordance with an embodiment. As noted above, the RAN 113 may employ NR radio technology to communicate with the WTRUs 102a, 102b, 102c over the air interface 116. The RAN 113 may also be in communication with the CN 115.

[0076] The RAN 113 may include gNBs 180a, 180b, 180c, though it will be appreciated that the RAN 113 may include any number of gNBs while remaining consistent with an embodiment. The gNBs 180a, 180b, 180c may each include one or more transceivers for communicating with the WTRUs 102a, 102b, 102c over the air interface 116. In one embodiment, the gNBs 180a, 180b, 180c may implement MIMO technology. For example, the gNBs 180a, 180b may utilize beamforming to send signals to and / or receive signals from the gNBs 180a, 180b, 180c. Thus, the gNB 180a may, for example, use multiple antennas to send wireless signals to and / or receive wireless signals from the WTRU 102a. In an embodiment, the gNBs 180a, 180b, 180c may implement carrier aggregation technology. For example, gNB 180a may transmit multiple component carriers to WTRU 102a (not shown). A subset of these component carriers may be on unlicensed spectrum, while the remaining component carriers may be on licensed spectrum. In an embodiment, gNBs 180a, 180b, 180c may implement coordinated multi-point (CoMP) technology. For example, WTRU 102a may receive coordinated transmissions from gNB 180a and gNB 180b (and / or gNB 180c).

[0077] The WTRUs 102a, 102b, 102c may communicate with the gNBs 180a, 180b, 180c using transmissions associated with parameter sets that may be scalable. For example, OFDM symbol spacing and / or OFDM subcarrier spacing may vary for different transmissions, different cells, and / or different portions of the wireless transmission spectrum. The WTRUs 102a, 102b, 102c may communicate with the gNBs 180a, 180b, 180c using subframes or transmit time intervals (TTIs) of varying or scalable lengths (e.g., containing different numbers of OFDM symbols and / or varying absolute time lengths over time).

[0078] The gNBs 180a, 180b, 180c may be configured to communicate with the WTRUs 102a, 102b, 102c in a standalone configuration and / or a non-standalone configuration. In a standalone configuration, the WTRUs 102a, 102b, 102c may communicate with the gNBs 180a, 180b, 180c while not accessing other RANs (e.g., such as the eNodeBs 160a, 160b, 160c). In a standalone configuration, the WTRUs 102a, 102b, 102c may use one or more of the gNBs 180a, 180b, 180c as mobility anchors. In a standalone configuration, the WTRUs 102a, 102b, 102c may communicate with the gNBs 180a, 180b, 180c using signals in an unlicensed band. In a non-standalone configuration, the WTRUs 102a, 102b, 102c may communicate / connect with the gNB 180a, 180b, 180c while also communicating / connecting with another RAN, such as the eNode-B 160a, 160b, 160c. For example, the WTRUs 102a, 102b, 102c may implement the DC principle to communicate with one or more gNBs 180a, 180b, 180c and one or more eNode-Bs 160a, 160b, 160c substantially simultaneously. In a non-standalone configuration, the eNode-B 160a, 160b, 160c may act as a mobility anchor for the WTRUs 102a, 102b, 102c, and the gNB 180a, 180b, 180c may provide additional coverage and / or throughput for serving the WTRUs 102a, 102b, 102c.

[0079] Each of the gNBs 180a, 180b, 180c may be associated with a particular cell (not shown) and may be configured to handle radio resource management decisions, handover decisions, scheduling of users in UL and / or DL, support of network slicing, dual connectivity, interworking between NR and E-UTRA, routing of user plane data towards a user plane function (UPF) 184a, 184b, routing of control plane information towards an access and mobility management function (AMF) 182a, 182b, etc. Figure 1D As shown, gNBs 180a, 180b, and 180c may communicate with each other via an Xn interface.

[0080] Figure 1DThe illustrated CN 115 may include at least one AMF 182a, 182b, at least one UPF 184a, 184b, at least one session management function (SMF) 183a, 183b, and possible data networks (DNs) 185a, 185b. Although each of the foregoing elements is depicted as part of the CN 115, it should be understood that any of these elements may be owned and / or operated by an entity other than the CN operator.

[0081] The AMF 182a, 182b may be connected to one or more of the gNBs 180a, 180b, 180c in the RAN 113 via the N2 interface and may act as a control node. For example, the AMF 182a, 182b may be responsible for authenticating users of the WTRU 102a, 102b, 102c, support of network slicing (e.g., handling of different PDU sessions with different requirements), selecting a specific SMF 183a, 183b, management of registration areas, termination of NAS signaling, mobility management, etc. The AMF 182a, 182b may use network slicing to customize CN support for the WTRU 102a, 102b, 102c based on the type of services utilized by the WTRU 102a, 102b, 102c. For example, different network slices may be established for different use cases, such as services relying on ultra-reliable low latency (URLLC) access, services relying on enhanced mobile broadband (eMBB) access, services for machine type communication (MTC) access, etc. The AMF 162 may provide a control plane function for switching between the RAN 113 and other RANs (not shown) that employ other radio technologies, such as LTE, LTE-A, LTE-A Pro, and / or non-3GPP access technologies, such as WiFi.

[0082] The SMF 183a, 183b may be connected to the AMF 182a, 182b in the CN 115 via the N11 interface. The SMF 183a, 183b may also be connected to the UPF 184a, 184b in the CN 115 via the N4 interface. The SMF 183a, 183b may select and control the UPF 184a, 184b, and configure the traffic routing through the UPF 184a, 184b. The SMF 183a, 183b may perform other functions, such as managing and allocating UE IP addresses, managing PDU sessions, controlling policy implementation and QoS, providing downlink data notification, etc. The PDU session type may be IP-based, non-IP-based, Ethernet-based, etc.

[0083] The UPF 184a, 184b may be connected to one or more of the gNBs 180a, 180b, 180c in the RAN 113 via the N3 interface, which may provide the WTRUs 102a, 102b, 102c with access to packet-switched networks, such as the Internet 110, to facilitate communications between the WTRUs 102a, 102b, 102c and IP-enabled devices. The UPF 184, 184b may perform other functions, such as routing and forwarding packets, enforcing user plane policies, supporting multi-homed PDU sessions, handling user plane QoS, buffering downlink packets, providing mobility anchoring, etc.

[0084] The CN 115 may facilitate communications with other networks. For example, the CN 115 may include, or may communicate with, an IP gateway (e.g., an IP Multimedia Subsystem (IMS) server) that acts as an interface between the CN 115 and the PSTN 108. In addition, the CN 115 may provide the WTRUs 102a, 102b, 102c with access to other networks 112, which may include other wired networks and / or wireless networks owned and / or operated by other service providers. In one embodiment, the WTRUs 102a, 102b, 102c may be connected to local data networks (DNs) 185a, 185b via the UPF 184a, 184b via an N3 interface to the UPF 184a, 184b and an N6 interface between the UPF 184a, 184b and the DN 185a, 185b.

[0085] Given that Figures 1A to 1D as well as Figures 1A to 1D Corresponding to the description of the present invention, one or more or all of the functions described herein with reference to one or more of the following may be performed by one or more simulation devices (not shown): WTRU102a-d, base station 114a-b, evolved Node B 160a-c, MME 162, SGW 164, PGW 166, gNB 180a-c, AMF182a-b, UPF 184a-b, SMF 183a-b, DN 185a-b and / or any other device described herein. The simulation device may be one or more devices configured to emulate one or more or all of the functions described herein. For example, the simulation device may be used to test other devices and / or simulate network and / or WTRU functions.

[0086] The simulation device may be designed to implement one or more tests of other devices in a laboratory environment and / or in an operator network environment. For example, one or more simulation devices may perform one or more functions or all functions while being fully or partially implemented and / or deployed as part of a wired and / or wireless communication network in order to test other devices within the communication network. One or more simulation devices may perform one or more functions or all functions while being temporarily implemented / deployed as part of a wired and / or wireless communication network. The simulation device may be directly coupled to another device for testing purposes and / or may use over-the-air wireless communications to perform testing.

[0087] One or more simulation devices can perform one or more (including all) functions without being implemented / deployed as part of a wired and / or wireless communication network. For example, the simulation device can be used in a test scenario in a test laboratory and / or a non-deployed (e.g., testing) wired and / or wireless communication network to implement testing of one or more components. One or more simulation devices can be test equipment. Direct RF coupling and / or wireless communication via RF circuits (e.g., which may include one or more antennas) can be used by the simulation device to send and / or receive data.

[0088] The present application describes a number of aspects, including tools, features, examples, models, methods, etc. Many of these aspects are described in a particular manner, and at least in order to illustrate individual features, are usually described in a manner that may sound restrictive. However, this is to describe clearly and does not limit the application or scope of these aspects. In fact, all different aspects can be combined and interchanged to provide further aspects. In addition, these aspects can also be combined and interchanged with the aspects described in the earlier submission.

[0089] The aspects described and contemplated in this application can be implemented in many different forms. Figures 5 to 21 Some examples may be provided, but others are also contemplated. Figures 5 to 21 The discussion of the present invention does not limit the breadth of specific implementations. At least one of these aspects generally relates to video encoding and decoding, and at least one other aspect generally relates to sending a generated or encoded bitstream. These and other aspects can be implemented as methods, apparatus, a computer-readable storage medium having stored thereon instructions for encoding or decoding video data according to any of the methods, and / or a computer-readable storage medium having stored thereon a bitstream generated according to any of the methods.

[0090] In this application, the terms "reconstruction" and "decoding" may be used interchangeably, the terms "pixel" and "sample" may be used interchangeably, and the terms "image", "picture" and "frame" may be used interchangeably.

[0091] Various methods are described herein, and each method includes one or more steps or actions for implementing the method. Unless the correct operation method requires a specific order of steps or actions, the order and / or purpose of specific steps and / or actions can be modified or combined. In addition, in various examples, terms such as "first", "second" and the like can be used to modify elements, parts, steps, operations, etc., such as "first decoding" and "second decoding". Unless specifically required, the use of such terms does not imply the ordering of the modification operation. Therefore, in this example, the first decoding does not need to be performed before the second decoding, and can, for example, occur before, during, or in an overlapping time period of the second decoding.

[0092] like Figure 2 and Figure 3 As shown, various methods and other aspects described in this application can be used to modify modules (e.g., decoding modules) of video encoder 200 and decoder 300. In addition, the subject matter disclosed herein can be applied to, for example, any type, format, or version of video decoding (whether described in a standard or described in a recommendation), whether pre-existing or developed in the future, as well as extensions of any such standards and recommendations. Unless otherwise indicated or technically excluded, the aspects described in this application can be used alone or in combination.

[0093] Various numerical values ​​are used in the examples described in this application. These and other specific values ​​are for the purpose of describing the examples, and the aspects are not limited to these specific values.

[0094] Figure 2 is a schematic diagram illustrating an example video encoder. Variations of the example encoder 200 are contemplated, but the following describes the encoder 200 for clarity without describing all contemplated variations. The encoder may be a block-based hybrid video encoder.

[0095] Before being encoded, the video sequence may undergo a pre-encoding process (201), for example, applying a color transform to an input color picture (e.g., conversion from RGB 4:4:4 to YCbCr 4:2:0), or performing a remapping of input picture components to obtain a signal distribution that is more resilient to compression (e.g., using histogram equalization of one of the color components). Metadata may be associated with the pre-processing and appended to the bitstream.

[0096] In encoder 200, a picture is encoded by encoder elements as described below. The picture to be encoded is partitioned (202) and processed in units such as coding units (CUs). Each unit is encoded, for example, using intra mode or inter mode. When a unit is encoded in intra mode, the unit performs intra prediction (260). In inter mode, motion estimation (275) and compensation (270) are performed. The encoder decides (205) which of intra mode or inter mode to use to encode the unit, and indicates the intra / inter decision by, for example, a prediction mode flag. The prediction residual is calculated, for example, by subtracting (210) the predicted block from the original image block.

[0097] The prediction residual is then transformed (225) and quantized (230). The quantized transform coefficients, along with motion vectors and other syntax elements, are entropy coded (245) to output a bitstream. The encoder may skip the transform and apply quantization directly to the untransformed residual signal. The encoder may bypass both the transform and quantization, i.e., directly code the residual without applying the transform or quantization process.

[0098] The encoder decodes the coded block to provide a reference for further prediction. The quantized transform coefficients are dequantized (240) and inverse transformed (250) to decode the prediction residual. The image block is reconstructed by combining the decoded prediction residual and the predicted block (255). An in-loop filter (265) is applied to the reconstructed picture to perform, for example, deblocking / SAO (sample adaptive offset) filtering to reduce coding artifacts. The filtered image is stored at a reference picture buffer (280).

[0099] Figure 3 is a schematic diagram illustrating an example of a video decoder. In the example decoder 300, a bitstream is decoded by decoder elements as described below. The video decoder 300 generally performs the same Figure 2 The decoding process is the reverse of the encoding process described in . The encoder 200 also typically performs video decoding as part of encoding the video data.

[0100] Specifically, the input of the decoder includes a video bitstream, which may be generated by the video encoder 200. First, the bitstream is entropy decoded (330) to obtain transform coefficients, motion vectors, and other decoded information. Picture partition information indicates how the picture is partitioned. Therefore, the decoder can divide (335) the picture according to the decoded picture partition information. The transform coefficients are dequantized (340) and inverse transformed (350) to decode the prediction residual. The image block is reconstructed by combining (355) the decoded prediction residual and the predicted block. The predicted block can be obtained (370) from intra-frame prediction (360) or motion compensated prediction (i.e., inter-frame prediction) (375). An in-loop filter (365) is applied to the reconstructed image. The filtered image is stored at a reference picture buffer (380).

[0101] The decoded picture may also undergo post-decoding processing (385), such as an inverse color transform (e.g., conversion from YCbCr 4:2:0 to RGB 4:4:4) or performing an inverse remapping that is the inverse of the remapping process performed in the pre-encoding process (201). The post-decoding processing may use metadata derived in the pre-encoding process and signaled in the bitstream. In an example, the decoded image (e.g., after applying the in-loop filter (365) and / or after the post-decoding processing (385), if post-decoding processing is used) may be transmitted to a display device for presentation to a user.

[0102] Figure 4 4 is a schematic diagram showing an example of a system in which various aspects and examples described herein can be implemented. System 400 may be embodied as a device including various components described below and configured to perform one or more aspects of the aspects described in this document. Examples of such devices include, but are not limited to, various electronic devices such as personal computers, laptop computers, smart phones, tablet computers, digital multimedia set-top boxes, digital television receivers, personal video recording systems, connected home appliances, and servers. The elements of system 400 may be embodied in a single integrated circuit (IC), multiple ICs, and / or discrete components, either individually or in combination. For example, in at least one example, the processing and encoder / decoder elements of system 400 are distributed over multiple ICs and / or discrete components. In various examples, system 400 is communicatively coupled to one or more other systems or other electronic devices via, for example, a communication bus or through dedicated input ports and / or output ports. In various examples, system 400 is configured to implement one or more aspects of the aspects described in this document.

[0103] The system 400 includes at least one processor 410 configured to execute instructions loaded therein for implementing, for example, various aspects described in this document. The processor 410 may include embedded memory, input-output interfaces, and various other circuits as known in the art. The system 400 includes at least one memory 420 (e.g., a volatile memory device and / or a non-volatile memory device). The system 400 includes a storage device 440, which may include a non-volatile memory and / or a volatile memory, including but not limited to an electrically erasable programmable read-only memory (EEPROM), a read-only memory (ROM), a programmable read-only memory (PROM), a random access memory (RAM), a dynamic random access memory (DRAM), a static random access memory (SRAM), a flash memory, a magnetic disk drive, and / or an optical disk drive. As non-limiting examples, the storage device 440 may include an internal storage device, an attached storage device (including a removable and non-removable storage device), and / or a network-accessible storage device.

[0104] The system 400 includes an encoder / decoder module 430, which is configured to process data, for example, to provide encoded video or decoded video, and the encoder / decoder module 430 may include its own processor and memory. The encoder / decoder module 430 represents a module that may be included in a device to perform encoding and / or decoding functions. As is well known, a device may include one or both of an encoding module and a decoding module. Additionally, the encoder / decoder module 430 may be implemented as a separate element of the system 400, or may be incorporated into the processor 410 as a combination of hardware and software known to those skilled in the art.

[0105] Program code to be loaded onto the processor 410 or the encoder / decoder 430 to perform various aspects described in this document may be stored in the storage device 440 and subsequently loaded onto the memory 420 for execution by the processor 410. According to various examples, one or more of the processor 410, the memory 420, the storage device 440, and the encoder / decoder module 430 may store one or more of various items during the execution of the processes described in this document. Such stored items may include, but are not limited to, input video, decoded video or partially decoded video, bitstreams, matrices, variables, and intermediate or final results of processing equations, formulas, operations, and operation logic.

[0106] In some examples, memory inside the processor 410 and / or the encoder / decoder module 430 is used to store instructions and provide working memory for processing required during encoding or decoding. However, in other examples, memory external to the processing device (e.g., the processing device may be the processor 410 or the encoder / decoder module 430) is used for one or more of these functions. The external memory may be a memory 420 and / or a storage device 440, such as a dynamic volatile memory and / or a non-volatile flash memory. In several examples, the external non-volatile flash memory is used to store, for example, an operating system for a television. In at least one example, a fast external dynamic volatile memory (such as RAM) is used as working memory for video encoding and decoding operations.

[0107] Inputs to the elements of system 400 may be provided through various input devices as indicated in block 445. Such input devices include, but are not limited to: (i) a radio frequency (RF) section that receives an RF signal, such as that transmitted over the air by a broadcaster; (ii) a component (COMP) input terminal (or a set of COMP input terminals); (iii) a universal serial bus (USB) input terminal; and / or (iv) a high-definition multimedia interface (HDMI) input terminal. Other examples ( Figure 4 ) includes composite video.

[0108] In various examples, the input device of frame 445 has the corresponding input processing element associated as known in the art.For example, the RF part can be associated with the element suitable for the following: (i) select the required frequency (also referred to as selecting signal, or limiting the signal band to a band), (ii) down-convert the selected signal, (iii) again band-limit to a narrower band to select the signal band that (for example) can be called a channel in some examples, (iv) demodulate the signal through down-conversion and band-limited, (v) perform error correction, and / or (vi) demultiplex to select the required data packet stream. The RF part of various examples includes one or more elements for performing these functions, such as frequency selector, signal selector, band limiter, channel selector, filter, down-converter, demodulator, error corrector and demultiplexer. The RF part can include a tuner that performs various functions in these functions, including, for example, down-converting the received signal to a lower frequency (for example, intermediate frequency or near baseband frequency) or to baseband. In a set-top box example, the RF part and its associated input processing element receive the RF signal sent by wired (for example, cable) medium, and filter to the desired frequency band by filtering, down-conversion and again to perform frequency selection.Various examples rearrange the order of above-mentioned (and other) elements, remove some elements in these elements, and / or add other elements that perform similar or different functions.Adding element can include inserting element between existing elements, for example, inserting amplifier and analog-to-digital converter.In various examples, the RF part includes antenna.

[0109] The USB and / or HDMI terminals may include corresponding interface processors for connecting the system 400 to other electronic devices across the USB and / or HDMI connections. It should be understood that various aspects of input processing (e.g., Reed-Solomon error correction) may be implemented as needed, for example, in a separate input processing IC or in the processor 410. Similarly, various aspects of USB or HDMI interface processing may be implemented as needed in a separate interface IC or in the processor 410. The demodulated, error-corrected, and demultiplexed streams are provided to various processing elements, including, for example, the processor 410 and the encoder / decoder 430, which operate in conjunction with the memory and storage elements to process the data stream as needed for presentation on the output device.

[0110] The various components of system 400 may be disposed within an integrated housing. Within the integrated housing, the various components may be interconnected and transmit data between the components using a suitable connection arrangement 425 (e.g., an internal bus known in the art, including an inter-chip (I2C) bus, wiring, and a printed circuit board).

[0111] System 400 includes a communication interface 450 that enables communication with other devices via a communication channel 460. Communication interface 450 may include, but is not limited to, a transceiver configured to send and receive data through communication channel 460. Communication interface 450 may include, but is not limited to, a modem or a network card, and communication channel 460 may be implemented, for example, within a wired and / or wireless medium.

[0112] In various examples, data is streamed or otherwise provided to the system 400 using a wireless network, such as a Wi-Fi network, e.g., IEEE 802.11 (IEEE refers to the Institute of Electrical and Electronics Engineers). The Wi-Fi signals of these examples are received via a communication channel 460 and a communication interface 450 suitable for Wi-Fi communications. The communication channel 460 of these examples is typically connected to an access point or router that provides access to external networks, including the Internet, to allow streaming applications and other cross-top communications. Other examples provide streaming data to the system 400 using a set-top box that delivers data via an HDMI connection of an input box 445. Still other examples use an RF connection of an input box 445 to provide streaming data to the system 400. As described above, various examples provide data in a non-streaming manner. Additionally, various examples use wireless networks other than Wi-Fi, such as cellular networks or network.

[0113] The system 400 may provide output signals to various output devices, including a display 475, a speaker 485, and other peripherals 495. The display 475 of various examples includes, for example, one or more of a touch screen display, an organic light emitting diode (OLED) display, a curved display, and / or a foldable display. The display 475 may be used for a television, a tablet computer, a laptop, a cellular phone (mobile phone), or other devices. The display 475 may also be integrated with other components (e.g., as in a smart phone), or may be independent (e.g., an external monitor for a laptop computer). In various examples, other peripherals 495 include one or more of an independent digital video disc (or digital versatile disc) (DVD, for both terms), a disc player, a stereo system, and / or a lighting system. Various examples use one or more peripherals 495 that provide functions based on the output of the system 400. For example, a disc player performs the function of playing the output of the system 400.

[0114] In various examples, control signals are transmitted between the system 400 and the display 475, speaker 485, or other peripheral device 495 using signaling such as AV.Link, consumer electronics control (CEC), or other communication protocols that enable device-to-device control with or without user intervention. Output devices may be communicatively coupled to the system 400 via dedicated connections through respective interfaces 470, 480, and 490. Alternatively, the output devices may be connected to the system 400 via a communication interface 450 using a communication channel 460. The display 475 and speaker 485 may be integrated into a single unit with other components of the system 400 in an electronic device such as, for example, a television. In various examples, the display interface 470 includes a display driver, such as, for example, a timing controller (TCon) chip.

[0115] For example, if the RF portion of input 445 is part of a separate set-top box, the display 475 and speaker 485 may alternatively be separate from one or more of the other components. In various examples where the display 475 and speaker 485 are external components, the output signal may be provided via a dedicated output connection including, for example, an HDMI port, a USB port, or a COMP output.

[0116] These examples may be performed by computer software implemented by processor 410 or by hardware or by a combination of hardware and software. As a non-limiting example, these examples may be implemented by one or more integrated circuits. Memory 420 may be of any type suitable for the technical environment and may be implemented using any appropriate data storage technology, such as, as a non-limiting example, optical memory devices, magnetic memory devices, semiconductor-based memory devices, fixed memory, and removable memory. Processor 410 may be of any type suitable for the technical environment and may include, as a non-limiting example, one or more of a microprocessor, a general-purpose computer, a special-purpose computer, and a processor based on a multi-core architecture.

[0117] Various implementations involve decoding. As used in this application, "decoding" may encompass, for example, all or part of a process performed on a received coded sequence to produce a final output suitable for display. In various examples, such processes include one or more of the processes typically performed by a decoder, such as entropy decoding, inverse quantization, inverse transform, and differential decoding. In various examples, such processes also include or alternatively include processes performed by a decoder of various implementations described in this application, such as obtaining a bitstream indicating motion information associated with a sub-block, determining a template associated with the sub-block using the motion information, generating a reconstructed sub-block using a template and operations based on the template, and the like.

[0118] As another example, in one example, "decoding" refers only to entropy decoding, in another example, "decoding" refers only to differential decoding, and in another example, "decoding" refers to a combination of entropy decoding and differential decoding. Whether the phrase "decoding process" is intended to refer specifically to a subset of operations or broadly to a broader decoding process will be clear based on the context of the specific description and is considered to be well understood by those skilled in the art.

[0119] Various implementations involve encoding. In a manner similar to the discussion above about "decoding", "encoding" as used in this application may cover, for example, all or part of the processes performed on an input video sequence to produce an encoded bitstream. In various examples, such processes include one or more of the processes typically performed by an encoder, such as partitioning, differential encoding, transforms, quantization, and entropy encoding. In various examples, such processes also include or alternatively include processes performed by encoders of various implementations described in this application, such as determining motion information associated with a sub-block, determining to use a template-based operation for a sub-block, encoding a sub-block using a template-based operation, and the like.

[0120] As another example, in one example, "encoding" refers only to entropy encoding, in another example, "encoding" refers only to differential encoding, and in another example, "encoding" refers to a combination of differential decoding and entropy encoding. Whether the phrase "encoding process" specifically refers to a subset of operations or broadly refers to a broader encoding process will be clear based on the context of the specific description and is believed to be well understood by those skilled in the art.

[0121] It should be noted that syntax elements (eg, coding syntax, etc.) as used herein are descriptive terms. Therefore, they do not exclude the use of other syntax element names.

[0122] When the figures are presented as flow charts, it should be understood that they also provide block diagrams of corresponding devices. Similarly, when the figures are presented as block diagrams, it should be understood that they also provide flow charts of corresponding methods / processes.

[0123] The specific implementations and aspects described herein may be implemented in, for example, a method or process, a device, a software program, a data stream, or a signal. Even if only discussed in the context of a single form of specific implementation (e.g., discussed only as a method), the specific implementation of the features discussed may also be implemented in other forms (e.g., a device or program). The device may be implemented in, for example, appropriate hardware, software, and firmware. These methods may be implemented in, for example, a processor, which generally refers to a processing device, including, for example, a computer, a microprocessor, an integrated circuit, or a programmable logic device. The processor also includes communication equipment, such as, for example, a computer, a mobile phone, a portable / personal digital assistant ("PDA"), and other equipment that facilitates information communication between end users.

[0124] References to "one example" or "an example" or "one implementation" or "an implementation" and other variations thereof mean that a particular feature, structure, characteristic, etc. described in connection with the example is included in at least one example. Thus, the phrases "in one example" or "in an example" or "in one implementation" or "in an implementation" and any other variations appearing in various places throughout this application are not necessarily all referring to the same example.

[0125] Additionally, the present application may involve "determining" various pieces of information. Determining information may include, for example, one or more of estimating information, calculating information, predicting information, or retrieving information from a memory. Obtaining may include receiving, retrieving, constructing, generating, and / or determining.

[0126] Furthermore, the present application may refer to "accessing" various information. Accessing information may include, for example, one or more of receiving information, retrieving information (e.g., from a memory), storing information, moving information, copying information, calculating information, determining information, predicting information, or estimating information.

[0127] Additionally, the present application may refer to "receiving" various information. Like "accessing," receiving is intended to be a broad term. Receiving information may include, for example, one or more of accessing information or retrieving information (e.g., from a memory). Furthermore, "receiving" generally involves, in one way or another, during operations such as, for example, storing information, processing information, sending information, moving information, copying information, erasing information, calculating information, determining information, predicting information, or estimating information.

[0128] It should be understood that, for example, in the case of "A / B," "A and / or B," and "at least one of A and B," the use of any of the following " / ," "and / or," and "at least one of" is intended to encompass selecting only the first listed option (A), or only the second listed option (B), or both options (A and B). As a further example, in the case of "A, B, and / or C" and "at least one of A, B, and C," such phrases are intended to encompass selecting only the first listed option (A), or only the second listed option (B), or only the third listed option (C), or only the first listed option and the second listed option (A and B), or only the first listed option and the third listed option (A and C), or only the second listed option and the third listed option (B and C), or all three options (A and B and C). This can be extended to as many items as listed, as will be apparent to one of ordinary skill in this and related arts.

[0129] Moreover, as used herein, the term "signaling" means (among other things) indicating something to a corresponding decoder. The encoder signal may include, for example, motion information associated with a sub-block, etc. Thus, in one example, the same parameters are used on both the encoder side and the decoder side. Thus, for example, the encoder may send (explicit signaling) specific parameters to the decoder so that the decoder can use the same specific parameters. Conversely, if the decoder already has specific parameters as well as other parameters, signaling may be used without sending (implicit signaling) to simply allow the decoder to know and select specific parameters. Bit savings are achieved in various examples by avoiding sending any actual function. It should be understood that signaling can be implemented in a variety of ways. For example, in various examples, one or more syntax elements, flags, etc. are used to signal information to the corresponding decoder. Although the verb form of the term "signaling" is mentioned above, the term "signal" may also be used as a noun in this article.

[0130] It will be apparent to one of ordinary skill in the art that a specific implementation may generate a variety of signals formatted to carry, for example, storable or transmittable information. The information may include, for example, instructions for executing a method or data generated by one of the described specific implementations. For example, a signal may be formatted to carry a bit stream of the example. Such a signal may be formatted as, for example, an electromagnetic wave (e.g., using a radio frequency portion of a spectrum) or a baseband signal. Formatting may include, for example, encoding a data stream and modulating a carrier using the encoded data stream. The information carried by the signal may be, for example, analog or digital information. As is well known, a signal may be sent over a variety of different wired or wireless links. The signal may be stored on, or accessed or received from, a processor-readable medium.

[0131] Many examples are described herein. The features of the examples may be provided individually or in any combination across various claim categories and types. In addition, the examples may include one or more of the features, devices or aspects described herein individually or in any combination across various claim categories and types. For example, the features described herein may include a bitstream or signal of information generated as described herein to be implemented. This information may allow a decoder to decode a bitstream, an encoder, a bitstream and / or a decoder according to any of the embodiments described in the embodiments. For example, the features described herein may be implemented by creating and / or sending and / or receiving and / or decoding a bitstream or a signal. For example, the features described herein may be implemented by a method, a process, a device, a medium storing instructions, a medium storing data or a signal. For example, the features described herein may be implemented by a TV, a set-top box, a mobile phone, a tablet computer or other electronic devices that perform decoding. A TV, a set-top box, a mobile phone, a tablet computer or other electronic devices may display (e.g., using a monitor, a screen or other type of display) a result image (e.g., an image reconstructed from the residual of a video bitstream). A TV, a set-top box, a mobile phone, a tablet computer or other electronic devices may receive a signal including an encoded image and perform decoding.

[0132] Latency may be introduced by template-based operations (e.g., where pattern derivation for a particular block may read samples on the current frame for decoding). Latency introduced by using template-based operations may be reduced. Template-based operations may include where pattern derivation for a block reads samples on the current frame for decoding. Eliminating dependencies between decoding and reconstruction in the pipeline may reduce latency. Template-based operations may include template matching, adaptive merge candidate reordering, etc.

[0133] In an inter-frame or intra-frame, reconstruction of a block may be divided into several stages (e.g., several stages), such as one or more of the following: mode decoding (e.g., prediction type, transform type, etc.), prediction itself, residual decoding (e.g., if any), and / or block reconstruction (e.g., final block reconstruction). For example (e.g., for an inter-frame block), the encoder may select a block in a reference frame (e.g., the best block), such as after applying a motion model (e.g., translational motion or sub-block-based motion).

[0134] Figure 5 An example decoding pipeline for an inter-frame block is illustrated. An example decoding pipeline for an inter-frame block may involve processing stages and dependencies between processing stages (e.g., Figure 5 ). Figure 5 As shown in , a box may correspond to a specific block. Figure 5 As shown in , the width of the blocks can emphasize the duration of the process.

[0135] For example, the syntax parsing of block 1 may be performed (e.g., Figure 5 For example, decoding of the information may be performed after parsing (e.g., as shown in (1) in FIG. Figure 5 For example, during this phase, parsing of blocks may be performed in parallel.

[0136] For example, during this phase, parsing of blocks can be performed in parallel.

[0137] For example, reconstruction of the block may be performed after decoding (e.g., as Figure 5 For example, due to the dependency between the reconstructions of the blocks, the reconstruction of block 2 may be performed (e.g., as shown in (1”) in FIG. Figure 5 (2") in (for example, Figure 5 The decoding is completed and executed immediately as shown in (2')).

[0138] Operations involving templates surrounding the current block may be performed to infer or reduce signaling costs, such as TM or ARMC-TM (eg, as described herein). Figure 6 The decoding pipeline based on the example TM is illustrated. Figure 6 As shown in , changes in the decoding pipeline can be provided. For example, if there is a dependency between the reconstruction of block 1 and the decoding of block 2, it is possible to avoid (eg, not perform) the reconstruction of the blocks in parallel (eg, as Figure 6 ). This constraint may place a burden (e.g., a heavy burden) on the decoder (e.g., the most computationally intensive stages (e.g., reconstruction) may no longer be parallelized). For example, the same problem may occur for template-based operations (e.g., intra-frame), where (e.g., only) the decoding stage cannot be performed in parallel (e.g., because the reconstruction is not parallelizable).

[0139] Template matching may be performed and / or provided. Template matching (TM) may be a derivation operation (e.g., a motion vector (MV) derivation operation, a decoder-side MV derivation operation). TM may enable correction of motion information of a CU (e.g., a current CU), for example, by finding a match (e.g., the closest match) between a template (e.g., a top and / or left neighboring block of the current CU) in a picture (e.g., a current picture) and a block (e.g., the same size as the template) in a reference picture. Figure 7 An example of template matching performed on a search area around an initial MV is illustrated. Figure 7 As shown, the MV (e.g., a better MV) is searched around the initial motion of the current CU within the [-8, +8] pixel search range. The template matching method can be used with one or more of the following modifications: the search step size is determined based on the adaptive motion vector resolution correction (AMVR) mode; and / or the TM can be cascaded with the bilateral matching process in the merge mode.

[0140] In AMVP (Advanced Motion Vector Prediction) mode, a motion vector predictor (MVP) candidate may be determined, for example, based on a template matching error. The template matching error may include an error in selecting an MVP candidate that achieves a difference (e.g., a minimum difference) between a current block template and a reference block template, and then TM is performed only for the selected MVP candidate (e.g., a specific MVP candidate) to achieve MV correction. For example, TM may correct this MVP candidate starting from full-pixel motion vector difference (MVD) accuracy or from 4 pixels for a 4-pixel AMVR mode within a [–8, +8] pixel search range (e.g., by using an iterative diamond search). The AMVP candidate may be further corrected, for example, by using a cross search with full-pixel MVD accuracy or with 4 pixels for a 4-pixel AMVR mode followed by half-pixel MVD accuracy and quarter-pixel MVD accuracy, depending on the AMVR mode (e.g., as shown in Table 1). This search process may ensure that the MVP candidate maintains the same MV accuracy (e.g., as indicated by the AMVR mode) after the TM process. During the search process, for example, if the difference between the previous minimum cost and the current minimum cost in the interaction is smaller than a threshold value equal to the area of ​​the block, the search process may terminate.

[0141]

[0142] Table 1. Search patterns of AMVR and merge mode and AMVR.

[0143] In merge mode, a search operation (e.g., a similar search operation) may be applied to a merge candidate (e.g., a merge candidate indicated by a merge index). As shown in Table 1, TM may be performed up to 1 / 8 pixel MVP precision (e.g., up to 1 / 8 pixel MVD precision) or skip precisions exceeding half-pixel MVD precision, for example, depending on whether an alternative interpolation filter is used based on merged motion information (e.g., an interpolation filter used when AMVR uses half-pixel mode). For example, TM may operate as an independent process and / or an additional MV correction process between a block-based bilateral matching (BM) operation and a sub-block-based BM operation. Template matching may operate as an independent process or an additional MV correction process between a block-based bilateral matching (BM) method and a sub-block-based BM method (e.g., if / when TM mode is enabled), for example, depending on whether BM may be enabled (e.g., based on its enabling condition check).

[0144] Multiple passes of motion vector correction may be performed and / or provided. Multiple passes of decoder-side motion vector correction may be performed and / or provided.

[0145] Multiple passes of vector correction (e.g., multiple passes of decoder-side motion vector correction) may be applied. In a first pass, bilateral matching (BM) may be applied to the coding block. In a second pass, BM may be applied to (e.g., each) sub-block (e.g., 16x16 sub-block) within the coding block. In a third pass, MVs in (e.g., each) sub-block (e.g., 8x8 sub-block) may be corrected, e.g., by applying bidirectional optical flow (BDOF). The corrected MVs may be stored for spatial and / or temporal motion vector prediction.

[0146] In a first pass, block-based bilateral matching MV modification may be applied. In the first pass, modified MVs may be derived by applying BM to the coded blocks. Similar to motion vector modification (e.g., such as decoder-side motion vector modification (DMVR)), in a bidirectional prediction operation, modified MVs may be searched around (e.g., two) initial MVs (e.g., MV0 and MV1) in reference picture lists L0 and L1. For example, based on a bilateral matching cost (e.g., a minimum bilateral matching cost) between (e.g., two) reference blocks in L0 and L1, modified MVs (e.g., MV0_pass1 and MV1_pass1) may be derived around the initial MVs.

[0147] BM may include performing a search (e.g., a local search) to derive integer sample precision intDeltaMV. The local search may apply a search pattern (e.g., a 3×3 square search pattern), for example, to cycle through a search range [–sHor, sHor] in the horizontal direction and [–sVer, sVer] in the vertical direction. The values ​​of sHor and sVer may be determined (e.g., by block dimensions). The maximum values ​​of sHor and sVer may be 8.

[0148] For example, the bilateral matching cost may be optimally calculated as: bilCost=mvDistanceCost+sadCost. For example, if (e.g., when) the block size cbW*cbH is greater than 64, the MRSAD cost function may be applied to remove the DC effect of the distortion between the reference blocks. For example, if (e.g., when) the bilCost at the center point of the 3×3 search pattern has a specified cost (e.g., a minimum cost), the intDeltaMV local search may terminate. The current minimum cost search point may become a second center point (e.g., a new center point) of the 3×3 search pattern, and the search for the minimum cost may continue, e.g., until the search reaches the end of the search range.

[0149] For example, the existing fractional sample correction can be further applied to derive the final deltaMV. The corrected MV after the first pass can be derived based on equations 1 and 2.

[0150] MV0_pass1 = MV0 + deltaMV Equation 1

[0151] MV1_pass1 = MV1 – deltaMV Equation 2

[0152] For example, in the second pass, subblock-based bilateral matching MV correction may be applied. For example, a corrected MV (e.g., in the second pass) may be derived by applying BM to a subblock (e.g., a 16×16 grid subblock). For a subblock (e.g., each subblock), a corrected MV may be searched around (e.g., two) MVs (e.g., MV0_pass1 and MV1_pass1) in reference picture lists L0 and L1, which may be obtained on the first pass. Based on a bilateral matching cost (e.g., a minimum bilateral matching cost) between two reference subblocks in L0 and L1, a corrected MV (e.g., MV0_pass2(sbIdx2) and MV1_pass2(sbIdx2)) may be derived.

[0153] For a subblock (e.g., each subblock), BM may include performing a search (e.g., a full search) to derive integer sample precision intDeltaMV. The full search may have a search range of [-sHor, sHor] in the horizontal direction and a search range of [-sVer, sVer] in the vertical direction. The values ​​of sHor and sVer may be determined by the block dimension. The maximum values ​​of sHor and sVer may be 8.

[0154] For example, the bilateral matching cost may be calculated by applying a cost factor to the SATD cost between (eg, two) reference sub-blocks, such as: bilCost=satdCost*costFactor. Figure 8 An example of a diamond-shaped area in the search area is illustrated. The search area (2*sHor+1)*(2*sVer+1) can be divided into (eg, up to five) diamond-shaped search areas (eg, Figure 8. As shown in FIG. 1 ). A costFactor may be assigned to a search region (e.g., each search region). The costFactor may be determined by a distance (e.g., intDeltaMV) between (e.g., each) search point and a start MV. For example, diamond-shaped regions (e.g., each diamond-shaped region) may be processed in an order starting from the center of the search area. In (e.g., each) region, the search points may be processed in a raster scan order, for example, starting from the upper left corner to the lower right corner of the region. For example, if (e.g., when) the minimum bilCost within the current search region is less than a threshold value (e.g., a threshold value equal to sbW*sbH), the integer pixel full search may terminate. Otherwise, the integer pixel full search may continue to the next search region, for example, until (e.g., all) search points are checked. For example, if the difference between the previous minimum cost and the current minimum cost in an iteration is less than a threshold value equal to the area of ​​the block, the search process may (e.g., additionally) terminate.

[0155] The DMVR fractional sample correction can be further applied to derive the final deltaMV (sbIdx2). The corrected MV at the second pass can be derived based on Equations 3 and 4.

[0156] MV0_pass2(sbIdx2)=MV0_pass1+deltaMV(sbIdx2) Equation 3

[0157] MV1_pass2(sbIdx2)=MV1_pass1–deltaMV(sbIdx2) Equation 4

[0158] For example, in the third pass, a sub-block based MV correction (e.g., bidirectional optical flow MV correction) may be applied. In the third pass, a corrected MV may be derived by applying bidirectional optical flow (BDOF) to a sub-block (e.g., an 8×8 grid sub-block). For (e.g., each) sub-block (e.g., an 8×8 sub-block), the BDOF correction may be applied to derive scaled Vx and Vy, for example, without clipping (e.g., starting from the corrected MV of the mother sub-block of the second pass). The derived bioMv(Vx, Vy) may be rounded (e.g., to 1 / 16 sample precision) and clipped (e.g., to between -32 and 32).

[0159] The modified MVs at the third pass (MV0_pass3(sbIdx3) and MV1_pass3(sbIdx3)) can be derived using Equations 5 and 6.

[0160] MV0_pass3(sbIdx3)=MV0_pass2(sbIdx2)+bioMv Equation 5

[0161] MV1_pass3(sbIdx3)=MV0_pass2(sbIdx2)–bioMv Equation 6

[0162] Adaptive motion vector correction (eg, decoder-side motion vector correction) may be performed and / or applied.

[0163] The adaptive motion vector correction operation (e.g., adaptive decoder-side motion vector correction operation) can be an extension of multi-pass DMVR, which can include (e.g., two new) merge modes to correct the MV in the direction of bi-directional prediction of the merge candidate (e.g., satisfying the DMVR conditions) (e.g., only in one direction, such as, for example, L0 or L1). The multi-pass DMVR process can be applied to the selected merge candidate, for example, to correct the motion vector. MVD0 or MVD1 can be set to zero in the first pass (e.g., PU level) DMVR.

[0164] Merge candidates for the (e.g., new) merge mode may be derived from spatially neighboring coding blocks, TMVPs, non-neighboring blocks, history-based motion vector predictors (HMVPs), paired candidates, etc. (e.g., similar to in a conventional merge mode). Merge candidates determined to satisfy (e.g., satisfy) the DMVR condition may be added to a candidate list. The same merge candidate list may be used by (e.g., two new) merge modes. The merge index may be coded as in a conventional merge mode.

[0165] Overlapped block motion compensation (OBMC) may be applied. For example, if (eg, when) OBMC is applied, the top and left boundary pixels of the CU may be corrected using motion information of neighboring blocks (eg, using weighted prediction).

[0166] The device may, for example, avoid applying OBMC (e.g., not applying OBMC) based on one or more of the following conditions, including: if (e.g., when) OBMC is disabled at the sequence parameter set (SPS) level; if (e.g., when) the current block has an intra mode or an intra block copy (IBC) mode; if (e.g., when) the current block applies local illumination compensation (LIC); if (e.g., when) the current luminance block area is less than or equal to 32; and so on.

[0167] Sub-block boundary OBMC can be performed by, for example, applying blending (e.g., the same blending) to top sub-block boundary pixels, left sub-block boundary pixels, bottom sub-block boundary pixels, and right sub-block boundary pixels using motion information of neighboring sub-blocks. It can be enabled for one or more of the following sub-block based coding tools: affine AMVP mode; affine merge mode and sub-block based temporal motion vector prediction (SbTMVP); sub-block based bilateral matching; etc.

[0168] For example, if (e.g., when) the OBMC mode is used in a combined intra-frame inter prediction (CIIP) mode with luma mapping and chroma scaling (LMCS), inter-mixing may be performed (e.g., before LMCS mapping of inter-frame samples). LMCS may be applied to the mixed inter-frame samples, for example, which may be combined with intra-frame samples to which LMCS is applied in CIIP mode (e.g., as shown in Equations 7 and 8).

[0169]

[0170] Inter predY It can represent the samples predicted by the motion of the current block in the original domain. predY It can represent the samples predicted in the mapping domain. For example, OMBC predY may represent samples predicted by motion of neighboring blocks in the original domain, and w_0 and w_1 may be weights.

[0171] Adaptive Merge Candidate Re-ranking and Template Matching (ARMC-TM) may be performed.

[0172] The merge candidates may be adaptively reordered, for example, using template matching (TM). The reordering operation may be applied to one or more merge modes, such as, for example, a regular merge mode, a template matching (TM) merge mode, and / or an affine merge mode (e.g., which may exclude SbTMVP candidates). The merge candidates may be reordered before the correction process, for example, for the TM merge mode.

[0173] For example, after constructing the merge candidate list, the merge candidates may be divided into subgroups (e.g., several subgroups). The subgroup size may be set. The subgroup size may be set for the regular merge mode and the TM merge mode (e.g., set to 5 for the regular merge mode and the TM merge mode). The subgroup size is set for the affine merge mode (e.g., set to 3 for the affine merge mode). For example, the merge candidates in (e.g., each) subgroup may be reordered in ascending order according to the cost value (e.g., based on template matching). For example, for simplicity, reordering of the merge candidates in the last subgroup rather than the first subgroup may be avoided (e.g., may not be reordered).

[0174] The template matching cost of the merge candidate can be measured, for example, by the sum of absolute differences (SAD) between the samples of the template of the current block and its corresponding reference samples. The template may include a set of reconstructed samples adjacent to the current block. The reference sample of the template may be located by merging the motion information of the candidate.

[0175] Fig. 9An example template and a reference sample of the template in a reference picture are illustrated. For example, if (e.g., when) the merge candidate utilizes bidirectional prediction, the reference sample of the template of the merge candidate can be (e.g., additionally) generated by bidirectional prediction (e.g., as Fig. 9 shown).

[0176] Fig.10 An example template for a block with sub-block motion using motion information of a sub-block of a current block and a reference sample of the template are illustrated. For example, for a sub-block-based merge candidate with a sub-block size equal to Wsub×Hsub, the upper template may include several sub-templates of size Wsub×1, and the left template may include several sub-templates of size 1×Hsub. Fig.10 As shown, the motion information of the sub-blocks in the first row and the first column of the current block can be used to derive the reference samples of each sub-template.

[0177] A bilateral matching AMVP merge mode may be applied and / or provided.

[0178] The bidirectional predictor may include an AMVP predictor in (e.g., one) direction and a merge predictor in another direction. For example, if (e.g., when) the selected merge predictor and AMVP predictor satisfy the DMVR condition (e.g., where there is at least one reference picture from the past and one reference picture from the future relative to the current picture and the distances from the two reference pictures to the current picture are the same), this mode may be enabled for the coding block. Bilateral matching MV correction may be applied to the merge MV candidates and AMVP MVP as a starting point. For example, if template matching functionality is enabled, the template matching MV correction may be applied to the merge predictor or the AMVP predictor (e.g., which has a higher template matching cost).

[0179] The AMVP portion of the pattern may be signaled as a conventional unidirectional AMVP (eg, reference index and MVD are signaled). For example, the AMVP portion of the pattern may have a derived MVP index if template matching is used or MVP index is signaled when template matching is disabled.

[0180] For example, for the AMVP direction LX, X may be 0 or 1. The merge portion in the other direction (1-LX) may be implicitly derived, for example, by minimizing the bilateral matching cost between the AMVP predictor and the merge predictor (e.g., for a pair of AMVP and merge motion vectors). For example, for each merge candidate in the merge candidate list having the other direction (1-LX) motion vector, the bilateral matching cost may be calculated using the merge candidate MV and the AMVP MV. The merge candidate may be selected, for example, based on the cost (e.g., the merge candidate with the minimum cost may be selected). The bilateral matching correction may be applied to the coding block using the selected merge candidate MV and the AMVP MV as a starting point.

[0181] A third pass of multi-pass DMVR may be enabled for AMVP merge mode coding blocks (eg, it may be an 8x8 sub-PU BDOF correction of multi-pass DMVR).

[0182] The mode may be indicated by a mark. For example, if the mode is enabled, the AMVP direction LX may be indicated by a mark (eg, an additional mark).

[0183] Decoder-side intra mode derivation (DIMD) may be performed. Multiple (e.g., two) intra modes may be derived from reconstructed neighboring samples (e.g., when DIMD is applied), and the (e.g., two) predictors may be combined with a planar mode predictor (e.g., with weights derived from gradients). The division operation in the weight derivation may be performed using an integerization scheme (e.g., used by CCLM) based on a lookup table (e.g., the same lookup table (LUT)). For example, the division operation in the orientation calculation (e.g., as shown in Equation 1) may be calculated by a LUT-based scheme (e.g., as shown in Equations 2-4).

[0184] Orient=G_y / G_xEquation 1

[0185] x = Floor(Log2(Gx)) Equation 2

[0186] normDiff = ((Gx<<4)>>x) and 15 Equation 3

[0187] x+=(3+(normDiff!=0)?1:0) Equation 4

[0188] Orient=(Gy*(DivSigTable[normDiff]|8)+(1<<(x-1)))>>x Equation 5

[0189] In the example, DivSigTable

[16] = {0,7,6,5,5,4,4,3,3,2,2,1,1,1,1,0}.

[0190] The derived intra-mode may be included in a list (e.g., a master list) of intra most probable modes (MPMs). For example, the DIMD process may be performed before constructing the MPM list. The master derived intra-mode of a DIMD block may be stored with the block and may be used for MPM list construction of neighboring blocks.

[0191] Fusion may be applied and / or provided, for example, for template-based intra mode derivation (TIMD). For (e.g., each) intra prediction mode in the MPM, a SATD may be calculated (e.g., between the prediction sample and the reconstructed sample of the template). Multiple (e.g., two) intra prediction modes (e.g., with the minimum SATD) may be selected as TIMD modes. Position dependent intra prediction combination (PDPC) may be included in the derivation of the TIMD mode. For example, after applying the PDPC process, (e.g., two) TIMD modes may be fused with weights. Weighted intra prediction may be used to encode the current CU.

[0192] The cost of the (eg, two) selected modes is compared to a threshold. In testing, a cost factor of 2 may be applied based on Eq. 6.

[0193] costMode2<2*costMode1 Equation 6

[0194] For example, if this condition is true (eg, as shown in Equation 6), then fusion is applied. Otherwise, mode 1 may be used (eg, only used).

[0195] The weights of these modes may be calculated based on their SATD costs, for example, using Equations 7 and 8.

[0196] weight1 = costMode2 / (costMode1 + costMode2) Equation 7

[0197] weight 2 = 1 - weight 1 Equation 8

[0198] The division operation may be performed using a LUT (eg, the same LUT) based integerization scheme (eg, used by CCLM).

[0199] Non-adjacent spatial candidates may be inserted and / or provided. In a conventional merge candidate list, non-adjacent spatial merge candidates may be inserted, for example, after the TMVP. Fig.11 An example of spatial neighboring blocks for deriving spatial merge candidates is illustrated. There may be a pattern of spatial merge candidates (e.g., Fig.11 ). The distance between non-adjacent spatial candidates and the current decoding block may be based on the width and height of the current decoding block. The line buffer limit may not apply.

[0200] Dependencies between decoding and reconstruction in the pipeline may be eliminated or reduced. For example, when template-based encoding (e.g., template matching (TM) operations) are used, dependencies between decoding and reconstruction in the pipeline may be eliminated or reduced. Template-based encoding may include operations using a template around a current block and a displacement template in a reference frame. For example, when a bilateral matching method (e.g., DMVR or BM, or a template-based intra-frame mode such as TIMD) is used, dependencies between decoding and reconstruction in the pipeline may be eliminated or reduced.

[0201] Fast template reconstruction may be applied. Fast template reconstruction may include, for example, partial reconstruction of a block using initial (eg, unrefined) motion information.

[0202] Fig.12 An example fast template reconstruction pipeline is illustrated.A template reconstruction stage for a given block may be added (eg, instead of having a given block's motion information decoding dependency on previously reconstructed blocks).

[0203] Fig.13 An example block template reconstruction is illustrated. Fig.13 As shown, sub-block "b" can be used to reconstruct template "t" in the current block c.

[0204] The sub-block may contain motion information (e.g., motion vectors) that may be used to reconstruct template "t", for example, by applying motion compensation (e.g., without adding a residual). For example, the motion information used to reconstruct template "t" may be unrefined motion information. The motion information (e.g., unrefined motion information) may be associated with a first block (e.g., adjacent to a second block). The first block may be partially reconstructed based on the motion information associated with the first block. Template "t" may be obtained, for example, based on the partially reconstructed first block (e.g., before completing and / or initiating a full reconstruction of the first block). Template "t" may be a fast template of the second block, for example, using integer motion compensation (e.g., instead of fractional motion compensation). The template of the second block may include multiple prediction samples associated with the first block. The second block may be reconstructed, for example, based on the obtained template.

[0205] In an example, a partial reconstruction of the first block may be performed. The partial reconstruction of the first block may include, for example, obtaining a prediction of the first block based on motion information associated with the first block. For example, if a partial reconstruction is initiated and / or performed (e.g., afterwards) and / or if a template of the second block (e.g., based on a partial / fast reconstruction of the first block) is obtained (e.g., afterwards), a full reconstruction of the first block may be performed. The full reconstruction of the first block may be performed, for example, based on refining the motion information associated with the first block. The unrefined motion information may be refined. In an example, the reconstruction of the second block (e.g., based on the template) may be performed in parallel with the full reconstruction of the first block (e.g., based on the refined motion information). Creating the template may eliminate the dependency of fully reconstructing the first block when reconstructing the second block (e.g., because the second block is reconstructed based on a template derived from a fast / partial reconstruction of the first block). The second block may be reconstructed independently of the fully reconstructed first block.

[0206] The template can be used for template-based operations (e.g., ARMC, TM, etc.). For example, compared to the (e.g., real, reconstructed) samples in the template extracted from the reconstructed block, the template can reduce or prevent (e.g., not require) a long delay in reconstruction. Constraints (e.g., some constraints) can be added to the motion vector used to reconstruct the template. For example, if the block is intra-frame or partially intra-frame (e.g., CIIP mode), the motion vector can be marked as missing, and reconstruction of the corresponding part of the template can be avoided (e.g., not reconstructed). The motion information used can be motion information before the refinement process, such as DMVR, TM, BM, etc. The motion information can be (e.g., additionally or alternatively) motion information before the ARMC process is applied (e.g., as described herein with respect to motion information propagation).

[0207] In an example, the extracted motion vector may be a motion vector (e.g., only a motion vector) pointing to a given reference frame in a reference list. For example, the motion vector of the reference frame at index 0 in reference list L0 or L1 may be used (e.g., only the motion vector of the reference frame at index 0 in reference list L0 or L1 may be used), and other motion vectors may be discarded and / or marked as missing.

[0208] In an example, motion vectors that reference a reference frame with a non-zero index may be rescaled to point to reference frame 0.

[0209] In an example, the template may be obtained using motion information from sub-blocks without residual information (eg, skipped blocks) (eg, the template may be reconstructed using only motion information from sub-blocks without residual information).

[0210] For example, if the number of samples in a template is below a threshold (e.g., half the number of complete templates), the template may be marked as unusable (e.g., for a particular block). For example, if a template is marked as unusable, a template operation (e.g., ARMC or TM) may be skipped.

[0211] In an example, the top portion of the template may use reconstructed samples from a reconstructed block, for example, because they may be considered reconstructed. In an example, this portion of the template may use reconstructed samples outside the current CTU.

[0212] It may be assumed that the template has already been reconstructed (eg, using operations as described herein). For example, motion information propagation may be performed to reduce the latency of template reconstruction.

[0213] ARMC based dependency elimination may be applied. Fig.14 An example ARMC workflow is illustrated. A candidate list (e.g., such as a candidate list) may be created from candidates (e.g., spatial, temporal, and / or HMVP candidates). Fig.14 ). A template cost may be calculated for (eg, each) candidate. For example, the candidates may be reordered according to the cost (eg, as Fig.14 ). You can select a candidate (e.g., Fig.14 ), for example, select candidate idx in list L'.

[0214] Candidate 0 propagation may be applied and / or provided. In an example, the candidate to be propagated may be the first candidate in a list L (e.g., an original list L). Decoding and / or reconstruction of a neighboring block may start (e.g., immediately and / or may start in parallel with current block reconstruction), for example, by inferring the candidate to be 0. Motion information after the decoding process (e.g., final motion information) may be stored in the block, for example, for use as temporal motion information (e.g., for motion information propagation).

[0215] The non-reordered candidates may be considered for motion propagation. It may be assumed that the reordering process of ARMC affects some scenes (e.g., only in some cases). In an example, it may be considered that, for example, the candidates at the decoded index in the list (e.g., before reordering) are propagated as motion vector candidates. For example, Table 2 shows example statistics found on a data set (e.g., a small data set) using typical video sequence content and target rate.

[0216]

[0217]

[0218] Table 2

[0219] The dependency between candidates before and after the reordering may be low, for example, as shown in Table 2 (eg, after index 4).

[0220] In an example, the propagated candidate can be a candidate in the original list (e.g., if the index is less than a threshold, such as 4), for example, considering statistics about dependencies between candidates before and after reordering. If the index is above (e.g., not less than) the threshold, the first candidate (e.g., index 0) can be selected for propagation.

[0221] In an example, propagation of motion vector candidates may be performed, for example, before a TM process for a particular block. Fig.15 An example candidate propagation is illustrated. Fig.15 As shown in the figure, the left figure may illustrate the default process for a simple example with two spatial candidates (e.g., top and left). The logic may be similar for other spatial candidates. Fig.15 As shown in , T and L may represent the top and left initial motion vectors. Fig.15 As shown in , T' and L' may represent, for example, the top and left refined motion vectors after template refinement. Fig.15 As shown in , P may be a motion vector candidate selected for the current block. Fig.15 As shown in , on the right, this process may, for example, propagate motion vectors before template refinement.

[0222] TM may be performed after ARMC.In some examples, ARMC may be performed on the motion prediction candidate list, and the selected motion vector before refinement may be propagated as the motion information of the block. Fig.16 An example motion vector propagation is illustrated. In an example, the ARMC stage (eg, only the ARMC stage) may be used, for example, to propagate motion vectors, but refinement may not be used for spatial motion vector propagation (eg, as Fig.16 as depicted in ).

[0223] Can perform combined ARMC and TM operations. Fig.17 An example of the coordination of ARMC and TM operations is illustrated. In an example (eg, in some modes), the AMRC operation may be used, for example, after (eg, each) potential candidate has been refined (eg, by TM operation), for example, as Fig.17 As shown in . In some examples, the propagated candidates may be L'[idx]. In some examples, the propagated candidates may be L[idx]. For example, the candidates may be neither refined nor reordered.

[0224] In an example, the candidates may, for example, not be refined, and a process for fast template reconstruction (eg, as described herein) may be used.

[0225] In an example, for example, the TM stage may be skipped, but the ordering by ARMC may be used. The ordering by ARMC may be used to generate a list for propagation (eg, only for propagation), as described herein.

[0226] Non-neighboring candidates with the final vector may be considered for motion propagation. The use of a motion vector (e.g., the final motion vector) as a spatial candidate may be delayed (e.g., delayed by a fixed number of reconstructed samples) to, for example, mitigate non-propagation of reordered and / or refined motion vectors. Fig.18 A simplified example of spatial motion vector candidates is shown. As shown, three adjacent motion vector candidates may be available (e.g., top right, top left, and bottom left). As shown, four non-adjacent motion vector candidates may be available (e.g., top left and top right, top left and bottom left).

[0227] Fig.19 An example of non-adjacent motion vector updates is illustrated. As shown, the process may be delayed by half a CTU size in the horizontal direction. As shown, a bold square may represent a CTU, and each thin square may represent a CU within the CTU.

[0228] For example, neighboring motion vector candidates a and b may be selected (eg, employed) as candidates before reordering and / or refinement as described herein (eg, during decoding of CU 2 ), since the final motion vector may introduce a delay in the reconstruction of block 2 .

[0229] For example, neighboring motion vector candidates d and e may be selected (e.g., adopted) as candidates before reordering and / or refinement as described herein (e.g., during decoding of CU 4), ​​because the final motion vector may introduce a delay on the reconstruction of block 4. For example, non-neighboring motion vector candidates at positions a and b and neighboring motion vector candidates c and f may be selected (e.g., adopted) after reordering and / or refinement of motion vectors, because it may be assumed that the process for reconstructing block 1 has been completed.

[0230] Fig. 20 An example of a delay-space candidate update pipeline is illustrated. Fig. 20 The decoding pipeline generated by the delay process is shown in FIG. Fig. 20 As shown in , for example, the reconstruction of blocks 1, 2, and 3 can be performed in parallel because the decoding of motion information may not depend on the reconstruction of the blocks. Fig. 20 As shown in , the decoding of block 4 motion information may depend on the final motion information of reconstructed block 1.

[0231] In an example, the vertical sample number limit considering the final motion information may be different from the horizontal sample number limit.

[0232] Fig.21An example of block delay in reconstructing samples is illustrated. In the example, the distance to adopt the final motion information can be determined by the number of samples decoded from the upper left corner of the current block (e.g., Fig.21 ). As shown in the figure, the number of decoded samples from block 4 to block 1 may be: the area of ​​block 1 + the area of ​​block 2 + the area of ​​block 3 = 128*128 samples. As shown in the figure, the number of decoded samples from block 6 to block 3 may be: the area of ​​block 3 + the area of ​​block 4 + the area of ​​block 5 = 128*64+64*64+32*64 samples.

[0233] In an example, for example, blocks coded in inter mode (eg, only blocks coded in inter mode) may be counted because intra-coded blocks may (eg, typically) be reconstructed after inter-coded blocks.

[0234] Although features and elements are described above in specific combinations, it will be understood by those of ordinary skill in the art that each feature or element may be used alone or in any combination with other features and elements. In addition, the methods described herein may be implemented in a computer program, software, or firmware incorporated in a computer-readable medium for execution by a computer or processor. Examples of computer-readable media include electronic signals (sent via a wired or wireless connection) and computer-readable storage media. Examples of computer-readable storage media include, but are not limited to, read-only memory (ROM), random access memory (RAM), registers, cache memory, semiconductor memory devices, magnetic media (such as built-in hard disks and removable disks), magneto-optical media, and optical media (such as CD-ROM disks and digital versatile disks (DVDs)). A processor associated with software may be used to implement a radio frequency transceiver for a WTRU, UE, terminal, base station, RNC, or any host computer.

Claims

1. A video decoding device, the video decoding device comprising: A processor, the processor being configured to: obtaining motion information associated with the first block; partially reconstructing the first block based on the motion information associated with the first block; Obtaining a template of a second block based on the partially reconstructed first block; as well as Based on the obtained template of the second block, the second block is reconstructed using a template-based decoding tool. 2 . The video decoding apparatus according to claim 1 , wherein the template of the second block includes a partial reconstructed sample of the first block adjacent to the second block.

3. The video decoding apparatus according to claim 1, wherein partially reconstructing the first block comprises: A prediction of the first block is obtained based on the motion information associated with the first block, wherein the template of the second block includes a plurality of prediction samples of the first block.

4. The video decoding apparatus according to claim 1, wherein partially reconstructing the first block comprises: obtaining a prediction of the first block based on the motion information associated with the first block, wherein the template of the second block comprises a plurality of prediction samples of the first block, and decoding the second block using the template-based coding tool based on the plurality of prediction samples of the first block, and wherein the processor is further configured to: The first block is reconstructed based on the prediction of the first block and a residual of the first block. 5 . The video decoding apparatus of claim 1 , wherein reconstructing the second block using the template-based coding tool based on the obtained template of the second block is initiated before fully reconstructing the first block.

6. The video decoding device according to claim 1, wherein the motion information associated with the first block for partially reconstructing the first block is unrefined motion information, and wherein the processor is further configured to: After partially reconstructing the first block, refining the unrefined motion information associated with the first block; and The first block is reconstructed based on the refined motion information.

7. The video decoding device according to claim 4 or 6, wherein the reconstruction of the second block is performed in parallel with the reconstruction of the first block.

8. The video decoding device according to claim 1, wherein the processor is further configured to: The first block is fully reconstructed, wherein the second block is reconstructed independently of the fully reconstructed first block.

9. The video decoding device according to claim 1, wherein the processor is further configured to: obtaining a motion vector candidate list for the first block, wherein the motion information associated with the first block is obtained based on the motion vector candidate list; reordering the motion vector candidate list of the first block based on adaptive merge candidate reordering (ARMC); and The first block is reconstructed based on the reordered motion vector candidate list of the first block.

10. A video encoding device, the video encoding device comprising: A processor, the processor being configured to: obtaining motion information associated with the first block; partially reconstructing the first block based on the motion information associated with the first block; Obtaining a template of a second block based on the partially reconstructed first block; as well as Based on the obtained template of the second block, the second block is encoded using a template based coding tool.

11. The video encoding device according to claim 10, wherein the processor is further configured to: determining whether to perform fast template reconstruction on the second block; and Performing fast template reconstruction on the second block based on the determination includes an indication indicating enabling fast template reconstruction in the video data.

12. The video encoding device according to claim 10, wherein the motion information associated with the first block for obtaining the template of the second block is unrefined motion information, and the processor is first configured to: refining the unrefined motion information associated with the first block; and The first block is encoded based on the refined motion information.

13. The video encoding device according to claim 10, wherein the processor is further configured to: obtaining a motion vector candidate list for the first block, wherein the motion information associated with the first block is obtained based on the motion vector candidate list; reordering the motion vector candidate list of the first block based on adaptive merge candidate reordering (ARMC); as well as The first block is encoded based on the reordered motion vector candidate list of the first block.

14. The video encoding device according to claim 10, wherein the processor is further configured to: obtaining a motion vector candidate list for the first block, wherein the motion information associated with the first block is obtained based on the motion vector candidate list; reordering the motion vector candidate list of the first block based on adaptive merge candidate reordering (ARMC); as well as The first block is encoded based on the reordered motion vector candidate list of the first block.

15. The video encoding device according to claim 10, wherein the processor is further configured to: obtaining a prediction of the first block based on the motion information associated with the first block, wherein the template of the second block includes a plurality of prediction samples of the first block, and encoding the second block using the template-based coding tool based on the plurality of prediction samples of the first block in the template of the second block; and The first block is encoded based on the prediction of the first block and a residual of the first block. 16 . The video encoding apparatus according to claim 10 , wherein the template of the second block includes a partial reconstructed sample of the first block adjacent to the second block.

17. The video encoding apparatus of claim 10, wherein encoding the second block using the template-based coding tool based on the obtained template of the second block is initiated before fully reconstructing the first block.

18. The video encoding device of claim 15, wherein encoding of the second block is performed in parallel with reconstruction of the first block.

19. A method comprising: obtaining motion information associated with the first block; partially reconstructing the first block based on the motion information associated with the first block; Obtaining a template of a second block based on the partially reconstructed first block; as well as Based on the obtained template of the second block, the second block is reconstructed using a template-based decoding tool.

20. The method of claim 19, wherein the template of the second block comprises a partially reconstructed sample of the first block adjacent to the second block.

21. The method of claim 19, wherein partially reconstructing the first block comprises: A prediction of the first block is obtained based on the motion information associated with the first block, wherein the template of the second block includes a plurality of prediction samples of the first block.

22. The method of claim 19, wherein partially reconstructing the first block comprises: obtaining a prediction of the first block based on the motion information associated with the first block, wherein the template of the second block comprises a plurality of prediction samples of the first block, and decoding the second block using the template-based coding tool based on the plurality of prediction samples of the first block, and wherein the method further comprises: The first block is reconstructed based on the prediction of the first block and a residual of the first block.

23. The method of claim 19, wherein reconstructing the second block using the template-based coding tool based on the obtained template of the second block is initiated before fully reconstructing the first block.

24. The method of claim 19, wherein the motion information associated with the first block for partially reconstructing the first block is unrefined motion information, and wherein the method further comprises: After partially reconstructing the first block, refining the unrefined motion information associated with the first block; as well as The first block is reconstructed based on the refined motion information.

25. A method according to claim 22 or 24, wherein the reconstruction of the second block is performed in parallel with the reconstruction of the first block.

26. The method of claim 19, wherein the method further comprises: The first block is fully reconstructed, wherein the second block is reconstructed independently of the fully reconstructed first block.

27. The method of claim 19, wherein the method further comprises: obtaining a motion vector candidate list for the first block, wherein the motion information associated with the first block is obtained based on the motion vector candidate list; reordering the motion vector candidate list of the first block based on adaptive merge candidate reordering (ARMC); and The first block is reconstructed based on the reordered motion vector candidate list of the first block.

28. A method comprising: obtaining motion information associated with the first block; partially reconstructing the first block based on the motion information associated with the first block; Obtaining a template of a second block based on the partially reconstructed first block; as well as Based on the obtained template of the second block, the second block is encoded using a template based coding tool.

29. The method according to claim 28, further comprising: determining whether to perform fast template reconstruction on the second block; as well as Performing fast template reconstruction on the second block based on the determination includes an indication indicating enabling fast template reconstruction in the video data.

30. The method of claim 28, wherein the motion information associated with the first block used to obtain the template of the second block is unrefined motion information, and the method further comprises: refining the unrefined motion information associated with the first block; as well as The first block is encoded based on the refined motion information.

31. The method of claim 28, wherein the method further comprises: obtaining a motion vector candidate list for the first block, wherein the motion information associated with the first block is obtained based on the motion vector candidate list; reordering the motion vector candidate list of the first block based on adaptive merge candidate reordering (ARMC); as well as The first block is encoded based on the reordered motion vector candidate list of the first block.

32. The method of claim 28, wherein the method further comprises: obtaining a prediction of the first block based on the motion information associated with the first block, wherein the template of the second block includes a plurality of prediction samples of the first block, and encoding the second block using the template-based coding tool based on the plurality of prediction samples of the first block in the template of the second block; as well as The first block is encoded based on the prediction of the first block and a residual of the first block.

33. The method of claim 28, wherein the template of the second block comprises a partially reconstructed sample of the first block adjacent to the second block.

34. The method of claim 28, wherein encoding the second block using the template-based coding tool based on the obtained template of the second block is initiated before fully reconstructing the first block.

35. The method of claim 28, wherein encoding of the second block is performed in parallel with reconstruction of the first block.

36. A computer readable medium comprising instructions for causing one or more processors to perform the method of any one of claims 19 to 35.

37. A device, comprising: The device according to any one of claims 1 to 18; and At least one of: (i) an antenna configured to receive a signal, the signal comprising data representing an image; (ii) a frequency band limiter configured to limit the received signal to a frequency band comprising the data representing the image; or (iii) a display configured to display the image.

38. Video data comprising data generated by the method according to any one of claims 28 to 35.

39. The device of any one of claims 1 to 18, wherein the device comprises a memory.

Images