A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Multiple Access Channel

Research Depth 101 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
448prerequisites beneath it
See this on the map →
Channel CapacityMutual Information+1 more→→Multiple Access Channel Capacity
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_{Sc}) 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

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Angle Pairs: Complementary, Supplementary, and Vertical → Parallel Lines and Transversals → Corresponding Angles → Alternate Interior Angles → Triangle Angle Sum Theorem → Exterior Angle Theorem → Triangle Inequality Theorem → Similar Triangles: AA Similarity → Similar Triangles: SSS and SAS Similarity → Proportions in Similar Triangles → Right Triangle Trigonometry Introduction → Sine, Cosine, and Tangent Ratios → Trigonometric Ratios Review → Radian Measure → Converting Between Degrees and Radians → The Unit Circle → Graphing Sine and Cosine → Graphing Tangent and Reciprocal Trigonometric Functions → Derivatives of Trigonometric Functions → Antiderivatives → Indefinite Integrals → Basic Integration Rules → Riemann Sums → Definite Integral Definition → Probability Density Functions and Continuous Distributions → Cumulative Distribution Functions → Continuous Random Variables → Probability Density Functions → Expected Value → Weak Law of Large Numbers → Probability Axioms and Rules → Conditional Probability → Law of Total Probability → Bayes' Theorem → Joint and Conditional Entropy → Mutual Information → Channel Capacity → Binary Symmetric Channel → Channel Coding Theorem → Network Information Theory → Multiple Access Channel

Longest path: 102 steps · 448 total prerequisite topics

Prerequisites (3)

Leads To (1)