Novel Compressed Sensing-Based Channel Estimation Algorithm and Near-Optimal Pilot Placement Scheme
Bibliographic record
Abstract
This paper presents a novel recovery algorithm based on sparsity adaptive matching pursuit (SaMP) and a new near-optimal pilot placement scheme, for compressed sensing (CS)-based sparse channel estimation in orthogonal frequency division multiplexing (OFDM) communication systems. Compared with other state-of-the-art recovery algorithms, the proposed algorithm possesses the feature of SaMP of not requiring a priori knowledge of the sparsity level, and moreover, adjusts the step size adaptively to approach the true sparsity level. Furthermore, we focus on the pilot pattern design in sparse channel estimation. Although a brute-force search guarantees the optimal pilot pattern, it is prohibitive to examine all possibilities due to high computational complexity. It is known that by minimizing the mutual coherence of the measurement matrix when the signal is sparse on the unitary discrete Fourier transform (DFT) matrix, the optimal set of pilot locations is a cyclic difference set (CDS). Based on this, we propose an efficient near-optimal pilot placement scheme in cases where CDS does not exist. Simulation results show that the proposed channel estimation algorithm, with the new pilot placement scheme, offers a better tradeoff between the performance-in terms of mean-squared-error (MSE) and bit-error-rate (BER)-and complexity, when compared to other estimation algorithms.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".