MétaCan
Menu
Back to cohort
Record W2110860373 · doi:10.1109/78.839988

Design of orthogonal pulse shapes for communications via semidefinite programming

2000· article· en· W2110860373 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 · 2000
Typearticle
Languageen
FieldComputer Science
TopicDigital Filter Design and Implementation
Canadian institutionsMcMaster University
Fundersnot available
KeywordsSemidefinite programmingBandwidth (computing)Convex optimizationPulse shapingAlgorithmComputer scienceSpectral efficiencyRobustness (evolution)MathematicsDigital filterMatched filterElectronic engineeringMathematical optimizationTelecommunicationsChannel (broadcasting)Regular polygonOpticsEngineering

Abstract

fetched live from OpenAlex

In digital communications, orthogonal pulse shapes are often used to represent message symbols for transmission through a channel. In this paper, the design of such pulse shapes is formulated as a convex semidefinite programming problem, from which a globally optimal pulse shape can be efficiently found. The formulation is used to design filters that achieve (a) the minimal bandwidth for a given filter length; (b) the minimal filter length for a given bandwidth; (c) the maximal robustness to timing error for a given bandwidth and filter length. Bandwidth is measured either in spectral energy concentration terms or with respect to a spectral mask. The effectiveness of the method is demonstrated by the design of waveforms with substantially improved performance over the "chip" waveforms specified in standards for digital mobile telecommunications.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.985
Threshold uncertainty score0.607

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
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.070
GPT teacher head0.305
Teacher spread0.236 · 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