Successive bit-vector search algorithm for celp vocoders

Rong San Lin, Jar-Ferr Yang, David Ho

Research output: Contribution to journalArticle

Abstract

In this paper, we propose a successive bit-vector search approach to reduce the computational complexity of coded excited linear predictive coding (CELP) speech coders. By decomposing each codevector into several bit-vectors, the convolution process of the linear predictive coding model can be simplified. With a suggested matching criterion, the proposed method removes a portion of unlikely codevectors in a bit-vector by bit-vector fashion. Theoretical analyses and simulation results show that the proposed search method reduces a lot of the computational load for general codebook searches and maintains nearly the same speech quality as the traditional search approach. The proposed method, which reduces the complexity of the CELP speech coders in VLSI realization, can be flexibly embedded with a simple RISC processor to achieve a low-cost speech coder.

Original languageEnglish
Pages (from-to)261-270
Number of pages10
JournalJournal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an
Volume26
Issue number3
DOIs
Publication statusPublished - 2003 Jan 1

Fingerprint

Vocoders
Speech coding
Reduced instruction set computing
Convolution
Computational complexity
Costs

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

@article{4f2b82dcc62c488a853c0740db8311c4,
title = "Successive bit-vector search algorithm for celp vocoders",
abstract = "In this paper, we propose a successive bit-vector search approach to reduce the computational complexity of coded excited linear predictive coding (CELP) speech coders. By decomposing each codevector into several bit-vectors, the convolution process of the linear predictive coding model can be simplified. With a suggested matching criterion, the proposed method removes a portion of unlikely codevectors in a bit-vector by bit-vector fashion. Theoretical analyses and simulation results show that the proposed search method reduces a lot of the computational load for general codebook searches and maintains nearly the same speech quality as the traditional search approach. The proposed method, which reduces the complexity of the CELP speech coders in VLSI realization, can be flexibly embedded with a simple RISC processor to achieve a low-cost speech coder.",
author = "Lin, {Rong San} and Jar-Ferr Yang and David Ho",
year = "2003",
month = "1",
day = "1",
doi = "10.1080/02533839.2003.9670778",
language = "English",
volume = "26",
pages = "261--270",
journal = "Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers",
issn = "0253-3839",
publisher = "Chinese Institute of Engineers",
number = "3",

}

TY - JOUR

T1 - Successive bit-vector search algorithm for celp vocoders

AU - Lin, Rong San

AU - Yang, Jar-Ferr

AU - Ho, David

PY - 2003/1/1

Y1 - 2003/1/1

N2 - In this paper, we propose a successive bit-vector search approach to reduce the computational complexity of coded excited linear predictive coding (CELP) speech coders. By decomposing each codevector into several bit-vectors, the convolution process of the linear predictive coding model can be simplified. With a suggested matching criterion, the proposed method removes a portion of unlikely codevectors in a bit-vector by bit-vector fashion. Theoretical analyses and simulation results show that the proposed search method reduces a lot of the computational load for general codebook searches and maintains nearly the same speech quality as the traditional search approach. The proposed method, which reduces the complexity of the CELP speech coders in VLSI realization, can be flexibly embedded with a simple RISC processor to achieve a low-cost speech coder.

AB - In this paper, we propose a successive bit-vector search approach to reduce the computational complexity of coded excited linear predictive coding (CELP) speech coders. By decomposing each codevector into several bit-vectors, the convolution process of the linear predictive coding model can be simplified. With a suggested matching criterion, the proposed method removes a portion of unlikely codevectors in a bit-vector by bit-vector fashion. Theoretical analyses and simulation results show that the proposed search method reduces a lot of the computational load for general codebook searches and maintains nearly the same speech quality as the traditional search approach. The proposed method, which reduces the complexity of the CELP speech coders in VLSI realization, can be flexibly embedded with a simple RISC processor to achieve a low-cost speech coder.

UR - http://www.scopus.com/inward/record.url?scp=0038147315&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038147315&partnerID=8YFLogxK

U2 - 10.1080/02533839.2003.9670778

DO - 10.1080/02533839.2003.9670778

M3 - Article

VL - 26

SP - 261

EP - 270

JO - Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers

JF - Chung-kuo Kung Ch'eng Hsueh K'an/Journal of the Chinese Institute of Engineers

SN - 0253-3839

IS - 3

ER -