Sliding-Window Gelfand–Pinsker Coding: General K-User Broadcast Channels

A low-complexity coding scheme, termed as sliding-window Gelfand–Pinsker coding, is proposed. It is shown that in a general K-user broadcast channel, every rate point in the Marton’s inner bound can be achieved using single-user encoders and decoders. The scheme provides us with a low-complexity alternative to implement the conceptual K dimensional multi-coding, which is an irreplaceable component in many important network communication schemes, such as Marton coding in Gaussian MIMO broadcast channels and distributed decode–forward in cloud radio access networks, but has not been adopted in practical systems due to high computational complexity. Key features in the proposed scheme include staggered message scheduling, successive Gelfand–Pinsker coding, and sliding-window decoding.