Rate selection in multiple-input multiple-output communication systems

Information

  • Patent Grant
  • 11877311
  • Patent Number
    11,877,311
  • Date Filed
    Thursday, October 28, 2021
    2 years ago
  • Date Issued
    Tuesday, January 16, 2024
    4 months ago
Abstract
Aspects of this disclosure relate to user equipment rate selection. Sum rates can be compared including and excluding a candidate layer. Based on the comparison, the candidate layer can be included in a layer set. Rate selection for user equipments of a cluster can be performed based on the layer set. In certain applications, user equipment rate selection can be performed for multiple clusters of user equipments and network nodes. In such applications, inter-cluster interference can be nulled.
Description
BACKGROUND
Technical Field

Embodiments of this disclosure relate to for wireless communication systems.


Description of Related Technology

In a wireless communication system, there can be a plurality of user equipments (UEs) and a plurality of remote radio units (RRUs) in a particular geographic area. Scheduling multiple-input multiple-output (MIMO) wireless communications between the UEs and the RRUs in a way that efficiently utilizes resources with relatively low interference can be computationally complex. Methods of determining RRUs to serve UEs with high throughput are desired. Methods of efficiently selecting rate and/or rank for UEs in a MIMO wireless communication environment are desired.


SUMMARY OF CERTAIN INVENTIVE ASPECTS

The innovations described in the claims each have several aspects, no single one of which is solely responsible for its desirable attributes. Without limiting the scope of the claims, some prominent features of this disclosure will now be briefly described.


One aspect of this disclosure is a method of interference aware clustering. The method includes forming a first cluster of first user equipments and first network nodes in a first section during a time slot, forming a second cluster of second user equipments and second network nodes in a second section during the time slot such that the first user equipments are protected from interference associated with the second cluster, and causing multiple-input multiple-output wireless communications during the time slot (a) from the first network nodes to the first user equipments and (b) from the second network nodes to the second user equipments. The first section has higher priority than the second section in the time slot;


The first network nodes can include first remote radio units, and the second network nodes can include second remote radio units.


Forming the second cluster can include excluding one or more dominant interfering network nodes in the second section from the second cluster. Forming the second cluster can include excluding one or more victim user equipments in the second section from the second cluster. The method can include assigning one or more dimensions in the second cluster for nulling to one or more victims of the first user equipments in the first cluster to reduce inter-cluster interference during the time slot.


Forming the first cluster can include sorting the first user equipments by user equipment priority and a selecting a network node to serve the highest priority user equipment of the first user equipments first. Forming the first cluster can include determining to stop forming the first cluster in response to a maximum number of user equipments being in the first user equipments. Forming the first cluster can include determining to stop forming the first cluster in response to no more network nodes in the first section being available for scheduling.


Forming the first cluster can include selecting a particular network node of the first network node to serve a user equipment of the first user equipments based on (i) a network node of the first network nodes with a highest channel quality measure for the user equipment being unavailable and (ii) the particular network node having a channel quality measure within a threshold of the highest channel quality measure.


The method can include determining (i) a network node of the first network nodes with a highest channel quality measure for each of the first user equipments and (ii) one or more other network nodes of the first network nodes with a channel quality measure within a threshold of the highest channel quality measure for each of the first user equipments, in which the first cluster in formed based on the determining. The method can include estimating a Sounding Reference Signal channel estimate between an antenna of a user equipment of the first user equipments and an antenna of a network node of the first network nodes, and computing an average of squared channel estimates of all antennas of the first network nodes and the antenna of the user equipment of the first user equipments. The determining can be based on the average of squared channel estimates.


The method can include forming clusters of user equipments and network nodes during a second time slot such that a cluster for the second section is protected from interference associated with a cluster for the first section, in which the second section has higher priority than the first section in the second time slot.


The method can include ordering a candidate layer set of layers for the first cluster, selecting a layer of the candidate set that satisfies one or more conditions, comparing a first sum rate of a selected layer set with a second sum rate of the layer together with the selected layer set, determining to include the layer in the selected layer set based on the comparing, and performing rate selection for the first user equipments of the first cluster based on the selected layer set.


The method can include selecting first ranks associated with the first user equipments, selecting second ranks associated with the second user equipments, determining one or more user equipments of the first user equipments to protect, computing precoding coefficients for the second cluster with nulling based on the second user equipments and the one or more user equipments of the first user equipments to protect, and causing wireless transmission from the second network nodes to the second user equipments using the precoding coefficients.


Another aspect of this disclosure is a network system with interference aware clustering. The network system includes network nodes and one or more baseband processing units. The network nodes are configured to wirelessly exchange information with user equipments. The network nodes include first network nodes in a first section and second network nodes in a second section. The one or more baseband processing unit are programmed to: form a first cluster of a first group of the user equipments and the first network nodes during a time slot; form a second cluster of a second group of the user equipments and the second network nodes during the time slot such that the first group of the user equipments are protected from interference associated with the second cluster, wherein the first section has higher priority than the second section in the time slot; and cause multiple-input multiple-output wireless communications during the time slot (a) from the first network nodes to the first group of the user equipments and (b) from the second network nodes to the second group of the user equipments.


The network nodes can include remote radio units. The one or more baseband processing units can include a distributed unit in accordance with a New Radio standard.


The one or more baseband processing units can be programmed to exclude one or more dominant interfering network nodes in the second section from the second group of the user equipments in forming the second cluster. The one or more baseband processing units can be programmed to exclude one or more victim user equipments in the second section from the second group of the user equipments in forming the second cluster. The one or more baseband processing units can be programmed to assign one or more dimensions in the second cluster for nulling to one or more victims of the first group of the user equipments in the first cluster to reduce inter-cluster interference.


Another aspect of this disclosure is a method of user equipment rate selection. The method includes ordering a candidate layer set of layers for a cluster comprising user equipments and network nodes, selecting a layer of the candidate set that satisfies one or more conditions, comparing a first sum rate of a selected layer set with a second sum rate of the layer together with the selected layer set, determining to include the layer in the selected layer set based on the comparing, and performing rate selection for user equipments of the cluster based on the selected layer set. The method is performed by a network system.


The network nodes can include remote radio units. The method can include causing wireless transmissions from the network nodes to the user equipments after the performing the rate selection.


The one or more conditions can include (a) being within a threshold number of layers from a beginning of the candidate set after the ordering and (b) having a lowest average correlation with layers already in the selected layer set.


The first and second sum rates can be weighted sums. The ordering can be based on an achievable rate of a single layer transmission. The rate selection can include modulation and coding scheme (MCS) selection.


The method can include iterating the selecting, the comparing, and the determining until a termination condition is satisfied. The second sum rate can be based on the sum rate from a previous iteration of the selecting, the comparing, and the determining.


Another aspect of this disclosure is a method of multi-cluster user equipment rate selection. The method includes selecting first user equipments and associated first ranks for a first cluster that includes the first user equipments and first network nodes, selecting second user equipments and associated second ranks for a second cluster that includes the second user equipments and second network nodes, determining one or more user equipments of the second user equipments to protect, computing precoding coefficients for the first cluster with nulling based on the one or more user equipments of the second user equipments to protect, and causing wireless transmission from the first network nodes to the first user equipments using the precoding coefficients.


The first network nodes can include first remote radio units. The second network nodes can include remote radio units.


The method can include performing rate selection for the first user equipments, and performing rate selection for the second user equipments. The performing rate selection for the first user equipments can be independent of the performing rate selection for the second user equipments. Alternatively, the performing rate selection for the first user equipments can account for interference from the second cluster.


The method can include computing the interference from the second cluster based on channel fadings and a calculated precoder coefficient. The interference from the second cluster can be associated with long term channel conditions.


The method can include allocating frequency and time resources to the first cluster and the second cluster prior to the selecting the first user equipments and associated ranks.


Selecting the first user equipments can account for interference from another cluster.


The method can include estimating a Sounding Reference Signal channel estimate between an antenna of a user equipment of the first user equipments and an antenna of a network node of the first network nodes, and computing an average of squared channel estimates of all antennas of the first network nodes and the antenna of the user equipment of the first user equipments, in which the selecting the first user is based on the average of squared channel estimates.


Another aspect of this disclosure is a network system with user equipment rate selection. The network system includes network nodes configured to wirelessly exchange information with user equipments and one or more baseband processing units in communication with the network nodes. The one or more baseband processing programmed to order a candidate layer set of layers for a cluster comprising the user equipments and the network nodes, select a layer of the candidate set that satisfies one or more conditions, compare a first sum rate of a selected layer set with a second sum rate of the layer together with the selected layer set, determine to include the layer in the selected layer set based on comparing the first sum rate with the second sum rate, perform rate selection for user equipments of the cluster based on the selected layer set, and cause wireless transmissions from the network nodes to the user equipments based on the rate selection.


The network nodes can include remote radio units. The one or more baseband processing units can include a distributed unit in accordance with a New Radio standard.


The one or more baseband processing units can be programmed to perform rate selection for a second cluster of second network nodes and second user equipments taking into account interference between the first cluster and the second cluster.


The one or more baseband processing units can be programmed compute precoding coefficients for the first cluster with nulling based on protecting one or more user equipments of a second cluster.


Another aspect of this disclosure is a method of determining Reference Signal Received Power (RSRP) between a user equipment and a remote radio unit. The method includes estimating a Sounding Reference Signal (SRS) channel estimate between an antenna at the user and an antenna at the remote radio unit, and computing an average of squared channel estimates of all antennas of the remote radio unit from the antenna of the user equipment. The method can be performed by a baseband processing unit of a network system.


The RSRP is a measure of a long term channel condition. The RSRP can be used to determine that the remote radio unit is an interfering remote radio unit. The RSRP can be used to determine that the user equipment is a victim of the remote radio unit. The RSRP can be used with clustering disclosed herein. For example, the RSRP can be used to determine which user equipments to protect in forming one or more clusters. As another example the RSRP can be used to determine strongly associated remote radio units and weakly associated RRUs. The RSRP can be used with user equipment rate selection disclosed herein. For example, the RSRP can be used as an indication on long term inter-cluster interference in rate selection.


Another aspect of this disclosure is non-transitory, computer-readable storage comprising computer-executable instructions, wherein the computer-executable instructions, when executed by a baseband processing unit, cause a method described in one or more of the preceding paragraphs of this summary action to be performed.


For purposes of summarizing the disclosure, certain aspects, advantages and novel features of the innovations have been described herein. It is to be understood that not necessarily all such advantages may be achieved in accordance with any particular embodiment. Thus, the innovations may be embodied or carried out in a manner that achieves or optimizes one advantage or group of advantages as taught herein without necessarily achieving other advantages as may be taught or suggested herein.





BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of this disclosure will now be described, by way of non-limiting example, with reference to the accompanying drawings.



FIG. 1A is a flow diagram of an example method of clustering and rate selection according to an embodiment.



FIG. 1B is a schematic diagram illustrating an example multiple-input multiple-output (MIMO) network environment where clustering and/or rate selection can be performed in embodiments.



FIGS. 1C and 1D are schematic diagrams of example sections in different time slots.



FIG. 2 is a flow diagram of an example method of clustering according to an embodiment.



FIG. 3 is a flow diagram of an example method of clustering network nodes and users in a section with higher priority according to an embodiment.



FIG. 4 is a flow diagram of an example method of clustering network nodes and users in a section with lower priority according to an embodiment.



FIG. 5 is a flow diagram of an example method of clustering according to an embodiment.



FIG. 6 is a flow diagram of an example method of single cluster user rate selection according to an embodiment.



FIG. 7 is an illustration related to calculating a number of subframes a user is scheduled in during a sliding window.



FIG. 8 is a flow diagram of an example method of multi-cluster user rate selection according to an embodiment.



FIG. 9 is a flow diagram of an example method of multi-cluster user rate selection according to another embodiment.



FIG. 10 is a schematic diagram of a user equipment that transits a reference signal to a plurality of remote radio units.



FIG. 11 is a diagram related to calculating long term Reference Signal Received Power.



FIG. 12 is a schematic block diagram illustrating part of a network system for clustering according to an embodiment.



FIG. 13 is a schematic block diagram illustrating part of a network system for clustering according to another embodiment.



FIG. 14 is a schematic block diagram illustrating part of a network system for user rate selection according to an embodiment.





DETAILED DESCRIPTION OF CERTAIN EMBODIMENTS

The following description of certain embodiments presents various descriptions of specific embodiments. However, the innovations described herein can be embodied in a multitude of different ways, for example, as defined and covered by the claims. In this description, reference is made to the drawings where like reference numerals can indicate identical or functionally similar elements. It will be understood that elements illustrated in the figures are not necessarily drawn to scale. Moreover, it will be understood that certain embodiments can include more elements than illustrated in a drawing and/or a subset of the elements illustrated in a drawing. Further, some embodiments can incorporate any suitable combination of features from two or more drawings. The headings provided herein are for convenience only and do not necessarily affect the scope or meaning of the claims.


This disclosure provides technical solutions related to clustering remote radio units (RRUs) and user equipments (UEs) in multi-user multiple-input multiple-output (MU-MIMO) systems. This disclosure provides technical solutions related to rate selection within one or more clusters in MU-MIMO systems.



FIG. 1A is a flow diagram of an example method 100 of clustering and rate selection. At block 102, interference aware clustering is performed. RRUs and UEs can be clustered into groups. RRUs and UEs within a section or geographical area can be clustered. Clustering can be performed for a plurality of different sections. The clustering can account for interference. The clustering at block 102 can be implemented in accordance with any suitable principles and advantages of clustering disclosed herein. Rate selection can be performed at block 104. The rate selection can be performed for each cluster determined at block 102. The rate selection can be single cluster rate selection in certain applications. The rate selection can be multi-cluster rate selection in some other applications. The rate selection at block 104 can be implemented in accordance with any suitable principles and advantages of rate selection disclosed herein.



FIG. 1B is a diagram illustrating an example MIMO network environment 110 that includes UEs 112A-112K, RRUs 114A-114N, a distributed unit (DU) 120, and a centralized unit (CU) 130. In the MIMO network environment 110, UEs 112A-112K and RRUs 114A-114N can wirelessly communicate with each other. As illustrated, one or more RRUs 114A-114N can include multiple antennas. The RRUs 114A-114N can be serving nodes.


Aspects of this disclosure relate to achieving high throughput in the MIMO network environment 110. As illustrated, the RRUs 114A-114N are in communication with the DU 120. The DU 120 can implement any suitable features of a DU specified in a New Radio (NR) standard. The DU 120 can perform clustering and/or user rate selection in accordance with any suitable principles and advantages disclosed herein. The DU 120 can cluster UEs 112A-112K and RRUs 114A-114N in accordance with any suitable principles and advantages disclosed herein. The DU 120 can perform rate selection on one or more clusters that each include a subset of these UEs and RRUs in accordance with any suitable principles and advantages disclosed herein. In some instances, clustering and/or rate selection can be performed by two or more DUs. Two or more DUs can be in communication with the RRUs 114A-114N in some applications. The DU 120 is in communication with the CU 130. The CU 130 can implement any suitable features of a CU specified in a NR standard. In certain applications, the functions of the CU 130 and DU 120 can be combined into a single unit. In some applications, similar functions to the DU 120 and CU 130 can be performed by a baseband unit (BBU) in accordance with an LTE standard.


Various standards and/or protocols may be implemented in the MIMO network environment 110 to wirelessly communicate data between a RRU and a UE communication device. Some wireless devices may communicate using an orthogonal frequency-division multiplexing (OFDM) digital modulation scheme via a physical layer. Example standards and protocols for wireless communication in the network environment 110 can include the third generation partnership project (3GPP) Long Term Evolution (LTE), Long Term Evolution Advanced (LTE Advanced), 3GPP New Radio (NR) also known as 5G, Global System for Mobile Communications (GSM), Enhanced Data Rates for GSM Evolution (EDGE), Worldwide Interoperability for Microwave Access (WiMAX), and the IEEE 802.11 standard, which may be known as Wi-Fi. In some systems, a radio access network (RAN) may include one or more base stations associated with one or more evolved Node Bs (also commonly denoted as enhanced Node Bs, eNodeBs, or eNB s), gNBs, or any other suitable Node Bs (xNBs). In some other embodiments, radio network controllers (RNCs) may be provided as the base stations. A base station provides a bridge between the wireless network and a core network such as the Internet. The base station may be included to facilitate exchange of data for the wireless communication devices of the wireless network. A base station can perform clustering and/or rate selection is accordance with any suitable principles and advantages disclosed herein.


A UE of the UEs 112A-112K can include a device used by a user with wireless communication capabilities such as a smartphone, a laptop, a tablet computer, cellular telephone, a wearable computing device such as smart glasses or a smart watch or an ear piece, one or more networked appliances (e.g., consumer networked appliances or industrial plant equipment), an industrial robot with connectivity, or a vehicle. In some implementations, the UE may include a sensor or other networked device configured to collect data and wirelessly provide the data to a device (e.g., server) connected to a core network such as the Internet. Such devices may be referred to as Internet of Things devices (IoT devices). A UE may be referred to as a user herein. UEs may be referred to as users herein. A downlink (DL) transmission generally refers to a communication from a network system to a UE. An uplink (UL) transmission generally refers to a communication from the UE to the network system.


Although features may be disclosed with reference to users or UEs, any suitable principles and advantages disclosed herein can be implemented with any suitable wireless communication devices. As one example, clustering and/or rate selection can alternatively or additionally be applied to a network device and a network node. For instance, the network device can be an integrated access and backhaul (IAB) node and the network node can be an IAB donor. Although features may be disclosed with reference to RRUs, any suitable principles and advantages disclosed herein can be implemented with any suitable serving nodes.



FIGS. 1C and 1D illustrate example sections in different time slots. In this example, sections can have a pattern similar to a chess board. Any other suitable sections can be defined. The highest priority sections during a time slot have dark solid shading in FIGS. 1C and 1D. The lower priority sections during the time slot have a diagonal pattern shading in FIGS. 1C and 1D. FIGS. 1C and 1D illustrates that highest priority and lower priority can switch among time slots. For example, FIG. 1C can indicate priority in a first time slot and FIG. 1D can indicate priority in a second time slot following the first time slot.


Interference Aware Clustering


In a MU-MIMO environment, there can be multiple UEs and multiple RRUs. Interference aware trivial user grouping algorithms (ITUGAs) can form clusters of RRUs and UEs in a MU-MIMO environment. Multi-cluster methods can form clusters of RRUs each serving a group of users. The RRUs can exchange wireless communications that are overlapping in time and/or frequency. The clusters can be formed to increase overall system throughput in one or more time slots.


Multiple sections or geographic areas can each include of a group of users and a group of RRUs in a wireless communication environment. A section can correspond to a particular geographic area. A cluster of RRUs can be formed in each section. The cluster of RRUs can serve a group of users in the same area. Clustering methods can determine how to turn on the RRUs and grow clusters in each area. With an ITUGA, groups of sections with relatively low interference between the groups can be formed. For each time and frequency, one of the groups of sections can have higher priority and users in these groups should be protected from interference associated with one or more other groups of other sections. Which users to protect can be determined by Reference Signal Received Power (RSRP), another indication of channel quality, or any other suitable parameter. In certain applications, RRUs in lower priority groups can be on only if such RRUs are not causing a significant interference on wireless communications associated with higher priority groups. Although example clustering methods may be described with reference to clusters being divided into two groups, any suitable principles and advantages of these clustering methods can be applied to applications where clusters are divided into three or more groups.



FIG. 2 is a flow diagram of an example method 200 of clustering according to an embodiment. In the method 200, clusters of RRUs that overlap in frequency and time each serving users can be formed. At block 202, weakly and strongly associated RRUs can be determined for each user in a section. A strongly associated (SAS) RRU can be the RRU with a highest measure of channel quality, such as channel gain, for a user. A weakly associated (WAS) RRU of a user can be an RRU with a channel gain or other measure of channel quality within a threshold δ1 of the strongest channel of the user. There can be a plurality of WAS RRUs for a user in a section in certain instances. The WAS and SAS RRUs can be determined for users in a plurality of sections. The WAS and SAS RRUs can be determined based on Reference Signal Received Power (RSRP). RSRP can be measured at a RRU, for example, as described in more detail below. A best channel can have a strongest signal.


A group of sections with the highest priority in a time slot can be identified at block 204. One or more other groups of sections with lower priority in the time slot can be identified. The highest priority typically switches between groups of sections for different time slots. A highest priority group in one time slot can become a lower priority group in a subsequent time slot.


A set of RRUs and users in each section of the highest priority group can be clustered at block 206. More details of an embodiment of this clustering will be described with reference to FIG. 3. Clustering of each section with highest priority can be performed in parallel. A set of RRUs and users in each section of the lower priority group can be clustered so as to protect the highest priority group at block 208. This can involve turning off RRUs of the lower priority group that are dominant interferers of users in the higher priority group. Clustering RRUs and users at block 208 can involve protecting users of the lower priority group that are victims of RRUs of the cluster for the higher priority group. RRUs of a lower priority group without significant interference with any highest priority group can be clustered at block 208. More details of an embodiment of this clustering will be described with reference to FIG. 4. Clustering of each section with lower priority can be performed in parallel. After forming clusters in highest priority sections and the lower priority sections for a time slot, wireless communications can be scheduled for the clusters in the time slot.



FIG. 3 is a flow diagram of an example method 210 of clustering RRUs and users in a section with the highest priority according to an embodiment. The method 210 can be performed at block 206 of the method 200. The method 210 can be performed for each section with the highest priority in a time slot in a wireless communication environment.


At block 212, users of a section can be sorted based on a user priority. A user can be selected based on its priority at block 214. The highest priority user can be selected first. The next highest priority user can be selected in a next iteration.


Whether a SAS RRU of the selected user is available can be determined at block 216. If the SAS RRU of the selected user is available, the user can be selected to be scheduled with the SAS RRU at block 218. The number of users in a cluster assigned to an RRU in the cluster is defined by an association set (AS) index of the RRU. The AS index is less than or equal to a maximum index ASmax. The AS index for the SAS RRU of the selected user can be incremented at block 218.


If the SAS RRU of the selected user in unavailable, whether a WAS RRU of the selected user is available can be determined at block 220. When one or more WAS RRUs of the selected user are available, a WAS RRU with a highest channel gain or other measure of channel quality, such as RSRP, can be selected to serve the selected user at block 222. The AS index for the WAS RRU can be incremented at block 222. When neither the SAS RRU nor a WAS RRU is available to the selected user, the selected user can be skipped and not scheduled for the time slot at block 224. Then the method can return to block 214. The next highest user can then be selected at block 214.


After an RRU is selected to serve the selected user at block 218 or block 222, the availability of the selected RRU can be updated at block 226. An RRU can be unavailable if the AS index for that RRU reaches ASmax. If it is determined that there are no more RRUs available at block 228, clustering can be concluded in the section at block 230. On the other hand, if one or more RRUs are determined to be available at block 228, the number of users scheduled in the cluster can be compared to a maximum number of users UEmax to schedule in the cluster at block 232. When the number of users scheduled reaches the maximum number of users UEmax, the clustering for the section can be concluded at block 230. Accordingly, clustering can be concluded for the section when RRUs of the section are no longer available and/or when a maximum number of users are scheduled.


When one or more RRUs are available and the number of users scheduled is less than a maximum number of users UEmax, the method can return to block 214. The next highest user can then be selected at block 214 and another iteration of the method 210 can be performed.



FIG. 4 is a flow diagram of an example method 240 of clustering RRUs and users in a section with lower priority according to an embodiment. The method 240 can be performed at block 208 of the method 200. The method 240 can be performed for each section with the lower priority in a time slot in a wireless communication environment.


If a long-term channel gain, such as a RSRP, between RRU g and user u are within a threshold δ2 of the long-term channel gain between user u and its associated RRU, RRU g is a dominant interferer of user u and user u is a victim of RRU g. At block 242, RRUs that are dominant interferers of scheduled users in the highest priority group can be turned off. The availability of these RRUs can be set to zero. Users that are victims of the RRUs that are on in the highest priority group can be removed from a list of candidate users for the time slot at block 244. Accordingly, dominant interfering RRUs and victim users from the lower priority group can be inactive during the time slot. Thus, interference among the highest priority group and the lower priority group can be accounted for in clustering RRUs and users in a section for a time slot. In some other embodiments, either dominant interfering RRUs or victim users from the lower priority group can be inactive during the time slot.


The remaining users and RRUs for the lower priority group can then be processed similarly to the higher priority group. If a SAS RRU of a user is available, the user can be selected to be scheduled with the SAS RRU and the AS index can be increased for that RRU at block 218. If the SAS RRU of the user is not available, then whether any of the WAS RRUs are available can be determined at block 220. Among any available RRUs of WAS RRUs, the WAS RRU with the highest channel gain can be chosen to serve the user and the AS index for that RRU can be increased at block 222. If no SAS or WAS RRUs are available for the user, the user can be skipped for scheduling during the time slot at block 224. The availability of the RRUs in the section can then be updated. An RRU can be unavailable if the AS index for that RRU reaches the ASmax. If there are no more RRUs available as determined at block 228, clustering can be concluded in this section at block 230. The number of scheduled users in the cluster can be compared to the maximum number of users UEmax for the cluster at block 232. If the number of users reaches the maximum number of users UEmax, clustering can be concluded in the section at block 230.



FIG. 5 is a diagram illustrating a method 250 of clustering according to an embodiment. Frequency can be allocated among clusters at block 252. Frequency can overlap for the clusters.


For a first section with highest priority, users and associated RRUs can be selected based on the order of user priority at block 254. A highest priority user can be scheduled with a SAS RRU. The next highest user can be scheduled with a RRU of the available RRUs with a highest channel gain. Users can be scheduled with RRUs until no more RRUs are available and/or a maximum number of users are scheduled.


Then information identifying selected users and RRUs of the highest priority section in a time slot can be provided for clustering a lower priority section in the time slot. In the second section, victim users can be removed and/or dominant interfering RRUs can be turned off based on an average channel estimates at block 256. Users of the remaining users can be scheduled with RRUs of the remaining RRUs by the order of user priority at block 258.


In embodiments, all available beams can be used for wireless communication. According to some other embodiments, after clustering of RRUs with UEs, one or more particular beams can be selected using interference aware beam selection. Weights for RRUs and/or precoding can be determined to reduce interference.


Interference Aware Clustering Integrated with Nulling


Interference aware clustering can include integrated nulling. For integrated nulling, a fixed portion of extra dimension(s) in each cluster can be used to null top victims outside the cluster, reduce inter-cluster interference, increase overall throughput, or any combination thereof. The number of dimensions available for nulling can be a fixed ratio of the number of RRUs in a particular cluster. For interference aware clustering with integrated nulling, no further user and rank selections are applied in certain applications.


The method 200 of FIG. 2 can be performed with integrated nulling. The operations at blocks 202 and 204 can be implemented in accordance with any suitable principles and advantages discussed with reference to FIG. 2. The operations at block 206 and 208 can include integrated nulling features.


After a set of RRUs and users in each section of the highest priority group is clustered at block 206, integrated nulling operations related to the highest priority group can be applied at block 206. A number of available nulling dimensions in a cluster i can be computed after a set of RRUs is selected as part of the cluster i. The available nulling dimensions Nnulli for a cluster i can have a maximum value of Nnulli=round(α×#RRUi), where α is a design parameter. From the selected users in the highest priority group outside cluster i, a set of users Vi that are the victims of cluster i can be created. Unulli is a set of users outside cluster i that cluster i chooses to null a signal to. The number of layers assigned to a user is L. The top






K
=

min


(



N
null
i

L

,

length


(

V
i

)



)







with highest priority from Vi can be added to Unulli and Nnulli=Nnulli−L×K can be updated.


As discussed above, a set of RRUs and users in each section of the lower priority group can be clustered so as to protect the highest priority group at block 208 of the method 200. Clustering RRUs and users in each section of the lower priority group can involve integrated nulling. Integrated nulling features can be implemented with different operations than the method 240 of FIG. 4. For each section in the lower priority group, the following operations can be performed in any suitable order to implement clustering with integrated nulling.


A set of RRUs of the lower priority section with enough dimension to null to all their victims in the highest priority group can be turned on. Selecting RRUs to turn on for nulling can involve sorting RRUs based on the number of their victims in the highest priority group, growing a set of RRUs by adding RRUs with the same order, an RRU can be added only if after adding that RRU the cluster can null to all its victims, otherwise the next RRU can be evaluated. In some other applications, selecting RRUs to turn on for nulling can involve including all RRUs in the section in a set and the RRUs can be removed one by one, each time removing the RRU that has the most distinct victims until the number of available nulling dimensions is equal or more than the number of victims.


Users for the lower priority section can be selected based on their priority. A highest priority user can be selected first. Then a next highest priority user can be selected. Whether the selected user is in a victim group of RRUs in the highest priority group can be determined. If the selected user is in the victim group, then it can be determined whether the clusters of dominant interferers have enough dimension to null to the selected user. If there is not enough dimension, the user can be skipped. Otherwise, if there is sufficient dimension, it can be determined whether a SAS RRU of the selected user is available. If the SAS RRU is available, the SAS RRU can be select the user to be scheduled and increase the AS index for that RRU. This user can also be added to the nulling list of all its dominant interferer clusters and the nulling availability of the dominant interferer clusters accordingly. If the SAS RRU of the selected user is not available, it can be determined whether any of the WAS RRUs are available. Among any available WAS RRUs, the one with the highest channel gain channel can be selected for scheduling the user and the AS index for that RRU can be increased. The user can be added to the nulling list of all its dominant interferer clusters and their nulling availability can be adjusted accordingly. If no SAS RRU or WAS RRU for the selected user is available, scheduling the selected user can be skipped for this time slot.


The availability of RRUs of the section can be updated. An RRU can be unavailable when the AS index for that RRU reaches the ASmax. If there are no more RRUs available, clustering can be concluded in the section. A number of scheduled users in can be compared to a maximum number of users UEmax for scheduling. The next user can be selected if the number of scheduled users is less than the maximum number of users UEmax for scheduling. On the other hand, when number of scheduled users reaches the maximum number of users UEmax for scheduling, clustering can be concluded for the section. Accordingly, clustering in the section can be concluded when no more RRUs are available and/or when a maximum number of users has been scheduled.


Single Cluster Rate Selection


After RRUs and users have been clustered, user rate selection can be performed in each cluster. Such clustering can be implemented in accordance with any suitable principles and advantages disclosed herein. Efficient user and rank selection methods for a single cluster that achieve a desirable balance between performance and complexity are disclosed.



FIG. 6 is a flow diagram of an example method 300 of a single cluster user rate selection according to an embodiment. The method 300 can be performed at block 104 of the method 100 of FIG. 1A. The method 300 can be performed for one or more clusters in a wireless communication environment. In the method 300, blocks 302, 304, 306, 308, 310, 312, 314, 315, and 315 relate to user and rank selection; block 318 relates to Modulation and Coding Scheme (MCS) selection; and block 320 relates to outer-loop link adaption.


At block 302, parameters for user rate selection can be initialized. Such parameters can include a layer candidate set T′, a selected layer set S, a layer count l and a window size w. The candidate layer set T′ can include candidate layers for wireless communications in the cluster. The selected layer set S can be initialized to be a null set. The layer count l can be initialized to 0. The window size w can be initialized to any suitable number, such as 3.


The candidate layer set T′ can be reordered at block 304. The reordered candidate layer set T can be ordered in descending order of priority. In certain applications, transmission layers are reordered. The order can be determined based a weighted single-rate layer in various applications.


If it is determined that one or more layers can be added at decision block 306, the method 300 can proceed to evaluate whether a particular candidate layer from the reordered candidate layer set T increases a sum rate, such as a weighted sum rate, in the cluster.


A layer q* that satisfies a set of one or more conditions is selected at block 308. As discussed above, a window size w can be set at block 302. The window size w can represent a sliding window. The window size w can be used to limit the number of layers and/or users for consideration in an iteration of the method 300. A set of conditions for selecting the layer q* can include (1) the selected layer q* belonging to the first w elements of the ordered set T and (2) among the first w elements of set T, layer q* has the lowest averaged correlation with all the already selected layers. Any other suitable conditions can alternatively or additionally be used for selecting the layer q*.


A sum rate, such as a weighted sum rate (WSR), of union (S, {q*}) can be calculated at block 310, where set S includes all of the already selected layers. A WSR can be independently calculated during each iteration of the method 300. In some other applications, a WSR can be calculated in an iterative manner based on the WSR calculated from the previous iteration. With iterative precoder calculation, iterative WSR calculation can be implemented.


The sum rate, such as the WSR, with the layer q* can be compared to a previous sum rate at block 312. The previous sum rate is the sum rate of the selected layer set S. Based on the comparison, the layer q* can be either effectively selected or discarded. The comparison can involve a WSR or an unweighted sum rate.


If the calculated sum rate is larger than the previous sum rate, the layer q* increases the sum rate. In certain instances, the layer q* can be considered effectively selected when the calculated WSR is greater than the previous WSR. The layer q* can be considered effectively selected when the calculated WSR is greater than the previous WSR by a pre-determined amount in various applications. This can ensure that the layer q* provides a sufficient increase in WSR to be effectively selected. After the layer q* is effectively selected, the layer q* can be added to the selected layer set at block 314. The method 300 can return to block 306 after block 314 and a next iteration of the method 300 can be performed.


If the calculated sum rate is less than or equal to the previous sum rate, the layer q* can be discarded and not included in the selected layer set S in certain applications. If the calculated WSR is not greater than the previous WSR by a pre-determined amount, the layer q* can be discarded and not included in the selected layer set S in various applications. When the layer q* is discarded, the layer q* can be removed from the candidate set T. After the layer q* is discarded, the method 300 can return to block 306 and a next iteration of the method 300 can be performed.


When the layer q* is considered an effectively selected layer, the selected layer set S and the candidate layer set T can be updated at block 314. The layer q* can be added to the selected layer set S and removed from the candidate layer set T. Averaged correlation coefficients of all candidate layers in the candidate layer set T with all the selected layers in the selected layer set S can be calculated at block 314. The averaged correlation coefficients can be independently calculated each iteration. The averaged correlation coefficients can be calculated in an iterative manner based on the correlation coefficients from the previous iteration. Iterative calculation of averaged correlation coefficients can reduce complexity.


When the layer q* is not an effectively selected layer, the candidate layer set T can be updated at block 315 to remove the layer q*. After the layer q* is removed from the candidate layer set T at block 315 or block 314, the method 300 can return to block 306.


The method 300 can iterate blocks 308 to 314 or 315 until a termination condition is satisfied. At decision block 306, whether one or more termination conditions are satisfied is determined. A termination condition can be satisfied if the candidate layer set T is empty, the number of layers in the selected layers set S corresponds to a total number of transmit antennas, or a number of layers in the selected layers set S corresponds to a pre-configured maximum number of scheduled layers. Any other suitable termination condition can alternatively or additionally be checked at block 306. If a termination condition is not satisfied, the method 300 can proceed to block 308. On the other hand, if a termination condition is satisfied, the method 300 can proceed to block 316. At block 316, information identifying users and respective ranks of the users is output. The rank can be the number of layers for wirelessly communicating with the user.


At block 318, rate selection can be determined per user. Rate selection can involve determining a Modulation and Coding Scheme (MCS) per user. Rate selection can be determined by channel quality feedback from a user, equivalent multi-user channel with precoder, the like, or any suitable combination thereof. In certain applications, post processing effective signal-to-interference-plus-noise ratio (SINR) can be calculated per user. Then the effective SINR can be used to select MCS, for example, according to pre-generated link curves.


Outer loop link adaptation can be performed at block 320. The link adaptation can be based on an acknowledgement (ACK) or a negative acknowledgement (NACK) generated at a UE side.


In the method 300, layers can be added one by one. In some other embodiments, users can be added one by one instead of layers. In such embodiments, the number of transmission layer(s) per user can be pre-determined. Weights of users can be used for a weighted sum rate calculation in such embodiments. User weights can be determined a variety of ways. For example, a weight of a user can be inversely proportional to the user's previously experienced throughput, with or without a pre-configured sliding time window. As another example, a weight of a user can be inversely proportional to the number of time units (e.g., subframes or slots) the user has been scheduled during a pre-configured sliding time window with size Wp. FIG. 7 provides an illustration related to calculating a number of subframes a user is scheduled in during a sliding window. In certain applications, the number of time units when the user has successful transmissions (e.g., ACK) during the sliding time window is considered for determining the weight of the user.


Multi-Cluster Rate Selection


Single cluster user and rank selection algorithms can be extended to multiple clusters with coordination among the multiple clusters. When multiple clusters have wireless communications that overlap in frequency and time, inter-cluster interference nulling can be utilized to protect users from the interference from one or more other clusters. A single cluster user and rank selected algorithm is a low-complexity and robust layer and user selection algorithm. The single cluster user and rank selected algorithm can be denoted as lu-square in the following description. For illustrative purposes, multi-cluster rate selection may be discussed with reference to a 2 cluster scenario. Any suitable principles and advantages of multi-cluster rate selection disclosed herein can be applied to rate selection for 3 or more clusters.


Multi-cluster rate selection methods can include frequency allocation for a plurality of clusters, user and rank selection per cluster, and rate selection per user. The user and rank selection can identify a list of protected users in clusters. The rate selection per user can be based on user and rate selection for the cluster and the protected users identified by one or more other clusters.



FIG. 8 is a flow diagram of an example method 400 of multi-cluster user rate selection according to an embodiment. The method 400 can be performed at block 104 of the method 100 of FIG. 1A, for example.


At block 402, frequency can be allocated for a plurality of clusters. Frequency is allocated for two clusters in the method 400. The clusters can have frequency allocated by non-overlapping frequency division multiplexing (FDM). With FDM, there may be no significant inter-cluster interference and nulling may not be implemented. The clusters can have frequency allocated with completely or partially overlapping frequency. In this case, there can be inter-cluster interference and nulling can be implemented. Frequency allocation per cluster can be determined by one or more of a number of associated users per cluster, buffer occupancies per cluster, channel conditions per cluster, an estimated inter-cluster interference situation, or the like.


After frequency is allocated, user and rank selection can be performed per cluster. Rank can represent a number of layers or dimensions for wireless communication with a user. User and rank selection can be performed for a first cluster at block 404A. User and rank selection can be performed for a second cluster at block 404B. Lu-square can be used to select users and ranks at block 404A and/or 404B. Lu-square can be implemented in accordance with any suitable principles and advantages of the user and rank selection discussed with reference to FIG. 6. At block 406A, which users and/or layers to protect can be determined. The users and/or layers to protect can be within the first cluster. The users and/or layers to protect can be protected from the first cluster. Similarly, which users and/or layers to protect in the second cluster and/or to protect from the second cluster can be determined at block 406B. Which users and/or layers to protect can be determined based on a long-term signal interference ratio (SIR), such as SIRN and/or SINR.


In applications where nulling is not implemented, user and rank selection per cluster can be conducted independently for each cluster.


When nulling between clusters is implemented, lu-square can be applied for each cluster and which layers to protect can be determined. User and rank selection and determining users to protect can be performed in any suitable order.


In an embodiment, lu-square is applied first and then the protected layers inside the cluster are determined. In this case, no inter-cluster interference is considered in the WSR calculation of lu-square.


According to another embodiment, lu-square is applied first and then the layers outside the cluster to be protected from this cluster are determined. In this case, no inter-cluster interference is considered in the WSR calculation of lu-square.


In another embodiment, the protected layers are determined first and then lu-square is applied. In this case, inter-cluster interference can be considered in the WSR calculation of lu-square. The protected layers can be determined, for example, by long-term SINR and/or SIR or users' physical locations. The determined protected layers may or may not affect the layer candidate layers of lu-square, which is an input to lu-square. As an example, after determining the protected layers, only the layers that are ‘parallel’ to the protected layers in terms of the channels from the other cluster can be considered in certain applications. Accordingly, the interference from the other cluster to the non-protected layers can be reduced as well.


The considered inter-cluster interference can be short-term. Short term interference can be obtained based on large and small scale channel fadings and a (temporarily) calculated precoder. The considered inter-cluster interference can be long-term. Long term interference can be obtained based on one or more long-term channel conditions (e.g., RSRP). Both long term and short term inter-cluster interference can be considered in certain applications.


User and rank selection for the plurality of clusters can be conducted in parallel. User and rank selection for the plurality of clusters can be conducted in sequence. User rank and selection for the plurality of clusters can be performed partly in parallel and partly in sequence.


After user and rank selection, user rate selection can be performed for each selected user. Rate selection can involve determining Modulation and Coding Scheme (MCS) per user.


MCS selections of users can be conducted independently for each cluster. In this case, the selection in one cluster does not consider the interference from the other cluster(s).


Alternatively, MCS selections of users can be conducted jointly for the plurality of clusters. In this case, the selection in one cluster considers the interference from the other(s). In one embodiment, the considered inter-cluster interference is short-term. Short term inter-cluster interference can be obtained based on large and small scale channel fadings and the calculated precoder. In another embodiment, the considered inter-cluster interference is long-term. Long term inter-cluster interference can be obtained based on long-term channel conditions (e.g., RSRP).


In the method 400, precoder coefficients (e.g., regularized zero-forcing (RZF) precoder coefficients) can be calculated for the first cluster with nulling based on selected users in the first cluster and protected users and/or layers in one or more other clusters (e.g., the second cluster) at block 408A. Then equivalent channels to the protected users in the one or more clusters can be calculated at block 410A. User rate for users in the first cluster can be selected accounting for inter-cluster interference at block 412A. For example, MCS can be selected for each user in the first cluster based on effective SINR per UE taking into account inter-cluster interference.


Precoder coefficients (e.g., RZF precoder coefficients) can be calculated for the second cluster with nulling based on selected users in the second cluster and protected users and/or layers in one or more other clusters (e.g., the first cluster) at block 408B. Then equivalent channels to the protected users in the one or more clusters can be calculated at block 410B. User rate for users in the second cluster can be selected accounting for inter-cluster interference at block 412B. For example, MCS can be selected for each user in the second cluster based on effective SINR per UE taking into account inter-cluster interference.



FIG. 9 is a flow diagram of an example method 420 of multi-cluster user rate selection according to an embodiment. The method 420 can be performed at block 104 of the method 100 of FIG. 1A, for example. In the method 420, a plurality of other clusters can be considered when determining protected users and/or layers. Two other clusters can also be considered for nulling and/or accounting for inter-cluster interference. Any suitable principles and advantages discussed above for multi-cluster rate selection can be applied to multi-cluster rate selection with three or more clusters.


Frequency can be allocated for three clusters at block 422. User and rank selection can be performed per cluster at blocks 404A, 404B, and 404C. Lu-square can be used to select users and ranks at blocks 404A, 404B, and 404C.


Users and/or layers from a plurality of clusters to protect from another cluster can be determined. Which users and/or layers to protect can be determined based on a long-term signal interference ratio (SIR), such as SIRN and/or SINR. At block 426A, which users and/or layers to protect in the second and third clusters from the first cluster can be determined. Similarly, which users and/or layers to protect in the first and third clusters from the second cluster can be determined at block 426B. Users and/or layers to protect in the first and second clusters from the third cluster can be determined at block 426C.


Precoder coefficients (e.g., RZF precoder coefficients) can be calculated for a cluster with nulling based on selected users in the cluster and protected users and/or layers in one or more other at blocks 428A, 428B, 428C. Equivalent channels to the protected users in the other clusters can be calculated at blocks 430A, 430B, 430C. User rate for users in a cluster can be selected accounting for inter-cluster interference at blocks 432A, 432B, 432C. For example, MCS can be selected for each user in the cluster based on effective SINR per UE taking into account inter-cluster interference.


Although some in some descriptions, nulling is considered in terms of layers (e.g., determining which layers to protect), any suitable principles and advantages of nulling disclosed herein can be applied to scenarios where nulling is considered in terms of users (e.g., determining which users to protect). When nulling is applied per user, the number of layers to protect per user can be pre-determined.


Long Term Received Signal Indication


Clustering and user rate selection methods can involve an association of a UE with a best serving RRU. The best serving RRU can have the largest received signal power at the UE. The best serving RRU can be referred to as a SAS RRU. The largest received signal power at the UE in a traditional cell layout can be known as downlink (DL) Reference Signal Received Power (RSRP). DL RSRP can be measured at the UE from a DL reference signal (RS). Examples of DL RS include CRS in LTE, SSS in NR, and CSI-RS in NR.


In a distributed MIMO system, a common RS may be jointly transmitted or broadcast by all active RRUs. In such a case, it can be difficult to determine RSRP between a UE and a particular RRU from SSS. For CSI-RS, it is possible to determine RSRP between an RRU and a particular UE if each RRU transmits a unique CSI-RS. As a consequence, the number of CSI-RS resources can scale with the number of RRUs in the deployment. However, this may not be a scalable solution because the number of CSI-RS resources that a UE supports is a UE capability and the UE can be configured with CSI-RS resources for multiple purposes (e.g., beam management, CSI reporting, tracking).


A technical solution is to determine long term RSRP between a UE and RRU from Sounding Reference Signal (SRS) measurements. The technical solution can be implemented with any of the clustering and/or rate selection methods disclosed herein.


As shown in FIG. 10, a UE 502 can transmit a SRS that is received at each RRU 504A, 504B, 504C, 504D. A 1-port SRS transmission from a UE can be utilized. Alternatively, a multi-port SRS transmission from a UE can be utilized. Long term RSRP can be computed from SRS transmission.


For antenna j on RRU b, and antenna i on UE j, a representative SRS channel estimate at a frequency domain resource element (RE) kn can be selected from a set of contiguous SRS REs where the size of the set is at least 1. The number of SRS REs used for the computing RSRP is M. Instantaneous uplink (UL) RSRP between UE u and RRU b at SRS occasion t can be represented by the following equation:








P

b
,
u




(
t
)


=


1

M
·

N
r





Σ
j






n
=
1

M













H
^



b
j

,

u
i





(

k
n

)




2

.








In this equation Nr is a number of antennas at RRU b. Long term RSRP can be obtained by filtering to average out small scale channel fades: Pb,u(t)=βPb,u(t−1)+(1−β)Pb,u(t), in which β a forgetting factor selected to satisfy a desired averaging length. FIG. 11 is a diagram related to long term RSRP calculation. Ĥbj,ui(kn) is denoted in FIG. 11.


In another embodiment, the instantaneous RSRP can be calculated based on time domain channel estimates. The time domain channel estimate for antenna j on RRU b, and antenna i on UE j can be {tilde over (h)}bj,ui(l). The instantaneous uplink (UL) RSRP between UE u and RRU b at SRS occasion t can be represented by the following equation:

Pb,u(t)=ΣjΣl=1L|{tilde over (h)}bj,ui(l)|2.

Network Systems


A network system can be configured to perform clustering and/or user rate selection in accordance with any suitable principles and advantages disclosed herein. The network system can schedule wireless communications between UEs and network nodes, such as RRUs. The network system can cause downlink wireless transmissions from network nodes to UEs based on clustering and/or rate selection. The network system can exchange MIMO information with UEs. The MIMO information can be exchanged using time division duplex (TDD) MIMO communications in some embodiments.


Network systems can include network nodes (e.g., RRUs) and one or more processing units. The one or more processing units can include any suitable physical hardware to perform any of the methods disclosed herein. For example, the one or more processing units can each include at least one processor and store instructions that when executed by the processor cause a method in accordance with any suitable principles and advantages disclosed herein to be performed. The one or more processors can manage communications between the network system and UEs and/or network nodes. For example, the one or more processors can schedule traffic and cause control information to be sent to UEs. The one or more processors can include a processor configured with specific executable instructions, a microprocessor, a microcontroller, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a programmable logic device such as field programmable gate array (FPGA), the like, or any combination thereof designed to perform any suitable combination of the functions described herein. The one or more processors can be implemented by any suitable combination of computing devices and/or discrete processing circuits in certain applications. The one or more processing units can be programmed to perform a method with any suitable combination of features disclosed herein. The one or more processing units can perform baseband processing. Such processing units can be referred to as baseband processing units. The one or more processing units can include one or more DUs.


Examples diagrams of parts of network systems will be described with reference to FIGS. 12 to 14. These network systems include one or more DUs that can implement any suitable features of a DU defined by a NR specification. Any suitable combination of features of the DUs of FIGS. 12 to 14 can be implemented together with each other. These network systems can operate in any suitable number environment, such as the example network environment 110 of FIG. 1B. The network system can include a plurality or RRUs having antennas for wireless communication with UEs. The network system can implement any suitable clustering and/or user rate selection algorithms disclosed herein.



FIG. 12 is a schematic block diagram illustrating part of a network system for clustering. A first DU 602 and a second DU 604 can perform clustering in accordance with any suitable principles and advantages disclosed herein. The first DU 602 includes a DU scheduler 612 configured to form a first cluster and a second cluster. The first DU 602 can be in communication with RRUs of the first and second clusters. The second DU 604 includes a DU scheduler 614 configured to form a third cluster and a fourth cluster. The second DU 604 can be in communication with RRUs of the third and fourth clusters. The first DU 602 and the second DU 604 can exchange inter DU RSRP and/or other inter DU information. Accordingly, the DU schedulers 612 and 614 can perform clustering with intra and inter DU RSRP. When there are a relatively large number of RRUs, two or more DUs can implement clustering.



FIG. 13 is a schematic block diagram illustrating part of a network system for clustering. In FIG. 13, clustering is implemented by a single DU. A DU 622 can perform clustering in accordance with any suitable principles and advantages disclosed herein. The DU 622 includes a DU scheduler 632 configured to form a first cluster and a second cluster. The DU scheduler 632 can perform clustering with intra DU RSRP.



FIG. 14 is a schematic block diagram illustrating part of a network system for user rate selection. A DU 642 can perform user rate selection in accordance with any suitable principles and advantages disclosed herein. The DU 642 includes a DU scheduler 652 can select users, user rank, and user rate (e.g., MCS). For performing user rate selection, the DU scheduler 652 can have (a) RSRP and channel state information (CSI) between RRU and UE pairs associated with the DU 642 and (b) user candidates generated by clustering. The DU 642 can include media access control (MAC) blocks 654 and 656. Each MAC block 654, 656 can control MAC functions for a respective cluster with the exception of the user rate selection features performed by the DU scheduler 652 (e.g., user selection, user rank, user rate).


Terminology and Conclusion


Depending on the embodiment, certain acts, events, or functions of any of the processes or algorithms described herein can be performed in a different sequence, can be added, merged, or left out altogether (e.g., not all described operations or events are necessary for the practice of the process or algorithm). Moreover, in certain embodiments, operations, or events can be performed concurrently, e.g., through multi-threaded processing, interrupt processing, or multiple processors or processor cores or on other parallel architectures, rather than sequentially. Any suitable combination of parallel and/or sequential execution of a method disclosed herein can be performed.


Conditional language used herein, such as, among others, “can,” “could,” “might,” “may,” “e.g.,” “such as,” and the like, unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements, and/or operations. Thus, such conditional language is not generally intended to imply that features, elements, and/or operations are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without other input or prompting, whether these features, elements, and/or steps are included or are to be performed in any particular embodiment. The terms “comprising,” “including,” and the like are synonymous and are used inclusively, in an open-ended fashion, and do not exclude additional elements, features, acts, operations, and so forth. Additionally, the words “herein,” “above,” “below,” and words of similar import, when used in this application, shall refer to this application as a whole and not to any particular portions of this application. Where the context permits, words in the above Detailed Description of Certain Embodiments using the singular or plural may also include the plural or singular, respectively. Also, the term “or” is used in its inclusive sense (and not in its exclusive sense) so that when used, for example, to connect a list of elements, the term “or” means one, some, or all of the elements in the list.


Disjunctive language such as the phrase “at least one of X, Y, Z,” unless specifically stated otherwise, is otherwise understood with the context as used in general to present that an item, term, etc., may be either X, Y, or Z, or any combination thereof (e.g., X, Y, and/or Z). Thus, such disjunctive language is not generally intended to, and should not, imply that certain embodiments require at least one of X, at least one of Y, or at least one of Z to each be present.


Unless otherwise explicitly stated or generally understood from context, articles such as “a” or “an” should generally be interpreted to include one or more described items. Accordingly, phrases such as “a device configured to” are intended to include one or more recited devices. Such one or more recited devices can also be collectively configured to carry out the stated recitations. For example, “a processor configured to carry out recitations A, B and C” can include a first processor configured to carry out recitation A working in conjunction with a second processor configured to carry out recitations B and C.


The word “coupled,” as generally used herein, refers to two or more elements that may be either directly coupled to each other, or coupled by way of one or more intermediate elements. Likewise, the word “connected,” as generally used herein, refers to two or more elements that may be either directly connected, or connected by way of one or more intermediate elements. Connections can be via an air interface and/or via wires and/or via optical fiber and/or via any other suitable connection.


As used herein, the terms “determine” or “determining” encompass a wide variety of actions. For example, “determining” may include calculating, computing, processing, deriving, generating, obtaining, looking up (e.g., looking up in a table, a database or another data structure), ascertaining and the like via a hardware element without user intervention. Also, “determining” may include receiving (e.g., receiving information), accessing (e.g., accessing data in a memory) and the like via a hardware element without user intervention. Also, “determining” may include resolving, selecting, choosing, establishing, and the like via a hardware element without user intervention.


While the above detailed description has shown, described, and pointed out novel features as applied to various embodiments, it can be understood that various omissions, substitutions, and changes in the form and details of the devices or algorithms illustrated can be made without departing from the spirit of the disclosure. For example, circuit blocks and/or method blocks described herein may be deleted, moved, added, subdivided, combined, arranged in a different order, and/or modified. Each of these blocks may be implemented in a variety of different ways. Any portion of any of the methods disclosed herein can be performed in association with specific instructions stored on a non-transitory computer readable storage medium being executed by one or more processors. As can be recognized, certain embodiments described herein can be embodied within a form that does not provide all of the features and benefits set forth herein, as some features can be used or practiced separately from others. The scope of certain embodiments disclosed herein is indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.

Claims
  • 1. A method of multi-cluster user equipment selection and precoding coefficient determination, the method comprising: selecting first user equipments and associated first ranks for a first cluster that includes the first user equipments and first network nodes;selecting second user equipments and associated second ranks for a second cluster that includes the second user equipments and second network nodes;allocating frequency and time resources to the first cluster and the second cluster prior to the selecting the first user equipments and associated ranks;determining one or more user equipments of the second user equipments to protect;computing precoding coefficients for the first cluster with nulling based on the one or more user equipments of the second user equipments to protect; andcausing wireless transmission from the first network nodes to the first user equipments using the precoding coefficients.
  • 2. The method of claim 1, wherein the first network nodes comprise first remote radio units, and the second network nodes comprise second remote radio units.
  • 3. The method of claim 1, further comprising performing rate selection for the first user equipments, and performing rate selection for the second user equipments.
  • 4. The method of claim 3, wherein the performing rate selection for the first user equipments is independent of the performing rate selection for the second user equipments.
  • 5. The method of claim 3, wherein the performing rate selection for the first user equipments accounts for interference from the second cluster.
  • 6. The method of claim 1, further comprising computing interference from the first cluster based on channel fadings and a calculated precoder coefficient.
  • 7. The method of claim 5, wherein the interference from the second cluster is associated with long term channel conditions.
  • 8. The method of claim 1, wherein the selecting the first user equipments accounts for interference from another cluster.
  • 9. A method of clustering user equipments and computing precoding coefficients, the method comprising: selecting first user equipments and associated first ranks for a first cluster that includes the first user equipments and first network nodes, wherein the selecting the first user equipments comprises: estimating a Sounding Reference Signal channel estimate between an antenna of a user equipment of the first user equipments and an antenna of a network node of the first network nodes; andcomputing an average of squared channel estimates of all antennas of the first network nodes and the antenna of the user equipment of the first user equipments, wherein the selecting the first user equipment is based on the average of squared channel estimates;selecting second user equipments and associated second ranks for a second cluster that includes the second user equipments and second network nodes:determining one or more user equipments of the second user equipments to protect;computing precoding coefficients for the first cluster with nulling based on the one or more user equipments of the second user equipments to protect; andcausing wireless transmission from the first network nodes to the first user equipments using the precoding coefficients.
  • 10. The method of claim 9, further comprising allocating frequency and time resources to the first cluster and the second cluster prior to the selecting the first user equipments and associated ranks.
  • 11. The method of claim 9, wherein the first network nodes comprise first remote radio units, and the second network nodes comprise remote radio units.
  • 12. The method of claim 9, further comprising performing rate selection for the first user equipments, and performing rate selection for the second user equipments.
  • 13. The method of claim 12, wherein the performing rate selection for the first user equipments is independent of the performing rate selection for the second user equipments.
  • 14. The method of claim 12, wherein the performing rate selection for the first user equipments accounts for interference from the second cluster.
  • 15. The method of claim 14, wherein the interference from the second cluster is associated with long term channel conditions.
  • 16. The method of claim 9, further comprising computing interference from the first cluster based on channel fadings and a calculated precoder coefficient.
  • 17. The method of claim 9, wherein the selecting the first user equipments accounts for interference from another cluster.
  • 18. Non-transitory computer-readable storage comprising computer-executable instructions that, when executed by one or more processors, cause the method of claim 1 to be performed.
  • 19. One or more baseband processing units in communication with network nodes, the one or more baseband processing units comprising at least one processor and a memory storing instructions that when executed by the at least one processor cause a method to be performed, the method comprising: selecting first user equipments and associated first ranks for a first cluster that includes the first user equipments and first network nodes;selecting second user equipments and associated second ranks for a second cluster that includes the second user equipments and second network nodes;allocating frequency and time resources to the first cluster and the second cluster prior to the selecting the first user equipments and associated ranks;determining one or more user equipments of the second user equipments to protect;computing precoding coefficients for the first cluster with nulling based on the one or more user equipments of the second user equipments to protect; andcausing wireless transmission from the first network nodes to the first user equipments using the precoding coefficients.
  • 20. A network system comprising: the one or more baseband processing units of claim 19; andnetwork nodes in communication with the one or more baseband processing units, the network nodes configured to wirelessly exchange information with user equipments, and the network nodes comprising the first network nodes and the second network nodes.
CROSS REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of priority of U.S. Provisional Patent Application No. 63/108,170, filed Oct. 30, 2020 and titled “CLUSTERING AND/OR RATE SELECTION IN MULTIPLE-INPUT MULTIPLE OUTPUT COMMUNICATION SYSTEMS,” the disclosure of which is hereby incorporated by reference herein in its entirety and for all purposes. The present disclosure relates to U.S. Patent Application No. 17,452,644, filed on even date herewith and titled “CLUSTERING IN MULTIPLE-INPUT MULTIPLE OUTPUT COMMUNICATION SYSTEMS,” the disclosure of which is hereby incorporated by reference herein in its entirety and for all purposes.

US Referenced Citations (1035)
Number Name Date Kind
6636568 Kadous Oct 2003 B2
6801580 Kadous Oct 2004 B2
6873606 Agrawal Mar 2005 B2
6917821 Kadous Jul 2005 B2
6928062 Krishnan Aug 2005 B2
7012883 Jalali Mar 2006 B2
7020073 Kadous Mar 2006 B2
7039001 Krishnan May 2006 B2
7042857 Krishnan May 2006 B2
7095790 Krishnan Aug 2006 B2
7145940 Gore Dec 2006 B2
7167684 Kadous Jan 2007 B2
7177351 Kadous Feb 2007 B2
7184713 Kadous Feb 2007 B2
7194041 Kadous Mar 2007 B2
7236535 Subramaniam Jun 2007 B2
7418046 Gore Aug 2008 B2
7428269 Sampath Sep 2008 B2
7457639 Subramaniam Nov 2008 B2
7463576 Krishnan Dec 2008 B2
7477693 Subramaniam Jan 2009 B2
7508748 Kadous Mar 2009 B2
7567621 Sampath Jul 2009 B2
7606326 Krishnan Oct 2009 B2
7668125 Kadous Feb 2010 B2
7675886 Agrawal Mar 2010 B2
7725799 Walker May 2010 B2
7890144 Subramaniam Feb 2011 B2
7903615 Gorokhov Mar 2011 B2
7940663 Kadous May 2011 B2
7948959 Wang May 2011 B2
7974359 Gorokhov Jul 2011 B2
8014331 Sarkar Sep 2011 B2
8073068 Kim Dec 2011 B2
8077654 Sutivong Dec 2011 B2
8077691 Kadous Dec 2011 B2
8098635 Montojo Jan 2012 B2
8107517 Naguib Jan 2012 B2
8139672 Gore Mar 2012 B2
8204470 Onggosanusi et al. Jun 2012 B2
8204530 Gorokhov Jun 2012 B2
8229423 Sarkar Jul 2012 B2
8250428 Sun Aug 2012 B2
8259637 Bertrand et al. Sep 2012 B2
8305965 Shen et al. Nov 2012 B2
8306096 Sampath Nov 2012 B2
8331310 Wang Dec 2012 B2
8331892 Kadous Dec 2012 B2
8340605 Hou Dec 2012 B2
8351456 Kadous Jan 2013 B2
8379705 Mallik Feb 2013 B2
8380240 Muharemovic et al. Feb 2013 B2
8385433 Wang Feb 2013 B2
8385465 Kadous Feb 2013 B2
8391196 Gorokhov Mar 2013 B2
8391413 Mantravadi Mar 2013 B2
8432821 Gorokhov Apr 2013 B2
8443255 Jiang May 2013 B2
8451740 Sampath May 2013 B2
8451776 Dayal May 2013 B2
8457152 Gorokhov Jun 2013 B2
8457221 Palanki Jun 2013 B2
8462859 Sampath Jun 2013 B2
8493958 Attar Jul 2013 B2
8498192 Bhushan Jul 2013 B2
8498647 Gorokhov Jul 2013 B2
8514738 Chandrasekhar et al. Aug 2013 B2
8526347 Wang Sep 2013 B2
8576742 Yoo Nov 2013 B2
8576760 Gorokhov Nov 2013 B2
8588801 Gorokhov Nov 2013 B2
8605729 Dayal Dec 2013 B2
8605839 Jiang Dec 2013 B2
8614981 Mallik Dec 2013 B2
8619717 Agrawal Dec 2013 B2
8634435 Kadous Jan 2014 B2
8639190 Gore Jan 2014 B2
8640012 Ling Jan 2014 B2
8654705 Wang Feb 2014 B2
8654715 Wang Feb 2014 B2
8655400 Kadous Feb 2014 B2
8675511 Gorokhov Mar 2014 B2
8675560 Yoo Mar 2014 B2
8676209 Gorokhov Mar 2014 B2
8724545 Dayal May 2014 B2
8724555 Krishnan May 2014 B2
8737470 Walker May 2014 B2
8760994 Wang Jun 2014 B2
8761062 Chandrasekhar et al. Jun 2014 B2
8767641 Chen et al. Jul 2014 B2
8767885 Sampath Jul 2014 B2
8781005 Mallik Jul 2014 B2
8787183 Mallik Jul 2014 B2
8812657 Mallik Aug 2014 B2
8817924 Mallik Aug 2014 B2
8825860 Linsky Sep 2014 B2
8830934 Banister Sep 2014 B2
8842693 Agrawal Sep 2014 B2
8848607 Wang Sep 2014 B2
8855000 Mallik Oct 2014 B2
8855001 Gorokhov Oct 2014 B2
8874998 Walker Oct 2014 B2
8879445 Sadek Nov 2014 B2
8885744 Kadous Nov 2014 B2
8886126 Mantravadi Nov 2014 B2
8886239 Dayal Nov 2014 B2
8897181 Wang Nov 2014 B2
8897220 Kadous Nov 2014 B2
8903021 Mantravadi Dec 2014 B2
8908496 Kadous Dec 2014 B2
8923109 Wang Dec 2014 B2
8923208 Dayal Dec 2014 B2
8954063 Sarkar Feb 2015 B2
8971461 Sampath Mar 2015 B2
8971823 Gore Mar 2015 B2
8976662 Somasundaram Mar 2015 B2
8982832 Ling Mar 2015 B2
9001641 Bertrand et al. Apr 2015 B2
9001756 Chen et al. Apr 2015 B2
9036538 Palanki May 2015 B2
9071315 Huang Jun 2015 B2
9084242 Chen et al. Jul 2015 B2
9088389 Gorokhov Jul 2015 B2
9106287 Wang Aug 2015 B2
9107056 Damnjanovic Aug 2015 B2
9113488 Oguz Aug 2015 B2
9136953 Yoo Sep 2015 B2
9136974 Gorokhov Sep 2015 B2
9143957 Sadek Sep 2015 B2
9144036 Gorokhov Sep 2015 B2
9144084 Sadek Sep 2015 B2
9148256 Sampath Sep 2015 B2
9154179 Gudem Oct 2015 B2
9154211 Sampath Oct 2015 B2
9154277 Ekpenyong et al. Oct 2015 B2
9155106 Krishnan Oct 2015 B2
9161232 Linsky Oct 2015 B2
9161233 Wang Oct 2015 B2
9172402 Gudem Oct 2015 B2
9172453 Wang Oct 2015 B2
9179319 Gore Nov 2015 B2
9184870 Sampath Nov 2015 B2
9185718 Kadous Nov 2015 B2
9185720 Mantravadi Nov 2015 B2
9210605 Yoo Dec 2015 B2
9226173 Sadek Dec 2015 B2
9231666 Muharemovic et al. Jan 2016 B2
9237434 Mallik Jan 2016 B2
9246560 Sampath Jan 2016 B2
9253658 Sadek Feb 2016 B2
9264183 Gorokhov Feb 2016 B2
9265047 Mallik Feb 2016 B2
9270441 Mallik Feb 2016 B2
9277564 Wang Mar 2016 B2
9282462 Dayal Mar 2016 B2
9307544 Gore Apr 2016 B2
9319928 Bertrand et al. Apr 2016 B2
9351307 Luo May 2016 B2
9398602 Kadous Jul 2016 B2
9401748 Chen et al. Jul 2016 B2
9408220 Gore Aug 2016 B2
9413509 Chen et al. Aug 2016 B2
9451480 Huang Sep 2016 B2
9461736 Bhushan Oct 2016 B2
9473219 Muharemovic et al. Oct 2016 B2
9474051 John Wilson Oct 2016 B2
9474075 Yavuz Oct 2016 B2
9485069 Wang Nov 2016 B2
9497765 Yoo Nov 2016 B2
9521554 Farajidana Dec 2016 B2
9532230 Bendlin et al. Dec 2016 B2
9571250 Chen et al. Feb 2017 B2
9578649 Dayal Feb 2017 B2
9585156 Bhattad Feb 2017 B2
9603040 Chandrasekhar et al. Mar 2017 B2
9603141 Chen et al. Mar 2017 B2
9628311 Bertrand et al. Apr 2017 B2
9660776 Kadous May 2017 B2
9667397 Chen et al. May 2017 B2
9673948 Jiang Jun 2017 B2
9680522 Ekpenyong et al. Jun 2017 B2
9693323 Mallik Jun 2017 B2
9706568 Ekpenyong Jul 2017 B2
9750014 Sadek Aug 2017 B2
9755705 Hou Sep 2017 B2
9762372 Ekpenyong et al. Sep 2017 B2
9780847 Budianu Oct 2017 B2
9781693 Ji Oct 2017 B2
9788361 Valliappan Oct 2017 B2
9813497 Mallik Nov 2017 B2
9814040 Bhushan Nov 2017 B2
9814058 Jiang Nov 2017 B2
9819471 Chen et al. Nov 2017 B2
9825798 Sun Nov 2017 B1
9832785 Kadous Nov 2017 B2
9847862 Soriaga Dec 2017 B2
9860033 Kadous Jan 2018 B2
9867194 Kadous Jan 2018 B2
9877203 Yoo Jan 2018 B2
9877230 Chen et al. Jan 2018 B2
9882623 Sun Jan 2018 B2
9888389 Bendlin et al. Feb 2018 B2
9894701 Ang Feb 2018 B2
9900074 Mallik Feb 2018 B2
9923690 Ekpenyong Mar 2018 B2
9924368 Valliappan Mar 2018 B2
9929812 Manolakos Mar 2018 B2
9929835 Dabeer Mar 2018 B2
9936400 Lee Apr 2018 B2
9936469 Ji Apr 2018 B2
9936498 Azarian Apr 2018 B2
9936519 Mukkavilli Apr 2018 B2
9942801 Yerramalli Apr 2018 B2
9954668 Lee Apr 2018 B2
9955365 Lin Apr 2018 B2
9955497 Jiang Apr 2018 B2
9961579 Geirhofer May 2018 B2
9967070 Jiang May 2018 B2
9967729 Wang May 2018 B2
9973923 Damnjanovic May 2018 B2
9974093 Lin May 2018 B2
9979450 Jiang May 2018 B2
9980271 Soriaga May 2018 B2
9985802 Jiang May 2018 B2
9991989 Malladi Jun 2018 B2
9992004 Mallik Jun 2018 B2
9992790 Jiang Jun 2018 B2
10009053 Somasundaram Jun 2018 B2
10009160 Jiang Jun 2018 B2
10009912 Abraham Jun 2018 B2
10020911 Mallik Jul 2018 B2
10021677 Mallik Jul 2018 B2
10027462 Jiang Jul 2018 B2
10028240 Ji Jul 2018 B2
10028332 Mallik Jul 2018 B2
10033558 Yoo Jul 2018 B2
10033577 Soriaga Jul 2018 B2
10033578 Soriaga Jul 2018 B2
10034269 Sun Jul 2018 B2
10038528 Jiang Jul 2018 B2
10038544 Zeng Jul 2018 B2
10044438 Kadous Aug 2018 B2
10044459 Chendamarai Kannan Aug 2018 B2
10057019 Jiang Aug 2018 B2
10075187 Jiang Sep 2018 B2
10075194 Lin Sep 2018 B2
10075271 Soriaga Sep 2018 B2
10075970 Jiang Sep 2018 B2
10080214 Lin Sep 2018 B2
10084563 Park Sep 2018 B2
10084578 Azarian Yazdi Sep 2018 B2
10085283 Yoo Sep 2018 B2
10091789 Valliappan Oct 2018 B2
10091810 Zeng Oct 2018 B2
10097260 Hosseini Oct 2018 B2
10098059 Ly Oct 2018 B2
10098140 Mallik Oct 2018 B2
10104616 Ang Oct 2018 B2
10104624 Sundararajan Oct 2018 B2
10122559 Manolakos Nov 2018 B2
10123219 Bhushan Nov 2018 B2
10123323 Mallik Nov 2018 B2
10135591 Chen Nov 2018 B2
10136333 Yoo Nov 2018 B2
10136452 Liu Nov 2018 B2
10141991 Jiang Nov 2018 B2
10142060 Xu Nov 2018 B2
10143005 Chendamarai Kannan Nov 2018 B2
10149293 Damnjanovic Dec 2018 B2
10149318 Sun Dec 2018 B2
10158393 Ekpenyong et al. Dec 2018 B2
10159097 Ji Dec 2018 B2
10172063 Balmakhtar et al. Jan 2019 B1
10177826 Manolakos Jan 2019 B2
10178649 Liu Jan 2019 B2
10182404 Prakash Jan 2019 B2
10182426 Ji Jan 2019 B2
10187900 Zhang Jan 2019 B2
10200140 Li Feb 2019 B2
10200904 Zhang Feb 2019 B2
10200994 Park Feb 2019 B2
10201014 Kadous Feb 2019 B2
10205618 Wang Feb 2019 B2
10206117 Damnjanovic Feb 2019 B2
10206181 Ekpenyong et al. Feb 2019 B2
10218406 Liu Feb 2019 B2
10219235 Patel Feb 2019 B2
10219252 Chendamarai Kannan Feb 2019 B2
10219292 Damnjanovic Feb 2019 B2
10219300 Gorokhov Feb 2019 B2
10224966 Li Mar 2019 B2
10225065 Ang Mar 2019 B2
10225818 Liu Mar 2019 B2
10230502 Ji Mar 2019 B2
10231131 Zhang Mar 2019 B2
10231132 Zhang Mar 2019 B2
10231259 Lin Mar 2019 B2
10237030 Azarian Yazdi Mar 2019 B2
10237037 Jiang Mar 2019 B2
10237889 Sundararajan Mar 2019 B2
10244399 Damnjanovic Mar 2019 B2
10250678 Mallik Apr 2019 B2
10257844 Yang Apr 2019 B2
10257848 Sun Apr 2019 B2
10257851 Patel Apr 2019 B2
10263745 Soriaga Apr 2019 B2
10263754 Lin Apr 2019 B2
10264541 Patel Apr 2019 B2
10270562 Yang Apr 2019 B2
10270579 Chendamarai Kannan Apr 2019 B2
10278177 Sadek Apr 2019 B2
10285117 Yoo May 2019 B2
10285189 Sundararajan May 2019 B2
10291372 Azarian May 2019 B2
10291379 Kadous May 2019 B2
10292093 Chendamarai Kannan May 2019 B2
10298289 Yerramalli May 2019 B2
10298434 Manolakos May 2019 B2
10299284 Sadek May 2019 B2
10312987 Mallik Jun 2019 B2
10312993 Rupasinghe Jun 2019 B2
10313160 Jiang Jun 2019 B2
10313851 Blasco Serrano et al. Jun 2019 B2
10314065 Yang Jun 2019 B2
10320428 Sarkis Jun 2019 B2
10327241 Kadous Jun 2019 B2
10327261 Naghshvar Jun 2019 B2
10333595 Fakoorian Jun 2019 B2
10333668 Yoo Jun 2019 B2
10333752 Jiang Jun 2019 B2
10334450 Bendlin et al. Jun 2019 B2
10334546 Chendamarai Kannan Jun 2019 B2
10334594 Sundararajan Jun 2019 B2
10341884 Sun Jul 2019 B2
10341976 Ji Jul 2019 B2
10342012 Mukkavilli Jul 2019 B2
10348329 Soriaga Jul 2019 B2
10348432 Chen et al. Jul 2019 B2
10349404 Chendamarai Kannan Jul 2019 B2
10355803 Manolakos Jul 2019 B2
10356626 Montojo Jul 2019 B2
10356800 Manolakos Jul 2019 B2
10356811 Luo Jul 2019 B2
10356816 Valliappan Jul 2019 B2
10362574 Chendamarai Kannan Jul 2019 B2
10367621 Jiang Jul 2019 B2
10368301 Chendamarai Kannan Jul 2019 B2
10368305 Radulescu Jul 2019 B2
10368348 Chendamarai Kannan Jul 2019 B2
10368372 Chendamarai Kannan Jul 2019 B2
10374777 Kadous Aug 2019 B2
10375711 Sadek Aug 2019 B2
10375718 Manolakos Aug 2019 B2
10382177 Jiang Aug 2019 B2
10382233 Abdelghaffar Aug 2019 B2
10389479 Yoo Aug 2019 B2
10389503 Soriaga Aug 2019 B2
10389504 Soriaga Aug 2019 B2
10390361 Mukkavilli Aug 2019 B2
10390362 Gupta Aug 2019 B2
10396962 Li Aug 2019 B2
10397754 Vajapeyam Aug 2019 B2
10397796 Sun Aug 2019 B2
10404332 Ji Sep 2019 B2
10404340 Manolakos Sep 2019 B2
10404434 Kannan Sep 2019 B2
10404442 Chen et al. Sep 2019 B2
10404509 Sun Sep 2019 B2
10405228 Liu Sep 2019 B2
10405242 Kadous Sep 2019 B2
10405262 Chendamarai Kannan Sep 2019 B2
10405278 Ang Sep 2019 B2
10405335 Barghi Sep 2019 B2
10411782 Namgoong Sep 2019 B2
10411795 Liu Sep 2019 B2
10412632 Li Sep 2019 B2
10412704 Sun Sep 2019 B2
10412719 Chen Sep 2019 B2
10412733 Sun Sep 2019 B2
10412760 Ekpenyong Sep 2019 B2
10419171 Park Sep 2019 B2
10419244 Jiang Sep 2019 B2
10425824 Li Sep 2019 B2
10425826 Fakoorian Sep 2019 B2
10425923 Wang Sep 2019 B2
10425945 Sun Sep 2019 B2
10432357 Yang Oct 2019 B2
10433159 Ekpenyong et al. Oct 2019 B2
10433179 Zhang Oct 2019 B2
10440657 Sundararajan Oct 2019 B2
10440726 Jiang Oct 2019 B2
10440729 Li Oct 2019 B2
10447426 Sundararajan Oct 2019 B2
10447447 Namgoong Oct 2019 B2
10448296 Radulescu Oct 2019 B2
10448380 Islam Oct 2019 B2
10454541 Sundararajan Oct 2019 B2
10455455 Yoo Oct 2019 B2
10455457 Sadek Oct 2019 B2
10461797 Liu Oct 2019 B2
10461889 Park Oct 2019 B2
10461891 Park Oct 2019 B2
10461976 Chen Oct 2019 B2
10462676 Mallik Oct 2019 B2
10469203 Sankar Nov 2019 B2
10470048 Zhang Nov 2019 B2
10470112 Damnjanovic Nov 2019 B2
10476641 Yang Nov 2019 B2
10476650 Yang Nov 2019 B2
10476781 Luo Nov 2019 B2
10477437 Zhang Nov 2019 B2
10477466 Ly Nov 2019 B2
10477526 Chendamarai Kannan Nov 2019 B2
10484054 Sundararajan Nov 2019 B2
10484129 Jiang Nov 2019 B2
10484135 Mallik Nov 2019 B2
10484146 Sun Nov 2019 B2
10484212 Yoo Nov 2019 B2
10484878 Patel Nov 2019 B2
10484934 Malik Nov 2019 B2
10484935 Li Nov 2019 B2
10484954 Liu Nov 2019 B2
10484959 Liu Nov 2019 B2
10484972 Lin Nov 2019 B2
10484992 Sadek Nov 2019 B2
10485016 Zeng Nov 2019 B2
10485019 Ekpenyong Nov 2019 B2
10485027 Mallik Nov 2019 B2
10492181 Jiang Nov 2019 B2
10492220 Sun Nov 2019 B2
10498503 Tavildar Dec 2019 B2
10499393 Mukkavilli Dec 2019 B2
10499394 Damnjanovic Dec 2019 B2
10505701 Ang Dec 2019 B2
10506573 Chen et al. Dec 2019 B2
10506629 Sun et al. Dec 2019 B2
10511399 Sun et al. Dec 2019 B2
10511987 Liu et al. Dec 2019 B2
10512098 Jiang Dec 2019 B2
10516618 Barghi et al. Dec 2019 B2
10523300 Malik et al. Dec 2019 B2
10523369 Yang Dec 2019 B2
10524257 Li Dec 2019 B2
10524259 Azarian Yazdi Dec 2019 B2
10524278 Abraham Dec 2019 B2
10524279 Yoo Dec 2019 B2
10536195 Sun Jan 2020 B2
10536944 Zhang Jan 2020 B2
10536966 Liu et al. Jan 2020 B2
10541780 Mukkavilli Jan 2020 B2
10541791 Ji Jan 2020 B2
10541851 Malik et al. Jan 2020 B2
10542436 Liu et al. Jan 2020 B2
10542541 Valliappan et al. Jan 2020 B2
10542543 Yerramalli et al. Jan 2020 B2
10542556 Mallik Jan 2020 B2
10547402 Li Jan 2020 B2
10547415 Jiang Jan 2020 B2
10547422 Yoo et al. Jan 2020 B2
10547494 Liu et al. Jan 2020 B2
10548020 Khoshnevisan et al. Jan 2020 B2
10548131 Yerramalli et al. Jan 2020 B2
10548144 Soriaga Jan 2020 B2
10548153 Akkarakaran et al. Jan 2020 B2
10548155 Manolakos Jan 2020 B2
10554462 Yang Feb 2020 B2
10554539 Luo Feb 2020 B2
10554540 Luo Feb 2020 B2
10555203 Malik Feb 2020 B2
10555210 Sun Feb 2020 B2
10555220 Yerramalli Feb 2020 B2
10560304 Lei Feb 2020 B2
10567118 Yang Feb 2020 B2
10567204 Bertrand et al. Feb 2020 B2
10568128 Li Feb 2020 B2
10574422 Wang Feb 2020 B2
10574565 Luo Feb 2020 B2
10575185 Li Feb 2020 B2
10581568 Mallik Mar 2020 B2
10581572 Chendamarai Kannan Mar 2020 B2
10581722 Luo Mar 2020 B2
10587435 Sun et al. Mar 2020 B2
10587497 Luo Mar 2020 B2
10594532 Wang Mar 2020 B2
10595225 John Wilson Mar 2020 B2
10595302 Mukkavilli Mar 2020 B2
10595327 Sadek Mar 2020 B2
10595332 Jiang Mar 2020 B2
10595342 Islam Mar 2020 B2
10602515 Ly Mar 2020 B2
10602543 Sun Mar 2020 B2
10602545 Mallik Mar 2020 B2
10608785 Wang Mar 2020 B2
10609660 Liu Mar 2020 B2
10609664 Zhang Mar 2020 B2
10615825 Sarkis Apr 2020 B2
10616737 Liu Apr 2020 B2
10616771 Montojo Apr 2020 B2
10616912 Chendamarai Kannan Apr 2020 B2
10616914 Manolakos Apr 2020 B2
10623138 Yang Apr 2020 B2
10623163 Sun Apr 2020 B2
10623208 Jiang Apr 2020 B2
10624079 Xu Apr 2020 B2
10630450 Sun Apr 2020 B2
10631323 Zeng Apr 2020 B2
10681724 Blasco Serrano et al. Jun 2020 B2
10687247 Chen et al. Jun 2020 B2
10693692 Hadani et al. Jun 2020 B2
10892929 Sorrentino et al. Jan 2021 B2
10924249 Chen et al. Feb 2021 B2
10999753 Chandrasekhar et al. May 2021 B2
11005632 Ekpenyong May 2021 B2
11012224 Ekpenyong et al. May 2021 B2
11139905 Chen et al. Oct 2021 B2
11147053 Chen et al. Oct 2021 B2
11177919 Ekpenyong et al. Nov 2021 B2
11196474 Sun et al. Dec 2021 B2
11239971 Chen et al. Feb 2022 B2
20040121730 Kadous Jun 2004 A1
20060203794 Sampath Sep 2006 A1
20070041457 Kadous Feb 2007 A1
20070071147 Sampath Mar 2007 A1
20070165738 Barriac Jul 2007 A1
20080025241 Bhushan Jan 2008 A1
20080112495 Gore May 2008 A1
20090271686 Jiang et al. Oct 2009 A1
20100003931 Krishnan Jan 2010 A1
20100067422 Kadous Mar 2010 A1
20100232338 Krishnamoorthi Sep 2010 A1
20100251069 Sun et al. Sep 2010 A1
20110003606 Forenza et al. Jan 2011 A1
20110007680 Kadous Jan 2011 A1
20110007688 Veeravalli Jan 2011 A1
20110243079 Chen et al. Oct 2011 A1
20110256834 Dayal Oct 2011 A1
20120026940 Barbieri Feb 2012 A1
20120051257 Kim et al. Mar 2012 A1
20120057540 Fang Mar 2012 A1
20120063321 Chandrasekhar et al. Mar 2012 A1
20120077532 Kadous Mar 2012 A1
20120113794 Roman et al. May 2012 A1
20120113906 Kadous May 2012 A1
20120140798 Kadous Jun 2012 A1
20120201158 Geirhofer Aug 2012 A1
20120213303 Kadous Aug 2012 A1
20120220286 Chen et al. Aug 2012 A1
20120314655 Xue Dec 2012 A1
20130058276 Somasundaram Mar 2013 A1
20130194948 Mallik Aug 2013 A1
20130196678 Liu et al. Aug 2013 A1
20130229935 Gorokhov Sep 2013 A1
20130294275 Gorokhov Nov 2013 A1
20130315156 Xiao Nov 2013 A1
20130336193 Luo Dec 2013 A1
20130336249 Zhao Dec 2013 A1
20140023001 Huang Jan 2014 A1
20140029456 Mallik Jan 2014 A1
20140036859 Ekpenyong et al. Feb 2014 A1
20140050202 Baligh et al. Feb 2014 A1
20140071894 Kairouz Mar 2014 A1
20140079155 Wang Mar 2014 A1
20140087784 Lou et al. Mar 2014 A1
20140126491 Ekpenyong et al. May 2014 A1
20140192740 Ekpenyong et al. Jul 2014 A1
20140204857 Mallik Jul 2014 A1
20140219117 Meshkati Aug 2014 A1
20140219243 Meshkati Aug 2014 A1
20140226519 Nagata et al. Aug 2014 A1
20140273884 Mantravadi Sep 2014 A1
20140301309 Luo Oct 2014 A1
20150063150 Sadek Mar 2015 A1
20150063151 Sadek Mar 2015 A1
20150063323 Sadek Mar 2015 A1
20150085686 Chande Mar 2015 A1
20150092873 Ashikhmin Apr 2015 A1
20150139015 Kadous May 2015 A1
20150163823 Sadek Jun 2015 A1
20150180622 Yoo Jun 2015 A1
20150282077 Yavuz Oct 2015 A1
20150319702 Patel Nov 2015 A1
20150350919 Patel Dec 2015 A1
20150351106 Wijetunge et al. Dec 2015 A1
20160028531 Guo Jan 2016 A1
20160088625 Kadous Mar 2016 A1
20160095039 Valliappan Mar 2016 A1
20160095040 Valliappan Mar 2016 A1
20160112168 Yoo Apr 2016 A1
20160128045 Yazdi et al. May 2016 A1
20160128130 Sadek May 2016 A1
20160192388 Ekpenyong et al. Jun 2016 A1
20160234820 Mallik Aug 2016 A1
20160248559 Guo et al. Aug 2016 A1
20160270046 Lin et al. Sep 2016 A1
20160295557 Yazdi et al. Oct 2016 A1
20160352481 Jiang et al. Dec 2016 A1
20160353482 Valliappan Dec 2016 A1
20160381673 Sun Dec 2016 A1
20170026976 Yoo Jan 2017 A1
20170041766 Vajapeyam Feb 2017 A1
20170141798 Kudekar et al. May 2017 A1
20170142705 Chendamarai Kannan May 2017 A1
20170149543 Ang et al. May 2017 A1
20170150486 Ang et al. May 2017 A1
20170163315 Wu Jun 2017 A1
20170163433 Luo Jun 2017 A1
20170171855 Sundararajan et al. Jun 2017 A1
20170171879 Jiang et al. Jun 2017 A1
20170207884 Jiang et al. Jul 2017 A1
20170215103 Liu et al. Jul 2017 A1
20170222771 Chendamarai Kannan Aug 2017 A1
20170223739 Mallik Aug 2017 A1
20170272224 Ang et al. Sep 2017 A1
20170289984 Baligh et al. Oct 2017 A1
20170311346 Chendamarai Kannan Oct 2017 A1
20170318563 Yang et al. Nov 2017 A1
20170332288 Sadek Nov 2017 A1
20170332338 Mallik Nov 2017 A1
20170338996 Sankar et al. Nov 2017 A1
20170359146 Yang et al. Dec 2017 A1
20170359714 Gupta et al. Dec 2017 A1
20180019766 Yang et al. Jan 2018 A1
20180026740 Chen et al. Jan 2018 A1
20180026764 Namgoong et al. Jan 2018 A1
20180032516 Mallik Feb 2018 A1
20180035423 Wang Feb 2018 A1
20180035455 Xu Feb 2018 A1
20180035463 Mallik Feb 2018 A1
20180042030 Xu Feb 2018 A1
20180049097 Chen Feb 2018 A1
20180054348 Luo Feb 2018 A1
20180054780 Radulescu Feb 2018 A1
20180054848 Yoo Feb 2018 A1
20180062801 Zhang Mar 2018 A1
20180062810 Vitthaladevuni Mar 2018 A1
20180070242 Damnjanovic Mar 2018 A1
20180077725 Sun Mar 2018 A1
20180083824 Yang Mar 2018 A1
20180091373 Manolakos Mar 2018 A1
20180092002 Manolakos Mar 2018 A1
20180092081 Chen Mar 2018 A1
20180092110 Mallik Mar 2018 A1
20180097534 Manolakos Apr 2018 A1
20180098293 Jiang Apr 2018 A1
20180098307 Yang Apr 2018 A1
20180098316 Wang Apr 2018 A1
20180103428 Jiang Apr 2018 A1
20180103485 Jiang Apr 2018 A1
20180109406 Wang Apr 2018 A1
20180110048 Ang Apr 2018 A1
20180110056 Zhang Apr 2018 A1
20180124753 Sun May 2018 A1
20180124777 Yerramalli May 2018 A1
20180124789 Yerramalli May 2018 A1
20180131499 Zhang May 2018 A1
20180132223 Sankar May 2018 A1
20180139618 Yerramalli May 2018 A1
20180139758 Sankar May 2018 A1
20180160328 Chendamarai Kannan Jun 2018 A1
20180160389 Yerramalli Jun 2018 A1
20180167848 Lei Jun 2018 A1
20180167941 Zhang Jun 2018 A1
20180176922 Li Jun 2018 A1
20180176946 Sun Jun 2018 A1
20180191470 Manolakos Jul 2018 A1
20180198560 Jiang Jul 2018 A1
20180213486 Yoo Jul 2018 A1
20180220428 Sun Aug 2018 A1
20180227011 Yerramalli Aug 2018 A1
20180227771 Malik Aug 2018 A1
20180227797 Liu Aug 2018 A1
20180227936 Yerramalli Aug 2018 A1
20180227944 Yerramalli Aug 2018 A1
20180234830 Wang Aug 2018 A1
20180234880 Jiang Aug 2018 A1
20180234881 Hosseini Aug 2018 A1
20180234968 Sun Aug 2018 A1
20180234993 Hosseini Aug 2018 A1
20180241494 Chendamarai Kannan Aug 2018 A1
20180242348 Chendamarai Kannan Aug 2018 A1
20180249486 Hosseini Aug 2018 A1
20180249496 Radulescu Aug 2018 A1
20180255584 Sun Sep 2018 A1
20180262237 Chen et al. Sep 2018 A1
20180262311 Wang Sep 2018 A1
20180262317 Jiang Sep 2018 A1
20180269898 Sun Sep 2018 A1
20180270022 Sun Sep 2018 A1
20180270023 Jiang Sep 2018 A1
20180270816 Li Sep 2018 A1
20180279134 Malik Sep 2018 A1
20180279292 Luo Sep 2018 A1
20180279298 Wang Sep 2018 A1
20180287744 Sundararajan Oct 2018 A1
20180287745 Sun Oct 2018 A1
20180287840 Akkarakaran Oct 2018 A1
20180287870 Yerramalli Oct 2018 A1
20180288747 Sun Oct 2018 A1
20180288749 Sun Oct 2018 A1
20180302186 Reddy Oct 2018 A1
20180310262 Ly Oct 2018 A1
20180310341 Yerramalli Oct 2018 A1
20180323943 Jiang Nov 2018 A1
20180324676 Huang Nov 2018 A1
20180324713 Yoo Nov 2018 A1
20180331693 Lou Nov 2018 A1
20180343676 Yerramalli Nov 2018 A1
20180352520 Zhang Dec 2018 A1
20180352563 Liu Dec 2018 A1
20180367245 Soriaga Dec 2018 A1
20180367362 Sun Dec 2018 A1
20180368089 Yerramalli Dec 2018 A1
20180375612 Sarkis Dec 2018 A1
20180375629 Lee Dec 2018 A1
20190007946 Yerramalli Jan 2019 A1
20190007956 Jiang Jan 2019 A1
20190014481 Yerramalli Jan 2019 A1
20190014507 Zhang Jan 2019 A1
20190014589 Yerramalli Jan 2019 A1
20190020424 Yerramalli Jan 2019 A1
20190020461 Yerramalli Jan 2019 A1
20190020522 Sun Jan 2019 A1
20190020528 Lei Jan 2019 A1
20190020529 Lei Jan 2019 A1
20190021080 Lei Jan 2019 A1
20190021097 Li Jan 2019 A1
20190028119 Yang Jan 2019 A1
20190028999 Yerramalli Jan 2019 A1
20190029019 Zhang Jan 2019 A1
20190036663 Azarian Yazdi Jan 2019 A1
20190037427 Yerramalli Jan 2019 A1
20190037481 Zhang Jan 2019 A1
20190037482 Damnjanovic Jan 2019 A1
20190037603 Damnjanovic Jan 2019 A1
20190044540 Jiang Feb 2019 A1
20190044777 Manolakos Feb 2019 A1
20190045509 Mallik Feb 2019 A1
20190052400 Soriaga Feb 2019 A1
20190053255 Li Feb 2019 A1
20190053266 Jiang Feb 2019 A1
20190053269 Lei Feb 2019 A1
20190058553 Sun Feb 2019 A1
20190059001 Yerramalli Feb 2019 A1
20190059102 Yerramalli Feb 2019 A1
20190068335 Li Feb 2019 A1
20190068345 Chen Feb 2019 A1
20190069325 Yerramalli Feb 2019 A1
20190075591 Sun Mar 2019 A1
20190075597 Yerramalli Mar 2019 A1
20190081768 Zhang Mar 2019 A1
20190082333 Malik Mar 2019 A1
20190089489 Li Mar 2019 A1
20190090178 Liu Mar 2019 A1
20190090256 Liu Mar 2019 A1
20190090273 Yoo Mar 2019 A1
20190098654 Li Mar 2019 A1
20190098656 Chendamarai Kannan Mar 2019 A1
20190098663 Zhang Mar 2019 A1
20190103928 Nagaraja Apr 2019 A1
20190104416 Yerramalli Apr 2019 A1
20190104514 Chendamarai Kannan Apr 2019 A1
20190104542 Chendamarai Kannan Apr 2019 A1
20190104546 Chendamarai Kannan Apr 2019 A1
20190104547 Xue Apr 2019 A1
20190110208 Xue Apr 2019 A1
20190110254 Yerramalli Apr 2019 A1
20190110302 Zhang Apr 2019 A1
20190110317 Zhang Apr 2019 A1
20190116560 Naderializadeh et al. Apr 2019 A1
20190116585 Chakraborty Apr 2019 A1
20190116599 Xue Apr 2019 A1
20190123779 Ekpenyong et al. Apr 2019 A1
20190124518 Zhang Apr 2019 A1
20190124595 Lei Apr 2019 A1
20190124613 Liu Apr 2019 A1
20190124630 Ji Apr 2019 A1
20190124663 Liu Apr 2019 A1
20190124694 Chendamarai Kannan Apr 2019 A1
20190124700 Ji Apr 2019 A1
20190132817 Liu May 2019 A1
20190141707 Yerramalli May 2019 A1
20190141723 Zhang May 2019 A1
20190141734 Lei May 2019 A1
20190141744 Naghshvar May 2019 A1
20190141783 Malik May 2019 A1
20190149190 Liu May 2019 A1
20190149364 Sundararajan May 2019 A1
20190150088 Sun May 2019 A1
20190150120 Sarkis May 2019 A1
20190150179 Soriaga May 2019 A1
20190150198 Sun May 2019 A1
20190158221 Sarkis May 2019 A1
20190158227 Gupta May 2019 A1
20190158240 Li May 2019 A1
20190158251 Park May 2019 A1
20190158252 Li May 2019 A1
20190158333 Zhang May 2019 A1
20190159202 Lee May 2019 A1
20190159280 Chakraborty May 2019 A1
20190165902 Li May 2019 A1
20190165982 Gaal May 2019 A1
20190166589 Yang May 2019 A1
20190166621 Yerramalli May 2019 A1
20190166625 Nam May 2019 A1
20190173521 Liu Jun 2019 A1
20190173611 Liu Jun 2019 A1
20190173619 Li Jun 2019 A1
20190174518 Jiang Jun 2019 A1
20190174532 Damnjanovic Jun 2019 A1
20190174542 Lei Jun 2019 A1
20190181979 Wang Jun 2019 A1
20190181995 Liu Jun 2019 A1
20190182826 Yerramalli Jun 2019 A1
20190182845 Xue Jun 2019 A1
20190190668 Lei Jun 2019 A1
20190190681 Li Jun 2019 A1
20190191391 Ekpenyong et al. Jun 2019 A1
20190199786 Mallik Jun 2019 A1
20190200385 Xue Jun 2019 A1
20190207723 Lei Jul 2019 A1
20190222342 Park Jul 2019 A1
20190222343 Park Jul 2019 A1
20190223184 Sarkis Jul 2019 A1
20190223215 Tian Jul 2019 A1
20190229788 Zhang Jul 2019 A1
20190230697 Yang Jul 2019 A1
20190238177 Liu Aug 2019 A1
20190238196 Lei Aug 2019 A1
20190238219 Liu Aug 2019 A1
20190238284 Liu Aug 2019 A1
20190239202 Bhattad Aug 2019 A1
20190245560 Yang Aug 2019 A1
20190245658 Yang Aug 2019 A1
20190246410 Zhang Aug 2019 A1
20190246419 Sun Aug 2019 A1
20190246425 Zhang Aug 2019 A1
20190253219 Fan Aug 2019 A1
20190253232 Park Aug 2019 A1
20190254081 Li Aug 2019 A1
20190260451 Sarkis Aug 2019 A1
20190261323 Lee Aug 2019 A1
20190261354 Fakoorian Aug 2019 A1
20190268059 Yang Aug 2019 A1
20190268127 Hosseini Aug 2019 A1
20190268129 Lin Aug 2019 A1
20190268206 Yang Aug 2019 A1
20190268907 Bhattad Aug 2019 A1
20190268923 Sundararajan Aug 2019 A1
20190268932 Sundararajan Aug 2019 A1
20190268933 Sun Aug 2019 A1
20190274162 Zhang Sep 2019 A1
20190280829 Wei Sep 2019 A1
20190280836 Bhattad Sep 2019 A1
20190288761 Mallik Sep 2019 A1
20190288789 Li Sep 2019 A1
20190288800 Hosseini Sep 2019 A1
20190289602 Mukkavilli Sep 2019 A1
20190289629 Luo Sep 2019 A1
20190296809 Li Sep 2019 A1
20190296882 Li Sep 2019 A1
20190305834 Fakoorian Oct 2019 A1
20190305882 Wang Oct 2019 A1
20190305911 Sarkis Oct 2019 A1
20190306878 Zhang Oct 2019 A1
20190306881 Fakoorian Oct 2019 A1
20190312671 Lin Oct 2019 A1
20190312763 Lei Oct 2019 A1
20190313259 Bendlin et al. Oct 2019 A1
20190313260 Zhang Oct 2019 A1
20190313385 Yang Oct 2019 A1
20190313419 Fakoorian Oct 2019 A1
20190313430 Manolakos Oct 2019 A1
20190319732 Manolakos Oct 2019 A1
20190319767 Sun Oct 2019 A1
20190320393 Hosseini Oct 2019 A1
20190320402 Ji Oct 2019 A1
20190320420 Zhang Oct 2019 A1
20190320424 Yerramalli Oct 2019 A1
20190320452 Zhang Oct 2019 A1
20190320458 Hosseini Oct 2019 A1
20190327047 Liu Oct 2019 A1
20190327062 Jiang Oct 2019 A1
20190334577 Damnjanovic Oct 2019 A1
20190334666 Damnjanovic Oct 2019 A1
20190335337 Damnjanovic Oct 2019 A1
20190335445 Forenza Oct 2019 A1
20190335447 Sarkis Oct 2019 A1
20190335456 Yerramalli Oct 2019 A1
20190335480 Sun Oct 2019 A1
20190335481 Jiang Oct 2019 A1
20190335490 Zeng Oct 2019 A1
20190335500 Zhang Oct 2019 A1
20190335504 Chakraborty Oct 2019 A1
20190342035 Zhang Nov 2019 A1
20190342045 Radulescu Nov 2019 A1
20190342836 Ang Nov 2019 A1
20190349010 Wu Nov 2019 A1
20190349176 Li Nov 2019 A1
20190349221 Jiang Nov 2019 A1
20190349897 Hosseini Nov 2019 A1
20190349900 Sarkis Nov 2019 A1
20190349941 Yang Nov 2019 A1
20190349969 Chakraborty Nov 2019 A1
20190349973 Yang Nov 2019 A1
20190349974 Sundararajan Nov 2019 A1
20190349992 Zhang Nov 2019 A1
20190349998 Bhattad Nov 2019 A1
20190356441 Jiang Nov 2019 A1
20190356455 Yang Nov 2019 A1
20190357150 Wang Nov 2019 A1
20190357252 Sun et al. Nov 2019 A1
20190357255 Sun et al. Nov 2019 A1
20190363773 Yerramalli et al. Nov 2019 A1
20190363853 Soriaga Nov 2019 A1
20190364468 Yerramalli et al. Nov 2019 A1
20190364579 Zhang et al. Nov 2019 A1
20190372605 Li Dec 2019 A1
20190372608 Wei Dec 2019 A1
20190372712 Yang Dec 2019 A1
20190373571 Damnjanovic et al. Dec 2019 A1
20190373629 Mukkavilli Dec 2019 A1
20190373640 Sun et al. Dec 2019 A1
20190379485 Jiang Dec 2019 A1
20190379518 Yang Dec 2019 A1
20190379561 Zhang et al. Dec 2019 A1
20190380052 Yang Dec 2019 A1
20190380127 Wang Dec 2019 A1
20190380147 Zhang et al. Dec 2019 A1
20190386737 Liu et al. Dec 2019 A1
20190387532 Liu et al. Dec 2019 A1
20190393986 Wang Dec 2019 A1
20190394008 Chen et al. Dec 2019 A1
20190394772 Li Dec 2019 A1
20190394790 Damnjanovic et al. Dec 2019 A1
20200007160 Li Jan 2020 A1
20200007294 Yang Jan 2020 A1
20200007302 Manolakos Jan 2020 A1
20200008107 Zhang et al. Jan 2020 A1
20200008108 Yoo Jan 2020 A1
20200008131 Chakraborty et al. Jan 2020 A1
20200008235 Sarkis Jan 2020 A1
20200008239 Li Jan 2020 A1
20200014499 Sun Jan 2020 A1
20200015268 Zhang et al. Jan 2020 A1
20200021423 Liu et al. Jan 2020 A1
20200022029 Sadek et al. Jan 2020 A1
20200022136 Wang Jan 2020 A1
20200029203 Ekpenyong et al. Jan 2020 A1
20200029221 Xue et al. Jan 2020 A1
20200029335 Yang Jan 2020 A1
20200036476 Yang Jan 2020 A1
20200036477 Xu Jan 2020 A1
20200037235 Ly Jan 2020 A1
20200037319 Li Jan 2020 A1
20200037336 Sun et al. Jan 2020 A1
20200037338 Li Jan 2020 A1
20200037347 Yang Jan 2020 A1
20200037352 Yang Jan 2020 A1
20200044778 Park Feb 2020 A1
20200044784 Yang Feb 2020 A1
20200044793 Sundararajan Feb 2020 A1
20200045556 Xue Feb 2020 A1
20200045623 Damnjanovic Feb 2020 A1
20200045744 Sun Feb 2020 A1
20200052717 Wang Feb 2020 A1
20200052750 Manolakos Feb 2020 A1
20200052831 Yang Feb 2020 A1
20200052870 Yerramalli Feb 2020 A1
20200053599 Damnjanovic Feb 2020 A1
20200053658 Sundararajan Feb 2020 A1
20200053739 Xue Feb 2020 A1
20200053744 Hosseini Feb 2020 A1
20200053801 Hosseini Feb 2020 A1
20200059346 Yoo Feb 2020 A1
20200059854 Li et al. Feb 2020 A1
20200059926 Jiang Feb 2020 A1
20200067574 Yang Feb 2020 A1
20200067639 Lin Feb 2020 A1
20200067748 Zhang Feb 2020 A1
20200068435 Zhang Feb 2020 A1
20200068495 Yang Feb 2020 A1
20200068528 Abraham Feb 2020 A1
20200076563 Yang Mar 2020 A1
20200077394 Damnjanovic Mar 2020 A1
20200077439 Sun Mar 2020 A1
20200083982 Jiang Mar 2020 A1
20200083987 Xu Mar 2020 A1
20200084759 Liu Mar 2020 A1
20200084778 Wang Mar 2020 A1
20200084784 Jiang Mar 2020 A1
20200092041 Sankar Mar 2020 A1
20200092818 Jiang Mar 2020 A1
20200092909 Ekpenyong Mar 2020 A1
20200099436 Malik Mar 2020 A1
20200099469 Jiang Mar 2020 A1
20200099472 Wang Mar 2020 A1
20200099560 Li Mar 2020 A1
20200100116 Chakraborty Mar 2020 A1
20200100226 Hosseini Mar 2020 A1
20200100247 Zhang Mar 2020 A1
20200100250 Zhang Mar 2020 A1
20200100257 Yang Mar 2020 A1
20200106583 Zirwas et al. Apr 2020 A1
20200107335 Xue Apr 2020 A1
20200107336 Yang Apr 2020 A1
20200107360 Xue Apr 2020 A1
20200107364 Xue Apr 2020 A1
20200112391 Yang Apr 2020 A1
20200112394 Mukkavilli Apr 2020 A1
20200112396 Jiang Apr 2020 A1
20200112421 Ang Apr 2020 A1
20200112964 Yang Apr 2020 A1
20200112983 Hosseini Apr 2020 A1
20200281007 Sun et al. Sep 2020 A1
20200295980 Bertrand et al. Sep 2020 A1
20200296762 Sun et al. Sep 2020 A1
20200314691 Chen et al. Oct 2020 A1
20200322202 Hadani et al. Oct 2020 A1
20210160849 Sun et al. May 2021 A1
20210184821 Chen et al. Jun 2021 A1
20210215830 Sahlin et al. Jul 2021 A1
20210219320 Belleschi et al. Jul 2021 A1
20210258814 Chandrasekhar et al. Aug 2021 A1
20210266131 Ekpenyong Aug 2021 A1
20210266846 Do et al. Aug 2021 A1
20210273770 Ekpenyong et al. Sep 2021 A1
20210314962 Ashraf et al. Oct 2021 A1
20210392620 Ashraf et al. Dec 2021 A1
20210392707 Do et al. Dec 2021 A1
20220029725 Chen et al. Jan 2022 A1
20220030610 Chen et al. Jan 2022 A1
20220070027 Huang et al. Mar 2022 A1
20220141843 Sadeghi May 2022 A1
20220407569 Zhang et al. Dec 2022 A1
20230006713 Zirwas et al. Jan 2023 A1
Foreign Referenced Citations (1)
Number Date Country
101742597 Jun 2010 CN
Non-Patent Literature Citations (2)
Entry
International Search Report for International Application No. PCT/US2021/056892 dated Mar. 21, 2022, 5 pages.
Written Opinion for International Application No. PCT/US2021/056892 dated Mar. 21, 2022, 6 pages.
Related Publications (1)
Number Date Country
20220140936 A1 May 2022 US
Provisional Applications (1)
Number Date Country
63108170 Oct 2020 US