This letter proposes a robust polynomial-decompo- sition-based linear prediction coding algorithm, PDLPC, for formant estimation, which can effectively eliminate merger peaks. PDLPC first combines LPC with statistical...
详细信息
This letter proposes a robust polynomial-decompo- sition-based linear prediction coding algorithm, PDLPC, for formant estimation, which can effectively eliminate merger peaks. PDLPC first combines LPC with statistical analysis to obtain the peak and suspicious merger peak screening criteria;then uses Cauchy integral formula to calculate the number of poles located in the fan-shaped area near the suspicious merger peak to determine whether the merger peak occurs;finally, utilizes division algorithm for polynomial to separate those merger peaks. The evaluations on Primi and VTR show that PDLPC is effective in separating merger peaks, and has certain competitiveness compared with some existing formant estimation algorithms.
暂无评论