Least-squares based iterative multipath super-resolution technique

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, 7 figures

Scientific paper

In this paper, we study the problem of multipath channel estimation for direct sequence spread spectrum signals. To resolve multipath components arriving within a short interval, we propose a new algorithm called the least-squares based iterative multipath super-resolution (LIMS). Compared to conventional super-resolution techniques, such as the multiple signal classification (MUSIC) and the estimation of signal parameters via rotation invariance techniques (ESPRIT), our algorithm has several appealing features. In particular, even in critical situations where the conventional super-resolution techniques are not very powerful due to limited data or the correlation between path coefficients, the LIMS algorithm can produce successful results. In addition, due to its iterative nature, the LIMS algorithm is suitable for recursive multipath tracking, whereas the conventional super-resolution techniques may not be. Through numerical simulations, we show that the LIMS algorithm can resolve the first arrival path among closely arriving independently faded multipaths with a much lower mean square error than can conventional early-late discriminator based techniques.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Least-squares based iterative multipath super-resolution technique 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 Least-squares based iterative multipath super-resolution technique, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Least-squares based iterative multipath super-resolution technique will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-569968

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.