One Effective Method to Design LBG Initial Codebook
Yanxia Liang, Jiawei Yang, Ye Li
Abstract
Yanxia Liang, Jiawei Yang, Ye Li
Abstract
LBG algorithm is commonly used in multidimensional signal processing. It's one of the most effective methods to generate codebooks. Better initial codebook of LBG algorithm leads to better quality of final codebook. In order to find one effective method to design LBG initial codebook, four design methods of initial codebook for LBG algorithm are compared, including Random method, Splitting method, Most-Dispersed Code words Initialization (MDCI) and Greedy Tree Growing Algorithm (GTGA). The codebooks after LBG algorithm are used to quantize Line Spectral Frequency (LSF) coefficients in speech coding. Simulation by C programming language demonstrates that GTGA is optimal. Because it executes within a sShort span of HtimeH, and both the number of iteration times and run time are close to by splitting method in LBG algorithm. Moreover MSE is minor and Average Spectral Distortion is small.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
LBG algorithm is commonly used in multidimensional signal processing. It's one of the most effective methods to generate codebooks. Better initial codebook of LBG algorithm leads to better quality of final codebook. In order to find one effective method to design LBG initial codebook, four design methods of initial codebook for LBG algorithm are compared, including Random method, Splitting method, Most-Dispersed Code words Initialization (MDCI) and Greedy Tree Growing Algorithm (GTGA). The codebooks after LBG algorithm are used to quantize Line Spectral Frequency (LSF) coefficients in speech coding. Simulation by C programming language demonstrates that GTGA is optimal. Because it executes within a sShort span of HtimeH, and both the number of iteration times and run time are close to by splitting method in LBG algorithm. Moreover MSE is minor and Average Spectral Distortion is small.
Key concepts: Codebook, Linde–Buzo–Gray algorithm, Algorithm, Initialization, Computer science, Coding (social sciences), Mathematics, Mathematical optimization