Polar coding for bidirectional broadcast channel with non-binary output alphabets

Mao‐Ching Chiu

Ido Tal, Artyom Sharov, Alexander Vardy

Consider a channel with an input alphabet that is finite but not necessarily binary. A method for approximating such a channel having a large output alphabet size by a degraded version of it having a smaller output alphabet size is presented and analyzed. The approximation method is used to construct polar codes for both single-user and multiple-access channels with prime input alphabet sizes.

Chen Yi-Ru, Huang–Chang Lee, Lin Mao-Chao

Arash Ghayoori, Thomas Aaron Gulliver

An algorithm is presented for approximating a single-user channel with a prime input alphabet size. The result is an upgraded version of the channel with a reduced output alphabet size. It is shown that this algorithm can be used to reduce the output alphabet size to the input alphabet size in most cases.

Koji Tazoe, Kenta Kasai, Kohichi Sakaniwa

We study LDPC codes for the channel with input x ∈ Fqmand output y = x + z ∈ Fqm. The aim of this paper is to evaluate decoding performance of qm-ary non-binary LDPC codes for large m. We give density evolution and decoding performance evaluation for regular non-binary LDPC codes and spatially-coupled (SC) codes. We show the regular codes do not achieve the capacity of the channel while SC codes do.

Dongsheng Wu, Qingshuang Zhang, Yingxian Zhang