Close category search window
 

Solving closely-spaced multipaths via extended Kalman filter in WCDMA downlink receivers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Lakhzouri, A. ; Inst. of Commun. Eng., Tampere Univ. of Technol., Finland ; Lohan, E.S. ; Hamila, R. ; Renfors, M.

Delay estimation is an important task in wideband CDMA (WCDMA) receivers. This is a very challenging topic when the successive paths are spaced at less than one chip distance (closely-spaced paths). Traditional delay locked loops (DLLs) are not able to estimate closely-spaced path delays with good accuracy. We introduce an extended Kalman filter (EKF) based algorithm for the estimation of closely-spaced path delays in WCDMA environments. The EKF might be applied either at the sample or at symbol level and it can be also used for the estimation of the complex coefficients of the channel multipaths. The model parameters and the sensitivity to the initialization conditions are described for a practical downlink WCDMA scenario, employing root raised cosine pulse shapes. Simulation results show that EKF is fast convergent both when the estimation is done at symbol or at sample level, and the mean delay error is at most one sample for both cases of oversampling factors of 4 and 8. We show also the conditions when the convergence is not guaranteed.

Published in:
Personal Mobile Communications Conference, 2003. 5th European (Conf. Publ. No. 492)

Date of Conference: 22-25 April 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.