3.2. Estimation of Power Fading Factor and Doppler Shift for Fast Fading Channels using Tensor-Train Decomposition
The received signal at the single-user of a millimeter-wave MIMO in UAV can be expressed as the following equation:
Set the conversion again as follows:
is a constant, namely
.
Where
and
represent the receive vector and the send vector respectively. Equation (28) is expressed as the following equation:
The received signal tensor for
T consecutive time slots as a rank one vector accumulation pattern is expressed as the following equation:
Where
is the weight of the multiplication of the rank one factors,
is the received signal tensor,
is the vector containing the fast fading coefficients from
T consecutive time slots, and
is the noise tensor. Meanwhile, equations (32) can continue to be expressed as a Tensor-train decomposition of the
form:
The FCTPM based on tensor decomposition is utilized the PM (Power Method) for the auxiliary unfolding matrix decomposition. FCTPM is based on a combination of Tensor-train decomposition and power. The FCTPM approximates the most dominant rank-negative-one tensor of the input tensor by the Tensor-train decomposition, and each unfolding matrix is also decomposed using a rank-negative-one matrix decomposition. This property allows each unfolding matrix to ignore the concatenation between other unfolding matrices. Therefore, a cyclic update method is proposed to consider the connectivity between the unfolding matrices. After all the left singular vectors have been computed, the order of the update steps for the right singular vectors needs to be changed. The FCTPM utilizes the PM for the auxiliary unfolding matrix decomposition. Therefore, the PM ensures the convergence of the decomposition factors. The cyclic updating method enhances the connectivity between the decomposition factors.
The FCTPM then consists of two main components, namely the rank-negative-one tensor approximated by the Tensor-train decomposition of the auxiliary expansion matrix, and the PM of determining the left and right singular vectors obtained from the randomly initialized vectors. The core tensor in the Tensor-train decomposition
calculation is based on the
N-dimensional input tensor
the low-rank approximation of the auxiliary matrix of
denotes the received signal tensor
the Tensor-train rank in Tensor-train decomposition. In FCTPM, a rank-negative-one approximation is made to the high-dimensional input tensor using the Tensor-train decomposition. The received signal at theuser is compressed into a low-order core tensor
, and
, and
of the concatenation. The received signal tensor
is written in the following form:
Where denotes the core tensor of size of the core tensor of the rank-negative-one Tensor-train with all elements of the Tensor-train rank being 1, then size become the core tensor of the rank-negative-one Tensor-train. Furthermore, if the core tensor of dimensionality is compressed, the core tensor can be regarded as factored vector data that is the rank-negative-one Tensor-train core tensor of the first-order factor vector.
To solve for the factor vector
, equation (32) is expressed as the following equation (38):
Where is the principal singular value of the approximate rank-negative-one tensor. According to the FCTPM, the higher order tensor is decomposed in the Tensor-train decomposition by a low-rank decomposition of the auxiliary expansion matrix of the input tensor.
The solution to the factor vector
can be solved in a uniform manner by expressing:
Where
is the principal singular value after reshaping the matrix. The principal singular value of the rank-negative-one tensor can be calculated as
that is the corresponding factor vector.
and
is the corresponding factor vector, from which the factor vector can then be composed to derive the corresponding factor matrix. The solution process is repeated until the right singular vector in the decomposition process
is the last factor vector
. Therefore, the first factor vector
can be expressed as follows:
Where
is the modulo 1 expansion matrix,
is the
the principal singular values of
represents the first factor vector of the rank-negative-one Tensor-train decomposition, and
is the right singular vector of
. After obtaining
,
is expressed as the modulo 2 expansion matrix form of the received signal tensor
. The second factor vector
is calculated as:
the rank-negative-one matrix decomposition is expressed as the following equation:
Where
is the principal singular value of the tensor
modulo 2 matrix
, and
represents the second factor vector of the rank-negative-one Tensor-train decomposition. Similarly, the third factor vector can be obtained. This computation can be performed repeatedly until the right singularity vector of the decomposition process is the last factor vector. To ensure convergence of the factorization, a matrix factorization method PM is incorporated. In solving the first factor matrix, the PM method initializes the factor vector
to a random unit vector satisfying
. After that, the vector matrix operation is performed iteratively until the factor vectors satisfy the pre-set specific termination conditions, as shown below:
Where
and
are
the left and right singular vectors, respectively. The main singular values
associated with it can be expressed as
. The left singular vector calculation follows immediately after the right singular vector calculation. Assuming the existence of an orthogonal basis
and
, the unfolding matrix
satisfies the following equation:
Where
is
the singular values in corresponding to the singular vectors. After several iterations, the
and
can be defined as the following equation, respectively:
Where and are the corresponding normalisation factors. Thus, after several iterations of PM, and satisfy by the convergence property, the converges to the maximum singular value , at , .
From the previous rank-negative-one Tensor-train decomposition, the
nth factor vector
depends on the previously computed right singular vector
, while
is obtained from
n-1 factor vector
computed. Because the matrix decomposition of each factor vector is performed independently. These properties can lead to problems with local optimization, resulting in a loss of critical performance in FCTPM. To enhance the connectivity between the decomposition factors, a circular update method is proposed, which changes the order in which the left singular vectors are computed is sufficient. According to the decomposition method of Tensor-train of rank-negative-one and the nature of PM,
can be obtained from
and
which are reshaped to form
. The relationship
is updated by the following way:
The updated factor vector can be derived as .
Channel parameter is estimated for UAV with millimeter wave massive MIMO based on the FCTPM. The number of factor matrix time slots is associated with the structure of the transmission frame, using a downlink transmission frame structure. It consists of an AOA/AOD estimation phase (
time slot), a fast-fading factor estimation phase (
time slot) and the data transmission phase (
time slot). Using equation (32) and equation (33), the received signal at the terrestrial user is represented as the following equation:
Matrix
is the received signal at the user.
is corresponding to the matrix of three factors.
is the corresponding fast fading factor matrix. From the Tensor-train decomposition's
representation,
and
the correspondence can be expressed by the following equation:
The factor matrix
. From equation (35), we can find that the factor matrix
has the fast fading channel power fading factor associated with the Doppler shift in its elements. We can derive the fast fading channel power factor. We can obtain
,
. According to the correlation scheme, the Doppler shift on the
path is solved as follows:
Where
is the maximum Doppler shift,
is the carrier frequency,
is the speed of the drone, and
is the speed of light. The path gain is then estimated from the estimated Doppler shift, i.e:
Finally, all parameters of the time-varying channel of the millimeter-wave MIMO in UAV are estimated and the channel matrix can be recovered from (51).