DocumentCode
3284933
Title
On the information rate of binary-input channels with memory
Author
Arnold, D. ; Loeliger, H.-A.
Author_Institution
IBM Res. Div., Zurich, Switzerland
Volume
9
fYear
2001
fDate
2001
Firstpage
2692
Abstract
The entropy rate of a finite-state hidden Markov model can be estimated by forward sum-product trellis processing (i.e., the forward recursion of the Baum-Welch/BCJR algorithm) of simulated model output data. This can be used to compute information rates of binary-input AWGN channels with memory
Keywords
AWGN channels; digital magnetic recording; entropy; finite state machines; hidden Markov models; partial response channels; Baum-Welch/BCJR algorithm; binary-input AWGN channels; binary-input channels; entropy rate; finite-state hidden Markov model; forward recursion; forward sum-product trellis processing; information rate; simulated model output data; AWGN channels; Additive white noise; Computational modeling; Electronic mail; Entropy; Hidden Markov models; Information rates; Magnetic recording; Mutual information; Recursive estimation;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2001. ICC 2001. IEEE International Conference on
Conference_Location
Helsinki
Print_ISBN
0-7803-7097-1
Type
conf
DOI
10.1109/ICC.2001.936639
Filename
936639
Link To Document