MétaCan
Menu
Back to cohort
Record W1985032606 · doi:10.1109/bsc.2010.5472921

A probabilistic model for optical fiber channels with zero dispersion

2010· article· en· W1985032606 on OpenAlexaff
Mansoor I. Yousefi, Frank R. Kschischang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicOptical Network Technologies
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsNonlinear systemMathematicsDispersion (optics)OdePhysicsMathematical analysisOpticsQuantum mechanics

Abstract

fetched live from OpenAlex

Signal evolution in optical fibers with zero dispersion and distributed Raman amplification is modeled by a stochastic nonlinear ordinary differential equation (ODE) which includes the effects of the Kerr nonlinearity and amplified spontaneous emission noise. Such a mathematical model in the form of a stochastic nonlinear ODE is not initially suitable for information-theoretic analysis. In this paper we provide a simple framework to probabilistically model signal propagation in optical fibers. The analysis is based on discretizing the fiber as a cascade of an infinite number of infinitesimal pieces of fiber in the distance dimension, while at the same time quantizing the signal into a large number of small bins in the complex plane. This can be understood in the context of the sum-product algorithm, known in coding theory. Though the method can be also applied to fibers with dispersion, in this paper it is illustrated for the special case of zero dispersion. In particular, for this case we find the conditional probability density function of the output signal given the input signal. We further show that the capacity of the dispersion-free optical channel as a function of signal-to-noise ratio (SNR) goes to infinity with 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 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.002
metaresearch head score (Gemma)0.005
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.006
Threshold uncertainty score0.014

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0020.004
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0020.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.011
GPT teacher head0.207
Teacher spread0.196 · 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

Citations2
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicOptical Network TechnologiesFrench-language works237,207