Computer Science – Information Theory
Scientific paper
2010-05-13
Computer Science
Information Theory
4 pages, 4 figures, ICCACS2010
Scientific paper
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
Adachi Fumiyuki
Gui Guan
Peng Wei
Wan Qun
No associations
LandOfFree
A Fast Compressive Channel Estimation with Modified Smoothed L0 Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Fast Compressive Channel Estimation with Modified Smoothed L0 Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fast Compressive Channel Estimation with Modified Smoothed L0 Algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-640395