MétaCan
Menu
Back to cohort
Record W2142134169 · doi:10.1109/tsp.2002.1011206

A fractionally spaced blind equalizer based on linear programming

2002· article· en· W2142134169 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Signal Processing · 2002
Typearticle
Languageen
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsMcMaster University
Fundersnot available
KeywordsBlind equalizationBaudQuadrature amplitude modulationQAMLinear programmingIntersymbol interferenceConvex optimizationComputer sciencePiecewise linear functionEqualization (audio)EqualizerQuadratic programmingMathematicsAlgorithmControl theory (sociology)Mathematical optimizationRegular polygonTransmission (telecommunications)TelecommunicationsDecoding methodsBit error rateArtificial intelligence

Abstract

fetched live from OpenAlex

We formulate the blind fractionally spaced equalization (FSE) problem as one that minimizes a piecewise linear convex function subject to some linear constraints on the equalizer parameters. We show that this formulation achieves both the interference removal and the carrier phase recovery when the input signal possesses a certain quadrature amplitude modulation (QAM) type symmetry. A fast linear programming implementation is presented to solve the convex minimization problem. Computer simulation results indicate the new linear programming-based FSE is able to accurately equalize channels that are known to be not equalizable by T-spaced (or baud rate) blind equalizers and yields superior performance to other blind FSE methods.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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: none
Teacher disagreement score0.885
Threshold uncertainty score0.981

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.051
GPT teacher head0.300
Teacher spread0.250 · 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