• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.269-272
• /
• 2010

In this paper, we propose the computation reduction methods of delta pitch search that is used in G.723.1 vocoder. In order to decrease the computational amount in delta pitch search the characteristic of proposed algorithms is as the following. First, scheme to reduce the computation amount in delta pitch search uses NAMDF. Developed the second scheme is the skipping technique of lags in pitch searching by using the threshold value. By doing so, we can reduce the computational amount of pitch searching more than 64% with negligible quality degradation.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06c
• /
• pp.155-158
• /
• 1998

IMBE(Improved Multi-Band Excitation) vocoders exhibit good performance at low data rates. The major drawback to IMBE coders is their large computational requirements. In this paper, thus, we propose a new pitch search method that preserves the quality of the IMBE vocoder with reduced complexity. The basic idea is to reduce computation complexity of the pitch searching by using the SAMDF. Applying the proposed method to the IMBE vocoder, we can get approximately 52.02% searching time reduction in the pitch search. There is no difference in voice quality between conventional IMBE and proposed IMBE.

• Speech Sciences
• /
• v.11 no.3
• /
• pp.165-172
• /
• 2004

In this paper, we propose the computational complexity reduction methods of delta pitch search that is used in G.723.1 vocoder. In order to decrease the computational complexity in delta pitch search the characteristic of proposed algorithms is as the following. First, scheme to reduce the computational complexity in delta pitch search uses NAMDF. Developed the second scheme is the skipping technique of lags in pitch searching by using the threshold value. By doing so, we can reduce the computational amount of pitch searching more than 64% with negligible quality degradation.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.214-217
• /
• 1994

The major drawback in the Code Excited Linear Prediction type vocoders is their large computational requirements. In this paper, a simple method is proposed to reduce the pitch searching time in the pitch filter almost without degradation of quality. On the basis of the observational regularity of the correlation function of speech, only the limited numbers of pitch lags are considered to be an optimum pitch. This is done by skipping the negative envelope side of the correlation function and limiting the maximum number of lags to be considered preliminarily. By doing so, we can reduce the computational time of pitch searching more than 51% with negligible quality degradation. In addition to that, by combining that method with the conventional delta search technique, we can reduce the computational time requirements more than 60% without serious lowering the speech quality in segmental SNR measure compared to the conventional full search method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.7
• /
• pp.3188-3193
• /
• 2012

It is important to search a pitch for vocoder. The major drawback to vocoders is their large computational requirements in searching a pitch and a codebook. In this paper, a simple method is proposed to improve the pitch searching process in the pitch filter almost without degradation of quality. The period of speech signal is emphasized by using Dual Pulse technique, the same type of autocorrelation method, in pitch search. Sometimes the incorrect pitch can be obtained by halving, doubling and trifling, To solve it, before searching a pitch, we estimate energy rate in a frame and compensate envelop of signal with it. By using the proposed algorithm in pitch search, its required computation are reduced and searching pitch is improved.

• Journal of Advanced Navigation Technology
• /
• v.4 no.1
• /
• pp.67-77
• /
• 2000

This paper proposes a reduction scheme for codebook search time in the adaptive codebook using wavelet transformed coefficients. In a CELP coder, pitch estimation with a combined open loop and closed loop search in adaptive codebook needs a lengthy search. More precisely, the pitch search using autocorrelation function over all possible ranges has been shown inefficient compared to the consuming time. In this paper, we propose a new adaptive codebook search algorithm which ensures the same position for the pitch with maximum wavelet coefficient over various scaling factors in Dyadic wavelet transform. A new adaptive codebook search algorithm reduces 25% conventional search time with almost the same quality of speech.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06a
• /
• pp.1104-1111
• /
• 1994

Code Excited Linear Prediction(CELP) as a speech coder exhibits good performance at data rates below 4.8 kbps. The major drawback to CELP type coders is their large amount of computation. In this paper, we propose a new pitch search method that preserves the quality of the CELP vocoder with reduced complexity. The basic idea is to restrict the pitch searching range by estimating the preliminary pitches. Applying the proposed method to the CELP vocoder, we can get approximately 87% complexity reduction in the pitch search.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.2E
• /
• pp.20-25
• /
• 1994

The major drawback to the Code Excited Linear Prediction(CELP) type vocoders is their large computational requirements. In this paper, a simple method is proposed to reduce the pitch searching time in the pitch filter almost without degradation of quality. Bease upon the observational regularity of the correlation function of speech, the searching range can be restricted to the positive side in pitch search. This is done by skipping the negative side with the width which is estimated from the previous positive envelope. In addition to that, the maximum number of available lags can be limited by the threshold, $L_T$, which is set on 58 empirically. So, only the limited numbers of lags are considered in pitch search, which is less than a half of that of the full search method. By using the proposed method in pitch search, its required computations are greatly reduced. Experimental result shows 51% time reduction almost without lowering the speech quality in segmental SNR measure.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.10
• /
• pp.83-88
• /
• 2012

The pitch searching is a very important process in a vocoder. Generally, the method of pitch searching method is used by highlighting the periodicity, where a correlation is identified with the signal by changing the interval of two pulses. When the correlation value is highest, the pitch can be found by the pulse interval because it is the repetition interval with most striking period. There are many methods to solve this problem and search the pitch by dividing a frame into many subframes, but there is too much calculation to solve. A method in this paper is suggested to vary the number of subframes by predicting the amplitude change rate in a frame. If this method is applied, the general pitch searching performance will be improved because the accuracy may be enhanced without affecting the sound quality in the synthesized signal after parameter transmission; and the pitch searching time may be reduced.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.2
• /
• pp.90-94
• /
• 1996

Code Excited Linear Prediction(CELP) vocoder exhibits good performance at data rates below 8 kbps. The major drawback of CELP type coders is a large amount of computation. In this paper, we propose a new pitch searching method that preserves the quality of the CELP vocoder reducing computational complexity. The basic idea is that grasps preliminary pitches using the first formant of speech signal and performs pitch search only about the preliminary pitches. As applying the proposed method to the CELP vocoder, we can reduce complexity by 64% in the pitch search.