Efficient Estimation and Prediction for Sparse Time-Varying Underwater Acoustic Channels
Bibliographic record
Abstract
This paper investigates the estimation and prediction of the sparse time-varying channel in underwater acoustic communication systems. The estimation approach exploits the sparse structure of the delay-Doppler representation of the channel. Various state-of-the-art matching pursuit (MP)-type algorithms for sparse signal reconstruction are compared. Among the considered algorithms, sparsity adaptive MP (SaMP) and its variant adaptive step size SaMP have the advantage of not requiring a priori knowledge of the sparsity level and outperform the other algorithms in terms of mean squared error (MSE). Moreover, due to the fast time-varying nature and the extremely limited bandwidth of the UWA channels, a channel prediction that can provide up-to-date channel state information is necessary for reliable symbol detection. This paper proposes an adaptive channel prediction scheme that extrapolates the channel knowledge estimated from a block of training symbols, and the predicted channel is used to decode consecutive data blocks. The proposed scheme does not require any a priori knowledge of channel dynamic model and noise statistics, and is able to provide future channel estimates based solely on current channel estimates. Furthermore, the proposed scheme operates in the delay-Doppler domain, and thus has a remarkably lower computational complexity when compared with the channel prediction in time domain. To further improve the prediction accuracy, past detected symbols are fed back to assist the proposed predictor with an up-to-date channel estimate. Simulation results of the proposed channel estimation and prediction demonstrate a good tradeoff between the MSE/bit error rate and the computational 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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.002 |
| 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.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".