2019
DOI: 10.1109/tvt.2019.2926229
|View full text |Cite
|
Sign up to set email alerts
|

A New Insight Into GAMP and AMP

Abstract: A concise expectation propagation (EP) based message passing algorithm (MPA) is derived for the general measurement channel. By neglecting some high-order infinitesimal terms, the EP-MPA is proven to be equivalent to the Generalized Approximate Message Passing (GAMP), which exploits central limit theorem and Taylor expansion to simplify the belief propagation process. Furthermore, for additive white gaussian noise measurement channels, EP-MPA is proven to be equivalent to the AMP. Such intrinsic equivalence be… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(15 citation statements)
references
References 28 publications
0
15
0
Order By: Relevance
“…These algorithms require, however, matrix inversion operations unlike the original AMP approach. A rigorous analysis of the convergence property of this approach was presented in [30], [33], and potential connection among different methods was investigated in [34]- [36], with the extension to the bilinear inference method proposed in [37], [38]. Also, it is worth-noting that the Gaussian belief propagation (GaBP) [8] approach can be interpreted as the origin of the aforementioned AMP-based message passing rules.…”
Section: A Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…These algorithms require, however, matrix inversion operations unlike the original AMP approach. A rigorous analysis of the convergence property of this approach was presented in [30], [33], and potential connection among different methods was investigated in [34]- [36], with the extension to the bilinear inference method proposed in [37], [38]. Also, it is worth-noting that the Gaussian belief propagation (GaBP) [8] approach can be interpreted as the origin of the aforementioned AMP-based message passing rules.…”
Section: A Related Workmentioning
confidence: 99%
“…Total number of bits (36) where P 1 e denotes the number of errors due to failure of symbol detection and P 2 e is the number of bits that have been lost due to failure of user detection.…”
Section: Multi-user Detectionmentioning
confidence: 99%
“…3, this message is calculated by integrating the product of the messages propagated from all VNs x q and h q to the FN p(z k,n |h q , x q ) and the function p(z k,n |h q , x q ) over all the VNs in x q and h q . Applying central-limit-theorem (CLT) to the messages gleaned from the FNs p(z q |h q , x q ) to the VNs zq , we can approximate the pseudo a priori probabilities of the noiseless measurements zq by independent Gaussian distributions having the mean vector of pq (t) and the variance vector of ν p q (t) [22]. The pseudo a priori variance vector ν p q (t) of the noiseless measurements zq in the t-th iteration is derived as…”
Section: A Pbigamp-based Frequency-domain Jcee Algorithmmentioning
confidence: 99%
“…Compute ν p q (t) and pq (t) using ( 15) and ( 17). Compute ŝq (t) and ν s q (t) using ( 21) and (22).…”
mentioning
confidence: 99%
“…The authors of [30]- [32] proved that the proposed schemes always converge to the LMMSE performance with low complexity. In [36], concise expectation propagation-based MPA (EP-MPA) was proposed as a way to solve non-linear problems more efficiently compared to the GMP algorithms. On the other hand, there has been active research work based on the AMP methods such as orthogonal AMP (OAMP) [37], vector AMP (VAMP) [38]- [40], and bilinear generalized AMP (BiGAMP) [38], [39], etc.…”
Section: Introductionmentioning
confidence: 99%