MétaCan
Menu
Back to cohort
Record W2125995075 · doi:10.1109/vetecf.2004.1400468

Computing partial cancellation factors for PPIC receiver in large CDMA over a fading channel

2005· article· en· W2125995075 on OpenAlexaff
M. Ghotbi, Mohammad Soleymani

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsConcordia University
Fundersnot available
KeywordsSingle antenna interference cancellationFadingCode division multiple accessMultiuser detectionComputer scienceProcess gainEigenvalues and eigenvectorsAlgorithmInterference (communication)Channel (broadcasting)Signal-to-noise ratio (imaging)Spread spectrumTopology (electrical circuits)Electronic engineeringMathematicsTelecommunicationsEngineeringPhysicsCombinatorics

Abstract

fetched live from OpenAlex

In this paper, we introduce a simple, closed-form expression for finding the optimum partial cancellation factors (PCF) for the linear multistage partial parallel interference cancellation (PPIC) receiver. These factors are found in a direct- sequence code division multiple access (DS-CDMA) system over a frequency-flat fading channel for a large-system case. In this case, the number of active users and the processing gain tend to infinity while their ratio is finite. It will be shown that the expression for the PCF is a function of the moments of the eigenvalues of the correlation matrix, the number of interference cancellation (IC) stages, the system load, and the signal-to-noise ratio (SNR). Compared to recently-proposed methods, our method has the following advantages: a) It is less complex because the calculated PCF will be a direct function of the moments of the eigenvalues of the large correlation matrix; b) there is no need for ordering the PCF resulting in lower complexity; and c) it is not necessary to know the number of IC stages ap riori .

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.001
metaresearch head score (Gemma)0.006
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.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0000.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.001

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.049
GPT teacher head0.328
Teacher spread0.280 · 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

Citations0
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207