Expectation Propagation on Factor Graphs Based on Matrix Decomposition
Open Access
- 4 June 2023
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
In the context of the Gaussian linear model, recent works have studied factor graph modification using QR decomposition that enables the derivation of scalar Expectation Propagation (EP) based detectors. In this paper, we investigate on new factor graph representations induced by the use of the Golub-Kahan bi-diagonal Decomposition (GKD) and of the Singular Value Decomposition (SVD). New EP messages induced by the GKD or SVD underlying graphs are derived, that can be both scalar or vector messages. Complexity and performance of the resulting algorithms are studied for digital communications applications.Keywords
This publication has 13 references indexed in Scilit:
- Efficient EP Detectors Based on Channel Sparsification for Massive MIMO SystemsIEEE Communications Letters, 2019
- Iterative Equalization Based on Expectation Propagation: A Frequency Domain Approach2018
- A Framework for Iterative Frequency Domain EP-Based Receiver DesignIEEE Transactions on Communications, 2018
- Vector approximate message passing for the generalized linear model2016
- Expectation Propagation as Turbo Equalizer in ISI ChannelsIEEE Transactions on Communications, 2016
- QR decomposition aided belief propagation detector for MIMO systemsElectronics Letters, 2015
- Low-Complexity Iterative Detection for Large-Scale Multiuser MIMO-OFDM Systems Using Approximate Message PassingIEEE Journal of Selected Topics in Signal Processing, 2014
- Large MIMO Systems2013
- How the Framework of Expectation Propagation Yields an Iterative IC-LMMSE MIMO Receiver2011
- Generalized approximate message passing for estimation with random linear mixing2011