Double-zipper: multiple access with zigzag decoding

Abstract

As a building block toward a simple and scalable solution to massive random access, we consider two-user multiple access with ZigZag decoding, with no need for any coordination or codebook differentiation. We derive closed-form bounds on the achievable sum-rates of the original ZigZag and a modified version of it, called double-zipper ZigZag, for both cases of perfect and imperfect channel state information (CSI). We also show that performances of both versions of ZigZag approach that of optimal coordinated time-sharing in the high signal to noise ratio regime, even in the presence of CSI errors.