Expectation Propagation Decoding for Sparse Superposition Codes

Hiroki MAYUMI; Keigo TAKEUCHI

doi:10.1587/transfun.2020EAL2053

この記事には本公開記事があります。本公開記事を参照してください。
引用する場合も本公開記事を引用してください。

Expectation Propagation Decoding for Sparse Superposition Codes

著者情報

キーワード: Sparse superposition codes, orthogonal frequency division multiplexing (OFDM), discrete Fourier transform (DFT) dictionary, approximate message-passing, expectation propagation

ジャーナル認証あり早期公開

論文ID: 2020EAL2053

DOI https://doi.org/10.1587/transfun.2020EAL2053

この記事には本公開記事があります。

The final version of this article is now available: Vol. E103.A (2020), No. 12 pp. 1666-1669

詳細

抄録

Expectation propagation (EP) decoding is proposed for sparse superposition coding in orthogonal frequency division multiplexing (OFDM) systems. When a randomized discrete Fourier transform (DFT) dictionary matrix is used, the EP decoding has the same complexity as approximate message-passing (AMP) decoding, which is a low-complexity and powerful decoding algorithm for the additive white Gaussian noise (AWGN) channel. Numerical simulations show that the EP decoding achieves comparable performance to AMP decoding for the AWGN channel. For OFDM systems, on the other hand, the EP decoding is much superior to the AMP decoding while the AMP decoding has an error-floor in high signal-to-noise ratio regime.

責任著者(Corresponding author)

J-STAGEへの登録はこちら（無料）