Time division duplexing (TDD) is becoming popular due to its flexibility of supporting imbalanced uplink (UL) and downlink (DL) traffics and low overhead on channel state information (CSI) acquisition at base stations (BSs) when the number of antennas at the BS is large . Still, frequency division duplexing (FDD) is important in fifth generation (5G) and beyond cellular systems to support backward compatibility. The conventional way for the BS to obtain the DL CSI in FDD is based on DL training and UL limited feedback . The training and feedback overhead, however, increases with the number of antennas at the BS and would become excessive in massive multiple-input multiple-output (MIMO) systems [3, 4, 1, 5].
There have been many works to resolve the DL training and UL feedback issues in massive MIMO. For both issues, most of previous works relied on long term channel statistics to reduce the training and feedback overhead [6, 7, 8, 9, 10, 11, 12]. Although effective, these approaches are vulnerable to the lack of coherence time interval, which usually happens when mobile stations (MSs) travel with high speed. Recently, there has been a line of research to completely or partially get rid of the DL training and UL feedback overhead in FDD by DL extrapolation using the UL CSI [13, 14, 15, 16, 17].
The DL extrapolation exploits inherent UL and DL channel reciprocity that occurs even in FDD, e.g., dominant UL and DL path angles, since the UL and DL signals traverse the same environment. Although some UL and DL channel parameters experience the reciprocity in FDD, it is critical to define physical relation between the two channels in different frequencies for the DL extrapolation to work. It is very difficult, however, to show the relationship mathematically because the relationship is governed by the Maxwell’s equations with practical environments, e.g., buildings, trees, or vehicles, as boundary conditions, which makes the relationship highly nonlinear.
Deep learning using a neural network (NN) can figure out complex relation between two data sets. Recently, deep learning has been applied to many wireless communication problems including beamforming, limited feedback, and modulation [18, 19, 20, 21, 22]. When using the NN for the DL extrapolation, most of previous works exploited the full dimensional UL and DL channels as the input and output of the NN using simplified analytical relation of UL and DL channels [14, 15, 16]. It may be not possible, however, to analytically define the relation between the UL and DL channels in practice. Moreover, these works did not consider any MS mobility. Using the full UL and DL channels for the input and output of the NN might confuse the NN to find their complex relation when the MS moves with high speed.
To reduce the NN learning complexity, we propose to first extract angles of departure (AoDs), delays, and path gains, and exploit the path gains obtained from similar signal path angles in the UL and DL to train the NN. Although the path gains are still governed by the Maxwell’s equations, the information each path gain contains is much more compact than the channel itself, making the NN work even better.
After the training, the NN gives predicted DL path gains directly from the extracted UL path gains. With the partial information of channels already obtained from the UL CSI, i.e., the delays and AoDs that experience the reciprocity in FDD, the BS can reconstruct the DL channel using the DL path gains. After the UL and DL path gain extraction, the dimension of the input and output of the NN can become much smaller compared to the full UL and DL channels. The reduced input and output dimension enables to have smaller number of weights connecting the NN nodes as well as to simplify the weight updating process, which makes it possible to achieve the same or improved accuracy with reduced NN training time compared to using the full UL and DL channels.
The DL extrapolation techniques would be most beneficial when the MSs move with high speed. The conventional DL training-based approach in FDD, which requires the large training overhead, becomes infeasible when channels vary fast due to high mobility. The DL extrapolation techniques using the trained NNs have much smaller processing time for the BS to acquire the DL CSI than the DL training; therefore, the training overhead can be dramatically reduced to ensure sufficient time for data transmissions. The proposed DL extrapolation technique makes the NN simpler, even make it more suitable to the environments suffering from a short coherence time. The main contributions are summarized in below:
We train the network with the realistic channel samples generated by QuaDRiGa, a realistic channel emulator , which means the channel samples used for the numerical validation are not obtained from a pre-defined channel model. By using QuaDRiGa, we can evaluate our scheme with realistic data, which consider various physics, e.g., carrier frequency, mobility, and total bandwidth, and ensure the practicality of proposed method.
We propose the path gain extraction method to simplify the input and output of NN for the DL extrapolation. Just using the path gains for the learning instead of the full dimensional channels, the training can be more rapidly and precisely conducted.
By properly taking DL extrapolation processing time into account for the NN training, the proposed NN-based DL extrapolation performs well even when MSs move with high speed.
The organization of paper is as follows. In Section II, we introduce the process of generating channel samples using QuaDRiGa and the channel model we use for the proposed DL extrapolation technique. Conventional ways of obtaining the DL CSI through the DL training and NN-based DL extrapolation are presented in Section III. In Section IV, we explain channel parameter extraction algorithms for the proposed NN-based DL extrapolation, and detailed NN settings are described in Section V. Extensive numerical results are given in Section VI, and the conclusion follows in Section VII.
Lower and upper boldface letters denote column vectors and matrices., , and are used to represent the conjugate, transpose, inverse, and Hermitian (conjugate transpose) of the matrix . and denotes the -norm of the complex vector and Frobenius norm of the complex matrix. denotes the identity matrix. represents a set of for , and denotes a set of for . is the diagonal matrix where its diagonal entries are .
Ii System Model
We first describe the details of generating channel samples using QuaDRiGa for the NN in Section II-A. Then, to develop the proposed DL extrapolation technique, we define the channel model, which approximates the channel generated by QuaDRiGa, in Section II-B.
Ii-a Generating Channel Samples
We consider a scenario that the NN at the BS is trained with the UL and DL CSI from a given path where MSs travel and conduct the DL extrapolation for a new MS entering the same path. The DL extrapolation is possible as long as the UL and DL experience the channel reciprocity in FDD. Figs. 3-(a) and (b) are the snapshots of channels in different carrier frequencies, which are generated by Wireless InSite, a commercial ray-tracing simulator . As shown in the figures, the traces of UL signal, with 2.14 GHz carrier frequency, and DL signal, with 1.95 GHz carrier frequency, are almost identical even with the guard band between the two.
To exploit the NN for DL extrapolation, the BS should collect the CSI data from MSs moving on the same path. A typical scenario of an urban communication system is depicted in Fig. 2. Since urban roads restrict the course of MSs as shown in the figure, the tracks of MSs on a given path can be assured to be nearly identical. We exploit QuaDRiGa  to obtain samples of the UL and DL channels since it considers complicated physics including mobility for channel emulation. The channel samples obtained from QuaDRiGa does not have any idealistic feature, e.g., perfect directional reciprocity between the UL and DL channels. This is quite different from previous works where channel samples are obtained based on analytical channel models [15, 16, 18, 25, 19, 20, 21, 22, 26].
QuaDRiGa periodically generates channel snapshots for each MS moving on a given path. The MS sample set is a set of channel snapshots of one MS along the given path. The environment geometry on a given path, e.g., nearby buildings, is maintained for a long time. Therefore, the MSs on the same path would experience high spatial correlation. However, specific signal paths may vary temporarily due to large dynamic objects like moving trucks. Taking this situation into an account, for each MS sample set, we fix several clusters to reflect the static environments and randomly change a few clusters to reflect the dynamic objects. The UL and DL channels for each MS have the same clusters to maintain their geometrical reciprocity.
Remark 1: Even with the trained NN, it takes a time for the BS to conduct the DL extrapolation. When the BS estimates the UL CSI at , it needs to infer the DL CSI at where is the processing delay for the DL extrapolation. Thus, we generate UL and DL channels to keep their time interval .
Remark 2: To implement the DL extrapolation using the NN, the BS has to collect the UL and DL CSI as training data sets. In the conventional limited feedback for FDD, the BS can only access to quantized DL CSI. Still, we believe it is possible to train the NN with high resolution DL CSI once services providers obtain the required data sets offline since the NN training is not a real-time process. Although the exact timestamps of UL and DL CSI data may be different, the timing difference can be adjusted before the training process since the training is performed after stacking the data. After the services providers train the NN using collected UL and DL CSI, the BS only needs to operate the DL extrapolation function in real-time using the trained NN stored in its memory.
Ii-B Channel Model
The channel generated by QuaDRiGa can be approximated as
which consists of paths and subpaths per path where represents the number of clusters in our case. In (1), is the carrier frequency, is the path gain, is the delay, and is the AoD. We assume the path gains and AoDs are subpath dependent while all subpaths from the same cluster experience the same delay. The vector is the array response of the signal incident at , where is the number of BS antennas.
The channel due to the -th cluster is given as
The channel coefficient of the -th cluster consists of subpath components; . While the path gains are frequency dependent components, we assume the delays and AoDs are frequency independent components as in , i.e., the UL and DL channels experience the same delays and AoDs due to the same geometry.
The channel in (1
) can be transformed into the frequency domain. The-th subcarrier of the orthogonal frequency division multiplexing (OFDM) channel is obtained as 
where is the total bandwidth, and is the total number of subcarriers. We use the underline to denote variables in the frequency domain throughout the paper. By concatenating all subcarriers, we have the OFDM channel matrix . The OFDM channel matrix can be rewritten as
where . Each element of matches with the subcarrier of the OFDM channel.
Iii Review of DL CSI Acquisition
The conventional way of obtaining the DL CSI in FDD relies on the DL training and UL feedback, which cause large overhead especially for massive MIMO . In Section III-A, we first explain the conventional DL training, which works as a baseline of the DL extrapolation techniques. Then, we briefly explain the previous DL extrapolation using the NN based on the full UL and DL channels in Section III-B while we detail the proposed technique in Section IV.
Iii-a Conventional DL Training
In the DL training, the MS estimates the DL channel and feeds back the acquired information to the BS. First, the BS transmits the pilot symbol to the MS. The received signal at the MS in the time domain is written as
where is the -th pilot symbol with , generally, . The additive white Gaussian noise
has zero mean with variance. To estimate the DL CSI, the MS first stacks the received pilot signals as
where , , and . Using the transformation in (II-B), the received signal in the frequency domain is represented as
Using the least square (LS) estimator based on the known , the estimated DL CSI is given as
Repeating the above process for all subcarriers, the DL OFDM channel can be obtained.
The DL training needs to be performed for every coherence time interval, and the training overhead normally increases as the number of antennas at the BS increases. Considering the training overhead, the effective spectral efficiency is given as
is the signal-to-noise ratio (SNR). We assume the perfect UL feedback in (10) to check the upper bound of the DL training-based transmission. The coherence time interval decreases as the speed of the MS increases, so the conventional DL-training-based approach is not appropriate for high mobility scenarios in FDD.
Iii-B NN-Based DL Extrapolation
The purpose of using the NN is to estimate the DL CSI directly from the UL CSI measured at the BS without having any explicit downlink training. More precisely, the previous works in [15, 16] used the UL OFDM channel as an input and the DL OFDM channel as an output to train the NN, i.e.,
where denotes the function of NN-based DL extrapolation. We will denote this approach as “CH-learning” in the remaining of paper. Since the numbers of antennas at the BS and subcarriers in OFDM could be quite large, the CH-learning may suffer from heavy computational complexity.
Iv Proposed NN-Based DL Extrapolation
In (1), the channel of -th subpath from -th cluster consists of three parameters, i.e., the path gain , the delay , and the AoD . Taking the geometrical reciprocity into account, and estimated from the UL CSI would be identical to those of the DL channel. Therefore, instead of using the full OFDM channels, it would be possible to exploit only the path gains to train the NN for DL extrapolation. In Section IV-A, we first explain a general procedure of the proposed DL extrapolation, which includes the process of DL channel reconstruction and the concept of proposed NN. Since the BS exploits the UL CSI for the DL extrapolation, we elaborate the UL training in Section IV-B. Then, we describe the algorithms to extract necessary information from the UL CSI depending on the availability of time domain information. If the BS can directly access the time domain CSI, we propose “tPG-learning,” which is detailed in Section IV-C. If the BS only can access the frequency domain CSI, we introduce “fPG-learning,” which is covered in Section IV-D.
Iv-a General Procedure of Proposed DL Extrapolation
As explained in Remark 1, the DL extrapolation technique estimates the DL CSI at time using the UL CSI at time . To simplify the notation, we intentionally neglect the delay in the following discussions.
In our proposed NN-based DL extrapolation, the DL channel can be reconstructed as
where the delay and AoD are the extracted parameters from the UL CSI, which will be explained in Sections IV-C and IV-D. The DL path gain is the parameter predicted from the extracted UL path gain using the NN, i.e.,
We use the tilde to denote extracted parameters from the UL CSI and the check to represent predicted parameters using the NN throughout the paper. In (12), is the number of subpaths used for the channel reconstruction, , and in (13) is the number of subpaths used for the learning, . The effects of and are explained in Sections V-C and VI-A. Using (II-B), the reconstructed DL channel in the time domain in (12) can be converted to an OFDM channel.
Iv-B UL Training
The BS obtains the UL CSI through the UL training. When the MS transmits a pilot symbol to the BS, the received signal at the BS in the time domain is written as
The vector is an additive white Gaussian noise with zero mean and variance . After the transformation, the received signal at the -th subcarrier can be obtained as
where the pilot symbol at the -th subcarrier is . The power of the transmitted symbol is constrained to for all . The noise vector still maintains the same mean and variance as in the time domain case. For the known symbol , the BS estimates the UL channel using the LS estimator
where , , and .
If the BS can access the time domain CSI, it is possible to directly obtain the noise corrupted -th channel coefficient and delay by observing impulses on the signal. If the BS only can access the OFDM channel , however, the BS has to figure out and . We consider two cases: 1) tPG-learning: the case when the BS can directly access the time domain signals, and 2) fPG-learning: the case when the BS only can access the frequency domain signals, which are elaborated in the following subsections.
In the tPG-learning, since the BS already has the estimated delay and channel coefficient , the BS only has to extract the AoDs and path gains.
Algorithm 1 shows how to extract the AoDs and path gains for the tPG-learning. In the beginning of the algorithm, the estimated channel coefficient is set to be . The AoD of the first subpath can be extracted as
After finding the AoD of the first subpath , the path gain corresponding to can be obtained as
To find the parameters of other subpaths accurately, following a similar concept in , the effect of the dominant subpath could be cancelled by projecting to the nullspace of .
where is the projection matrix to the nullspace of , defined as
As replacing with and repeating the same process,the parameters of second subpath; and , can be found. All the parameters constituting can be inferred through iterations.
In the fPG-learning, since the time domain CSI is not available, the BS should first estimate the delays and channel coefficients before extracting the AoDs and path gains, as detailed in Algorithm 2. Similar to Algorithm 1, the delay can be obtained through the inner product maximization as in (24). After extracting , projecting the estimated UL OFDM channel to gives the channel coefficient in (25). Since all channel coefficients are composed of the AoDs and path gains , they should be in the form of . The channel coefficient obtained in (25), however, may not follow such from since is obtained from the noisy UL channel . Therefore, with the extracted AoDs and path gains in Step 3 of Algorithm 2, we approximate as
With the approximated , the nullspace projection, which is necessary for finding the other channel parameters, is conducted in (27). All the channel parameters from clusters can be obtained by repeating the process times.
V Deep Learning Settings
When using the NN, there are many things to consider to optimize its performance, e.g., pre-processing data sets, designing an NN structure, and setting hyper parameters. We have performed extensive simulations to find the best settings for the CH-learning and the PG-learning.
In this section, we first discuss the structure of input and output layers of the NN. Then, we explain the reason why we choose multilayer perceptron (MLP) for the CH-learning and convolutional neural network (CNN) for the proposed PG-learning. Finally, we elaborate the NN structures for the CH and PG-learning.
V-a Input and Output Layers for NN
The OFDM channels and extracted channel path gains, which are the inputs and outputs of the NN for the CH-learning and proposed PG-learning, respectively, are all complex-valued data. While there are some recent work on NNs that can deal with complex-valued inputs and outputs [18, 16], we exploit well-established NNs using real-valued data.
To convert complex-valued data into real-valued ones, the most commonly used method is to divide the complex-valued data into their real and imaginary parts. The real and imaginary parts may form one input layer [14, 25, 21, 22, 15, 28], or each of parts can construct two independent input layers , where each input layer is used for a separate network. Not only the real and imaginary parts of data but also the magnitude of data can be added to the input layer as in , since more information, even redundant, in the input layer restricts the network from over-fitting. Depending on the experimental scenarios, we select proper structures of the input and output layers that give the best performance.
V-B Proper NN Selection
Many previous works on wireless communication systems tried to solve nonlinear problems with MLP and CNN. MLP is the most common form of the NN. Some works on the DL extrapolation used MLP [14, 16, 15, 28]
. CNN is another NN that is superior for pattern recognition. CNN has also been used for the estimation of wireless channels or channel parameters [26, 14, 25].
The optimal NN structure greatly depends on the data, so the CH-learning and the PG-learning may require different structures. The CH-learning based on CNN and MLP is studied in  and , respectively. After extensive simulations, we have verified that MLP is better than CNN for the CH-learning while CNN outperforms MLP for the PG-learning.
The CH-learning uses the full dimensional channels directly as the input and output of NN, where the channel parameters are superposed, and a pattern within the input and output channel is vague, making MLP, which works well with highly uncertain data , suitable. CNN is more proper to the pattern recognition, which works well with more structural data. The PG-learning operates with the path gains extracted from the full dimensional channels. The path gains are more structured than the full dimensional channels, which makes CNN more preferable to MLP for the PG-learning.
V-C Details of NN Structures
-(a) consists of 20 units assembled with a fully connected layer, a batch normalizer, and a dropout layer. Performance of MLP is much improved when 20 units or more are used. In the CH-learning, the activation function is omitted because it worsens the result. In Fig.4-(a), the number written on the fully connected layer represents the number of nodes on the layer. The number of weights to be updated in Fig. 4-(a) is . The size of the input and output is , which can greatly increase the size of the network.
The CNN structure used for the PG-learning is shown in Fig. 4
-(b). The front part of CNN consists of four convolutional units, which include a convolutional layer, a batch normalizer, an activation function, and a pooling layer. By using the activation function and the pooling layer, the effect of feature extraction is maximized. Among many possible activation function including the ReLU, clipped ReLU, leakyReLU, ELU, and hyper tangent function, it turned out that the leakyReLU gives the best performance for our data. At the rear of network, the same unit as those used in MLP is repeated five times, which is used to map features to the outputs.
In Fig. 4-(b), the number on the convolutional layer means that the number of convolutional kernels is 64, and its size is , and on the pooling layer also means the kernel size. The number of weights to be updated for the PG-learning in Fig. 4-(b) is where is the size of the input and output of the NN. Note that subpath components are extracted by Algorithm 1 but not all path gains are used as the input and output for the PG-learning. By choosing out of path gains, it is possible to balance between the learning complexity and NN performance. The effect of is verified in Section VI-A. Since and are not related to the dimension of channels, the size of network in the PG-learning can be much smaller than the CH-learning, especially when the BS has a large number of antennas.
|Small Scale Fading Parameters||Value|
|UL carrier frequency||2.6 GHz|
|DL carrier frequency||2.9 GHz|
|Total bandwidth||100 MHz|
|Coherence bandwidth||180 kHz|
|Tx. and Rx. antenna||‘3gpp-3d’|
|Number of clusters (paths)||7|
|Number of subcarriers||32|
|Transmit power (MS)||30 dBm|
|Noise variance ()||-174 dBm|
|Speed of MS||10 km/h|
|Decorrelation distance||5 m|
Vi Numerical Results
We use QuaDRiGa to generate realistic DL and UL channels to compare the proposed tPG and fPG-learning to the CH-learning and the conventional DL training. Parameters used in QuaDRiGa are listed in Table I. Specific parameter settings are stated in each result if the parameters are different from Table I.
We consider the environment with seven clusters as a typical case of an urban communication scenario. To mimic the blockage caused by variable obstacles and moving vehicles, we randomly change one to three clusters for each MS sample set. The snapshots of each MS sample set are obtained every 40 msec, which is a period of the UL sounding reference signals. We consider the processing delay msec caused in the process of the NN-based DL extrapolation, which is explained in Remark 1. For the training set, we generate 200 MS sample sets in total. The accuracy of DL extrapolation is measured by the correlation factor, , which is defined as
In this section, we first check the effect of the number of subpaths on the tPG and fPG-learning in Section VI-A. Then, we compare the tPG, fPG, and CH-learning in the following subsections. In Section VI-B, we verify the effect of the total bandwidth, UL transmit power, and speed of MSs. Finally, we compare the PG-learning to the CH-learning and the conventional DL training in Section VI-C.
Vi-a Effect of Number of Subpaths on PG-Learning
It it necessary to examine the effect of , the number of subpaths for the DL extrapolation explained in Section IV-A, and , the number of subpaths for the PG-learning explained in Section V-C. Fig. 5 shows the effect of with the perfectly inferred DL path gains. If the PG-learning could infer the exact DL path gains, the accuracy of the DL channel reconstruction increases with . While using large seems to be helpful for the precise channel reconstruction as shown in Fig. 5, with the predicted path gains (with errors) from the PG-learning, Fig. 6 shows the accuracy of reconstruction decreases as increases. This is because the errors in the predicted subpath components add up, making the reconstructed channel less accurate. This result points out that there is still room for improvement in the proposed NN-based DL extrapolation.
Fig. 6 also indicates the effect of in the learning. The overall simulation results show that having large improves the performance of the PG-learning, since the increased size of input and output puts more information to the network for the PG-learning with additional NN training overhead.
Vi-B CH-Learning and PG-Learning
Tendency of the correlation factor according to the total bandwidth is shown in Fig. 7. As shown in Fig. 7, the CH-learning is seriously affected by the bandwidth. This is because the CH-learning is based on the OFDM channels, which vary with the total bandwidth significantly. The total bandwidth determines the phase difference between subcarriers as shown in (II-B). This phase difference is negligible when the bandwidth is small because the exponents in , which is defined after (4), go to zero as with a small bandwidth, i.e., for all . As a consequence, all channel coefficients overlap on the same base vector , which makes the CH-learning difficult to predict the DL OFDM channels.
The PG-learning does not use the OFDM channels in the learning phase but the correlation factor of the PG-learning is also measured on the transformed DL OFDM channels, which means that the PG-learning can be also affected by the total bandwidth. As shown in Fig. 7, however, the correlation factors of PG-learning are quite stable regardless of the bandwidth.
Fig. 8 shows the effect of UL parameter estimation errors on the DL extrapolation. As shown in Fig. 8, the fPG-learning has more difficulty in the DL extrapolation than the tPG-learning at low UL transmit power. Since the fPG-learning extracts the path gains and AoDs from the extracted channel coefficients, it is more vulnerable to the UL parameter estimation errors than the tPG-learning. This result proves that the precise DL channel reconstruction highly depends on accurate UL channel estimates. The CH-learning, on the contrary, is not affected much from the UL transmit power since it just exploits the UL channel estimates without further processing, which makes more robust to the estimation error.
The carrier frequency and guard band can also affect the NN-based DL extrapolation. We evaluate with different carrier frequency in Fig. 9 and different guard bands in Fig. 10. In (II-B), the path gain is the only channel parameter related to the carrier frequency. When the carrier frequency is high, Fig. 9 shows that the proposed PG learning requires to have more UL transmit power to work properly since the path gain attenuates more rapidly at high carrier frequency. However, Fig. 10 shows that the guard band seems to barely affect the DL extrapolation. Even for the 0.5 GHz guard band, which might be larger than most of practical FDD systems, the NN-based DL extrapolation methods work well as for the 0.1 GHz guard band. As the number of antennas at the BS increases, the overall correlation factors decrease but the tendency according to the guard band is maintained.
The correlation factors of the tPG, fPG, and CH-learning are compared with the MS speed in Fig. 11. The overall results show that the accuracy decreases at high speed.111The simulation environments with different speeds are based on different cluster geometries while all three methods are tested with the same geometry for the same speed. Therefore, lower speeds do not always give higher correlation factors due to different cluster geometries. The result of each speed is averaged over ten different geometries. When the MS speed is high, it may not be able for the MS to collect sufficient number of samples for the given length of the path since the snapshots of each MS sample set are generated every 40 msec. This problem can be resolved by increasing the number of MS sample sets. In Fig. 11, we train each learning method with 40, 100, and 200 MS sample sets. With 40 MS sample sets, the CH-learning suffers from insufficient number of data for training. On the contrary, the PG-learning is robust to the lack of samples. In addition, the accuracy of PG-learning is quite stable even at high speed compared to the CH-learning, which proves that the PG-learning is easier to train.
Note that the channel of MS with high speed could be outdated easily during the processing delay . Since we have already taken into account for the training, the processing delay does not affect the accuracy even at high speed.
Vi-C Comparison with DL Training
To compare the DL spectral efficiencies of the DL training and the NN-based DL extrapolation techniques, the coherence block length in (12) is derived as
where is the coherence bandwidth, which is set to 180 kHz as in Table I, and is the coherence time defined as
In (31), is the speed of light, is the DL carrier frequency, and is the speed of MS. The DL training overhead is , and the transmit power at the BS is set to 30 dBm. For the DL training, we assume that the estimated DL CSI at the MS is perfectly fed back to the BS.
From Fig. 12, it is clear that the DL training suffers from large training overhead at high speed due to the short coherence block length. The performance degradation of DL training is especially severe when the number of BS antennas, , is large, making it unsuitable to massive MIMO. This is quite clear from (9), i.e., with higher MS speed, the coherence block length decreases, and with more BS antennas, the training overhead increases. On the contrary, the NN-based DL extrapolation does not suffer from any DL training overhead. Moreover, as discussed in the previous subsection, the NN-based DL extrapolation does not suffer much for high MS speed by taking the processing delay into consideration for the training. The performance gap between the DL training and DL extrapolation would become even more prominent once we consider the limited feedback. Note that the proposed tPG-learning is always superior to the CH-learning while the fPG-learning and the CH-learning are comparable with each other.
In the communication environment with high mobility, the DL training method cannot work well, especially when the number of BS antennas becomes large, since the DL training causes large overhead and considerable delay. To overcome this problem, we proposed a novel DL extrapolation technique, dubbed as the PG-learning, using the UL CSI in this paper. Different from previous works on DL extrapolation relying on the full UL and DL channels, dubbed as the CH-learning, the proposed PG-learning exploits low-dimensional extracted channel paths gains as the input and output of NN. The numerical results showed that the PG-learning has higher DL extrapolation accuracy, regardless of the speed of MS, with significantly lower NN training overhead than the CH-learning.
We also verified, however, that there is still room to improve the PG-learning. More accurate UL path gain estimation and DL path gain prediction can lead to an advance on our scheme. Instead of relying on a discrete grid search for the AoD and delay as in this paper, the UL path gain estimation could be improved by gridless search using, e.g., atomic norm minimization 32, 33, 34, 35]. The recursive neural network (RNN), e.g., LTSM , can be also considered as a channel tracking method. With more precise UL and DL path gain information, the proposed NN-based DL extrapolation may be improved.
-  E. G. Larsson, O. Edfors, F. Tufvesson, and T. L. Marzetta, “Massive MIMO for Next Generation Wireless Systems,” IEEE Commun. Mag., vol. 52, no. 2, pp. 186-195, Feb. 2014.
-  D. J. Love, R. W. Heath, V. K. N. Lau, D. Gesbert, B. D. Rao, and M. Andrews, “An Overview of Limited Feedback in Wireless Communication Systems,” IEEE J. Sel. Areas Commun., vol. 26, no. 8, pp. 1341-1365, Oct. 2008.
-  B. Hassibi, and B. M. Hochwald, “How Much Training is Needed in Multiple-Antenna Wireless Links?,” IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 951-963, Apr. 2003.
-  N. Jindal, “MIMO Broadcast Channels With Finite-Rate Feedback,” IEEE Trans. Inf. Theory, vol. 52, no. 11, pp. 5045-5060, Nov. 2006.
-  T. L. Marzetta, “Massive MIMO: An Introduction,” Bell Labs Technical Journal, vol. 20, pp. 11-22, 2015.
-  J. Choi, Z. Chance, D. J. Love, and U. Madhow, “Noncoherent Trellis Coded Quantization: A Practical Limited Feedback Techniques for Massive MIMO Systems,” IEEE Trans. Commun., vol. 61, no. 12, pp. 5016-5029, Dec. 2013.
-  A. Adhikary, J. Nam, J. Ahn, and G. Caire, “Joint Spatial Division and Multiplexing-The Large-Scale Array Regime,” IEEE Trans. Inf. Theory, vol. 59, no. 10, pp. 6441-6463, Oct. 2013.
-  J. Choi, D. J. Love, and P. Bidigare, “Downlink Training Technique for FDD Massive MIMO Systems: Open-Loop and Closed-Loop Training With Memory,” IEEE J. Sel. Topics Signal Process., vol. 8, no. 5, pp. 802-814, Oct. 2014.
-  S. Noh, M. D. Zoltowski, Y. Sung, D. J. Love, “Pilot Beam Pattern Design for Channel Estimation in Massive MIMO Systems,” IEEE J. Sel. Topics Signal Process., vol. 8, no. 5, pp. 787-801, Oct. 2014.
-  Z. Gao, L. Dai, Z. Wang, and S. Chen, “Spatially Common Sparsity Based Adaptive Channel Estimation and Feedback for FDD Massive MIMO,” IEEE Trans. Signal Process., vol. 63, no. 23, pp. 6169-6183, Dec. 2015.
-  C. Sun, X. Gao, S. Jin, M. Matthaiou, Z. Ding, and C. Xiao, “Beam Division Multiple Access Transmission for Massive MIMO,” IEEE Trans. Commun., vol. 63, no. 6, pp. 2170-2184, June 2015.
-  Z. Gao, L. Dai, W. Dai, B. Shim, and Z. Wang, “Structured Compressive Sensing-Based Spatio-Temporal Joint Channel Estimation for FDD Massive MIMO,” IEEE Trans. Commun., vol. 64, no. 2, pp. 601-617, Feb. 2016.
-  F. Rottenberg, R. Wang, J. Zhang, and A. F. Molisch, “Channel Extrapolation in FDD Massive MIMO: Theoretical Analysis and Numerical Validation,” 2019 arXiv:1902.06844, [Online]. Available: http://arxiv.org/abs/1902.06844.
-  M. Arnold, S. Dörner, S. Cammerer, S. Yan, J. Hoydis, and S. ten Brink, “Enabling FDD Massive MIMO through Deep Learning-based Channel Prediction,” 2019 arXiv:1901.03664, [Online]. Available: http://arxiv.org/abs/1901.03664.
-  M. Alrabeiah and A. Alkhateeb, “Deep Learning for TDD and FDD Masive MIMO: Mapping Channels in Space and Frequency,” 2019 arXiv:1905.03761, [Online]. Available: http://arxiv.org/abs/1905.03761.
-  Y. Yang, F. Gao, G. Y. Li, and M. Jian, “Deep Learning-Based Downlink Channel Prediction for FDD Massive MIMO System,” IEEE Commun. Lett., vol. 23, no. 11, pp. 1994-1998, Nov. 2019.
-  D. Vasisht, S. Kumar, H. Rahul, and D. Katabi, “Eliminating Channel Feedback in Next-Generation Cellular Networks,” Proceedings of the 2016 ACM SIGCOMM Conference, pp. 398-411, 2016.
-  X. Li and A. Alkhateeb, “Deep Learning for Direct Hybrid Precoding in Millimeter Wave Massive MIMO Systems,” 2019 arXiv:1905.13212, [Online]. Available: http://arxiv.org/abs/1905.13212.
-  C. Wen, W. Shih, and S. Jin, “Deep Learning for Massive MIMO CSI Feedback,” IEEE Wireless Commun. Lett., vol. 7, no. 5, pp. 748-751, Oct. 2018.
-  A. M. Elbir, “CNN-Based Precoder and Combiner Design in mmWave MIMO Systems,” IEEE Commun. Lett., vol. 23, no. 7, pp. 1240-1243, July 2019.
-  H. Huang, Y. Peng, J. Yang, W. Xia, and G. Gui, ”Fast Beamforming Design via Deep Learning,” IEEE Trans. Veh. Technol., vol. 69, no. 1, pp. 1065-1069, Oct. 2019.
-  Y. Wang, M. Liu, J. Yang, and G. Gui, ”Data-Driven Deep Learning for Automatic Modulation Recognition in Cognitive Radios,” IEEE Trans. Veh. Technol., vol. 68, no. 4, pp. 4074-4077, Feb. 2019.
-  S. Jaeckel, L. Raschkowski, K. Börner, and L. Thiele, “QuaDRiGa: A 3-D Multi-Cell Channel Model with Time Evolution for Enabling Virtual Field Trials,” IEEE Trans. Antennas Propag., vol. 62, no. 6, pp. 3242-3256, June 2014.
-  Wireless InSite. Remcom Corp., 2019. [Online]. Available: https://www.remcom.com/wireless-insite-em-propagation-software. Accessed on: Dec. 2, 2019.
-  P. Dong, H. Zhang, G. Y. Li, I. S. Gaspar, and N. NaderiAlizadeh, “Deep CNN-Based Channel Estimation for mmWave Massive MIMO Systems,” IEEE J. Sel. Topics Signal Process., vol. 13, no. 5, pp. 989-1000, Sep. 2019.
-  J. Vieira, E. Leitinger, M. Sarajlic, X. Li, and F. Tufvesson, “Deep Convolutional Neural Networks for Massive MIMO Fingerprint-based Positioning,” Proceedings of IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications, pp. 1-6, Oct. 2017.
-  J. Choi, G. Lee, and B. L. Evans, “Two-Stage Analog Combining in Hybrid Beamforming Systems With Low-Resolution ADCs,” IEEE Trans. Signal Process., vol. 67, no. 9, pp. 2410-2425, May 2019.
-  S. Navabi, C. Wang, O. Y. Bursalioglu, and H. Papadopoulos, “Predicting Wireless Channel Features Using Neural Networks,” Proceedings of IEEE International Conference on Communications, pp. 1-6, May 2018.
-  A. Géron, “Convolutional Neural Networks,” in
-  S. B. Driss, M. Soua, R. Kachouri, and M. Akil, “A Comparison Study Between MLP and Convolutional Neural Network Models for Character Recognition,” Proceedings of Real-Time Image and Video Processing 2017, vol. 10223, pp. 1023306. International Society for Optics and Photonics, 2017.
-  Y. Chi and M. F. Da Costa, “Harnessing Sparsity over the Continuum: Atomic Norm Minimization for Super Resolution,” 2019 arXiv:1904.04283, [Online]. Available: http://arxiv.org/abs/1904.04283.
-  J. Ma, S. Zhang, H. Li, F. Gao, and S. Jin, “Sparse Bayesian Learning for the Time-Varying Massive MIMO Channels: Acquisition and Tracking,” IEEE Trans. Commun., vol. 67, no. 3, pp. 1925-1938, Mar. 2019.
-  M. Li, S. Zhang, N. Zhao, W. Zhang, and X. Wang, “Time-Varying Massive MIMO Channel Estimation: Capturing, Reconstruction, and Restoration,” IEEE Trans. Commun., vol. 67, no. 11, pp. 7558-7572, Nov. 2019. F
-  J. Zhao, H. Xie, F. Gao, W. Jia, S. Jin, and H. Lin, “Time Varying Channel Tracking With Spatial and Temporal BEM for Massive MIMO Systems,” IEEE Trans. Wireless Commun., vol. 17, no. 8, pp. 5653-5665, Aug. 2018.
-  Y. Han, Q. Liu, C.-K. Wen, M. Matthaiou, and X. Ma, “Tracking FDD Massive MIMO Downlink Channels by Exploiting Delay and Angular Reciprocity,” IEEE J. Sel. Topics Signal Process., vol. 13, no. 5, pp. 1062-1076, Sep. 2019.
-  G. Gui, H. Huang, Y. Song, and H. Sari, ”Deep Learning for an Effective Nonorthogonal Multiple Access Scheme,” IEEE Trans. Veh. Technol., vol. 67, no. 9, pp. 8440-8450, June 2018.