MétaCan
Menu
Back to cohort
Record W2642600425 · doi:10.23977/cpcs.2016.11003

Parallel Matched Filtering Algorithm with Low Complexity

2016· article· en· W2642600425 on OpenAlexvenueno aff
Cheng Xuhuang

Bibliographic record

VenueComputing Performance and Communication systems · 2016
Typearticle
Languageen
FieldComputer Science
TopicVideo Coding and Compression Technologies
Canadian institutionsnot available
Fundersnot available
KeywordsAlgorithmComputational complexity theoryBlock (permutation group theory)Computer scienceFilter (signal processing)Discrete Fourier transform (general)Fast Fourier transformCooley–Tukey FFT algorithmCurrent (fluid)Fourier transformMathematicsShort-time Fourier transformFourier analysisComputer visionEngineering

Abstract

fetched live from OpenAlex

For the problem of double counting in the overlap save algorithm(OSA), this paper presents parallel matched filtering algorithm with low complexity. The current data is segment based on the filter order, then using the quarter discrete fourier transform (QDFT) to reduce the amount of calculation. The calculation result of the previous and current data block are added to obtain the block filter results. Analysis and simulation results show that the algorithm effectively reduces the computational complexity. It is more suitable for high-speed demodulation which has multiple parallel paths.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0050.002

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.

Opus teacher head0.036
GPT teacher head0.249
Teacher spread0.214 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations1
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueComputing Performance and Communication systemsSame topicVideo Coding and Compression TechnologiesFrench-language works237,207