Fetching the paper…
Reading the bibliography…
Many important schemes in signal processing and communications, ranging from the BCJR algorithm to the Kalman filter, are instances of factor graph methods.
G. D. Forney, “The Viterbi algorithm,” Proceedings of the IEEE , vol. 61, no. 3, pp. 268–278, 1973
1973
Earlier work this paper cites.
L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inf. Theory , vol. 20, no. 2, pp. 284–287, 1974
1974
Earlier work this paper cites.
J. Pearl, “Fusion, propagation, and structuring in belief networks,” Artificial intelligence , vol. 29, no. 3, pp. 241–288, 1986
1986
Earlier work this paper cites.
N. Wiberg, H.-A. Loeliger, and R. Kotter, “Codes and iterative decoding on general graphs,” European Transactions on telecommunications , vol. 6, no. 5, pp. 513–525, 1995
1995
Earlier work this paper cites.
W.-J. Choi, K.-W. Cheong, and J. M. Cioffi, “Iterative soft interference cancellation for multiple antenna systems.” in Proc. WCNC , 2000, pp. 304–309
2000
Earlier work this paper cites.
G. D. Forney, “Codes on graphs: Normal realizations,” IEEE Trans. Inf. Theory , vol. 47, no. 2, pp. 520–548, 2001
2001
Earlier work this paper cites.
F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Trans. Inf. Theory , vol. 47, no. 2, pp. 498–519, 2001
2001
Earlier work this paper cites.
Y. Weiss and W. T. Freeman, “On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs,” IEEE Trans. Inf. Theory , vol. 47, no. 2, pp. 736–744, 2001
2001
Earlier work this paper cites.
H.-A. Loeliger, “Least squares and Kalman filtering on Forney graphs,” in Codes, Graphs, and Systems . Springer, 2002, pp. 113–135
2002
Earlier work this paper cites.
H.-A. Loeliger, “An introduction to factor graphs,” IEEE Signal Process. Mag. , vol. 21, no. 1, pp. 28–41, 2004
2004
Earlier work this paper cites.
M. I. Jordan, “Graphical models,” Statistical Science , vol. 19, no. 1, pp. 140–155, 2004
2004
Cited alongside, same era.
G. McLachlan and D. Peel, Finite mixture models . John Wiley & Sons, 2004
2004
Cited alongside, same era.
G. Colavolpe and G. Germi, “On the application of factor graphs and the sum-product algorithm to ISI channels,” IEEE Trans. Commun. , vol. 53, no. 5, pp. 818–825, 2005
2005
Cited alongside, same era.
H. Niu, M. Shen, J. A. Ritcey, and H. Liu, “A factor graph approach to iterative channel estimation and ldpc decoding over fading channels,” IEEE Trans. Wireless Commun. , vol. 4, no. 4, pp. 1345–1350, 2005
2005
Cited alongside, same era.
H.-A. Loeliger, J. Dauwels, J. Hu, S. Korl, L. Ping, and F. R. Kschischang, “The factor graph approach to model-based signal processing,” Proceedings of the IEEE , vol. 95, no. 6, pp. 1295–1322, 2007
2014
Later among the works it cites.
Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” nature , vol. 521, no. 7553, p. 436, 2015
2015
Later among the works it cites.
F. Lehmann, “A factor graph approach to iterative channel estimation, detection, and decoding for two-path successive relay networks,” IEEE Trans. Wireless Commun. , vol. 15, no. 8, pp. 5414–5429, 2016
2016
Later among the works it cites.
N. Farsad and A. Goldsmith, “Neural network detection of data sequences in communication systems,” IEEE Trans. Signal Process. , vol. 66, no. 21, pp. 5663–5678, 2018
2018
Later among the works it cites.
L. Lugosch and W. J. Gross, “Learning from the syndrome,” in 2018 52nd Asilomar Conference on Signals, Systems, and Computers . IEEE, 2018, pp. 594–598
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2007
Cited alongside, same era.
R. J. Drost and A. C. Singer, “Factor-graph algorithms for equalization,” IEEE Trans. Signal Process. , vol. 55, no. 5, pp. 2052–2065, 2007
2007
Cited alongside, same era.
J. M. Cioffi, “Sequence detection,” EE379B Course notes chapter 9. Stanford University , 2008
2008
Cited alongside, same era.
Y. Bengio, “Learning deep architectures for AI,” Foundations and trends® in Machine Learning , vol. 2, no. 1, pp. 1–127, 2009
2009
Cited alongside, same era.
E. Dahlman, S. Parkvall, J. Skold, and P. Beming, 3G evolution: HSPA and LTE for mobile broadband . Academic press, 2010
2010
Cited alongside, same era.
P. Som, T. Datta, N. Srinidhi, A. Chockalingam, and B. S. Rajan, “Low-complexity detection in large-dimension mimo-isi channels using graphical models,” IEEE J. Sel. Topics Signal Process. , vol. 5, no. 8, pp. 1497–1511, 2011
2011
Cited alongside, same era.
2018
Later among the works it cites.
B. Laufer-Goldshtein, R. Talmon, and S. Gannot, “A hybrid approach for speaker tracking based on tdoa and data-driven models,” IEEE/ACM Trans. Audio, Speech, Language Process. , vol. 26, no. 4, pp. 725–735, 2018
2018
Later among the works it cites.
N. Shlezinger, N. Farsad, Y. C. Eldar, and A. J. Goldsmith, “ViterbiNet: A deep learning based Viterbi algorithm for symbol detection,” IEEE Trans. Wireless Commun., early access , 2019
2019
Later among the works it cites.
N. Shlezinger, R. Fu, and Y. C. Eldar, “DeepSIC: Deep soft interference cancellation for multiuser MIMO detection,” Submitted to IEEE J. Sel. A. Inform. Theory , 2019
2019
Later among the works it cites.