MétaCan
Menu
Back to cohort
Record W2071495366 · doi:10.1109/jphot.2013.2255033

Chip-Asynchronous Binary Optical CDMA: An Optimum Signaling Scheme for Random Delays

2013· article· en· W2071495366 on OpenAlex
Salman Khan, Jan Bajcsy

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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE photonics journal · 2013
Typearticle
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsMcGill University
FundersFonds Québécois de la Recherche sur la Nature et les Technologies
KeywordsAsynchronous communicationComputer scienceChipCode division multiple accessElectronic engineeringRobustness (evolution)Channel capacityBinary numberChannel (broadcasting)Computer networkTelecommunicationsEngineeringMathematics

Abstract

fetched live from OpenAlex

Most optical code division multiple access (OCDMA) research literature has focused on chip-synchronous OCDMA. However, practical OCDMA networks are inherently chip-asynchronous since users transmit their signals from different locations without any coordination. This paper focuses on binary chip-asynchronous OCDMA with time spreading, and the main result is that appropriate nonuniform signaling can achieve a data throughput of 2.5 bits per OCDMA chip. This result shows that the presence of chip asynchronism leads to approximately a threefold capacity gain over chip-synchronous OCDMA capacity. Additional results are presented to illustrate that the near capacity multiuser interference has a low variance and a non-Gaussian distribution. Finally, the robustness of the achieved capacity gains is verified in the presence of additive channel noise.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.642
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.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.012
GPT teacher head0.221
Teacher spread0.209 · 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