Level crossing speech sampling and its sparsity promoting reconstruction using an iterative method with adaptive thresholding
Bibliographic record
Abstract
The authors propose asynchronous level crossing (LC) A/D converters for low redundancy voice sampling. They propose to utilise the family of iterative methods with adaptive thresholding (IMAT) for reconstructing voice from non‐uniform LC and adaptive LC (ALC) samples thereby promoting sparsity. The authors modify the basic IMAT algorithm and propose the iterative method with adaptive thresholding for level crossing (IMATLC) algorithm for improved reconstruction performance. To this end, the authors analytically derive the basic IMAT algorithm by applying the gradient descent and gradient projection optimisation techniques to the problem of square error minimisation subjected to sparsity. The simulation results indicate that the proposed IMATLC reconstruction method outperforms the conventional reconstruction method based on low‐pass signal assumption by 6.56 dBs in terms of reconstruction signal‐to‐noise ratio (SNR) for LC sampling. In this scenario, IMATLC outperforms orthogonal matching pursuit, least absolute shrinkage and selection operator and smoothed L0 sparsity promoting algorithms by average amounts of 12.13, 10.31, and 10.28 dBs, respectively. Finally, the authors compare the performance of the proposed LC/ALC‐based A/Ds with the conventional uniform sampling‐based A/Ds and their random sampling‐based counterparts both in terms of perceptual evaluation of speech quality and reconstruction SNR.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 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".