MétaCan
Menu
Back to cohort
Record W1999613454 · doi:10.1109/icc.2014.6884126

Sequential Convex Programming for Full-Duplex Single-User MIMO systems

2014· article· en· W1999613454 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
TopicFull-Duplex Wireless Communications
Canadian institutionsMcGill University
Fundersnot available
KeywordsMIMOConvex optimizationMathematical optimizationConvex functionMaximizationRegular polygonLinear matrix inequalityComputer scienceAlgorithmProper convex functionMathematicsMatrix (chemical analysis)Convex combinationBeamformingTelecommunications

Abstract

fetched live from OpenAlex

This paper proposes two Sequential Convex Programming (SCP) algorithms, namely Difference of Convex functions (DC)-based and Sequential Convex Approximations for Matrix-variable Programming (SCAMP), for solving the non-convex matrix-variable sum-rate maximization problem in Full-Duplex (FD) Single-User Multiple-Input-Multiple-Output (SU-MIMO) systems. The two proposed algorithms result in different approximations of the objective function and hence, depending on the environment, one may be favorable than the other. Numerical results show that SCP can significantly increase the sum-rate over existing techniques for the SU-MIMO scenario. In particular, for the SU-MIMO scenario, the DC-based algorithm outperforms the SCAMP.

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.517
Threshold uncertainty score0.857

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.027
GPT teacher head0.237
Teacher spread0.210 · 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

Citations20
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicFull-Duplex Wireless CommunicationsFrench-language works237,207