Stable 1-Norm Error Minimization Based Linear Predictors for Speech Modeling

• Published in: IEEE/ACM transactions on audio, speech, and language processing speech, and language processing, 2014-05, Vol.22 (5), p.912-922
• Main Authors: Giacobello, Daniele, Christensen, Mads Grasboll, Jensen, Tobias Lindstrom, Murthi, Manohar N., Jensen, Soren Holdt, Moonen, Marc
• Format: Article
• Language: English
• Subjects: all-pole modeling; autoregressive modeling; convex optimization; Linear prediction; Methods; Minimization; Numerical stability; Prediction algorithms; Predictive models; sparse linear prediction; Speech; Speech processing; Stability analysis
• ISSN: 2329-9290; 2329-9304
• DOI: 10.1109/TASLP.2014.2311324

In linear prediction of speech, the 1-norm error minimization criterion has been shown to provide a valid alternative to the 2-norm minimization criterion. However, unlike 2-norm minimization, 1-norm minimization does not guarantee the stability of the corresponding all-pole filter and can generate saturations when this is used to synthesize speech. In this paper, we introduce two new methods to obtain intrinsically stable predictors with the 1-norm minimization. The first method is based on constraining the roots of the predictor to lie within the unit circle by reducing the numerical range of the shift operator associated with the particular prediction problem considered. The second method uses the alternative Cauchy bound to impose a convex constraint on the predictor in the 1-norm error minimization. These methods are compared with two existing methods: the Burg method, based on the 1-norm minimization of the forward and backward prediction error, and the iteratively reweighted 2-norm minimization known to converge to the 1-norm minimization with an appropriate selection of weights. The evaluation gives proof of the effectiveness of the new methods, performing as well as unconstrained 1-norm based linear prediction for modeling and coding of speech.