MétaCan
Menu
Back to cohort
Record W2340757385 · doi:10.1109/allerton.2015.7447177

Achievable sum-rate of the two-user Gaussian interference channel through rate-splitting and successive decoding

2015· article· en· W2340757385 on OpenAlexaff
Ali Haghi, Amir K. Khandani

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsDecoding methodsSequential decodingList decodingInterference (communication)Computer scienceAlgorithmGaussianChannel (broadcasting)Joint (building)Coding (social sciences)MathematicsTelecommunicationsStatisticsConcatenated error correction codeBlock codePhysicsEngineering

Abstract

fetched live from OpenAlex

Most coding schemes, proposed for the interference channel, take advantage of joint decoding to achieve a larger rate region. However, joint decoding significantly increases decoding complexity. This paper investigates the achievable sum-rate of the two-user Gaussian interference channel when successive decoding is employed instead of joint decoding. First, this study proves that when interference is strong and the powers of the transmitters satisfy certain conditions, the sum-capacity can be achieved by successive decoding. The number of the required splits, the amount of power allocated to each split, and the order of decoding at receivers are explicitly determined. Moreover, the maximum sum-rate loss when simultaneous non-unique decoding is replaced by successive decoding is characterized. Second, it is proved that successive decoding achieves the sum-rate of simultaneous non-unique decoding, when interference is weak and the powers of the transmitters satisfy certain conditions. Rate-splitting is shown to be beneficial, if the powers of the transmitters are greater than a threshold. However, when the powers are below the threshold, still single-split successive decoding can achieve the sum-capacity.

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 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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.622
Threshold uncertainty score0.419

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.037
GPT teacher head0.278
Teacher spread0.242 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
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

Citations4
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Security TechniquesFrench-language works237,207