This paper reviews in a tutorial way channel polarization exploited in successive cancellation decoding of polar codes, focusing on the binary erasure channel. Polarization phenomenon is tackled by decomposing a multi-input multi-output channel into virtual channels and by analyzing the mutual information evolution over each such channel. This evolution is shown to be closely related to the binary representation of the virtual channel index, which allows performing an exact mutual information analysis for each virtual channel via a transformation chart and to analyze eigenformations. A simple performance bound for polar codes, exploiting the above described analysis, is also reviewed.
A Note on Channel Polarization and Mutual Information Transformation Charts of Polar Codes / Chiani M.; Paolini E.. - ELETTRONICO. - (2019), pp. 8893326.1-8893326.6. (Intervento presentato al convegno 111th Annual AEIT International Annual Conference, AEIT 2019 tenutosi a Florence, Italy nel 2019) [10.23919/AEIT.2019.8893326].
A Note on Channel Polarization and Mutual Information Transformation Charts of Polar Codes
Chiani M.;Paolini E.
2019
Abstract
This paper reviews in a tutorial way channel polarization exploited in successive cancellation decoding of polar codes, focusing on the binary erasure channel. Polarization phenomenon is tackled by decomposing a multi-input multi-output channel into virtual channels and by analyzing the mutual information evolution over each such channel. This evolution is shown to be closely related to the binary representation of the virtual channel index, which allows performing an exact mutual information analysis for each virtual channel via a transformation chart and to analyze eigenformations. A simple performance bound for polar codes, exploiting the above described analysis, is also reviewed.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
