FACTOR GRAPHS and DECODING

References

[1] Frank R. Kschischang, Brendan J. Frey, and Hans-Andrea Loeliger. Factor graphs and the sum-product algorithm. Submitted to IEEE Trans. on Inf. Theory, available from http://www.comm.utoronto.ca/frank/factor, 1998.

[2] Niclas Wiberg, Hans-Andrea Loeliger, and Ralf Koetter. Codes and iterative decoding on general graphs. In Europ. Trans. on Telecommunication, volume 6, pages 513-525, September/October 1995.

[3] Niclas Wiberg. Codes and Decoding On General Graphs. PhD thesis, Linköping University, Sweden, 1996.

[4] A. Robert Calderbank, G. David Forney, Jr., and Alexander Vardy. Minimal tail-biting trellises: The Golay code and more. In Proc. IEEE Intern. Symp. on Inform. Theory, 1998.

[5] A. Robert Calderbank, G. David Forney, Jr., and Alexander Vardy. Minimal tail-biting trellises: The Golay code and more. Submitted to IEEE Trans. on Inform. Theory, 1998.

[6] G. David Forney, Jr. The forward-backward algorithm. In Proc. 34th Allerton Conf. on Comm., Control, and Computing, pages 432-446, Allerton House, Monticello, illinois, Oct. 2-4, 1996.

[7] G. David Forney, Jr. Generalized state realizations of Reed-Muller codes. Internal report, Jan. 4, 1999.

[8] R. Michael Tanner. Codes with sparse graphs: Transform analysis and constructions. In Proc. IEEE Int. Symp. on Inform. Theory, page 116, Cambridge, MA, USA, Aug. 16-21, 1998.

[9] R. Michael Tanner. A transform theory for a class of group-invariant codes. In IEEE Trans. on Inform. theory, volume 34, pages 752-775, July 1988.

[10] R. Michael Tanner. A recursive apporach to low complexity codes. In IEEE Trans. on Inform. Theory, volume 27, pages 533-547, September 1981.

[11] Hans-Andrea Loeliger, Felix Lustenberger, Markus Helfenstein, and Felix Tarkoey. Probability propagation in analog VLSI. Technical Report 9803, Laboratory for Signal and Information Processing, ETH Zuerich, Mar. 13, 1998.

[12] F. Lustenberger, M. Helfenstein, H.-A. Loeliger, F. Tarkoey, and G.S. Moschytz. An analog VLSI decoding technique for digital codes. To appear in Proceedings of the 1999 Int. Symp. Circuits and Systems.

[13] J.B. Anderson, and S.M. Hladik. Tailbiting MAP decoders. In IEEE J. Selected Areas in Comm., volume 16, pages 297-302, Feb. 1998.

[14] S.M. Aji, G.B. Horn, and R.J. McEliece. Iterative decoding on graphs with a single cycle. In Proceedings of the 1998 Int. Symp. Inform. Theory, page 276, MIT, Cambridge, MA, USA, Aug. 16-21 1998.

Written by Stefan M. Moser <stmoser@stud.NOSPAM.ee.ethz.ch> (remove NOSPAM from email-address!)

Last modified: Wed Aug 20 16:03:41 MEST 2003

[1]	Frank R. Kschischang, Brendan J. Frey, and Hans-Andrea Loeliger. Factor graphs and the sum-product algorithm. Submitted to IEEE Trans. on Inf. Theory, available from `http://www.comm.utoronto.ca/frank/factor`, 1998.
[2]	Niclas Wiberg, Hans-Andrea Loeliger, and Ralf Koetter. Codes and iterative decoding on general graphs. In Europ. Trans. on Telecommunication, volume 6, pages 513-525, September/October 1995.
[3]	Niclas Wiberg. Codes and Decoding On General Graphs. PhD thesis, Linköping University, Sweden, 1996.
[4]	A. Robert Calderbank, G. David Forney, Jr., and Alexander Vardy. Minimal tail-biting trellises: The Golay code and more. In Proc. IEEE Intern. Symp. on Inform. Theory, 1998.
[5]	A. Robert Calderbank, G. David Forney, Jr., and Alexander Vardy. Minimal tail-biting trellises: The Golay code and more. Submitted to IEEE Trans. on Inform. Theory, 1998.
[6]	G. David Forney, Jr. The forward-backward algorithm. In Proc. 34th Allerton Conf. on Comm., Control, and Computing, pages 432-446, Allerton House, Monticello, illinois, Oct. 2-4, 1996.
[7]	G. David Forney, Jr. Generalized state realizations of Reed-Muller codes. Internal report, Jan. 4, 1999.
[8]	R. Michael Tanner. Codes with sparse graphs: Transform analysis and constructions. In Proc. IEEE Int. Symp. on Inform. Theory, page 116, Cambridge, MA, USA, Aug. 16-21, 1998.
[9]	R. Michael Tanner. A transform theory for a class of group-invariant codes. In IEEE Trans. on Inform. theory, volume 34, pages 752-775, July 1988.
[10]	R. Michael Tanner. A recursive apporach to low complexity codes. In IEEE Trans. on Inform. Theory, volume 27, pages 533-547, September 1981.
[11]	Hans-Andrea Loeliger, Felix Lustenberger, Markus Helfenstein, and Felix Tarkoey. Probability propagation in analog VLSI. Technical Report 9803, Laboratory for Signal and Information Processing, ETH Zuerich, Mar. 13, 1998.
[12]	F. Lustenberger, M. Helfenstein, H.-A. Loeliger, F. Tarkoey, and G.S. Moschytz. An analog VLSI decoding technique for digital codes. To appear in Proceedings of the 1999 Int. Symp. Circuits and Systems.
[13]	J.B. Anderson, and S.M. Hladik. Tailbiting MAP decoders. In IEEE J. Selected Areas in Comm., volume 16, pages 297-302, Feb. 1998.
[14]	S.M. Aji, G.B. Horn, and R.J. McEliece. Iterative decoding on graphs with a single cycle. In Proceedings of the 1998 Int. Symp. Inform. Theory, page 276, MIT, Cambridge, MA, USA, Aug. 16-21 1998.