MétaCan
Menu
Back to cohort
Record W2154034366 · doi:10.1109/issse.2007.4294444

Reducing Complexity Using Path Selection for Sequential Blind Beamforming for Wireless Communications

2007· article· en· W2154034366 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsInstitut National de la Recherche Scientifique
Fundersnot available
KeywordsComputer scienceBeamformingPath (computing)Selection (genetic algorithm)Integer (computer science)Filter (signal processing)Power (physics)Computational complexity theoryAlgorithmElectronic engineeringReal-time computingTelecommunicationsEngineeringArtificial intelligenceComputer network

Abstract

fetched live from OpenAlex

In this paper, a path selection technique based on power level detection is introduced to our previously proposed MRC-sequential blind beamforming method to reduce the receiver complexity. MRC-SBB mitigates the inter-symbol and intra-symbol interferences by recovering the signal and its integer and non-integer multiple replicas using jointly CMA, LMS and adaptive fractional time-delay-estimation filtering. While the resulting improvement using this method is proportional to the number of the detected paths and also the interpolation filters' complexity, targeting portable applications motivates us to propose a technique to reduce the power consumption while maintaining good performance. Thus, in this paper, a path selection technique based on the paths' power-level detection and digital filter dynamic activation is introduced to significantly reduce the power consumption of the hardware circuits. Simulations in different scenarios using path selection for MRC-SBB were carried out, and the obtained results validate the power consumption efficiency without sacrificing the BER performance.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.734
Threshold uncertainty score0.619

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.144
GPT teacher head0.364
Teacher spread0.220 · 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

Citations3
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207