The present invention relates to method and system of massive MIMO (Multiple-Input Multiple-Output) communication. In particular, the present invention relates beam set design for multicast system such as for factory automation multicast system, which refers to beam management at base station side for a downlink broadcast system to multiple users.
In the previous generations of telecommunication networks, when considering broadcast services, a coverage area was defined from a given quality of service. This is the case for DVB standards wherein a target SNR is defined and users experiencing radio link condition leading to a SNR above this target can receive the video stream while other users can't. This approach is not efficient in terms of spectral efficiency when the base station has knowledge about the radio condition, and more generally the channel observed by each user.
In the next generation communication system operating over 6 GHz band, with the advent of active antenna arrays, more sophisticated beams can be created. Narrower and more directive beams can be created so as to compensate the high attenuation and to guarantee the user experience for distant and isolated users.
To achieve the large beamforming gain with reasonable implementation complexity, hybrid beamforming architecture is frequently used. The analogue beams on each panel or antenna arrays are adapted through phase shifters, switches or lens. Users measure a set of analogue beams and report associated metrics to base station in order to let the base station assigns beams to each user. At the base station side, the configuration of multiple beams is through multiple so-called “beamformed reference signals” which can be transmitted by base station. Each reference signal is beamformed with an associated beam pointing in a particular direction. Upon receiving each beamformed reference signal, users can report to base station the optimal transmitting beam index or indices of multiple preferred transmitting beams with associated beam quality metrics. With the beam report, the base station can select the serving beam(s) and indicate the index of transmitting beam for the users. The beamformed reference signal can be transmitted periodically or aperiodically. Depending on the system load and equipment capability, sweeping over coverage with a smaller dimension coarse beamformed reference signal set or with a more accurate beamformed reference signal set with more beam directions is possible. It is also capable of configuring a sweeping across a small number of transmitting beams covering smaller angular area or performing a wider angular area and finer beam sweeping.
If multiple preferred beams can be configured to one user, beam directions corresponding to multiple dominant paths can be presented. However, if there is only a single beam for each user, the selected beam can only represent the direction of the strongest path of the user channel, which is apparently not the optimal beamforming direction to precode the channel. The optimal direction is the direction of the user channel hk, as the absolute value of the inner product of a beam w and the user channel hk is maximized when w is in the direction of the channel.
Consider that the phase array used for beamforming is readily configurable, which indicates that we can tune easily the phase for each entries of the beam vector, we can generate beams that are pointing to a more precise direction rather than choosing one beam direction in the restricted beam set.
A configurable beam set and a restricted beam set have their respective advantages and disadvantages. For example, the advantages of the configurable beam are they have more precise beam direction and better multicast rate performance, and the disadvantages are their device prices are quite expansive and need complexity for beamforming design as well as large feedback overhead. The advantages of the restricted beam set are their device prices are relative low and need low complexity beam forming design as well as low feedback overhead, and the disadvantages of the restricted beam set are they can only provide a few beam directions with worse multicast rate performance than the configurable beam.
Due to the aforementioned advantages and shortcomings, EP18305635 introduced a beamforming design algorithm which is a trade-off between the performance and the complexity. It has proposed that new beamforming directions can be created by linear combination of two existing beams in the current beam candidate set.
Such a beam merging procedure will lead to a ‘living’ beam set. When two beams are merged to create a new beam, the two original beams will be deleted from the beam set and the new beam will be added into the beam set. Therefore, the cardinality of the beam set will be reduced and the beams in the current beam set will be more and more adapted to maximize the multicast rate given the current users' channel conditions. Normally, the initial beam set is isotropically distributed so as to ensure the coverage. With the beam merging procedure, the distribution of the beam direction in the initial beam set will be changed. In the end, the beam set contains beam directions dedicated to the given multicast realization.
However, a realistic channel is often dynamic. Indeed, for a fixed environment, the base station will focus energy on the more efficient directions that allow serving the users. This can include bouncing on walls or objects to attain users in a non-line of sight case. However, due to user mobility or channel fluctuation, the beam direction inside the beam set after merging cannot be still adapted to the user.
In addition, new users may move or appear in the coverage of the base station and get attached to it. New path can be available in the presence of a new reflecting object. Thus, it is of interest to monitor other directions than the one already identified as the most relevant, to look for new opportunities. In this case, the current beam set after the merging is not capable of new beam directions.
The invention aims to improve the situation.
In this regard, the present invention proposes a method of massive MIMO communication, comprising:
It is then possible to refine the beam so as to be adapted to the user mobility or channel fluctuation, as well as to detect a new user move or appear in the coverage of the base station.
In an embodiment, forming transmission beam set comprises updating an initial beam set, which normally covers the entire space without privileged channel directions, by the base station, into the transmission beam set, which has privileged channel directions that optimize the multicast performance with the current given receivers locations.
In this regard, a more accurate channel direction can be obtained for the better multicast performance.
In particular, forming transmission beam set comprises:
In addition, designing additional beam set comprises:
In this case, additional beam set is designed so as to optimize the transmission beam set.
In another embodiment, forming transmission beam set comprises a linear beam merging of the beams in initial beam set. Therefore, several simple merging algorithms can be adapted instead of using complicated merging steps.
In particular, the additional beam set is designed to refine the privileged channel directions in the transmission beam set in case of channel fluctuation or user mobility.
Alternatively, the additional beam set is designed to detect new channel directions or new entered users.
In an embodiment, forming transmission beam set comprises a non-linear beam merging of the beams in initial beam set. Therefore, the method can be adapted to more complicated situations where linear beam merging algorithm is not applicable.
In particular, the additional beam set is designed to detect new channel directions or new entered users.
Alternatively, the additional beam set (Θ) is obtained by machine learning.
In another embodiment, the additional beam set is irrelevant of the transmission beam set, so that the method can be adapted in a more flexible manner.
In another embodiment, the additional beam set is a hierarchical refinement of the transmission beam set.
The present invention also proposes a base station, equipped with a plurality of antennas forming a radio frequency chain and adapted to form and transmit transmission beam set with privileged channel directions, wherein the base station is configured to design additional beam set for optimizing the transmission beam, so as to adapt to channel direction change, such detect the channel direction change outside the privileged channel directions.
Similarly, with such a base station, it is then possible to refine the beam so as to be adapted to the user mobility or channel fluctuation, as well as to detect a new user move or appear in the coverage of the base station.
In addition, the present invention further proposes a massive MIMO communication system, comprising:
Furthermore, the present invention also proposes a computer program comprising program code to be executed by a processor, the program code being adapted to performance of a method as claimed in any one of the abovementioned method when executed by the processor. A flow chart of a general algorithm of the computer program can be represented as an example by
Thanks to the present invention, additional beam set is introduced so as to enable refinement for the privileged data transmission directions in case of channel variation and to track any change in the channel propagation that cannot be observed by the existing beams in the beam set. Moreover, the additional beam set is optimally designed so as to achieve a trade-off between the system overhead due to beam sweeping and a capability to discover or track any change in the channel propagation that cannot be observed through the reference signal sent through the beams used for data transmission.
Other features and advantages of the present invention will appear in the description hereinafter, in reference to the appended drawings.
Referring to
In particular, for example as shown in
A set of K receivers RX, each associated to a given user UE, equipped with one receive antenna. The receivers RX are adapted to receive beams from the base station BS. Generalization to several receive antennas is known by the person skilled in the art.
The base station BS forms and transmits initial transmission beam Φ(0) set in a predefined area. For example in
Referring to
Each user UE, as shown in step S2, will receive the beamformed reference signal RS which has gone through the propagation channels, each user UE can estimate the channel which is precoded with different beams and feedback the quality metrics g(yk,φ
Afterward, in step S3, a set of new beams Φ are merged from the initial transmission beam set Φ(0), by means of beamforming design algorithm in the art, such as the one in EP18305635 which describes a linear combination of two beam codeword. Alternatively, it is also possible to merge the beams in a non-linear approach, which is obtained by machine learning technology.
The merged beams 1′,2′ and 3′ in the new beam set (are now with privileged directions for current three users UE1, UE2, and UE3 configuration and transmission scenario, as shown in
When the users and/or the reflecting objects are moving, the current beams may no longer targeting the users, which leads to signal attenuation or loss. It is then in the second phase to detect and track the movement so as to change the path direction of the beam and make the beams substantively and constantly targeting the users.
In the second phrase in step S4, the base station BS sends beamformed reference signals RS with beams belonging to beam set (P.
Each user UE receive the beamformed reference signals RS which have gone through the propagation channels, each user UE can estimate the channel which is precoded with different beams and feedback the quality metrics to the base station BS.
Then in step S5, when there is any beam failure due to change in the channel propagation or new user UE detected, an additional beam set design step in S6, detailed below, will be launched, if not, the second phases is repeated.
In step S6, based on the previous beam set Φ, the initial beam set Φ(0), the reported beam quality metrics and an arbitrary design criterion, an additional beam set Θ={θ1 . . . θN
According to one embodiment, the beams can be merged to create by liner beam merging and non-linear beam merging.
For the linear beam merging, this is essentially provided by EP 18305635, wherein linear combination of two beam codeword is used, and the algorithm in EP 18305635 requires full channel knowledge.
For the non-linear beam merging, for example, the new beam is formulated by combination of beams in the phase domain. This indicates that beam vectors may have in the following form:
With phase domain combination, w=v(Φ) reads:
A deep learning based procedure, performed offline based on the initial beam set Φ(0), can be used to obtain an estimation function of the multicast rate using the new beam w based on the nonlinear beam combination w=v(Φ) and the reported beam quality metrics g(yk,φ
According to another embodiment, the beamformed reference signals RS received at user UE k using the transmission beams φi or θj can be denoted as:
yk,φ
yk,θ
Each transmission beam φi, θjϵN
At user UE k, with the signal strength yk,φ
The additional beam set Θ can be optimized based on the previous beam set Φ, the initial beam set Φ(0), the reported beam quality metrics g(yk,φ
The details of additional beam design respectively for linear beam merging and non-linear beam merging are now discussed below.
For the additional beam design for linear beam merging, there are two main targets for introducing additional beam set:
If the beam merging procedure is a linear combination of beams in the beam set, the cardinality of the beam set ΘR can be decided according to the nature of the transmission in downlink DL and uplink UL.
For example, consider the following uplink UL beam sweeping procedure to determine the unicast beam for each user, a downlink DL beam sweep to determine the preferred beam(s) for each user will work in a similar manner. The initial beam set Φ(0) includes 11 beams, as shown in
Consider this is a TDD system, there exists channel reciprocity. Therefore the preferred downlink DL unicast beam is the same as the uplink UL unicast beam for each user. In the downlink DL, after the linear beam merging, we can have the beamforming as shown in
The beam set after merging has cardinality of 3, i.e. beam 1′,2′, and 3′. The beam 1′ is a linear combination of the beam 2 and 4 in the initial beam set, the beam 2′ is a linear combination of the beam 3, 5, 6 in the initial beam set. The beam 3′ is beam 8 inside the initial beam set. The beam set after merging can be written as Φ={c11b2+c12b4, c21b3+c22b5+c23b6, b8}. Let's abuse the notation Φ to indicate a matrix whose column is constructed by each beam in the set Φ.
Let the uplink UL preferred beam set for all users be noted as Φ(UL), |Φ(UL)|=N (for example, N=6), the cardinality of the beam set ΘR for privileged beam direction refinement is |ΘR|=N−rank(Φ). And each beam in beam set ΘR should be selected in the way that:
Span(ΘR)=Span(Φ(UL))\Span(Φ)
In this way, any new beam direction which is a linear combination of beams in the set Φ and ΘR is a linear combination of the set Φ(UL). As in the case of channel fluctuation or small time duration/low speed user mobility, we can assume that the dominant paths for each user haven't been changed, i.e., the preferred beams are still Φ(UL). Therefore, by introducing ΘR, together with the merging beam set Φ, we can refine the privileged direction for data transmission in the case of channel fluctuation and mobility, as long as the dominant path for each user is not changed.
In the example in the
Now we design ΘD to detect new path. The cardinality |ΘD|=Noverhead−|ΘR|. Noverhead is a system parameter which indicates the maximum size of the additional beam set size allowed for beam sweeping. Each beam θϵΘD should satisfy:
Where ε is a threshold constant. This inequality guarantees that the new beam direction is not a privileged direction that is captured in the post-merging beam set Φ.
Therefore, in order to design beam θϵΦD for new path detection, we will first find a function to estimate the
based on Φ, Φ(0) and reported beam quality metrics g(yk,φ
This function q(.) can be an formulated by constructing a channel estimator based on g(yk,φ
In case the beam merging is a linear combination, we can have span(ΘD)=span(Φ(0))†span(Φ). Since the initial beam set for beam sweeping aims at a full cell coverage, therefore span(ΘD)⊂span(Φ(0)) is guaranteed. Therefore the beam θϵΘD should satisfy:
Φ(ΦHΦ)−1ΦHθ=0
q(θ,Φ,Φ(0),g(yk,φ
A possible way to generate the beam set ΘD is the following pseudo code:
For the additional beam design for none-linear beam merging, it is difficult to find the beam set ΘR which can help to refine the privileged directions in case of channel variation. Nevertheless, there doesn't exist a simple relation between the space spanned by the additional beam set ΘD and the post-merging beam set Φ. However, if the cardinality of the set ΘD is known as |ΘD|=No(for example, predefined according to beam sweeping overhead), we can still design more efficient additional beam set ΘD for new path detection.
Since it is still true that for the new path detection, it is not necessary to introduce additional beam directions which overlap with the direction in the beam set Φ. Let function ƒα represents an arbitrary non-linear Xbeam merging function with some parameter α for the non-linear combination (this parameter vector α can be the phase domain combination coefficients cl as is illustrated above). It can be written that θ=ƒα(Φ(0), indicating that the additional beam direction can be constructed by a nonlinear combination of the initial beam set. In order to further indicates that the additional beam direction should be the directions in beam set Φ, like in the linear combination, we can find a function to estimate the max log (1+|hkHθ|2) based on Φ, Φ(0) and reported beam quality metrics g(yk,φ
This function q(.) can be formulated by constructing a channel estimator based on g(yk,φ
A possible way to generate the beam set ΘD is the following pseudo code:
In light of above, this invention proposes a system and a method for determining an additional beam sweeping codebook achieving a trade-off between the system overhead due to beam sweeping and a capability to discover or track any change in the channel propagation that cannot be observed through the reference signal sent through the current beams used for data transmission.
In the hybrid beamforming for millimetre wave massive MIMO, the analog beams are wideband. A beam sweeping procedure allows sounding the channel and is generally performed over a predefined codebook. This procedure can have a large impact on the system if the number of beams to be monitored is high.
By virtue of beam merging, these transmit beams are then optimized, from the channel sounding feedback, to concentrate the transmitted energy as accurately as possible in some privileged directions of space that corresponds to the current terminal positions and the targeted service (e.g., unicast or multicast).
The data transmitted in downlink or uplink carries reference symbols allow for channel sounding in these privileged directions at low cost in terms of overhead (the proportion of pilot symbols in a frame is small with respect to data). However, in case of change in channel propagation, those beams are insufficient to refine the privileged direction for data transmission or identify new direction. It is thus of interest to design additional beam sweeping codeword which provide knowledge that could not be obtained via the direct reference signal measurement and feedback.
Therefore, this invention proposes to design the beam sweeping codebook such that:
A first sub-codebook allows for refining the current transmission beam. This number is minimized, according to the nature of the transmission in DL and UL.
According to the remaining number of codewords available for sweeping, a second codebook is selected which is complementary to the one used for defining the beams for data transmission. This allows maximizing the sounding capability to detect any change in the channel outside the privileged directions.
In addition, as is known to those skilled in the art, the aforementioned example architectures described above, according to the present invention, can be implemented in many ways, such as program instructions for execution by a processor, as software modules, microcode, as computer program product on computer readable media, as logic circuits, as application specific integrated circuits, as firmware, etc. The embodiments of the invention can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment containing both hardware and software elements. In a preferred embodiment, the invention is implemented in software, which includes but is not limited to firmware, resident software, microcode, etc.
Furthermore, the embodiments of the invention can take the form of a computer program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer, processing device, or any instruction execution system. For the purposes of this description, a computer-usable or computer readable medium can be any apparatus that can contain, store, communicate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. The medium can be electronic, magnetic, optical, or a semiconductor system (or apparatus or device). Examples of a computer-readable medium include, but are not limited to, a semiconductor or solid state memory, magnetic tape, a removable computer diskette, a RAM, a read-only memory (ROM), a rigid magnetic disk, an optical disk, etc. Current examples of optical disks include compact disk-read-only memory (CD-ROM), compact disk-read/write (CD-R/W) and DVD.
Number | Date | Country | Kind |
---|---|---|---|
19305758 | Jun 2019 | EP | regional |
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/JP2020/015756 | 4/1/2020 | WO |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2020/250556 | 12/17/2020 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
10277338 | Reial | Apr 2019 | B2 |
10374670 | Bethanabhotla | Aug 2019 | B2 |
10742298 | Nilsson | Aug 2020 | B2 |
11082176 | Liu | Aug 2021 | B2 |
11152992 | Zhou | Oct 2021 | B2 |
11272429 | Islam | Mar 2022 | B2 |
11483053 | Kapetanovic | Oct 2022 | B2 |
11782119 | Newman | Oct 2023 | B2 |
20050215261 | Cha | Sep 2005 | A1 |
20090232240 | Lakkis | Sep 2009 | A1 |
20160088648 | Xue et al. | Mar 2016 | A1 |
20160127919 | Hui | May 2016 | A1 |
20170237477 | Fujio | Aug 2017 | A1 |
20180049042 | Yu | Feb 2018 | A1 |
20180062770 | Reial | Mar 2018 | A1 |
20180131486 | Liu | May 2018 | A1 |
20180234912 | Islam | Aug 2018 | A1 |
20180249453 | Nagaraja | Aug 2018 | A1 |
20190089428 | Bethanabhotla | Mar 2019 | A1 |
20190182683 | Khirallah | Jun 2019 | A1 |
20190247680 | Mayer | Aug 2019 | A1 |
20190386733 | Nilsson | Dec 2019 | A1 |
20200204237 | Zhou | Jun 2020 | A1 |
20210175953 | Nilsson | Jun 2021 | A1 |
20210203398 | Kapetanovic | Jul 2021 | A1 |
20230188189 | Raghavan | Jun 2023 | A1 |
Number | Date | Country |
---|---|---|
2846830 | Mar 2013 | CA |
3075282 | Mar 2019 | CA |
104660311 | May 2015 | CN |
108111199 | Jun 2018 | CN |
108781103 | Nov 2018 | CN |
104660311 | Mar 2019 | CN |
109906588 | Jun 2019 | CN |
110324072 | Oct 2019 | CN |
110324072 | Sep 2020 | CN |
112204897 | Jan 2021 | CN |
113473490 | Oct 2021 | CN |
108781103 | Mar 2022 | CN |
116015378 | Apr 2023 | CN |
2387162 | Nov 2011 | EP |
2387162 | Jan 2014 | EP |
2573252 | Nov 2019 | EP |
3692646 | Aug 2020 | EP |
3504854 | Mar 2021 | EP |
3832901 | Jun 2021 | EP |
3832901 | Sep 2022 | EP |
4106224 | Dec 2022 | EP |
3682554 | Feb 2024 | EP |
3804158 | Feb 2024 | EP |
2867923 | Oct 2021 | ES |
2929848 | Dec 2022 | ES |
2011-526429 | Oct 2011 | JP |
2017-535093 | Nov 2017 | JP |
2020502837 | Jan 2020 | JP |
6860152 | Apr 2021 | JP |
20190064582 | Jun 2019 | KR |
102228745 | Mar 2021 | KR |
2707735 | Nov 2019 | RU |
2726850 | Jul 2020 | RU |
201734439 | Oct 2017 | TW |
WO-2013032188 | Mar 2013 | WO |
WO-2014183707 | Nov 2014 | WO |
WO-2016084182 | Jun 2016 | WO |
WO-2017162283 | Sep 2017 | WO |
WO-2018202216 | Nov 2018 | WO |
WO-2019110123 | Jun 2019 | WO |
WO-2019160973 | Aug 2019 | WO |
WO-2019228652 | Dec 2019 | WO |
WO-2022184276 | Sep 2022 | WO |
Entry |
---|
Japanese Office Action for Japanese Application No. 2021-568453, dated Aug. 2, 2022, with English translation. |
Number | Date | Country | |
---|---|---|---|
20220247463 A1 | Aug 2022 | US |