Channel distances and representation

The properties of several distance measures for discrete stationary channels with memory are studied. All are based on Ornstein's {if238-1}-random process distance. The strongest of these distances has been employed in a theory concerned with the approximation of {if238-1}-continuous conditionally almost block independent (CABI) channels by primitive and other simple models. Here the approximation with respect to the weaker distances and the equivalence of the weaker distances to the strongest is investigated. In addition, an exact representation of a {if238-3}-continuous CABI channel as an infinite sliding-block coding of the input joined with an I.I.D. noise source is developed.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/23849/1/0000088.pd

Aligning text and phonemes for speech technology applications using an EM-like algorithm

NRC publication: Ye