Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. A Novel Maximum Likelihood Estimation Of Superimposed Exponential Signals In Noise And Ultra-Wideband Application
 
conference paper

A Novel Maximum Likelihood Estimation Of Superimposed Exponential Signals In Noise And Ultra-Wideband Application

Zhan, Hai
•
Farserotu, John
•
Le Boudec, Jean-Yves  
2007
PIMRC 07
18th annual international symposium on personal, indoor and mobile radio communication

We pose the estimation of the parameters of multiple superimposed exponential signals in additive Gaussian noise problem as a Maximum Likelihood (ML) estimation problem. The ML problem is very non linear and hard to solve. Some previous works focused on finding alternative estimation procedures, for example by denoising. In contrast, we tackle the ML estimation problem directly. First, we use the same transformation as the first step of Iterative Quadratic Maximum Likelihood (IQML) and transform the ML problem into another optimization problem that gets rid of the amplitude coefficients. Second, we solve the remaining optimization problem with a gradient descent approach (“pseudo-quadratic maximum likelihood”). We also use this algorithm for Ultra-Wideband channel estimation and estimate ranging in non-line of sight environment.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

pimrc07.pdf

Access type

openaccess

Size

88.39 KB

Format

Adobe PDF

Checksum (MD5)

5c5e1304fe28ab21dfbd72a491c432bd

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés