An application of the bidirectional stack algorithm to speech coding

Abstract

Performance of the bidirectional metric-first tree encoding algorithm is measured on real speech data coded at 1 bps. The main drawback of the unidirectional stack algorithm, variability of its decoding effort as well as decoding erasures, is slightly alleviated. Comparisons, with respect to SNK and time complexity, with unidirectional stack algorithm (SA) and the M-Algorithm (MA) are made. A procedure for nonlinear bidirectional code design, based on SGL algorithm is proposed. © 1999 IEEE.