Polar coding for interference networks

TL;DR

This paper introduces a polar coding scheme for interference networks that combines existing methods to achieve optimal bounds and generalizes to complex network scenarios.

Contribution

It presents a novel polar coding scheme that aligns polarization processes and achieves the Han--Kobayashi inner bound for interference channels.

Findings

Achieves Han--Kobayashi inner bound for two-user interference channels

Generalizes polar coding to interference networks

Combines monotone chain rules with polarization alignment methods

Abstract

A polar coding scheme for interference networks is introduced. The scheme combines Arikan's monotone chain rules for multiple-access channels and a method by Hassani and Urbanke to 'align' two incompatible polarization processes. It achieves the Han--Kobayashi inner bound for two-user interference channels and generalizes to interference networks.