Pith. sign in

REVIEW 1 cited by

Coded Water-Filling for Multi-User Interference Cancellation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.14136 v1 pith:YQ2XNYZB submitted 2024-10-18 cs.IT math.IT

Coded Water-Filling for Multi-User Interference Cancellation

classification cs.IT math.IT
keywords water-fillingcancellationcodedinterferencecapacitymulti-userallocationearly
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

In this paper, we study the system-level advantages provided by rateless coding, early termination and power allocation strategy for multiple users distributed across multiple cells. In a multi-cell scenario, the early termination of coded transmission not only reduces finite-length loss akin to the single-user scenario but also yields capacity enhancements due to the cancellation of interference across cells. We term this technique \emph{coded water-filling}, a concept that diverges from traditional water-filling by incorporating variable-length rateless coding and interference cancellation. We formulate a series of analytical models to quantify the gains associated with coded water-filling in multi-user scenarios. First, we analyze the capacity gains from interference cancellation in Additive White Gaussian Noise (AWGN) channels, which arises from the disparity in the number of bits transmitted by distinct users. Building upon this, we broaden our analysis to encompass fading channels to show the robustness of the interference cancellation algorithms. Finally, we address the power allocation problem analogous to the water-filling problem under a multi-user framework, proving that an elevation in the water-filling threshold facilitates overall system capacity enhancement. Our analysis reveals the capacity gains achievable through early termination and power allocation techniques in multi-user settings. These results show that coded water-filling is instrumental for further improving spectral efficiency in crowded spectrums.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Adversarial Water-Filling: Theory, Algorithms and Foundation Model

    cs.IT 2026-05 unverdicted novelty 7.0

    Adversarial Water-Filling formulates competitive spectrum sharing as a constrained minimax problem and introduces a permutation-invariant GNN foundation model that approximates its stationary solutions with local line...