MétaCan
Menu
Back to cohort
Record W2138034872 · doi:10.1109/iccs.2006.301492

Performance Analysis of RAKE Receivers with Finger Reassignment

2006· article· en· W2138034872 on OpenAlexaff
Seyeong Choi, Mohamed‐Slim Alouini, Khalid Qaraqe, Hong‐Chuan Yang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsRakeComputer scienceOverhead (engineering)Diversity combiningRake receiverBase stationAlgorithmSignal-to-noise ratio (imaging)HandoverOrder statisticPath (computing)Real-time computingTelecommunicationsStatisticsFadingDecoding methodsComputer networkMathematicsEngineering

Abstract

fetched live from OpenAlex

We propose and analyze in this paper a new finger assignment technique that is applicable for RAKE receivers when they operate in the soft handover (SHO) region. This scheme employs a new version of generalized selection combining (GSC). More specifically, in the SHO region, the receiver uses by default only the strongest paths from the serving base station (BS) and only when the combined signal-to-noise ratio (SNR) falls below a certain pre-determined threshold, the receiver uses more resolvable paths from the target BS to improve the performance. Hence, relying on some recent results on order statistics we attack the statistics of two correlated GSC stages and provide the closed-form expressions for the statistics of the output SNR. By investigating the tradeoff among the error performance, the path estimation load, and the SHO overhead, we show through numerical examples that the new scheme offers commensurate performance in comparison with more complicated GSC-based diversity systems while requiring a smaller estimation load and SHO overhead

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.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.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.004
GPT teacher head0.181
Teacher spread0.177 · 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
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Communication TechniquesFrench-language works237,207