NDLI: Complexity scalability design in global pulse replacement algorithm for ACELP speech codecs

Content Provider	IEEE Xplore Digital Library
Author	Fu-Kun Chen Bo-Kai Su Yue-Dar Jou
Copyright Year	2009
Description	Author affiliation: Department of Computer Science and Information Engineering, Southern Taiwan University, Taiwan (Fu-Kun Chen; Bo-Kai Su) \|\| Department of Electrical Engineering, ROC Military Academy, Taiwan (Yue-Dar Jou)
Abstract	The algebraic code excited linear prediction (ACELP) algorithm, due to low complexity and high quality in its analysis-by-synthesis (AbS) optimization, has been adopted by many speech coding standards. In this paper, the scalability of computational complexity to the global pulse replacement search method for ACELP is proposed. In addition, the proposed method can achieve the lowest computational complexity with perceptually negligible degradation. Based on the standard subjective and objective quality measurements, the experimental results reflect the facts.
Starting Page	1
Ending Page	4
File Size	188939
Page Count	4
File Format	PDF
ISBN	9781424432974
DOI	10.1109/ICDSP.2009.5201059
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-07-05
Publisher Place	Greece
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Scalability Algorithm design and analysis Speech codecs Computational complexity Prediction algorithms Speech analysis Speech coding Code standards Search methods Degradation complexity scalability ACELP stochastic codebook global pulse replacement
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A proposed fast ACELP codebook search

A fast ACELP codebook search method

Efficient codebook search method for ACELP speech codecs

Dynamic Tree Pruning Method for Fast ACELP Search

Improvement and simulation for the ACELP speech encoding algorithm

Maximum-take-precedence ACELP: a low complexity search method

An efficient fixed codebook search for G.729 speech codec derived from RCM-based search algorithm

Effective complexity reduction in codebook search for ACELP?

Algebraic codebook search strategy for an algebraic code-excited linear-prediction speech coder by means of reduced candidate mechanism and iteration-free pulse replacement

Complexity scalability design in global pulse replacement algorithm for ACELP speech codecs

Similar Documents

A proposed fast ACELP codebook search

A fast ACELP codebook search method

Efficient codebook search method for ACELP speech codecs

Dynamic Tree Pruning Method for Fast ACELP Search

Improvement and simulation for the ACELP speech encoding algorithm

Maximum-take-precedence ACELP: a low complexity search method

An efficient fixed codebook search for G.729 speech codec derived from RCM-based search algorithm

Effective complexity reduction in codebook search for ACELP?

Algebraic codebook search strategy for an algebraic code-excited linear-prediction speech coder by means of reduced candidate mechanism and iteration-free pulse replacement

Complexity scalability design in global pulse replacement algorithm for ACELP speech codecs