This nonprovisional application is a U.S. National Stage Filing under 35 U.S.C. § 371 of International Patent Application Serial No. PCT/CN2020/076949 filed Feb. 27, 2020 and entitled “METHOD AND APPARATUS FOR ESTIMATING AND COMPENSATING TIMING ADVANCE” which claims priority to International Patent Application No. PCT/CN2019/076891 filed Mar. 4, 2019 both of which are hereby incorporated by reference in their entirety.
The present disclosure generally relates to communication networks, and more specifically, to estimate and compensate timing advance (TA) in a communication network.
This section introduces aspects that may facilitate a better understanding of the present disclosure. Accordingly, the statements in this section are to be read in this light and are not to be understood as admissions about what is in the prior art or what is not in the prior art.
With the rapid development of networking and communication technologies, wireless communication networks such as long-term evolution (LTE)/fourth generation (4G) networks and new radio (NR)/fifth generation (5G) networks are expected to achieve high traffic capacity and end-user data rate with lower latency. To meet the diverse requirements of new services across a wide variety of industries, timing advance (TA) or TA value, which corresponds to the length of time a signal takes to reach a base station (e.g., eNB or gNB) from a user equipment (UE) is one of the critical parameters to provide accurate signal transmission. It is desirable to develop a method, an apparatus and a system to provide precise TA estimation and compensation.
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
With the rapid development of networking and communication technologies, multiple-input and multiple-output (MIMO) are commonly used to improve the robustness of data transmission or to increase data rates. In the conventional communication system, such as legacy LTE, the TA adjustment is estimated by a base station (e.g., eNB or gNB) based on uplink reference symbols (RS) and sent to a UE via a TA command. After receiving the TA command, the UE would determine the TA adjustment and then adjusts uplink timing based on the TA adjustment.
However, the granularity of the TA adjustment in the TA command based on the existing techniques is relatively large, which will decrease the accuracy of the TA adjustment and degrade the performance (e.g., the estimation of the downlink channel and/or the calculation of the beamforming weights) of the MIMO system.
In a time-division duplexing (TDD) system, data transmitted in an uplink and a downlink are operated in the same spectrum, and thus the characteristics of the channel of the uplink transmission and that of the downlink transmission are the same as well (i.e., reciprocity). Therefore, a feedback from a User Equipment (UE) is not required because an uplink reference signal can be used to estimate downlink channel and/or to calculate the beamforming weights.
As mentioned above, since the uplink reference signal can be used to estimate downlink channel, the TA estimation would not be limited by the granularity of the TA command. In view of the above, the present disclosure proposes a solution for providing TA estimation or adjustment with higher accuracy, which can improve the performance (e.g., the estimation of the downlink channel and/or the calculation of the beamforming weights) for a TDD system.
According to a first aspect of the present disclosure, there is provided a method performed by a communication node. The method includes obtaining matched filter channel estimation associated with a user equipment (UE); obtaining first Timing Advance (TA) compensated channel estimation; obtaining first noise suppressed channel estimation; and obtaining first TA estimation associated with the UE based on the first noise suppressed channel estimation.
According to a second aspect of the present disclosure, there is provided an apparatus. The apparatus may include one or more processors and one or more memories comprising computer program codes. The one or more memories and the computer program codes are configured to, with the one or more processors, cause the apparatus at least to perform any step of the method according to the first aspect of the present disclosure.
According to a third aspect of the present disclosure, there is provided a computer-readable medium having computer program codes embodied thereon which, when executed on a computer, cause the computer to perform any step of the method according to the first aspect of the present disclosure.
For a better understanding of the nature and objects of some embodiments of the present disclosure, reference should be made to the following detailed description taken in conjunction with the accompanying drawings. In the drawings, identical or functionally identical elements are given the same reference numbers unless otherwise specified.
The embodiments of the present disclosure are described in detail with reference to the accompanying drawings. It should be understood that these embodiments are discussed only for the purpose of enabling those skilled persons in the art to better understand and thus implement the present disclosure, rather than suggesting any limitations on the scope of the present disclosure. Reference throughout this specification to features, advantages, or similar language does not imply that all of the features and advantages that may be realized with the present disclosure should be or are in any single embodiment of the present disclosure. Rather, language referring to the features and advantages is understood to mean that a specific feature, advantage, or characteristic described in connection with an embodiment is included in at least one embodiment of the present disclosure. Furthermore, the described features, advantages, and characteristics of the present disclosure may be combined in any suitable manner in one or more embodiments. One skilled in the relevant art will recognize that the present disclosure may be practiced without one or more of the specific features or advantages of a particular embodiment. In other instances, additional features and advantages may be recognized in certain embodiments that may not be present in all embodiments of the present disclosure.
As used herein, the term “communication network” refers to a network following any suitable communication standards, such as new radio (NR), long term evolution (LTE), LTE-Advanced, wideband code division multiple access (WCDMA), high-speed packet access (HSPA), and so on. Furthermore, the communications between a terminal device and a network node in the communication network may be performed according to any suitable generation communication protocols, including, but not limited to, the first generation (1G), the second generation (2G), 2.5G, 2.75G, the third generation (3G), 4G, 4.5G, 5G communication protocols, and/or any other protocols either currently known or to be developed in the future.
As used herein, the terms “first”, “second” and so forth refer to different elements. The singular forms “a” and “an” are intended to include the plural forms as well, unless the context clearly indicates otherwise. The terms “comprises”, “comprising”, “has”, “having”, “includes” and/or “including” as used herein, specify the presence of stated features, elements, and/or components and the like, but do not preclude the presence or addition of one or more other features, elements, components and/or combinations thereof. The phrase “based on” means “based at least in part on”. The terms “one embodiment” and “an embodiment” mean “at least one embodiment”. The term “another embodiment” means “at least one other embodiment”. Other definitions, explicit and implicit, may be included below.
The matched filter 11 is configured to receive a reference signal (RS) from a UE at receive branches and to generate matched filter channel estimation associated with the UE. The RS may be a Sounding Reference Signal (SRS), or a Demodulation Reference Signal (DMRS) or other uplink reference signal and is not limited here.
The TA compensation module 12 is coupled to the matched filter 11. In some embodiments, the TA compensation module 12 is configured to receive the matched filter channel estimation from the matched filter 11 and to generate pre-TA compensated channel estimation based on the matched filter channel estimation.
The noise and interference suppression module 13 is coupled to the TA compensation module 12. In some embodiments, the noise and interference suppression module 13 is configured to receive the pre-TA compensated channel estimation and to generate noise and interference suppressed channel estimation based on the pre-TA compensated channel estimation.
The TA estimation module 14 is coupled to the noise and interference suppression module 13. In some embodiments, the TA estimation module 14 is configured to receive the noise and interference suppressed channel estimation and to generate TA estimation based on the noise and interference suppressed channel estimation. The generated TA estimation may be forwarded to the TA compensation module 15 and feedback to the TA compensation module 12.
The TA compensation module 15 is coupled to the noise and interference suppressed channel estimation module 13 and the TA estimation module 14. In some embodiments, the TA compensation module 15 is configured to receive the TA estimation from the TA estimation module 14 and to generate TA compensated channel estimation (also can be referred to “post-TA compensated channel estimation”) by adjusting the noise and interference suppressed channel estimation with the TA estimation.
The beamforming weights calculation module 16 is coupled to the TA compensation module 15. In some embodiments, the beamforming weights calculation module 16 is configured to receive the post-TA compensated channel estimation from the TA compensation module 15 and to generate beaming weights of branches received from the UE based on the post-TA compensated channel estimation. In some embodiments, the branch represents one antenna in an antenna arrays or one of the radiation beams.
In some embodiments, each of the modules illustrated in
Referring to the operation S21, matched filter channel estimation Ĥmf associated with a UE is obtained. The matched filter channel estimation Ĥmf is obtained based on reference signals received from a UE at receive branches. In some embodiments, the matched filter channel estimation Ĥmf can be denoted as Ĥmf,u(k,r) calculated by the following equation Eq. (1):
Ĥmf,u(k,r)=Yu(k,r)·X*u(k) Eq. (1),
where Yu(k, r) is the received RS in frequency domain for sample k, from the UE u at the receive branch r, and Xu*(k) is the signal transmitted in frequency domain for sample k, for the UE u. In some embodiments, the branch r represents one antenna in the antenna arrays or one of the radiation beams.
Referring to the operation S22, a pre-TA compensated channel estimation Ĥmf,TA is obtained. The pre-TA compensated channel estimation Ĥmf,TA is calculated based on the matched filter channel estimation Ĥmf. In some embodiments, the pre-TA compensated channel estimation Ĥmf,TA can be denoted as Hmf,TA u(k, r) calculated by the following equation Eq. (2):
Ĥmf,TA,u(k,r)=Ĥmf,u(k,r)·θPre,TA,u(k) Eq. (2),
where Δf is the matched filter channel estimation, and θpre,TA,u (k) is a TA compensation phase (also can be referred to “pre-TA compensation phase”).
In some embodiments, the pre-TA compensation phrase θpre,TA u (k) can be calculated by the following equation Eq. (3):
θpre,TA,u(k)=exp(j·2π·(LRS·k+kfirst,u)·Δf·TAacc,u) Eq. (3),
where Δf is the subcarrier spacing between two adjacent subcarriers, LRS is the number of subcarrier spacings between two RS frequency samples, and kfirst,u is the index of the first subcarrier in the whole bandwidth for RS of the UE u and TAacc,u is accumulated TA.
In some embodiments, the accumulated TA TAacc,u can be calculated by the following equation Eq. (4):
TAacc,u=TAacc,u,pre+TAu Eq. (4),
where TAu is the TA estimation for the UE u obtained via the previous TA estimation process and TAacc,u, pre is the previous accumulated TA. The initial value of TAacc,u is zero.
In
Referring to the operation S23, noise and interference suppressed channel estimation R′ is obtained. In the operation S23, the noise and the interference from other UEs can be suppressed. In some embodiments, the operation S23 may include the following steps: converting the pre-TA compensated channel estimation Ĥmf,TA from frequency domain to time domain by, for example, inverse fast Fourier transform (IFFT) or discrete cosine transform (DCT) to obtain a plurality of channel taps; selecting one or more proper channel taps from the obtained channel taps; and then converting the selected channel taps from time domain to frequency domain to obtain the noise and interference suppressed channel estimation Ĥ′. It is appreciated that there are many convention noise and interference suppressing technologies, and the noise and the interference operation applied by the present disclosure is not limited to the above embodiments.
Referring to the operation S24, TA estimation TA associated with the UE is obtained. The TA estimation TA is obtained based on the noise and interference suppressed channel estimation Ĥ′. In some embodiments, the TA estimation can be denoted as TAu obtained by the following steps: selecting one or more branches from a plurality of branches received from the UE based on power levels of the received branches; calculating TA values for each of the selected branches; and obtaining the TA estimation by combining the calculated TA values.
In some embodiments, the power level Prs,u,r of each received branch can be calculated by the following equation Eq. (5):
Prs,u,r=(Σk=0N
Then, one or more branches are selected based on the power level of each received branch. In some embodiments, only the branches with the power level higher than a predetermined value are selected. In other embodiments, only the branch with the highest power level is selected.
In some embodiments, the TA value TAu,r for each of the selected branches is calculated by the following equation Eq. (6):
where Δf is the subcarrier spacing (e.g., 15 kHz), Δk is an adjustable factor greater than or equal to 1, and Nc is the number of RS samples in frequency domain used for the TA estimation. The adjustable factor Δk would affect the range and the accuracy of the TA estimation. For example, as Δk increases, the range for the TA estimation decreases while the accuracy of the TA estimation increases, and vice versa.
The TA estimation TAu for a UE u is generated by combining TA values TAu,r for the selected branches. For example, the TA estimation TAu can be calculated by the following equation Eq. (7):
where BTA,u is the selected branches (e.g., the branch with the highest power level Prs,u,r).
It is appreciated that the TA estimation can be achieve by various existing technologies, and can be done in either time domain or frequency domain. Thus, the TA estimation applied by the present disclosure is not limited here.
Referring to the operation S25, post-TA compensated channel estimation Ĥ′TA is obtained. In some embodiments, post-TA compensated channel estimation is obtained by the following steps: calculating a post-TA compensation phrase θpost,TA based on the TA estimation; and calculating the post-TA compensated channel estimation Ĥ′TA based on the noise and interference suppressed channel estimation Ĥ′ and the post-TA compensation phrase θpost,TA.
In some embodiments, the post-TA compensated channel estimation Ĥ′TA can be denoted as Ĥ′TA,u(k, r) calculated by the following equation Eq. (8):
Ĥ′TA,u(k,r)=Ĥ′u(k,r)·θpost,TA,u(k) Eq. (8),
where Ĥ′u(k, r)) is the noise and interference suppressed channel estimation, θpust,TA u (k) is the post-TA compensation phase.
In some embodiments, the post-TA compensation phrase θpost,TA,u (k) can be calculated by the following equation Eq. (9):
θpost,TA,u(k)=exp(j·2π·(LRS·k+kfirst,u)·Δf·TAu) Eq. (9),
where Δf is the subcarrier spacing between two adjacent subcarriers, LRS is the number of subcarrier spacing between two adjacent RS frequency samples, and kfirst, u is the index of the first subcarrier in the whole bandwidth for RS of the UE u.
Referring the operation S26, beaming weights for branches received from the UE are obtained. In some embodiments, the branch represents one antenna in the antenna arrays or one of the radiation beams. In some embodiments, the beaming weights can be calculated based on the post-TA compensated channel estimation.
In accordance with the embodiments illustrated in
The method illustrated in
In accordance with the embodiments illustrated in
The method illustrated in
In accordance with the embodiments illustrated in
As shown in
Referring to the operation S53, another noise and interference suppressed channel estimation Ĥ′ (or can be referred to as “second noise and interference suppressed channel estimation”) is obtained based on the second pre-TA compensated channel estimation Ĥmf,TA. In some embodiments, the steps for obtaining the second noise and interference suppressed channel estimation R′ are similar to those recited in the operation S23.
Referring to the operation S54, another TA estimation (or can be referred to as “second TA estimation”) is obtained based on the second noise and interference suppressed channel estimation Ĥ′. In some embodiments, the steps for obtaining the second TA estimation are similar to those recited in the operation S24. After the second TA estimation is obtained, the post-TA compensated channel estimation Ĥ′TA is obtained based on the second TA estimation at the operation S25, and then the beaming weights of branches received from the UE is obtained at the operation S26. In some embodiments, the branch represents one antenna in an antenna arrays or one of the radiation beams.
In some preferred embodiments, the operations S21-S24 in
In accordance with the embodiments illustrated in
The method illustrated in
In some preferred embodiments, operations S21, S23 and S24 in
The method illustrated in
In some preferred embodiments, operations S21-S24 in
The method illustrated in
In some preferred embodiments, operations S21, S23 and S24 in
In some implementations, the one or more memories 920 and the computer program codes 925 may be configured to, with the one or more processors 910, cause the apparatus 900 at least to perform any step of the method described in connection with any one of
Alternatively or additionally, the one or more memories 920 and the computer program codes 925 may be configured to, with the one or more processors 910, cause the apparatus 900 at least to perform more or less operations to implement the proposed methods according to the exemplary embodiments of the present disclosure.
In general, the various exemplary embodiments may be implemented in hardware or special purpose chips, circuits, software, logic or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software which may be executed by a controller, microprocessor or any other computing device, although the present disclosure is not limited thereto. While various aspects of the exemplary embodiments of the present disclosure may be illustrated and described as block diagrams, flow charts, or using some other pictorial representation, it is well understood that these blocks, apparatus, systems, techniques or methods described herein may be implemented in, as non-limiting examples, hardware, software, firmware, special purpose circuits or logic, general purpose hardware or controller or other computing devices, or some combination thereof.
As such, it should be appreciated that at least some aspects of the exemplary embodiments of the present disclosure may be practiced in various components such as integrated circuit chips and modules. It should thus be appreciated that the exemplary embodiments of the present disclosure may be realized in an apparatus that is embodied as an integrated circuit, where the integrated circuit may comprise circuitry (as well as possibly firmware) for embodying at least one or more of a data processor, a digital signal processor, baseband circuitry and radio frequency circuitry that are configurable so as to operate in accordance with the exemplary embodiments of the present disclosure.
It should be appreciated that at least some aspects of the exemplary embodiments of the present disclosure may be embodied in computer-executable instructions, such as in one or more program modules, executed by one or more computers or other devices. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types when executed by a processor in a computer or other devices. The computer executable instructions may be stored on a computer readable medium such as a hard disk, optical disk, removable storage media, solid state memory, random access memory (RAM), etc. As will be appreciated by one of skill in the art, the function of the program modules may be combined or distributed as desired in various embodiments. In addition, the function may be embodied in whole or partly in firmware or hardware equivalents such as integrated circuits, field programmable gate arrays, and the like.
The present disclosure includes any novel feature or combination of the features disclosed herein either explicitly or any generalization thereof. Various modifications and adaptations to the foregoing exemplary embodiments of the present disclosure may become apparent to those skilled in the relevant arts in view of the foregoing description, when read in conjunction with the accompanying drawings. However, any and all modifications will still fall within the scope of the non-limiting and exemplary embodiments of the present disclosure.
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/CN2020/076949 | 2/27/2020 | WO |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2020/177610 | 9/10/2020 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
20120127964 | Turtinen et al. | May 2012 | A1 |
20130322575 | Muquet | Dec 2013 | A1 |
20150189610 | Siomina | Jul 2015 | A1 |
20190253281 | Gau | Aug 2019 | A1 |
Number | Date | Country |
---|---|---|
101606325 | Dec 2009 | CN |
102972000 | Mar 2013 | CN |
103283199 | Sep 2013 | CN |
106506412 | Mar 2017 | CN |
108832965 | Nov 2018 | CN |
2051390 | Apr 2009 | EP |
3346777 | Jul 2018 | EP |
2018 202038 | Nov 2018 | WO |
Entry |
---|
EPO Communication and Supplementary Search Report dated Apr. 4, 2022 for Patent Application No. 20766395.6, consisting of 5-pages. |
3GPP TSG RAN WG6 #3; Athens, Greece; Source: Nokia; Serving Cell TA Estimation for Multilateration Positioning; Agenda item 6.1.1 (R6-170045)—Feb. 13-17, 2017. |
PCT Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration issued for International application No. PCT/CN2020/076949—May 27, 2020. |
Chinese Office Action with English Machine Translation dated Jun. 2, 2023 for Patent Application No. 202080018598.0, consisting of 13-pages. |
Number | Date | Country | |
---|---|---|---|
20220150855 A1 | May 2022 | US |