The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Parameter estimation of superimposed signals using the EM algorithm
Abstract
A computationally efficient algorithm for parameter estimation of superimposed signals based on the two-step iterative EM (estimate-and-maximize, with an E step and an M step) algorithm is developed. The idea is to decompose the observed data into their signal components and then to estimate the parameters of each signal component separately. The algorithm iterates back and forth, using the current parameter estimates to decompose the observed data better and thus increase the likelihood of the next parameter estimates. The application of the algorithm to the multipath time delay and multiple-source location estimation problems is considered.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Detection, Estimation, And Modulation Theory
Trees, H. L. V. (1968) · Cited by 5,969
Detection, Estimation, and Modulation Theory, Part I
Van Trees, H. L. (2001) · John Wiley & Sons, Inc. eBooks · doi:10.1002/0471221082 · Cited by 3,891
Detection of signals by information theoretic criteria
Wax, M., & Kailath, T. (1985) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1985.1164557 · Cited by 3,426
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
A signal subspace approach to multiple emitter location and spectral estimation
Schmidt, R. O. (1981) · Medical Entomology and Zoology · Cited by 1,147
All-pole modeling of degraded speech
Lim, J. S., & Oppenheim, A. V. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163086 · Cited by 597
A Fast Improvement to the Em Algorithm on its Own Terms
Meilijson, I. (1989) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1989.tb01754.x · Cited by 371
Multiple Source Location-A Digital Approach
Reddi, S. S. (1979) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.1979.308800 · Cited by 216
The signal subspace approach for multiple wide-band emitter location
Su, G., & Morf, M. (1983) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1983.1164233 · Cited by 215
Cited by
MUSIC, maximum likelihood, and Cramer-Rao bound
Stoica, P., & Nehorai, A. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.17564 · Cited by 2,820
Performance study of conditional and unconditional direction-of-arrival estimation
Stoica, P., & Nehorai, A. (1990) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.60109 · Cited by 1,231
Févotte, C., Bertin, N., & Durrieu, J.-L. (2009) · Neural Computation · doi:10.1162/neco.2008.04-08-771 · Cited by 1,119
Channel parameter estimation in mobile radio environments using the SAGE algorithm
Fleury, B. H., Tschudin, M., Heddergott, R., Dahlhaus, D., & Ingeman Pedersen, K. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.753729 · Cited by 1,079
Space-alternating generalized expectation-maximization algorithm
Fessler, J. A., & Hero, A. O. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.324732 · Cited by 1,063
Sensor array processing based on subspace fitting
Viberg, M., & Ottersten, B. (1991) · IEEE Transactions on Signal Processing · doi:10.1109/78.80966 · Cited by 705
Detection and estimation in sensor arrays using weighted subspace fitting
Viberg, M., Ottersten, B., & Kailath, T. (1991) · IEEE Transactions on Signal Processing · doi:10.1109/78.97999 · Cited by 512
Time Delay Estimation in Room Acoustic Environments: An Overview
Chen, J., Benesty, J., & Huang, Y. (2006) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/asp/2006/26503 · Cited by 370
Ottersten, B., Viberg, M., Stoica, P., & Nehorai, A. (1993) · Springer Series in Information Sciences · doi:10.1007/978-3-642-77347-1_4 · Cited by 365
On Gridless Sparse Methods for Line Spectral Estimation From Complete and Incomplete Data
Yang, Z., & Xie, L. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2420541 · Cited by 352
Acoustical and Environmental Robustness in Automatic Speech Recognition
Acero, A. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3122-7 · Cited by 327
mD-Track: Leveraging Multi-Dimensionality for Passive Indoor Wi-Fi Tracking
Xie, Y., Xiong, J., Li, M., & Jamieson, K. (2019) · The 25th Annual International Conference on Mobile Computing and Networking · doi:10.1145/3300061.3300133 · Cited by 320
Model-based estimation of ultrasonic echoes. Part I: Analysis and algorithms
Demirli, R., & Saniie, J. (2001) · IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control · doi:10.1109/58.920713 · Cited by 306
Array shape calibration using sources in unknown locations-a maximum likelihood approach
Weiss, A. J., & Friedlander, B. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.45542 · Cited by 287
Theory and Use of the EM Algorithm
Gupta, M. R. (2010) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000034 · Cited by 272
A least-squares algorithm for multipath time-delay estimation
Manickam, T. G., Vaccaro, R. J., & Tufts, D. W. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.330381 · Cited by 109
A new time-delay estimation in multipath
Moghaddam, P. P., Amindavar, H., & Kirlin, R. L. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.810290 · Cited by 47
FFT-Based Efficient Algorithms for Time Delay Estimation
Wu, R., Wang, W., & Ji, Q. (2012) · Fourier Transform - Signal Processing · doi:10.5772/36242 · Cited by 2
“However, its convergence depends highly on the initialization method used and 3 www.intechopen.com 2 Will-be-set-by-IN-TECH no systematic initialization method is given in (Feder & Weinstein, 1988).”
BackgroundMethodInfluential
Metadata
- Authors
- Feder, M., & Weinstein, E.
- Venue
- IEEE Transactions on Acoustics, Speech, and Signal Processing
- Published
- 1988-04
- Volume
- 36
- Issue
- 4
- Pages
- 477-489
- ISSN
- 0096-3518 (ISSN-L)
- OpenAlex
- W2154191559
- Cited by
- 779
- References
- 14
- FWCI
- 11.60
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.