MétaCan
Menu
Back to cohort
Record W2019748094 · doi:10.1109/vetecf.2010.5594451

On Spectrum Broadening of Pre-Coded Faster-Than-Nyquist Signaling

2010· article· en· W2019748094 on OpenAlexaff
Yong Jin Daniel Kim, Jan Bajcsy

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicPAPR reduction in OFDM
Canadian institutionsMcGill University
Fundersnot available
KeywordsIntersymbol interferenceNyquist ISI criterionTransmitterComputer scienceCoding (social sciences)Spectral densitySpectral efficiencyElectronic engineeringConvolutional codeNyquist–Shannon sampling theoremPulse shapingAlgorithmTelecommunicationsMathematicsPhysicsDecoding methodsPower (physics)EngineeringStatisticsChannel (broadcasting)

Abstract

fetched live from OpenAlex

The faster-than-Nyquist (FTN) signaling has been of interest in the research literature due to recent advances in pre-coding and equalization techniques allowing practical removal of the intersymbol interference (ISI). Since the structure of ISI is deterministic in the FTN signaling, a data pre-coding at the transmitter to combat ISI is of practical importance. It is shown, however, that such pre-coding in FTN can significantly broaden the transmission spectrum and alter the shape of the power spectral density. In this paper, we analyze the power spectral density of convolutionally pre-coded FTN signals on linear time-invariant channels. We also identify sufficient conditions on the pre-coding coefficients for preventing the spectrum broadening. Simulation results with several pulse shapes are provided which agree with the analysis. The analysis and the simulation show that for many practically used pulses the pre-coded FTN suffers from the spectrum broadening. This suggests that pre-coding in the FTN signaling must be handled with care.

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.000
metaresearch head score (Gemma)0.003
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.001
Threshold uncertainty score0.003

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.007
GPT teacher head0.220
Teacher spread0.213 · 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
GenreEmpirical

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

Citations24
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicPAPR reduction in OFDMFrench-language works237,207