MétaCan
Menu
Back to cohort
Record W2138879458 · doi:10.1109/vtc.2001.956629

Coding-spreading tradeoff analysis for DS-CDMA systems

2002· article· en· W2138879458 on OpenAlex
Lian Zhao, J.W. Mark, Youngki Yoon

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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsCode division multiple accessCoding gainAlgorithmCode rateConstant-weight codeComputer scienceSpectral efficiencyBit error rateSystematic codePolynomial codeCoding (social sciences)Code (set theory)MathematicsLinear codeTelecommunicationsStatisticsDecoding methodsBlock code

Abstract

fetched live from OpenAlex

The best tradeoff between coding and spreading in a single-cell direct-sequence code division multiple access (DS-CDMA) system is investigated. The best code rate in terms of the system spectral efficiency for a single-class system and the optimal power allocation for a multi-class system is analyzed by applying both a matched filter (MF) receiver and a minimum mean square error (MMSE) receiver. It is shown that for the MF receiver, the coding-spreading tradeoff favors a code rate reduction. In the case of the MMSE receiver, the spectral efficiency vs. code rate curve is convex, so there is a best code rate corresponding to a given E/sub b//N/sub 0/ specification. Numerical results show that the best code rate is a function of the system load, the required bit error rate, and the steepness of the required SIR vs. the code rate curve, i.e., the error correction capability of the applied coding codes. The best code rate to maximize the spectral efficiency is further related to the system design parameter E/sub b//N/sub 0/.

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 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.973
Threshold uncertainty score0.453

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.002
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.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.104
GPT teacher head0.302
Teacher spread0.198 · 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

Quick stats

Citations7
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207