Sparse Multipath Channel Estimation Using Compressive Sampling Matching Pursuit Algorithm

Details Sparse Multipath Channel Estimation Using Compressive Sampling Matching Pursuit Algorithm Sparse Multipath Channel Estimation Using Compressive Sampling Matching Pursuit Algorithm

2010-05-13

arxiv.org/abs/1005.2270v1

Computer Science

Information Theory

5 pages, 7figures, IEEE APWCS 2010

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Sparse Multipath Channel Estimation Using Compressive Sampling Matching Pursuit 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 Sparse Multipath Channel Estimation Using Compressive Sampling Matching Pursuit Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparse Multipath Channel Estimation Using Compressive Sampling Matching Pursuit Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-640407