A Maximum Likelihood Time Delay Estimator in a Multipath Environment Using Importance Sampling
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, we present a new implementation of the maximum likelihood criterion for the estimation of the time delays in a multipath environment and then extend it to the estimation of the time difference of arrival when the transmitted signal is unknown. The new technique implements the concept of importance sampling (IS) to find the global maximum of the compressed likelihood function in a modest computational manner. It thereby avoids traditional complex multidimensional grid search or initialization-dependent iterative methods. Indeed, one of the most interesting features is that it transforms the multi-dimensional search inherent to multipath propagation into a much simpler one-dimensional optimization problem in the delays dimension. Moreover, it guarantees convergence to the global maximum, contrarily to the popular iterative implementation of the maximum likelihood criterion by the well known expectation maximization (EM) algorithm. Comparisons with some other methods such as the EM algorithm, MUSIC and accelerated random search (ARS) demonstrates the superiority of the proposed IS-based multipath delay estimator in terms of estimation performance and complexity.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it