MétaCan
Menu
Back to cohort
Record W1596993109 · doi:10.1109/ccece.2015.7129420

Design of adaptive antenna systems for LTE using Genetic Algorithm and Particle Swarm Optimization

2015· article· en· W1596993109 on OpenAlexaff
Naga Raghavendra Surya Vara Prasad Koppisetti, Shankhanaad Mallick, Vijay K. Bhargava

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsParticle swarm optimizationComputer scienceMathematical optimizationThroughputGenetic algorithmAntenna (radio)Interference (communication)Optimization problemPower (physics)Resource allocationAlgorithmComputer networkMathematicsTelecommunicationsWireless

Abstract

fetched live from OpenAlex

This paper presents design and performance evaluation of an intelligent adaptive antenna system for LTE networks. The design is based on a resource optimization problem, which adjusts the antenna gains of LTE eNodeBs in a geographic area. By adaptively changing the cellular coverage patterns of eNodeBs, our proposed design maximizes the network coverage and capacity while minimizing the total transmission power and inter-cell interference. The resource optimization problem is multi-objective and is very difficult to solve optimally, if possible. First, the solution of the problem is obtained using Genetic Algorithm. Then a faster converging Particle Swarm Optimization approach is proposed. System level simulations for LTE are conducted to evaluate the performance of our proposed schemes. Numerical results show significant performance improvement in terms of coverage, system throughput, and power minimization with respect to the existing fixed antenna gain schemes in LTE.

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.000
metaresearch head score (Gemma)0.001
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: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0010.000
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0010.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.076
GPT teacher head0.275
Teacher spread0.200 · 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
GenreMethods

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
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Communication TechniquesFrench-language works237,207