Pith. sign in

REVIEW

Simple Bounds for the Symmetric Capacity of the Rayleigh Fading Multiple Access Channel

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 1905.09486 v3 pith:ZMFNWTQ3 submitted 2019-05-23 cs.IT math.IT

classification cs.ITmath.IT
keywords capacitychannelboundscommunicationconsideredprotocolratesymmetric
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Communication over the i.i.d. Rayleigh slow-fading MAC is considered, where all terminals are equipped with a single antenna. Further, a communication protocol is considered where all users transmit at (just below) the symmetric capacity (per user) of the channel, a rate which is fed back (dictated) to the users by the base station. Tight bounds are established on the distribution of the rate attained by the protocol. In particular, these bounds characterize the probability that the dominant face of the MAC capacity region contains a symmetric rate point, i.e., that the considered protocol strictly attains the sum capacity of the channel. The analysis provides a non-asymptotic counterpart to the diversity-multiplexing tradeoff of the multiple access channel. Finally, a practical scheme based on integer-forcing and space-time precoding is shown to be an effective coding architecture for this communication scenario.

Discussion (0). Continue with ORCID to comment.

Pith tools