The present invention relates generally to a system and method for digital communications, and, in particular embodiments, to a system and method for large scale multiple input multiple output (MIMO) communications.
In general, multiple input multiple output (MIMO) increases the capacity of a radio link through the use of multiple transmit antennas and multiple receive antennas. MIMO exploits multipath propagation to increase the capacity of the radio link. MIMO has proven to be effective at increasing the capacity of the radio link and has been accepted into a variety of technical standards, including WiFi or Wireless LAN: IEEE 802.11n, and IEEE 802.11ac; Evolved High-Speed Packet Access (HSPA+); Worldwide Interoperability for Microwave Access (WiMAX); and Third Generation Partnership Project (3GPP) Long Term Evolution (LTE) Advanced.
Increasing the number of transmit antennas and receive antennas from a relatively small number (on the order of 10 or fewer) to a significantly larger number (on the order of 100, 1000, 10000, or more) can lead to even greater increases in the capacity of the radio link. However, dramatically increasing the number of transmit antennas and receive antennas also greatly increases the computational complexity involved in signal processing, as well as the amount of data exchanged between the antennas and a processing unit supporting MIMO communications. Therefore, there is a need for systems and methods for supporting large scale MIMO communications.
Example embodiments provide a system and method for large scale multiple input multiple output (MIMO) communications.
In accordance with an example embodiment, a method for communicating using a large scale MIMO antenna array is provided. The method includes determining, by a transmitting device, angular domain channel estimates of the large scale MIMO antenna array in accordance with antenna domain channel estimates of the large scale MIMO antenna array, and identifying, by the transmitting device, significant beams of the large scale MIMO antenna array by maximizing the angular domain channel estimates. The method includes communicating, by the transmitting device, with at least one receiving device utilizing the significant beams as identified.
In accordance with an example embodiment, a non-transitory computer-readable medium storing programming for execution by a processor is provided. The programming includes instructions to determine angular domain channel estimates of a large scale MIMO antenna array in accordance with antenna domain channel estimates of the large scale MIMO antenna array, identify significant beams of the large scale MIMO antenna array by maximizing the angular domain channel estimates, and communicate with at least one receiving device utilizing the significant beams as identified.
In accordance with an example embodiment, a large scale MIMO communications device is provided. The large scale MIMO device includes an antenna array, a processor, and a computer readable storage medium storing programming for execution by the processor. The programming including instructions configuring the large scale MIMO communications device to determine angular domain channel estimates of a large scale MIMO antenna array in accordance with antenna domain channel estimates of the large scale MIMO antenna array, identify significant beams of the large scale MIMO antenna array by maximizing the angular domain channel estimates, and communicate with at least one receiving device utilizing the significant beams as identified.
In accordance with an example embodiment, a method for decoding received signals is provided. The method includes transforming, by a receiving device, antenna domain received signals into angular domain received signals, and selecting, by the receiving device, antenna beams with an average energy levels exceeding a specified threshold out of available antenna beams of the receiving device. The method includes updating, by the receiving device, a received signal vector in accordance with the selected antenna beams, determining, by the receiving device, angular domain channel estimates and an angular domain noise covariance matrix in accordance with the updated received signal vector, and decoding, by the receiving device, the updated received signal vector utilizing an interference rejection combining (IRC) algorithm.
In accordance with an example embodiment, a non-transitory computer-readable medium storing programming for execution by a processor is provided. The programming including instructions to transform antenna domain received signals into angular domain received signals, select antenna beams with an average energy levels exceeding a specified threshold out of available antenna beams of a receiving device, and update a received signal vector in accordance with the selected antenna beams. The programming including instructions to determine angular domain channel estimates and an angular domain noise covariance matrix in accordance with the updated received signal vector, and decode the updated received signal vector utilizing an IRC algorithm.
For a more complete understanding of the present disclosure, and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:
The operating of the current example embodiments and the structure thereof are discussed in detail below. It should be appreciated, however, that the present disclosure provides many applicable inventive concepts that can be embodied in a wide variety of specific contexts. The specific embodiments discussed are merely illustrative of specific structures of the embodiments and ways to operate the embodiments disclosed herein, and do not limit the scope of the disclosure.
The embodiments will be described with respect to example embodiments in a specific context, namely MIMO communications systems that support very large numbers of transmit antennas and receive antennas. The embodiments may be applied to standards compliant FD communications systems, such as those that are compliant with Third Generation Partnership Project (3GPP), IEEE 802.11, WiMAX, HSPA, and the like, technical standards, and non-standards compliant MIMO communications systems, that support very large numbers of transmit antennas and receive antennas.
While it is understood that communications systems may employ multiple base stations capable of communicating with a number of users, only one base station, and three users are illustrated for simplicity.
In communications system 100, the K users share the same communications system resources (such as time-frequency resources). To simplify discussion, each user is equipped with only one antenna. However, the example embodiments presented herein are operable with users with any number of antennas. Each of the M receive antennas at MIMO base station 105 are equipped with its own radio frequency (RF) hardware (such as filters, amplifiers, mixers, modulators, demodulators, constellation mappers, constellation demappers, and the like), analog to digital (A/D) converters, digital to analog (D/A) converters, as well as a local processing unit that is capable of performing a limited amount of processing. The local processing unit, the antenna and the associated hardware may be referred to as an antenna unit (AU). The local processing unit is referred to herein as an AU processing unit.
Communications system 100 may be represented as a mathematical model expressible as:
where X is a transmitted symbol vector of length K in which each element xk represents a data symbol associated with user k; Y is a received sample vector of length M in which each element ym represents a sample of receive antenna m; N is a receiver noise sample vector of length M in which each element nm represents the noise receive on receive antenna m, it is assumed that N is additive white Gaussian noise (AWGN); A is a channel matrix of size M by K in which each element am,k represents a channel transfer function between user k and receive antenna m; K is the number of users served by MIMO base station 105; and M is the number of receive antennas of MIMO base station 105. In general, a MIMO receiver has to resolve the above expression and given the received sample vector Y, find an estimate of the transmitted symbol vector X (denoted {circumflex over (X)}) that is as close as possible to the transmitted symbol vector X.
There is a plurality of techniques that a MIMO receiver, such as one implemented in a central processing unit located in a MIMO base station, can use to solve the above expression. A first MIMO decoder technique that may be used is referred to as a maximum likelihood (ML) decoder. A ML decoder searches for a solution that as minimum distance D between the received sample vector Y and the estimate of the transmitted symbol vector {circumflex over (X)}, which may be expressed mathematically as:
where R=AT·Y is a maximum ratio combining (MRC) vector of length K, Acor is an autocorrelation matrix with dimension K by K., and (.)T is a transpose operator.
A second MIMO decoder technique that may be used is referred to as an interference cancelling (IC) decoder. An IC decoder checks all possible combinations of the estimate of the transmitted symbol vector {circumflex over (X)} to find the solution. The IC decoder iteratively searches for a ML solution that has the minimum distance by taking a gradient of the distance, which is a highly computationally intensive process. The IC decoder may be expressed mathematically as:
where Acor is an autocorrelation matrix with dimension K by K.
A third MIMO decoder technique that may be used is referred to as a MRC decoder. A MRC decoder attempts to find the solution by minimizing a signal to additive noise ratio. The MRC decoder may be expressed mathematically as:
where Es is symbol energy and are diagonal elements of the autocorrelation matrix Acor.
A fourth MIMO decoder technique that may be used is referred to as a zero forcing (ZF) decoder. A ZF decoder attempts to find the solution by minimizing multi-user interference. The ZF decoder may be expressed mathematically as:
XZF=inv(Acor)·R.
A fifth MIMO decoder technique that may be used is referred to as a minimum mean square error (MMSE) decoder. A MMSE decoder is a compromise between MRC and ZF decoders and attempts to find the solution by minimizing a common mean square error. The MMSE decoder may be expressed mathematically as:
It is noted that each of the five MIMO decoder techniques presented above have only two inputs:
R=AT·Y (where R is a MRC vector of length K),
and
Acor=AT·A (where Acor is an autocorrelation matrix with dimension K by K).
The dimensions of both of the two inputs are dependent only on the number of users K and not on the number of receive antennas M. The number of users K places demands on the bit rate of the communications system, while the number of receive antennas M is representative of the number of receive antennas that can be associated with a base station (either actually located at the base station or controlled by the base station but remotely located). It is expected that both K and M will continue to grow, but M is expected to grow faster than K. In other words, M>>K. A summary of the five MIMO decoder techniques in equation form and their respective algorithm complexity is presented in tabular form.
Additionally, in the five MIMO decoder techniques presented above, a central processing unit located in the MIMO base station that is implementing one or more of the five MIMO decoder techniques does not need to know all inputs Y and channel estimates A of all of the M receive antennas. It is sufficient that the central processing unit has knowledge of the MRC vector R and the autocorrelation matrix Acor (with dimension K and K by K, respectively) to implement any and all of the five MIMO decoder techniques.
Communications system 200 may be represented as a mathematical model expressible as:
where X is a transmitted symbol vector of length K in which each element xk represents a symbol of user k; R is a received sampled vector of length K in which each element rk represents a sample received by user k; N is a received noise vector of length K in which each element nk represents noise received by user k (it is assumed that N is AWGN); A is a channel matrix of size M by K in which each element am,k represents the channel transfer function between user k and transmit antenna m; and W is a precoding matrix of size K by M.
There are several ways to define the precoding matrix W. A ZF precoding matrix fully removes multi-user interference and is expressible as
W=AT·inv(A·AT)=AT·inv(Acor)
where AT is a transposed channel matrix of size K by M, and inv(Acor) is an inverse autocorrelation matrix of size M by M.
It is possible to re-express the above expression for R as
R=A·W·X+N=A·AT·inv(Acor)·X+N=A·AT·S+N
where S=inv(Acor)·X is a precoded symbol vector of length K. If M is sufficiently large, the autocorrelation matrix converges to an identify matrix (Acor=inv(Acor)=I). Therefore, it is possible to skip the multiplication by inv(Acor). Such a transmitter may be referred to as a MRC transmitter.
As discussed previously, beamforming is a signal processing technique used for directional communications (signal transmission and/or reception). Beamforming involves combining antenna elements in such a way that some directions experience constructive interference while other directions experience destructive interference, therefore generating a communications beam in an intended direction. Therefore, in order to utilize beamforming, a communications device needs to obtain directional information regarding other communications devices with which it is communicating. From the directional information, the communications device may be able to generate antenna coefficients to generate communications beams directed towards the other communications devices.
Operations 300 begin with the large scale MIMO communications device generating beamforming coefficients for the antennas of the antenna array (block 305). The generation of the beamforming coefficients may include the large scale MIMO communications device performing acquisition to obtain directional information regarding other communications devices with which it is communicating (block 310), measuring positions for each of the antennas in the antenna array (block 312), determining channel gains for channels between the antennas and the other communications devices (block 314), and generating the antenna beamforming coefficients based on the channel gains (block 316). Detailed discussions of the measuring of the positions for each of the antennas in the antenna array, the generating of the channel gains, and the generating of the antenna beamforming coefficients are provided below.
The large scale MIMO communications device applies the beamforming coefficients (block 320). Applying the beamforming coefficients may involve providing appropriate beamforming coefficients to the antennas of the antenna array. The large scale MIMO communications device communicates with the other communications devices using the antenna array (block 325). The large scale MIMO communications device may transmit using the antenna array, receive using the antenna array, or a combination of both.
Typically, performing acquisition to obtain directional information involves the large scale MIMO communications device using an antenna array to scan over a search space using communications beams to measure received energy from the other communications devices. The large scale MIMO communications device may select a number of communications beams corresponding to measured received energy exceeding a specified threshold. The selected communications beams correspond to the directions of the other communications devices. Normally, the acquisition process may be slow because the large scale MIMO communications device may have a large number of communications beams with which to scan the search space. Furthermore, when the antenna array of the large scale MIMO communications device has a large number of antennas, the communications beams generated by the antenna array are narrow, which may require the large scale MIMO communications device to use a large number of communications beams to fully scan the search space. In a co-assigned U.S. patent application Ser. No. 14/867,931, entitled “System and Method for Large Scale Multiple Input Multiple Output Communications”, filed Sep. 28, 2015, which is hereby incorporated herein by reference, a fast acquisition technique is presented which helps to speed up the acquisition process by partitioning the search space and the antenna array. In the fast acquisition technique, different portions of the antenna array are assigned to scan different parts of the search space. Reducing the size of the search space affords a reduction in the time required to scan the search space. An additional reduction in the scanning time is obtained due to the wider communications beams generated by the smaller number of antennas in each portion of the antenna array; the wider communications beams help to speed up the scan of the search space. Therefore, the combination of the smaller search space and the wider communications beams significantly shortens the acquisition time.
According to an example embodiment, a time of arrival (TOA) method is used to determine coordinates of each antenna in an antenna array. TOA is a technique that is used in positioning systems, such as Global Positioning System (GPS). TOA uses delays in received reference signals transmitted by a plurality of reference signal generators to determine the position of an antenna that received the reference signals.
Reference signal generators transmit orthogonal reference signals that individually arrive at antenna M 505 with different delay. The delays associated with the reference signals are expressible as
c2·(τm0−tm)2=(X0−xm)2+(Y0−ym)2+(Z0−zm)2
c2·(τm1−tm)2=(X1−xm)2+(Y1−ym)2+(Z1−zm)2
c2·(τm2−tm)2=(X2−xm)2+(Y2−ym)2+(Z2−zm)2′
c2·(τm3−tm)2=(X3−xm)2+(Y3−ym)2+(Z3−zm)2
where (Xk,Yk,Zk) is the coordinates of a k-th reference signal generator, (xm,ym,zm) is the unknown coordinates of antenna M 505, tm is an unknown time offset of antenna M 505, τmk is a time of arrival of reference signals sent by reference signal generator k at antenna M 505, and c is the speed of light. Because there are 4 equations and 4 unknowns (xm,ym,zm,tm), it is possible to solve for the 4 unknowns to determine the coordinates of antenna M 505 and the time offset for antenna M 505 (xm,ym,zm,tm).
In an outdoor deployment, it may be possible to use an existing positioning system, such as GPS, for example, to determine the positions of the antennas in an antenna array. However, in an indoor deployment where GPS signals have trouble penetrating walls, a portable reference signal generating system may be used.
According to an alternative example embodiment, if the positions of 4 or more of the antennas of an antenna array are known, the 4 or more antennas are used as reference signal generators and send orthogonal reference signals to be used to determine the positions of the remaining antennas of the antenna array.
Because the antennas of the antenna array are usually in a constant location or moving very slowly, the antenna array is stable. Therefore, there is not a problem with antenna position determining precision. The determining of the position of the antennas may be performed during a wake up, initialization, or re-initialization process. Hence, there are typically no strict time limits on determining the positions of the antennas of the antenna array. The relatively relaxed time constraints may enable position estimation averaging over an extended amount of time in order to obtain a desired level of precision, with position estimation precision increasing with increased averaging time.
According to an example embodiment, the channel gains are determined for the antennas in the antenna array based on the positions of the antennas and the directional information. The channel gains are determined for channels from each of the antennas in the antenna array to each of the other communications devices.
In a typical large scale MIMO implementation, a large number (M×N) omni-directional antennas are mounted on a flat surface with a consistent spacing between antennas (a·λ×b·λ), where N and M are integer values and l is wavelength of a signal.
Therefore, the beam arrives at antenna #n 705 with a complex gain expressible as
Hence, antenna arrays that are tuned to the receive the signal from direction α may be configured with coefficients that match the complex gain Hn*(α).
Therefore, the beam arrives at antenna (n,m) 755 with a complex gain expressible as
Hence, antenna arrays that are tuned to the receive the signal from direction (α,β) may be configured with coefficients that match the complex gain Hn,m*(α,β).
The antennas of the large scale MIMO antenna arrays discussed in
Hn,m(α,β)=exp(j·2·π·(n·a·cos(α)·cos(β)+m·b·cos(α)·sin(β))).
Therefore, the channel for antenna (n,m) located at
is expressible as
where Gk is the complex amplitude of beam k.
However, the antennas in the antenna array do not have to be in a plane, nor does the antenna spacing have to be uniform. For discussion purposes, consider a situation wherein a large scale MIMO communications device has an antenna array with P antennas where the antennas are located at a set of coordinates (x,y,z)p.
According to the definition of a far field, in order to determine the coefficients for the antennas for direction (α,β), the distance from the antenna array to the target in direction (α,β) must be at least an order of magnitude greater than the size of the antenna array. The coordinates of the target are expressible as
xT=R·cos(α)·cos(β),
yT=R·cos(α)·sin(β),
zT=R·sin(α),
where R is at least an order of magnitude greater than √{square root over (xp2+yp2+zp2)} for any antenna p. It may be shown that the complex gain of each antenna p is expressible as
which may be normalized as
It can also be shown that
Therefore, the channel for antenna m located at (xm,ym,zm) is expressible as
where Gk is the complex amplitude of beam k and antenna 0 is located at reference point (x0,y0,z0).
A received sample of antenna m at time t is expressible as
Ym(t)=Hm·D(t)+Noisem(t),
where Noisem(t) is the thermal noise of antenna m at time t, and D(t) is the data symbol at time t, which also can be re-written as
Using multi-beam maximum ratio combining (MRC) decoding, an output at time t of a MRC decoder is expressible as
which also can be re-written as
where Rk(t,αk,βk) is the MRC decoder output for beam k at time t, which is expressible as
Utilizing the expressions for Rk(t,αk,βk) and Ym(t) above, and because the beams are orthogonal to each other, it may be shown that the MRC decoder output for beam k at time t is approximately equal to the data symbol at time t multiplied by the complex amplitude of beam k: Rk(t,αk,βk)≈Gk·D(t). Suppose that the pilot sequence of length N is known (i.e., D(t)=PLT(t) For (0≤t<N)), then the Least Mean Squared (LMS) complex gain estimation is expressible as
The expression for Hp(α,β) and
The antenna array, which may be non-planar with non-uniform antenna spacing, may also be non-rigid. Being non-rigid means that the antennas in the antenna array may move or otherwise change position as a function of time. Although the antennas in the antenna array may move, reference signal generators (such as shown in
According to an example embodiment, the surface area of a lighter than air airship provides for a very large antenna array that is usable in implementing a communications system with extremely narrow communications beams. As discussed previously, a beamwidth of a communications beam is inversely proportional to the number of antennas of the antenna array. Furthermore, the communications beam will have a very large antenna gain that compensates for long distance losses.
According to an example embodiment, a very large antenna array disposed on the surface of a lighter than air airship provides coverage for state-sized areas. The extremely narrow communications beams, coupled with very large antenna gains, may allow for communications system with a coverage area on the order of a hundred thousand or more square miles.
The communications system as described in
Array of AUs 1110 may be arranged in a mesh configuration. Each AU in array of AUs 1110 is connected to a subset of neighboring AUs. As an illustrative example, AU 1115 is located at a vertex and is connected to two neighboring AUs (AU 1117 and AU 1121). While AU 1117 is located on an edge and is connected to three neighboring AUs (AU 1115, AU 1119, and AU 1123) and AU 1119 is located in a field of AUs and is connected to four neighboring AUs (AU 1117, AU 1121, AU 1125, and AU 1127). The AUs in array of AUs 1110 may be connected to central processing unit 1105 by one or more buses. Alternatively, central processing unit 1105 may be connected to a subset of the AUs in array AUs 1110. As an illustrative example, array of AUs 1110 may include an end AU 1130 that is connected to a subset of neighboring AUs (two neighboring AUs as shown in
The AUs in array of AUs 1110 may be spaced regularly apart from one another, e.g., the AUs (or the antennas therein) are spaced one-half wavelength apart. Alternatively, the AUs in array of AUs 1110 may be irregularly spaced apart from one another, e.g., some AUs may be spaced regularly apart while others may be irregularly spaced apart, or none of the AUs are spaced apart by the same amount. The AUs in array of AUs 1110 may be planar (where all of the AUs lie in a single plane) or non-planar (where at least some of the AUs lie in different planes).
In
According to an example embodiment, a MIMO communications device with a distributed array of AUs is presented. The example MIMO communications devices discussed in
The leaves may be coupled to each other (and the central processing unit) by way of a high speed bus or connection. As shown in
Autocorrelation connection 1420 allows for the exchange of the accumulated autocorrelation matrix and has sufficient bandwidth to support the transfer of K by K-sized matrices. MRC connection 1425 allows for the exchange of the accumulated MRC vector and has sufficient bandwidth to support the transfer of K-sized vectors. Reference connection 1430 allows for the exchange of reference signals for use in channel estimation and has sufficient bandwidth to support the transfer of K-sized vectors. TX symbols connection 1435 allows for the exchange of TX symbols for transmission precoding and transmission and has sufficient bandwidth to support the transfer of K-sized vectors. The connections may be bi-directional in nature, allowing the AUs in the plurality of AUs to exchange information with one another. A control bus allows for the exchange of control signals regulating the operation of MIMO communications device.
MIMO communications device 1400 includes a plurality of adders (such as adders 1445 and 1450) to accumulate information from neighboring AUs. As shown in
A positioning unit 1518 is configured to assist in determining a position of AU 1500 using received reference signals (such as those transmitted by positioning systems 500 and 900), while a multiply unit 1522 is configured to multiply coefficients provided by coefficients unit 1520 with signals provided by the central processing unit. As an illustrative example, multiply unit 1522 may multiply transmission symbols provided by the central processing unit with channel transfer functions. An adder 1528 combines the outputs of multiplier 1528 and provides the combine value to a D/A converter 1520. AU 1500 also includes transmitter RF circuitry 1532, which may include filters, modulators, constellation mappers, and so on.
According to an example embodiment, each receive AU includes an AU processing unit which implement distributed computing to reduce computational load at the central processing unit, as well as the amount of data exchanged between the AUs and the central processing unit. Since the central processing unit that is implementing one or more of the five MIMO decoder techniques does not need to know all inputs Y and channel estimates A of all of the M receive antennas, it is possible to utilize AU processing units in the AUs to implement distributed (or cloud) computing. Results of the distributed computing performed at individual AUs are shared with other AUs, and eventually, the central processing unit where the results are used to estimate the received transmissions.
According to an example embodiment, a MRC vector R is represented as an accumulation of increments from the M receive antennas. The MRC vector R is expressible as
where Rm is the component of the MRC vector R that is associated with receive antenna #m and is a vector of length K, ym is a sample that is received by receive antenna #m, and Am is an m-th row of channel matrix A that is associated with receive antenna #m and is a vector of length K. Therefore, the MRC vector R may be simply generated by summing individual Rm components received from each of the M receive antennas. If the summation is performed at the AU processing units, the central processing unit may not need to perform significant processing to determine the MRC vector R.
According to an example embodiment, an autocorrelation matrix Acor is represented as an accumulation of increments from the M receive antennas. The autocorrelation matrix Acor is expressible as
where Acorm is a component of the autocorrelation matrix that is associated with receive antenna #m, and Am is an m-th row of channel matrix A that is associated with receive antenna #m and is a vector of length K. Therefore, the autocorrelation matrix Acor may be simply generated by summing individual Acorm components received from each of the M receive antennas. If the summation is performed at the AUs, the central processing unit may not need to perform significant processing to determine the autocorrelation matrix Acor.
According to an example embodiment, it is also possible to perform MIMO precoding in a distributed computing manner. It is possible to make the following conclusions:
1. A central processing unit does not have to know channel matrix A with size M by K. It is sufficient to know a much smaller autocorrelation matrix Acor with size M by M.
2. Multiplication with the transposed channel matrix AT with size K by M may be performed independently in each AU by the individual AU processing units, for example. Each AU may multiply precoded symbols vector S with a vector AmT that represents row #m of channel matrix A as related to transmit antenna m.
3. If the communications system is operating in time division duplexed (TDD) mode, an uplink channel estimate may be used as the downlink channel estimate.
As discussed previously, a central processing unit does not need to know channel information of each transmit antenna. It is sufficient to know only accumulated autocorrelation matrix with a smaller size of K by K. Therefore, each AU may be able to maintain its own channel information without having to transfer the channel information to the central processing unit.
When dealing with the uplink (a transmission from a user to a base station), each user transmits its own reference signal for use in channel estimation. Therefore, the total number of reference signals is equal to the number of users K Each AU (e.g., AU #m) may use the K reference signals to estimate channel vector Am with length K. If a least mean squared (LMS) algorithm is used in the estimation, the estimated channel vector is expressible as
where N is the length of the reference sequence (also referred to as accumulation length), ym is a sample that is received by receive antenna #m, and refk(n) is the reference signal for user k.
As discussed previously, it is possible to generate beams that have desired directions (α,β). As an example,
In general, the coefficients for receive antenna unit #P 2009 for a single antenna beam with angle (α,β) is expressible as
where (x,y,z)p is the coordinates of receive antenna unit #p 2009, and (xo,yo,zo)P is the reference coordinates of massive MIMO multi-beam receiver 2000. Similarly, the coefficients for receive antenna unit #P 2009 for multiple beams with multiple angles is expressible as
However, determining the angles for the multiple beams may be a difficult task since a search space to determine the angles is very large. Therefore, the scanning of the search space to find the angles with the most energy can take an extended amount of time. Furthermore, since the beam width of antenna beams generated by a communications device (e.g., a massive MIMO multi-beam receiver) is inversely proportional to the number of antennas, the scan of the search space takes an even greater amount of time due to the narrow beam width of the antenna beams generated by the massive MIMO multi-beam receiver.
According to an example embodiment, a distributed approach is applied to the scanning of the search space to find the angles with the most energy. The search space is partitioned into a plurality of independent portions that may be separately scanned. Since each independent portion is smaller, the scan of each independent portion will take less time.
According to an example embodiment, the inverse relationship between the beam width of antenna beams generated by a communications device and the number of antennas of the communications device used to generate the antenna beams is exploited. Since the beam width of the antenna beams will generally increase as the number of antennas used to generate the antenna beams, the number of antennas used to generate the antenna beams that are used in the scanning of the search space is decreased to increase the beam width of the antenna beams. The greater beam width of the resulting antenna beams may shorten the amount of time to scan the search space due to increased search granularity.
According to an example embodiment, both the distributed approach and the antenna beam width are used to help accelerate the scan of the search space. The combining of both techniques may help further speed up the finding of the angles of the antenna beams.
According to an example embodiment, once the angles of the antenna beams are found, antenna beams with narrower beam widths are used to increase precision. A two-stage process is used to increase performance. In a first stage, the finding of the angles of the antenna beams is performed quickly with smaller search spaces and wider beam widths, while in a second stage, after the angles have been found increased precision is achieved by using antenna beams with narrower beam widths.
Operations 2100 may begin with a partitioning of an antenna array into a plurality of independent antenna array portions (block 2105). The antenna array may be partitioning into an integer number of independent antenna array portions. As illustrative examples, the antenna array is partitioned into 2, 4, 8, 16, and so on, independent antenna array portions. In general, as the number of antennas in the independent antenna array portions decreases as the number of independent antenna array portions increases. However, overhead also increases. Each independent antenna array portion may contain about the same number of antennas to simplify implementation. Each independent antenna array portion is assigned to scan a different part of the search space (block 2110). The search space may be partitioned into a plurality of search space portions. The number of search space portions may be equal to the number of independent antenna array portions. Alternatively, there may be more search space portions than the number of independent antenna array portions. In such a situation, each independent antenna array portion scans one or more search space portions.
Each independent antenna array portion measures received energy from the search space portion(s) assigned to it (block 2115). Since the independent array portions comprise a smaller number of antennas than the antenna array, the beam widths of the antenna beams will be greater, thereby speeding up the scan of the search space portion(s). As an illustrative example, a measurement process includes a central processing unit associated with an independent antenna array portion configures an antenna beam so that it is directed inside the search space portion assigned to the independent antenna array portion and measures an energy level associated by the antenna beam. The central processing unit continues the measurement process with other antenna beams until the search space portion has been measured. If the independent antenna array portion has been assigned multiple search space portions, the measurement process may continue until all assigned multiple search space portions have been scanned.
The antenna beam(s) associated with the highest energy levels are selected (block 2120). The number of antenna beams selected may be a configurable number. As an illustrative example, if there is a large number of search space portions, only a relatively small number of antenna beams are selected (for example, 1 or 2 antenna beams per search space portion). While, if there is a small number of search space portions, a relatively large number of antenna beams are selected (for example, 4 or 5 antenna beams per search space portion). Alternatively, every antenna beam with a measured energy level exceeding a threshold is selected. Alternatively, a combination of a number of antenna beams and a threshold is used in the selection of antenna beams. The selected antenna beams from different search space portion is combined (block 2125). The antenna array, in its entirety, is used with the selected antenna beams to communicate (block 2130). The use of the antenna array, with its larger number of antennas, results in narrower beam width antenna beams. The narrower beam width antenna beams provide greater precision, such as in receiving more of a transmission to the massive MIMO communications device while receive less noise and/or interference since the transmission encompasses a larger percentage of the narrower beam width antenna beam.
It is noted that the conventional LMS algorithm does not work well when the number of antennas is large because the SNR per antenna is reduced by M in order to maintain an accumulated SNR, where M is the number of antennas. As an illustrative example, if M=100, then the per antenna SNR is 20 dB below nominal (10 log10(M)). In order to estimate the channel with such a low SNR using the convention per antenna LMS algorithm, the pilot sequence must be increased M times. With the increasing number of antennas, it may not be possible to continue to increase the pilot sequence.
Another significant limitation of the conventional LMS algorithm is that it is applicable only for the uplink channels. In order to estimate the downlink channel, multiple unique pilot sequences must be allocated to each antenna. In situations with large numbers of antennas, the simply is not a sufficient number of unique pilot sequences or if there is a sufficient number of unique pilot sequences, the communications overhead dominates overall communications system performance and leads to poor performance. An alternative is to employ channel reciprocity to extrapolate the downlink channel using the estimate of the uplink channel. However, channel reciprocity typically works well for TDD communications modes and yields poor results in frequency division duplexed (FDD) communications modes because in TDD, the same frequency bands are used for both uplink and downlink channels, while in FDD, different frequency bands are used for uplink and downlink channels. Therefore, the characterization of the uplink channel may not apply to the downlink channel.
Therefore, channel estimation is a major issue and bottleneck for massive and large scale MIMO operation. One approach to channel estimation is to represent the channel as a set of beams with different directions of arrival or departure. However, multi-beam channel representation does not fit many situations when considering the near field scenario, such as indoor, multi-cell cooperation, and so on.
According to an example embodiment, the channel between an antenna m and a user k is expressible as a superposition of S beams. In general, S is much smaller than M (the number of antennas in a large scale MIMO antenna array). In
In a random displacement deployment, where the antennas of antenna array 402 are not necessarily planar nor equality spaced, the multipath uplink and downlink channels for antenna m as a function of S beams are expressible as
hUL,m(nF)=Σs=1SaUL,s·exp(j·2·π·nF·Δf·τs)·steeringm(fUL+nF·Δf,αs,βs)
and
hDL,m(nF)=Σs=1SaDL,s·exp(j·2·π·nF·Δf·τs)·steeringm(fDL+nF·Δf,αs,βs)
Where: (xm,ym,zm) is the location of antenna m;
Where: c is the speed of light.
Therefore, not only are the channels expressible using the S beams, the beams themselves may be characterized with only four parameters, i.e., beam s is characterized by parameters (as,αs,βs,τs). Hence, as the number of antennas continues to increase, it may be computationally less complex to estimate the channels using the S beams instead of the M antennas because the number of beams is usually a function of users and may remain relatively constant as the number of antennas continue to increase.
It is possible to represent an estimate of the multipath channel m as a function of antennas in the antenna array (i.e., the estimate of the multipath channel in the antenna domain) as
Where: NREF is the length of the reference or pilot sequence;
Using superposition, the estimate of the multipath channel k in the antenna domain may be converted into an estimate of the multipath channel as a function of angles (i.e., the estimate of the multipath channel in the angular domain) relative to the antenna array. The estimate of the multipath channel k in the angular domain is expressible as:
Where: M is the number of receive antennas;
The estimate of the multipath channel in the angular domain is analogous to a beam s in the time domain and may be characterized using four parameters: complex amplitude a; angles of arrival or departure α and β; and delay τ. Therefore, it is possible to find the beams by maximizing the estimate of the multipath channel in the angular domain ĥk(α,β,τ).
According to an example embodiment, the estimate of the multipath channel is based on the beams with amplitudes that exceed a threshold. The use of a threshold to select the beams used to estimate the multipath channel may reduce the overall number of beams used to estimate the multipath channel, thereby simplifying the estimate. A variety of search techniques are available for use in finding the beams and a simple threshold comparison may be used to determine which ones of the found beams are used in estimating the multipath channel.
The beams may be found by maximizing ĥk(α,β,τ). In general, the parameters α,β′,τ of a beam s for user k may be found by evaluating the expression
(αk,s,βk,s,τk,s)=arg max(α,β,τ)(ĥk(α,β,τ),
Where: arg max(α,β,τ)(ĥk(α,β,τ) provides the (α,β,τ) that maximizes the function ĥk(α,β,τ).
While the parameter a for a beam s for user k may be found by evaluating the expression
ak,s=ĥk(αk,s,βk,s,τk,s).
The actual multipath channels in the angular domain are expressible as
hk(α,β,τ)=Σs=1Sak,s·acorBEAM(α,β,τ,αk,s,βk,s,τk,s),
Where acorBEAM(α,β,τ,αk,s,βk,s,τk,s) is a mathematical optimization function in the angular domain.
A variety of searches, such as an exhaustive search, simulated annealing, and the like, may be used to maximize ĥk(α,β,τ). According to an example embodiment, a multi-phase search is used to maximize ĥk(α,β,τ).
In a second phase, referred to as precise resolution search, a high update rate (fine granularity) search is performed to find the maximums of the estimates of the multipath channel. The second phase uses the results of the first phase to reduce the search space. As an illustrative example, the second phase searches around the potential maximums found in the first phase. As shown in
According to an example embodiment, a gradient search method is used to maximize ĥk(α,β,τ). A gradient search takes search steps that is proportional to the gradient or an approximation of the gradient of ĥk(α,β,τ). As an example, a peak gradient search is used. In order to implement the peak gradient search, the estimate of the multipath channels are re-expressed for the parameters of the search, such as
Where: Gτ,Gα,Gβ are the gradients (or errors) of the parameters of the multipath channels in the angular domain;
According to an example embodiment, the relationships between the value of ĥk for the current value of a parameter (e.g., α,β,τ) and the value of ĥk for the early and late values of the parameter is used to determine an adjustment to the value of the parameter.
Operations 2800 begin with the transmitting device determining channel estimates in the antenna domain for the large scale MIMO antenna array (block 2805). The transmitting device determines channel estimates in the angular domain from the channel estimates in the antenna domain (block 2810). As discussed previously, the channel estimates in the angular domain may be derived from the channel estimates in the antenna domain through the use of superposition. The transmitting device identifies significant beams in accordance with the channel estimates in the angular domain (block 2815). The transmitting device may find the significant beams by maximizing the channel estimates in the antenna domain. Techniques, such as those described previously, may be used to maximize the channel estimates in the antenna domain and find the beams. The transmitting device communicates using the beams (or the parameters thereof) (block 2820). The beams found in block 2815 may be used to precode transmissions made by the transmitting device, for example. Alternatively, the beams may be used to configure a receive beam of the large scale MIMO antenna array to receive a transmission.
Over time or as conditions change, the transmitting device may be able to update the parameters of the beams without having to repeat the antenna domain channel estimates of the large scale MIMO antenna array, which significantly reduces computational complexity and communications overhead, for example. Additionally, the parameters of the beams may be saved to memory or a database (local or remote). The parameters may then be retrieved for subsequent use. The parameters may be indexed by factors such as time of day, day of week, and so on.
Antenna domain preprocessor 2905 includes a virtual antennas bank 2920, a channel probes bank 2925, and a transmit precoder bank 2930. Virtual antennas bank 2920 implements a bank of virtual antennas with steerable direction. In other words, virtual antennas bank 2920 represents the large scale MIMO antenna array with beamforming. The size of virtual antennas bank 2920 (P) is equal to P=K·S, where K is the number of users and S the average number of beams per user. For an efficient large scale MIMO implementation, P should be much smaller than the number of antennas in the large scale MIMO antenna array (M).
Each antenna unit includes a calculate steering coefficient unit, such as calculate steering coefficient unit 3125 of antenna unit 3105, and a multiplier, such as multiplier 3127. Each calculate steering coefficient unit is configured to determine steering coefficients for an associated antenna unit in accordance with the parameters (i.e., beam parameters (α,β,τ) and antenna locations (x,y,z)) provided by CDPU 3120. Each multiplier is configured to multiply signals received by an antenna of an antenna unit, such as antenna 3129 of antenna unit 3105, by the steering coefficients associated with the antenna unit. Adders, such as adder 3135 or adder 3137, accumulate the result of an associated multiplier with a summation of outputs of other antenna units. Adder 3135 of antenna unit 3105 accumulates the output of multiplier 3127 with a zero value from zero unit 3140 because antenna unit 3105 is the first antenna unit.
The output of the multiplier of an m-th antenna unit is expressible as
steeringm(fUL+nF·Δf,α,β,τ)·ym(nF,nT).
Therefore, the received signal from the large scale MIMO antenna array (i.e., the accumulated outputs from the plurality of antenna units) is expressible as
As shown in
Although the virtual antennas bank is shown in
Referring back now to
Each antenna unit includes a first multiplier (such as first multiplier 3230) that multiplies signals received by an antenna (such as antenna 3240) with the reference signal information received from CDPU 3225. A first summation unit (such as first summation unit 3232) accumulates the output of the multiplier and provides the summation result to a second multiplier (such as second multiplier 3234). Second multiplier multiplies the summation result with steering coefficients generated by calculate steering coefficients unit (such as calculate steering coefficients unit 3236). A second summation unit (such as second summation unit 3238) accumulated the output of the second multiplier. Adders, such as adder 3245, accumulate the result produced by an associated second summation unit with a summation of outputs of other antenna units. Adder 3245 of antenna unit 3205 accumulates the output of second multiplier 3238 and a zero value from zero unit 3250 because antenna unit 3205 is the first antenna unit.
The output of the second multiplier of an m-th antenna unit is expressible as
Σm=1MΣn
Therefore, the received signal from the large scale MIMO antenna array (i.e., the accumulated outputs from the plurality of antenna units is expressible as
As shown in
Although the channel probes bank is shown in
Interference rejection combining (IRC) is a technique for decoding received signals. In general, IRC involves the regeneration of a transmitted signal as received by a receiving device (such as a base station in uplink transmissions) based upon estimates of data from prior receptions, emulation of distortion arising from multipath channels, and subtraction of regenerated interference signals from received signals to obtain an estimation of the transmitted data with greater reliability. IRC makes use of spatial characteristics of the interference. In some situations, such as when there are large numbers of receive antennas, IRC provides performance improvements over MRC.
In a multicell deployment, a user may receive interference from transmissions associated with other users (referred to herein as interfering users) operating in nearby cells. A received signal at a MIMO receiving device with spatial noise arising from intercell interference may be expressed as
or equivalently in vector notation
Y=HU·XU+HI·XI+N,
Where: M is the number of base station receiver antennas;
KU is the number of users served by the base station;
KI is the number of users in the interfering cells;
Y is the samples vector of the receiver with length M;
N is the receiver noise—AWGN N(0,σ) samples vector with length M;
HU is the base station users channel;
XU is the data symbols vector of the base station users with length KU;
HI is the channel of interfering users; and
XI is the data symbols of the interfering users with length KI.
The IRC expression in the antenna domain for a MIMO receiver is expressible as
IRC=HUH·inv(RYY)·Y,
Where: HUH is the Hermitian or complex conjugate of HU;
inv( ) is the inverse operation; and
RYY is the received signal covariance matrix with dimension M by M and is expressible as
RYY=HU·HUH+HI·HIH+σ2·I.
It may be possible to estimate the covariance matrix RYY as
Where: E[ ] is the expected value operation; and
NEST is the length of the estimation vector.
Since the channel and data of the user (HU and XU, respectively) is known, the covariance matrix may be expressed more precisely as
It is noted that the complexity associated with estimating the covariance matrix RYY is a function of the number of antennas. Furthermore, the energy is at each antenna drops as the number of antennas increases. Therefore, there is a need for an alternative method for estimating the covariance matrix RYY in large scale MIMO systems, as the number of antennas continues to increase.
According to an example embodiment, IRC decoding is performed in the angular domain. Performing IRC decoding in the angular domain enables simplifying steps that reduces the computational complexity as the number of antennas increases. Detailed discussions of techniques for performing IRC decoding in the angular domain is presented below.
Utilizing the multibeam channel model illustrated in
The multibeam channel in matrix form is expressible as
or equivalently in vector notation
H=W·A,
Where: A is the complex amplitude matrix; and
W is the steering matrix with dimension M by S, wherein individual elements of W, wm,s, are expressible as
Where: mx is the X dimension index and ranges from 0, 1, . . . , MX−1;
my is the Y dimension index and ranges from 0, 1, . . . , MY−1;
MX is the number of antennas in the X dimension;
MY is the number of antennas in the Y dimension; and
λ is the wavelength.
In the angular domain, individual elements of the steering matrix is expressible as
Where: αsx, βsy are the angles of arrival or departure for beam sx, sy.
then the individual elements of the steering matrix may be simplified to
Therefore, the steering matrix W is a discrete Fourier transform (DFT) matrix and each channel may be represented as a superposition of M orthogonal beams. Then, the following is true
WH·W=I,
Where: I is the identity matrix.
Then, according to WH·W=I, the following relationships are true
HAntennaDomain=W·HAngularDomain
and
HAngularDomain=WH·HAntennaDomain
The above relationships enable ready transformations between the antenna domain and the angular domain, and vice versa.
Due to the orthogonal nature of the DFT, received signals may be processed in the antenna domain as well as the angular domain without suffering any performance degradation.
Where: YAntennaDomain is the samples vector of the receiver in the antenna domain;
YAngularDomain is the samples vector of the receiver in the angular domain;
NAntennaDomain is the receiver noise in the antenna domain;
NAngularDomain is the receiver noise in the angular domain; and
X is the vector of transmitted symbols.
However, not every beam in the angular domain has a complex amplitude sufficiently large to contribute significantly to the performance of the communications system and these beams can be ignored when estimating the covariance matrix RYY. As an example, beams with complex amplitudes that do not exceed a specified threshold are ignored when estimating the covariance matrix RYY. The specified threshold may be specified in a technical standard, an operator of the communications system, or derived from measurements of the communications system. As an example, performance metrics (such as error rates, data throughput, signal to noise ratios, and so on) are used to set and/or adjust the specified threshold.
According to an example embodiment, the covariance matrix RYY is estimated in the angular domain. In general, it is possible to represent any physical channel of M omni directional antennas as a superposition of M virtual directional antennas. However, for a channel that comprises S beams, S virtual directional antennas are sufficient. As discussed previously, S virtual directional antennas are sufficient because not every beam will have complex amplitudes that contribute significantly to the performance of the communications system. These beams, which may be determined in the angular domain by a simple comparison against a threshold, may then be ignored when estimating the covariance matrix RYY, thereby reducing computational complexity by a factor of M/S. Furthermore, the energy of users and interferers is spread uniformly between antennas, therefore, the per antenna signal to noise ratio (SNR) is low. Hence, channel and noise covariance matrix estimation in the antenna domain for large values of M is difficult. In the angular domain, energy is concentrated only in specific directions that are significant (e.g., the beams with complex amplitude exceeding the specified threshold) and the SNR in these directions is high, simplifying channel and noise covariance matrix estimation.
Operations 3500 begin with the device receiving signals in the antenna domain (block 3505). The received signal is denoted YAntennaDomain. The device transforms the received signal (YAntennaDomain) from the antenna domain into the received signal (YAngularDomain) in the angular domain (block 3510). The transformation from the antenna domain to the angular domain may be performed using YAngularDomain=WH·YAntennaDomain, for example. The device determines an average signal energy for each of the M virtual direction antenna (block 3515). The average signal energy for an m-th virtual direction antenna is expressible as
Where: N is the number of ??.
The device determines an average total signal energy for the virtual direction antennas, denoted ET (block 3520). The average total signal energy for the M virtual direction antennas is expressible as
The device selects S virtual direction antennas out of the M virtual direction antennas with an average signal energy that exceeds the specified threshold (block 3525). As an example, the device compares the average signal energy for each of the M virtual direction antennas and those with average signal energy greater than the specified threshold are selected as one of the S virtual direction antennas. The comparison may be expressed as
ES(m)>Threshold·ET.
In other words, the S virtual direction antennas are the virtual direction antennas with average signal energy greater than the specified threshold times the average total signal energy, for example.
The device updates the received signal vector Y in accordance with the S virtual direction antennas (block 3530). As an example, the device removes entries in the received signal vector in the angular domain that correspond to the virtual antenna directions that do not meet the specified threshold. The resulting received signal vector is denoted Y′AngularDomain and is expressible as
Y′AngularDomain=select(YAngularDomain),
Where: select( ) is a selection function that retains only values corresponding to the S virtual direction antennas.
The device estimates the channels in the angular domain (block 3535). The estimation of the channels involves pilot or reference sequences. The estimation of the channels in the angular domain is expressible as
Where: PLT(n) is the pilot or reference sequence used for channel estimation as received by the M virtual direction antennas; and
PLT*(n) is the pilot or reference sequence used for channel estimation as received by the S virtual direction antennas.
The device estimates the noise covariance matrix in the angular domain (block 3540). The estimation of the noise covariance matrix is estimated in accordance with the S virtual direction antennas and is denoted R′YY
The device uses IRC in the angular domain to decode the received signals (block 3545). IRC in the angular domain utilizing signals received by the S virtual direction antennas is expressible as
IRC=H′AngularDomainH·inv(R′YY
Channel estimate unit 3615 may include hardware and/or software adapted to determine angular domain channel estimates of the large scale MIMO antenna array in accordance with antenna domain channel estimates of the large scale MIMO antenna array. As an example, the angular domain channel estimates are a superposition of the antenna domain channel estimates. Beam identifying unit 3620 may include hardware and/or software adapted to identify significant beams of the large scale MIMO antenna array by maximizing the angular domain channel estimates. Beamforming unit 3630 may include hardware and/or software adapted to communicate with at least one receiving device utilizing the significant beams as identified. Beamforming unit 3630 may include hardware and/or software adapted to beamform a transmission with beam parameters of a significant beam oriented towards the at least one receiving device, and transmit the beamformed transmission towards the at least one receiving device.
Beam identifying unit 3620 includes multi-stage search unit 3622 and a peak gradient search unit 3624. Multi-stage search unit 3622 may include hardware and/or software adapted to perform a coarse resolution search to identify first amplitudes that exceed a second threshold, and perform a precise resolution search near the first amplitudes to identify the significant beams that exceed the first threshold. Peak gradient search unit 3624 may include hardware and/or software adapted to performing a peak gradient search for each beam parameter.
Transforming unit 3715 may include hardware and/or software adapted to transform antenna domain received signals into angular domain received signals. Transforming unit 3715 may include hardware and/or software adapted to multiply the antenna domain received signal with a Hermitian of a steering matrix. Selecting unit 3720 may include hardware and/or software adapted to select antenna beams with an average energy levels exceeding a specified threshold out of available antenna beams of the receiving device. Selecting unit 3720 may include hardware and/or software adapted to determine an average energy level for each of the available antenna beams, determine a total average energy level for all of the available antenna beams, and select the antenna beams with an associated average energy level that is greater than the total average energy level times the specified threshold.
Updating unit 3725 may include hardware and/or software adapted to update a received signal vector in accordance with the selected antenna beams. Determining unit 3730 may include hardware and/or software adapted to determine angular domain channel estimates and an angular domain noise covariance matrix in accordance with the updated received signal vector. Decoding unit 3735 may include hardware and/or software adapted to decode the updated received signal vector utilizing an IRC algorithm. Decoding unit 3735 may include hardware and/or software adapted to evaluate H′AngularDomainH·inv(R′YY
In some embodiments, the processing system 3800 is included in a network device that is accessing, or part otherwise of, a telecommunications network. In one example, the processing system 3800 is in a network-side device in a wireless or wireline telecommunications network, such as a base station, a relay station, a scheduler, a controller, a gateway, a router, an applications server, or any other device in the telecommunications network. In other embodiments, the processing system 3800 is in a user-side device accessing a wireless or wireline telecommunications network, such as a mobile station, a user equipment (UE), a personal computer (PC), a tablet, a wearable communications device (e.g., a smartwatch, etc.), or any other device adapted to access a telecommunications network.
In some embodiments, one or more of the interfaces 3810, 3812, 3814 connects the processing system 3800 to a transceiver adapted to transmit and receive signaling over the telecommunications network.
The transceiver 3900 may transmit and receive signaling over any type of communications medium. In some embodiments, the transceiver 3900 transmits and receives signaling over a wireless medium. For example, the transceiver 3900 may be a wireless transceiver adapted to communicate in accordance with a wireless telecommunications protocol, such as a cellular protocol (e.g., long-term evolution (LTE), etc.), a wireless local area network (WLAN) protocol (e.g., Wi-Fi, etc.), or any other type of wireless protocol (e.g., Bluetooth, near field communication (NFC), etc.). In such embodiments, the network-side interface 3902 comprises one or more antenna/radiating elements. For example, the network-side interface 3902 may include a single antenna, multiple separate antennas, or a multi-antenna array configured for multi-layer communication, e.g., single input multiple output (SIMO), multiple input single output (MISO), multiple input multiple output (MIMO), etc. In other embodiments, the transceiver 3900 transmits and receives signaling over a wireline medium, e.g., twisted-pair cable, coaxial cable, optical fiber, etc. Specific processing systems and/or transceivers may utilize all of the components shown, or only a subset of the components, and levels of integration may vary from device to device.
It should be appreciated that one or more steps of the embodiment methods provided herein may be performed by corresponding units or modules. For example, a signal may be transmitted by a transmitting unit or a transmitting module. A signal may be received by a receiving unit or a receiving module. A signal may be processed by a processing unit or a processing module. Other steps may be performed by a channel estimate unit/module, a beam identifying unit/module, a beamforming unit/module, a transforming unit/module, a selecting unit/module, an updating unit/module, a determining unit/module, and/or a decoding unit/module. The respective units/modules may be hardware, software, or a combination thereof. For instance, one or more of the units/modules may be an integrated circuit, such as field programmable gate arrays (FPGAs) or application-specific integrated circuits (ASICs).
Although the present disclosure and its advantages have been described in detail, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the disclosure as defined by the appended claims.
This application is a continuation-in-part of U.S. application Ser. No. 14/867,931, filed Sep. 28, 2015, entitled “System and Method for Large Scale Multiple Input Multiple Output Communications,” and Ser. No. 14/932,849, filed Nov. 4, 2015, entitled “System and Method for Large Scale Multiple Input Multiple Output Beamforming,” which applications are hereby incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
7072669 | Duckworth | Jul 2006 | B1 |
8023577 | Pande | Sep 2011 | B2 |
8989768 | Woo et al. | Mar 2015 | B2 |
9008008 | Baker | Apr 2015 | B2 |
20010049295 | Matsuoka | Dec 2001 | A1 |
20020128027 | Wong | Sep 2002 | A1 |
20020137538 | Chen | Sep 2002 | A1 |
20030068983 | Kim | Apr 2003 | A1 |
20030152099 | Chun | Aug 2003 | A1 |
20030190897 | Lei et al. | Oct 2003 | A1 |
20040063467 | Shapira | Apr 2004 | A1 |
20040204108 | Etkin | Oct 2004 | A1 |
20040253987 | Lee | Dec 2004 | A1 |
20050157683 | Ylitalo | Jul 2005 | A1 |
20060194552 | Jin | Aug 2006 | A1 |
20070042720 | Pan | Feb 2007 | A1 |
20070142074 | Black et al. | Jun 2007 | A1 |
20080009321 | Sayeed | Jan 2008 | A1 |
20080218404 | Ma | Sep 2008 | A1 |
20090161805 | Gao | Jun 2009 | A1 |
20090252251 | Tosato | Oct 2009 | A1 |
20090268835 | Imai | Oct 2009 | A1 |
20090299715 | Chan | Dec 2009 | A1 |
20100080269 | Kim | Apr 2010 | A1 |
20100239034 | Lee et al. | Sep 2010 | A1 |
20100260288 | Aoki | Oct 2010 | A1 |
20110013615 | Lee | Jan 2011 | A1 |
20110105174 | Pelletier | May 2011 | A1 |
20110110307 | Ko | May 2011 | A1 |
20130028341 | Ayach | Jan 2013 | A1 |
20130034130 | Forenza et al. | Feb 2013 | A1 |
20130064129 | Koivisto | Mar 2013 | A1 |
20130120191 | Zhang | May 2013 | A1 |
20130163457 | Kim | Jun 2013 | A1 |
20130163544 | Lee | Jun 2013 | A1 |
20130258874 | Khoshnevis | Oct 2013 | A1 |
20130315328 | Liu | Nov 2013 | A1 |
20140018004 | Li et al. | Jan 2014 | A1 |
20140153675 | Dandach | Jun 2014 | A1 |
20140266896 | Hyslop | Sep 2014 | A1 |
20140278075 | Fink | Sep 2014 | A1 |
20140317241 | Zhao | Oct 2014 | A1 |
20140348255 | Lorca Hernando | Nov 2014 | A1 |
20140370823 | Yu | Dec 2014 | A1 |
20150043439 | Sajadieh | Feb 2015 | A1 |
20150049824 | Kim | Feb 2015 | A1 |
20150195019 | Nagata | Jul 2015 | A1 |
20150237510 | Kludt et al. | Aug 2015 | A1 |
20150304868 | Yu | Oct 2015 | A1 |
20150326289 | Kim | Nov 2015 | A1 |
20150334726 | Gao | Nov 2015 | A1 |
20150372842 | Wicker, Jr. | Dec 2015 | A1 |
20160006122 | Seol | Jan 2016 | A1 |
20160044630 | Markhovsky et al. | Feb 2016 | A1 |
20160066197 | Park | Mar 2016 | A1 |
20160093950 | Cummings et al. | Mar 2016 | A1 |
20160134015 | Sonoda | May 2016 | A1 |
20160135180 | Yuan | May 2016 | A1 |
20160182196 | Lorca Hernando | Jun 2016 | A1 |
20160226564 | Taherzadeh Boroujeni | Aug 2016 | A1 |
20160380680 | Yang | Dec 2016 | A1 |
20170041811 | Qiao | Feb 2017 | A1 |
20170048735 | Rao | Feb 2017 | A1 |
20170187504 | Qian | Jun 2017 | A1 |
20170214449 | Bi | Jul 2017 | A1 |
20170295001 | Chen | Oct 2017 | A1 |
Number | Date | Country |
---|---|---|
1933356 | Mar 2007 | CN |
103004267 | Mar 2013 | CN |
103682677 | Mar 2014 | CN |
104410442 | Mar 2015 | CN |
104467934 | Mar 2015 | CN |
104902574 | Sep 2015 | CN |
2005249629 | Sep 2005 | JP |
2007027268 | Mar 2007 | WO |
Entry |
---|
Dammann A., et al., “WHERE2 Location Aided Communications,” Europoean Wireless, Guildford, UK, Apr. 16-18, 2013, pp. 1-8. |
Di Taranto, R., et al., “Location-Aware Communications for 5G Networks,” IEEE Signal Processing Magazine, Nov. 2014, pp. 102-112. |
Guibene, W., et al., “Degrees of Freedom of Downlink Single- and Multi-Cell Multi-User MIMO Systems with Location Based CSIT,” Vehicular Technology Conference, Jun. 5-5, 2013, pp. 1-5. |
Larsson, E., et al, “Massive MIMO for Next Generation Wireless Systems,” IEEE Communications Magazine, vol. 52, Issue 2, Feb. 2014, pp. 186-195. |
Li, J., et al., “Position Location of Mobile Terminal in Wireless MIMO Communications Systems,” Journal of Communications and Networks, vol. 9, No. 3, Sep. 2007, pp. 254-264. |
Li, J., et al., “Joint Estimation of Channel Parameters for MIMO Communication Systems,” Wireless Communications Systems, Sep. 7, 2005, pp. 22-26. |
Slock, D., “Location Aided Wireless Communications,” Proceedings of the 5th International Symposium on Communications, Control and Signal Processing, ISCCSP 2012, Italy, Rome, May 2-4, 2012, 6 pages. |
Rusek, F., et al. “Scaling Up MIMO: Opportunities and Challenges with Very Large Arrays,” IEEE Signal Processing Magazine, vol. 30, Issue 1, Jan. 2013, pp. 40-60. |
Slock, D., “MIMO Broadcast and Interference Channels with Location based Partial CSIT,” European Wireless 2013, Apr. 16-18, 2013, Guildford, UK, pp. 1-6. |
Liu, L et al. “Cooperative Beamforming Algorithms Using the Assistant Information From Satellite Navigation Positioning Systems,” Journal of Xidian University, Jun. 30, 2013, 1 page. |
Number | Date | Country | |
---|---|---|---|
20170093467 A1 | Mar 2017 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14867931 | Sep 2015 | US |
Child | 15226361 | US | |
Parent | 14932849 | Nov 2015 | US |
Child | 14867931 | US |