The invention relates to a testing device, with a fading simulator especially incorporating antenna and circuit parameters, and a method for testing a device under test with respect to wireless communication, especially with respect to fading.
Generally, in times of an increasing number of wireless communication applications employing MIMO (Multiple Input Multiple Output) systems such as LTE (Long Term Evolution), there is a growing need of a testing device and a testing method for testing devices under test applying such systems.
U.S. Pat. No. 7,480,328 B2 discloses a signal generator for generating a digitally modulated radio-frequency signal, the signal generator having a fading unit but only a single RF (radio frequency) output. As this signal generator has just one RF output it is therefore not suitable as a testing device for testing devices under test having multiple inputs, or multiple outputs respectively. Furthermore, due to the single RF output, testing a device under test with respect to fading based on multiple signal paths between transmitter and receiver is also not possible. However, investigating the phenomenon of fading typically occurring at wireless communications is very important because of its great impact on signal quality.
Accordingly, there is a need to provide a testing device and testing method for testing devices under test having multiple inputs, respectively multiple outputs, and for investigating the phenomenon of fading.
According to a first aspect of the invention, a testing device for testing a device under test is provided. The testing device comprises a signal generating unit and a fading simulation unit. The signal generating unit is configured to generate a first number of signals according to a number of transmitting means Ntx for a simulated transmission to a device under test. The fading simulation unit is configured to output a second number of faded signals to the device under test. The second number of faded signals corresponds to a number of receiving means Nrx of the device under test. Furthermore, the fading simulation unit simulates the transmission channels between said transmitting means and said receiving means with the aid of an extended channel correlation matrix R{tilde over (H)}
According to a first preferred implementation form of the first aspect, the receive antenna characteristics and/or the transmit antenna characteristics are expressed by S-parameters or T-parameters or Y-parameters or Z-parameters or H-parameters or ABCD-parameters or M-parameters or X-parameters or equivalent network parameters.
According to a further preferred implementation form of the first aspect, the extended channel correlation matrix R{tilde over (H)}
According to a further preferred implementation of the first aspect, the extended channel correlation matrix R{tilde over (H)}
According to a further preferred implementation form of the first aspect, the first parameters and the second parameters are S-parameters or T-parameters or Y-parameters or Z-parameters or H-parameters or ABCD-parameters or M-parameters or X-parameters or equivalent network parameters.
According to a further preferred implementation form of the first aspect, the extended channel correlation matrix R{tilde over (H)}
wherein c is a normalization constant with c∈ or c∈,
M is a matrix with M∈(Ntx*Nrx)×(Ntx*Nrx), and MH denotes the Hermitian transpose of M.
According to a further preferred implementation form of the first aspect, the extended channel correlation matrix R{tilde over (H)}
wherein a is a scaling factor with a∈, and
INtx*Nrx is a (Ntx*Nrx)×(Ntx*Nrx) identity matrix,
M is a matrix with M∈(Ntx*Nrx)×(Ntx*Nrx), and
MH denotes the Hermitian transpose of M.
According to a further preferred implementation form of the first aspect, the transmitting means are considered as a Ntx-port network. The receiving means are considered as a Nrx-port network. Furthermore, the matrix M has the structure
M=(((INtx−ΓB,T*SB,A)−1*TB,T)T(TUE,R*(INrx−SUE,A*ΓUE,R)−1)),
wherein INtx is a Ntx×Ntx identity matrix,
INrx is a Nrx×Nrx identity matrix,
SB,A is the S-parameter matrix of the Ntx-port network,
SUE,A is the S-parameter matrix of the Nrx-port network,
ΓB,T is a diagonal matrix ΓB,T=diag{[ΓB,T(1), . . . , ΓB,T(Ntx)]}∈Ntx×Ntx comprising the reflection coefficients ΓB,T(1) . . . , ΓB,T(Ntx) of each transmitter path,
ΓUE,R is diagonal matrix ΓUE,R=diag{[ΓUE,R(1), . . . , ΓUE,R(Nrx)]}∈Nrx×Nrx comprising the reflection coefficients ΓB,T(1), . . . , ΓB,T(Ntx) of each receiver path,
TB,T is a diagonal matrix TB,T=diag{[TB,T(1), . . . ,TB,T(Ntx)]}∈Ntx×Ntx comprising the transmission coefficients TB,T(1), . . . , TB,T(Ntx) of each transmitter path, and
TUE,R is diagonal matrix TUE,R=diag{[TUE,R(1), . . . , TUE,R(Nrx)]}∈Nrx×Nrx comprising the transmission coefficients TUE,R(1), . . . , TUE,R)(Nrx) of each receiver path.
The operator ( )−1 inverts a matrix, the operator ( )T transposes a matrix, and the operator denotes the Kronecker product of matrices.
According to a second aspect of the invention, a testing method for testing a device under test is provided. The method comprises generating a first number of signals according to a number of transmitting means Ntx for a simulated transmission to a device under test and simulating the transmission channels between said transmitting means and a number of receiving means Nrx of the device under test with the aid of an extended channel correlation matrix R{tilde over (H)}
According to a first preferred implementation form of the second aspect, the receive antenna characteristics and/or the transmit antenna characteristics are expressed by S-parameters or T-parameters or Y-parameters or Z-parameters or H-parameters or ABCD-parameters or M-parameters or X-parameters or equivalent network parameters.
According to a further preferred implementation of the second aspect, the extended channel correlation matrix R{tilde over (H)}
According to a further preferred implementation of the second aspect, the extended channel correlation matrix R{tilde over (H)}
According to a further preferred implementation of the second aspect, the first parameters and the second parameters are S-parameters or T-parameters or Y-parameters or Z-parameters or H-parameters or ABCD-parameters or M-parameters or X-parameters or equivalent network parameters.
According to a further preferred implementation of the second aspect, the extended channel correlation matrix R{tilde over (H)}
wherein c is a normalization constant with c∈ or c∈,
M is a matrix with M∈(Ntx*Nrx)×(Ntx*Nrx), and
MH denotes the Hermitian transpose of M.
According to a further preferred implementation of the second aspect, the extended channel correlation matrix is normalized and numerically stabilized to avoid non-solvable equations, the extended channel correlation matrix R{tilde over (H)}
wherein a is a scaling factor with a∈, and
INtx*Nrx is a (Ntx*Nrx)×(Ntx*Nrx) identity matrix,
M is a matrix with M∈(Ntx*Nrx)×(Ntx*Nrx), and
MH denotes the Hermitian transpose of M.
According to a further preferred implementation of the second aspect, the transmitting means are considered as a Ntx-port network. The receiving means are considered as a Nrx-port network. Furthermore, the matrix M has the structure
M=(((INtx−ΓB,T*SB,A)−1*TB,T)T(TUE,R*(INrx−SUE,A*ΓUE,R)−1)),
wherein INtx is a Ntx×Ntx identity matrix,
INrx is a Nrx×Nrx identity matrix,
SB,A is the S-parameter matrix of the Ntx-port network,
SUE,A is the S-parameter matrix of the Nrx-port network,
ΓB,T is a diagonal matrix ΓB,T=diag{[ΓB,T(1), . . . , ΓB,T(Ntx)]}∈Ntx×Ntx comprising the reflection coefficients ΓB,T(1), . . . , ΓB,T(Ntx) of each transmitter path,
ΓUE,R is diagonal matrix ΓUE,R=diag{[ΓUE,R(1), . . . , ΓUE,R(Nrx)]}∈Nrx×Nrx comprising the reflection coefficients ΓUE,R(1), . . . , ΓUE,R(Nrx) of each receiver path,
TB,T is a diagonal matrix TB,T=diag{[TB,T(1), . . . , TB,T(Ntx)]}∈Ntx×Ntx comprising the transmission coefficients TB,T(1), . . . ,TB,T(Ntx) of each transmitter path, and
TUE,R is diagonal matrix TUE,R=diag{[TUE,R(1), . . . , TUE,R(Nrx)]}∈Nrx×Nrx comprising the transmission coefficients TUE,R(1), . . . , TUE,R(Nrx) of each receiver path.
The operator ( )−1 inverts a matrix, the operator ( )T transposes a matrix, and the operator denotes the Kronecker product of matrices.
According to a third aspect of the invention, a computer program with program code means for performing all steps according to the second aspect, if the program is executed on a computer device or digital signal processor, is provided.
Exemplary embodiments of the invention are now further explained with respect to the drawings by way of example only, and not for limitation. In the drawings:
In advance, before exemplary embodiments of the invention are explained with respect to the drawings by way of example, it should be mentioned that, even though the following explanations focus on data transmission from a base station (BS) to user equipment (UE), in other words, the following refers to the downlink channel, the present invention can however analogously be adapted to the uplink channel.
In addition to this, the following definitions apply:
Operators ( )*, ( )T and ( )H denote the conjugate complex, the transpose and the Hermitian transpose of a matrix (or vector) respectively.
Furthermore, let A∈M×N
then the vectorization operator vec( ) is defined such that vec(A)=(A[1,1], . . . , A[M, 1], A[1,2], . . . , A[M, 2], . . . , A[1, N], . . . , A[M, N])T i.e. vec(A) produces a column vector in (M*N)×1 with the columns of A stacked on top of each other.
Additionally, the unvec( ) operator is defined inversely such that
A=unvec(vec(A)).
Moreover, let B∈M×N
then the element wise matrix product · is defined such that
Further, let C∈N×N be Hermitian and positive definite.
Then, the matrix square root operator ( )1/2 is defined implicitly as
(C1/2)N*C1/2=C.
C1/2 can be determined through cholesky decomposition of C.
Furthermore, let A(t)∈M×N and B(t)∈M×N where t is the continuous time then the convolution operator {circle around (*)} is defined through
Furthermore, in case of a discrete time system, the continuous time t must be replaced by n*T, wherein T is the sampling interval and n is an integer sample index. Writing n instead of n*T for the sake of brevity, the convolution operator {circle around (8)} is then defined through
wherein it has been assumed without loss of generality that B[i,j](v) =0 for v<0 and v>V−1.
Now, let A∈M×N and B∈P×R, then the Kronecker product is defined through
Thus, the result of is a (M*P)×(N*R) matrix.
Moreover, as a final introductory definition, the general concept of voltage and current waves should be presented at this point:
Considering an arbitrary N-port microwave network the total voltage and current wave amplitudes at the n-th port are given as
V
n
=V
n
+
+V
n
−
and
l
n
=l
n
+
+l
n
−,
wherein (Vn+, ln+) denote the incident and (Vn−, ln−) denote the reflected wave amplitudes.
The voltage waves can be generalized to account for the case that different ports have different characteristic impedances, i.e.
wherein an reperesents an incident wave at the nth port, bn represents a reflected wave from that port and Z0n is the characteristic impedance of that port.
The relationship between incident and reflected waves can be expressed through the S-parameter matrix
b=S*a
wherein b=[b1, . . . , bN]T∈N×1, a=[a1, . . . , aN]T∈N×1 and S∈N×N.
Note that b, a and S are considered to be expressed in frequency domain and thereby are functions of frequency (b(f),a(f),S(f)). For the sake of brevity, the frequency symbol will be dropped in the following description.
It should be mentioned that in order to implement the channel models described in the following, it is required to evaluate the wave amplitudes and S-parameters at an appropriate frequency, e.g. the carrier frequency.
Furthermore, it is assumed that each port supports one propagating mode. If a physical port supports more than one propagating mode, additional electrical ports can be added to account for these modes.
Now, with respect to
In general, the transmission from BS 11 to UE 12 over a mobile radio channel can be modeled as
y(t)=Σl=1L(Hl(t){circle around (*)}D1(t))*x(t−τl)+n(t),
wherein t is the time, L is the number of fading paths,
y(t)∈Nrx×1 is the vector of received symbols, x(t)∈Ntx×1 is the vector of transmitted symbols, or ξl is the delay of fading path l, Hl(t)∈Nrx×Ntx is the random channel matrix of fading path l where each entry is zero mean Gaussian, each element of Dl(t)∈Nrx×Ntx corresponds to the impulse response of a filter which determines the time evolution and Doppler spectrum of the fading process and n(t)∈Nrx×1 is the random vector of noise samples where the entries are i.i.d. (independent and identical distributed) zero mean Gaussian.
Equivalently we have for a discrete time system:
y(n)=Σl=1L(Hl(n){circle around (*)}Dl(n))*x(n−τl)+n(n),
wherein n is an integer sample index. The relationship between the continuous time t and the sample index n is given through the equation t=n*T where T denotes the sampling period.
The channel correlation matrix is defined as
R
H
=E{vec(Hl(t))*vec(Hl(t))H}=E{vec(Hl(n))*vec(Hl(n))H},
wherein E{ } denotes the expectation operator. In the following subsections we derive the relationship between Hl(t) and {tilde over (H)}l(t) equivalently Hl(n) and {tilde over (H)}l(n)) and hence between RH
As already mentioned above, the present explanations focus on the downlink channel HDL. However, the derivations can be performed analogously for the uplink channel HUL.
Furthermore, these derivations are based on the circuit model shown in
According to
a
B,T
=[a
B,T[1], . . . , aB,T[Ntx]]T∈Ntx×1,
b
B,T
=[b
B,T[1], . . . , bB,T[Ntx]]T∈Ntx×1,
a
B,A
=[a
B,A[1], . . . , aB,A[Ntx]]T∈Ntx×1,
b
B,A
=[b
B,A[1], . . . , bB,A[Ntx]]T∈Ntx×1,
a
UE,A
=[a
UE,A[1], . . . , aUE,A[Nrx]]T∈Ntx×1,
a
UE,A
=[a
UE,A[1], . . . , aUE,A[Nrx]]T∈Nrx×1,
b
UE,A
=[b
UE,A[1], . . . , bUE,A[Nrx]]T∈Nrx×1,
a
UE,R
=[a
UE,R[1], . . . , aUE,R[Nrx]]T∈Nrx×1 , and
b
UE,R
=[b
UE,R[1], . . . , bUE,R[Nrx]]T∈Nrx×1.
Furthermore, the following equations apply for the transmitter side with i∈ and 1≦i≦Ntx:
The definition of the S-parameter matrix SB,T_hu (i)∈2×2 of transmitter path i (at BS 11)
leads to
Moreover, the definition of the channel—including transmitting and receiving antennas—S-parameter matrix
wherein SBA∈Ntx×Ntx is the S-parameter matrix of the antenna array at the BS (the antenna array 1 is considered as a Ntx-port network), SC,UL∈Ntx×Nrx is the S-parameter matrix of the pure uplink channel, SC,DL∈Nrx×Ntx is the S-parameter matrix of the pure downlink channel, and SUE,A∈Nrx×Nrx is the S-parameter matrix of the antenna array at the UE 12 (the antenna array 2 is considered as a Nrx-port network),
leads to
Additionally, for the receiver side, the following equations apply:
The definition of the S-parameter matrix SUE,R(i)∈2×2 of receiver path i (at UE 12) with 1≦i≦Nrx
leads to
With the aid of these simplifications, the following applies:
Furthermore, the definition of the transmission coefficient of the transmitter path i
T
B,T
(i)[2,1], and
the definition of the reflection coefficient of the transmitter path i
ΓB,T(i)=SB,T(i)[2,2]
lead to
a
B,A
[i]=T
B,T
(i)
*a
B,T
[i]+Γ
B,T
(i)
*b
B,A
[i].
Analogously, the definition of the transmission coefficient of the receiver path i
T
UE,R
(i)
=S
UE,R
(i)[2,1], and
the definition of the reflection coefficient of the receiver path i
ΓUE,R(i)SUE,R(i)[1,1]
lead to
a
UE,A
[i]=ΓUE,R(i)*bUE,A[i], and
b
UE,R
[i]=T
UE,R
(i)
*b
UE,A
[i].
Moreover, the definition of the matrices
T
B,T=diag{[TB,T(1), . . . , TB,T(Ntx)]}∈Ntx×Ntx
ΓB,T=diag{[ΓB,T(1), . . . , ΓB,T(Ntx)]}∈Ntx×Ntx,
T
UE,R=diag{[TUE,R(1), . . . , TUE,R(Nrx)]}∈Nrx×Nrx, and
ΓUE,Rdiag{[ΓUE,R(1), . . . , ΓUE,R(Nrx)]}∈Nrx×Nrx
leads to the following set of equations:
b
B,A
=S
B,A
*a
B,A
*S
C,UL
*a
UE,A (1),
b
UE,A
=S
C,DL
*a
B,A
+S
UE,A
*a
UE,A (2),
a
UE,A=ΓUE,R*bUE,A (3),
a
B,A
=T
B,T
*a
B,T
+Γ
B,T
*b
B,A (4),
b
UE,R
=T
UE,R
* b
UE,A (5)
In the following, these five equations will be used for deriving the extended channel correlation matrix R{tilde over (H)}
Plugging equation 3 into equation 1 leads to
wherein INrx is the Nrx×Nrx identity matrix.
Further combining equations 4 and 1 and assuming that SC,UL*aUE,A=0 leads to
wherein INtx is the Ntx×Ntx identity matrix. Now, plugging equation 7 into equation 6 and equation 6 into equation 5 finally results in
b
UE,R
=T
UE,R*(lNrx−SUE,A*ΓUE,R)−1*SC,DL* *(INtx−ΓB,T*SB,A)−1*TB,T*aB,T (8)
With the aid of the definition
S
{tilde over (C)}DL
=T
UE,R*(INrx−SUE,A*ΓUE,R)−1*SC,DL*(INtx−ΓB,T*SB,A)−1*TB,T,
equation 8 can be written as
b
UE,R
=S
{tilde over (C)},DL
*a
B,T
wherein S{tilde over (C)},DL can be regarded as extended downlink channel that also includes the effects of the transmitter and receiver circuitry as well as the antenna elements. The following applies:
S{tilde over (C)},DL={tilde over (H)}DL.
In addition to this, for the sake of completeness, it should be mentioned that SC,DL, can be seen as downlink channel relating the field components at the base station and the UE antenna elements. The following applies:
SC,DL=HDL.
Thus, it can be written:
{tilde over (H)}
DL
=T
UE,R*(INrx−SUE,A*ΓUE,R)−1*HDL*(INtx−ΓB,T*SB,A)−1*TB,T (9)
Furthermore, with using the matrix algebra relationship
U=VXW
(WTV)*vec(X)=vec(U),
and with factoring equation 9 into
it follows that
(((INtx−ΓB,T*SB,A)−1*TB,T)T(TUE,R*(INrx*SUE,A*ΓUE,R)−1))* vec(HDL)=vec({tilde over (H)}DL).
Thus, the correlation matrix of the extended channels can be expressed as:
Moreover, by identifying the correlation matrix of the downlink channels
R
H
=E{vec(HDL)*vec(HDL)H},
and by defining
M=(((INtx−ΓB,T*SB,A)−1*TB,T)T(TUE,R*(INrx−SUE,A*ΓUE,R)−1))
The correlation matrix of the extended downlink channels R{tilde over (H)}
R
{tilde over (H)}
=M*R
H
*M
H. (11)
Now, some different forms of RH
Firstly, according to the Kronecker channel model, RH
RH
wherein RBS∈Ntx×Ntx is the spatial correlation matrix of the field components at the transmitter side, and RUE∈Nrx×Nrx is the spatial correlation matrix of the field components at the receiver side for the respective fading path.
In the second place, due to antenna polarization, another form of RH
R
H
=X·R
S,
wherein X∈(Ntx*Nrx)×(Ntx*Nrx) is a polarization correlation matrix, RS∈(Ntx*Nrx)×(Ntx*Nrx) is the channel spatial correlation matrix (e.g. RS=RBSRUE in case of the Kronecker model) for the respective fading path and · denotes the element wise matrix product.
In addition to this, another method of including polarization correlation into the classical Kronecker model is possible, if a number of pairs of collocated antennas at the transmitter and the receiver is assumed. In this case, the following applies:
R
H
=P*(RBSXRUE)*PT,
wherein X∈4×4 is a polarization correlation matrix, RBS∈Ntx/2×Ntx/2 is the spatial correlation matrix of the field components at the transmitter side for the respective fading path, RUE∈Nrx/2×Nrx/2 is the spatial correlation matrix of the field components at the receiver side for the respective fading path and P is a (Ntx*Nrx)×(Ntx*Nrx) permutation matrix, wherein each element is either 1 or 0 while each row and each column contains exactly one 1 while the other elements of the respective row or column are 0. The permutation matrix is used in order to map the correlation coefficients in accordance with a specific antenna labelling system.
In the third place, in order to introduce the Spatial
Channel Model (SCM/E), RH
Now, In case of the Spatial Channel Model, the following applies:
E(HDL[u,s]*HDL[v, t]*)=σSFΣEm=1MPm*GBS(θm,AoD)*GUE(θm,AoA)*exp (j*k* [(du−dv)*sin(θm,AoA)+(ds−dt)*sin(θm,AoD)]),
wherein u,v∈{1, . . . , Nrx} and s,t∈{1, . . . , Ntx} are indices of the receive and transmit antennas respectively, σSF is the lognormal shadow fading, M is the number of subpaths per path, Pm is the power of subpath m, GBS(θm,AoD) is the BS antenna gain of each array element, GUE(θm,AoA) is the UE antenna gain of each array element, j=√{square root over (−1)}, k is the wavenumber 2π/λ where λ is the carrier wavelength in meters, du and dv are the distance in meters from UE antenna element u from the reference (u=1) antenna and the distance in meters from UE antenna element v from the reference (v=1) antenna respectively, ds and dt are the distance in meters from BS antenna element s from the reference (s=1) antenna and the distance in meters from UE antenna element t from the reference (t=1) antenna respectively, θm,AoA is the angle of arrival (AoA) for the subpath m and θm,AoD is the angle of departure (AoD) for the subpath m.
Now, some numerical optimizations regarding RH
In the first place, in order to achieve a specific channel power, RH
wherein c∈.
Secondly, depending on the computational precision, it may occur that the extended channel correlation matrix R{tilde over (H)}
R
{tilde over (H)}
=[M*R
H
*M
H
+a*I
Ntx*Nrx]/(1+a),
(13) wherein INtx*Nrx is the (Ntx*Nrx)×(Ntx*Nrx) identity matrix.
It would be reasonable to choose a as the smallest possible value that leads to positive semi-definite extended channel correlation matrix R{tilde over (H)}
In the third place, normalization and numeric stabilization may be applied in combination: if the normalized extended channel correlation matrix R{tilde over (H)}
Now, it should be noted that HDL, in other words the above-mentioned downlink channel relating the field components at the base station and the UE antenna elements, may be also computed without incorporating antenna scattering parameters or receiver and transmitter circuitry in the following manner:
vec(HDL)=(RH
leading to
H
DL=unvec(vec(HDL))=unvec(RH
wherein G is a Nrx×Ntx random matrix with zero mean i.i.d.
(independent identically distributed) complex Gaussian entries.
In addition to this, if the effect of the antenna scattering parameters, receiver and transmitter circuitry shall be included, channel realizations in form of {tilde over (H)}DL, which denotes the above-mentioned extended downlink channel that also includes the effects of the transmitter and receiver circuitry as well as the antenna elements, may be computed as
vec(RDL)=(R{tilde over (H)}
which leads to
{tilde over (H)}
DL=unvec(vec({tilde over (H)}DL))=unvec(R{tilde over (H)}
With respect to equations 14 and 15, it should be additionally mentioned that the channel matrices given in these equations correspond to one fading path. In case of frequency selective fading, several fading paths need to be considered. Thus, for each path, a channel matrix as given above needs to be determined.
Now, referring to
As a consequence of this example, there are two cases to be distinguished: in the first exemplary case, as illustrated by
Furthermore, due to the fact that the whole DUT circuitry part seen from the feeding points towards the antennas 2 of the DUT 6 is not part of the measurement, this part needs to be emulated by the TD 3.
Thus, for the first exemplary case (feeding points on reference plane A), the DUT circuitry is partitioned according to
Furthermore, for the receiver side, the coefficients ΓUE,R(i) are set to be the reflection coefficients seen from the feeding points on reference plane A looking to the right and TUE,R(i)=1.
Analogously, for the second exemplary case (feeding points on reference plane B), the DUT circuitry is partitioned according to
For the sake of clarity and comprehensibility, the above-mentioned different reasonable choices for the parameters) TB,T(i), ΓB,T(i), TUE,R(i) and ΓUE,R(i) depending on the test purpose should be summarized at this point:
Firstly, arbitrary independent values may be chosen. Thus, for the transmitter side, the following applies: For 1≦i≦Ntx choose arbitrary values TB,T(i)∈ and ΓB,T(i)∈.
For the receiver side, it applies analogously:
For 1≦i≦Nrx choose arbitrary values TUE,R(i)∈ and θUE,R(i)∈.
In the second place, S-parameters may be chosen. Therefore, the following applies for the transmitter side:
For 1≦i≦Ntx set TB,T(i)=SB,T(i)[2,1] and ΓB,T(i)=SB,T(i)[2,2].
For the receiver side, it applies:
For 1≦i≦Nrx set TUE,R(i)=SUE,R(i)[2,1] and ΓUE,R(i)=SUE,R(i)[1,1].
Thirdly, reflection and transmission coefficients may be chosen by applying any combination of the variants given above. For instance, and not for limitation, setting TB,T(i)=1 and ΓB,T(i)=0 for 1≦i≦Ntx, and TUE,R(i)=SUE,R(i)[2,1] and ΓUE,R(i)=SUE,R(i)[1,1] for 1≦i≦Nrx.
In addition to this, while the reflection and transmission coefficients of the transmitter side are chosen by applying any combination of the variants given above, the reflection and transmission coefficients of the receiver side may be computed based on impedances as follows:
With respect to
Z
in
(i)=(ZA(i))*,
wherein Zin
Then, the input reflection coefficient ΓUE,R(i) is given as
wherein Z0 is the characteristic impedance.
It is to be mentioned that knowledge of the input impedance Zin
|ΓUE,R(i)|2+|TUE,R(i)|2≦1,
which leads to
|TUE,R(i)|2≦1−|ΓUE,R(i)|2
while the equality holds in case of a lossless receiver path.
As an approximation, it can be set:
T
UE,R
(i)√{square root over (1−|ΓUE,R(i)|2)}.
Furthermore, it may be argued that SUE,R(i) is part of the DUT 6 and therefore already part of the measurement. Thus, the following can be set:
T
UE,R
(i) =1.
Now, with respect to
Firstly, with respect to low spatial correlation, the following is exemplarily set:
In addition to this, conjugate match at receiver side (UE) and no antenna coupling at transmitter side (BS) are assumed.
Referring to
Furthermore, with respect to
In the second place, with respect to high spatial correlation, the following is exemplarily set:
Likewise to the exemplary low spatial correlation simulations given above, conjugate match at receiver side (UE) and no antenna coupling at transmitter side (BS) are assumed.
With respect to
Moreover, referring to
Finally,
While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example only, and not limitation. Numerous changes to the disclosed embodiments can be made in accordance with the disclosure herein without departing from the spirit or scope of the invention. Thus, the breadth and scope of the present invention should not be limited by any of the above described embodiments. Rather, the scope of the invention should be defined in accordance with the following claims and their equivalents.
Although the invention has been illustrated and described with respect to one or more implementations, equivalent alterations and modifications will occur to others skilled in the art upon the reading and understanding of this specification and the annexed drawings. In addition, while a particular feature of the invention may have been disclosed with respect to only one of several implementations, such feature may be combined with one or more other features of the other implementations as may be desired and advantageous for any given or particular application.