An upper bound on the quality of artificial bandwidth extension of narrowband speech signals
Jax, Vary
Abstract
Jax, Vary
Abstract
The aim of the artificial bandwidth extension (BWE) of speech signals is to recover wideband speech from bandlimited speech.As the BWE algorithm is supposed to operate without additional side information on the original wideband speech, it has to exploit mutual dependencies between the available and missing frequency bands of the speech signal.In this paper the BWE is examined from an information theoretic perspective.After defining a performance measure, and introducing a few assumptions on a generalized BWE algorithm, a general relationship between mutual information and the maximum achievable estimation performance is formulated, which ensues an upper bound on the performance of BWE algorithms.Finally, some measurements considering a representative BWE scenario are presented. ¥ ©).Consequently, the bandwidth extension of the speech signal is commonly performed separately for the spectral envelope and the excitation of the speech [1], [2] (cp.Fig. 1).It has been found that the spectral envelope is particularly important for the subjective quality of the extended speech (e.g.[2]).analys.filter
OpenAlex reports 26 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.
The aim of the artificial bandwidth extension (BWE) of speech signals is to recover wideband speech from bandlimited speech.As the BWE algorithm is supposed to operate without additional side information on the original wideband speech, it has to exploit mutual dependencies between the available and missing frequency bands of the speech signal.In this paper the BWE is examined from an information theoretic perspective.After defining a performance measure, and introducing a few assumptions on a generalized BWE algorithm, a general relationship between mutual information and the maximum achievable estimation performance is formulated, which ensues an upper bound on the performance of BWE algorithms.Finally, some measurements considering a representative BWE scenario are presented. ¥ ©).Consequently, the bandwidth extension of the speech signal is commonly performed separately for the spectral envelope and the excitation of the speech [1], [2] (cp.Fig. 1).It has been found that the spectral envelope is particularly important for the subjective quality of the extended speech (e.g.[2]).analys.filter
Key concepts: Bandwidth extension, Narrowband, Bandwidth (computing), Computer science, Speech recognition, Upper and lower bounds, Extension (predicate logic), Quality (philosophy)