The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Optimum localization of multiple sources by passive arrays
Abstract
The maximum likelihood (ML) estimator of the location of multiple sources and the corresponding Cramer-Rao lower bound on the error covariance matrix are derived. The derivation is carried out for the general case of correlated sources so that multipath propagation is included as a special case. It is shown that the ML processor consists of a bank of beam-formers, each focused to a different source, followed by a variable matrix-filter that is controlled by the assumed location of the sources. In the special case of uncorrelated sources and very low signal-to-noise ratio this processor reduces to an aggregate of ML processors for a single source with each processor matched to a different source. Iterative algorithms for the actual computation of the ML estimator are also presented.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The generalized correlation method for estimation of time delay
Knapp, C., & Carter, G. (1976) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1976.1162830 · Cited by 4,433
Cited by
Closed-form least-squares source location estimation from range-difference measurements
Smith, J., & Abel, J. (1987) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1987.1165089 · Cited by 721
Doclo, S., & Moonen, M. (2003) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/s111086570330602x · Cited by 96
Metadata
- Authors
- Wax, M., & Kailath, T.
- Venue
- IEEE Transactions on Acoustics, Speech, and Signal Processing
- Published
- 1983-10
- Volume
- 31
- Issue
- 5
- Pages
- 1210-1217
- ISSN
- 0096-3518 (ISSN-L)
- OpenAlex
- W2091570515
- Cited by
- 209
- References
- 1
- FWCI
- 7.45
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimum localization of multiple sources by passive arrays. https://app.cochat.ai/papers/10.1109/tassp.1983.1164183
- The paper
- Wax, M., & Kailath, T. (1983). Optimum localization of multiple sources by passive arrays. IEEE Transactions on Acoustics, Speech, and Signal Processing. https://doi.org/10.1109/tassp.1983.1164183
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.
