The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
An Introduction to factor graphs
Abstract
Graphical models such as factor graphs allow a unified approach to a number of key topics in coding and signal processing such as the iterative decoding of turbo codes, LDPC codes and similar codes, joint decoding, equalization, parameter estimation, hidden-Markov models, Kalman filtering, and recursive least squares. Graphical models can represent complex real-world systems, and such representations help to derive practical detection/estimation algorithms in a wide area of applications. Most known signal processing techniques -including gradient methods, Kalman filtering, and particle methods -can be used as components of such algorithms. Other than most of the previous literature, we have used Forney-style factor graphs, which support hierarchical modeling and are compatible with standard block diagrams.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Berrou, C., Glavieux, A., & Thitimajshima, P. (2002) · Proceedings of ICC '93 - IEEE International Conference on Communications · doi:10.1109/icc.1993.397441 · Cited by 6,738
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 4×
“As mentioned, we will use Forney-style factor graphs (FFGs) rather than the original factor graphs of [24] (cf.”
InfluentialSelf-citationForney, G. D. (1973) · Proceedings of the IEEE · doi:10.1109/proc.1973.9030 · Cited by 5,647
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
Bahl, L., Cocke, J., Jelinek, F., & Raviv, J. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055186 · Cited by 5,208
Optimal decoding of linear codes for minimizing symbol error rate
Bahl, L. R. (1974) · IEEE Transactions on Information Theory · Cited by 4,665
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
Near Shannon limit error-correcting coding and decoding : Turbo-codes
Berrou, C. (1993) · International Conference on Communications · Cited by 4,264
Lauritzen, S. L., & Spiegelhalter, D. J. (1988) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1988.tb01721.x · Cited by 3,902
Good error-correcting codes based on very sparse matrices
MacKay, D. J. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748992 · Cited by 3,684
Probabilistic Reasoning in Intelligent Systems
(1988) · Elsevier eBooks · doi:10.1016/c2009-0-27609-4 · Cited by 3,321
A recursive approach to low complexity codes
Tanner, R. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056404 · Cited by 3,138
Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.850085 · Cited by 1,617
Factorial Hidden Markov Models
Ghahramani, Z., & Jordan, M. I. (1997) · Machine Learning · doi:10.1023/a:1007425814087 · Cited by 1,157
Djuric, P. M., Kotecha, J. H., Zhang, J., Huang, Y., Ghirmai, T., Bugallo, M. F., & Miguez, J. (2003) · IEEE Signal Processing Magazine · doi:10.1109/msp.2003.1236770 · Cited by 965
Generalized Belief Propagation
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2000) · Cited by 918
Codes and Decoding on General Graphs
Wiberg, N. (1996) · Cited by 869
The generalized distributive law
Aji, S. M., & McEliece, R. J. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825794 · Cited by 735
Djurić, P. M., Kotecha, J. H., Zhang, J., Huang, Y., Ghirmai, T., Bugallo, M. F., & Mı́guez, J. (2003) · IEEE Signal Processing Magazine · Cited by 670
Codes on graphs: normal realizations
Forney, G. D. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910573 · Cited by 642
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
Weiss, Y., & Freeman, W. T. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910585 · Cited by 581
Coding theorems for 'turbo-like' codes
Divsalar, D. (1998) · Medical Entomology and Zoology · Cited by 524
Probabilistic Inference and Influence Diagrams
Shachter, R. D. (1988) · Operations Research · doi:10.1287/opre.36.4.589 · Cited by 494
Iterative decoding of compound codes by probability propagation in graphical models
Kschischang, F. R., & Frey, B. J. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661110 · Cited by 388
Tversky, A., & Kahneman, D. (1993) · Readings in Philosophy and Cognitive Science · doi:10.7551/mitpress/5782.003.0006 · Cited by 348
Image Analysis, Random Fields and Markov Chain Monte Carlo Methods
Winkler, G. (2003) · Springer eBooks · doi:10.1007/978-3-642-55760-6 · Cited by 329
Codes and iterative decoding on general graphs
Wiberg, N., Loeliger, H., & Kotter, R. (1995) · European Transactions on Telecommunications · doi:10.1002/ett.4460060507 · Cited by 314
Self-citationFactorial Hidden Markov Models.
Ghahramani, Z., & Jordan, M. I. (1996) · doi:10.21236/ada307097 · Cited by 254
An Introduction to Probabilistic Graphical Models
Larrañaga, P. (2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4615-1539-5_2 · Cited by 182
Shafer, G. R., & Shenoy, P. P. (1990) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531015 · Cited by 179
Probability propagation and decoding in analog VLSI
Loeliger, H.-A., Lustenberger, F., Helfenstein, M., & Tarkoy, F. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910594 · Cited by 158
Self-citationZigzag codes and concatenated zigzag codes
Ping, L., Huang, X., & Phamdo, N. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910590 · Cited by 123
An analysis of belief propagation on the turbo decoding graph with Gaussian densities
Rusmevichientong, P., & Roy, B. V. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910586 · Cited by 82
Graphical Models: Foundations of Neural Computation
Jordan, M. I., & Sejnowski, T. J. (2002) · Pattern Analysis and Applications · doi:10.1007/s100440200036 · Cited by 73
Kschischang, F. R. (2003) · IEEE Communications Magazine · doi:10.1109/mcom.2003.1222727 · Cited by 62
Structured low-density parity-check codes
Moura, J. M. F., Lu, J., & Zhang, H. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1267048 · Cited by 61
Least Squares and Kalman Filtering on Forney Graphs
Loeliger, H.-A. (2002) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4615-0895-3_7 · Cited by 52
Self-citationLow-density parity-check codes for partial response channels
Song, H., & Kumar, B. V. K. V. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1267049 · Cited by 45
On Factor Graphs and the Fourier Transform
Mao, Y., & Kschischang, F. R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.846404 · Cited by 44
Belief Propagation on Partially Ordered Sets
McEliece, R. J., & Yıldırım, M. A. (2003) · The IMA volumes in mathematics and its applications · doi:10.1007/978-0-387-21696-6_10 · Cited by 42
On Factor Graphs and Electrical Networks
Vontobel, P. O., & Loeliger, H. (2003) · The IMA volumes in mathematics and its applications · doi:10.1007/978-0-387-21696-6_16 · Cited by 26
Self-citationLoeliger, H. (n.d.) · Cited by 25
Self-citationOn Structured-Summary Propagation, LFSR Synchronization, and Low-Complexity Trellis Decoding
Dauwels, J., Loeliger, H., Merkli, P., & Ostojic, M. (2003) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 8
Self-citation
Cited by
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981851 · Cited by 2,959
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2008) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000001 · Cited by 1,820
A survey of uncertainty in deep neural networks
Gawlikowski, J., Tassi, C. R. N., Ali, M., Lee, J., Humt, M., Feng, J., Kruspe, A., Triebel, R., Jung, P., Roscher, R., et al. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10562-9 · Cited by 1,406
Cooperative Localization in Wireless Networks
Wymeersch, H., Lien, J., & Win, M. Z. (2009) · Proceedings of the IEEE · doi:10.1109/jproc.2008.2008853 · Cited by 1,182
Simulation-Based Computation of Information Rates for Channels With Memory
Arnold, D. M., Loeliger, H.-A., Vontobel, P. O., Kavcic, A., & Zeng, W. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.878110 · Cited by 563
Self-citation
Metadata
- Authors
- Loeliger, H.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2004-01
- Volume
- 21
- Issue
- 1
- Pages
- 28-41
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W2150859678
- Cited by
- 905
- References
- 44
- FWCI
- 40.84
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.