IEICE TRANSACTIONS on Fundamentals
Open Access
Expectation Propagation Decoding for Sparse Superposition Codes
-
Full Text Views
50
- Cite this
- Free PDF (286.5KB)
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E103-A No.12 pp.1666-1669
- Publication Date
- 2020/12/01
- Publicized
- 2020/07/06
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2020EAL2053
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Hiroki MAYUMI
Toyohashi University of Technology
Keigo TAKEUCHI
Toyohashi University of Technology
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroki MAYUMI, Keigo TAKEUCHI, "Expectation Propagation Decoding for Sparse Superposition Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 12, pp. 1666-1669, December 2020, doi: 10.1587/transfun.2020EAL2053.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020EAL2053/_p
Copy
@ARTICLE{e103-a_12_1666,
author={Hiroki MAYUMI, Keigo TAKEUCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Expectation Propagation Decoding for Sparse Superposition Codes},
year={2020},
volume={E103-A},
number={12},
pages={1666-1669},
abstract={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.},
keywords={},
doi={10.1587/transfun.2020EAL2053},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - Expectation Propagation Decoding for Sparse Superposition Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1666
EP - 1669
AU - Hiroki MAYUMI
AU - Keigo TAKEUCHI
PY - 2020
DO - 10.1587/transfun.2020EAL2053
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2020
AB - 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.
ER -
English
