TY - GEN A1 - Sadeh, Ilan A1 - Keizelman, Alexander A1 - Zak, Michael A2 - Korbicz, Józef - red. A2 - Uciński, Dariusz - red. PB - Zielona Góra: Uniwersytet Zielonogórski N2 - Two practical voice-coding schemes based on approximate string matching are proposed. The first one is an approximate fixed-length string-matching data compression, and the other is a Lempel-Ziv-type quasi-parsing method by approximate string matching. The performance of the two algorithms and their sub-optimal versions are evaluated. The main advantages of the proposed methods are the asymptotic sequential behaviour of the encoder and the simplicity of the decoder. In particular, a sub-optimal tree-structure algorithm is proposed and its real-time advantages are demonstrated. L1 - http://www.zbc.uz.zgora.pl/Content/57832/AMCS_1997_7_3_10.pdf L2 - http://www.zbc.uz.zgora.pl/Content/57832 KW - sterowanie KW - sterowanie-teoria KW - sztuczna inteligencja KW - matematyka stosowana KW - informatyka T1 - Universal voice compression algorithms based on approximate string matching UR - http://www.zbc.uz.zgora.pl/dlibra/docmetadata?id=57832 ER -