scholarly journals The Collatz Process Embeds a Base Conversion Algorithm

Author(s):  
Tristan Stérin ◽  
Damien Woods
Keyword(s):  
2020 ◽  
pp. 1-12
Author(s):  
Li Dongmei

English text-to-speech conversion is the key content of modern computer technology research. Its difficulty is that there are large errors in the conversion process of text-to-speech feature recognition, and it is difficult to apply the English text-to-speech conversion algorithm to the system. In order to improve the efficiency of the English text-to-speech conversion, based on the machine learning algorithm, after the original voice waveform is labeled with the pitch, this article modifies the rhythm through PSOLA, and uses the C4.5 algorithm to train a decision tree for judging pronunciation of polyphones. In order to evaluate the performance of pronunciation discrimination method based on part-of-speech rules and HMM-based prosody hierarchy prediction in speech synthesis systems, this study constructed a system model. In addition, the waveform stitching method and PSOLA are used to synthesize the sound. For words whose main stress cannot be discriminated by morphological structure, label learning can be done by machine learning methods. Finally, this study evaluates and analyzes the performance of the algorithm through control experiments. The results show that the algorithm proposed in this paper has good performance and has a certain practical effect.


1986 ◽  
Vol 5 (2) ◽  
pp. 96-105 ◽  
Author(s):  
Min Hwa Lee ◽  
Joo Han Kim ◽  
Song Bai Park

2013 ◽  
Vol 136 (1) ◽  
Author(s):  
David F. Wyatt ◽  
David C. Wynn ◽  
P. John Clarkson

Graph structures are fundamental in many aspects of design. This paper discusses a way to improve access to design spaces of graph structures, by converting graph structures into numerical values and vice versa. Mathematical properties of such conversions are described, and those that are desirable are identified. A candidate conversion algorithm, Indexed Stacked Blocks, is proposed. Its use and benefits are illustrated through an example graph-structure design problem. The example demonstrates that such conversions allow design spaces of graph structures to be visualized, sampled, and evaluated. In principle, they also allow other powerful numerical techniques to be applied to the design of graph-structure-based systems.


1994 ◽  
Author(s):  
Jong-Nae Wang ◽  
Jing-Shin Chang ◽  
Keh-Yih Su
Keyword(s):  

2015 ◽  
Vol 39 (2) ◽  
pp. 231-242 ◽  
Author(s):  
Marek Blok ◽  
Piotr Drózda

Abstract In this paper a sample rate conversion algorithm which allows for continuously changing resampling ratio has been presented. The proposed implementation is based on a variable fractional delay filter which is implemented by means of a Farrow structure. Coefficients of this structure are computed on the basis of fractional delay filters which are designed using the offset window method. The proposed approach allows us to freely change the instantaneous resampling ratio during processing. Using such an algorithm we can simulate recording of audio on magnetic tape with nonuniform velocity as well as remove such distortions. We have demonstrated capabilities of the proposed approach based on the example of speech signal processing with a resampling ratio which was computed on the basis of estimated fundamental frequency of voiced speech segments.


1993 ◽  
Author(s):  
Sos S. Agaian ◽  
Karen O. Egiazarian ◽  
Jaakko T. Astola

Sign in / Sign up

Export Citation Format

Share Document