A commonly assumed drawback of multi-level coding, compared to a bit-interleaved coded modulation, is its high latency: Indeed, the levels must be decoded sequentially. In this paper, we consider polar codes to code each level. We show that the decoding time complexity of the multi-level scheme, using successive-cancellation list decoding for each polar code, is only 1.5 times the one of a single polar code, regardless of the signal-to-noise ratio and the number of levels.

翻译：多层次编码的通常假定缺点是其高度延迟:事实上,必须按顺序解码。在本文中,我们考虑将极地编码编码为每一层次。我们表明,多层次办法的解码时间复杂性,使用对每个极代码的连续清除列表解码,只是一个极地编码的1.5倍,而不论信号对噪音的比例和等级的数目。