4.7 Article

Efficient Beamforming Training and Channel Estimation for Millimeter Wave OFDM Systems

Journal

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
Volume 20, Issue 5, Pages 2805-2819

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TWC.2020.3044462

Keywords

Channel estimation; Training; OFDM; Array signal processing; Transmitters; Antenna arrays; Sensors; Beamforming training; mmWave channel estimation; OFDM systems

Funding

  1. National Key Research and Development Program of China [2020YFB1805001]
  2. National Natural Science Foundation of China [61829103, 61831004]

Ask authors/readers for more resources

This article investigates the problem of downlink beamforming training and channel estimation for millimeter wave OFDM systems, proposing a sparse bipartite graph code-based algorithm that utilizes sparse encoding and signal recovery for efficient channel estimation. The theoretical analysis demonstrates the reduction in training overhead achieved by the proposed method, with simulations showing its effectiveness and performance advantages over compressed sensing-based methods.
We study the problem of downlink beamforming training and channel estimation for millimeter wave (mmWave) OFDM systems, where a hybrid analog and digital beamforming structure is employed at the transmitter (i.e., base station) and an omni-directional antenna or an antenna array is used at the receiver (i.e., user). To efficiently probe the channel, we form multiple directional beams simultaneously at the transmitter and steer them towards different directions. The objective is to devise the beam training sequence and develop an efficient algorithm to estimate the channel. By exploiting the sparse scattering nature of mmWave channels, the above problem is formulated as one of sparse encoding and signal recovery, which involves finding a sparse sensing matrix to compress the sparse channel and an efficient channel estimation algorithm to recover the sparse channel from compressive measurements. In this article, we propose a sparse bipartite graph code-based algorithm, where a set of bipartite graphs are employed to encode the sparse channel and a simple decoding procedure that relies on the presence of a No-Multiton-graph (NM-graph) is used to reconstruct the sparse channel. Theoretical analysis shows that our proposed method can help achieve a substantial training overhead reduction. Simulations are provided to show the effectiveness of the proposed algorithm and its performance advantage over compressed sensing-based methods.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available