Group sparsity and implicit regularization for MIMO channel estimation

Through group sparsity and implicit regularization non-convex operation, the problem of low completion efficiency of MIMO channel matrix is ​​solved, and more accurate and efficient channel estimation is achieved, suitable for complex channel environments.

CN118901226APending Publication Date: 2024-11-05INTERDIGITAL PATENT HOLDINGS INC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202380022842.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2022-02-04
Filing Date
2023-02-03
Publication Date
2024-11-05

AI Technical Summary

Technical Problem

In MIMO channel estimation, it is difficult for the prior art to effectively utilize the group sparsity and low rank properties of the channel matrix, resulting in low channel matrix completion efficiency, affecting the accuracy and efficiency of channel estimation.

Method used

Non-convex operations of group sparseness and implicit regularization are adopted to optimize matrix completion through gradient descent, and the group sparse attributes and low-rank attributes of the channel matrix are used to avoid explicit regularization, so as to realize the reconstruction of the channel matrix.

Benefits of technology

Improve the performance and efficiency of channel estimation, provide better channel matrix reconstruction results, reduce dependence on the number of observations, and is suitable for complex channel environments.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118901226A_ABST
    Figure CN118901226A_ABST
Patent Text Reader

Abstract

Systems, methods, and instrumentalities are described herein in conjunction with group sparseness and implicit regularization for MIMO channel estimation. For example, a channel matrix (e.g., a MIMO channel matrix) may have group sparse attributes. Group sparse attributes may be used in channel estimation applications. For example, group sparse attributes in a MIMO channel matrix may be used with non-convex operations to perform matrix completion. Matrix completion may be performed to determine an unknown channel matrix, for example, using limited entries (e.g., noise entries).
Need to check novelty before this filing date? Find Prior Art

Description

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims the benefit of U.S. Provisional Application No. 63 / 306,687, filed on February 4, 2022, the entire contents of which are incorporated herein by reference. Background Art

[0003] Mobile communications using wireless communications continue to evolve. The fifth generation of mobile communications radio access technology (RAT) may be referred to as 5G New Radio (NR). Previous generation (legacy) mobile communications RAT may be, for example, fourth generation (4G) Long Term Evolution (LTE). Summary of the invention

[0004] Systems, methods and means are described herein in conjunction with group sparsity and implicit regularization for MIMO channel estimation. For example, a channel matrix (e.g., a MIMO channel matrix) may have a group sparsity property. The group sparsity property may be used in channel estimation applications. For example, the group sparsity property in the MIMO channel matrix may be used with non-convex operations to perform matrix completion. Matrix completion may be performed to determine an unknown channel matrix, for example, using limited entries (e.g., noise entries).

[0005] For example, the wireless transmit / receive unit may be configured to reconstruct an unknown channel matrix. The WTRU may receive an indication indicating a value (e.g., a noise entry) associated with the unknown channel matrix. The indication may be received from a reference signal, such as a demodulation reference signal (DMRS) or a channel state information reference signal (CSI-RS). The WTRU may be configured to determine a group sparse matrix based on the indicated value. The WTRU may be configured to determine the reconstructed channel matrix, for example, using a non-convex operation and a group sparse matrix. The non-convex operation may be a gradient descent operation. The non-convex operation may be associated with implicit regularization. The WTRU may be configured to send information associated with the reconstructed channel matrix. The information may be a CSI parameter. The CSI parameter may be a rank indicator, a precoder matrix indicator (PMI), a channel quality indicator (e.g., CQI), etc. BRIEF DESCRIPTION OF THE DRAWINGS

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

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

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

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

[0010] Figure 2 Entries of a channel matrix and a reconstructed channel matrix are illustrated.

[0011] Figure 3 Illustrate an example linear estimation with a group sparsity structure.

[0012] Figure 4A An example channel matrix before DFT transformation is illustrated.

[0013] Figure 4B An example channel matrix after DFT transformation is illustrated.

[0014] Figure 5 Example graphs of NMSE versus SNR are shown for various observation values. DETAILED DESCRIPTION

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

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

[0017] 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 base transceiver stations (BTS), Node Bs, eNode Bs, Home Node Bs, Home eNode Bs, gNBs, NR Node Bs, site controllers, access points (APs), wireless routers, and the like. Although the base stations 114a, 114b are each depicted as a single element, it should be appreciated that the base stations 114a, 114b may include any number of interconnected base stations and / or network elements.

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

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

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

[0021] 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 Advanced LTE (LTE-A) and / or Advanced LTE Pro (LTE-A Pro).

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

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

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

[0025] Figure 1AThe base station 114b in the may be, for example, a wireless router, a Home NodeB, a Home eNodeB, or an access point, and may utilize any suitable RAT to facilitate wireless connectivity in a local area, such as a business location, a home, a vehicle, a campus, an industrial facility, an air corridor (e.g., for use by drones), a road, and the like. In one embodiment, the base station 114b and the WTRUs 102c, 102d may implement a radio technology such as IEEE 802.11 to establish a wireless local area network (WLAN). In 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 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 micro-micro cell base station or a femto cell base station. As Figure 1A As shown, base station 114b may have a direct connection to Internet 110. Therefore, base station 114b may not need to access Internet 110 via CN 106 / 115.

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

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

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

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

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

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

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

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

[0034] The processor 118 of the WTRU 102 may be coupled to 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) and may receive user input data therefrom. The processor 118 may also output user data to the speaker / microphone 124, the keypad 126, and / or the display / touchpad 128. In addition, the processor 118 may access information from and store data in any type of suitable memory, such as a non-removable memory 130 and / or a removable memory 132. The non-removable memory 130 may include a random access memory (RAM), a read-only memory (ROM), a hard disk, or any other type of memory storage device. The removable memory 132 may include a subscriber identity module (SIM) card, a memory stick, a secure digital (SD) memory card, and the like. In other embodiments, the processor 118 may access information from and store data in a memory that is not physically located on the WTRU 102, such as on a server or a home computer (not shown).

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

[0036] 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 this 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0069] Systems, methods and means are described herein in conjunction with group sparsity and implicit regularization for MIMO channel estimation. For example, a channel matrix (e.g., a MIMO channel matrix) may have a group sparsity property and / or a low rank property. The group sparsity property and / or the low rank property may be used in channel estimation applications. For example, the group sparsity property and / or the low rank property in the MIMO channel matrix may be used together with non-convex operations to perform matrix completion. Matrix completion may be performed to determine an unknown channel matrix, for example, using limited entries (e.g., noise entries).

[0070] For example, the wireless transmit / receive unit may reconstruct an unknown channel matrix. The WTRU may receive an indication indicating a value (e.g., a noise entry) associated with the unknown channel matrix. The indication may be received from a reference signal, such as a demodulation reference signal (DMRS) or a channel state information reference signal (CSI-RS). The WTRU may determine a group sparse matrix based on the indicated value. The WTRU may determine the reconstructed channel matrix, for example, using a non-convex operation and a group sparse matrix. The non-convex operation may be a gradient descent operation. The non-convex operation may be associated with implicit regularization. The WTRU may send information associated with the reconstructed channel matrix. The information may be a CSI parameter. The CSI parameter may be a rank indicator, a precoder matrix indicator (PMI), a channel quality indicator (e.g., CQI), etc.

[0071] For example, channel estimation may be performed in a wireless system (eg, in a MIMO wireless system). Channel H may be defined as N r ×N t The entries in the channel H matrix may be estimated. N t and N r It can represent the number of antennas at the transmitter and receiver respectively.

[0072] A device (e.g., a WTRU) may, for example, use / measure (e.g., received from a base station) signals such as reference signals (e.g., demodulation reference signals (DMRS), channel state information reference signals (CSI-RS), etc.) to obtain noise estimates (e.g., values) of one or more entries of an unknown channel matrix (e.g., the WTRU may receive configuration information indicating matrix factors, dimensions associated with each matrix factor, and / or initialization of each matrix factor). The matrix (e.g., the entire matrix, the entire unknown channel matrix) may be reconstructed (e.g., based on a matrix decomposition structure associated with the matrix and the matrix factors), for example, using known noise entries (e.g., the obtained values). For example, a device (e.g., at receiver R1) may receive a reference signal (e.g., transmitted from antenna T1 at time n1 via subcarrier S1). A channel matrix (e.g., at time n1 and at subcarrier S1) for an antenna pair (e.g., T1-R1 antenna pair) may be estimated. The received reference signal (e.g., received at R1) may be affected by noise. The channel matrix may be reconstructed using the noise affected signal (eg, the noise estimate).

[0073] Figure 2 The entries of the channel matrix and the reconstructed channel matrix are shown as follows. Figure 2 As shown, the matrix Might contain noise estimates for several entries of the channel matrix. Figure 2 As shown, the matrix H may be the reconstructed matrix, for example, the matrix may be obtained from the matrix Reconstruction. The MIMO channel matrix can be low-rank (e.g., typically low-rank) (e.g., having a low-rank MF structure) and can be sparse (e.g., DFT-based) (e.g., having a sparse MF structure). For example, when performing channel estimation, a matrix completion (MC) method that exploits low-rank and matrix sparsity information can be used.

[0074] Non-convex techniques (e.g., non-convex operations) can be used for matrix completion. Non-convex operations can avoid the use of (e.g., may not use, may not require) regularization (e.g., explicit regularization), for example, unlike methods that can impose (e.g., explicitly impose) low-rank or sparsity constraints in MC formulations. For example, gradient descent can be used to optimize matrix completion. Matrix completion using a certain initialization can output (e.g., sufficient to ensure) a solution with, for example, properties (e.g., desired properties) without (e.g., any) explicit regularization. Gradient descent (e.g., gradient descent operations) can provide implicit regularization. Matrix completion can use implicit regularization (e.g., provided by gradient descent).

[0075] The device may use the group sparsity property for matrix completion and / or channel estimation (e.g., the matrix completion may be performed based on a matrix decomposition structure associated with the group sparsity). A channel matrix (e.g., a MIMO channel matrix) may have a property such as the group sparsity property described herein (e.g., which may be determined based on a matrix factor). A group-sparse channel matrix may differ from the element-by-element sparsity of a DFT-based channel matrix. Using the group-sparse property for matrix completion may provide better channel estimation performance (e.g., compared to a low-rank or element-by-element sparse formulation).

[0076] The group sparsity property of a channel matrix (e.g., a MIMO channel matrix) can be used (e.g., for) applications other than channel estimation. For example, beamforming (e.g., in a MIMO system) can use (e.g., exploit, directly exploit) a group sparsity structure, for example, for evaluation (e.g., efficient evaluation) of a beamforming component (e.g., an analog beamforming component). For example, the group sparsity property can be used (e.g., exploit, directly exploit) to implement feedback compression (e.g., CSI feedback compression), which can be a higher degree of CSI feedback compression (e.g., compared to CSI feedback compression implemented using element-by-element sparsity).

[0077] Non-convex optimization (e.g., using gradient descent) can be used for matrix completion associated with channel estimation. Matrix completion (e.g., non-convex matrix completion) can use a formula (e.g., one or more of the formulas disclosed herein, e.g., such as Equation 8), e.g., where the formula can be regularized (e.g., implicitly regularized) for one or more of the following properties: whether the matrix is associated with low rank, element-wise sparsity, or group sparsity. The low-rank property of a matrix can indicate that the rank of the matrix is very low. The rank can indicate a number of linearly independent rows and / or columns. For example, for a matrix of size N×M, the rank can be rank(A)<min(N,M). For example, if the rank of a matrix is low (e.g., much less than min(N,M), e.g., less than a threshold of min(N,M)), and / or if several entries of the matrix (e.g., the number of entries below a threshold) are known, the information associated with the rank of the matrix can be used to reconstruct the matrix (e.g., determine other entries of the matrix). For example, in channel estimation (e.g., MIMO channel estimation), the channel matrix (e.g., the MIMO channel matrix) can have a low rank. Channel estimation based on matrix completion can be performed, for example, based on the low-rank property (e.g., of the channel matrix). The formula for channel estimation can introduce characteristics (e.g., different characteristics) (e.g., low rank, sparsity, etc.) into the estimated channel without imposing explicit regularization or constraints.

[0078] Low-rank matrix completion can be performed. In an example for channel estimation, these techniques (e.g., for low-rank matrix completion) can use (e.g., rely on exploiting) the sparsity and / or low-rank property of the channel matrix. On a certain basis, the channel can be sparse (e.g., assumed to be sparse). For example, techniques such as l1 norm minimization, orthogonal matching pursuit (OMP), etc. can be used for sparse recovery. Sparse recovery techniques can be used to recover the channel matrix. An algorithm (e.g., a two-stage algorithm) can use the sparsity and / or low-rank property of the channel matrix. Joint estimation techniques (e.g., using l1 norm and nuclear norm) can be used for channel estimation.

[0079] Non-convex problems can be optimized. Optimizing non-convex problems can use gradient descent, e.g., for matrix completion. For example, non-convex problems can be formulated by linearizing neural networks. Non-convex problems can be referred to as deep linear networks (e.g., over-parameterized deep linear networks). The gradient descent algorithm (e.g., operation) can regularize (e.g., implicitly regularize) the optimization problem towards a minimum (e.g., a global minimum) by exploiting properties (e.g., desired properties) such as low rank or sparsity.

[0080] A linear network (e.g., a deep linear network) may be used for channel estimation. For example, group sparsity of a channel matrix may be considered under a basis transform (e.g., an appropriate basis transform). A discrete Fourier transform (DFT) matrix may be used (e.g., as an appropriate basis) for a channel that may be modeled (e.g., via a beam space model). Group sparsity may be described. Group sparsity structures may appear in channel estimation. The problem of group sparsity may be described as follows. * may be an unknown parameter to be estimated. A linear measurement value (eg, several linear measurements, eg, a plurality of linear measurements below a threshold) may be obtained (eg, given), such as x * Based on the known matrix A T =[a1,…,a m ] to estimate (e.g., using linear measurements), and measurements can be made and b T =[b1,…,b m Using these measurements, we can then estimate x * For example, the number of measurements m may be smaller than x * This may make the estimation problem ill-posed (e.g., there may be infinitely many solutions). To overcome this problem, x * may (e.g., assume) to have a group-sparse structure (e.g., most entries in the matrix are zero, e.g., such that a few entries are non-zero, and the non-zero entries may be grouped together, e.g., based on a grouping (e.g., order, type, etc.), e.g. in, and (e.g., only) a few is non-zero (for example, Figure 3 shown). Figure 3 Illustrate an example linear estimation with a group sparsity structure. Figure 3 Example equation b=Ax * A visual description of . Figure 3 As shown, blank (eg, white) entries may be zero, and patterned entries may be non-zero.

[0081] x* may have non-zero entries (e.g., several non-zero entries). Non-zero entries may be grouped together. For example, the group sparse vector may be estimated by solving Equation 1 (e.g., a convex optimization problem),

[0082]

[0083] This can be called the minimum l 1,2 Optimization problem.

[0084] For example, Equation 2 can be used to estimate a group sparse vector (e.g., a non-convex problem),

[0085]

[0086] Equation 2 can be minimized, for example, via gradient descent with a specific initialization. Minimizing Equation 2 may result in the following update rule:

[0087] v i (0)=δ>0,u i (0) = 0 Equation 3

[0088]

[0089] in The formulation described in this paper can converge to grouped sparse vectors without any explicit regularization.

[0090] Operations (eg, as described herein) may be performed in the context of channel estimation. The unknown channel matrix can be represented by . If the channel matrix follows the beam space model, the channel matrix can be written as Equation 6.

[0091]

[0092] N p can be the number of paths, g k can be the gain of the kth path, and and The array response vectors may be dependent on the angles k and -k and have the mathematical form shown in Equation 7,

[0093]

[0094] And for In the example, Where λ is the wavelength. The array response vector can be similar to the columns of the DFT matrix. The array response vector can be equal to (e.g., completely equal to) a column of the DFT matrix. For example, if csin(θ k )(csin(Φ k ))For some integer i, In the form of , the corresponding array response vector may be equal to (e.g., completely equal to) a column of the DFT matrix. In an example, if (e.g., all) array response vectors are equal to (e.g., completely equal to) a column of the DFT matrix, then H can be written as or (e.g., equivalently) write Where S can be a sparse matrix with the (i; j)th non-zero entry, e.g., if for a certain path k, the array response vector is the i-th column and the j-th column of the DFT matrix. In practice, a certain scenario (e.g., as described herein, where all array response vectors are equal to a certain column of the DFT matrix) may not occur (e.g., may occur rarely). For example, if (e.g., even if) the array response vector is not equal to (e.g., completely equal to) a certain column of the DFT matrix, then Sparsity may be maintained (eg, although the sparsity may be significantly spread across rows and columns). Figure 4A An example channel matrix before DFT transformation is illustrated. Figure 4B An example channel matrix after DFT transformation is shown. Figure 4A As shown, the channel matrix can be H. Figure 4B As shown, the channel matrix can be like Figure 4B As shown, the matrix The cross-rows and columns may be sparse (eg, nearly sparse).

[0095] The matrix H (e.g., the entire matrix H) can be estimated, for example, using (e.g., only) a few entries (e.g., a number of entries below a threshold). The few entries can be selected (e.g., randomly or based on a pattern, such as a predetermined pattern). For example, a smaller number of entries may increase the difficulty of the problem. For example, given a set of indices Ω such that Available H i,j For example, the noise estimate can be given by H can be used, for example,

[0096] Reconstruction. The knowledge of is modeled as, for example, a linear measure (e.g., a noisy linear measure) of the unknown matrix H, can be group sparse or can be equivalent to a group sparse matrix S, Group sparsity can be achieved through implicit regularization (eg, as described herein). Equation 8 (eg, a non-convex problem) can be optimized, for example, using gradient descent.

[0097]

[0098] 1 of them r can be a vector whose entries (e.g., all Nr entries) are 1, and 1 t can be a vector whose entries (e.g., all Nt entries) are 1. i,: It can be represented as the i-th row U, and u :,j It can be represented as the jth column U. Equations 9 and 10 can be written as follows:

[0099]

[0100] (1 t w T )⊙U=[w1u :,1 … w n u :,n Equation 10

[0101] Item 1 This may result in providing a form similar to x in, for example, Equation 9 to the rows, which may ensure an implicit bias towards sparsity between rows. Similarly, the second term may ensure sparsity across columns.

[0102] Figure 5 Example graphs of NMSE versus SNR are shown for various observation values.

[0103] The methods used (e.g., as described herein) (e.g., Figure 5 GD-sp) shown in FIG. 1 can be compared with other methods (such as CVX-Joint). For example, a scenario may consider a 16×16 MIMO system with two paths. In this case, the channel matrix may have 256 unknown (e.g., complex) entries. Figure 5 As shown, a curve of normalized mean square error (NMSE) relative to SNR is plotted for various numbers of observations. The number of observations can refer to the number of known (e.g., corrupted by noise of a specific signal-to-noise ratio (SNR)) entries out of 256 entries. Both algorithms (e.g., GD-sp and CVX-union) may perform better as the SNR level or number of observations increases. GD-sp may perform better (e.g., compared to CVX-union) in low SNR regimes (e.g., for all observations). For example, if the number of observations is small, GD-sp may perform slightly worse than CVX-union in the high SNR range, but this difference may decrease as the number of observations increases.

[0104] Figure 6 An example process for performing channel estimation using matrix properties is illustrated. Channel estimation can be a building block for downstream processing of a signal, for example, at a receiver (e.g., channel estimation can be used to determine channel information and / or channel conditions). Channel estimation can be used for feedback (e.g., CSI feedback or feedback to a base station indicating channel information and / or channel conditions, such as Figure 6) and precoder design. For example, channel information and / or channel conditions may be determined (e.g., based on features associated with the channel). Features associated with the channel, such as channel rank, delay spread, Doppler, etc., may be monitored. For example, a ML-based approach (e.g., a neural network) may be used to derive a functional mapping, rather than monitoring specific features derived from the channel based on prior knowledge or hand-crafted features. The functional mapping may map the (e.g., entire) channel matrix to one or more features learned from data using machine learning. These learned features may then be monitored like hand-crafted features. Operations and / or processes for performing channel estimation (e.g., as described herein and as Figure 6 As shown in Figure 1, the group sparsity in the channel matrix can be used to perform the channel estimation process. Figure 6 As shown, the WTRU may receive configuration information (e.g., as described herein) indicating a matrix decomposition type, a number of matrix factors, dimensions associated with the matrix, etc. Figure 6 As shown, the WTRU may determine a matrix decomposition structure (e.g., based on channel conditions such as rank) and utilize the structure (e.g., such as group sparseness and / or low rank) to perform channel estimation (e.g., based on RS symbols received from a base station). For example, the WTRU may indicate (e.g., to the base station) that the WTRU is configured to perform channel estimation based on a matrix (e.g., such as Figure 6 Channel estimation may be performed using a matrix decomposition structure associated with a channel matrix (e.g., as shown in the drawings) (e.g., based on matrix factor determination, as described herein). The group sparsity property in a channel matrix (e.g., a MIMO channel matrix) may provide a more accurate representation to define the channel matrix (e.g., compared to an element-by-element sparse or low-rank representation that may be commonly used).

[0105] The group sparse representation of the channel matrix can be applied to applications other than channel estimation. For example, the group sparse structure can be used (e.g., utilized) to evaluate analog beamforming vectors (e.g., in hybrid beamforming). For example, the group sparse structure can be used (e.g., utilized, directly utilized) in conjunction with CSI compression.

[0106] The operations and / or processes of performing channel estimation (e.g., as described herein) can be used without (e.g., without requiring) a priori information (e.g., any a priori information) about the data, e.g., unlike other machine learning or deep learning methods. The operations and / or processes of performing channel estimation (e.g., as described herein) can be used without (e.g., without requiring) parameter adjustment (e.g., any detailed parameter adjustment), e.g., other optimization strategies can use (e.g., require) parameter adjustment. The operations and / or processes of performing channel estimation (e.g., as described herein) are feasible for practical deployment.

[0107] A parameter (e.g., a CSI parameter) may be associated with a channel (e.g., a channel matrix, a reconstructed channel matrix). The parameter may include, for example, a rank indicator, a precoder matrix indicator (PMI), a channel quality indicator (CQI), etc. The parameter (e.g., a CSI parameter) may depend on the channel matrix (e.g., the reconstructed channel matrix). The parameter (e.g., a CSI parameter) may be sent as feedback to, for example, a base station (e.g., in a downlink). For example, if the channel matrix changes, the parameter (e.g., a CSI parameter) may change (e.g., the WTRU may determine that the channel condition is changing, for example, based on the change in the parameter (e.g., the change in the parameter exceeds a certain threshold)). For example, a characteristic of the channel (e.g., a parameter associated with the channel) may be monitored. A function of the channel characteristic may be monitored. The WTRU may determine that the channel condition has changed (e.g., the channel condition has changed compared to a previous value of the channel condition, e.g., the change is greater than a threshold). For example, if the function of determining the channel characteristic changes by more than a threshold, the WTRU may determine that the channel condition has changed. The absolute value of the parameter value or the change in these parameters or the rate of change of these parameters exceeding a threshold may be used to determine the change in the channel condition.

[0108] In an example, the reconstructed channel matrix may be sent, for example, to a base station.The reconstructed channel matrix may be sent as feedback.

[0109] Although the implementations described herein may consider 3GPP specific protocols, it should be understood that the implementations described herein are not limited to such scenarios and are applicable to other wireless systems. For example, although the solutions described herein consider LTE, LTE-A, New Radio (NR) or 5G specific protocols, it should be understood that the solutions described herein are not limited to such scenarios and are also applicable to other wireless systems.

[0110] The processes described above may be implemented in a computer program, software, and / or firmware incorporated in a computer-readable medium for execution by a computer and / or a processor. Examples of computer-readable media include, but are not limited to, electronic signals (transmitted via a wired or wireless connection) and / or 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, but not limited to, built-in hard disks and removable disks), magneto-optical media, and optical media (such as compact disk (CD)-ROM disks and / or digital versatile disks (DVDs)). A processor associated with the software may be used to implement a radio frequency transceiver for a WTRU, terminal, base station, RNC, and / or any host computer.

Claims

1. A wireless transmit / receive unit (WTRU), the WTRU comprising: A processor, the processor being configured to: receiving configuration information from a base station, wherein the configuration information indicates matrix factors associated with a matrix, respective dimensions associated with each matrix factor in the matrix, and initialization for each matrix factor in the matrix, and wherein the matrix is ​​associated with a downlink channel between the WTRU and the base station; determining a matrix factorization (MF) structure associated with the matrix based on the matrix factors, wherein the MF structure is associated with at least a first structure or a second structure; as well as An indication is sent to the base station indicating that the WTRU is configured to perform channel estimation based on the MF structure associated with the matrix.

2. The WTRU of claim 1 , wherein the processor is further configured to: receiving a reference signal (RS) symbol for performing channel estimation; and Channel estimation is performed using the received RS symbols and the determined MF structure, wherein the channel estimation includes matrix completion using non-convex operations, wherein the matrix completion using the non-convex operations is performed based on the MF structure and the corresponding dimension associated with each matrix factor in the matrix.

3. The WTRU of claim 2, wherein the non-convex operation is associated with gradient descent.

4. The WTRU of claim 2 or 3, wherein the RS symbol is a demodulation reference signal symbol or a channel state information symbol.

5. The WTRU of any one of claims 2 to 4, wherein the processor is further configured to: determining a channel condition associated with the downlink channel between the WTRU and the base station; determining, based on the determined channel condition, that the channel condition associated with the downlink channel between the WTRU and the base station is changing; and An indication indicative of the channel condition is sent to the base station.

6. The WTRU according to any one of claims 1 to 5, wherein the first structure is a low-rank structure, and wherein the second structure is a group sparse structure.

7. The WTRU of any one of claims 1 to 6, wherein the processor is further configured to: obtaining channel information associated with the downlink channel between the WTRU and the base station; Determine to use the MF based on the obtained channel information; and Based on the determination using the MF, an indication indicating the obtained channel information is sent to the base station.

8. A method comprising: receiving configuration information from a base station, wherein the configuration information indicates matrix factors associated with a matrix, respective dimensions associated with each matrix factor in the matrix, and initialization for each matrix factor in the matrix, and wherein the matrix is ​​associated with a downlink channel between the WTRU and the base station; determining a matrix factorization (MF) structure associated with the matrix based on the matrix factors, wherein the MF structure is associated with at least a first structure or a second structure; as well as An indication is sent to the base station indicating that the WTRU is configured to perform channel estimation based on the MF structure associated with the matrix.

9. The method according to claim 8, wherein the method further comprises: receiving a reference signal (RS) symbol for performing channel estimation; as well as Channel estimation is performed using the received RS symbols and the determined MF structure, wherein the channel estimation includes matrix completion using non-convex operations, wherein the matrix completion using the non-convex operations is performed based on the MF structure and the corresponding dimension associated with each matrix factor in the matrix.

10. The WTRU of claim 9, wherein the non-convex operation is associated with gradient descent.

11. The WTRU of claim 9 or 10, wherein the RS symbol is a demodulation reference signal symbol or a channel state information symbol.

12. The method according to any one of claims 9 to 11, wherein the method further comprises: determining a channel condition associated with the downlink channel between the WTRU and the base station; determining, based on the determined channel condition, that the channel condition associated with the downlink channel between the WTRU and the base station is changing; as well as An indication indicative of the channel condition is sent to the base station.

13. The method according to any one of claims 8 to 12, wherein the first structure is a low-rank structure, and wherein the second structure is a group sparse structure.

14. The method according to any one of claims 8 to 13, wherein the method further comprises: obtaining channel information associated with the downlink channel between the WTRU and the base station; Determine to use the MF based on the obtained channel information; as well as Based on the determination using the MF, an indication indicating the obtained channel information is sent to the base station.