A Fast Searching Method of Algebraic Codebook in ACELP Speech Coding

BAO Chang-chun; DOU Geng-xin; FAN Rui; LIU Ze-xin

doi:10.3969/j.issn.0254-0037.2007.08.008

BAO Chang-chun, DOU Geng-xin, FAN Rui, LIU Ze-xin. A Fast Searching Method of Algebraic Codebook in ACELP Speech Coding[J]. Journal of Beijing University of Technology, 2007, 33(8): 823-827. DOI: 10.3969/j.issn.0254-0037.2007.08.008

Citation:

BAO Chang-chun, DOU Geng-xin, FAN Rui, LIU Ze-xin. A Fast Searching Method of Algebraic Codebook in ACELP Speech Coding[J]. Journal of Beijing University of Technology, 2007, 33(8): 823-827. DOI: 10.3969/j.issn.0254-0037.2007.08.008

Citation:

BAO Chang-chun, DOU Geng-xin, FAN Rui, LIU Ze-xin. A Fast Searching Method of Algebraic Codebook in ACELP Speech Coding[J]. Journal of Beijing University of Technology, 2007, 33(8): 823-827. DOI: 10.3969/j.issn.0254-0037.2007.08.008

A Fast Searching Method of Algebraic Codebook in ACELP Speech Coding

Graphical Abstract

Graphical Abstract

Abstract

Abstract

To reduce the the complexity of algebraic codebook searching,a fast multi-path searching algorithm based on algebra sub-codebook is presented.Experimental results show that the complexity of the proposed method is 1 of 128 of full searching method while the quality of speech coder is not affected.

FullText(HTML)

References (8)

A Fast Searching Method of Algebraic Codebook in ACELP Speech Coding

Graphical Abstract

Abstract

Catalog

Export File

Citation

Format

Content