F. M. J. Willems and F. Casadei, "Weighted coding methods for binary piecewise memoryless sources," Proceedings of 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of the lower bound in [11] Willems implemented two stage mixtures as described above by constructing suitable state diagrams for the second stage mixture. The weight of a transition path in the mixture is hence obtained by state transition weights along the path. The first two schemes ( 16] [18]) take into account all transition paths. In [17] and [18] all transition paths that assume the same most recent transition time are unified into one trellis state. This results in linearly increasing per letter computational complexity, storage complexity of O (N log N) and redundancy of 0:5 (C ....

....mixtures as described above by constructing suitable state diagrams for the second stage mixture. The weight of a transition path in the mixture is hence obtained by state transition weights along the path. The first two schemes ( 16] 18] take into account all transition paths. In [17] and [18] all transition paths that assume the same most recent transition time are unified into one trellis state. This results in linearly increasing per letter computational complexity, storage complexity of O (N log N) and redundancy of 0:5 (C 1) log N=N beyond the lower bound. The second scheme ....

[Article contains additional citation context not shown here]

F. M. J. Willems and F. Casadei, "Weighted coding methods for binary piecewise memoryless sources," Proceedings of 1995 IEEE International Symposium on Information Theory, Canada September 17-22, 1995.

No context found.

F. M. J. Willems and F. Casadei, "Weighted coding methods for binary piecewise memoryless sources," Proceedings of 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC