Multiple Access Channel

Research Depth 81 in the knowledge graph I know this Set as goal
Unlocks 1 downstream topic
multiple access MAC multi-user successive decoding capacity region

Core Idea

The multiple access channel (MAC) models K independent senders transmitting to a single receiver over a shared medium. The capacity region — the set of simultaneously achievable rate tuples (R_1, ..., R_K) — is characterized by sum_{i in S} R_i <= I(X_S; Y | X_{S^c}) for all subsets S of senders, where X_S denotes the inputs from senders in S. For two users: R_1 <= I(X_1;Y|X_2), R_2 <= I(X_2;Y|X_1), R_1+R_2 <= I(X_1,X_2;Y). The capacity region is achieved by joint typicality decoding or successive interference cancellation (SIC), where the receiver decodes one user at a time, subtracting each decoded signal. The MAC was the first multi-user channel whose capacity region was fully characterized.

Explainer

The multiple access channel is the canonical uplink model: think of multiple cell phones transmitting to a single base station, or multiple IoT devices sending data to a gateway. Each sender has an independent message and a power constraint. The shared medium means the receiver sees a superposition of all transmitted signals plus noise. The fundamental question is: what rates can all users simultaneously achieve?

For two Gaussian users, Y = X_1 + X_2 + Z. Decoding user 1 first (treating X_2 as additional noise of power P_2): R_1 <= (1/2) log(1 + P_1/(P_2 + N)). After subtracting the decoded X_1, decode user 2 with no interference: R_2 <= (1/2) log(1 + P_2/N). Reversing the order swaps the rates. Time-sharing between the two orders traces the dominant face of the capacity region. The sum-rate boundary R_1 + R_2 <= (1/2) log(1 + (P_1+P_2)/N) is achieved by both orderings.

The key insight is that treating all other users as noise and decoding sequentially (SIC) is optimal — you do not need more sophisticated joint decoding. This is because the MAC is "informationally friendly": each user's signal adds information, not just interference. The receiver decodes one user, removes their contribution from the received signal (since it now knows what they sent), and faces a cleaner signal for the remaining users. This is unlike the interference channel, where each receiver wants only its own message and the other signals are pure interference.

The MAC has direct engineering implications. In 4G/5G uplink, non-orthogonal multiple access (NOMA) schemes use SIC-like receivers to allow users to transmit simultaneously, approaching the MAC capacity region. Traditional orthogonal schemes (TDMA, FDMA, OFDMA) divide the channel among users, which is simple but suboptimal — the capacity region of orthogonal access is strictly inside the MAC capacity region. The information-theoretic result motivates the engineering move toward non-orthogonal schemes that let users "collide" and rely on receiver intelligence to separate them.

Practice Questions 3 questions

Prerequisite Chain

Counting to 10Counting to 20Understanding ZeroThe Number ZeroCounting to FiveOne-to-One CorrespondenceCombining Small Groups Within 5Addition Within 10Addition Within 20Two-Digit Addition Without RegroupingTwo-Digit Addition with RegroupingAddition Within 100Repeated Addition as MultiplicationMultiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Two-Digit by One-Digit DivisionDivision with RemaindersRemainders and Quotients in DivisionDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueReading and Writing DecimalsComparing and Ordering DecimalsAdding and Subtracting DecimalsMultiplying DecimalsDividing DecimalsDividing FractionsMixed Number ArithmeticOrder of OperationsInteger Order of OperationsVariable ExpressionsCombining Like TermsOne-Step EquationsTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesAngle Pairs: Complementary, Supplementary, and VerticalParallel Lines and TransversalsCorresponding AnglesAlternate Interior AnglesTriangle Angle Sum TheoremExterior Angle TheoremTriangle Inequality TheoremSimilar Triangles: AA SimilaritySimilar Triangles: SSS and SAS SimilarityProportions in Similar TrianglesRight Triangle Trigonometry IntroductionTrigonometric Ratios ReviewRadian MeasureConverting Between Degrees and RadiansThe Unit CircleGraphing Sine and CosineGraphing Tangent and Reciprocal Trigonometric FunctionsDerivatives of Trigonometric FunctionsAntiderivativesIndefinite IntegralsBasic Integration RulesRiemann SumsDefinite Integral DefinitionProbability Density Functions and Continuous DistributionsCumulative Distribution FunctionsContinuous Random VariablesProbability Density FunctionsShannon EntropyJoint and Conditional EntropyMutual InformationChannel CapacityBinary Symmetric ChannelChannel Coding TheoremNetwork Information TheoryMultiple Access Channel

Longest path: 82 steps · 333 total prerequisite topics

Prerequisites (3)

Leads To (1)