A Fast Compressive Channel Estimation with Modified Smoothed L0 Algorithm

TL;DR

This paper introduces a modified smoothed L0 algorithm for fast and stable compressive channel estimation in broadband wireless systems, effectively exploiting channel sparsity with low computational complexity.

Contribution

It proposes a novel modified smoothed L0 algorithm that balances stability and low complexity for efficient sparse channel estimation.

Findings

The algorithm outperforms existing methods in simulation tests.

It achieves faster convergence with comparable accuracy.

The approach is practical for real-world broadband wireless channels.

Abstract

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