HMVP candidate reordering

Abstract

Systems, methods, and instrumentalities may be provided for history-based motion vector prediction (HMVP) candidate reordering. A video decoding apparatus may obtain a history-based motion vector prediction (HMVP) candidate list of a current block, the HMVP list including a plurality of HMVP candidates. The device may determine a template matching cost for an HMVP candidate from the plurality of HMVP candidates. The device may reorder the HMVP candidate list based on the template matching cost of the HMVP candidates. The device may decode the current block based on the reordered HMVP candidate list.

Description

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims the benefit of European Provisional Patent Application No. 22306987.3, filed on December 22, 2022, the contents of which are hereby incorporated by reference. Background Art

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

[0004] Systems, methods, and means for reordering history-based motion vector prediction (HMVP) candidates may be provided. A video decoding device may obtain a list of HMVP candidates for a current block. The HMVP list may include multiple HMVP candidates. The device may determine corresponding template matching costs associated with corresponding HMVP candidates. The device may reorder the list of HMVP candidates based on the template matching costs of the HMVP candidates. The device may decode the current block based on the reordered list of HMVP candidates.

[0005] The HMVP candidate list may be reordered based on the template matching costs of the HMVP candidates. For example, the HMVP candidates in the HMVP candidate list may be reordered so that the candidates are arranged in descending order based on the corresponding template matching costs.

[0006] One or more HMVP candidates may be selected from the reordered HMVP candidate list. The selected HMVP candidate may include a lowest template matching cost among the HMVP candidates in the HMVP candidate list. The device may decode the current block based on the selected HMVP candidate.

[0007] For example, an Advanced Motion Vector Predictor (AMVP) list of the current block may be constructed based on the reordered HMVP candidate list. The device may perform motion compensation on the current block based on the AMVP list.

[0008] A determination may be made for an HMVP candidate from the reordered HMVP list whether a motion vector associated with the HMVP candidate and the reference frame uses the same reference frame as the searched reference frame. The device may include the HMVP candidate in a motion vector predictor list associated with the current block based on a determination that the motion vector associated with the HMVP candidate and the reference frame uses the same reference frame as the searched reference frame.

[0009] The device may perform motion compensation on the current block based on the motion vector predictor list. The validity of the HMVP candidate may be determined based on the motion vector associated with the HMVP candidate and the reference frame using the same reference frame as the searched reference frame. Based on the determination that the motion vector associated with the HMVP candidate and the reference frame uses the same reference frame as the searched reference frame, the device may include the HMVP candidate in the reordered HMVP candidate list.

[0010] The validity of the HMVP candidate may be determined based on a motion vector associated with the HMVP candidate and the reference frame using the same reference frame as the searched reference frame. Based on determining that the HMVP candidate is valid, the HMVP candidate may be considered for use in the re-ordered HMVP candidate list. Based on determining that the HMVP candidate is invalid, the HMVP candidate may be excluded from the re-ordered HMVP candidate list.

[0011] The device may determine an adaptive motion vector resolution (AMVR) of the current block. The device may determine a template matching cost of the HMVP candidate based on the AMVR. The device may reorder the HMVP candidates in the HMVP candidate list based on the template matching cost.

[0012] A video encoding device may obtain a HMVP candidate list for a current block. The HMVP list may include multiple HMVP candidates. The device may determine corresponding template matching costs associated with corresponding HMVP candidates. The device may reorder the HMVP candidate list based on the template matching costs of the HMVP candidates. The device may encode the current block based on the reordered HMVP candidate list.

[0013] The HMVP candidate list may be reordered based on the template matching costs of the HMVP candidates. For example, the HMVP candidates in the HMVP candidate list may be reordered so that the candidates are arranged in descending order based on the corresponding template matching costs.

[0014] One or more HMVP candidates may be selected from the reordered HMVP candidate list. The selected HMVP candidate may include a lowest template matching cost among the HMVP candidates in the HMVP candidate list. The device may encode the current block based on the selected HMVP candidate.

[0015] For example, an Advanced Motion Vector Predictor (AMVP) list of the current block may be constructed based on the reordered HMVP candidate list. The device may perform motion compensation on the current block based on the AMVP list.

[0016] A determination may be made for an HMVP candidate from the reordered HMVP list whether a motion vector associated with the HMVP candidate and the reference frame uses the same reference frame as the searched reference frame. The device may include the HMVP candidate in a motion vector predictor list associated with the current block based on a determination that the motion vector associated with the HMVP candidate and the reference frame uses the same reference frame as the searched reference frame.

[0017] The device may perform motion compensation on the current block based on the motion vector predictor list. The validity of the HMVP candidate may be determined based on the motion vector associated with the HMVP candidate and the reference frame using the same reference frame as the searched reference frame. Based on the determination that the motion vector associated with the HMVP candidate and the reference frame uses the same reference frame as the searched reference frame, the device may include the HMVP candidate in the re-ordered HMVP candidate list.

[0018] The validity of the HMVP candidate may be determined based on a motion vector associated with the HMVP candidate and the reference frame using the same reference frame as the searched reference frame. Based on determining that the HMVP candidate is valid, the HMVP candidate may be considered for use in the re-ordered HMVP candidate list. Based on determining that the HMVP candidate is invalid, the HMVP candidate may be excluded from the re-ordered HMVP candidate list.

[0019] The device may determine an adaptive motion vector resolution (AMVR) of the current block. The device may determine a template matching cost of the HMVP candidate based on the AMVR. The device may reorder the HMVP candidates in the HMVP candidate list based on the template matching cost.

[0020] 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., from encoders and / or received by decoders). Computer-readable media 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

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

[0022] Figure 1B is a diagram showing that according to an embodiment, Figure 1A A system diagram of an example wireless transmit / receive unit (WTRU) for use in a communication system is shown.

[0023] Figure 1C is a diagram showing that according to an embodiment, Figure 1A System diagram of an example radio access network (RAN) and an example core network (CN) used in the illustrated communication system.

[0024] Figure 1D is a diagram showing that according to an embodiment, Figure 1A System diagram of yet another example RAN and yet another example CN used in the communication system shown.

[0025] Figure 2 An example video encoder is shown.

[0026] Figure 3 An example video decoder is shown.

[0027] Figure 4 An example of a system is shown in which various aspects and examples may be implemented.

[0028] Figure 5 An example of HMVP usage in merge list construction is shown.

[0029] Figure 6 An example of HMVP usage in AMVP list construction is shown.

[0030] Figure 7 Examples of templates and reference samples of templates in reference pictures are shown.

[0031] Figure 8 An example of a template of a block having sub-block motion using motion information of a sub-block of a current block and a reference sample of the template is shown.

[0032] Figure 9 Examples of spatial and non-adjacent spatial locations are shown.

[0033] Figure 10 An example of HMVP reordering of an AMVP list is shown (eg, crossing to indicate invalid motion vectors (MVs)). DETAILED DESCRIPTION

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

[0035] Figure 1Ais 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, and the like, to multiple wireless users. The communication system 100 may enable multiple wireless users to access such content by sharing 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 UWDTS-s OFDM), unique word OFDM (UW-OFDM), resource block filtered OFDM, filter bank multi-carrier (FBMC), and the like.

[0036] like Figure 1A As 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, the Internet 110, and other networks 112. However, it will be appreciated 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 transmit 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 smartphone, 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 equipment and applications (e.g., remote surgery), industrial equipment 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.

[0037] 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 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), or a wireless router. While the base stations 114a, 114b are 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.

[0038] Base station 114a may be part of 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), relay nodes, etc. Base station 114a and / or base station 114b may be configured to transmit 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 licensed spectrum, unlicensed spectrum, or a combination of licensed and unlicensed spectrum. A cell may provide wireless service coverage to a specific geographic area, which may be relatively fixed or may change over time. A cell may also be divided into cell sectors. For example, the cell associated with base station 114a may be divided into three sectors. Thus, in one embodiment, base station 114a may include three transceivers, one for each sector of the cell. In one embodiment, 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 transmit and / or receive signals in a desired spatial direction.

[0039] 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).

[0040] More specifically, as described 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, and the like. 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 establish the air interface 115 / 116 / 117 using Wideband CDMA (WCDMA). 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).

[0041] In one 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), which may establish the air interface 116 using Long Term Evolution (LTE) and / or LTE-Advanced (LTE-A) and / or LTE-Advanced Pro (LTE-A Pro).

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

[0043] 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 jointly implement LTE radio access and NR radio access, e.g., using dual connectivity (DC) principles. Thus, the air interface utilized by the WTRUs 102a, 102b, 102c may be characterized by multiple types of radio access technologies and / or transmissions to / from multiple types of base stations (e.g., eNBs and gNBs).

[0044] In other embodiments, the base station 114a and the WTRUs 102a, 102b, 102c may implement a radio technology 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.

[0045] For example, Figure 1A The base station 114b in the embodiment may be a wireless router, a Home Node-B, a Home eNode-B, or an access point, and may utilize any suitable RAT to facilitate wireless connectivity in a local area, such as a business, 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 one 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. Figure 1A As shown, base station 114b may have a direct connection to the Internet 110. Thus, base station 114b may not be required to access the Internet 110 via CN 106 / 115.

[0046] 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 in Figure 1AAlthough not shown, 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, CDMA2000, WiMAX, E-UTRA, or WiFi radio technology.

[0047] 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) from the TCP / IP internet protocol suite. The networks 112 may include wired 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.

[0048] Some or all of the WTRUs 102a, 102b, 102c, 102d in the communication system 100 may include multi-modal 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 WTRU 102c shown in FIG. 1 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.

[0049] 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 supply 134, a global positioning system (GPS) chipset 136, and / or other peripherals 138. It will be appreciated that the WTRU 102 may include any subcombination of the foregoing elements while remaining consistent with an embodiment.

[0050] 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 coding, 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.

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

[0052] Although the transmit / receive element 122 Figure 1B Although depicted as a single element in FIG. 1 , 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.

[0053] The transceiver 120 may be configured to modulate signals to be transmitted by the transmit / receive element 122 and demodulate signals received by the transmit / receive element 122. As described above, the WTRU 102 may have multi-modal capabilities. Thus, the transceiver 120 may include multiple transceivers to enable the WTRU 102 to communicate via multiple RATs, such as NR and IEEE 802.11.

[0054] 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. Furthermore, the processor 118 may access information from and store data in any type of suitable memory, such as non-removable memory 130 and / or removable memory 132. The non-removable memory 130 may include random access memory (RAM), 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 memory that is not physically located on the WTRU 102, such as on a server or a home computer (not shown).

[0055] The processor 118 may receive power from the power source 134 and may be configured to distribute and / or control power to the 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.

[0056] 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.

[0057] The processor 118 may also be coupled to other peripherals 138, which may include one or more software 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, an electronic game player module, an Internet browser, a virtual reality and / or augmented reality (VR / AR) device, an activity tracker, etc. The peripheral device 138 may include one or more sensors, which may be a gyroscope, an accelerometer, a Hall effect sensor, a magnetometer, an orientation sensor, a proximity sensor, a temperature sensor, a time sensor; a geographic location sensor; an altimeter, a light sensor, a touch sensor, a magnetometer, a barometer, a posture sensor, a biometric sensor, and / or a humidity sensor.

[0058] 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 both 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 to reduce and / or substantially eliminate self-interference through hardware (e.g., a choke) or through signal processing by a processor (e.g., a separate processor (not shown) or by the processor 118). In one embodiment, the WTRU 102 may include a half-duplex radio for which transmission and reception of some or all signals (e.g., associated with specific subframes for both UL (e.g., for transmission) or downlink (e.g., for reception)) may be concurrent and / or simultaneous.

[0059] Figure 1C 1 is a system diagram illustrating the RAN 104 and the CN 106 according to an embodiment. As described 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.

[0060] The RAN 104 may include eNode-Bs 160a, 160b, 160c, though it will be appreciated that the RAN 104 may include any number of eNode-Bs while remaining consistent with an embodiment. The eNode-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 eNode-Bs 160a, 160b, 160c may implement MIMO technology. Thus, for example, the eNode-B 160a may use multiple antennas to transmit wireless signals to, and / or receive wireless signals from, the WTRU 102a.

[0061] Each of the eNode-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, user scheduling in UL and / or DL, etc. Figure 1C As shown, eNode-Bs 160a, 160b, and 160c may communicate with each other via an X2 interface.

[0062] Figure 1C The CN 106 shown in FIG. 1 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 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.

[0063] The MME 162 may be connected to each of the eNode-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, and the like. The MME 162 may also 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.

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

[0065] 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.

[0066] 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 communicate 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 and / or wireless networks owned and / or operated by other service providers.

[0067] Even though the WTRU Figures 1A-1D Although described as a wireless terminal, it is contemplated that in certain representative embodiments such a terminal may employ (eg, temporarily or permanently) a wired communication interface with a communication network.

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

[0069] A WLAN in infrastructure basic service set (BSS) mode may have an access point (AP) for the BSS and one or more stations (STAs) associated with the AP. The AP may have access or an interface to a distributed system (DS) or another type of wired / wireless network that transmits traffic to and / or out of the BSS. Traffic originating from outside the BSS and destined for a STA may reach the AP and be delivered to the STA. Traffic from a STA to a destination outside the BSS may be sent to the AP for delivery to the corresponding destination. For example, traffic between STAs within a BSS may be sent through the AP, where the source STA may send traffic to the AP, and the AP may deliver traffic to the destination STA. Traffic between STAs within a BSS may be considered and / or referred to as peer-to-peer traffic. Peer-to-peer traffic may be sent between the source and destination STAs (e.g., directly between them) using direct link setup (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 (eg, all STAs) within or using the IBSS may communicate directly with each other. The IBSS communication mode is sometimes referred to herein as an "ad-hoc" communication mode.

[0070] When using 802.11ac infrastructure operating mode or a similar operating mode, the AP can transmit beacons on a fixed channel (such as a primary channel). The primary channel can be a fixed width (e.g., a wide bandwidth of 20 MHz) or a width dynamically set through signaling. The primary channel can be the operating channel of the BSS and can be used by STAs to establish a connection with the AP. In certain representative embodiments, carrier sense multiple access with collision avoidance (CSMA / CA) can be implemented, such as in an 802.11 system. For CSMA / CA, STAs (e.g., each STA) including the AP can sense the primary channel. If a particular STA senses / detects and / or determines that the primary channel is busy, the particular STA can back off. One STA (e.g., only one station) can transmit at any given time in a given BSS.

[0071] 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 the 40 MHz wide channel.

[0072] Very high throughput (VHT) STAs can support 20MHz, 40MHz, 80MHz and / or 160MHz wide channels. 40MHz and / or 80MHz channels can be formed by combining consecutive 20MHz channels. A 160MHz channel can be formed by combining 8 consecutive 20MHz channels, or by combining two discontinuous 80MHz channels, which can be referred to as an 80+80 configuration. For the 80+80 configuration, after channel coding, the data can pass through a segment parser that can separate the data into two streams. Each stream can be subjected to inverse fast Fourier transform (IFFT) processing and time domain processing separately. The streams can be mapped onto two 80MHz channels, and the data can be transmitted by the transmitting STA. At the receiver of the receiving STA, the operations of the above-mentioned 80+80 configuration can be reversed, and the combined data can be sent to the media access control (MAC).

[0073] 802.11af and 802.11ah support sub-1GHz operating modes. The channel operating bandwidth and carrier 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 can support metered type control / machine type communications, such as MTC devices in macro coverage areas. MTC devices can have certain capabilities, for example, limited capabilities, including support for (e.g., only support for) certain and / or limited bandwidths. MTC devices can include batteries with battery life above a threshold (e.g., in order to maintain very long battery life).

[0074] WLAN systems that can support multiple channels and channel bandwidths (such as 802.11n, 802.11ac, 802.11af, and 802.11ah) include a channel that can be designated as a primary channel. The primary channel can have a bandwidth equal to the maximum common operating bandwidth supported by all STAs in the BSS. The bandwidth of the primary channel can be set and / or limited by the STA that supports the smallest bandwidth operating mode among all STAs operating in the BSS. In the example of 802.11ah, for a STA that supports (e.g., only supports) a 1 MHz mode (e.g., an MTC-type device), the primary channel can be 1 MHz wide, even if the AP and other STAs in the BSS support 2 MHz, 4 MHz, 8 MHz, 16 MHz, 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 transmitting to the AP, for example, due to a STA (supporting only the 1 MHz operating mode), the entire available frequency band may be considered busy, even if most of the frequency band remains idle and may be available.

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

[0076] Figure 1D1 is a system diagram illustrating the RAN 113 and the CN 115 according to an embodiment. As described 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.

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

[0078] The WTRUs 102a, 102b, 102c may communicate with the gNBs 180a, 180b, 180c using transmissions associated with scalable numerology. For example, the OFDM symbol spacing and / or OFDM subcarrier spacing may be different 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 transmission time intervals (TTIs) of varying or scalable lengths (e.g., containing a variable number of OFDM symbols and / or lasting a variable length of absolute time).

[0079] 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 without accessing other RANs (e.g., such as the eNode-Bs 160a, 160b, 160c). In a standalone configuration, the WTRUs 102a, 102b, 102c may utilize 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 gNBs 180a, 180b, 180c while also communicating / connecting with another RAN, such as the eNode-Bs 160a, 160b, 160c. For example, the WTRUs 102a, 102b, 102c may implement DC principles 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-Bs 160a, 160b, 160c may serve as mobility anchors for the WTRUs 102a, 102b, 102c, and the gNBs 180a, 180b, 180c may provide additional coverage and / or throughput for the serving WTRUs 102a, 102b, 102c.

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

[0081] 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 possibly data networks (DNs) 185a, 185b. While each of the aforementioned 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.

[0082] The AMF 182a, 182b may be connected to one or more 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, supporting network slicing (e.g., handling different PDU sessions with different requirements), selecting a specific SMF 183a, 183b, managing registration areas, terminating NAS signaling, mobility management, and the like. The AMF 182a, 182b may use network slicing to customize CN support for the WTRU 102a, 102b, 102c based on the type of service being used 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 massive mobile broadband (eMBB) access, services for machine-type communication (MTC) access, and the like. 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.

[0083] The SMFs 183a and 183b can connect to the AMFs 182a and 182b in the CN 115 via the N11 interface. The SMFs 183a and 183b can also connect to the UPFs 184a and 184b in the CN 115 via the N4 interface. The SMFs 183a and 183b can select and control the UPFs 184a and 184b and configure the routing of traffic through the UPFs 184a and 184b. The SMFs 183a and 183b can perform other functions, such as managing and allocating UE IP addresses, managing PDU sessions, controlling policy enforcement and QoS, and providing downlink data notifications. The PDU session type can be IP-based, non-IP-based, Ethernet-based, and so on.

[0084] The UPF 184a, 184b may be connected to one or more 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.

[0085] 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. Furthermore, the CN 115 may provide the WTRUs 102a, 102b, 102c with access to other networks 112, which may include other wired and / or wireless networks owned and / or operated by other service providers. In one embodiment, the WTRUs 102a, 102b, 102c may be connected to a local data network (DN) 185a, 185b through the UPF 184a, 184b via the N3 interface to the UPF 184a, 184b and the N6 interface between the UPF 184a, 184b and the DN 185a, 185b.

[0086] Given that Figures 1A-1D as well as Figures 1A-1D

[0015] As described herein, one or more or all of the functionality described herein with respect to one or more of the following: the WTRUs 102a-d, base stations 114a-b, eNode-Bs 160a-c, MMEs 162, SGWs 164, PGWs 166, gNBs 180a-c, AMFs 182a-b, UPFs 184a-b, SMFs 183a-b, DNs 185a-b, and / or any other devices described herein may be performed by one or more emulation devices (not shown). The emulation devices may be one or more devices configured to emulate one or more or all of the functionality described herein. For example, the emulation devices may be used to test other devices and / or simulate network and / or WTRU functionality.

[0087] Emulated devices can be designed to implement one or more tests of other devices in a laboratory environment and / or in a carrier network environment. For example, one or more emulated devices can perform one or more 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 emulated devices can perform one or more or all functions while being temporarily implemented / deployed as part of a wired and / or wireless communication network. For testing purposes, the emulated device can be directly coupled to another device and / or can use over-the-air wireless communication to perform the tests.

[0088] One or more emulated devices can perform one or more functions, including all functions, without being implemented / deployed as part of a wired and / or wireless communication network. For example, the emulated devices can be used in test scenarios in a test lab and / or non-deployed (e.g., testing) wired and / or wireless communication networks to enable testing of one or more components. The one or more emulated devices can be test devices. The emulated devices can transmit and / or receive data using direct RF coupling and / or wireless communication via RF circuitry (e.g., which can include one or more antennas).

[0089] This application describes a number of aspects, including tools, features, examples, models, methods, etc. Many aspects of these aspects are specifically described, and at least in order to illustrate individual characteristics, are usually described in a manner that may sound restrictive. However, this is for the purpose of describing clearly, and does not limit the application or scope of those aspects. In fact, all different aspects can be combined and interchanged to provide other aspects. In addition, each aspect can also be combined and interchanged with the aspects described in the early applications.

[0090] The aspects described and contemplated in this application can be implemented in many different forms. Figure 5-10 Some examples may be provided, but others are also contemplated. Figure 5-10 The discussion herein does not limit the scope of implementation. At least one aspect generally relates to video encoding and decoding, and at least one other aspect generally relates to generating a bitstream, storing a bitstream, and / or transmitting the generated or encoded bitstream. These and other aspects may 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 described methods, and / or a computer-readable storage medium having stored thereon a bitstream generated according to any of the described methods. As used herein, a bitstream may or may not be transmitted.

[0091] 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.

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

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

[0094] Various numerical values ​​are used in the examples described herein, such as 0, 1, 2, 3, 4, 6, 7, 8, 11, 16, 18, 26, 33, 45, 50, 64, 65, 66, 67, 80, 129, 131, 135, 1456, etc. These and other specific values ​​are for describing the examples, and the described aspects are not limited to these specific values.

[0095] Figure 2 An example of a video encoder 200 (eg, a block-based hybrid video encoder) is shown. Variations of the example encoder 200 are contemplated, but for clarity, the encoder 200 is described below without describing all contemplated variations.

[0096] Before being encoded, the video sequence may be pre-encoding processed (201), for example, by performing one or more of the following operations: applying a color transform to the input color picture (e.g., converting from RGB 4:4:4 to CyBC 4:2:0) or performing remapping on the input picture components, for example, to obtain a transmission profile that is resilient (e.g., more resilient) to compression (e.g., using histogram equalization of one of the color components). Metadata may be associated with the pre-processing and may be attached to the bitstream.

[0097] In an encoder 200, a picture may be encoded (e.g., may be encoded by an encoder element) as described below. The picture to be encoded may be partitioned (202) and processed in units of, for example, CUs (coding units). Each unit may be encoded using, for example, intra mode or inter mode. When a unit is encoded in intra mode, intra prediction (260) may be performed. In inter mode, motion estimation (275) and motion compensation (270) may be performed. The encoder may determine (205) whether the CU will be encoded using one of intra mode or inter mode, the intra / inter decision being indicated (e.g., by the encoder), for example, by a prediction mode indicator (e.g., a prediction mode flag). For example, a prediction residual may be calculated by subtracting (210) the predicted block from the original image block. In an intra frame, the CU may be intra predicted (e.g., in an intra (I) frame), while in an inter frame, the CU may be intra predicted or inter predicted.

[0098] The prediction residual may be transformed at 225 and quantized at 230. One or more quantized transform coefficients, motion vectors, or other syntax elements (e.g., picture partition information) may be entropy encoded at 245 to output a bitstream. The encoder may apply quantization directly (e.g., skip transforming) to the untransformed residual transmission. Transformation and quantization may be bypassed (e.g., by the encoder). For example, the residual may be encoded (e.g., directly encoded without applying a transform or quantization process).

[0099] The coded block may be decoded (e.g., by an encoder) to provide a reference (e.g., for further prediction). The quantized transform coefficients may be dequantized at 240 and inverse transformed at 250 (e.g., inverse transformed to decode the prediction residual). At 255, the decoded prediction residual and the prediction block may be combined, and the image block may be reconstructed. An in-loop filter at 265 may be applied to the reconstructed picture to perform, for example, deblocking / SAO (sample adaptive offset) / ALF (adaptive loop filter) filtering (e.g., to reduce coding artifacts). At 280, the filtered image may be stored in a reference picture buffer.

[0100] Figure 3 A block diagram of an example video decoder 300 is shown. In the decoder 300, a bitstream may be decoded (eg, by decoder elements) as described herein. The video decoder 300 may perform the same Figure 2 The decoding process is the reverse of the encoding process described in

[0044] As described herein, encoder 200 may perform video decoding as part of encoding video data.

[0101] Specifically, the input to the video decoder may include video data (e.g., a video bitstream), which may be generated by the video encoder 200. At 330, the bitstream may be entropy decoded (e.g., to obtain one or more transform coefficients, prediction modes, motion vectors, or other encoding information). Picture partition information may indicate how the picture is partitioned. At 355, the decoder may partition the picture based on the decoded picture partition information. The transform coefficients may be dequantized at 340 and inverse transformed at 350 to decode the prediction residual. A prediction block may be obtained at 370 from intra-frame prediction at 360 or motion-compensated prediction (e.g., inter-frame prediction) at 375. At 355, the decoded prediction residual and the prediction block may be combined, and the image block may be reconstructed. At 365, a loop filter may be applied to the reconstructed image. At 380, the filtered image may be stored in a reference picture buffer. The contents of the reference picture buffer 380 on the decoder side may be the same as the contents of the reference picture buffer 280 on the encoder 200 side (e.g., for a picture).

[0102] At 385, the decoded picture may be further subjected to post-decoding processing, such as one or more of an inverse color transform (e.g., conversion from YCbCr 4:2:0 to RGB 4:4:4) or an inverse remapping (e.g., the inverse of the remapping technique performed in the pre-encoding process performed at 201). The post-decoding process may use metadata derived in the pre-encoding process and may be signaled in the video data (e.g., a bitstream). In an example, the decoded image (e.g., after applying the in-loop filter 365 and / or after the post-decoding process 385, if a post-decoding process is used) may be sent to a display device for presentation to a user.

[0103] Figure 4 4 is a block diagram of an example of a system in which various aspects and examples described herein can be implemented. System 400 can be embodied as a device including the various components described below, and is configured to perform one or more 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 can be embodied individually or in combination in a single integrated circuit (IC), multiple ICs and / or discrete components. For example, in at least one example, the processing and encoder / decoder elements of system 400 are distributed across 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 and / or output ports. In various examples, system 400 is configured to implement one or more aspects described in this document.

[0104] The system 400 includes at least one processor 410 configured to execute instructions loaded therein for implementing, for example, the various aspects described herein. The processor 410 may include embedded memory, input / output interfaces, and various other circuit systems 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 non-volatile memory and / or volatile memory, including but not limited to electrically erasable programmable read-only memory (EEPROM), read-only memory (ROM), programmable read-only memory (PROM), random access memory (RAM), dynamic random access memory (DRAM), static random access memory (SRAM), flash memory, magnetic disk drive, and / or optical disk drive. As non-limiting examples, the storage device 440 may include an internal storage device, an attached storage device (including removable and non-removable storage devices), and / or a network accessible storage device.

[0105] The system 400 includes an encoder / decoder module 430 that is configured to, for example, process data 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(s) that may be included in a device to perform encoding and / or decoding functions. As is known, a device may include one or both of the encoding and decoding modules. 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 as known to those skilled in the art.

[0106] 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 the various items during execution of the processes described in this document. Such stored items may include, but are not limited to, input video, decoded video or portions of decoded video, bitstreams, matrices, variables, and intermediate or final results from processing of equations, formulas, operations, and operational logic.

[0107] In some examples, memory internal to the processor 410 and / or 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 memory 420 and / or a storage device 440, such as dynamic volatile memory and / or 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.

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

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

[0110] 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 will be appreciated that various aspects of input processing, such as Reed-Solomon error correction, may be implemented, for example, within a separate input processing IC or within the processor 410, as desired. Similarly, various aspects of USB or HDMI interface processing may be implemented within a separate interface IC or within the processor 410, as desired. 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 combination with memory and storage elements to process the data streams as needed for presentation on an output device.

[0111] The various elements of system 400 may be provided within an integrated housing within which the various elements may be interconnected and data transferred therebetween using suitable connection means 425, such as an internal bus as known in the art, including an inter-IC (I2C) bus, wiring, and printed circuit boards.

[0112] 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 over 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.

[0113] 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 over a communication channel 460 and a communication interface 450 suitable for Wi-Fi communication. 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 over-the-top communications. Other examples provide streaming data to the system 400 using a set-top box that delivers the data through an HDMI connection of the input block 445. Still other examples provide streaming data to the system 400 using an RF connection of the input block 445. As indicated above, the various examples provide data in a non-streaming manner. Additionally, the various examples use wireless networks other than Wi-Fi, such as a cellular network or network.

[0114] System 400 can provide output signals to various output devices, including a display 475, speakers 485, and other peripheral devices 495. Various examples of display 475 include, 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. Display 475 can be used in a television, a tablet device, a laptop computer, a phone (mobile phone), or other devices. Display 475 can also be integrated with other components (e.g., as in a smartphone) or be separate (e.g., an external monitor for a laptop computer). In various examples, other peripheral devices 495 include one or more of a stand-alone digital video disk (or digital versatile disk) (DVD, both terms), a disk player, a stereo system, and / or a lighting system. Various examples use one or more peripheral devices 495 that provide functionality based on the output of system 400. For example, a disk player performs the function of playing the output of system 400.

[0115] In various examples, control signals are communicated between the system 400 and the display 475, speaker 485, or other peripheral devices 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 can be communicatively coupled to the system 400 via dedicated connections through respective interfaces 470, 480, and 490. Alternatively, the output devices can be connected to the system 400 via a communication channel 460 via a communication interface 450. The display 475 and speaker 485 can 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.

[0116] For example, if the RF portion of input 445 is part of a separate set-top box, then display 475 and speaker 485 may alternatively be separate from one or more other components. In various examples where 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.

[0117] Examples may be implemented by computer software implemented by processor 410, or by hardware, or by a combination of hardware and software. As a non-limiting example, examples may be implemented by one or more integrated circuits. Memory 420 may be of any type appropriate for the technical environment and may be implemented using any suitable 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. As a non-limiting example, processor 410 may be of any type appropriate for the technical environment and may include one or more of a microprocessor, a general-purpose computer, a special-purpose computer, and a processor based on a multi-core architecture.

[0118] Various implementations involve decoding. "Decoding" as used in this application may include, 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 a process includes one or more processes typically performed by a decoder, such as entropy decoding, inverse quantization, inverse transform, and differential decoding. In various examples, such a process also or alternatively includes a process performed by a decoder of the various implementations described in this application. For example, the decoder may obtain a history-based motion vector prediction (HMVP) candidate list for a current block, the HMVP list including multiple HMVP candidates; determine a template matching cost of an HMVP candidate from the multiple HMVP candidates; reorder the HMVP candidate list based on the template matching cost of the HMVP candidate; and decode the current block based on the reordered HMVP candidate list.

[0119] 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. Based on the context of the particular description, whether the phrase "decoding process" is intended to refer specifically to a subset of operations or generally to a broader decoding process will be clear and is considered well understood by those skilled in the art.

[0120] Various implementations relate to encoding. In a manner similar to the discussion above regarding “decoding,” “encoding,” as used in this application, may include, for example, all or part of a process performed on an input video sequence to produce an encoded bitstream. In various examples, such processes include one or more processes typically performed by an encoder, such as partitioning, differential coding, transforms, quantization, and entropy coding. In various examples, such processes also or alternatively include processes performed by encoders of the various implementations described in this application. For example, the encoder may obtain a history-based motion vector prediction (HMVP) candidate list for a current block, the HMVP list including multiple HMVP candidates; determine a template matching cost for an HMVP candidate from the multiple HMVP candidates; reorder the HMVP candidate list based on the template matching cost for the HMVP candidate; and encode the current block based on the reordered HMVP candidate list.

[0121] 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 encoding and entropy encoding. Based on the context of the particular description, whether the phrase "encoding process" is intended to refer specifically to a subset of operations or to a broader encoding process will be clear and is considered well understood by those skilled in the art.

[0122] Note that the syntax elements used herein, such as coding syntax (coding syntax for input motion vector data (IMVD), HMVP list, ARMC process, AMVP, HMVP, history-based motion vector predictor candidate mode enable indicator, coding block, block-specific motion information, etc.) are descriptive terms. Therefore, they do not exclude the use of other syntax element names.

[0123] When a diagram is presented as a flow chart, it should be understood that it also provides a block diagram of the corresponding apparatus. Similarly, when a diagram is presented as a block diagram, it should be understood that it also provides a flow chart of the corresponding method / process.

[0124] The implementation and aspects described herein can be implemented in, for example, a method or process, a device, a software program, a data stream or a signal. Even if discussed only in the context of a single implementation (e.g., discussed only as a method), the implementation of the features discussed can also be implemented in other forms (e.g., a device or program). The device can be implemented in, for example, suitable hardware, software, and firmware. The method can 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 a communication device, such as, for example, a computer, a cellular phone, a portable / personal digital assistant ("PDA"), and other devices that facilitate information communication between end users.

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

[0126] Additionally, this application may refer to "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.

[0127] Furthermore, this application may refer to "accessing" various pieces of 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.

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

[0129] It will be appreciated that, for example, in the case of "A / B," "A and / or B," and "at least one of A and B," any of the following uses of " / ," "and / or," and "at least one of..." are intended to include selecting only the first listed option (A), or only the second listed option (B), or both options (A and B). As further example, in the case of "A, B, and / or C" and "at least one of A, B, and C," such wording is intended to include 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 and second listed options (A and B), or only the first and third listed options (A and C), or only the second and third listed options (B and C), or all three options (A, B, and C). As will be apparent to one of ordinary skill in this and related arts, this can be extended to any number of items listed.

[0130] In addition, as used in this document, the word "signal" refers to, among other things, indicating something to the corresponding decoder. The encoder signal may include, for example, the number of intra-frame prediction mode candidates, partition mode candidates, block size, slice type, etc. In this way, in the example, the same parameters are used at both the encoder side and the decoder side. Thus, for example, the encoder can transmit (explicitly signal) specific parameters to the decoder so that the decoder can use the same specific parameters. On the contrary, if the decoder already has specific parameters as well as other parameters, signaling can be used without transmission (implicit signaling) to simply allow the decoder to know and select specific parameters. By avoiding the transmission of any actual function, bit savings are achieved in various examples. It will be appreciated 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 word "signal" is mentioned above, the word "signal" can also be used as a noun in this document.

[0131] As will be clear to one of ordinary skill in the art, implementations can generate a variety of signals that are formatted to carry information that can, for example, be stored or transmitted. The information can include, for example, instructions for performing a method, or data generated by one of the described implementations. For example, a signal can be formatted to carry a bit stream of the described examples. Such a signal can be formatted as, for example, an electromagnetic wave (e.g., using the radio frequency portion of the spectrum) or a baseband signal. The formatting can include, for example, encoding a data stream and modulating a carrier with the encoded data stream. The information carried by the signal can be, for example, analog or digital information. As is known, the signal can be transmitted over a variety of different wired or wireless links. The signal can be stored on, or accessed or received from, a processor-readable medium.

[0132] 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 be implemented in a bitstream or signal that includes information generated as described herein. This information may allow a decoder, an encoder, a bitstream, and / or a decoder according to any of the described embodiments to decode the bitstream. For example, the features described herein may be implemented by creating and / or transmitting and / or receiving and / or decoding a bitstream or signal. For example, the features described herein may be implemented as a method, process, apparatus, a medium storing instructions, a medium storing data, or a signal. For example, the features described herein may be implemented by a television, set-top box, mobile phone, tablet computer, or other electronic device that performs decoding. The television, set-top box, mobile phone, tablet computer, or other electronic device may display (e.g., using a monitor, screen, or other type of display) the resulting image (e.g., an image reconstructed from the residual of the video bitstream). The television, set-top box, mobile phone, tablet computer, or other electronic device may receive a signal including the encoded image and perform decoding.

[0133] History-based motion vector predictor (HMVP) candidates can be used for video compression. In an example, a tool based on a template around the current block can be used to reduce the signaling cost of motion information candidates (e.g., adaptive reordering of merged candidates (ARMC)). HMVP candidates can be reordered to be suitable for prediction using an ARMC process with low complexity (e.g., limited complexity).

[0134] An HMVP candidate may be obtained (e.g., generated). A history-based MVP (HMVP) merge candidate may be added to a merge list after the spatial motion vector predictor (MVP) and the temporal motion vector predictor (TMVP). The motion information of previously coded blocks may be stored in a table and used as the MVP for the current coding unit (CU). During the encoding / decoding process, a table with multiple HMVP candidates may be maintained. The table may be reset (e.g., cleared) when a new coding tree unit (CTU) row is encountered. If there is a non-subblock inter-coded CU, the associated motion information may be added to the last entry of the table as an HMVP candidate.

[0135] The HMVP table size S can be set to 6, which can indicate that up to 5 history-based MVP (HMVP) candidates can be added to the table. When inserting a new motion candidate into the table, a first-in-first-out (FIFO) rule (e.g., a constrained FIFO rule) can be utilized. A redundancy check can be applied to find whether there are identical HMVPs in the table. If found, the identical HMVP can be removed from the table, after which the HMVP candidates can be moved forward and the identical HMVP can be inserted into the last entry of the table.

[0136] HMVP candidates can be used in the merge candidate list construction process. Figure 5 An example of HMVP usage in merge list construction is shown. The most recent (e.g., the last few) HMVP candidates in the table can be checked in order and inserted into the candidate list after the TMVP candidate (e.g., Figure 5 ). Redundancy check may be applied to HMVP candidates of spatial or temporal merging candidates.

[0137] A redundancy check operation may be performed. In the example, the last two entries in the table may be redundancy checked to the top A1 and left B1 spatial candidates, respectively (e.g., positions 4 and 3, respectively, as shown in FIG. Figure 9 As shown). If the total number of available merge candidates reaches the maximum allowed merge candidate minus 1, the merge candidate list construction process from HMVP can be terminated.

[0138] HMVP candidates can be used in the AMVP candidate list construction process. Figure 6 An example of HMVP usage in AMVP list construction is shown. Figure 6 As shown, the top HMVP candidates in the table (eg, the first few HMVP candidates) may be checked in order and inserted after the TMVP candidate in the candidate list.

[0139] The HMVP candidate may be inserted after the added non-adjacent spatial motion vector predictor (NA-SMVP) in the merge and AMVP lists.

[0140] Template matching (TM) can be used to adaptively reorder the merge candidates. The reordering method is applicable to normal merge mode, template matching (TM) merge mode, and affine merge mode (e.g., excluding SbTMVP candidates). For TM merge mode, merge candidates can be reordered before the refinement process.

[0141] Merge candidates may be divided into subgroups (e.g., after the merge candidate list is constructed). For normal merge mode and TM merge mode, the subgroup size may be set to 5. For affine merge mode, the subgroup size may be set to 3. The merge candidates in a subgroup may be reordered in ascending order based on the cost value based on template matching. The merge candidates in the last subgroup (e.g., not the first subgroup) may not be reordered.

[0142] The template matching cost of the merge candidate can be measured by the sum of absolute differences (SAD) between the samples of the template of the current block and their corresponding reference samples. The template of the current block can include a set of reconstructed samples adjacent to the current block. The reference samples of the template can be located by the motion information of the merge candidate and can correspond to the predicted samples.

[0143] If the merge candidate uses bidirectional prediction, the reference sample of the template of the merge candidate can be generated by bidirectional prediction, such as Figure 7 shown. Figure 7 Examples of templates and reference samples of templates in reference pictures are shown.

[0144] Figure 8 An example of a template of a block having sub-block motion using motion information of a sub-block of a current block and a reference sample of the template is shown. For a sub-block based merge candidate with a sub-block size equal to Wsub×Hsub, the upper template may include a sub-template of size Wsub×1, and the left template may include a sub-template of size 1×Hsub. Figure 8 As shown, the motion information of the sub-blocks in the first row and first column of the current block can be used to derive the reference samples of the sub-template.

[0145] Figure 9Examples of spatial and non-adjacent spatial positions are shown. The merged predictor list can be constructed with candidates (e.g., 10 candidates) picked from any of the following: spatial top B1 (3), spatial left A1 (4), spatial top B0 (2), spatial left A0 (1), spatial top B2 (5) (if there are fewer than 4 candidates in the list), temporal C0 or C1, non-adjacent spatial positions (e.g., 6-23), HMVP (e.g., by reserving 1 free space for pairing), pairing between the first 2 candidates in the list, zero of the reference frame, or zero of the first reference frame. The list can be constructed by using a pruning process (e.g., a full pruning process).

[0146] An AMVP predictor list may be constructed for the reference frames of the corresponding reference frame list, where 5 candidates use reference frames (e.g., specific reference frames) selected from any of the following: spatial left A1 or A0 (4-1), spatial top B1, B0, or B2 (3-2-5), temporal C0 or C1, non-adjacent spatial positions (6-23), or HMVP.

[0147] During list construction, predictors can be rounded to a given AMVR precision and a full pruning process can be performed.

[0148] The best predictor can be selected from the candidates (e.g., 5 candidates) as the one with the smallest template matching (TM) cost. The best candidate can be further refined through the TM process and set as the first (e.g., and only) MVP in the AMVP list. If the list is empty, the list can be filled with zero motion vectors.

[0149] HMVP candidates can be reordered based on TM cost. For example, the ARMC process used for merge list construction, AMVP list construction, and / or by modifying the complexity of template calculation can be used to reorder HMVP candidates.

[0150] As described herein, an HMVP prediction candidate list may be used interchangeably with an HMVP list and / or an HMVP candidate list. In an example, an HMVP prediction candidate list for a current block may be obtained (e.g., by a device such as an encoding and / or decoding device). The HMVP list may be reordered using an ARMC process (e.g., before merging the list). For each HMVP candidate (e.g., multiple HMVP candidates from an HMVP candidate list), the TM cost of the current CU template may be determined (e.g., calculated) using the motion information of the HMVP candidate (e.g., MV, reference index, BCW weight, LIC flag, AMVR accuracy, etc.). The HMVP candidates may be reordered in the HMVP list in descending order of template matching cost (e.g., based on the template matching cost of the HMVP candidates). For example, multiple HMVP candidates in the HMVP candidate list may be reordered so that the HMVP candidates are arranged in descending order based on the corresponding template matching costs of the multiple HMVP candidates.

[0151] The current block may be processed (e.g., encoded and / or decoded) based on the reordered HMVP candidate list. For example, an HMVP candidate may be selected from the reordered HMVP candidate list, and the selected HMVP candidate may include a lowest template matching cost among multiple HMVP candidates in the HMVP candidate list. The current block may be decoded based on the selected HMVP candidate.

[0152] like Figure 5 As shown, the HMVP candidate list can be scanned.

[0153] The reordering process can be performed before the merge list is built. The encoder can build several merge lists (for example, with and without reordering NASMVP and TMVP candidates, and with and without complete merge list reordering). Since the merge list uses the same HMVP list, reordering the HMVP list before construction can reduce the reordering operation.

[0154] In an example, since the HMVP candidate may be farther along in the merged list (e.g., after the 23 spatial candidates and the TMVP), the HMVP candidate may be used less frequently. Reordering the HMVP list may allow the HMVP candidate of greatest interest to be selected. In an example, when the reordered HMVP candidate is improved compared to the actual HMVP candidate, the reordered HMVP candidate may be placed in the AMVP list (e.g., before the NA-SMVP candidate, or before the TMVP).

[0155] For AMVP list construction, for the reference frames of the reference frame list, the HMVP candidates may be scanned from the oldest HMVP candidate to the most recent HMVP candidate (eg, from left to right), as shown in FIG. Figure 6 As shown. For example, an AMVP list can be constructed based on the reordered HMVP candidate list. For an HMVP candidate, if a motion vector on a searched reference frame list (e.g., a motion vector associated with an HMVP candidate) uses the same reference frame as the searched reference frame, the HMVP candidate can be included (e.g., inserted) into a motion vector predictor list associated with the current block (e.g., an AMVP list) after, for example, rounding and pruning. If a motion vector on another reference frame list (e.g., L1-x if Lx is searched) uses the same reference frame (e.g., the same POC) as the searched reference frame, the motion vector can be inserted into the AMVP list after rounding and pruning. Motion compensation can be performed on the current block based on the motion vector predictor list (e.g., the AMVP list).

[0156] The HMVP candidates may be reordered based on the template costs associated with the candidates (eg, before AMVP list construction). The reordering based on TM cost may take the searched reference frames into account in the reference frame list. Figure 10 An example of HMVP reordering of an AMVP list is shown (e.g., a cross may indicate an invalid motion vector (MV)). The HMVP candidates may be scanned in the same manner as the HMVP candidates are scanned when inserted into the AMVP list (e.g., as described herein). The validity of the HMVP candidate may be checked based on a motion vector associated with the HMVP candidate and the reference frame using the same reference frame as the searched reference frame. For a valid motion vector (e.g., based on a determination that the HMVP candidate is valid), an associated template matching cost for the current CU template may be calculated using the MV on the searched reference frame of the searched reference frame list and the current AMVR precision (e.g., the MV may be rounded to a given precision before the template matching cost is calculated). Based on a determination that the HMVP candidate is valid, the HMVP candidate may be included in the HMVP candidate list. Based on a determination that the HMVP candidate is invalid, the HMVP candidate may be excluded from the reordered HMVP candidate list. As Figure 10 As shown in FIG, the valid unidirectional parts of the HMVP candidates can be reordered into the HMVP list in ascending TM cost order. Figure 10 As shown, candidates determined to be invalid (e.g., Figure 10 Candidates with an X in them) can be excluded from the reordered HMPV list.

[0157] At the encoder, the HMVP reordering process can be repeated for the reference frames and AMVR precisions of the reference frame lists. The AMVR can be determined for the current block. For example, with 2 reference frames and 4 AMVR precisions per list, the HMVP reordering process can be performed 16 times. At the decoder, the HMVP reordering process is called twice (e.g., up to twice) for the reference frames signaled on the reference frame lists and the AMVR precision signaled.

[0158] In an example, rounding to AMVR precision can be avoided before template matching cost calculation to reduce the number of reordering processes required on the encoder side. The rounding process can use a predefined precision, such as 1 / 4 pixel precision. Without rounding or with a predefined precision, the number of HMVP reorderings at the encoder can be reduced to 4.

[0159] In an example, HMVP reordering can be performed before the AMVP process. Template matching costs can be calculated independently for the unidirectional portion of the HMVP candidates using a predefined accuracy (e.g., based on AMVR), and the HMVP candidates (e.g., in the HMVP list) can be reordered according to the template matching cost. For the reference frames of the reference frame list, the AMVP process can be performed using the reordered HMVP list. In an example, HMVP reordering can be called once per CU on the encoder and decoder side.

[0160] In an example, when the re-ordered HMVP candidate is modified (eg, improved compared to the actual HMVP candidate), the re-ordered HMVP candidate may be placed in the AMVP list (eg, before the NA-SMVP candidate, or before the TMVP).

[0161] Templates may be saved. To modify (eg, reduce) the complexity of template calculations involved in HMVP reordering, templates or information representing HMVP candidate templates may be saved in an HMVP list (eg, together with motion information).

[0162] In the ARMC process, the current template and the reference template may have the same size, eg, the width of the top template is 1 pixel, and the height of the left template is 1 pixel (eg, the width / height is the size of the current CU).

[0163] Since HMVP candidates are stored in a FIFO manner, if a predictor is added, the remaining predictors may have been used and the associated templates can be saved.

[0164] In the merge example, the reference template can be in the reference frame list ( Figure 7A weighted average (e.g., using BCW weights) of the reference templates obtained on RT0 and RT1 on .

[0165] For HMVP candidates that extract templates for the first time (e.g., instead of using CU size), templates can be extracted using the maximum CU size, e.g., 64×64 to obtain 64×1 and 1×64 templates. The templates can be saved along with the motion information of the HMVP candidate. For a CU, the portion corresponding to the CU size can be extracted from the saved template, avoiding recalculation of the portion corresponding to the CU size (e.g., through motion compensation).

[0166] In an example, a subsampled template can be saved. A template (e.g., an entire template) can be subsampled (e.g., to save memory). For example, 1 sample out of 2 or 4 samples can be saved (e.g., 32×1-1×32 or 16×1-1×16). This can include a single sample, an average, a median, etc. of the subsampled samples considered. The same subsampling operation can be performed on the current template, for example, so that the subsampled templates can be compared.

[0167] For example, in AMVP, the template preservation process described herein can be applied (e.g., with or without subsampling). The number of preserved templates can be increased from 2 to at least 4. For example, in AMVP, unidirectional MVP can be considered. Reference templates for reference frame lists can be preserved separately.

[0168] If AMVR precision is used in HMVP reordering, the number of saved templates can be increased to 16 (eg, with 4 AMVR precisions).

[0169] The merge and AMVP examples can be processed jointly or independently. For example, in the merge example, HMVP reordering can be performed with the subsampling template saved, and in the AMVP example, it can be performed without saving (e.g., by reference template calculation).

[0170] Although the features and elements are described above in particular combinations, it will be understood by those skilled in the art that each feature or element can be used alone or in any combination with the other features and elements. In addition, the methods described herein can be implemented in a computer program, software, or firmware that is incorporated into a computer-readable medium for execution by a computer or processor. Examples of computer-readable media include electronic signals (transmitted 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 internal 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 the software can be used to implement a radio frequency transceiver used in a WTRU, UE, terminal, base station, RNC, or any host computer.

Claims

1. A video decoding device, comprising: The processor is configured to: Obtain a history-based motion vector prediction (HMVP) candidate list for a current block, the HMVP list including a plurality of HMVP candidates; determining a template matching cost for an HMVP candidate from among the plurality of HMVP candidates; Reorder the HMVP candidate list based on the template matching cost of the HMVP candidates; as well as The current block is decoded based on the reordered HMVP candidate list.

2. The apparatus of claim 1 , wherein the processor being configured to reorder the HMVP candidate list based on the template matching costs of the HMVP candidates comprises the processor being configured to: The plurality of HMVP candidates in the HMVP candidate list are reordered so that the HMVP candidates are arranged in descending order based on corresponding template matching costs of the plurality of HMVP candidates.

3. The apparatus according to any one of claims 1 to 2, wherein the processor is configured to decode the current block using the reordered HMVP list, comprising the processor being configured to: selecting an HMVP candidate from the reordered HMVP candidate list, wherein the selected HMVP candidate comprises a lowest template matching cost among the plurality of HMVP candidates in the HMVP candidate list; and The current block is decoded based on the selected HMVP candidate.

4. The apparatus according to any one of claims 1 to 3, wherein the processor is configured to decode the current block using the reordered HMVP list further comprises the processor being configured to: constructing an Advanced Motion Vector Predictor (AMVP) list based on the reordered HMVP candidate list; and Motion compensation is performed on the current block based on the AMVP list.

5. The apparatus according to any one of claims 1 to 4, wherein the processor is configured to decode the current block using the reordered HMVP list further comprises the processor being configured to: For an HMVP candidate from the reordered HMVP list, determining whether a motion vector associated with the HMVP candidate and the reference frame uses the same reference frame as the searched reference frame; and Based on determining that the motion vector associated with the HMVP candidate and the reference frame uses the same reference frame as the searched reference frame, including the HMVP candidate in a motion vector predictor list associated with the current block; and Motion compensation is performed on the current block based on the motion vector predictor list.

6. The apparatus of any one of claims 1-4, wherein the processor being configured to determine a template matching cost of an HMVP candidate comprises the processor being configured to: determining the validity of the HMVP candidate based on motion vectors associated with the HMVP candidate and the reference frame using the same reference frame as the searched reference frame; and Based on determining that the HMVP candidate is valid, the HMVP candidate is included in a re-ordered HMVP candidate list.

7. The apparatus of any one of claims 1 to 4, wherein the processor being configured to determine a template matching cost of an HMVP candidate comprises the processor being configured to: determining the validity of the HMVP candidate based on motion vectors associated with the HMVP candidate and the reference frame using the same reference frame as the searched reference frame; and Based on determining that the HMVP candidate is invalid, the HMVP candidate is excluded from the re-ordered HMVP candidate list.

8. The apparatus according to any one of claims 1 to 4, wherein the processor is further configured to: Determine the adaptive motion vector resolution (AMVR) of the current block; Determine the template matching cost of the HMVP candidate based on the AMVR; and The HMVP candidates in the HMVP candidate list are reordered based on the template matching cost.

9. A video encoding device comprising: The processor is configured to: Obtain a history-based motion vector prediction (HMVP) candidate list for a current block, the HMVP list including a plurality of HMVP candidates; determining a template matching cost for an HMVP candidate from among the plurality of HMVP candidates; Reorder the HMVP candidate list based on the template matching cost of the HMVP candidates; as well as The current block is encoded based on the reordered HMVP candidate list.

10. The apparatus of claim 9, wherein the processor being configured to reorder the HMVP candidate list based on the template matching costs of the HMVP candidates comprises the processor being configured to: The plurality of HMVP candidates in the HMVP candidate list are reordered so that the HMVP candidates are arranged in descending order based on corresponding template matching costs of the plurality of HMVP candidates.

11. The apparatus according to any one of claims 9 to 10, wherein the processor is configured to encode the current block using the reordered HMVP list comprises the processor being configured to: selecting an HMVP candidate from the reordered HMVP candidate list, wherein the selected HMVP candidate comprises a lowest template matching cost among the plurality of HMVP candidates in the HMVP candidate list; and The current block is encoded based on the selected HMVP candidate.

12. The apparatus according to any one of claims 9 to 11, wherein the processor is configured to encode the current block using the reordered HMVP list further comprises the processor being configured to: constructing an Advanced Motion Vector Predictor (AMVP) list based on the reordered HMVP candidate list; and Motion compensation is performed on the current block based on the AMVP list.

13. The apparatus according to any one of claims 9 to 12, wherein the processor being configured to encode the current block using the reordered HMVP list further comprises the processor being configured to: For an HMVP candidate from the reordered HMVP list, determining whether a motion vector associated with the HMVP candidate and the reference frame uses the same reference frame as the searched reference frame; and Based on determining that the motion vector associated with the HMVP candidate and the reference frame uses the same reference frame as the searched reference frame, including the HMVP candidate in a motion vector predictor list associated with the current block; and Motion compensation is performed on the current block based on the motion vector predictor list.

14. The apparatus of any one of claims 9 to 12, wherein the processor being configured to determine a template matching cost for an HMVP candidate comprises the processor being configured to: determining the validity of the HMVP candidate based on motion vectors associated with the HMVP candidate and the reference frame using the same reference frame as the searched reference frame; and Based on determining that the HMVP candidate is valid, the HMVP candidate is included in a re-ordered HMVP candidate list.

15. The apparatus of any one of claims 9 to 12, wherein the processor being configured to determine a template matching cost for an HMVP candidate comprises the processor being configured to: determining the validity of the HMVP candidate based on motion vectors associated with the HMVP candidate and the reference frame using the same reference frame as the searched reference frame; and Based on determining that the HMVP candidate is invalid, the HMVP candidate is excluded from the re-ordered HMVP candidate list.

16. The apparatus according to any one of claims 9 to 12, wherein the processor is further configured to: Determine the adaptive motion vector resolution (AMVR) of the current block; Determine the template matching cost of the HMVP candidate based on the AMVR; and The HMVP candidates in the HMVP candidate list are reordered based on the template matching cost.

17. The apparatus of any one of claims 1 to 16, further comprising a memory operatively connected to the processor.

18. A method for a video decoder, the method comprising: Obtain a history-based motion vector prediction (HMVP) candidate list for a current block, the HMVP list including a plurality of HMVP candidates; determining a template matching cost for an HMVP candidate from among the plurality of HMVP candidates; Reorder the HMVP candidate list based on the template matching cost of the HMVP candidates; as well as The current block is decoded based on the reordered HMVP candidate list.

19. The method of claim 18, wherein reordering the HMVP candidate list based on the template matching cost of the HMVP candidates comprises: The plurality of HMVP candidates in the HMVP candidate list are reordered so that the HMVP candidates are arranged in descending order based on corresponding template matching costs of the plurality of HMVP candidates.

20. The method according to any one of claims 18-19, wherein decoding the current block using the reordered HMVP list comprises: selecting an HMVP candidate from the reordered HMVP candidate list, wherein the selected HMVP candidate comprises a lowest template matching cost among the plurality of HMVP candidates in the HMVP candidate list; and The current block is decoded based on the selected HMVP candidate.

21. The method according to any one of claims 18 to 20, wherein decoding the current block using the reordered HMVP list further comprises: Building an Advanced Motion Vector Predictor (AMVP) list based on the reordered HMVP candidate list; as well as Motion compensation is performed on the current block based on the AMVP list.

22. The method according to any one of claims 18 to 21, wherein decoding the current block using the reordered HMVP list further comprises: For an HMVP candidate from the reordered HMVP list, determining whether a motion vector associated with the HMVP candidate and the reference frame uses the same reference frame as the searched reference frame; as well as Based on determining that the motion vector associated with the HMVP candidate and the reference frame uses the same reference frame as the searched reference frame, including the HMVP candidate in a motion vector predictor list associated with the current block; and Motion compensation is performed on the current block based on the motion vector predictor list.

23. The method according to any one of claims 18 to 21, wherein determining the template matching cost of the HMVP candidate further comprises: determining validity of the HMVP candidate based on motion vectors associated with the HMVP candidate and the reference frame using the same reference frame as the searched reference frame; as well as Based on determining that the HMVP candidate is valid, the HMVP candidate is included in a re-ordered HMVP candidate list.

24. The method according to any one of claims 18 to 21, wherein determining the template matching cost of the HMVP candidate further comprises: determining validity of the HMVP candidate based on motion vectors associated with the HMVP candidate and the reference frame using the same reference frame as the searched reference frame; as well as Based on determining that the HMVP candidate is invalid, the HMVP candidate is excluded from the re-ordered HMVP candidate list.

25. The method according to any one of claims 18 to 21, further comprising: Determine the adaptive motion vector resolution (AMVR) of the current block; Determine the template matching cost of HMVP candidates based on AMVR; as well as The HMVP candidates in the HMVP candidate list are reordered based on the template matching cost.

26. A method for a video encoder, the method comprising: Obtain a history-based motion vector prediction (HMVP) candidate list for a current block, the HMVP list including a plurality of HMVP candidates; determining a template matching cost for an HMVP candidate from among the plurality of HMVP candidates; Reorder the HMVP candidate list based on the template matching cost of the HMVP candidates; as well as The current block is encoded based on the reordered HMVP candidate list.

27. The method of claim 26, wherein reordering the HMVP candidate list based on the template matching cost of the HMVP candidates comprises: The plurality of HMVP candidates in the HMVP candidate list are reordered so that the HMVP candidates are arranged in descending order based on corresponding template matching costs of the plurality of HMVP candidates.

28. The method according to any one of claims 26-27, wherein encoding the current block using the reordered HMVP list comprises: selecting an HMVP candidate from the reordered HMVP candidate list, wherein the selected HMVP candidate comprises a lowest template matching cost among the plurality of HMVP candidates in the HMVP candidate list; and The current block is encoded based on the selected HMVP candidate.

29. The method according to any one of claims 26 to 28, wherein encoding the current block using the reordered HMVP list further comprises: Building an Advanced Motion Vector Predictor (AMVP) list based on the reordered HMVP candidate list; as well as Motion compensation is performed on the current block based on the AMVP list.

30. The method according to any one of claims 26 to 29, wherein encoding the current block using the reordered HMVP list further comprises: For an HMVP candidate from the reordered HMVP list, determining whether a motion vector associated with the HMVP candidate and the reference frame uses the same reference frame as the searched reference frame; as well as Based on determining that the motion vector associated with the HMVP candidate and the reference frame uses the same reference frame as the searched reference frame, including the HMVP candidate in a motion vector predictor list associated with the current block; and Motion compensation is performed on the current block based on the motion vector predictor list.

31. The method according to any one of claims 26 to 29, wherein determining the template matching cost of the HMVP candidate further comprises: determining validity of the HMVP candidate based on motion vectors associated with the HMVP candidate and the reference frame using the same reference frame as the searched reference frame; as well as Based on determining that the HMVP candidate is valid, the HMVP candidate is included in a re-ordered HMVP candidate list.

32. The method according to any one of claims 26 to 29, wherein determining the template matching cost of the HMVP candidate further comprises: determining validity of the HMVP candidate based on motion vectors associated with the HMVP candidate and the reference frame using the same reference frame as the searched reference frame; as well as Based on determining that the HMVP candidate is invalid, the HMVP candidate is excluded from the re-ordered HMVP candidate list.

33. The method according to any one of claims 26 to 29, further comprising: Determine the adaptive motion vector resolution (AMVR) of the current block; Determine the template matching cost of HMVP candidates based on AMVR; as well as The HMVP candidates in the HMVP candidate list are reordered based on the template matching cost.

34. A computer program product stored on a non-transitory computer readable medium and comprising program code instructions for implementing the steps of the method according to any one of claims 18 to 33 when executed by a processor.

35. A computer program comprising program code instructions for implementing the steps of the method according to any one of claims 18 to 33 when executed by a processor.

36. Video data comprising information representing a video block encoded according to one of the methods of any one of claims 26 to 33.

Images