MétaCan
Menu
Back to cohort
Record W2147224999 · doi:10.1109/tvt.2002.1015317

Soft capacity analysis of TDMA systems with slow-frequency hopping and multiple-beam smart antennas

2002· article· en· W2147224999 on OpenAlex

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

VenueIEEE Transactions on Vehicular Technology · 2002
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsCarleton University
Fundersnot available
KeywordsTime division multiple accessSmart antennaElectronic engineeringWirelessGSMEngineeringPower controlComputer scienceTransmission (telecommunications)Directional antennaAntenna (radio)Computer networkPower (physics)Electrical engineeringTelecommunications

Abstract

fetched live from OpenAlex

Smart antenna is considered as one of the most effective means for enhancing wireless system capacity. When fractional loading is accompanied with slow-frequency hopping (SFH), soft capacity can be realized in time-division multiple access (TDMA) wireless networks. Then, the interference reduction due to smart antennas, power control, and discontinuous transmission can be directly translated into capacity gain. This paper addresses the capacity gain due to multiple-beam (MB) smart antennas in TDMA wireless systems with soft capacity. The system capacity is determined analytically and by simulation. MB smart antennas with practical antenna pattern are used in this study. Perfect power control and discontinuous transmission are assumed in the simulation and the theoretical analysis. A novel call admission control algorithm is proposed to enhance the system capacity without degrading the signal quality. The TDMA system is assumed to be global system for mobile communications (GSM)-like, however, the analysis can be extended and applied to other TDMA systems.

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.000
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.709
Threshold uncertainty score0.736

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0020.004
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.028
GPT teacher head0.232
Teacher spread0.204 · 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