1994
DOI: 10.1002/ett.4460050508
|View full text |Cite
|
Sign up to set email alerts
|

The RCELP speech‐coding algorithm

Abstract: At bit rates between 4 and 16 kbit/s, many state‐of‐the‐art speech coding algorithms fall into the class of linear‐prediction based analysis‐by‐synthesis (LPAS) speech coders. At the lower bit rates the waveform‐matching, on which LPAS coders rely, constrains the speech quality. To overcome this drawback, we present a coder (RCELP) that uses a generalization of the analysis‐by‐synthesis paradigm. This generalization relaxes the waveform‐matching constraints without affecting speech quality. We describe several… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1995
1995
2022
2022

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 32 publications
(1 citation statement)
references
References 16 publications
0
1
0
Order By: Relevance
“…Speech compression aims to reduce the bitrate required to represent a speech signal. In classical coding methods [1][2][3][4][5][6][7], all processing was based on knowledge of human experts only. Recent advances in speech coding follow progress in speech synthesis [8][9][10] by replacing the decoder [11][12][13] as well as the quantizer [14] with a machine-learning (ML) based model that significantly improves the coding quality.…”
Section: Introductionmentioning
confidence: 99%
“…Speech compression aims to reduce the bitrate required to represent a speech signal. In classical coding methods [1][2][3][4][5][6][7], all processing was based on knowledge of human experts only. Recent advances in speech coding follow progress in speech synthesis [8][9][10] by replacing the decoder [11][12][13] as well as the quantizer [14] with a machine-learning (ML) based model that significantly improves the coding quality.…”
Section: Introductionmentioning
confidence: 99%