CALIBRATION OF TRANSMIT ANTENNA CHAINS AND RECEIVE ANTENNA CHAINS OF AN ANTENNA SYSTEM

20240072911 · 2024-02-29

Assignee

Inventors

Cpc classification

International classification

Abstract

There is provided mechanisms for calibrating transmit antenna chains and receive antenna chains of an antenna system. A method is performed by a network node. The method comprises obtaining a set of observations from bi-directional sounding of pairs of antennas of the antenna system. Each of the antennas has one transmit antenna chain and one receive antenna chain. The observations are represented by a composite product of transmit calibration weights, receive calibration weights, and signal leakage terms. The method comprises estimating the transmit calibration weights and the receive calibration weights from a decomposition of the composite product. The method comprises calibrating the transmit antenna chains and the receive antenna chains by applying as calibration factors the estimated transmit calibration weights to the transmit antenna chains and the receive calibration weights to the receive antenna chains.

Claims

1. A method for calibrating transmit antenna chains and receive antenna chains of an antenna system, the method being performed by a network node, the method comprising: obtaining a set of observations from bi-directional sounding of pairs of antennas of the antenna system wherein each of the antennas has one transmit antenna chain and one receive antenna chain, and wherein the observations are represented by a composite product z of transmit calibration weights, receive calibration weights, and signal leakage terms; estimating the transmit calibration weights and the receive calibration weights from a decomposition of the composite product z; and calibrating the transmit antenna chains and the receive antenna chains by applying as calibration factors the estimated transmit calibration weights to the transmit antenna chains and the receive calibration weights to the receive antenna chains.

2. The method according to claim 1, wherein the composite product z is composed of normalized cross-correlation terms obtained for a set of antennas of the antenna system, wherein each normalized cross-correlation term represents bi-directional sounding of a respective pair of antennas of the antenna system.

3. The method according to claim 2, wherein normalized cross-correlation term z.sub.nm represents normalized cross-correlation between antenna n and antenna m of the antenna system for transmission of a signal c.sub.m from antenna m and reception of the signal c.sub.m at antenna n.

4. The method according to claim 3, wherein the signal c.sub.m is dedicated for the bi-directional sounding.

5. The method according to claim 2, wherein normalized cross-correlation term z.sub.nm is a function of a transmit gain value t.sub.m of antenna m, a receive gain value r.sub.n of antenna n, and a signal leakage term .sub.nm between antenna n and antenna m.

6. The method according to claim 5, wherein the normalized cross-correlation term z.sub.nm is defined as
z.sub.nm=r.sub.n(1+.sub.nm)t.sub.m.

7. The method according to claim 6, wherein the composite product z is defined as: Z = Diag [ r 1 r 2 .Math. r N ] [ 0 1 + 12 .Math. 1 + 1 N 1 + 21 .Math. .Math. 1 + N - 1 N 1 + N 1 1 + N 1 .Math. 0 ] Diag [ t 1 t 2 .Math. t N ] , where Diag [ x 1 x 2 .Math. x N ] is a diagonal matrix with elements x.sub.1, x.sub.2, . . . , x.sub.N on its diagonal.

8. The method according to claim 1, wherein the transmit calibration weights are defined by the transmit gain values and the receive calibration weights are defined by the receive gain values.

9. The method according to claim 1, wherein observations from bi-directional sounding of all pairs of antennas of the antenna system are present in the composite product z or, wherein observations from bi-directional sounding of less than all pairs of antennas of the antenna system are present in the composite product z.

10. (canceled)

11. The method according to claim 1, wherein only a subset of the composite product z is decomposed for estimating the transmit calibration weights and the receive calibration weights.

12. The method according to claim 11, wherein the subset is defined by values of the composite product z having a magnitude larger than a threshold value.

13. The method according to claim 1, wherein the estimated transmit calibration weights and the estimated receive calibration weights are subjected to scaling before being applied as calibration factors.

14. The method according to claim 13, wherein scaling factors used for scaling the estimated transmit calibration weights and the estimated receive calibration weights are estimated by setting the estimated transmit calibration weight for one of the transmit antenna chains to unit amplitude and by setting the estimated receive calibration weight for one of the receive antenna chains to unit amplitude.

15.-19. (canceled)

20. A network node for calibrating transmit antenna chains and receive antenna chains of an antenna system, the network node comprising processing circuitry, the processing circuitry being configured to cause the network node to: obtain a set of observations from bi-directional sounding of pairs of antennas of the antenna system, wherein each of the antennas has one transmit antenna chain and one receive antenna chain, and wherein the observations are represented by a composite product z of transmit calibration weights, receive calibration weights, and signal leakage terms; estimate the transmit calibration weights and the receive calibration weights from a decomposition of the composite product z; and calibrate the transmit antenna chains and the receive antenna chains by applying as calibration factors the estimated transmit calibration weights to the transmit antenna chains and the receive calibration weights to the receive antenna chains.

21. (canceled)

22. The network node according to claim 20, wherein the composite product z is composed of normalized cross-correlation terms obtained for a set of antennas of the antenna system, wherein each normalized cross-correlation term represents bi-directional sounding of a respective pair of antennas of the antenna system.

23. A computer program product for calibrating transmit antenna chains and receive antenna chains of an antenna system, the computer program product comprising a computer readable medium storing computer code which, when run on processing circuitry of a network node, causes the network node to: obtain a set of observations from bi-directional sounding of pairs of antennas of the antenna system, wherein each of the antennas has one transmit antenna chain and one receive antenna chain, and wherein the observations are represented by a composite product z of transmit calibration weights, receive calibration weights, and signal leakage terms; estimate the transmit calibration weights and the receive calibration weights from a decomposition of the composite product z; and calibrate the transmit antenna chains and the receive antenna chains by applying as calibration factors the estimated transmit calibration weights to the transmit antenna chains and the receive calibration weights to the receive antenna chains.

24. (canceled)

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0024] The inventive concept is now described, by way of example, with reference to the accompanying drawings, in which:

[0025] FIG. 1 is a schematic diagram illustrating a communication network according to embodiments;

[0026] FIG. 2 schematically illustrates an antenna system according to an embodiment;

[0027] FIGS. 3 and 4 are flowcharts of methods according to embodiments;

[0028] FIGS. 5 and 6 show simulation results according to embodiments;

[0029] FIG. 7 is a schematic diagram showing functional units of a network node according to an embodiment;

[0030] FIG. 8 is a schematic diagram showing functional modules of a network node according to an embodiment;

[0031] FIG. 9 shows one example of a computer program product comprising computer readable storage medium according to an embodiment;

[0032] FIG. 10 is a schematic diagram illustrating a telecommunication network connected via an intermediate network to a host computer in accordance with some embodiments; and

[0033] FIG. 11 is a schematic diagram illustrating host computer communicating via a radio base station with a terminal device over a partially wireless connection in accordance with some embodiments.

DETAILED DESCRIPTION

[0034] The inventive concept will now be described more fully hereinafter with reference to the accompanying drawings, in which certain embodiments of the inventive concept are shown. This inventive concept may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided by way of example so that this disclosure will be thorough and complete, and will fully convey the scope of the inventive concept to those skilled in the art. Like numbers refer to like elements throughout the description. Any action or feature illustrated by dashed lines should be regarded as optional. In general bold type face is used throughout this disclosure to denote vectors and matrices.

[0035] FIG. 1 is a schematic diagram illustrating a communication network 100 where embodiments presented herein can be applied. The communication network 100 could be a third generation (3G) telecommunications network, a fourth generation (4G) telecommunications network, a fifth generation (5G) telecommunications network, or any evolvement thereof, and support any 3GPP telecommunications standard, where applicable.

[0036] The communication network 100 comprises a network node 200 configured to provide network access to user equipment, as represented by user equipment 160, in a radio access network 110. The radio access network 110 is operatively connected to a core network 120. The core network 120 is in turn operatively connected to a service network 130, such as the Internet. The user equipment 160 is thereby enabled to, via the network node 200, access services of, and exchange data with, the service network 130.

[0037] The network node 200 comprises, is collocated with, is integrated with, or is in operational communications with, an antenna system 140. The network node 200 (via its antenna system 140) and the user equipment 160 are configured to communicate with each other in beams, one of which is illustrated at reference numeral iso. In this respect, beams that could be used both as transmit beams and receive beams will hereinafter simply be referred to as beams.

[0038] Examples of network nodes 200 are radio access network nodes, radio base stations, base transceiver stations, Node Bs, evolved Node Bs, gNBs, access points, access nodes, and backhaul nodes. Examples of user equipment 160 are terminal devices, wireless devices, mobile stations, mobile phones, handsets, wireless local loop phones, smartphones, laptop computers, tablet computers, network equipped sensors, network equipped vehicles, and so-called Internet of Things devices.

[0039] As noted above there is still a need for an improved calibration of transmit antenna chains and receive antenna chains of an antenna system 140. In further detail, although yielding reasonably good calibration coefficients, for iterative techniques there could be challenges related to the robustness of the iterative technique due to inter-transceiver leakage.

[0040] The embodiments disclosed herein therefore relate to mechanisms for calibrating transmit antenna chains and receive antenna chains of an antenna system 140. In order to obtain such mechanisms there is provided a network node 200, a method performed by the network node 200, a computer program product comprising code, for example in the form of a computer program, that when run on a network node 200, causes the network node 200 to perform the method. The overall objective is to calibrate the transmit antenna chains and receive antenna chains without using a calibration network by exploiting the mutual coupling between the antennas.

[0041] FIG. 2 schematically illustrates the antenna system 140 according to an embodiment. The antenna system 140 comprises transmit antenna chains 144m, 144n and receive antenna chains 146m, 146n. The transmit antenna chains 144m, 144n and receive antenna chains 146m, 146n are connected to antennas 142m, 142n for transmission and reception of signals over the air interface. In some embodiments, there are two or more individual antennas 142m, 142n per each transmit antenna chains 144m, 144n and receive antenna chains 146m, 146n and the two or more individual antennas 142m, 142n per each transmit antenna chains 144m, 144n and receive antenna chains 146m, 146n form an antenna array. Alternatively, all antennas 142m, 142n collectively define one single antenna array and the two or more individual antennas 142m, 142n per each transmit antenna chains 144m, 144n and receive antenna chains 146m, 146n form a sub-array of the antenna array. Each such antenna array or sub-array could correspond to one antenna port. The terms antenna, antenna array, sub-array, and antenna port can therefore hereinafter be used interchangeably.

[0042] With reference to FIG. 2, the overall objective can be formulated as how to estimate the complex-valued gains of the N transmit antenna chains 144m, 144n and receive antenna chains 146m, 146n, namely, t.sub.n, r.sub.n, n{1, . . . , N}. Individual antenna elements response a.sub.m, a.sub.n (i.e., one response per each antenna array or antenna port) are assumed to be approximately known or included within the complex-valued gains and accounted in calibration, since they can also be measured in a factory pre-calibration.

[0043] In FIG. 2, S.sub.nm denotes to the S parameters (where S is short for scattering) between transmit antenna m and receive antenna n. Typically, S.sub.nm is dominated by mutual coupling between nearby transmit and receive antenna elements. As a non-limiting example, for a one-dimensional linear array with antenna elements indexed from one end to the other this would correspond to that the value of n is close to the value of m. It can be assumed that S.sub.nm is approximately known or given our design setup, since the value of S.sub.nm can be measured in during a factory pre-calibration. In practice, the actual coupling of signals between transmit antenna m and receive antenna n elements will also include unknown leakage and hence the actual S parameter, S.sub.nm, can be expressed as S.sub.nm=S.sub.nm(1+.sub.nm) where .sub.nm is a leakage term between transmit antenna m and receive antenna n. This leakage typically occurs when a transmit antenna chain is physically close to a receive antenna chain, and thus the received signal is not only due to the mutual coupling part of the channel, but also due to undesired transceiver leakage.

[0044] In addition to leakage, there can also be unknown process variations since the expected S parameters will be different from actual S parameters. This may happen when pre-calibration is performed for one single antenna element, or antenna array, and expect that the S parameters of the other antenna elements, or antenna arrays, to be similar.

[0045] Consider that antenna system 140 is configured for operation in a time division duplex (TDD) mode, i.e. to utilize transmit and receive modes with same carrier frequency. A known pilot signal, denoted c.sub.m, is transmitted in digital baseband (frequency/time domain) from transmit antenna m and received at antenna n. The received signal at antenna n can then be written as:


x.sub.nm=r.sub.nS.sub.nmt.sub.mc.sub.m+w.sub.nm,

where w.sub.nm denotes additive noise.

[0046] Note that a single signal c.sub.m transmitted from antenna m is received by all n antennas, n{1, . . . , N}, nm. There are thus N1 observations and for the known pilot, these signals, the combined transmit, receive and S parameter channel is obtained by average cross correlation of the received signals with pilot sequence corrupted by noise:


y.sub.nm=E{(r.sub.nS.sub.nmt.sub.mc.sub.m+w.sub.nm).Math.c.sub.m}.Math.y.sub.nmr.sub.nS.sub.nmt.sub.m,(1)

where it assumed that the pilot signal is uncorrelated with the noise term. In expression (1), c.sub.m denotes the complex conjugate of c.sub.m.

[0047] FIG. 3 is a flowchart illustrating embodiments of methods for calibrating transmit antenna chains 144m, 144n and receive antenna chains 146m, 146n of an antenna system 140. The methods are performed by the network node 200. The methods are advantageously provided as computer programs 920.

[0048] The method is based on exploiting the mutual coupling between antenna elements of transmit antenna chains and antenna elements of receive antenna chains. The method therefore involves post-processing a set of received observations, obtained from bi-directional sounding of at least some pairs of antennas 142m, 142n of the antenna system 140, in order to estimative suitable calibration coefficients. Hence, the network node 200 is configured to perform action S102:

[0049] S102: The network node 200 obtains a set of observations from bi-directional sounding of pairs of antennas 142m, 142n of the antenna system 140. Each of the antennas 142m, 142n has one transmit antenna chain 144m, 144n and one receive antenna chain 146m, 146n. The observations are represented by a composite product Z of transmit calibration weights, receive calibration weights, and signal leakage terms.

[0050] The observations contain a composite product of the transmit and receive calibration weights that are to be estimated. Hence, the network node 200 is configured to perform action S104:

[0051] S104: The network node 200 estimates the transmit calibration weights and the receive calibration weights from a decomposition of the composite product Z.

[0052] The estimate of the transmit calibration weights and receive calibration weights are then applied to ensure phase and amplitude alignment of transmit antenna chains 144m, 144n and the receive antenna chains 146m, 146n. Hence, the network node 200 is configured to perform action S106:

[0053] S106: The network node 200 calibrates the transmit antenna chains 144m, 144n and the receive antenna chains 146m, 146n by applying as calibration factors the estimated transmit calibration weights to the transmit antenna chains 144m, 144n and the receive calibration weights to the receive antenna chains 146m, 146n.

[0054] Embodiments relating to further details of calibrating transmit antenna chains 144m, 144n and receive antenna chains 146m, 146n of an antenna system 140 as performed by the network node 200 will now be disclosed.

[0055] The method as defined by actions S102, S104, and S106 can be applied in any frequency band; one occurrence of actions S102, S104, and S106 can be applied in each frequency band of interest. Hence, wideband calibration can be achieved by repeating actions S102, S104, and S106 over different parts of the frequency band, for example over different sub-bands across a wide frequency band or over distinct frequency bands that define a multi-band wideband antenna system.

[0056] In some embodiments, the composite product Z is composed of normalized cross-correlation terms obtained for a set of antennas 142m, 142n of the antenna system 140, wherein each normalized cross-correlation term represents bi-directional sounding of a respective pair of antennas 142m, 142n of the antenna system 140. In some aspects, the observations are obtained at receive antenna chains 146m, 146n due to mutual coupling and leakage between the antennas 142m, 142n of the antenna system 140. Let normalized cross-correlation term z.sub.nm represent the normalized cross-correlation between antenna n and antenna m of the antenna system 140 for transmission of a signal c.sub.m from antenna m and reception of the signal c.sub.m at antenna n. In some embodiments, the signal c.sub.m is dedicated for the bi-directional sounding.

[0057] Due to the mutual coupling between transmit antenna m and receive antenna n, the averaged cross correlation is y.sub.nmr.sub.nS.sub.nmt.sub.m. Denote by z.sub.nm the cross-correlation normalized by the S parameters (i.e., by S.sub.nm). Then, z.sub.nm can be expressed as follows:

[00001] z n m = y n m s n m = r n ( 1 + n m ) t m . ( 2 )

[0058] Hence, in some embodiments, the normalized cross-correlation term z.sub.nm is a function of transmit gain value t.sub.m of antenna m, receive gain value r.sub.n of antenna n, and the signal leakage term .sub.nm between antenna n and antenna m.

[0059] As noted above, the objective is to estimate t.sub.m and r.sub.n. In expression (2), however, there is one observation and two unknowns, and thus no unique solution can be found. The same procedure is therefore repeated for further receive antennas n for the same transmit antenna m. If the procedure, for transmit antenna m, is repeated for the other N1 receive antennas, these cross-correlation terms can be stacked as a N11 vector. For transmit antenna 1, stacking all possible observations leads to an N1 vector z.sub.1:

[00002] z 1 = [ r 1 r 2 .Math. r N ] Diag [ 0 1 + 21 .Math. 1 + N 1 ] ( t 1 ) .

[0060] The notation Diag(x) denotes a diagonal matrix formed from the vector x. That is,

[00003] Diag [ x 1 x 2 .Math. x N ]

is a diagonal matrix with elements x.sub.1, x.sub.2, . . . , x.sub.N on its diagonal. Similarly, an N1 vector can be obtained for all transmit antennas t.sub.m m{1, . . . , N}. That is:

[00004] z m = [ r 1 r 2 .Math. r N ] Diag [ 1 + 1 m 1 + 2 m .Math. 1 + N m ] ( t m ) . ( 3 )

[0061] In expression (3) there is a zero at row m in the leakage term vector.

[0062] Stacking all column vectors and keeping the diagonal elements as non-zero yields an NN matrix Z:

[00005] Z = [ z 1 z 2 .Math. z N ] = Diag [ r 1 r 2 .Math. r N ] [ 0 1 + 12 .Math. 1 + 1 N 1 + 21 .Math. .Math. 1 + N - 1 N 1 + N 1 1 + N 1 .Math. 0 ] Diag [ t 1 t 2 .Math. t N ] Z = D r [ 1 - ( I - ) ] D t , ( 4 )

[0063] where I is an NN identity matrix, and 1 is a matrix will ones in all of its entries. Further, D.sub.t and D.sub.r are diagonal matrices containing the transmit and receive terms that are to be estimated and corresponds to the leakage terms between the transmit antennas and the receive antennas. Hence, in some embodiments, the composite product Z is a matrix with the observations stacked either as columns or rows.

[0064] The leakage terms .sub.nm are assumed to be independent of S parameters values. Note that S.sub.nm=S.sub.mn since the S parameters made of passive antenna elements can be assumed to be reciprocal. However, no such reciprocity assumption is made for the leakage terms .sub.nm since, as shown in FIG. 2, where S.sub.nm.sup.leak=S.sub.nm.sub.nm, the leakage between two transceivers can take two distinct paths depending on which transmitter/receiver pair is activated.

[0065] For the special case where the leakage terms is small i.e. .sub.nm<<1, then most of the energy of 1(I) is concentrated in one dimension and thus 1(I) can be approximated as close to a rank 1 matrix. For example, simulations indicate that when N=32, approximately 96% of the energy is confined to one dimension of 1(I).

[0066] From expression (4) follows that:


Z=D.sub.r[1(I)]D.sub.t=D.sub.r(1I)D.sub.t+D.sub.rD.sub.t.(5)

[0067] Assume that .sub.nm<<1 and let =D.sub.rD.sub.t. Then expression (5) can be rewritten as:


Z=D.sub.r(1I)D.sub.t+.(6)

[0068] Assuming that the leakage term is small, i.e. .sub.nm<<1, the matrix Z can be approximated by a rank-1 matrix.

[0069] In some embodiments, the decomposition of the composite product Z is a matrix decomposition. One way to find a rank-1 approximation is to perform a singular value decomposition (SVD) of Z and to define the rank-1 estimate by the dominant singular value and its corresponding vectors That is.

[00006] SVD ( Z ) = U .Math. V H = u 1 1 v 1 H + [ u 2 .Math. u N ] [ 2 0 0 .Math. .Math. 0 0 N ] [ v 2 .Math. v N ] H . ( 7 )

[0070] Other decomposition techniques, such as a QR decomposition, or a Gram-Schmidt orthogonalization, can also be used. That is, the basis vectors can be computed using other techniques. For example, the basis vectors can be obtained by means of Gram-Schmidt orthogonalization or other basis estimation approaches. However, to keep this disclosure consistent it is hereinafter assumed that the SVD as in expression (7) is applied to compute the basis vectors.

[0071] If the coupling error is small, i.e., .sub.nm<<1, the signal subspace could be modelled as u.sub.1.sub.1v.sub.1.sup.H, i.e. the dominant singular mode of Z. The observation matrix is expected to be sparse with many elements close to zero. The coupling structure can therefore be exploited, allowing selection of only part of the elements in Z and thereby reducing the overall computation complexity.

[0072] In some embodiments, the transmit calibration weights are defined by the transmit gain values and the receive calibration weights are defined by the receive gain values. Transmit and receive chain calibration to enable coherent beamforming can be achieved by calibrating all transmit antenna chains and receive antenna chains with one given transmit antenna chain and receive antenna chain as reference. Without loss of generality, assume that the first elements of the complex-valued gains of the transmit antenna chains and the receive antenna chains, respectively, are set as t.sub.1=1 and r.sub.1=1. This first element reference can be used to identify the scaling factor.

[0073] In some aspects, the basis vectors provide the amplitude and phase of the transmit and receive calibration terms, i.e., the complex-valued gains of the transmit antenna chains and the receive antenna chains, combined with an unknown complex amplitude and phase scaling. Thus, in some embodiments, the estimated transmit calibration weights and the estimated receive calibration weights are subjected to scaling before being applied as calibration factors. Since Zu.sub.1.sub.1v.sub.1.sup.H when the leakage is low, i.e., when .sub.nm<<1:


t.sub.1u.sub.1 and r.sub.2v.sub.1

[0074] where .sub.1 and .sub.2 are amplitude scaled phase shifts and v.sub.1 denotes complex conjugate of v.sub.1.

[0075] In some aspects, it is assumed that the elements of t and the elements of r follow a similar distribution and that the first elements of t are calibrated with the first elements of r. The scaling terms can then be approximated as |.sub.1|=|.sub.2|={square root over (.sub.1)}. Alternatively, in practice, if the scaling between any other transmit-receive pair, say r.sub.2/t.sub.2, is known, then also this relationship can be used to determine the scaling factors for the remaining terms. That is, in some embodiments, the scaling factors used for scaling the estimated transmit calibration weights and the estimated receive calibration weights are estimated by setting the estimated transmit calibration weight for one of the transmit antenna chains 144m, 144n to unit amplitude and by setting the estimated receive calibration weight for one of the receive antenna chains 146m, 146n to unit amplitude. Yet alternatively, information of known variations in the transmit antenna chains and the receive antenna chains can be approximated and used as scaling factors.

[0076] In some aspects, the sounding is not performed for all antenna pairs. That is, in some embodiments, observations from bi-directional sounding of less than all pairs of antennas 142m, 142n of the antenna system 140 are present in the composite product Z. In other aspects, the sounding is performed for all antenna pairs. That is, in some embodiments, observations from bi-directional sounding of all pairs of antennas 142m, 142n of the antenna system 140 are present in the composite product Z. However, even in case where the sounding is performed for all antenna pairs, not all terms need to be kept in Z when the transmit calibration weights and the receive calibration weights are to be estimated. That is in some embodiments, only a subset of the composite product Z is decomposed for estimating the transmit calibration weights and the receive calibration weights. For example, for cases where .sub.nm<<1 does not hold, for example where is in the same order as S.sub.nm, only terms with a reasonable coupling are kept. Mathematically, this can be achieved by applying a selection matrix that put certain elements to zero. Particularly, in some embodiments, the subset is defined by values of the composite product Z having a magnitude larger than a threshold value. A selection matrix threshold S.sub.threshold can be used for this purpose.

[0077] Aspects of applying as calibration factors the estimated transmit calibration weights to the transmit antenna chains 144m, 144n and the receive calibration weights to the receive antenna chains 146m, 146n will now be disclosed.

[0078] Denote by the vector s t the data stream to be transmitted from the N transmit antennas at time instant t, denote by the vector x.sub.t the corresponding precoded signal, and denote by the matrix P the precoder. Then, x.sub.t as compensated for calibration errors by application of [D.sub.t].sup.1 can be written as:


x.sub.t=[D.sub.t].sup.1Ps.sub.t.

[0079] Similarly, denote by the vector y.sub.t the signal received in the uplink at time instant t as corrupted by additive noise w.sub.t, modified by the wireless channel H and compensated for calibration errors by application of [D.sub.r].sup.1. Then:


y.sub.t=[D.sub.r].sup.1(Hx.sub.t+w.sub.t).

[0080] Note that in the above expressions, D.sub.t=Diag[t.sub.1u.sub.1] and D.sub.r=Diag[r.sub.2v.sub.1].

[0081] Aspects of how to remove the second right-side member in expression (6), namely D.sub.rD.sub.t, so that the expression (6) is closer to a rank 1 matrix will now be disclosed. According to the above, the matrix Z has zeros in its diagonal entries since a transceiver operating in TDD cannot transmit and receive simultaneously. Thus, when trying to estimate the left and right singular vectors of Z, there will always be an error floor. This is not problematic in practice when N is large, since the number of off-diagonal entries, namely N.sup.2N is much larger than the number of diagonal entries, namely N. However, the following aspects can be applied to further mitigate this.

[0082] After the left and right dominant singular vectors from Z have been estimated, another matrix, denoted Z.sub.1, can be formed by insertion of the estimated complex-valued gains t.sub.n, r.sub.n of the N transmit antenna chains 144m, 144n and receive antenna chains 146m, 146n, in the diagonal entries of Z. That is:


Z.sub.1=Z+{circumflex over (D)}.sub.r,0{circumflex over (D)}.sub.t,0.

[0083] Here, {circumflex over (D)}.sub.r,0 and {circumflex over (D)}.sub.t,0 are the estimates of D.sub.r and D.sub.t at iteration 0. The process of estimating the complex-valued gains t.sub.n, r.sub.n can then be repeated by estimating the left and right dominant singular vectors from Z.sub.1, followed by inserting the thus new estimated complex-valued gains in the diagonal entries of Z.sub.1, namely:


Z.sub.2=Z.sub.1+{circumflex over (D)}.sub.r,1{circumflex over (D)}.sub.t,1

[0084] and re-estimating the left and right dominant singular vectors from Z.sub.2. Thus, the process of estimating the complex-valued gains t.sub.m, r.sub.n can be iteratively performed with:


Z.sub.k+1=Z.sub.k+{circumflex over (D)}.sub.r,k{circumflex over (D)}.sub.t,k.

[0085] This procedure can be iteratively performed until Z.sub.k+1Z.sub.k. In some embodiments, the matrix decomposition is thus iteratively determined Z.sub.k+1=Z.sub.k+{circumflex over (D)}.sub.r,k{circumflex over (D)}.sub.t,k until Z.sub.k+1Z.sub.k<, where Z.sub.k is the composite product Z for iteration k, where {circumflex over (D)}.sub.r,k is a diagonal matrix with elements r.sub.1, r.sub.2, . . . , r.sub.N on its diagonal as determined from Z.sub.k, where {circumflex over (D)}.sub.t,k is a diagonal matrix with elements t.sub.1, t.sub.2, . . . , t.sub.N on its diagonal as determined from Z.sub.k, and where is a threshold value. In this respect, alternating, or convex, projections, for example the Gerchberg-Saxton (GS) algorithm can be applied to iteratively estimate the complex-valued gains t.sub.n, r.sub.n.

[0086] Reference is now made to the flowchart of FIG. 4 for an embodiments a methods for calibrating transmit antenna chains 144m, 144n and receive antenna chains 146m, 146n of an antenna system 140 based on at least some of the embodiments, aspects, and examples disclosed above.

[0087] S201: A known pilot signal c.sub.m is transmitted in digital baseband (frequency/time domain) from transmit antenna m and received at antenna n. The received signal at antenna n is x.sub.nm=r.sub.nS.sub.nmt.sub.mc.sub.m+w.sub.nm, where w.sub.nm denotes additive noise.

[0088] S202: The averaged cross-correlation is determined as y.sub.nmr.sub.nS.sub.nmt.sub.m and the cross-correlation normalized by the S parameters (i.e., by S.sub.nm) is determined as

[00007] z n m = y n m s n m = r n ( 1 + n m ) t m .

[0089] Actions S201 and S202 are repeated for all antenna pairs.

[0090] S203: The normalized cross-correlations from all observations are stacked in column vectors z.sub.m and then all column vectors are stacked, yielding an NN matrix Z that defines a composite product.

[0091] S204: The matrix Z is decomposed, for examples using SVD;

[00008] SVD ( Z ) = U .Math. V H = u 1 1 v 1 H + [ u 2 .Math. u N ] [ 2 0 0 .Math. .Math. 0 0 N ] [ v 2 .Math. v N ] H .

The first left and right singular vectors of Z, i.e., u.sub.1 and v.sub.1 are extracted.

[0092] S205: The transmit calibration weights are found as t.sub.1u.sub.1 and the receive calibration weights are found as r.sub.2v.sub.1, where .sub.1 and .sub.2 are amplitude scaled phase shifts.

[0093] Reference is now made to FIG. 5 and FIG. 6 which show simulation results. FIG. 5 shows simulation results in terms of normalized mean squared error (MSE) as a function of values of S.sub.threshold for different leakage levels S.sub.nm.sup.leak. FIG. 6 shows simulation results in terms of normalized MSE as a function of SNR for different leakage levels S.sub.nm.sup.leak. The simulation results are in FIG. 5 and FIG. 6 shown for an antenna system 140 where mutual coupling levels S.sub.nm are defined by the S parameters. In the presence of leakage, the actual S parameters are

[00009] ( S n m + s n m leak ) = S n m ( 1 + n m ) , where n m = s n m leak s n m .

Typically, the leakage terms follow a complex Gaussian distribution: S.sub.nm.sup.leakCN(0,.sub.leak.sup.2|S.sub.nm|), where .sub.leak.sup.2 denotes the leakage variance levels. To improve the accuracy of the results, the received signals obtained from antennas when the S parameter levels are below a threshold are ignored. That is:


x.sub.nm=r.sub.nS.sub.nmt.sub.mc.sub.n+w.sub.nmx.sub.nm if S.sub.nm<S.sub.threshold.

[0094] In the simulations,

[00010] .Math. "\[LeftBracketingBar]" s threshold .Math. "\[RightBracketingBar]" max .Math. "\[LeftBracketingBar]" s n m .Math. "\[RightBracketingBar]" < - 30 dB .

runner, the normalized MSE is defined as below for the transmitter (TX) and receiver (RX), respectively:

[00011] MSE TX = 1 - E { t H t } Er { t H t } E { t H t } and MSE R X = 1 - E { r H r } E { r H r } E { r H r } .

[0095] Typically, the error vector magnitude (EVM) is the normalized root mean squared error, and should follow the MSE values.

[0096] FIG. 7 schematically illustrates, in terms of a number of functional units, the components of a network node 200 according to an embodiment. Processing circuitry 210 is provided using any combination of one or more of a suitable central processing unit (CPU), multiprocessor, microcontroller, digital signal processor (DSP), etc., capable of executing software instructions stored in a computer program product 910 (as in FIG. 9), e.g. in the form of a storage medium 230. The processing circuitry 210 may further be provided as at least one application specific integrated circuit (ASIC), or field programmable gate array (FPGA).

[0097] Particularly, the processing circuitry 210 is configured to cause the network node 200 to perform a set of operations, or actions, as disclosed above. For example, the storage medium 230 may store the set of operations, and the processing circuitry 210 may be configured to retrieve the set of operations from the storage medium 230 to cause the network node 200 to perform the set of operations. The set of operations may be provided as a set of executable instructions.

[0098] Thus the processing circuitry 210 is thereby arranged to execute methods as herein disclosed. The storage medium 230 may also comprise persistent storage, which, for example, can be any single one or combination of magnetic memory, optical memory, solid state memory or even remotely mounted memory. The network node 200 may further comprise a communications interface 220 at least configured for communications with other entities, functions, nodes, and devices, as disclosed above with reference to FIG. 1. As such the communications interface 220 may comprise one or more transmitters and receivers, comprising analogue and digital components. The processing circuitry 210 controls the general operation of the network node 200 e.g. by sending data and control signals to the communications interface 220 and the storage medium 230, by receiving data and reports from the communications interface 220, and by retrieving data and instructions from the storage medium 230. Other components, as well as the related functionality, of the network node 200 are omitted in order not to obscure the concepts presented herein.

[0099] FIG. 8 schematically illustrates, in terms of a number of functional modules, the components of a network node 200 according to an embodiment. The network node 200 of FIG. 8 comprises a number of functional modules; an obtain module 210a configured to perform action S102, an estimate module 210b configured to perform action S104, and a calibrate module 210C configured to perform action S106. The network node 200 of FIG. 8 may further comprise a number of optional functional modules, as represented by functional module 210d. In general terms, each functional module 210a:210d may in one embodiment be implemented only in hardware and in another embodiment with the help of software, i.e., the latter embodiment having computer program instructions stored on the storage medium 230 which when run on the processing circuitry makes the network node 200 perform the corresponding actions mentioned above in conjunction with FIG. 8. It should also be mentioned that even though the modules correspond to parts of a computer program, they do not need to be separate modules therein, but the way in which they are implemented in software is dependent on the programming language used. Preferably, one or more or all functional modules 210a:210d may be implemented by the processing circuitry 210, possibly in cooperation with the communications interface 220 and/or the storage medium 230. The processing circuitry 210 may thus be configured to from the storage medium 230 fetch instructions as provided by a functional module 210a:210d and to execute these instructions, thereby performing any actions as disclosed herein.

[0100] The network node 200 may be provided as a standalone device or as a part of at least one further device. For example, the network node 200 may be provided in a node of the radio access network or in a node of the core network. Alternatively, functionality of the network node 200 may be distributed between at least two devices, or nodes. These at least two nodes, or devices, may either be part of the same network part (such as the radio access network or the core network) or may be spread between at least two such network parts. In general terms, instructions that are required to be performed in real time may be performed in a device, or node, operatively closer to the cell than instructions that are not required to be performed in real time.

[0101] Thus, a first portion of the instructions performed by the network node 200 may be executed in a first device, and a second portion of the of the instructions performed by the network node 200 may be executed in a second device; the herein disclosed embodiments are not limited to any particular number of devices on which the instructions performed by the network node 200 may be executed. Hence, the methods according to the herein disclosed embodiments are suitable to be performed by a network node 200 residing in a cloud computational environment. Therefore, although a single processing circuitry 210 is illustrated in FIG. 7 the processing circuitry 210 may be distributed among a plurality of devices, or nodes. The same applies to the functional modules 210a:210d of FIG. 8 and the computer program 920 of FIG. 9.

[0102] FIG. 9 shows one example of a computer program product 910 comprising computer readable storage medium 930. On this computer readable storage medium 930, a computer program 920 can be stored, which computer program 920 can cause the processing circuitry 210 and thereto operatively coupled entities and devices, such as the communications interface 220 and the storage medium 230, to execute methods according to embodiments described herein. The computer program 920 and/or computer program product 910 may thus provide means for performing any actions as herein disclosed.

[0103] In the example of FIG. 9, the computer program product 910 is illustrated as an optical disc, such as a CD (compact disc) or a DVD (digital versatile disc) or a Blu-Ray disc. The computer program product 910 could also be embodied as a memory, such as a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), or an electrically erasable programmable read-only memory (EEPROM) and more particularly as a non-volatile storage medium of a device in an external memory such as a USB (Universal Serial Bus) memory or a Flash memory, such as a compact Flash memory. Thus, while the computer program 920 is here schematically shown as a track on the depicted optical disk, the computer program 920 can be stored in any way which is suitable for the computer program product 910.

[0104] FIG. 10 is a schematic diagram illustrating a telecommunication network connected via an intermediate network 420 to a host computer 430 in accordance with some embodiments. In accordance with an embodiment, a communication system includes telecommunication network 410, such as a 3GPP-type cellular network, which comprises access network 411, such as radio access network no in FIG. 1, and core network 414, such as core network 120 in FIG. 1. Access network 411 comprises a plurality of radio access network nodes 412a, 412b, 412c, such as NBs, eNBs, gNBs (each corresponding to the network node 200 of FIG. 1) or other types of wireless access points, each defining a corresponding coverage area, or cell, 413a, 413b, 413c. Each radio access network nodes 412a, 412b, 412c is connectable to core network 414 over a wired or wireless connection 415. A first UE 491 located in coverage area 413c is configured to wirelessly connect to, or be paged by, the corresponding network node 412c. A second UE 492 in coverage area 413a is wirelessly connectable to the corresponding network node 412a. While a plurality of UE 491, 492 are illustrated in this example, the disclosed embodiments are equally applicable to a situation where a sole UE is in the coverage area or where a sole terminal device is connecting to the corresponding network node 412. The UEs 491, 492 correspond to the user equipment 160 of FIG. 1.

[0105] Telecommunication network 410 is itself connected to host computer 430, which may be embodied in the hardware and/or software of a standalone server, a cloud-implemented server, a distributed server or as processing resources in a server farm. Host computer 430 may be under the ownership or control of a service provider, or may be operated by the service provider or on behalf of the service provider. Connections 421 and 422 between telecommunication network 410 and host computer 430 may extend directly from core network 414 to host computer 430 or may go via an optional intermediate network 420. Intermediate network 420 may be one of, or a combination of more than one of, a public, private or hosted network; intermediate network 420, if any, may be a backbone network or the Internet; in particular, intermediate network 420 may comprise two or more sub-networks (not shown).

[0106] The communication system of FIG. 10 as a whole enables connectivity between the connected UEs 491, 492 and host computer 430. The connectivity may be described as an over-the-top (OTT) connection 450. Host computer 430 and the connected UEs 491, 492 are configured to communicate data and/or signaling via OTT connection 450, using access network 411, core network 414, any intermediate network 420 and possible further infrastructure (not shown) as intermediaries. OTT connection 450 may be transparent in the sense that the participating communication devices through which OTT connection 450 passes are unaware of routing of uplink and downlink communications. For example, network node 412 may not or need not be informed about the past routing of an incoming downlink communication with data originating from host computer 430 to be forwarded (e.g., handed over) to a connected UE 491. Similarly, network node 412 need not be aware of the future routing of an outgoing uplink communication originating from the UE 491 towards the host computer 430.

[0107] FIG. 11 is a schematic diagram illustrating host computer communicating via a radio access network node with a UE over a partially wireless connection in accordance with some embodiments. Example implementations, in accordance with an embodiment, of the UE, radio access network node and host computer discussed in the preceding paragraphs will now be described with reference to FIG. 1i. In communication system 500, host computer 510 comprises hardware 515 including communication interface 516 configured to set up and maintain a wired or wireless connection with an interface of a different communication device of communication system 500. Host computer 510 further comprises processing circuitry 518, which may have storage and/or processing capabilities. In particular, processing circuitry 518 may comprise one or more programmable processors, application-specific integrated circuits, field programmable gate arrays or combinations of these (not shown) adapted to execute instructions. Host computer 510 further comprises software 511, which is stored in or accessible by host computer 510 and executable by processing circuitry 518. Software 511 includes host application 512. Host application 512 may be operable to provide a service to a remote user, such as UE 530 connecting via OTT connection 550 terminating at UE 530 and host computer 510. The UE 530 corresponds to the user equipment 160 of FIG. 1. In providing the service to the remote user, host application 512 may provide user data which is transmitted using OTT connection 550.

[0108] Communication system 500 further includes radio access network node 520 provided in a telecommunication system and comprising hardware 525 enabling it to communicate with host computer 510 and with UE 530. The radio access network node 520 corresponds to the network node 200 of FIG. 1. Hardware 525 may include communication interface 526 for setting up and maintaining a wired or wireless connection with an interface of a different communication device of communication system 500, as well as radio interface 527 for setting up and maintaining at least wireless connection 570 with UE 530 located in a coverage area (not shown in FIG. 11) served by radio access network node 520. Communication interface 526 may be configured to facilitate connection 560 to host computer 510. Connection 560 may be direct or it may pass through a core network (not shown in FIG. 11) of the telecommunication system and/or through one or more intermediate networks outside the telecommunication system. In the embodiment shown, hardware 525 of radio access network node 520 further includes processing circuitry 528, which may comprise one or more programmable processors, application-specific integrated circuits, field programmable gate arrays or combinations of these (not shown) adapted to execute instructions. Radio access network node 520 further has software 521 stored internally or accessible via an external connection.

[0109] Communication system 500 further includes UE 530 already referred to. Its hardware 535 may include radio interface 537 configured to set up and maintain wireless connection 570 with a radio access network node serving a coverage area in which UE 530 is currently located. Hardware 535 of UE 530 further includes processing circuitry 538, which may comprise one or more programmable processors, application-specific integrated circuits, field programmable gate arrays or combinations of these (not shown) adapted to execute instructions. UE 530 further comprises software 531, which is stored in or accessible by UE 530 and executable by processing circuitry 538. Software 531 includes client application 532. Client application 532 may be operable to provide a service to a human or non-human user via UE 530, with the support of host computer 510. In host computer 510, an executing host application 512 may communicate with the executing client application 532 via OTT connection 550 terminating at UE 530 and host computer 510. In providing the service to the user, client application 532 may receive request data from host application 512 and provide user data in response to the request data. OTT connection 550 may transfer both the request data and the user data. Client application 532 may interact with the user to generate the user data that it provides.

[0110] It is noted that host computer 510, radio access network node 520 and UE 530 illustrated in FIG. 11 may be similar or identical to host computer 430, one of network nodes 412a, 412b, 412c and one of UEs 491, 492 of FIG. 10, respectively. This is to say, the inner workings of these entities may be as shown in FIG. 11 and independently, the surrounding network topology may be that of FIG. 10.

[0111] In FIG. 11, OTT connection 550 has been drawn abstractly to illustrate the communication between host computer 510 and UE 530 via network node 520, without explicit reference to any intermediary devices and the precise routing of messages via these devices. Network infrastructure may determine the routing, which it may be configured to hide from UE 530 or from the service provider operating host computer 510, or both. While OTT connection 550 is active, the network infrastructure may further take decisions by which it dynamically changes the routing (e.g., on the basis of load balancing consideration or reconfiguration of the network).

[0112] Wireless connection 570 between UE 530 and radio access network node 520 is in accordance with the teachings of the embodiments described throughout this disclosure. One or more of the various embodiments improve the performance of OTT services provided to UE 530 using OTT connection 550, in which wireless connection 570 forms the last segment. More precisely, the teachings of these embodiments may reduce interference, due to improved classification ability of airborne UEs which can generate significant interference.

[0113] A measurement procedure may be provided for the purpose of monitoring data rate, latency and other factors on which the one or more embodiments improve. There may further be an optional network functionality for reconfiguring OTT connection 550 between host computer 510 and UE 530, in response to variations in the measurement results. The measurement procedure and/or the network functionality for reconfiguring OTT connection 550 may be implemented in software 511 and hardware 515 of host computer 510 or in software 531 and hardware 535 of UE 530, or both. In embodiments, sensors (not shown) may be deployed in or in association with communication devices through which OTT connection 550 passes; the sensors may participate in the measurement procedure by supplying values of the monitored quantities exemplified above, or supplying values of other physical quantities from which software 511, 531 may compute or estimate the monitored quantities. The reconfiguring of OTT connection 550 may include message format, retransmission settings, preferred routing etc.; the reconfiguring need not affect network node 520, and it may be unknown or imperceptible to radio access network node 520. Such procedures and functionalities may be known and practiced in the art. In certain embodiments, measurements may involve proprietary UE signalling facilitating host computer's 510 measurements of throughput, propagation times, latency and the like. The measurements may be implemented in that software 511 and 531 causes messages to be transmitted, in particular empty or dummy messages, using OTT connection 550 while it monitors propagation times, errors etc.

[0114] The inventive concept has mainly been described above with reference to a few embodiments. However, as is readily appreciated by a person skilled in the art, other embodiments than the ones disclosed above are equally possible within the scope of the inventive concept, as defined by the appended patent claims.