# Patent

## Title
Codebook subset restriction (CBSR) on per spatial domain amplitude

## Abstract

Certain aspects of the present disclosure provide techniques for channel state information (CSI) reporting with frequency domain (FD) compression. More particularly, aspects of the present disclosure provide for codebook subset restriction (CBSR) on per spatial domain (SD) basis amplitude.

## Background
CROSS-REFERENCE TO RELATED APPLICATION(S)
This application is a national stage application under 35 U.S.C. 371 of PCT/CN2020/097030, filed Jun. 19, 2020, which claims benefit of and priority to International Application No. PCT/CN2019/092255, filed Jun. 21, 2019, which [is] are hereby assigned to the assignee hereof, and hereby expressly incorporated by reference herein in its entirety their entireties as if fully set forth below and for all applicable purposes.
BACKGROUND
Field of the Disclosure
Aspects of the present disclosure relate to wireless communications, and more particularly, to techniques for codebook subset restriction (CBSR) for CSI reporting.
Description of Related Art
Wireless communication systems are widely deployed to provide various telecommunication services such as telephony, video, data, messaging, broadcasts, etc. These wireless communication systems may employ multiple-access technologies capable of supporting communication with multiple users by sharing available system resources (e.g., bandwidth, transmit power, etc.), Examples of such multiple-access systems include 3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE systems, LTE Advanced (LTE-A) systems, code division multiple access (CDMA) systems, time division multiple access (TDMA) systems, frequency division multiple access (FDMA) systems, orthogonal frequency division multiple access (OFDMA) systems, single-carrier frequency division multiple access (SC-FDMA) systems, and time division synchronous code division multiple access (TD-SCDMA) systems, to name a few.
In some examples, a wireless multiple-access communication system may include a number of base stations (BSs), which are each capable of simultaneously supporting communication for multiple communication devices, otherwise known as user equipments (UEs), in an LTE or LTE-A network, a set of one or more base stations may define an eNodeB (eNB). In other examples (e.g., in a next generation, a new radio (NR), or 5G network), a wireless multiple access communication system may include a number of distributed units (DUs) (e.g., edge units (EUs), edge nodes (ENs), radio heads (RHs), smart radio heads (SRHs), transmission reception points (TRPs), etc.) in communication with a number of central units (CUs) (e.g., central nodes (CNs), access node controllers (ANCs), etc.), where a set of one or more DUs, in communication with a CU, may define an access node (e.g., which may be referred to as a BS, 5G NB, next generation NodeB (gNB or gNodeB), transmission reception point (TRP), etc.). A BS or DU may communicate with a set of UEs on downlink channels (e.g., for transmissions from a BS or DU to a LTE) and uplink channels (e.g., for transmissions from a LE to BS or DU).
These multiple access technologies have been adopted in various telecommunication standards to provide a common protocol that enables different wireless devices to communicate on a municipal, national, regional, and even global level. NR (e.g., new radio or 5G) is an example of an emerging telecommunication standard. NR is a set of enhancements to the LIE mobile standard promulgated by 3GPP. NR is designed to better support mobile broadband Internet access by improving spectral efficiency, lowering costs, improving services, making use of new spectrum, and better integrating with other open standards using OFDMA with a cyclic prefix (CP) on the downlink (DL) and on the uplink (UL). To these ends, NR supports beamforming, multiple-input multiple-output (MIMO) antenna technology, and carrier aggregation.
However, as the demand for mobile broadband access continues to increase, there exists a need for further improvements in NR and LTE technology. Preferably, these improvements should be applicable to other multi-access technologies and the telecommunication standards that employ these technologies.
SUMMARY
The systems, methods, and devices of the disclosure each have several aspects, no single one of which is solely responsible for its desirable attributes. Without limiting the scope of this disclosure as expressed by the claims which follow, some features will now be discussed briefly. After considering this discussion, and particularly after reading the section entitled “Detailed Description” one will understand how the features of this disclosure provide advantages that include improved communications between access points and stations in a wireless network.
Certain aspects of the disclosure relate to a method for wireless communication by a user equipment (UE), The method generally includes receiving a channel state information (CSI) request from a base station, triggering a CSI report comprising at least one of a plurality of spatial domain (SD) bases, a plurality of frequency domain (FD) bases, and a plurality of linear combination coefficients, receiving a configuration which, restricts, for each SD basis, a maximum average amplitude of the linear combination coefficients associated with that SD basis, and sending the CSI report, with the linear combination coefficients generated in accordance with the configuration.
Certain aspects of the disclosure relate to a method for wireless communication by a user equipment (UE). The method generally includes sending a channel state information (CSI) request to a user equipment (UE), triggering a CSI report comprising at least one of a plurality of spatial domain (SD) bases, a plurality of frequency domain (FD) bases, and a plurality of linear combination coefficients, sending the UE a configuration which, restricts, for each SD basis, a maximum average amplitude of the linear combination coefficients associated with that SD basis, and receiving the CSI report; and processing the linear combination coefficients contained in the CSI report in accordance with the configuration.
To the accomplishment of the foregoing and related ends, the one or more aspects comprise the features hereinafter fully described and particularly pointed out in the claims. The following description and the appended drawings set forth in detail certain illustrative features of the one or more aspects. These features are indicative, however, of but a few of the various ways in which the principles of various aspects may be employed.



BRIEF DESCRIPTION OF THE DRAWINGS
So that the manner in which the above-recited features of the present disclosure can be understood in detail, a more particular description, briefly summarized above, may be had by reference to aspects, some of which are illustrated in the drawings. It is to be noted, however, that the appended drawings illustrate only certain typical aspects of this disclosure and are therefore not to be considered limiting of its scope, for the description may admit to other equally effective aspects.
FIG. 1 is a block diagram conceptually illustrating an example telecommunications system, in accordance with certain aspects of the present disclosure.
FIG. 2 is a block diagram showing examples for implementing a communication protocol stack in the example RAN architecture, in accordance with certain aspects of the present disclosure.
FIG. 3 is a block diagram conceptually illustrating a design of an example base station (BS) and user equipment (UE), in accordance with certain aspects of the present disclosure.
FIG. 4 illustrates an example of a frame format for a telecommunication system, in accordance with certain aspects of the present disclosure.
FIG. 5 illustrates a conceptual example of a first precoder matrix for transmission layer 0 and a second precoder matrix for transmission layer 1, in accordance with certain aspects of the present disclosure.
FIG. 6 illustrates three tables showing example M values according to rank and layer, in accordance with certain aspects of the present disclosure.
FIG. 7 illustrates graphically various matrices.
FIG. 8 is a flow diagram illustrating example operations for wireless communication by a UE, in accordance with certain aspects of the present disclosure.
FIG. 9 is a flow diagram illustrating example operations for wireless communication by a base station, in accordance with certain aspects of the present disclosure.
FIG. 10 is a call flow diagram illustrating example operations for wireless communication between a UE and BS, in accordance with certain aspects of the present disclosure.



To facilitate understanding, identical reference numerals have been used, where possible, to designate identical elements that are common to the figures. It is contemplated that elements disclosed in one aspect may be beneficially utilized on other aspects without specific recitation.
DETAILED DESCRIPTION
Aspects of the present disclosure provide apparatus, methods, processing systems, and computer readable mediums for channel state information (CSI) reporting of frequency domain (FD) compression.
In certain systems, such as certain new radio systems (e.g., Release 16 5G NR systems), to save the overhead used for a linear combination codebook (also referred to as a Type II Codebook), a frequency compression based codebook may be used and reported via two stage uplink control information (UCI). In some aspects, the UE may report select FD bases for each layer independently, and the number of FD bases for each layer of each rank is determined based on a configuration from the network. In some aspects, a two-stage FD basis report is used to indicate the FD basis selection for each layer to the network. The first stage uses an intermediate set, while the second stage comprises individual FD basis report for each layer.
In some cases the size of the intermediate set is reported by the UE. That is, the UE freely selects the FD bases for each layer from a total number of N3 FD bases; and the UE determines the intermediate set that covers the union of the ED bases selected for each layer. The UE needs to report the size of the intermediate set in UCI part 1 and report information related to the intermediate set in UCI part 2, and report individual FD basis for each layer in UCI part 2. In some other aspects, the size of the intermediate set is configured by the network or derived by the UE based on some other configured parameters following a rule fixed in the spec, or the size is explicitly specified in the a wireless communication specification. In this case, the UE needs to find an intermediate set common for all layers of a certain rank based on the size of the intermediate set. Then UE does not need to report the size, but may or may not need to report the information of the intermediate set in UCI part 2, and also report, the individual ED bases for each layer in UCI part 2 from the intermediate set.
The following description provides examples, and is not limiting of the scope, applicability, or examples set forth in the claims. Changes may be made in the function and arrangement of elements discussed without departing from the scope of the disclosure. Various examples may omit, substitute, or add various procedures or components as appropriate. For instance, the methods described may be performed in an order different from that described, and various steps may be added, omitted, or combined. Also, features described with respect to some examples may be combined in some other examples. For example, an apparatus may be implemented or a method may be practiced using any number of the aspects set forth herein. In addition, the scope of the disclosure is intended to cover such an apparatus or method which is practiced using other structure, functionality, or structure and functionality in addition to, or other than, the various aspects of the disclosure set forth herein. It should be understood that any aspect of the disclosure disclosed herein may be embodied by one or more elements of a claim. The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any aspect described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects.
The techniques described herein may be used for various wireless communication technologies, such as LTE, CDMA, TDMA, FDMA, OFDMA, SC-FDMA and other networks. The terms “network” and “system” are often used interchangeably. A CDMA network may implement a radio technology such as Universal Terrestrial Radio Access (UTRA), cdma2000, etc. UTRA includes Wideband CDMA (WVCDMA) and other variants of CDMA. cdma2000 covers IS-2000, IS-95 and IS-856 standards. A TDMA network may implement a radio technology such as Global System for Mobile Communications (GSM). An OFDMA network may implement a radio technology such as NR (e.g. 5G RA), Evolved UTRA (E-UTRA), Ultra Mobile Broadband (UMB), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Flash-OFDMA, etc. UTRA and E-UTRA are part of Universal Mobile Telecommunication System (UMTS).
New Radio (NR) is an emerging wireless communications technology under development in conjunction with the 5G Technology Forum (5GTF). 3GPP Long Term Evolution (LTE) and LTE-Advanced (LTE-A) are releases of UMTS that use E-UTRA. UTRA, E-UTRA, UMTS, LTE, LTE-A and GSM are described in documents from an organization named “3rd Generation Partnership Project” (3GPP). cdma2000 and UMB are described in documents from an organization named “3rd Generation Partnership Project 2” (3GPP2). The techniques described herein may be used for the wireless networks and radio technologies mentioned above as well as other wireless networks and radio technologies. For clarity, while aspects may be described herein using terminology commonly associated with 3G and/or 4G wireless technologies, aspects of the present disclosure can be applied in other generation-based communication systems, such as 5G and later, including NR technologies.
New radio (NR) access (e.g., 5G technology) may support various wireless communication services, such as enhanced mobile broadband (eMBB) targeting wide bandwidth (e.g., 80 MHz or beyond), millimeter wave (mmW) targeting high carrier frequency (e.g., 25 GHz or beyond), massive machine type communications MTC (mMTC) targeting non-backward compatible MTC techniques, and/or mission critical targeting ultra-reliable low-latency communications (URLLC). These services may include latency and reliability requirements. These services may also have different transmission time intervals (TTI) to meet respective quality of service (QoS) requirements. In addition, these services may coexist in the same subframe.
Example Wireless Communications System
FIG. 1 illustrates an example wireless communication network 100 in which aspects of the present disclosure may be performed. For example, the wireless communication network 100 may be a New Radio (NR) or 5G network. A UE 120 in the wireless communication network 100 may receive a channel state information (CSI) report configuration from a base station. The CSI report configuration configures the UE 120 for CSI reporting.
For example, the CSI report configuration configures the UTE 120 to determine precoding matrix information and an FD basis selection for each transmission layer based at least in part on an intermediate set size, wherein the intermediate set size is known between devices (e.g., base station and UE) and based on a wireless network configuration or rule. The UE 120 may report, in a UCI, the FD basis selection for the specific transmission layer.
In some cases the size of the intermediate set is reported by the UE. That is, the UE freely selects the ED bases for each layer from a total number of N3 FD bases; and the UE determines the intermediate set that covers the union of the FD bases selected for each layer. The UE needs to report the size of the intermediate set in UCI part 1 and report information related to the intermediate set in UCI part 2, and report individual FD basis for each layer in UCI part 2. In some other aspects, the size of the intermediate set is configured by the network or derived by the UE based on some other configured parameters following a rule fixed in the spec, or the size is explicitly specified in the a wireless communication specification. In this case, the UE needs to find an intermediate set common for all layers of a certain rank based on the size of the intermediate set. Then UE does not need to report the size, but may or may not need to report the information of the intermediate set in UCI part 2, and also report the individual FD bases for each layer in UCI part 2 from the intermediate set.
In certain aspects, the BS may determine the intermediate set and size of the intermediate set (e.g., N3′) using the same or similar methods as discussed herein for the UE. For example, the BS may utilize the same equations discussed for the UE. The information for making the determinations may be available to the BS as discussed with respect to the UE.
As illustrated in FIG. 1, the wireless communication network 100 may include a number of base stations (BSs) 110 and other network entities. A BS may be a station that communicates with user equipment (UE). Each BS 110 may provide communication coverage for a particular geographic area. In 3GPP, the term “cell” can refer to a coverage area of a NodeB (NB) and/or a NB subsystem serving this coverage area, depending on the context in which the term is used. In NR systems, the term “cell” and next generation NodeB (gNB or gNodeB), NR BS, 5G NB, access point (AP), or transmission reception point (TRP) may be interchangeable. In some examples, a cell may not necessarily be stationary, and the geographic area of the cell may move according to the location of a mobile BS. In some examples, the base stations may be interconnected to one another and/or to one or more other base stations or network nodes (not shown) in wireless communication network 100 through various types of backhaul interfaces, such as a direct physical connection, a wireless connection, a virtual network, or the like using any suitable transport network.
In general, any number of wireless networks may be deployed in a given geographic area. Each wireless network may support a particular radio access technology (RAT) and may operate on one or more frequencies. A RAT may also be referred to as a radio technology, an air interface, etc. A frequency may also be referred to as a carrier, a suhcarrier, a frequency channel, a tone, a subband, etc. Each frequency may support a single RAT in a given geographic area in order to avoid interference between wireless networks of different RATs. In some cases, NR or 5G RAT networks may be deployed.
A BS may provide communication coverage for a macro cell, a pico cell, a femto cell, and/or other types of cells. A macro cell may cover a relatively large geographic area (e.g., several kilometers in radius) and may allow unrestricted access by UEs with service subscription. A pico cell may cover a relatively small geographic area and may allow unrestricted access by UEs with service subscription. A femto cell may cover a relatively small geographic area (e.g., a home) and may allow restricted access by UEs having an association with the femto cell (e.g., UEs in a Closed Subscriber Group (CSG), UEs for users in the home, etc.). A BS for a macro cell may be referred to as a macro BS. A BS for a pico cell may be referred to as a pico BS. A BS for a femto cell may be referred to as a femto BS or a home BS. In the example shown in FIG. 1, the BSs 110a, 110b and 110c may be macro BSs for the macro cells 102a, 102b and 102c, respectively. The BS 110x may be a pico BS for a pico cell 102x. The BSs 110y and 110z may be femto BSs for the femto cells 102y and 102z, respectively. A BS may support one or multiple (e.g., three) cells.
Wireless communication network 100 may also include relay stations. A relay station is a station that receives a transmission of data and/or other information from an upstream station (e.g., a BS or a UE) and sends a transmission of the data and/or other information to a downstream station (e.g., a UE or a BS). A relay station may also be a UE that relays transmissions for other UEs. In the example shown in FIG. 1, a relay station 110r may communicate with the BS 110a and a UE 120r in order to facilitate communication between the BS 110a and the UE 120r. A relay station may also be referred to as a relay BS, a relay, etc.
Wireless communication network 100 may be a heterogeneous network that includes BSs of different types, e.g., macro BS, pico BS, fernto BS, relays, etc. These different types of BSs may have different transmit power levels, different coverage areas, and different impact on interference in the wireless communication network 100. For example, macro BS may have a high transmit power level (e.g., 20 Watts) whereas pico BS, femto BS, and relays may have a lower transmit power level (e.g., 1 Watt).
Wireless communication network 100 may support synchronous or asynchronous operation. For synchronous operation, the BSs may have similar frame timing, and transmissions from different BSs may be approximately aligned in time. For asynchronous operation, the BSs may have different frame timing, and transmissions from different BSs may not be aligned in time. The techniques described herein may be used for both synchronous and asynchronous operation.
A network controller 130 may couple to a set of BSs and provide coordination and control for these BSs. The network controller 130 may communicate with the BSs 110 via a backhaul. The BSs 110 may also communicate with one another (e.g., directly or indirectly) via wireless or wireline backhaul.
The UEs 120 (e.g., 120x, 120y, etc.) may be dispersed throughout the wireless communication network 100, and each UE may be stationary or mobile. A UE may also be referred to as a mobile station, a terminal, an access terminal, a subscriber unit, a station, a Customer Premises Equipment (CPE), a cellular phone, a smart phone, a personal digital assistant (PDA), a wireless modem, a wireless communication device, a handheld device, a laptop computer, a cordless phone, a wireless local loop (WLL) station, a tablet computer, a camera, a gaming device, a netbook, a smartbook, an ultrabook, an appliance, a medical device or medical equipment, a biometric sensor/device, a wearable device such as a smart watch, smart clothing, smart glasses, a smart wrist band, smart jewelry (e.g., a smart ring, a smart bracelet, etc.), an entertainment device (e.g., a music device, a video device, a satellite radio, etc.), a vehicular component or sensor, a smart meter/sensor, industrial manufacturing equipment, a global positioning system device, or any other suitable device that is configured to communicate via a wireless or wired medium. Some UEs may be considered machine-type communication (MTC) devices or evolved MTC (eMTC) devices. MTC and eMTC UEs include, for example, robots, drones, remote devices, sensors, meters, monitors, location tags, etc., that may communicate with a BS, another device (e.g., remote device), or some other entity. A wireless node may provide, for example, connectivity for or to a network (e.g., a wide area network such as Internet or a cellular network) via a wired or wireless communication link. Some UEs may be considered Internet-of-Things (IoT) devices, which may be narrowband IoT (NB-IoT) devices.
Certain wireless networks (e.g., LTE) utilize orthogonal frequency division multiplexing (OFDM) on the downlink and single-carrier frequency division multiplexing (SC-FDM) on the uplink. OFDM and SC-FDM partition the system bandwidth into multiple (K) orthogonal subcarriers, which are also commonly referred to as tones, bins, etc. Each subcarrier may be modulated with data. In general, modulation symbols are sent in the frequency domain with OFDM and in the time domain with SC-FDM. The spacing between adjacent subcarriers may be fixed, and the total number of subcarriers (K) may be dependent on the system bandwidth. For example, the spacing of the subcarriers may be 15 kHz and the minimum resource allocation (called a “resource block” (RB)) may be 12 subcarriers (or 180 kHz). Consequently, the nominal Fast Fourier Transfer (FFT) size may be equal to 128, 256, 512, 1024 or 2048 for system bandwidth of 1.25, 2.5, 5, 10, or 20 megahertz (MHz), respectively. The system bandwidth may also be partitioned into sub-bands. For example, a sub-band may cover 1.08 MHz (i.e., 6 resource blocks), and there may be 1, 2, 4, 8, or 16 sub-bands for system bandwidth of 1.25, 2.5, 5, 10 or 20 MHz, respectively.
Communication systems such as NR may utilize OFDM with a cyclic prefix (CP) on the uplink and downlink and include support for half-duplex operation using time division duplex (TDD). Beamforming may be supported and beam direction may be dynamically configured. MIMO transmissions with precoding may also be supported. MIMO configurations in the DL may support up to 8 transmit antennas with multi-layer DL transmissions up to 8 streams and up to 4 streams per UE. Multi-layer transmissions with up to 4 streams per UE may be supported. Aggregation of multiple cells may be supported with up to 8 serving cells.
In some examples, access to the air interface may be scheduled. A scheduling entity (e.g., a BS) allocates resources for communication among some or ail devices and equipment within its service area or cell. The scheduling entity may be responsible for scheduling, assigning, reconfiguring, and releasing resources for one or more subordinate entities. That is, for scheduled communication, subordinate entities utilize resources allocated by the scheduling entity. Base stations are not the only entities that may function as a scheduling entity. In some examples, a UE may function as a scheduling entity and may schedule resources for one or more subordinate entities (e.g., one or more other UEs), and the other UEs may utilize the resources scheduled by the UE for wireless communication. In some examples, a UE may function as a scheduling entity in a peer-to-peer (P2P) network, and/or in a mesh network. In a mesh network example, UEs may communicate directly with one another in addition to communicating with a scheduling entity.
In FIG. 1, a solid line with double arrows indicates desired transmissions between a UE and a serving BS, which is a BS designated to serve the UE on the downlink and/or uplink. A finely dashed line with double arrows indicates interfering transmissions between a UE and a BS.
FIG. 2 illustrates a diagram showing examples for implementing a communications protocol stack in a RAN (e.g., such as the RAN 100), according to aspects of the present disclosure. The illustrated communications protocol stack 200 may be implemented by devices operating in a wireless communication system, such as a 5G NR system (e.g., the wireless communication network 100). In various examples, the layers of the protocol stack 200 may be implemented as separate modules of software, portions of a processor or ASIC, portions of non-collocated devices connected by a communications link, or various combinations thereof. Collocated and non-collocated implementations may be used, for example, in a protocol stack for a network access device or a UE. As shown in FIG. 2, the system may support various services over one or more protocols. One or more protocol layers of the protocol stack 200 may be implemented by the AN and/or the UE.
As shown in FIG. 2, the protocol stack 200 is split in the AN (e.g., BS 110 in FIG. 1). The RRC layer 205, PDCP layer 210, RLC layer 215, MAC layer 220, PHY layer 225, and RF layer 230 may be implemented by the AN. For example, the CU-CP may implement the RRC layer 205 and the PDCP layer 210. A DU may implement the RLC layer 215 and MAC layer 220. The AU/RRU may implement the PHY layer(s) 225 and the RF layer(s) 230. The PHY layers 225 may include a high PHY layer and a low PHY layer.
The UE may implement the entire protocol stack 200 (e.g., the RRC layer 205, the PDCP layer 210, the RLC layer 215, the MAC layer 220, the PHY layer(s) 225, and the RF layer(s) 230).
FIG. 3 illustrates example components of BS 110 and UE 120 (as depicted in FIG. 1), which may be used to implement aspects of the present disclosure. For example, antennas 352, processors 366, 358, 364, and/or controller/processor 380 of the UE 120 and/or antennas 334, processors 320, 330, 338, and/or controller/processor 340 of the BS 110 may be used to perform the various techniques and methods described herein. For example, as shown in FIG. 3, the processor 340 has an intermediate set size calculation module 390 that may be configured for determining precoding matrix information, including, for each layer, a common indication of a size of an intermediate set of frequency domain (FD) bases and an FD basis selection based on the intermediate set size. The intermediate set size calculation module 390 may also configure the UE 120 to report, in a first part of uplink control information (UCI), the indication of the size of the intermediate set of FD bases across all layers and, in a second part of UCI, the FD basis selection for the specific transmission layer, according to aspects described herein. For example, as shown in FIG. 3, the processor 380 has a CSI report configuration module 392 that may be configured for generating one or more CSI report parameters and transmitting the parameters to the UE, according to aspects described herein.
At the BS 110, a transmit processor 320 may receive data from a data source 312 and control information from a controller/processor 340. The control information may be for the physical broadcast channel (PBCH), physical control format indicator channel (PCFICH), physical hybrid ARQ indicator channel (PHICH), physical downlink control channel (PDCCH), group common PDCCH (GC PDCCH), etc. The data may be for the physical downlink shared channel (PDSCH), etc. The processor 320 may process (e.g., encode and symbol map) the data and control information to obtain data symbols and control symbols, respectively. The processor 320 may also generate reference symbols, e.g., for the primary synchronization signal (PSS), secondary synchronization signal (SSS), and cell-specific reference signal (CRS). A transmit (TX) multiple-input multiple-output (MIMO) processor 330 may perform spatial processing (e.g., precoding) on the data symbols, the control symbols, and/or the reference symbols, if applicable, and may provide output symbol streams to the modulators (MODs) 332a through 332t. Each modulator 332 may process a respective output symbol stream (e.g., for OFDM, etc.) to obtain an output sample stream. Each modulator may further process (e.g., convert to analog, amplify, filter, and upconvert) the output sample stream to obtain a downlink signal. Downlink signals from modulators 332a through 332t may be transmitted via the antennas 334a through 334t, respectively.
At the UE 120, the antennas 352a through 352r may receive the downlink signals from the base station 110 and may provide received signals to the demodulators (DEMODs) in transceivers 354a through 354r, respectively. Each demodulator 354 may condition (e.g., filter, amplify, down-convert, and digitize) a respective received signal to obtain input samples. Each demodulator may further process the input samples (e.g., for OFDM, etc.) to obtain received symbols. A MIMO detector 356 may obtain received symbols from all the demodulators 354a through 354r, perform MIMO detection on the received symbols if applicable, and provide detected symbols. A receive processor 358 may process (e.g., demodulate, de-interleave, and decode) the detected symbols, provide decoded data for the UE 120 to a data sink 360, and provide decoded control information to a controller/processor 380.
In a MIMO system, a transmitter (e.g., BS 120) includes multiple transmit antennas 354a through 354r, and a receiver (e.g., UE 110) includes multiple receive antennas 352a through 352r. Thus, there are a plurality of signal paths 394 from the transmit antennas 354a through 354r to the receive antennas 352a through 352r. Each of the transmitter and the receiver may be implemented, for example, within a UE 110, a BS 120, or any other suitable wireless communication device.
The use of such multiple antenna technology enables the wireless communication system to exploit the spatial domain to support spatial multiplexing, beamforming, and transmit diversity. Spatial multiplexing may be used to transmit different streams of data, also referred to as layers, simultaneously on the same time-frequency resource. The data streams may be transmitted to a single UE to increase the data rate or to multiple UEs to increase the overall system capacity, the latter being referred to as multi-user MIMO (MU-MIMO). This is achieved by spatially preceding each data stream (i.e., multiplying the data streams with different weighting and phase shifting) and then transmitting each spatially precoded stream through multiple transmit antennas on the downlink. The spatially precoded data streams arrive at the UE(s) with different spatial signatures, which enables each of the UE(s) to recover the one or more data streams destined for that UE. On the uplink, each UE transmits a spatially precoded data stream, which enables the base station to identify the source of each spatially precoded data stream.
The number of data streams or layers corresponds to the rank of the transmission. In general, the rank of the MIMO system is limited by the number of transmit or receive antennas, whichever is lower. In addition, the channel conditions at the UE, as well as other considerations, such as the available resources at the base station, may also affect the transmission rank. For example, the rank (and therefore, the number of transmission layers) assigned to a particular UE on the downlink may be determined based on the rank indicator (RI) transmitted from the UE to the base station. The RI may be determined based on the antenna configuration (e.g., the number of transmit and receive antennas) and a measured signal-to-interference-and-noise ratio (SINR) on each of the receive antennas. The RI may indicate, for example, the number of layers that may be supported under the current channel conditions. The base station may use the RI, along with resource information (e.g., the available resources and amount of data to be scheduled for the UE), to assign a transmission rank to the UE.
On the uplink, at UE 120, a transmit processor 364 may receive and process data (e.g., for the physical uplink shared channel (PUSCH)) from a data source 362 and control information (e.g., for the physical uplink control channel (PUCCH) from the controller/processor 380. The transmit processor 364 may also generate reference symbols for a reference signal (e.g., for the sounding reference signal (SRS)). The symbols from the transmit processor 364 may be precoded by a TX MIMO processor 366 if applicable, further processed by the demodulators in transceivers 354a through 354r (e.g., for SC-FDM, etc.), and transmitted to the base station 110. At the BS 110, the uplink signals from the UE 120 may be received by the antennas 334, processed by the modulators 332, detected by a MIMO detector 336 if applicable, and further processed by a receive processor 338 to obtain decoded data and control information sent by the UE 120. The receive processor 338 may provide the decoded data to a data sink 339 and the decoded control information to the controller/processor 340.
The controllers/processors 340 and 380 may direct the operation at the BS 110 and the UE 120, respectively. The processor 340 and/or other processors and modules at the BS 110 may perform or direct the execution of processes for the techniques described herein. The memories 342 and 382 may store data and program codes for BS 110 and UE 120, respectively. A scheduler 344 may schedule UEs for data transmission on the downlink and/or uplink.
FIG. 4 is a diagram showing an example of a frame format 400 for NR. The transmission timeline for each of the downlink and uplink may be partitioned into units of radio frames. Each radio frame may have a predetermined duration (e.g., 10 ms) and may be partitioned into 10 subframes, each of 1 ms, with indices of 0 through 9. Each suhframe may include a variable number of slots depending on the suhcarrier spacing. Each slot may include a variable number of symbol periods (e.g., 7 or 14 symbols) depending on the subcarrier spacing. The symbol periods in each slot may be assigned indices. A mini-slot, which may be referred to as a sub-slot structure, refers to a transmit time interval having a duration less than a slot (e.g., 2, 3, or 4 symbols). Each symbol in a slot may indicate a link direction (e.g., DL, UL, or flexible) for data transmission and the link direction for each subfranie may be dynamically switched. The link directions may be based on the slot format. Each slot may include DL/UL data as well as DL/UL control information.
In NR, a synchronization signal (SS) block is transmitted. The SS block includes a PSS, a SSS, and a two symbol PBCH. The SS block can be transmitted in a fixed slot location, such as the symbols 0-3 as shown in FIG. 4. The PSS and SSS may be used by UEs for cell search and acquisition. The PSS may provide half-frame timing, the SS may provide the CP length and frame timing. The PSS and SSS may provide the cell identity. The PBCH carries some basic system information, such as downlink system bandwidth, timing information within radio frame, SS burst set periodicity, system frame number, etc. The SS blocks may be organized into SS bursts to support beam sweeping. Further system information such as, remaining minimum system information (RMSI), system information blocks (SIBs), other system information (OSI) can be transmitted on a physical downlink shared channel (PDSCH) in certain subframes. The SS block can be transmitted up to sixty-four times, for example, with up to sixty-four different beam directions for mmW. The up to sixty-four transmissions of the SS block are referred to as the SS burst set. SS blocks in an SS burst set are transmitted in the same frequency region, while SS blocks in different SS bursts sets can be transmitted at different frequency locations.
A UE may operate in various radio resource configurations, including a configuration associated with transmitting pilots using a dedicated set of resources (e.g., a radio resource control (RRC) dedicated state, etc.) or a configuration associated with transmitting pilots using a common set of resources (e.g., an RRC common state, etc.). When operating in the RRC dedicated state, the UE may select a dedicated set of resources for transmitting a pilot signal to a network. When operating in the RRC common state, the UE may select a common set of resources for transmitting a pilot signal to the network. In either case, a pilot signal transmitted by the UE may be received by one or more network access devices, such as an AN, or a DU, or portions thereof. Each receiving network access device may be configured to receive and measure pilot signals transmitted on the common set of resources, and also receive and measure pilot signals transmitted on dedicated sets of resources allocated to the UEs for which the network access device is a member of a monitoring set of network access devices for the UE. One or more of the receiving network access devices, or a CU to which receiving network access device(s) transmit the measurements of the pilot signals, may use the measurements to identify serving cells for the UEs, or to initiate a change of serving cell for one or more of the UEs.
Example CSI Report Configuration
Channel state information (CSI) may refer to channel properties of a communication link. The CSI may represent the combined effects of, for example, scattering, fading, and power decay with distance between a transmitter and receiver. Channel estimation using pilots, such as CSI reference signals (CSI-RS), may be performed to determine these effects on the channel. CSI may be used to adapt transmissions based on the current channel conditions, which is useful for achieving reliable communication, in particular, with high data rates in multi-antenna systems. CSI is typically estimated at the receiver, quantized, and fed back to the transmitter.
The time and frequency resources that can be used by the UE to report CSI are controlled by a base station (e.g., gNB). CSI may include Channel Quality Indicator (CQI), precoding matrix indicator (PMI), CSI-RS resource indicator (CRI), SS/PBCH Block Resource indicator (SSBRI), layer indicator (LI), rank indicator (RI) and/or L1-RSRP. However, as described below, additional or other information may be included in the report.
The base station may configure UEs for CSI reporting. For example, the BS configures the UE with a CSI report configuration or with multiple CSI report configurations. The CSI report configuration may be provided to the UE via higher layer signaling, such as radio resource control (RRC) signaling (e.g., CSI-ReporiConfig). The CSI report configuration may be associated with CSI-RS resources for channel measurement (CM), interference measurement (IM), or both. The CSI report configuration configures CSI-RS resources for measurement (e.g., CSI-ResourceConfig). The CSI-RS resources provide the UE with the configuration of CSI-RS ports, or CSI-RS port groups, mapped to time and frequency resources (e.g., resource elements (REs)). CSI-RS resources can be zero power (ZP) or non-zero power (NZP) resources, At least one NZP CSI-RS resource may be configured for CM.
For the Type II single panel codebook, the PMI is a linear combination of beams; it has a subset of orthogonal beams to be used for linear combination and has per layer, per polarization, amplitude and phase for each beam. For the PMI of any type, there can be wideband (WB) PMI and/or subband (SB) PMI as configured.
The CSI report configuration may configure the UE for aperiodic, periodic, or semi-persistent CSI reporting. For periodic CSI, the UE may be configured with periodic CSI-RS resources. Periodic CSI and semi-persistent CSI report on physical uplink control channel (PUCCH) may be triggered via RRC or a medium access control (MAC) control element (CE). For aperiodic and semi-persistent CSI on the physical uplink shared channel (PUSCH), the BS may signal the UE a CSI report trigger indicating for the UE to send a CSI report for one or more CSI-RS resources, or configuring the CSI-RS report trigger state (e.g., (CSI-AperiodicTriggerStateList and CSI-SemiPersistentOnPUSCH-TriggerStateList). The CSI report trigger for aperiodic CSI and semi-persistent CSI on PUSCH may be provided via downlink control information (DCI). The CSI-RS trigger may be signaling indicating to the UE that CSI-RS will be transmitted for the CSI-RS resource.
The UE may report the CSI feedback based on the CSI report configuration and the CSI report trigger. For example, the UE may measure the channel associated with CSI for the triggered CSI-RS resources. Based on the measurements, the UE may select a preferred CSI-RS resource. The UE reports the CSI feedback for the selected CSI-RS resource. LI may be calculated conditioned on the reported CQI, PMI, RI and CRI; CQI may be calculated conditioned on the reported PMI, RI and CRI; PMI may be calculated conditioned on the reported RI and CRI; and RI may be calculated conditioned on the reported CRI.
Each CSI report configuration may be associated with a single downlink bandwidth part (BWP). The CSI report setting configuration may define a CSI reporting band as a subset of subbands of the BWP. The associated DL BWP may indicated by a higher layer parameter (e.g., bwp-Id) in the CSI report configuration for channel measurement and contains parameter(s) for one CSI reporting band, such as codebook configuration, time-domain behavior, frequency granularity for CSI, measurement restriction configurations, and the CSI-related quantities to be reported by the UE. Each CSI resource setting may be located in the DL BWP identified by the higher layer parameter, and all CSI resource settings may be linked to a CSI report setting have the same DL BWP.
In certain systems, the UE can be configured via higher layer signaling (e.g., in the CSI report configuration) with one out of two possible subband sizes (e.g., reportFreqConfiguration contained in a CSI-ReportConfig) which indicates a frequency granularity of the CSI report, where a subband may be defined as NPRBSB contiguous physical resource blocks (PRBs) and depends on the total number of PRBs in the bandwidth part. The UE may further receive an indication of the subbands for which the CSI feedback is requested. In some examples, a subband mask is configured for the requested subbands for CSI reporting. The UE computes precoders for each requested subband and finds the PMI that matches the computed precoder on each of the subbands.
Compressed CSI Feedback Coeffient Reporting
As discussed above, a user equipment (UE) may be configured for channel state information (CSI) reporting, for example, by receiving a CSI configuration message from the base station. In certain systems (e.g., Release 15 5G NR), the UE may be configured to report at least a Type II precoder across configured frequency domain (FD) units. For example, the precoder matrix Wr for layer r includes the W1 matrix, reporting a subset of selected beams using spatial compression and the W2,r matrix, reporting (for cross-polarization) the linear combination coefficients for the selected beams (2L) across the configured FD units:



 
  
   
    W
    r
   
   =
   
    
     ∑
     
      i
      =
      0
     
     
      
       2
       ⁢
       L
      
      -
      1
     
    
    
     
      b
      i
     
     ·
     
      c
      i
     
    
   
  
  ,
  
   
    where
    ⁢
       
    
     c
     i
    
   
   =
   
    [
    
     
      
       
        
         c
         
          i
          ,
          0
         
        
       
       
        ...
       
       
        
         c
         
          i
          ,
          
           
            N
            3
           
           -
           1
          
         
        
       
      
     
     
      }
      
       N
       3
      
     
    
    ]
   
  
  ,
 



where bi is the selected beam, ci is the set of linear combination coefficients (i.e., entries of W2,r matrix), L is the number of selected spatial beams, and N3 corresponds to the number of frequency units (e.g., subbands, resource blocks (RBs), etc.). In certain configurations, L is RRC configured. The precoder is based on a linear combination of DFT beams. The Type II codebook may improve MU-MIMO performance, in some configurations considering there are two polarizations, the W2,r matrix has size 2L×N3.

In certain systems (e.g., Rel-16 5G NR), the UE may be configured to report FD compressed precoder feedback to reduce overhead of the CSI report. As shown in FIG. 5, the precoder matrix (W2,i) for layer i with i=0,1 may use an FD compression Wf,iH matrix to compress the precoder matrix into {tilde over (W)}2,i matrix size to 2L×M (where M is network configured and communicated in the CSI configuration message via RRC or DCI, and M<N3) given as:

Wi=W1{tilde over (W)}2,iWf,iH 

Where the precoder matrix Wi (not shown) has P=2N1N2 rows (spatial domain, number of ports) and N3 columns (frequency-domain compression unit containing RBs or reporting sub-bands), and where M bases are selected for each of layer 0 and layer 1 independently. The {tilde over (W)}2,0 matrix 520 consists of the linear combination coefficients (amplitude and co-phasing), where each element represents the coefficient of a tap for a beam. The {tilde over (W)}2,0 matrix 520 as shown is defined by size 2L×M, where one row corresponds to one spatial beam in W1 (not shown) of size P×2L (where L is network configured via RRC), and one entry therein represents the coefficient of one tap for this spatial beam. The UE may be configured to report (e.g., CSI report) a subset K0<2LM of the linear combination coefficients of the {tilde over (W)}2,0 matrix 520. For example, the UE may report KNZ,i<K0 coefficients (where KNZ,i corresponds to a maximum number of non-zero coefficients for layer-i with i=0 or 1, and K0 is network configured via RRC) illustrated as shaded squares (unreported coefficients are set to zero). In some configurations, an entry in the {tilde over (W)}2,0 matrix 520 corresponds to a row of Wf,0H matrix 530. In the example shown, both the {tilde over (W)}2,0 matrix 520 at layer 0 and the {tilde over (W)}2,0 matrix 550 at layer 1 are 2L×M.

The Wf,0H matrix 530 is composed of the basis vectors (each row is a basis vector) used to perform compression in frequency domain. In the example shown, both the Wf,0H matrix 530 at layer 0 and the Wf,1H matrix 560 at layer 1 include M=4 FD basis (illustrated as shaded rows) from N3 candidate DFT basis. In some configurations, the UE may report a subset of selected basis of the Wf,iH matrix via CSI report. The M bases specifically selected at layer 0 and layer 1. That is, the M bases selected at layer 0 can be same/partially-overlapped/non-overlapped with the M bases selected at layer 1.
Example Codebook without Frequency Domain Compression
Codebook operation without FD compression (e.g., Rel-15 codebook operation may be as follows. For a layer l, its precoder across N3 FD units (also referred to as PMI subbands) may be given by a size-Nt×N3 matrix Wl as follows:

Wl=W1×W2,l,

Where W1 and W2,l are as described in the following table:














Notation
size
description
Comment







W1
Nt × 2L
SD basis; same SD bases are
Layer-common




applied to both polarizations



W2,l
2L × N3
Coefficient matrix:
Layer-specific;





Note:


L value is rank-common and layer-common






These two matrices can be written as




 
  
   W
   1
  
  =
  
   [
   
    
     
      
       
        v
        
         
          m
          1
          
           (
           0
           )
          
         
         ,
         
          m
          2
          
           (
           0
           )
          
         
        
       
       ,
       
        v
        
         
          m
          1
          
           (
           1
           )
          
         
         ,
         
          m
          2
          
           (
           1
           )
          
         
        
       
       ,
       ...
          
       ,
       
        v
        
         
          m
          1
          
           (
           
            L
            -
            1
           
           )
          
         
         ,
         
          m
          2
          
           (
           
            L
            -
            1
           
           )
          
         
        
       
      
     
     
      0
     
    
    
     
      0
     
     
      
       
        v
        
         
          m
          1
          
           (
           0
           )
          
         
         ,
         
          m
          2
          
           (
           0
           )
          
         
        
       
       ,
       
        v
        
         
          m
          1
          
           (
           1
           )
          
         
         ,
         
          m
          2
          
           (
           1
           )
          
         
        
       
       ,
       ...
          
       ,
       
        v
        
         
          m
          1
          
           (
           
            L
            -
            1
           
           )
          
         
         ,
         
          m
          2
          
           (
           
            L
            -
            1
           
           )
          
         
        
       
      
     
    
   
   ]
  
 



Where the SD bases are DFT based and the SD basis with index m1(i) and m2(i) is written as




 
  
   
    v
    
     
      m
      1
      
       (
       i
       )
      
     
     ,
     
      m
      2
      
       (
       i
       )
      
     
    
   
   =
   
    
     [
     
      
       
        
         u
         
          m
          2
          
           (
           i
           )
          
         
        
       
       
        
         
          e
          
           
            j
            ⁢
            2
            ⁢
            π
            ⁢
            
             m
             1
             
              (
              i
              )
             
            
           
           
            
             O
             1
            
            ⁢
            
             N
             1
            
           
          
         
         ⁢
         
          u
          
           m
           2
           
            (
            i
            )
           
          
         
        
       
       
        ...
       
       
        
         
          e
          
           
            j
            ⁢
            2
            ⁢
            π
            ⁢
            
             
              m
              1
              
               (
               i
               )
              
             
             (
             
              
               N
               1
              
              -
              1
             
             )
            
           
           
            
             O
             1
            
            ⁢
            
             N
             1
            
           
          
         
         ⁢
         
          u
          
           m
           2
           
            (
            i
            )
           
          
         
        
       
      
     
     ]
    
    T
   
  
  ,
  

  
   
    u
    
     m
     2
     
      (
      i
      )
     
    
   
   =
   
    [
    
     
      
       1
      
      
       
        e
        
         
          j
          ⁢
          2
          ⁢
          π
          ⁢
          
           m
           2
           
            (
            i
            )
           
          
         
         
          
           O
           2
          
          ⁢
          
           N
           2
          
         
        
       
      
      
       ...
      
      
       
        e
        
         
          j
          ⁢
          2
          ⁢
          π
          ⁢
          
           
            m
            2
            
             (
             i
             )
            
           
           (
           
            
             N
             2
            
            -
            1
           
           )
          
         
         
          
           O
           2
          
          ⁢
          
           N
           2
          
         
        
       
      
     
    
    ]
   
  
 



The coefficient matrix may be written as




 
  
   W
   
    2
    ,
    l
   
  
  =
  
   [
   
    
     
      
       
        p
        
         0
         ,
         l
         ,
         0
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         0
         ,
         l
         ,
         0
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           0
           ,
           l
           ,
           0
          
         
        
       
      
     
     
      
       
        p
        
         0
         ,
         l
         ,
         1
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         0
         ,
         l
         ,
         1
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           0
           ,
           l
           ,
           1
          
         
        
       
      
     
     
      ...
     
     
      
       
        p
        
         0
         ,
         l
         ,
         
          M
          -
          1
         
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         0
         ,
         l
         ,
         
          M
          -
          1
         
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           0
           ,
           l
           ,
           
            M
            -
            1
           
          
         
        
       
      
     
    
    
     
      
       
        p
        
         1
         ,
         l
         ,
         0
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         1
         ,
         l
         ,
         0
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           1
           ,
           l
           ,
           0
          
         
        
       
      
     
     
      
       
        p
        
         1
         ,
         l
         ,
         1
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         1
         ,
         l
         ,
         1
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           0
           ,
           l
           ,
           1
          
         
        
       
      
     
     
      ...
     
     
      
       
        p
        
         1
         ,
         l
         ,
         
          M
          -
          1
         
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         1
         ,
         l
         ,
         
          M
          -
          1
         
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           1
           ,
           l
           ,
           
            M
            -
            1
           
          
         
        
       
      
     
    
    
     
      ⋮
     
     
      ⋮
     
     
      ⋱
     
     
      ⋮
     
    
    
     
      
       
        p
        
         
          L
          -
          1
         
         ,
         l
         ,
         0
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         
          L
          -
          1
         
         ,
         l
         ,
         0
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           
            L
            -
            1
           
           ,
           l
           ,
           0
          
         
        
       
      
     
     
      
       
        p
        
         
          L
          -
          1
         
         ,
         l
         ,
         1
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         
          L
          -
          1
         
         ,
         l
         ,
         1
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           
            L
            -
            1
           
           ,
           l
           ,
           1
          
         
        
       
      
     
     
      ...
     
     
      
       
        p
        
         
          L
          -
          1
         
         ,
         l
         ,
         
          M
          -
          1
         
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         
          L
          -
          1
         
         ,
         l
         ,
         
          M
          -
          1
         
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           
            L
            -
            1
           
           ,
           l
           ,
           
            M
            -
            1
           
          
         
        
       
      
     
    
    
     
      
       
        p
        
         L
         ,
         l
         ,
         0
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         L
         ,
         l
         ,
         0
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           L
           ,
           l
           ,
           0
          
         
        
       
      
     
     
      
       
        p
        
         L
         ,
         l
         ,
         1
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         L
         ,
         l
         ,
         1
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           L
           ,
           l
           ,
           1
          
         
        
       
      
     
     
      ...
     
     
      
       
        p
        
         L
         ,
         l
         ,
         
          M
          -
          1
         
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         L
         ,
         l
         ,
         
          M
          -
          1
         
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           L
           ,
           l
           ,
           
            M
            -
            1
           
          
         
        
       
      
     
    
    
     
      
       
        p
        
         
          L
          +
          1
         
         ,
         l
         ,
         0
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         
          L
          +
          1
         
         ,
         l
         ,
         0
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           
            L
            +
            1
           
           ,
           l
           ,
           0
          
         
        
       
      
     
     
      
       
        p
        
         
          L
          +
          1
         
         ,
         l
         ,
         1
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         
          L
          +
          1
         
         ,
         l
         ,
         1
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           
            L
            +
            1
           
           ,
           l
           ,
           1
          
         
        
       
      
     
     
      ...
     
     
      
       
        p
        
         
          L
          +
          1
         
         ,
         l
         ,
         
          M
          -
          1
         
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         
          L
          +
          1
         
         ,
         l
         ,
         
          M
          -
          1
         
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           
            L
            +
            1
           
           ,
           l
           ,
           
            M
            -
            1
           
          
         
        
       
      
     
    
    
     
      ⋮
     
     
      ⋮
     
     
      ⋱
     
     
      ⋮
     
    
    
     
      
       
        p
        
         
          
           2
           ⁢
           L
          
          -
          1
         
         ,
         l
         ,
         0
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         
          
           2
           ⁢
           L
          
          -
          1
         
         ,
         l
         ,
         0
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           
            
             2
             ⁢
             L
            
            -
            1
           
           ,
           l
           ,
           0
          
         
        
       
      
     
     
      
       
        p
        
         
          
           2
           ⁢
           L
          
          -
          1
         
         ,
         l
         ,
         1
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         
          
           2
           ⁢
           L
          
          -
          1
         
         ,
         l
         ,
         1
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           
            
             2
             ⁢
             L
            
            -
            1
           
           ,
           l
           ,
           1
          
         
        
       
      
     
     
      ...
     
     
      
       
        p
        
         
          
           2
           ⁢
           L
          
          -
          1
         
         ,
         l
         ,
         
          M
          -
          1
         
        
        
         (
         1
         )
        
       
       ⁢
       
        p
        
         
          
           2
           ⁢
           L
          
          -
          1
         
         ,
         l
         ,
         
          M
          -
          1
         
        
        
         (
         2
         )
        
       
       ⁢
       
        e
        
         j
         ⁢
         
          φ
          
           
            
             2
             ⁢
             L
            
            -
            1
           
           ,
           l
           ,
           
            M
            -
            1
           
          
         
        
       
      
     
    
   
   ]
  
 



In some cases, a common (P1) value may apply to all pi,m,l(1) coefficients (or simply P1 coefficients) in one row. In such cases, given 2L rows in the matrix, the P1 value is row-specific and there might be 2L different values for these coefficients.

The coefficients pi,m,l(1), pi,m,l(2) and φi,m,l are described as follows:












Notation
description
Alphabet







pi,m,l(1)
Reference amplitude
{1, {square root over (1/2)}, {square root over (1/4)}, {square root over (1/8)}, {square root over (1/16)}, {square root over (1/32)}, {square root over (1/64)}, 0}



for beam i of the 1st




polarization. pi,m,l(1) =




pi′,m′,l(1), ∀i′ ≠ i, m′ ≠




m



pi+L,m,l(1)
Reference amplitude
{1, {square root over (1/2)}, {square root over (1/4)}, {square root over (1/8)}, {square root over (1/16)}, {square root over (1/32)}, {square root over (1/64)}, 0}



for the 2nd




polarization.




pi+L,m,l(1) = pi′+L,m′,l(1),




∀i′ ≠ i, m′ ≠ m



pi,m,l(2) and
Differential
{1, {square root over (0.5)}}


pi+L,m,l(2)
amplitude for each




individual coefficient



φi,m,l and
Phase of each
N-PSK, N = 4 or 8


φi+L,m,l
individual coefficient









More precisely, the linear combination representation may be written as:




 
  
   W
   l
  
  =
  
   (
   
    
     
      
       
        ∑
        
         i
         =
         0
        
        
         L
         -
         1
        
       
       
        
         v
         
          
           m
           1
           
            (
            i
            )
           
          
          ,
          
           m
           2
           
            (
            i
            )
           
          
         
        
        ⁢
        
         p
         
          i
          ,
          m
          ,
          l
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          i
          ,
          m
          ,
          l
         
         
          (
          2
          )
         
        
        ⁢
        
         φ
         
          i
          ,
          m
          ,
          l
         
        
       
      
     
    
    
     
      
       
        ∑
        
         i
         =
         0
        
        
         L
         -
         1
        
       
       
        
         v
         
          
           m
           1
           
            (
            i
            )
           
          
          ,
          
           m
           2
           
            (
            i
            )
           
          
         
        
        ⁢
        
         p
         
          i
          ,
          m
          ,
          l
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          i
          ,
          m
          ,
          l
         
         
          (
          2
          )
         
        
        ⁢
        
         φ
         
          i
          ,
          m
          ,
          l
         
        
       
      
     
    
   
   )
  
 



Frequency Domain Compression for High Rank Indication
FIG. 6 illustrates three alternative examples for determining the FD basis for a particular RI. Each example is illustrated as a table having a left column indicative of an RI (e.g., RI={1, 2, 3, 4}), and a bottom row indicative of a transmission layer (e.g., layer 0, layer 1, layer 2, layer 3). That is, the number of layers indicate a transmission rank, where RI=1 is limited to a single spatial layer, RI=2 corresponds to two spatial layers, RI=3 corresponds to three spatial layers, and RI=4 corresponds to four spatial layers. Accordingly, type II CSI may relate to UEs having up to four spatial layers.
In some configurations using FD compression, regardless of the rank, up to K0 non-zero coefficients (NZCs) are reported each layer, and the total number of NZCs across all lavers is constrained at 2K0. That is, for rank-1 and rank-2, only the per-layer constraint needs to be considered, as the total NZCs constraint across layers become redundant (since the total NZCs of the two layers, constrained at K0 each, cannot exceed 2K0). For rank-3 and rank-4, on the other hand, both the per-layer constraint and the total constraint would be considered.
Similarly, the FD basis (Mi) for RI={3,4} is comparable to RI=2. In one example, each layer (layer 0 and layer 1) of RI=2 uses II number of FD basis, making the FD basis across all four layers of RI=4 comparable to 2M. That is, Mi for a given RI can be described as:



 
  
   
    ∑
    
     i
     =
     0
    
    
     RI
     -
     1
    
   
   
    M
    i
   
  
  ≈
  
   2
   ⁢
   M
  
 



In the example shown in FIG. 5, the Wf,0H matrix 530 includes FD basis M=4 (M0=4), and the Wf,1H matrix 560 includes FD basis M=4 (M1=4), making a total of 8 HD bases for RI=2. Thus, for RI={3,4} the total number of FD bases across all four layers should be comparable to M0+M1 or 2M (e.g., between 6 and 10 FD basis for RI={3, 4}).

As shown in FIG. 6, table 610 illustrates an example for making the total number of FD basis for RI={3, 4} comparable to M=2. In this example, the FD basis for each of layers 0-3 is M2 for RI={3, 4}. In some cases, M2 may be set in a standard specification equal to M/2 or 2/3*M. The M value may be determined, for example, by the following equation:

M=ceil(p*N3),

while M2 may be determined by the following equation:

M2=ceil(v0*N3),

where p and v0 are jointly configured, for example from:

(p,v0)=(1/2,1/4), (1/4,1/4) and (1/4,1/8).

In aspects of the techniques described herein, a UE may be configured for CSI reporting, for example, by receiving a CSI configuration message from a base station. In certain systems, the UE may be configured to report at least a Type II precoder across configured frequency domain (FD) units. For example, a precoder for a certain layer l on N3 subbands may be expressed as a size-P×N3 matrix Wl:



 
  
   
    W
    l
   
   =
   
    [
    
     
      
       
        
         ∑
         
          i
          =
          0
         
         
          L
          -
          1
         
        
        
         
          ∑
          
           m
           =
           0
          
          
           
            M
            l
           
           -
           1
          
         
         
          
           v
           
            
             m
             1
             
              (
              i
              )
             
            
            ,
            
             m
             2
             
              (
              i
              )
             
            
           
          
          ⁢
          
           p
           
            i
            ,
            m
           
           
            (
            1
            )
           
          
          ⁢
          
           p
           
            i
            ,
            m
           
           
            (
            2
            )
           
          
          ⁢
          
           
            φ
            
             i
             ,
             m
            
           
           ·
           
            f
            
             m
             3
             
              (
              m
              )
             
            
            H
           
          
         
        
       
      
     
     
      
       
        
         ∑
         
          i
          =
          0
         
         
          L
          -
          1
         
        
        
         
          ∑
          
           m
           =
           0
          
          
           
            M
            l
           
           -
           1
          
         
         
          
           v
           
            
             m
             1
             
              (
              i
              )
             
            
            ,
            
             m
             2
             
              (
              i
              )
             
            
           
          
          ⁢
          
           p
           
            
             i
             +
             L
            
            ,
            m
           
           
            (
            1
            )
           
          
          ⁢
          
           p
           
            
             i
             +
             L
            
            ,
            m
           
           
            (
            2
            )
           
          
          ⁢
          
           
            φ
            
             
              i
              +
              L
             
             ,
             m
            
           
           ·
           
            f
            
             m
             3
             
              (
              m
              )
             
            
            H
           
          
         
        
       
      
     
    
    ]
   
  
  ,
 



In this equation, L is the number of spatial domain (SD) basis (or bases) (e.g., spatial beams) configured by RRC signaling of the CSI report configuration, vm1(i),m2(i) with i=0,1, . . . , L−1 is a



 
  
   P
   2
  
  ×
  1
  ⁢
     
  SD
 



basis and it is applied to both polarizations. The SD bases are DFT based and the SD basis with index m1(i) and m2(i) may be written as:




 
  
   
    v
    
     
      m
      1
      
       (
       i
       )
      
     
     ,
     
      m
      2
      
       (
       i
       )
      
     
    
   
   =
   
    
     [
     
      
       
        
         u
         
          m
          2
          
           (
           i
           )
          
         
        
       
       
        
         
          e
          
           
            j
            ⁢
            2
            ⁢
            π
            ⁢
            
             m
             1
             
              (
              i
              )
             
            
           
           
            
             O
             1
            
            ⁢
            
             N
             1
            
           
          
         
         ⁢
         
          u
          
           m
           2
           
            (
            i
            )
           
          
         
        
       
       
        ...
       
       
        
         
          e
          
           
            j
            ⁢
            2
            ⁢
            π
            ⁢
            
             
              m
              1
              
               (
               i
               )
              
             
             (
             
              
               N
               1
              
              -
              1
             
             )
            
           
           
            
             O
             1
            
            ⁢
            
             N
             1
            
           
          
         
         ⁢
         
          u
          
           m
           2
           
            (
            i
            )
           
          
         
        
       
      
     
     ]
    
    T
   
  
  ,
  

  
   
    u
    
     m
     2
     
      (
      i
      )
     
    
   
   =
   
    
     [
     
      
       
        1
       
       
        
         e
         
          
           j
           ⁢
           2
           ⁢
           π
           ⁢
           
            m
            2
            
             (
             i
             )
            
           
          
          
           
            O
            2
           
           ⁢
           
            N
            2
           
          
         
        
       
       
        ...
       
       
        
         e
         
          
           j
           ⁢
           2
           ⁢
           π
           ⁢
           
            
             m
             2
             
              (
              i
              )
             
            
            (
            
             
              N
              2
             
             -
             1
            
            )
           
          
          
           
            O
            2
           
           ⁢
           
            N
            2
           
          
         
        
       
      
     
     ]
    
    .
   
  
 



In this equation, N1 and N2 represents the first and the second dimension of the configured codebook, respectively. In some cases, these parameters may refer to the number of antenna elements on the vertical and horizontal dimension at the base station, respectively. The oversampling factors are denoted by O1 and O2.

Moreover, fm3(m) with m=0,1, . . . Ml is a N3×1 FD basis (i.e.,



 
  f
  
   m
   3
   
    (
    m
    )
   
  
  H
 



is a 1×N3 row vector) which may also be known as the transferred domain basis. Ml is the number of FD bases selected for layer l and it is derived based on RRC configuration. In some cases, for each layer of rank-1 and rank-2, there are M bases anu value of




 
  M
  =
  
   ⌈
   
    p
    ×
    
     
      N
      3
     
     R
    
   
   ⌉
  
 



is determined by a ratio p configured by RRC and R is the number of precoding matrix indicator (PMI) subbands within one CQI subband. The FD bases may be DFT bases, and the FD basis with index m3(m)∈{0,1, . . . N3−1} is expressed as:




 
  
   f
   
    m
    3
    
     (
     m
     )
    
   
  
  =
  
   
    [
    
     
      
       1
      
      
       
        e
        
         
          j
          ⁢
          2
          ⁢
          π
          ⁢
          
           m
           3
           
            (
            m
            )
           
          
         
         
          N
          3
         
        
       
      
      
       ...
      
      
       
        e
        
         
          j
          ⁢
          2
          ⁢
          π
          ⁢
          
           
            m
            3
            
             (
             m
             )
            
           
           (
           
            
             N
             3
            
            -
            1
           
           )
          
         
         
          N
          3
         
        
       
      
     
    
    ]
   
   .
  
 



As noted above, linear combination coefficient may include three parts: pi,l,m(1), pi,l,m(2) and φi,l,m. The parameter pi,l,m(1) represents an amplitude reference for the first polarization, while pi+L,l,m(1) represents the amplitude reference for the second polarization. These values are common to all the coefficients associated with the corresponding polarization (e.g., pi,l,m(1)×pi′,l,m′(1), and pi+L,l,m(1)=pi′+L,l,m′(1)∀i′∈{i′≠i|i′=0,1, . . . L−1}, ∀m′∈{m′≠m|m′=0,1, . . . M}). The parameter pi,l,m(2) represents a (differential) amplitude the coefficient associated with SD basis with index m1(i) and m2(i), and associated with the FD basis with index m3(m) in the first polarization, while pi+L,m(2) represents a (differential) amplitude the coefficient associated with SD basis with index m1(i) and m2(i) and associated with the FD basis with index m3(m) in the second polarization. Similarly, the parameter φi,m represents a (differential) amplitude the coefficient associated with SD basis with index m1(i) and m2(i), and associated with the FD basis with index m3(m) in the first polarization, while φi+L,m represents a (differential) amplitude the coefficient associated with SD basis with index m1(i) and m2(i), and associated with the FD basis with index m3(m) in the second polarization.
For RI={1,2}, for each layer, the number of FD bases M=M1,2, wherein the value of



 
  
   M
   
    1
    ,
    2
   
  
  =
  
   ⌈
   
    p
    ×
    
     
      N
      3
     
     R
    
   
   ⌉
  
 



is determined by a ratio p configured by RRC and R is the number of precoding matrix indicator (PMI) subbands within one CQI subband. For RI={3,4}, the number of FD bases M=M3,4, wherein the value or




 
  
   M
   
    3
    ,
    4
   
  
  =
  
   ⌈
   
    
     v
     0
    
    ×
    
     
      N
      3
     
     R
    
   
   ⌉
  
 



is determined by a ratio v0 configured by RRC. Possible combinations of p and v0 include




 
  
   
    (
    
     p
     ,
     
      v
      0
     
    
    )
   
   =
   
    (
    
     
      1
      2
     
     ,
     
      1
      4
     
    
    )
   
  
  ,
  
   (
   
    
     1
     4
    
    ,
    
     1
     4
    
   
   )
  
  ,
  
   
    (
    
     
      1
      4
     
     ,
     
      1
      8
     
    
    )
   
   .
  
 



Moreover, for each layer of RI={1,2,3,4}, the UE is configured to report a subset of total 2LM1,2 or total 2LM3,4 coefficients, the unreported coefficients are set to zero. The max number of coefficients to be reported per layer is K0 and the max total number of coefficients to be reported across all layers is 2K0, where K0=┌β×2LM1,2┐ and




 
  β
  =
  
   {
   
    
     1
     4
    
    ,
    
     1
     2
    
    ,
    
     3
     4
    
   
   }
  
 



is RRC configured. It may be noted that, regardless of rank, K0 is calculated using the M1,2.

With codebook operation with FD compression, for a layer l, its precoder across N3 FD units (a.k.a. PMI subbands) is given by a size-Nt×N3 matrix Wl as follows:

Wl=W1×{tilde over (W)}2,l×Wf,lH,

Where W1, {tilde over (W)}2 and Wf are as follows:














Notation
Size
Description
Comment







W1
Nt × 2L
SD basis; same SD bases are
Layer-




applied to both polarizations
common


{tilde over (W)}2,l
2L × M
Coefficient matrix:
Layer-




Consist of max K0 NZC per-layer;
specific;




Consist of max 2K0 NZC across all





layers



Wf,l
M × N3
FD basis; same M FD bases are
Layer-




applied to both polarizations
specific;





Note: L value is rank-common and layer-commonM value is rank-group specific and layer-common. M = M1,2 for RI ={1,2} and M = M3,4 ≤ M1,2 for RI ={3,4}






These three matrices, illustrated graphically in FIG. 7 (it should be noted that while FIG. 7 only show two layers, it can be actually 3 or 4 layers with same structure, with the only difference being in the number of FD bases and number of non-zero coefficients or NZCs), can be written as:



 
  
   
    W
    1
   
   =
   
    [
    
     
      
       
        
         v
         
          
           m
           1
           
            (
            0
            )
           
          
          ,
          
           m
           2
           
            (
            0
            )
           
          
         
        
        ,
        
         v
         
          
           m
           1
           
            (
            1
            )
           
          
          ,
          
           m
           2
           
            (
            1
            )
           
          
         
        
        ,
        ...
           
        ,
        
         v
         
          
           m
           1
           
            (
            
             L
             -
             1
            
            )
           
          
          ,
          
           m
           2
           
            (
            
             L
             -
             1
            
            )
           
          
         
        
       
      
      
             
     
     
      
             
      
       
        
         v
         
          
           m
           1
           
            (
            0
            )
           
          
          ,
          
           m
           2
           
            (
            0
            )
           
          
         
        
        ,
        
         v
         
          
           m
           1
           
            (
            1
            )
           
          
          ,
          
           m
           2
           
            (
            1
            )
           
          
         
        
        ,
        ...
           
        ,
        
         v
         
          
           m
           1
           
            (
            
             L
             -
             1
            
            )
           
          
          ,
          
           m
           2
           
            (
            
             L
             -
             1
            
            )
           
          
         
        
       
      
     
    
    ]
   
  
  ⁢
  

  
   
    W
    
     f
     ,
     l
    
    H
   
   =
   
    [
    
     
      
       
        f
        
         m
         
          3
          ,
          l
         
         
          (
          0
          )
         
        
        H
       
      
     
     
      
       
        f
        
         m
         
          3
          ,
          l
         
         
          (
          1
          )
         
        
        H
       
      
     
     
      
       ⋮
      
     
     
      
       
        f
        
         m
         
          3
          ,
          l
         
         
          (
          
           M
           -
           1
          
          )
         
        
        H
       
      
     
    
    ]
   
  
  ⁢
  

  
   
    
     W
     ~
    
    
     2
     ,
     l
    
   
   =
   
    [
    
     
      
       
        
         p
         
          0
          ,
          l
          ,
          0
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          0
          ,
          l
          ,
          0
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            0
            ,
            l
            ,
            0
           
          
         
        
       
      
      
       
        
         p
         
          0
          ,
          l
          ,
          1
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          0
          ,
          l
          ,
          1
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            0
            ,
            l
            ,
            1
           
          
         
        
       
      
      
       ...
      
      
       
        
         p
         
          0
          ,
          l
          ,
          
           M
           -
           1
          
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          0
          ,
          l
          ,
          
           M
           -
           1
          
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            0
            ,
            l
            ,
            
             M
             -
             1
            
           
          
         
        
       
      
     
     
      
       
        
         p
         
          1
          ,
          l
          ,
          0
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          1
          ,
          l
          ,
          0
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            1
            ,
            l
            ,
            0
           
          
         
        
       
      
      
       
        
         p
         
          1
          ,
          l
          ,
          1
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          1
          ,
          l
          ,
          1
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            0
            ,
            l
            ,
            1
           
          
         
        
       
      
      
       ...
      
      
       
        
         p
         
          1
          ,
          l
          ,
          
           M
           -
           1
          
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          1
          ,
          l
          ,
          
           M
           -
           1
          
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            1
            ,
            l
            ,
            
             M
             -
             1
            
           
          
         
        
       
      
     
     
      
       ⋮
      
      
       ⋮
      
      
       ⋱
      
      
       ⋮
      
     
     
      
       
        
         p
         
          
           L
           -
           1
          
          ,
          l
          ,
          0
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          
           L
           -
           1
          
          ,
          l
          ,
          0
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            
             L
             -
             1
            
            ,
            l
            ,
            0
           
          
         
        
       
      
      
       
        
         p
         
          
           L
           -
           1
          
          ,
          l
          ,
          1
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          
           L
           -
           1
          
          ,
          l
          ,
          1
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            
             L
             -
             1
            
            ,
            l
            ,
            1
           
          
         
        
       
      
      
       ...
      
      
       
        
         p
         
          
           L
           -
           1
          
          ,
          l
          ,
          
           M
           -
           1
          
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          
           L
           -
           1
          
          ,
          l
          ,
          
           M
           -
           1
          
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            
             L
             -
             1
            
            ,
            l
            ,
            
             M
             -
             1
            
           
          
         
        
       
      
     
     
      
       
        
         p
         
          L
          ,
          l
          ,
          0
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          L
          ,
          l
          ,
          0
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            L
            ,
            l
            ,
            0
           
          
         
        
       
      
      
       
        
         p
         
          L
          ,
          l
          ,
          1
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          L
          ,
          l
          ,
          1
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            L
            ,
            l
            ,
            1
           
          
         
        
       
      
      
       ...
      
      
       
        
         p
         
          L
          ,
          l
          ,
          
           M
           -
           1
          
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          L
          ,
          l
          ,
          
           M
           -
           1
          
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            L
            ,
            l
            ,
            
             M
             -
             1
            
           
          
         
        
       
      
     
     
      
       
        
         p
         
          
           L
           +
           1
          
          ,
          l
          ,
          0
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          
           L
           +
           1
          
          ,
          l
          ,
          0
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            
             L
             +
             1
            
            ,
            l
            ,
            0
           
          
         
        
       
      
      
       
        
         p
         
          
           L
           +
           1
          
          ,
          l
          ,
          1
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          
           L
           +
           1
          
          ,
          l
          ,
          1
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            
             L
             +
             1
            
            ,
            l
            ,
            1
           
          
         
        
       
      
      
       ...
      
      
       
        
         p
         
          
           L
           +
           1
          
          ,
          l
          ,
          
           M
           -
           1
          
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          
           L
           +
           1
          
          ,
          l
          ,
          
           M
           -
           1
          
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            
             L
             +
             1
            
            ,
            l
            ,
            
             M
             -
             1
            
           
          
         
        
       
      
     
     
      
       ⋮
      
      
       ⋮
      
      
       ⋱
      
      
       ⋮
      
     
     
      
       
        
         p
         
          
           
            2
            ⁢
            L
           
           -
           1
          
          ,
          l
          ,
          0
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          
           
            2
            ⁢
            L
           
           -
           1
          
          ,
          l
          ,
          0
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            
             
              2
              ⁢
              L
             
             -
             1
            
            ,
            l
            ,
            0
           
          
         
        
       
      
      
       
        
         p
         
          
           
            2
            ⁢
            L
           
           -
           1
          
          ,
          l
          ,
          1
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          
           
            2
            ⁢
            L
           
           -
           1
          
          ,
          l
          ,
          1
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            
             
              2
              ⁢
              L
             
             -
             1
            
            ,
            l
            ,
            1
           
          
         
        
       
      
      
       ...
      
      
       
        
         p
         
          
           
            2
            ⁢
            L
           
           -
           1
          
          ,
          l
          ,
          
           M
           -
           1
          
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          
           
            2
            ⁢
            L
           
           -
           1
          
          ,
          l
          ,
          
           M
           -
           1
          
         
         
          (
          2
          )
         
        
        ⁢
        
         e
         
          j
          ⁢
          
           φ
           
            
             
              2
              ⁢
              L
             
             -
             1
            
            ,
            l
            ,
            
             M
             -
             1
            
           
          
         
        
       
      
     
    
    ]
   
  
 



Where the SD bases are DFT based and the SD basis with index m1(i) and m2(i) is written as




 
  
   
    v
    
     
      m
      1
      
       (
       i
       )
      
     
     ,
     
      m
      2
      
       (
       i
       )
      
     
    
   
   =
   
    
     [
     
      
       
        
         u
         
          m
          2
          
           (
           i
           )
          
         
        
       
       
        
         
          e
          
           
            j
            ⁢
            2
            ⁢
            π
            ⁢
            
             m
             1
             
              (
              i
              )
             
            
           
           
            
             O
             1
            
            ⁢
            
             N
             1
            
           
          
         
         ⁢
         
          u
          
           m
           2
           
            (
            i
            )
           
          
         
        
       
       
        ...
       
       
        
         
          e
          
           
            j
            ⁢
            2
            ⁢
            π
            ⁢
            
             
              m
              1
              
               (
               i
               )
              
             
             (
             
              
               N
               1
              
              -
              1
             
             )
            
           
           
            
             O
             1
            
            ⁢
            
             N
             1
            
           
          
         
         ⁢
         
          u
          
           m
           2
           
            (
            i
            )
           
          
         
        
       
      
     
     ]
    
    T
   
  
  ,
  

  
   
    u
    
     m
     2
     
      (
      i
      )
     
    
   
   =
   
    [
    
     
      
       1
      
      
       
        e
        
         
          j
          ⁢
          2
          ⁢
          π
          ⁢
          
           m
           2
           
            (
            i
            )
           
          
         
         
          
           O
           2
          
          ⁢
          
           N
           2
          
         
        
       
      
      
       ...
      
      
       
        e
        
         
          j
          ⁢
          2
          ⁢
          π
          ⁢
          
           
            m
            2
            
             (
             i
             )
            
           
           (
           
            
             N
             2
            
            -
            1
           
           )
          
         
         
          
           O
           2
          
          ⁢
          
           N
           2
          
         
        
       
      
     
    
    ]
   
  
 



The FD bases may be DFT bases, and the FD basis with index m3(i)∈{0,1, . . . N3−1} is expressed as:




 
  
   f
   
    m
    
     3
     ,
     l
    
    
     (
     m
     )
    
   
   H
  
  =
  
   
    [
    
     
      
       1
      
      
       
        e
        
         
          j
          ⁢
          2
          ⁢
          π
          ⁢
          
           m
           
            3
            ,
            l
           
           
            (
            i
            )
           
          
         
         
          N
          3
         
        
       
      
      
       ...
      
      
       
        e
        
         
          j
          ⁢
          2
          ⁢
          π
          ⁢
          
           
            m
            
             3
             ,
             l
            
            
             (
             i
             )
            
           
           (
           
            
             N
             3
            
            -
            1
           
           )
          
         
         
          N
          3
         
        
       
      
     
    
    ]
   
   .
  
 



The coefficients pi,m,l(1), pi,m,l(2) and φi,m,l may be described as follows:













Notation
description
Alphabet







pi,m,l(1)
Reference amplitude for the 1st polarization. pi,m,l(1) = pi′,m′,l′(1) ∀i′ ≠ i, m′ ≠ m




  
    {
    
      
        
          
            1
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                1
                4
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                1
                2
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                3
                4
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              1
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                5
                4
              
            
            ,
          
        
      
      
        
          
            
              
                (
                
                  1
                  2
                
                )
              
              
                3
                2
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                7
                4
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              2
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                9
                4
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                5
                2
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                11
                4
              
            
            ,
          
        
      
      
        
          
            
              
                (
                
                  1
                  2
                
                )
              
              3
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                13
                4
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                7
                2
              
            
          
        
      
    
    }
  
   






 


pi+L,m,l(1)
Reference amplitude for the 2nd polarization. pi+L,m,l(1) = pi′+L,m′,l(1), ∀i′ ≠ i, m′ ≠ m




  
    {
    
      
        
          
            1
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                1
                4
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                1
                2
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                3
                4
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              1
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                5
                4
              
            
            ,
          
        
      
      
        
          
            
              
                (
                
                  1
                  2
                
                )
              
              
                3
                2
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                7
                4
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              2
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                9
                4
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                5
                2
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                11
                4
              
            
            ,
          
        
      
      
        
          
            
              
                (
                
                  1
                  2
                
                )
              
              3
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                13
                4
              
            
            ,
            
              
                (
                
                  1
                  2
                
                )
              
              
                7
                2
              
            
          
        
      
    
    }
  
   






 


pi,m,l(2) and pi+L,m,l(2) 
Differential amplitude for each individual coefficient




  
    {
    
      
        
          
            1
            ,
            
              
                1
                2
              
            
            ,
            
              
                1
                4
              
            
            ,
            
              
                1
                8
              
            
            ,
            
              
                1
                16
              
            
            ,
          
        
      
      
        
          
            
              
                1
                /
                32
              
            
            ,
            
              
                1
                /
                64
              
            
            ,
            
              
                1
                /
                128
              
            
          
        
      
    
    }
  
   






 


φi,m,l
Phase of each individual
N-PSK, N = 8 or 16


and
coefficient



φi+L,m,l









Given these definitions, more precisely, the linear combination representation may be expressed as:




 
  
   W
   l
  
  =
  
   (
   
    
     
      
       
        ∑
        
         i
         =
         0
        
        
         L
         -
         1
        
       
       
        
         ∑
         
          m
          =
          0
         
         
          M
          -
          1
         
        
        
         
          v
          
           
            m
            1
            
             (
             i
             )
            
           
           ,
           
            m
            2
            
             (
             i
             )
            
           
          
         
         ⁢
         
          p
          
           i
           ,
           m
           ,
           l
          
          
           (
           1
           )
          
         
         ⁢
         
          p
          
           i
           ,
           m
           ,
           l
          
          
           (
           2
           )
          
         
         ⁢
         
          
           φ
           
            i
            ,
            m
            ,
            l
           
          
          ·
          
           f
           
            m
            
             3
             ,
             l
            
            
             (
             m
             )
            
           
           H
          
         
        
       
      
     
    
    
     
      
       
        ∑
        
         i
         =
         0
        
        
         L
         -
         1
        
       
       
        
         ∑
         
          m
          =
          0
         
         
          M
          -
          1
         
        
        
         
          v
          
           
            m
            1
            
             (
             i
             )
            
           
           ,
           
            m
            2
            
             (
             i
             )
            
           
          
         
         ⁢
         
          p
          
           
            i
            +
            L
           
           ,
           m
           ,
           l
          
          
           (
           1
           )
          
         
         ⁢
         
          p
          
           
            i
            +
            L
           
           ,
           m
           ,
           l
          
          
           (
           2
           )
          
         
         ⁢
         
          
           φ
           
            
             i
             +
             2
            
            ,
            m
            ,
            l
           
          
          ·
          
           f
           
            m
            
             3
             ,
             l
            
            
             (
             m
             )
            
           
           H
          
         
        
       
      
     
    
   
   )
  
 



Example CBSR on per-SD Basis Amplitude for Type II Codebook with FD Compression
In some cases, to cope with inter-cell interference, the gNB may restrict the UE in SD basis selection. For instance, some SD basis may cause interference to other cell, or may suffer strong interference from other cell. In such cases, the gNB may request the UE to avoid selecting those SD bases or to only select those SD bases with a limited power. This mechanism is generally referred to as codebook subset restriction (CBSR).
In Rel-15, CBSR was achieved by the following procedure. In a first step, the gNB may configure the UE to apply CBSR to at most 4 group of SD bases. The total N1N1×N2O2 SD bases can be divided into O1O2 groups, wherein each group contains N1N2 SD bases. The SD bases within the same group are orthogonal, while the SD bases in different group are non-orthogonal. The gNB may select and configure up to 4 groups from the total O1O2 groups to the UE via



 
  
   ⌈
   
    
     log
     2
    
    (
    
     
      
       
        
         O
         1
        
        ⁢
        
         O
         2
        
       
      
     
     
      
       4
      
     
    
    )
   
   ⌉
  
  .
 



In the second step, for each SD basis of each group, the gNB may configure a restriction on the pi,m,l(1) values via a 2-bit indication, which actually limits the maximum amplitude (power) of each SD basis. The 2-bit indication of the maximum amplitude/power restriction per SD basis is shown in the following table.













codepoint
Limitation on pi,m,l(1)








00
0



01
{square root over (0.25)}



10
{square root over (0.75)}



11
1









In (Rel-16) linear combination codebook with FD compression, if Rel-15 methodology is reused (e.g., applying a restriction on the pi,m,l(1) values of upto 4 groups of SD bases), this would actually limit the maximum power of a polarization because the pi,m,l(1) values in the Rel-16 codebook is common to all SD bases per polarization.
Limiting the max power of a polarization in this manner is not the correct intention. So, new CBSR is needed in Rel-16 Type II codebook with FD compression.
FIG. 8 is a flow diagram illustrating example operations 800 for wireless communication by a UE utilizing CBSR, in accordance with certain aspects of the present disclosure. The example operations 800 may be performed by a UE. For example, the operations 800 may be performed by a UE 120 (e.g., the UE 120a) in the wireless communication network 100.
Operations 800 begin, at 802, by receiving a channel state information (CSI) request from a base station, triggering a CSI report comprising at least one of a plurality of spatial domain (SD) bases, a plurality of frequency domain (FD) bases, and a plurality of linear combination coefficients.
At 804, the UE receives a configuration which, restricts, for each SD basis, a maximum average amplitude of the linear combination coefficients associated with that SD basis. At 806, the UE sends the CSI report, with the linear combination coefficients generated in accordance with the configuration.
FIG. 9 is a flow diagram illustrating example operations 900 for wireless communication by a network entity (e.g., a base station, such as an eNB or gNB), in accordance with certain aspects of the present disclosure. The example operations 900 may be performed by a base station. For example, the operations 900 may be performed by a BS 110 in the wireless communication network 100.
Operations 900 begin, at 902, by sending a channel state information (CSI) request to a user equipment (UE), triggering a CSI report comprising at least one of a plurality of spatial domain (SD) bases, a plurality of frequency domain (FD)) bases, and a plurality of linear combination coefficients.
At 904, the network entity sends the UE a configuration which, restricts, for each SD basis, a maximum average amplitude of the linear combination coefficients associated with that SD basis. At 906, the network entity receives the CSI report and, at 908, the network entity processes the linear combination coefficients contained in the CST report in accordance with the configuration.
The CBSR techniques proposed herein are illustrated in the call flow diagram 1000 of FIG. 10, which shows an example scenario for CSI reporting between a UE 1002 and a base station 1004, in accordance with certain aspects of the present disclosure.
Initially, the UE 1002 receives a CSI report configuration message 1006 from the BS 1004. As illustrated at 1008, the CSI report configuration message may include information for performing codebook subset restriction (CBSR) on per-SD basis amplitude. At 1009, the BS 1004 sends a CSI request triggering a CSI report. At 1010, the UE generates the CSI report, with linear combination coefficients generated in accordance with the CBSR.
According to one approach for CBSR, for each beam, the configuration puts a restriction on the power relative to the strongest beam/coefficient across the two polarizations. In some cases, the strongest beamlcoeffi cient across the two polarizations may be normalized to 1.
In one example case, the relative power may be the power of each coefficient/power of the strongest beam/coefficient across two polarizations. Restriction on the relative power may be based on a threshold value (pthr,l), as:



 
  
   
    
     p
     
      i
      ,
      m
      ,
      l
     
     
      (
      1
      )
     
    
    ⁢
    
     p
     
      i
      ,
      m
      ,
      l
     
     
      (
      2
      )
     
    
   
   ≤
   
    p
    
     thr
     ,
     l
    
   
  
  ,
  
   ∀
   m
  
  ,
  
   
    l
    ⁢
       
    or
    ⁢
       
    
     
      max
      
       m
       ,
       l
      
     
     
      
       p
       
        i
        ,
        m
        ,
        l
       
       
        (
        1
        )
       
      
      ⁢
      
       p
       
        i
        ,
        m
        ,
        l
       
       
        (
        2
        )
       
      
     
    
   
   ≤
   
    p
    
     thr
     ,
     l
    
   
  
 



In one example case, the relative power may be the average power of all coefficient of the corresponding beam/power of the strongest beam/coefficient across two polarizations. In some cases, restriction on the amplitude/power based on the threshold value pthr,l may be as:



 
  
   
    
     ∑
     
      m
      =
      0
     
     
      M
      -
      1
     
    
    
     
      
       
        ❘
        "\[LeftBracketingBar]"
       
       
        
         p
         
          i
          ,
          m
          ,
          l
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          i
          ,
          m
          ,
          l
         
         
          (
          2
          )
         
        
       
       
        ❘
        "\[RightBracketingBar]"
       
      
      2
     
     /
     M
    
   
  
  ≤
  
   p
   
    thr
    ,
    l
   
  
 



In other cases, restriction on the amplitude/power based on γi+pL may be:



 
  
   
    
     1
     
      
       ∑
       
        f
        =
        0
       
       
        
         M
         v
        
        -
        1
       
      
      
       k
       
        l
        ,
        
         i
         +
         pL
        
        ,
        f
       
       
        (
        3
        )
       
      
     
    
    ⁢
    
     
      ∑
      
       f
       =
       0
      
      
       
        M
        v
       
       -
       1
      
     
     
      
       
        k
        
         l
         ,
         
          i
          +
          pL
         
         ,
         f
        
        
         (
         3
         )
        
       
       (
       
        
         p
         
          l
          ,
          p
         
         
          (
          1
          )
         
        
        ⁢
        
         p
         
          l
          ,
          
           i
           +
           pL
          
          ,
          f
         
         
          (
          2
          )
         
        
       
       )
      
      2
     
    
   
  
  ≤
  
   γ
   
    i
    +
    pL
   
  
 



Where pl,p(1) indicates the reference amplitude for layer l (l=0,1, . . . ,v−1) on polarization p=0,1, pl,i+pL,f(2) indicates the differential amplitude for the coefficient associated with SD basis i (i=0,1, . . . L−1) and FD basis f (f=0,1, . . . ,Mv−1) of layer l (l=0,1, . . . ,v−1) on polarization p=0; kl,i+pL,f(3)=0,1 indicates whether the coefficient associated with SD basis i (i=0,1, . . . L−1) and FD basis f (f=0,1, . . . , mv−1) of layer l (l=0,1, . . . ,v−1) on polarization p=0 is a non-zero coefficient or not. So,




 
  
   ∑
   
    f
    =
    0
   
   
    
     M
     v
    
    -
    1
   
  
  
   
    
     k
     
      l
      ,
      
       i
       +
       pL
      
      ,
      f
     
     
      (
      3
      )
     
    
    (
    
     
      p
      
       l
       ,
       p
      
      
       (
       1
       )
      
     
     ⁢
     
      p
      
       l
       ,
       
        i
        +
        pL
       
       ,
       f
      
      
       (
       2
       )
      
     
    
    )
   
   2
  
    
 



yields the total power associated with a SD basis i on polarization p of layer l, Σf=0Mv−1kl,i+pL,f(3) yields the total number of non-zero coefficients associated with a SD basis i on polarization p of layer l. The left hand side of the equation provides the average amplitude.

According to one approach for CSR, for each beam, restriction on the power relative to the reference power of each polarization. In this case, the reference power may be the power of the strongest beam/coefficient of the corresponding polarization. In this case, the relative power may be the power of each coefficient relative to the reference power and restriction on the amplitude/power coefficients may be as:



 
  
   
    p
    
     i
     ,
     m
     ,
     l
    
    
     (
     2
     )
    
   
   ≤
   
    p
    
     thr
     ,
     l
    
   
  
  ,
  
   ∀
   m
  
  ,
  
   
    l
    ⁢
       
    or
    ⁢
       
    
     
      max
      
       m
       ,
       l
      
     
     
      p
      
       i
       ,
       m
       ,
       l
      
      
       (
       2
       )
      
     
    
   
   ≤
   
    p
    
     thr
     ,
     l
    
   
  
 



In other cases, the relative power may be the average power of all coefficient relative to the reference power. In some cases, the restriction on the relative power may be as:




 
  
   
    
     
      
       
        ∑
        
         m
         =
         0
        
        
         M
         -
         1
        
       
       
        
         
          
           ❘
           "\[LeftBracketingBar]"
          
          
           
            p
            
             i
             ,
             m
             ,
             l
            
            
             (
             1
             )
            
           
           ⁢
           
            p
            
             i
             ,
             m
             ,
             l
            
            
             (
             2
             )
            
           
          
          
           ❘
           "\[RightBracketingBar]"
          
         
         2
        
        /
        M
       
      
     
     ≤
     
      p
      
       thr
       ,
       l
      
     
    
   
   
     
   
  
 



The threshold value may be signaled to the UE by the base station so they are each in synch as far as how the UE is to perform the CBSR and how the base station is to interpret the coefficients received from the UE. The threshold value may be provided, for example, as part of the CSI reporting configuration.

By providing CBSR on per-SD basis maximum average amplitude, aspects of the present disclosure may avoid limiting the maximum power of a polarization for Rel-16 Type II codebook with FD compression.
EXAMPLE EMBODIMENTS
Embodiment 1: A method for wireless communications by a user equipment (UE), comprising: receiving a channel state information (CSI) request from a base station, triggering a CSI report comprising at least one of a plurality of spatial domain (SD) bases, a plurality of frequency domain (FD) bases, and a plurality of linear combination coefficients; receiving a configuration which, restricts, for each SD basis, a maximum average amplitude of the linear combination coefficients associated with that SD basis; and sending the CSI report, with the linear combination coefficients generated in accordance with the configuration.
Embodiment 2: The method of Embodiment 1, wherein: each linear combination coefficient is associated with a specific SD basis and a specific FD basis; the report of each linear combination coefficient comprises at least one of a reference amplitude, a differential amplitude, and a phase; and the amplitude of the coefficient is jointly dependent on the reference amplitude and the differential amplitude.
Embodiment 3: The method of Embodiment 2, wherein: the reference amplitude is common to all coefficients associated with the same beam; or the reference amplitude is common to all coefficients associated with the same polarization.
Embodiment 4: The method of any of Embodiments 1 through 3, wherein the configuration of the maximum average amplitude further comprises a restriction on the maximum amplitude relative to the strongest SD basis or the strongest coefficient across both polarizations.
Embodiment 5: The method of Embodiment 4, wherein, for each SD basis, the restriction on the maximum average amplitude restricts the maximum amplitude of each coefficient, wherein the amplitude of each coefficient is based on the multiplication of a reference amplitude and a differential amplitude.
Embodiment 6: The method of Embodiment 4 or 5, further wherein, for each SD basis, the restriction on the maximum average amplitude restricts the maximum average amplitude across the amplitude of all coefficient associated with the SD basis, wherein the amplitude of each coefficient is based on the multiplication of a reference amplitude and a differential amplitude.
Embodiment 7: The method of any of Embodiments 1 through 5, wherein the configuration of the maximum average amplitude comprises a restriction on the maximum amplitude relative to the strongest SD basis or the strongest coefficient of each polarization.
Embodiment 8: The method of Embodiment 7, wherein, for each SD basis, the restriction on the maximum average amplitude restricts the maximum amplitude of each coefficient, wherein the amplitude of each coefficient comprises the differential amplitude.
Embodiment 9: The method of Embodiment 7 or 8, wherein, for each SD basis, the restriction on the maximum average amplitude restricts the maximum average amplitude across the amplitude of all coefficient associated with the SD basis, wherein the amplitude of each coefficient comprises the differential amplitude.
Embodiment 10: A method for wireless communications by a base station, comprising: sending a channel state information (CSI) request to a user equipment (UE), triggering a CSI report comprising at least one of a plurality of spatial domain (SD) bases, a plurality of frequency domain (FD) bases, and a plurality of linear combination coefficients; sending the UE a configuration which, restricts, for each SD basis, a maximum average amplitude of the linear combination coefficients associated with that SD basis; receiving the CSI report; and processing the linear combination coefficients contained in the CSI report in accordance with the configuration.
Embodiment 11: The method of Embodiment 10, wherein: each linear combination coefficient is associated with a specific SD basis and a specific FD basis; the report of each linear combination coefficient comprises at least one of a reference amplitude, a differential amplitude, and a phase; and the amplitude of the coefficient is jointly dependent on the reference amplitude and the differential amplitude.
Embodiment 12: The method of Embodiment 11, wherein: the reference amplitude is common to all coefficients associated with the same beam; or the reference amplitude is common to all coefficients associated with the same polarization.
Embodiment 13: The method of any of Embodiments 10 through 12, wherein the configuration of the maximum average amplitude further comprises a restriction on the maximum amplitude relative to the strongest SD basis or the strongest coefficient across both polarizations.
Embodiment 14: The method of Embodiment 13, wherein, for each SD basis, the restriction on the maximum average amplitude restricts the maximum amplitude of each coefficient, wherein the amplitude of each coefficient is based on the multiplication of a reference amplitude and a differential amplitude.
Embodiment 15: The method of Embodiment 13 of 14, further wherein, for each SD basis, the restriction on the maximum average amplitude restricts the maximum average amplitude across the amplitude of all coefficient associated with the SD basis, wherein the amplitude of each coefficient is based on the multiplication of a reference amplitude and a differential amplitude.
Embodiment 16: The method of any of Embodiments 10 through 15, wherein the configuration of the maximum average amplitude comprises a restriction on the maximum amplitude relative to the strongest SD basis or the strongest coefficient of each polarization.
Embodiment 17: The method of Embodiment 16, wherein, for each SD basis, the restriction on the maximum average amplitude restricts the maximum amplitude of each coefficient, wherein the amplitude of each coefficient comprises the differential amplitude.
Embodiment 18: The method of Embodiment 16 or 17, wherein, for each SD basis, the restriction on the maximum average amplitude restricts the maximum average amplitude across the amplitude of all coefficient associated with the SD basis, wherein the amplitude of each coefficient comprises the differential amplitude.
Embodiment 19: An apparatus for wireless communications by a user equipment (UE), comprising: means for receiving a channel state information (CSI) request from a base station, triggering a CSI report comprising at least one of a plurality of spatial domain (SD) bases, a plurality of frequency domain (FD) bases, and a plurality of linear combination coefficients; means for receiving a configuration which, restricts, for each SD basis, a maximum average amplitude of the linear combination coefficients associated with that SD basis; and means for sending the CSI report, with the linear combination coefficients generated in accordance with the configuration.
Embodiment 20: An apparatus for wireless communications by a base station, comprising: means for sending a channel state information (CSI) request to a user equipment (UE), triggering a CSI report comprising at least one of a plurality of spatial domain (SD) bases, a plurality of frequency domain (FD) bases, and a plurality of linear combination coefficients; means for sending the a configuration which, restricts, for each SD basis, a maximum average amplitude of the linear combination coefficients associated with that SD basis; means for receiving the CSI report; and means for processing the linear combination coefficients contained in the CSI report in accordance with the configuration.
The methods disclosed herein comprise one or more steps or actions for achieving the methods. The method steps and/or actions may be interchanged with one another without departing from the scope of the claims. In other words, unless a specific order of steps or actions is specified, the order and/or use of specific steps and/or actions may be modified without departing from the scope of the claims.
As used herein, a phrase referring to “at least one of a list of” items refers to any combination of those items, including single members. As an example, “at least one of: a, b, or c” is intended to cover a, b, c, a-b, a-c, b-c, and a-b-c, as well as any combination with multiples of the same element (e.g., a-a, a-a-a, a-a-b, a-a-c, a-b-b, a-c-c, b-b, b-b-b, b-b-c, c-c, and c-c-c or any other ordering of a, b, and c).
As used herein, the term “determining” encompasses a wide variety of actions. For example, “determining” may include calculating, computing, processing, deriving, investigating, looking up (e.g., looking up in a table, a database or another data structure), ascertaining and the like. Also, “determining” may include receiving (e.g., receiving information), accessing (e.g., accessing data in a memory) and the like. Also, “determining” may include resolving, selecting, choosing, establishing and the like.
The previous description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects. Thus, the claims are not intended to be limited to the aspects shown herein, but is to be accorded the full scope consistent with the language of the claims, wherein reference to an element in the singular is not intended to mean “one and only one” unless specifically so stated, but rather “one or more.” Unless specifically stated otherwise, the term “some” refers to one or more. All structural and functional equivalents to the elements of the various aspects described throughout this disclosure that are known or later come to be known to those of ordinary skill in the an are expressly incorporated herein by reference and are intended to be encompassed by the claims. Moreover, nothing disclosed herein is intended to be dedicated to the public regardless of whether such disclosure is explicitly recited in the claims. No claim element is to be construed under the provisions of 35 U.S.C. § 112(f) unless the element is expressly recited using the phrase “means for” or, in the case of a method claim, the element is recited using the phrase “step for.”
The various operations of methods described above may be performed by any suitable means capable of performing the corresponding functions. The means may include various hardware and/or software component(s) and/or module(s), including, but not limited to a circuit, an application specific integrated circuit (ASIC), or processor. For example, the various processor shown in FIG. 3 may be configured to perform operations 800 and 900 of FIGS. 8 and 9.
The various illustrative logical blocks, modules and circuits described in connection with the present disclosure may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device (PLD), discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any commercially available processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
If implemented in hardware, an example hardware configuration may comprise a processing system in a wireless node. The processing system may be implemented with a bus architecture. The bus may include any number of interconnecting buses and bridges depending on the specific application of the processing system and the overall design constraints. The bus may link together various circuits including a processor, machine-readable media, and a bus interface. The bus interface may be used to connect a network adapter, among other things, to the processing system via the bus. The network adapter may be used to implement the signal processing functions of the PHY layer. In the case of a user terminal 120 (see FIG. 1), a user interface (e.g., keypad, display, mouse, joystick, etc.) may also be connected to the bus. The bus may also link various other circuits such as timing sources, peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further. The processor may be implemented with one or more general-purpose and/or special-purpose processors. Examples include microprocessors, microcontrollers, DSP processors, and other circuitry that can execute software. Those skilled in the art will recognize how best to implement the described functionality for the processing system depending on the particular application and the overall design constraints imposed on the overall system.
If implemented in software, the functions may be stored or transmitted over as one or more instructions or code on a computer readable medium. Software shall be construed broadly to mean instructions, data, or any combination thereof, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise. Computer-readable media include both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. The processor may be responsible for managing the bus and general processing, including the execution of software modules stored on the machine-readable storage media. A computer-readable storage medium may be coupled to a processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. By way of example, the machine-readable media may include a transmission line, a carrier wave modulated by data, and/or a computer readable storage medium with instructions stored thereon separate from the wireless node, all of which may be accessed by the processor through the bus interface. Alternatively, or in addition, the machine-readable media, or any portion thereof, may be integrated into the processor, such as the case may be with cache and/or general register files, Examples of machine-readable storage media may include, by way of example, RAM (Random Access Memory), flash memory, ROM (Read Only Memory), PROM (Programmable Read-Only Memory), EPROM (Erasable Programmable Read-Only Memory) EEPROM (Electrically Erasable Programmable Read-Only Memory), registers, magnetic disks, optical disks, hard drives, or any other suitable storage medium, or any combination thereof. The machine-readable media may be embodied in a computer-program product.
A software module may comprise a single instruction, or many instructions, and may be distributed over several different code segments, among different programs, and across multiple storage media. The computer-readable media may comprise a number of software modules. The software modules include instructions that, when executed by an apparatus such as a processor, cause the processing system to perform various functions. The software modules may include a transmission module and a receiving module. Each software module may reside in a single storage device or be distributed across multiple storage devices. By way of example, a software module may be loaded into RAM from a hard drive when a triggering event occurs. During execution of the software module, the processor may load some of the instructions into cache to increase access speed. One or more cache lines may then be loaded into a general register file for execution by the processor. When referring to the functionality of a software module below, it will be understood that such functionality is implemented by the processor when executing instructions from that software module.
Also, any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared (IR), radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. Disk and disc, as used herein, include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk, and Blu-rayt disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Thus, in some aspects computer-readable media may comprise non—transitory computer-readable media (e.g., tangible media). In addition, for other aspects computer-readable media may comprise transitory computer-readable media (e.g., a signal). Combinations of the above should also be included within the scope of computer-readable media.
Thus, certain aspects may comprise a computer program product for performing the operations presented herein. For example, such a computer program product may comprise a computer-readable medium having instructions stored (and/or encoded) thereon, the instructions being executable by one or more processors to perform the operations described herein (e.g., instructions for performing the operations described herein and illustrated in FIGS. 8 and 9).
Further, it should be appreciated that modules and/or other appropriate means for performing the methods and techniques described herein can be downloaded and/or otherwise Obtained by a user terminal and/or base station as applicable. For example, such a device can be coupled to a server to facilitate the transfer of means for performing the methods described herein. Alternatively, various methods described herein can be provided via storage means (e.g., RAM, ROM, a physical storage medium such as a compact disc (CD) or floppy disk, etc.), such that a user terminal and/or base station can obtain the various methods upon coupling or providing the storage means to the device. Moreover, any other suitable technique for providing the methods and techniques described herein to a device can be utilized.
It is to be understood that the claims are not limited to the precise configuration and components illustrated above. Various modifications, changes and variations may be made in the arrangement, operation and details of the methods and apparatus described above without departing from the scope of the claims.

## Claims

1. A method for wireless communications by a user equipment (UE), comprising:
receiving a channel state information (CSI) request, from a base station, triggering a CSI report that is based on a plurality of linear combination coefficients;
receiving a configuration which restricts, for each spatial domain (SD) basis, a maximum average amplitude of the plurality of linear combination coefficients for an associated SD basis; and
sending the CSI report based on the plurality of linear combination coefficients generated in accordance with the configuration.

2. The method of claim 1, wherein:
each linear combination coefficient of the plurality of linear combination coefficients is associated with a specific SD basis and a specific frequency domain (FD) basis;
each linear combination coefficient of the plurality of linear combination coefficients comprises at least one of: a reference amplitude, a differential amplitude, or a phase; and
an amplitude of each linear combination coefficient of the plurality of linear combination coefficients is jointly dependent on the corresponding reference amplitude and the corresponding differential amplitude.

3. The method of claim 2, wherein:
the reference amplitude is common to all linear combination coefficients associated with the same beam; or
the reference amplitude is common to all linear combination coefficients associated with the same polarization.

4. The method of claim 1, wherein the configuration of the maximum average amplitude further comprises a restriction on a maximum amplitude relative to a strongest SD basis or a strongest linear combination coefficient across both polarizations.

5. The method of claim 4, wherein, for each SD basis, the restriction on the maximum average amplitude restricts the maximum amplitude of each linear combination coefficient, wherein an amplitude of each linear combination coefficient is based on a multiplication of a reference amplitude and a differential amplitude.

6. The method of claim 4, further wherein, for each SD basis, the restriction on the maximum average amplitude restricts the maximum average amplitude across an amplitude of all linear combination coefficients associated with the SD basis, wherein an amplitude of each linear combination coefficient is based on a multiplication of a reference amplitude and a differential amplitude.

7. The method of claim 1, wherein the configuration of the maximum average amplitude comprises a restriction on a maximum amplitude relative to a strongest SD basis or a strongest linear combination coefficient of each polarization.

8. The method of claim 7, wherein, for each SD basis, the restriction on the maximum average amplitude restricts a maximum amplitude of each linear combination coefficient, wherein an amplitude of each linear combination coefficient comprises a differential amplitude.

9. The method of claim 7, wherein, for each SD basis, the restriction on the maximum average amplitude restricts the maximum average amplitude across an amplitude of all linear combination coefficients associated with the SD basis, wherein an amplitude of each linear combination coefficient comprises a differential amplitude.

10. A method for wireless communications by a base station, comprising:
sending a channel state information (CSI) request, to a user equipment (UE), triggering a CSI report that is based on a plurality of linear combination coefficients;
sending the UE a configuration which restricts, for each spatial domain (SD) basis, a maximum average amplitude of the plurality of linear combination coefficients for an associated SD basis;
receiving the CSI report; and
processing the CSI report in accordance with the configuration.

11. The method of claim 10, wherein:
each linear combination coefficient of the plurality of linear combination coefficients is associated with a specific SD basis and a specific frequency domain (FD) basis;
each linear combination coefficient comprises at least one of: a reference amplitude, a differential amplitude, or a phase; and
an amplitude of each linear combination coefficient of the plurality of linear combination coefficients is jointly dependent on the corresponding reference amplitude and the corresponding differential amplitude.

12. The method of claim 11, wherein:
the reference amplitude is common to all linear combination coefficients associated with the same beam; or
the reference amplitude is common to all linear combination coefficients associated with the same polarization.

13. The method of claim 10, wherein the configuration of the maximum average amplitude further comprises a restriction on a maximum amplitude relative to a strongest SD basis or a strongest linear combination coefficient across both polarizations.

14. The method of claim 13, wherein, for each SD basis, the restriction on the maximum average amplitude restricts the maximum amplitude of each linear combination coefficient, wherein an amplitude of each linear combination coefficient is based on a multiplication of a reference amplitude and a differential amplitude.

15. The method of claim 13, further wherein, for each SD basis, the restriction on the maximum average amplitude restricts the maximum average amplitude across an amplitude of all linear combination coefficients associated with the SD basis, wherein an amplitude of each linear combination coefficient is based on a multiplication of a reference amplitude and a differential amplitude.

16. The method of claim 10, wherein the configuration of the maximum average amplitude comprises a restriction on a maximum amplitude relative to a strongest SD basis or a strongest linear combination coefficient of each polarization.

17. The method of claim 16, wherein, for each SD basis, the restriction on the maximum average amplitude restricts a maximum amplitude of each linear combination coefficient, wherein an amplitude of each linear combination coefficient comprises a differential amplitude.

18. The method of claim 16, wherein, for each SD basis, the restriction on the maximum average amplitude restricts the maximum average amplitude across an amplitude of all linear combination coefficients associated with the SD basis, wherein an amplitude of each linear combination coefficient comprises a differential amplitude.

19. A user equipment (UE) configured for wireless communications, comprising:
a memory comprising computer-executable instructions; and
one or more processors configured to execute the computer-executable instructions and cause the UE to:
receive a channel state information (CSI) request, from a base station, triggering a CSI report that is based on a plurality of linear combination coefficients;
receive a configuration which restricts, for each spatial domain (SD) basis, a maximum average amplitude of the plurality of linear combination coefficients for an associated SD basis; and
send the CSI report based on the plurality of linear combination coefficients generated in accordance with the configuration.

20. A base station, configured for wireless communications comprising:
a memory comprising computer-executable instructions; and
one or more processors configured to execute the computer-executable instructions and cause the base station to:
send a channel state information (CSI) request, to a user equipment (UE), triggering a CSI report that is based on a plurality of linear combination coefficients;
send the UE a configuration which restricts, for each spatial domain (SD) basis, a maximum average amplitude of the plurality of linear combination coefficients for an associated SD basis;
receive the CSI report; and
process the CSI report in accordance with the configuration.