Turbo decoding as an instance of Pearl’s belief propagation algorithm

Turbo decoding as an instance of Pearl’s belief propagation algorithm (1998)

by Robert J. Mceliece , David J. C. Mackay , Jung-fu Cheng

Venue:	IEEE Journal on Selected Areas in Communications
Citations:	247 - 13 self

Datum	Value	Source
TITLE	Turbo decoding as an instance of Pearl’s belief propagation algorithm	INFERENCE
AUTHOR NAME	Robert J. Mceliece	SVM HeaderParse 0.2
AUTHOR NAME	David J. C. Mackay	SVM HeaderParse 0.2
AUTHOR NAME	Jung-fu Cheng	SVM HeaderParse 0.2
ABSTRACT	Abstract—In this paper, we will describe the close connection between the now celebrated iterative turbo decoding algorithm of Berrou et al. and an algorithm that has been well known in the artificial intelligence community for a decade, but which is relatively unknown to information theorists: Pearl’s belief propagation algorithm. We shall see that if Pearl’s algorithm is applied to the “belief network ” of a parallel concatenation of two or more codes, the turbo decoding algorithm immediately results. Unfortunately, however, this belief diagram has loops, and Pearl only proved that his algorithm works when there are no loops, so an explanation of the excellent experimental performance of turbo decoding is still lacking. However, we shall also show that Pearl’s algorithm can be used to routinely derive previously known iterative, but suboptimal, decoding algorithms for a number of other error-control systems, including Gallager’s	SVM HeaderParse 0.2
YEAR	1998	INFERENCE
VENUE	IEEE Journal on Selected Areas in Communications	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	140--152	INFERENCE
VOLUME	16	INFERENCE
CITATIONS	67 found	ParsCit 1.0