Searcharxiv⌕ Search

arXiv subjects

Guan Gui

Publications and source records attributed to Guan Gui.

75 records · Page 5Linked to original sources

A Fast Compressive Channel Estimation with Modified Smoothed L0 Algorithm

Broadband wireless channel is a time dispersive and becomes strongly frequency selective. In most cases, the channel is composed of a few dominant coefficients and a large part of coefficients is approximately zero or zero. To exploit the sparsity of multi-path channel (MPC), there are various methods have been proposed. They are, namely, greedy algorithms, iterative algorithms, and convex program. The former two algorithms are easy to be implemented but not stable; on the other hand, the last method is stable but difficult to be implemented as practical channel estimation problems because of computational complexity. In this paper, we proposed a novel channel estimation strategy by using modified smoothed (MSL0) algorithm which combines stable and low complexity. Computer simulations confirm the effectiveness of the introduced algorithm comparisons with the existing methods. We also give

cs.IT↗

Sparse Multipath Channel Estimation using DS Algorithm in Wideband Communication Systems

Wideband wireless channel is a time dispersive channel and becomes strongly frequency-selective. However, in most cases, the channel is composed of a few dominant taps and a large part of taps is approximately zero or zero. They are often called sparse multi-path channels (MPC). Conventional linear MPC methods, such as the least squares (LS), do not exploit the sparsity of MPC. In general, accurate sparse MPC estimator can be obtained by solving a LASSO problem even in the presence of noise. In this paper, a novel CS-based sparse MPC method by using Dantzig selector (DS) [1] is introduced. This method exploits a channel's sparsity to reduce the number of training sequence and, hence, increase spectral efficiency when compared to existed methods with computer simulations.

cs.IT↗

Sparse Multipath Channel Estimation Using Compressive Sampling Matching Pursuit Algorithm

Wideband wireless channel is a time dispersive channel and becomes strongly frequency-selective. However, in most cases, the channel is composed of a few dominant taps and a large part of taps is approximately zero or zero. To exploit the sparsity of multi-path channel (MPC), two methods have been proposed. They are, namely, greedy algorithm and convex program. Greedy algorithm is easy to be implemented but not stable; on the other hand, the convex program method is stable but difficult to be implemented as practical channel estimation problems. In this paper, we introduce a novel channel estimation strategy using compressive sampling matching pursuit (CoSaMP) algorithm which was proposed in [1]. This algorithm will combine the greedy algorithm with the convex program method. The effectiveness of the proposed algorithm will be confirmed through comparisons with the existing methods.

cs.IT↗