The disclosure relates generally to the field of communication systems, and specifically and not by way of limitation, some embodiments are related to enhanced Multi-User, Multiple-Input, Multiple-Output (MU-MIMO) communication and interference rejection in wireless systems.
Wireless communication systems are widely deployed to provide various telecommunication services such as telephony, video, data, messaging, and broadcasts. Typical wireless communication systems may employ multiple-access technologies capable of supporting communication with multiple users by sharing available system resources. Examples of such multiple-access technologies include code division multiple access (CDMA) systems, time division multiple access (TDMA) systems, frequency division multiple access (FDMA) systems, orthogonal frequency division multiple access (OFDMA) systems, single-carrier frequency division multiple access (SC-FDMA) systems, and time division synchronous code division multiple access (TD-SCDMA) systems.
Multiple access technologies have been integral to telecommunication standards, enabling wireless devices to communicate across different scales. A notable example is 6G, a successor to 5G New Radio (NR), which represents a continuous evolution in mobile broadband driven by the Third Generation Partnership Project (3GPP). 5G NR addresses emerging requirements for latency, security, scalability (including Internet of Things integration), and other factors. Encompassing services like enhanced mobile broadband (eMBB), massive machine-type communications (mMTC), and ultra-reliable low-latency communications (URLLC), 5G NR builds upon the 4G Long Term Evolution (LTE) standard. As 5G NR advances, there's a recognized need for further enhancements in technology. These advancements have potential relevance to other multi-access technologies and the corresponding telecommunication standards that leverage them.
While MU-MIMO has been employed in wireline technologies like VDSL and g.fast, where channels are quasi-constant and channel estimation is less challenging, its application in wireless communication faces unique obstacles. The wireless channel is time-variable, and users may possess arrays of antennas with varying numbers of elements. The evolution of antenna arrays is aligned with wavelength reduction trends in current and future wireless standards such as 5G and proposed 6G, necessitating larger numbers of antenna elements to maintain effective area coverage. These arrays can be rigid, flexible, or even printed, reflecting technological advancements.
The challenge arises when dealing with a high number of users equipped with a significant number of antenna elements, e.g., a large number of UE's each having a large number of antennas, leading to a large total number of antenna elements (NR) across all users:
This poses difficulties for channel estimation and MU-MIMO precoder construction, particularly when the total number of RX antennas (NR) surpasses or greatly exceeds the number of base station (gNB) antennas (NT) and is
or much larger (NR>>NT) than the number of the base station (gNB) antennas NT.
One issue pertains to interference and the high level of interference noise encountered when transmitting signals to users. Information signals directed to one user act as interference for others, with interference noise levels potentially surpassing ambient noise. Precoding technology is employed to address interference noise, relying on channel knowledge obtained by the Base Station.
Another issue involves the time-intensive process of determining channel matrices that relate UE antennas 108 to base station (gNB) antennas 104, particularly burdensome with a large number of users and antennas. Channel estimation becomes more challenging with multiple RX antennas at UEs, especially if UEs 106 are equipped with an extensive number of antenna elements. This challenge becomes significant when considering varying channels and the firing of Sounding Reference Signals (SRS) signals from each user's physical antennas, demanding substantial time proportional to the total number of antennas 108 on each UE 106.
Yet another issue is the weak back transmission from UEs 106 to the Base Station (gNB 102) for channel estimation purposes. UEs 106 possesses lower transmission power compared to the Base Station (gNB 102), negatively impacting channel estimation quality. This weakness may necessitate multiple close-in-time retransmissions, further exacerbating the time required for channel estimation.
In response to these challenges, a comprehensive approach is proposed that addresses one or more of interference, channel estimation, and transmission power. In some examples, this approach involves dimensionality reduction techniques applied to physical array elements, aiming to create effective antenna arrays at both the UE 106 and Base Station (gNB 102) sides. This approach may offer solutions to the limitations of existing MU-MIMO technology in the context of future high-density wireless communication systems.
In one example implementation, an embodiment involves a method that enhances Downlink (DL) channel estimation in a wireless communication system. This approach includes a series of coordinated steps between the gNB (Base Station) and the User Equipment (UE), focusing on optimizing reciprocity-based MU-MIMO performance and facilitating efficient data transmission. By integrating DL and UL signal exchanges, UE Rx EA (Effective Antenna) selection, and DL precoder construction, this embodiment may address the challenges posed by dynamic wireless environments and evolving communication demands. The interaction between gNB-transmitted DL signals, UE-estimated channel responses, UE Rx EA candidates, and UL signals for reciprocity-based estimation creates an efficient communication framework, emphasizing signal quality, interference management, and system performance.
Disclosed are example embodiments of a method for enhancing Downlink (DL) Reciprocity-based MU-MIMO performance in a wireless communication system. The method also includes the steps of specifying at least one UE Rx EA (Effective Antenna) candidate and transmitting UL signals from the UE to facilitate reciprocity-based DL channel estimation by a base station, wherein the transmission is carried out via said specified at least one UE Rx EA. The method includes the steps of estimating a DL channel response at the base station using UL reciprocity and selecting at least one of said specified UE Rx EA candidates for DL reception. Additionally, the method includes constructing a DL precoder at the base station based on said estimated DL channel response and the selected UE Rx EA(s), and decoding DL transmission data at the UE using at least one of said specified UE Rx EA(s).
Disclosed are example embodiments of a method for enhancing Downlink (DL) Reciprocity-based MU-MIMO performance, performed by a base station. The method includes the steps of receiving UL signals from the UE for reciprocity-based DL channel estimation, wherein the UL signals are transmitted by the UE via specified UE Rx EA (Effective Antenna) candidates and estimating the DL channel response based on the received UL signals using UL reciprocity. Additionally, the method includes selecting at least one UE Rx EA candidate specified by the UE for DL reception based on the estimated DL channel response and constructing a DL precoder based on the estimated DL channel response and the selected UE Rx EA(s). Additionally, the method includes transmitting DL transmission data to the UE using the DL precoder.
Disclosed are example embodiments of a base station created to enhance reciprocity-based MU-MIMO performance in a wireless communication system, The base station includes a base station processing unit and a memory unit that stores instructions for the base station's operations. The instructions cause the base station to estimate the DL channel response based on received UL signals in order to construct a DL precoder, while a memory unit stores instructions for the base station's operations and configure its precoder for MU-MIMO operation and transmit data encoded using said precoder. The base station processing unit further includes a control unit that oversees the device's operations to enhance reciprocity-based MU-MIMO performance.
Disclosed are example embodiments of a User Equipment (UE) device for enhancing Downlink (DL) Reciprocity-based MU-MIMO performance in a wireless communication system. The UE includes a communication interface configured to receive DL signals from a base station to facilitate DL Reciprocity-based MU-MIMO performance improvement and a memory unit configured to store instructions. When the instructions are executed by a processing unit, the instructions cause the UE device to specify at least one UE Rx EA (Effective Antenna) candidate and transmit UL signals to facilitate reciprocity-based DL channel estimation by the base station, wherein the transmission is performed via the UE Rx EA candidates. Additionally, when the instructions are executed by a processing unit, the instructions cause the UE device to select at least one UE Rx EA candidate for DL decoding and decode DL transmission data using the selected UE Rx EA(s). The UE further includes a control unit configured to control operations of the communication interface, processing unit, and memory unit according to the instructions stored in the memory unit, and wherein the UE device is adapted to perform operations to enhance Reciprocity-based MU-MIMO performance in the wireless communication system.
Disclosed are example embodiments of a method for enhancing Downlink (DL) Reciprocity-based MU-MIMO performance in a User Equipment (UE). The method includes the steps of specifying at least one UE Rx EA (Effective Antenna) candidate and transmitting UL signals from the UE to facilitate reciprocity-based DL channel estimation by a base station, wherein the transmission is carried out via said specified at least one UE Rx EA. The method includes select at least one UE Rx EA candidate for DL decoding and decoding DL transmission data at the UE using the selected UE Rx EA(s).
The foregoing summary, as well as the following detailed description, is better understood when read in conjunction with the accompanying drawings. The accompanying drawings, which are incorporated herein and form part of the specification, illustrate a plurality of embodiments and, together with the description, further serve to explain the principles involved and to enable a person skilled in the relevant art(s) to make and use the disclosed technologies.
The figures and the following description describe certain embodiments by way of illustration only. One skilled in the art will readily recognize from the following description that alternative embodiments of the structures and methods illustrated herein may be employed without departing from the principles described herein. Reference will now be made in detail to several embodiments, examples of which are illustrated in the accompanying figures. It is noted that wherever practicable similar or like reference numbers may be used in the figures to indicate similar or like functionality.
The detailed description set forth below in connection with the appended drawings is intended as a description of configurations and is not intended to represent the only configurations in which the concepts described herein may be practiced. The detailed description includes specific details for the purpose of providing a thorough understanding of various concepts. However, it will be apparent to those skilled in the art that these concepts may be practiced without these specific details. In some instances, well known structures and components are shown in block diagram form in order to avoid obscuring such concepts.
Disclosed herein are example embodiments of systems, methods, and devices for enhancing Reciprocity-based MU-MIMO performance in a wireless communication system. In some embodiments, to incorporate devices with a large number of antenna elements (notably when the aggregate count of UE device RX antennas surpasses the quantity of base station TX antennas), to evade UE RX antenna contamination from multi-user interference, to amplify the communication range with UEs in the MU-MIMO mode, and to diminish response and adaptation durations: dimensionality reduction may be enacted at the UE's antenna array.
In certain embodiments, a methodology is introduced wherein UEs convey the dimension-reduced physical channel matrices to the base station, facilitating the construction of the DL base station precoder for MU-MIMO operations. In some scenarios, various schemes of dimensionality reduction are detailed, encompassing both single-stage and multi-stage reduction processes, along with potential architectures of these reductions.
Furthermore, in some embodiments, methods to communicate a comprehensive set of UE RX EAs, especially when the count of D2A (digital to analog transformers purposed for transmission) is less than the count of A2D (analog to digital transformers intended for reception) are elucidated. In another embodiment, the incorporation of interference cancellation into the dimensionality reduction schema is detailed. Numerous schemes of EA constructions considering interference cancellation are presented. Some of these schemes might feature an EA count unintentionally surpassing the number of information layers. Additionally, there's a showcase of a prospective further dimensionality reduction from such schemes into lower-dimension systems.
In various embodiments, the quantity of effective antennas epitomizing dimensionality might vary amongst users participating in MU-MIMO and could be either less, equivalent, or greater than the information layer count for these users. It may also fluctuate over time. The supports (spanning frequency and time) may diverge for distinct phases of dimensionality reduction.
The collection of UE RX EAs might be transmitted to the BS through SRS transmission in certain scenarios. This assortment can represent the set actively utilized by the UE or an expanded set, enabling the BS to optionally cherry-pick candidates and send them back to the UE efficaciously.
For illustration, a method might encompass transmitting DL signals from a base station, determining the DL channel response, designating UE Rx EA candidates predicated on the determined DL channel response, and dispatching UL signals from the UE to amplify reciprocity-based MU-MIMO performance. Another method might involve inferring the DL channel response employing UL reciprocity and pinpointing a subset of UE Rx EA candidates for DL transmission.
In a distinct embodiment, UE TX EAs (pertaining to the uplink) form components of the UE RX EAs (related to the downlink). For shared portions of DL and UL effective antennas, the EA channels might be discerned by the base station from the UE's uplink data, authorizing the base station to employ the freshest channel knowledge in the assembly of the DL precoder. This strategy might be viable for pilotless schemes, seen as prospective candidates for 6G technology.
For cases involving copious antenna elements at the base station, an auxiliary set of base station TX EAs may be formed through amalgamation. While these are available for utilization as genuine base station TX EAs, they aren't necessarily harnessed for subsequent broadcasts. A user equipment (UE) might employ transmissions from the aforementioned set to develop UE RX EAs, with the construction rooted in the physical channel matrix associated with the supplementary base station TX EAs. This matrix might be optionally adjusted by the UE to reject interference.
Embodiments of the systems, methods, and devices described herein may have one or more of the following capabilities. For example, one embodiment of the systems, methods, and devices described herein may include enhancing MU-MIMO performance in a wireless communication system.
Precoding may be used as a tool to remove or relax the interference. To solve or relax the problem of the interference noise a precoding technology may be used. The base station may prepare its transmission toward users in such a way to eliminate or diminish the interference.
Here the matrix dimensions are:
where NU is the number of users, NT is the number of the base station (gNB 102) TX antennas. The diagonal matrix D adjusts the TX powers toward users. In the above relation the individual channels of all users are stacked horizontally into the total channel matrix:
FOR the channels equipped with 1 RX antenna, the above H(n) matrices are row vectors of equal dimension: 1×NT. This relation can be readily proved as:
For 1-antenna devices, the received vectors, the corresponding symbols and the ambient noise on their antennas are combined in vectors having the following dimensions:
Since matrix D is diagonal, there is no inter-user interference.
Let us now discuss the situation when number of users is smaller than the number of base station (gNB 102) TX antennas NU≤NT but the total number of the RX antennas NR≡Σu=1N
N
R
>N
T
To resolve this problem, a projection method referred to as “Coordinated Transmit-Receive Processing.” It will be referred to as the “Effective Antenna approach,” herein. The Effective Antenna approach may be illustrated by considering a single layer transmission to all users. Every user u=1: NU is equipped with NR
with an “equalizer” row vector w(u)H
as w(u)HH(u). The output of this projection is 1-layer scalar reduced dimension signal:
The equation for the 1-layer scalar reduced dimension signal is:
Then the base station may construct the zero-forcing solution from the modified channel:
The precoder for that single-layer transmission is then given as:
Note: the inter-user-interference is present on the UE RX antennas, but it is cleaned out for the specific linear combination: w(u)Hr(u) for every user.
The base station possesses knowledge regarding the combinations of w(u)HH(u), which constitute the matrix
The UEs Rx effective antennas are defined below. Effective RX or TX antenna means a set of linear combinations over RX or TX array. “Effective” objects are denoted by a bar over a letter. For the RX array of size NR(u) a weighted combination of the received signals r(u) is:
The components of the received signal vector originating from the complete set of RX antennas are merged into a complex-valued scalar. This merging process is analogous to establishing a solitary effective RX antenna. Within this context, the variable n designates the index corresponding to a particular weight row vector, or “equalizer.” Each specific amalgamation defines what is termed an Effective Antenna (EA). Consequently, solely these effective antennas, and not the entirety of physical antennas, will remain unaffected by interference, constituting the target for the Downlink (DL) precoder.
The total
Then, it can be observed that:
The effective antennas shrink the full channel represented by the channel matrix H(u) with NR(u) rows (each having length of NT) and of dimension dim H(u)=NR
Each of its rows represents channel of UE RX effective antenna (EA) (this is a row vector of length NT representing channels from base station antennas to the EA):
The downlink precoder (at the Base Station 102) may be constructed from the effective users' channels. The effective cannel matrix
Some embodiments may use reference signals (RS). Reference signals are primarily used for channel estimation. The reference signal may help the receiver to estimate the channel through which the signal has passed and thus make necessary adjustments for decoding. The reference signal may also be used for synchronization between the transmitter and receiver and to assist with beam management, feedback, demodulation, and other tasks. Reference signals may include known sequences or patterns that a receiver may be aware of. Because the receiver knows what to expect, the receiver can compare the received reference signal to the expected pattern to determine how the channel might have distorted the signal. A reference signal may be sent over specific frequency tones (known as pilots) or spread across an entire symbol. The transmission of these signals isn't continuous but occurs periodically or on-demand, based on system needs.
In an example embodiment the Sounding Reference Signal (SRS) may be transmitted back to the Base Station by using exactly the same weights which create the effective channel. This follows from the superposition principle for linear systems. This may be proved by transmitting the SRS from the UE 106 (user u) k-th physical antenna produces onto the array of the base station 102 signals given by the k-th row of the full matrix channel containing NT elements:
where s is the known symbol of the SRS. Then, the signal from the EA with index “n” imprints on NT the base station (gNB) antennas 104 the weighted superposition from every k=1:NR(u). The weights are w(u)n*(k). Then, it can be observed that this delivers to the base station (gNB) 102 the needed effective channel row corresponding to the EA with index “n”. Furthermore, it can be observed that this approach provides the necessary effective channel row corresponding to the EA indexed as “n” to the base station (gNB) 102:
It may be assumed that the same antennas are used for reception (RX) and transmission (TX) at UE 106 and at base station 102 (see remark below on how to generalize it). The full effective channel
In exemplary embodiments, the Base Station's NT antennas exhibit a range of configurations, including physical and effective antenna setups. It is emphasized that this dichotomy in antenna types does not impede the generality of the innovative concept disclosed herein.
Illustrating the versatility of the proposed approach, a broader application context is considered. Within this context, it is postulated that the simultaneous utilization of all receiving (RX) antennas for transmission might not be feasible. Instead, a subset of RX antennas, constituting a diminished count, can be strategically employed. This subset is formed by segregating the set of antenna indices into distinct sub-groups.
Transmission activities are facilitated by applying corresponding weights to each subset of antennas. Importantly, these transmissions transpire at distinct temporal intervals or on discrete Resource Element (RE) frequencies, ensuring separation. Subsequent to transmission, the Base Station employs an aggregation process wherein signals from all these transmissions are meticulously combined across every individual antenna of the Base Station.
It is to be expressly noted that the successful implementation of such transmissions necessitates rigorous coordination at the system level. This coordination effort is imperative to achieve optimal synergy among the various transmission components and ensure seamless operation within the proposed framework.
In some example embodiments, the use of EAs (we will employ this abbreviation for Effective Antennas) yields a range of advantages. Effective Antennas enable broader participation of users in MU-MIMO scenarios, especially when UE is equipped with multiple physical antennas. EAs contribute to a reduction in the time required for SRS back transmissions, a central aspect of the innovation described in this patent. This reduction is particularly valuable during update modes, where static weights and changing channel conditions necessitate swift formulation of new precoders by the base station (gNB).
Efficient use of EAs may mitigate the transmission overhead associated with sending signals from each individual physical Receiving (RX) antenna within a large array, especially in scenarios involving multiple participating UEs in MU-MIMO. The combined weights of EAs also function as an array gain mechanism, particularly effective when these weights are strategically selected to optimize SU-MIMO transmissions tailored for specific users (u). This optimization addresses the challenge of weak signals from individual antennas. The benefits derived from EAs extend the operational range of MU-MIMO within the Time Division Duplex (TDD) reciprocity mode, potentially accommodating a larger number of operational User Equipment (UE) within the designated operational field. Optimizing the SU-MIMO process, conducted on a per-Resource Element (RE) basis, involves integrating Effective Antennas (EAs). This may involve constructing user (u)'s SU-MIMO configuration using well-suited hermitically conjugated vectors, specifically referred to as u(u)m vectors. The mentioned SU-MIMO may be optimized (per RE) with e.g., EAs for user (u) to be constructed from the best (hermitically conjugated) u(u)m vectors, namely as:
of the SVD decomposition of the full physical channel H(u)=Σm=1min(N
A multi-step approach to EAs construction may be used in some embodiments. The matrix G(u) may have a fine structure. The matrix G(u) may be different for different users (hence index u dependent). Every matrix may belong to possibly different (finite-size or infinite-size/continuous) “alphabet” sets:
where the matrices G(u)(n) perform dimensionality reduction in total NG
F.E. two-step dimensionality reduction:
The outer element, performing the larger dimensionality reduction may be updated less frequently. Even if the channel (slightly) changes, they still focus the power onto the effective antennas, thus performing more precise channel estimation. In the relation G(u)=G(u)(1)G(u)(2) the matrix G(u)(2) is updated less frequently and G(u)(1) more frequently. Keeping G(u)(1), which may be adjusted according to the changing channel H(u), to allow the exact ZF be performed. Better effective channel estimation accuracy allows faster channel acquisition (without repetitions, or with smaller number of them).
The decomposition may reduce 64 (e.g., small) physical antennas toward 2 effective antennas in two steps. The final two effective antennas may serve two or one information layers (we also note that they may also serve more information layers if an overloaded MIMO is used).
EAs suggestion from base station (gNB):
UE does not know the EAs of the other users. Hence, a suggestion from the base station (gNB) can be welcomed. E.g., part of EAs effective channel of different users can be (highly) correlative, and suggestions can moderate that.
As a further ramification of the EAs approach, every UE can specify and suggest to base station (gNB) an enlarged “EAs candidates set”, and base station (gNB) may select a subset of these candidates by returning a binary string (for every UE) in which ones may indicate which EAs are to use. The candidates may be specified by the UE (and further refined) based on at least one of: the estimated DL channel response, or the information communicated from gNB (the indication from gNB for all or part of the equalizer chain elements e.g., for G(u)(2) while G(u)(1) can be then determined from the effective channel the UE observes after G(u)(2), namely on the channel H(u)(2)=G(u)(2)H(u) e.g., by means of the SVD of this reduced-size channel as we will explain (u) further), or from the past accumulated information/knowledge at UE, or a random selection, or a predefined selection. The gNB may select a subset from the specified UE EAs to be used for DL reception. The gNB, when selecting the candidates may look at the prediction of the performance of the ensemble of users. Hence, by selecting the EAs from the list of possibles (for every user), gNB optimizes a Cost Function.
In these examples optimization is performed at the network level, i.e., across multiple DL links. Rates_vec holds the vector of achievable data rate per UE link or parameter related to it. Optimization is done based on a mathematical function of this Rate_vec, e.g., max, min, sum, mean, with or without constraints. Examples for such optimization function are: max mean (Rates_vec) which represent maximization of the average over users rate and it is also equal to the maximization of the total rate of all users, max min (Rates_vec) which represents maximization of the minimal rate (i.e. of the weakest link); max(F), where F=w1*mean(Rates_vec)+w2*min(Rates_vec), with constraints: Rates_vec(u)>=Rmin_vec(u) for every user u. Note that the above rate vectors are per user and have number of components equal to the number of users participating in the MU-MIMO, namely NU.
Mix of Communication and Non-communication parameters:
This reduction is due to less repetitive transmissions.
Stability criterion: under this criterion EAs with the most stable (less changing) links can be preferred.
The gNB may choose the EAs which effective channels are less changing in time: this can be deduced from the possible previous knowledge. As an illustration: a reflection from an object on the distance may have less power, but also less change than the Line-of-sight link. This can be especially of interest for fast-moving Ues (e.g., cars). This criterion can again be utilized with a set of constraints: e.g., Rates_vec(u)>=Rmin_vec(u) for every user u.
One of mathematical reasons related to the DL precoder construction is to find a good-performed set of EAs candidates for all users, which result in less correlative channels.
The gNB may also assist the selection of UE TX EAs, i.e., EAs used for uplink data transmission, and not for DL channel estimation via UL reciprocity. The gNB may indicate to the UE two separate indications holding a request for EAs to be used: one relating to the EAs used for DL reception—UE RX EAs, and a second one relating to EAs to be used for UL data transmission—UE TX EAs. The two indications may be identical. The indications can be also different as UE RX EAs may include pre-whitened physical channel matrix while for UE TX EAs this is not required.
For the case when the same set of EAs (Effective Antennas) is used for the downlink (UE RX EAs) and the uplink (UE TX EAs), the extended set of EAs is delivered to the gNB by UE (and from this set the EAs are further selected by the gNB). As an example, UE may construct this set as a result of multi-criterion optimization of the uplink and downlink cost functions and their corresponding constraints. This optimization may be done (in the heuristic manner) using modified physical channel Hmodified(u)=M(u)H(u). The EAs are constructed from the best (corresponding to the largest values of the σ(u)k(modified)) hermitically conjugated left eigenvectors uk(u)(modified)H of the SVD decomposition of the modified physical channel Hmodified(u)=Σk=1min (N
As a further generalization of the presented approach and for the optional case when the number of UE uplink effective antennas (UE TX EAs) are taken from a larger set of DL effective antennas (UE RX EAs) and hence are identical to some of the elements of this set. The multi-criterion optimization with constraints can be applied as described for this case as well. In particular, the modified channel can be used, and the effective antennas be constructed from the best eigen-vectors vectors (after hermitical conjugation) u(u)k(modified)H of the modified channel. We may always assume the indices k be ordered such that u(u)k(modified) be sorted from the largest to the smallest. Then we use 1≤k≤
EAs are defined per RE, hence this base station (gNB) communication may be large in size. To accommodate this large communication size various compression technics may be used. These techniques may include use of bit-maps, grouping multiple Res with a common EA set, taking advantage of a multi-step approach of EA construction, and/or time domain-based compression techniques.
The utilization of bit-maps can indicate sets of EAs candidates that are outside the scope of a provided list.
It is possible to group multiple Res that share a common EA set, thereby conveying a shared set of EAs candidates for the Res within that group. This grouping can also encompass wideband scenarios, spanning the entire available bandwidth.
Leveraging the multi-step process for constructing EAs (as discussed in the previous section), distinct sizes of Res groups are maintained for each EA construction step, with each Res group having its own set of EAs candidates.
Employing time domain-based compression techniques allows for a reduction in communication size by capitalizing on temporal correlations. For instance, conveying a single indication bit for “no change” can replace the need for multiple bits required in list selection, thus enhancing communication efficiency.
And then as illustrated in
To further illustrate the versatility and large potential of the Effective Antennas let us present their ability for DL interference rejection. The UE array may incorporate the interference rejection mechanisms into the UE RX EAs construction. The interference here may concern either residual MU-MIMO concurrent transmissions or transmissions originating from external cells. This can be done by linearly pre-processing the output of the RX EAs or at an inner levels of the dimensionality reduction with a linear transform which rejects (zeroes) strong interference or/and whitens the noise (remaining after the rejection if it is applied before the whitening). We note, that thus a single Effective Antenna has ability to reject or reduce the interference, while a single physical antenna lacks this ability.
In some communication techniques, multi-step dimensionality reduction may be employed. At each step of this process, there may be an option to include interference rejection. This means not all stages might use interference rejection, but later stages may, if needed. Using interference rejection across stages may offer robustness and/or quick adaptation. Robustness may be provided when one stage misses interference, later stages can handle the interference, and also due to smaller input dimension of the later stage allowing better and more precise interference learning. If interference plus noise correlation matrices are used to construct interference rejection, with multi-step approach they do not need to be estimated at large dimensions but may be learned at smaller dimensions of the inner stages. Quick adaptation may be provided by having multiple stages. For example, having multiple stages may speed up system learning and adjustment to interference patterns.
The number of UE RX EAs may change based on needs and conditions. After handling interference, it may make sense to reduce the number of UE RX EAs to allow more users in Multi-User Multiple Input, Multiple Output (MU-MIMO) communications. But if interference changes or needs reassessment, increasing the number of UE RX EAs may be necessary. The User Equipment (UE) may also decide to increase the number if interference is not managed well. The final number may be coordinated with the base station.
An algorithm to construct MU-MIMO precoder at the base station side may be given for the single layer case, the precoder can be constructed from right best vector of the SVD decomposition of the full physical channel via the pseudo inverse. There is no need to invert the channels, and distinguishable from [SSH 2004 B, Q. H. Spencer, A. L. Swindlehurst, and M. Haardt, “Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels,” IEEE Trans. Signal Process., vol. 52, no. 2, pp. 461-471, 2004.] the 1-layer self-channel σ(u)1 for u=1:NU do not need to enter the pinv ( . . . ). For the 3-user example (each user having single EA), the precoder can be constructed as:
The diagonal matrix, D, is used for further possible power optimizations. This simple construction can be generalized and several eigen-vectors can be used for every user. For example, user #1 can operate with two layers, and users #2 and #3 with one layer:
Subsequently, this relation can be further generalized.
Assuming user “u” possesses v(n) layers, the approach involves selecting the “v(n)” best (e.g., those corresponding to the largest channel SVD eigenvalues) right eigen-vectors. Subsequently, a matrix can be constructed from these selected eigen-vectors:
Then, the precoder matrix is directly constructed as
Here v is the total number of layers of all users:
The above precoder construction has smaller computation complexity than the previous methods presented method which uses the separate calculation of the NULL space per user and performs new SVD decomposition inside of it again per user. Its performance can be slightly less optimal and thus it represents a trade-off for the base station.
The Effective Antennas for the UEs are thus constructed via corresponding right eigen-vectors u(u)nH representing the way the signals from the RX antennas are combined, namely:
The effective channel construction using self-SVD is both computationally efficient and heuristic. It exhibits a significant attribute wherein, upon being communicated back to the Base Station, the Effective Antenna channels from each UE exhibit maximal possible gains (thus denoting UE array gains). This effectively addresses the issue of a weak UE transmitting its SRS towards a strong base station.
As another innovation in using this precoder construction, we note that the V(u)H matrices can be obtained not from the SVD decomposition of the physical channel but from the modified by linear transform physical channel. This transform performs the interference rejection or reduction using e.g., nulling or whitening. The Effective Antennas for the UEs are thus constructed via corresponding right eigen-vectors u(u)nH (of the SVD of the linearly transformed physical channel) e.g., w(u)nH=u(u)n(whitened)H as it will be explained further.
As another innovation in using base station DL precoder construction, we note
Here A is a block-diagonal matrix (where each block has dimension
Here G(u)H(u) corresponds to the channels for the RX EAs of the user u and not to the full channel matrix for this user which can be of larger or much larger size. Optimization of the matrix A is done by the base station (and it can be based e.g., on performance criteria, rate constraints per user and on the EAs corresponding channels stability criteria and on the robustness of the precoder criteria which can also take into account its less frequent update). In the case when number of EAs for every user is equal to the number of layers, matrix A may be optionally omitted and the following optional construction can be used
We also note that pseudoinverse pinv(M) can be generalized to include regularizations. Then, for any matrix M having less or equal number of rows than columns, the term corresponding to pinv (M)=MH*(MHM)−1 can be generalized into MH*(MHM+α*1)−1 for α>0, or MH*(MHM+diag(α))−1 for vector a having all non-negative components (and diag(α) denotes diagonal matrix with components of vector a be on its diagonal).
Below are presented examples of EAs construction considering that G(u)(2) is known (from the past, or it is suggested/indicated by the Base Station) or it has been already constructed (optimally, not optimally, or even based on a random set of the row vectors or be randomly chosen from a predefined alphabet). Then we perform the SVD decomposition of the H(u)(2) matrix:
Here the dimensions of the vectors are:
We may always assume the indices n be ordered such that σ(u)n(2) be sorted from the largest to the smallest. Then, G(u)(1) rows are constructed from the hermitically conjugated column-vectors u(u)n(1)H attached to the
Note that for G(u)(1) construction, only u(u)n(2) are to be calculated. Since their dimension, N(u)(dim-reduction 2), is typically small, the calculation can be effectively performed as the principal vectors of the following symmetric matrix (the “left” correlation matrix):
C
(u)
(left)
u
(u)n
(2)=λnu(u)n(2)
Here the eigenvalues are λn=(σ(u)n(2))2. We are to select the
Due to the matrix small-size, the eigen-vectors can be simply and effectively calculated even by a simple (reduced capabilities) UE.
Note that the knowledge of the large matrix H(u) is not required. This property is important since for some design the UE may see the full physical channel only via G(u)(2), then H(u) may remain unknown. This is especially important for G(u)(1) be digital and G(u)(2) be analog.
Above we have presented a way to construct G(u)(1) assuming G(u)(2) be known. Now, we present several possible methods to construct G(u)(2).
Let us present example 1 of G(u)(2) construction. For example, assuming that H(u) is known at UE, one can perform a single SVD (which can be of importance for reduced capability devices) of the <H(u)>, which is averaged over its support domain channel:
and construct G(u)(2) from N(u)(dim-reduction 2) rows as u<H
This approach allows for the UE to perform large SVD not at every RE, but only once per its support domain (see
Let us present example 2 of G(u)(2) construction. Note that one can also (alternatively) find the best eigenvectors (corresponding to the largest eigenvalues λ) of the averaged right correlation matrix:
then (for the above example with N(u)(dim-reduction 2)=4)
Note that double averaging is possible as well:
The G(u)(2) support domain is divided into several sub-domains, over which the channel is averaged, and the right correlation matrix is constructed there from the averaged channel. Then, only several right correlation matrices are to be calculated and averaged.
We note that if the G(u)(2) belongs to an alphabet, then one may choose 4 alphabet rows which approximate the above e(u)nH rows in the best way (e.g., having the best projections).
Let us present example 3 of G(u)(2) construction. The construction can be done form random realizations (e.g., of alphabet rows) at every domain or the same random realization in every domain.
Let us present example 4 of G(u)(2) construction. Another possible approach is to divide domains by smaller parts and choose the rows of the alphabet randomly at different sub-domains (or even per every RE), and then learn their performance (e.g., eye diagram or BER) and choose the best realization (expanding it over domain).
These are examples of equalizer G(u)(2) construction. As we mentioned above, the equalizer G(u)(2) can also be suggested to UE (for finite alphabet) by a gNB or it can be kept by UE be constant for some period of time (representing the simplest UE self-suggestion from the past). As further innovations we present below several aspects of the merging of the TX gNB antennas for EAs construction.
Let us now discuss another important issue for base station arrays with very large number of elements. For base station arrays having large number of physical antennas their channel estimation (by UE) can take a long time. Also, if the physical size of these antenna elements is small (which is the technological reason of the large their quantity) then the transmission from every such antenna element is weak, which negatively impacts the channel estimation (by UE) and reduces the range over which the channel estimation can be performed, hence reducing the area size where UE participating in the MU-MIMO are located. To address these challenges, the optional grouping or merging approach is proposed, wherein each group of gNB antenna elements receives a common input, with or without weightings.
Additionally, it's important to clarify that this merging is not intended for the actual downlink (DL) transmission of information signals. Instead, the merged transmission is directed towards UEs to facilitate Reciprocity-based MU-MIMO performance and the construction of UEs' receive effective antennas (EAs). We thus may say that different such mergings represent set of auxiliary BS (base station) TX EAs, which are not necessarily used further and are auxiliary in this sense (despite their usage as actual BS TX EAs is also an option). The transmission from the set of auxiliary BS TX EAs is utilized by UE to construct UE RX EAs (the construction by UE uses the physical channel matrix of these auxiliary BS Tx EAs (this channel matrix can be also optionally further modified by UE, as we described, for optional interference rejection.
Another innovation is represented by Channel estimation via re-encoding.
If UE uses identical UL and DL EAs, then the channel estimation for the UL precoder construction can be performed via the UL decoded data which serves as pilots. The decoded post FEC (Forward Error Correction) UL data will have to be FEC re-encoded to construct these data-based pilots.
The advantage of this approach is that all the data tones can be used as pilots as long as the bits were correctly decoded (this is checked via the CRC (Cyclic Redundancy Check)). This allows to construct the precoder from the most recent and accurate channel data.
The UE device 1100 may perform the following optional operations to enhance Reciprocity-based MU-MIMO performance. The UE estimates the DL channel response based on the received DL signals using the Processing Unit. Using the estimated DL channel response, the UE specifies at least one UE Rx EA (Effective Antenna) candidate. The UE transmits UL signals 1160 to facilitate reciprocity-based MU-MIMO performance by the gNB. The transmission is performed via the UE Rx EA candidates. The UE receives indications of selected UE Rx EA candidates for DL transmission from the gNB. Using the selected UE Rx EA(s), the UE decodes DL transmission data. The UE utilizes the Control Unit to manage the operations of various components based on the instructions stored in the Memory Unit.
Below are presented examples of EAs construction considering the interference rejection at the full UE array dimension. The EAs candidates can be constructed for example from the SVD decomposition of the full physical channel multiplied by the matrix of linear transformer T which is supposed to treat the interference. Examples of T are the whitening matrix, the nulling interference matrix or their combination (where some interference is nulled, and some is whitened).
In a first example, the physical channel H(u) and for the whitener of the interference noise given by matrix W(u) proposing the utilization of the SVD decomposition of the whitened physical channel:
Then, the mentioned SU-MIMO is optimized (per RE) with e.g., EAs for user (u) be constructed from the best (hermitically conjugated) u(u)m vectors as:
w
(u)n
H
=u
(u)n
(whitened)H
It allows to extract from the whitened channel the largest possible gains σ(u)m(whitened). The effective channel for EA #n is h(u)n≡σ(u)m(whitened)v(u)m(whitened)H. This is SU-MIMO heuristic way, since it ignores the other users (we will discuss that). This generalizes the SVD based EAs construction, which takes now into account the interference rejection. Note that a way to construct the whitening matrix, W(u), is from any factorization of the interference plus ambient noise correlation matrix C(u)n is known as:
The factorization is not unique (e.g., it is up to right multiplication of F(u) by any orthonormal unitary matrix , such that
H=1. Here matrices F(u),
and 1 have equal dimensions. This may be directly checked: (F(u)
)(F(u)
)H=F(u)
H=F(u)H=F(u)F(u)H.
In a second example, when the interference rejection is performed via nulling, then the nulling matrix P(u) is used instead of W(u).
and construct the EAs as:
w
(u)n
H
=u
(u)n
(ZF)H
taking the vectors with indices n corresponding to the largest sigmas (σ(u)m(ZF)).
With zero-forcing, or nulling approach, the component of the interference channels may be eliminated: (u)i (if they are known; every such vector has dimension of the UE RX array, namely dim
(u)i=NR(u)×1). For example, the original set of may be orthogonalize: {
(u)i} into the interference orthonormal basis {e(u)i} (via Gramm-Schmidt) and then introduce:
For a single strong interference channel vector (u), this leads to:
In a third example, both approaches may be combined, with nulling being performed over several most powerful interferers and whitening the rest.
Then, EAs for user (u) be constructed as from the best (of largest sigmas):
Such an approach may add robustness, since the correlation matrix with several strong interferers can be close to singular (if the number of interferers is smaller than the size of the correlation matrix). Differently from physical antennas, even a single EA can reject interference.
Note that the above presented DL precoder construction (see [0083]) based on the pseudo-inverse of the SVD parts of the users' channels can also be applied to the transformed channels (e.g., to the pre-whitened channels). As we presented for the pre-whitened channel example in [0089] the equalizer part is given by w(u)nH=u(u)n(whitened)H row vectors, and the VH matrix in [0083] is assembled from, v(u)m(whitened)H row vectors).
We also importantly note that RX EAs may represent not the full chain of the equalizer but one or several its elements with larger dimensions (e.g., G(u)(2)). This is illustrated in
As a possible example, G(u)(1) can be constructed (e.g., from the 2 best hermitically conjugated left eigenvectors, u(u)nH, of the SVD of the 4×NT channel matrix
similarly, to as described in [0089]).
As another example we note that stages of the equalizer matrices can be proceeded by permutation matrices. The permutational degrees-of-freedom allows efficient DSP realization and it also may make equalized information and interference channels be less correlative. The permutation degrees-of-freedom allows efficient DSP realization, and it also may make equalized information and interference channels less correlative. This analytically corresponds to the equalizer construction as:
Here W(u)(n) represents the optional whitener of the interference noise, and P(u)(n) is optional rejector of the noise and Π(u)(n) is an optional permutation matrix. A possible example of 2-step dimensionality reduction containing the outer-side permutation is:
G
(u)
=G
(u)
(1)
T
(u)
(1)
G
(u)
(2)Π(u)(2).
The permutation can be also effective as a tool when order in which dimensions are reduced is fixed (e.g., due to hardware design or as a learned previously weights by AI or ML (Machine learning). The dimensionality reduction can be considered as filtering of a sub-set of several antennas and in some hardware designs the indices in that sub-set may stay constant. Then, the permutation degrees of freedom may better the performance allowing more suitable dimensionality reduction since they manifest more possible input options to the next stage (and no permutation is just a unit matrix, which preserves the natural order of inputs).
The number of these permutations can be reduced about all possible permutations since the addition of different parts is additive. This may allow to reduce the combinatorial complexity of dimensionality reduction stages.
After the total (interference and ambient) noise is learned, the number of EAs can (optionally) be decreased (e.g., to 2 EAs for two layers, vs above mentioned 4 EAs). This may allow us to incorporate more users into the MU-MIMO service. The corresponding design is illustrated in
An example presenting how Base Station may use channel estimation from the decoded uplink symbols (transmitted by a UE to the Base Station) in order to construct DL precoder. Here is one possible example of the algorithm allowing channel estimation from the decoded data at the base station. The estimation of the channel matrix from already decoded by FEC data (for MU-MIMO) can be done as (we write the received signal vector equation, see the dimensions below):
Here, Ntotal is the total number of the spatial streams from all users (e.g., is there are three users with 4 spatial streams each, then the Ntotal=3*4=12). The dimensions may be:
Here the symbol vector represents column vector of stacked (decoded) symbols at RE:
and the channel matrix H is:
Assuming the channel matrix be approximately constant upon NE RE (“E” stands for “elements”), where:
N
E
≥N
total
we may write the equations for the channel matrix as:
Introducing matrices:
the above equation is re-written in the matrix form:
To find the channel matrix apply the pseudoinverse of the S matrix (we use that Ntotal≤NE)
form the right side of the equation:
Since SN
Note that the regularized pseudoinverse (with regularized parameter α≥0) would be written as:
Here the unit matrix 1 has the following dimensions 1N
We rewrite the received vector equation with weights by multiplying every relation by weights:
Here, the index (i) represents a relative position in the window box. Stacking these relations together leads to:
Then, after manipulations (we use again the pseudo-inverse and heuristically importantly ignore that the noise has also been modified by the weights):
Here the diagonal matrix DWEIGTS has squared weights values on its diagonal:
D
WEIGTS(i,j)=δijwi2
Note that one of the arguments why nonlinear precoding is not currently used for wireless communications is that the channel knowledge is limited. The suggested “channel from decoded data” may allow us to use this promising technology. We note that the reconstructed channel is the recent channel. This is of importance and brings advantage for the wireless environment presenting a solution to the problem of channel variability. It helps to extract the recent channel while the usage of an outdated channel might be harmful (since it may e.g., reduce information gains and inject interference (e.g., due to non-exactness of the ZF precoder design)). We also note that the decoded data is large (much larger than the pilot based data) which may better the precision of the channel estimation and be an additional advantage of this approach. We also note that the approach is general since it is based only on the ability to decode data (which is a part of the uplink processing for any wireless technology). In passing we note that the approach can be applied to pilot based technologies (when some data in some REs is known, and not need to be FEC decoded at these specific REs, and it thus directly enters at these RE the parts of symbol elements s (i) in the presented above equations) or to recent promising (and mentioned for 6G) pilotless technology. The constructed DL precoder based on this approach will serve UEs with any number of EAs (assuming the same EAs are used for UL and for DL). This is always the case of the devices with 1-physical-antenna.
One embodiment may describe a method for augmenting Downlink (DL) reciprocity-based MU-MIMO performance. The UE may specify one or more UE Rx Effective Antennas (EA) candidates. Subsequent to this, the UE may transmit Uplink (UL) signals that could include UL Sounding Reference Signals (SRS) for reciprocity-based MU-MIMO. These signals may assist the gNB in estimating the DL channel.
Once received at the gNB, the DL channel response may be estimated using the concept of UL reciprocity. Following this estimation, the gNB may select one or more UE Rx EA candidates based on their estimated performance in facilitating DL transmission, among other factors like channel conditions, interference levels, and UE mobility.
The gNB might further design a DL precoder. This precoder's design may focus on optimizing spatial information of the selected UE Rx EA(s), potentially minimizing interference, and aiming to maximize signal quality. The UE, upon reception, may decode the DL data utilizing one or more of the specified or selected UE Rx EA(s).
In some scenarios, the selection of UE Rx EA candidates may undergo iterative refinement. This might be based on several inputs such as feedback from the gNB, the estimated DL channel response, or historical data from the UE. Random or predefined selection methodologies might also be implemented.
The gNB might receive UL signals from the UE, transmitted via the specified UE Rx EA(s). Based on these signals, the gNB could estimate the DL channel response. It may also select one or more UE Rx EA candidates for DL transmission, taking into account various factors. This might also include the adjustment of these candidates based on changes in the wireless environment. Additionally, the gNB may transmit information regarding the selection of said UE Rx EA candidate(s) back to the UE.
A gNB device, aiming to boost Reciprocity-based MU-MIMO performance, might comprise a processing unit and a memory unit loaded with operational instructions. Upon their execution, these instructions could guide the gNB device in tasks like DL channel response estimation and DL precoder construction. Moreover, the gNB might also select UE Effective Antenna(s) or EA(s) from pre-defined candidates and communicate these selections to the UE.
Importantly, the gNB device may have the capability to construct UE Rx EAs via merging its own Tx antenna elements. This method of construction could then be refined based on feedback from the UE or specific performance metrics.
Lastly, there might be a focus on designing or selecting UE Rx EAs with inherent interference rejection capabilities. Techniques such as spatial filtering or other interference mitigation methods may be employed to potentially enhance signal quality and performance.
One or more elements or aspects or steps, or any portion(s) thereof, from one or more of any of the systems and methods described herein may be combined with one or more elements or aspects or steps, or any portion(s) thereof, from one or more of any of the other systems and methods described herein and combinations thereof, to form one or more additional implementations and/or claims of the present disclosure.
One or more of the components, steps, features, and/or functions illustrated in the figures may be rearranged and/or combined into a single component, block, feature or function or embodied in several components, steps, or functions. Additional elements, components, steps, and/or functions may also be added without departing from the disclosure. The apparatus, devices, and/or components illustrated in the Figures may be configured to perform one or more of the methods, features, or steps described in the Figures. The algorithms described herein may also be efficiently implemented in software and/or embedded in hardware.
Reference in the specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.
Some portions of the detailed description are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the methods used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared or otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers or the like.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following disclosure, it is appreciated that throughout the disclosure terms such as “processing,” “computing,” “calculating,” “determining,” “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system's memories or registers or other such information storage, transmission or display.
Finally, the algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general-purpose systems may be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these systems will appear from the description below. It will be appreciated that a variety of programming languages may be used to implement the teachings of the invention as described herein.
The figures and the following description describe certain embodiments by way of illustration only. One skilled in the art will readily recognize from the following description that alternative embodiments of the structures and methods illustrated herein may be employed without departing from the principles described herein. Reference will now be made in detail to several embodiments, examples of which are illustrated in the accompanying figures. It is noted that wherever practicable similar or like reference numbers may be used in the figures to indicate similar or like functionality.
The foregoing description of the embodiments of the present invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the present invention to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. It is intended that the scope of the present invention be limited not by this detailed description, but rather by the claims of this application. As will be understood by those familiar with the art, the present invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. Likewise, the particular naming and division of the modules, routines, features, attributes, methodologies and other aspects are not mandatory or significant, and the mechanisms that implement the present invention or its features may have different names, divisions and/or formats.
Furthermore, as will be apparent to one of ordinary skill in the relevant art, the modules, routines, features, attributes, methodologies and other aspects of the present invention can be implemented as software, hardware, firmware or any combination of the three. Also, wherever a component, an example of which is a module, of the present invention is implemented as software, the component can be implemented as a standalone program, as part of a larger program, as a plurality of separate programs, as a statically or dynamically linked library, as a kernel loadable module, as a device driver, and/or in every and any other way known now or in the future to those of ordinary skill in the art of computer programming.
Additionally, the present invention is in no way limited to implementation in any specific programming language, or for any specific operating system or environment. Accordingly, the disclosure of the present invention is intended to be illustrative, but not limiting, of the scope of the present invention, which is set forth in the following claims.
It is understood that the specific order or hierarchy of blocks in the processes/flowcharts disclosed is an illustration of example approaches. Based upon design preferences, it is understood that the specific order or hierarchy of blocks in the processes/flowcharts may be rearranged. Further, some blocks may be combined or omitted. The accompanying method claims present elements of the various blocks in a sample order and are not meant to be limited to the specific order or hierarchy presented.
The previous description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects. Thus, the claims are not intended to be limited to the aspects shown herein, but is to be accorded the full scope consistent with the language claims, wherein reference to an element in the singular is not intended to mean “one and only one” unless specifically so stated, but rather “one or more.” The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any aspect described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects. Unless specifically stated otherwise, the term “some” refers to one or more. Combinations such as “at least one of A, B, or C,” “one or more of A, B, or C,” “at least one of A, B, and C,” “one or more of A, B, and C,” and “A, B, C, or any combination thereof” include any combination of A, B, and/or C, and may include multiples of A, multiples of B, or multiples of C. Specifically, combinations such as “at least one of A, B, or C,” “one or more of A, B, or C,” “at least one of A, B, and C,” “one or more of A, B, and C,” and “A, B, C, or any combination thereof” may be A only, B only, C only, A and B, A and C, B and C, or A and B and C, where any such combinations may contain one or more member or members of A, B, or C. All structural and functional equivalents to the elements of the various aspects described throughout this disclosure that are known or later come to be known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be encompassed by the claims. Moreover, nothing disclosed herein is intended to be dedicated to the public regardless of whether such disclosure is explicitly recited in the claims. The words “module,” “mechanism,” “element,” “device,” and the like may not be a substitute for the word “means.” As such, no claim element is to be construed as a means plus function unless the element is expressly recited using the phrase “means for.”