text: fig1 presents one illustrative embodiment of a system that benefits from the principles disclosed herein . it is a voice synthesis system ; for example , a text - to - speech synthesis system . it includes a controller 10 that accepts text and identifies the sounds ( i . e ., the speech units ) that need to be produced , as well as the prosodic attributes of the sounds ; such as pitch , duration and energy of the sounds . the construction of controller 10 is well known to persons skilled in the text - to - speech synthesis art . to proceed with the synthesis , controller 10 accesses database 20 that contains the speech units , retrieves the necessary speech units , and applies them to concatenation element 30 , which is a conventional speech synthesis element . element 30 concatenates the received speech units , making sure that the concatenations are smooth , and applies the result to element 40 . element 40 , which is also a conventional speech synthesis element , operates on the applied concatenated speech signal to modify the pitch , duration and energy of the speech elements in the concatenated speech signal , resulting in a signal with modified prosodic values . it is at this point that the principles disclosed herein come into play , where the focus is on the fact that the pitch is modified . specifically , the output of element 40 is applied to element 50 that , with the aid of information stored in memory 60 , modifies the magnitude spectrum of the speech signal . as indicated above , database 20 contains speech units that are used in the synthesis process . it is useful , however , for database 20 to also contain annotative information that characterizes those speech units , and that information is retrieved concurrently with the associated speech units and applied to elements 30 et seq . as described below . to that end , information about the speech of a selected speaker is recorded during a pre - synthesis process , is subdivided into small speech segments , for example phonemes ( which may be on the order of 150 msec ), is analyzed , and stored in a relational database table . illustratively , the table might contain the fields : to obtain characteristics of the speaker with finer granularity , it is useful to also subdivide the information into frames , for example , 10 msec long , and to store frame information together with frame - annotation information . for example , a second table of database 20 may contain the fields : record id , parent phoneme record id , f o , speech samples of the frame . line spectral frequencies ( lsf ) vector of the speech samples , linear prediction coefficients ( lpc ) vector of the speech samples . it may be noted that the practitioner has fair latitude as to what specific annotative information is developed for storage in database 20 , and the above fields are merely illustrative . for example the lpc can be computed “ on the fly ” from the lsfs , but when storage is plentiful , one might wish to store the lpc vectors . once the speech information of the recorded speaker is analyzed and stored in database 20 , in the course of a synthesis process controller 10 can specify to database 20 a particular phoneme type with a particular average pitch and duration , identify a record id that most closely fulfills the search specification , and then access the second database to obtain the speech samples of all of the frames that correspond to the identified record id , in the correct sequence . that is , database 20 outputs to element 30 a sequence of speech sample segments . each segment corresponds to a selected phoneme , and it comprises plurality of frames or , more particularly , it contains the speech samples of the frames that make up the phoneme . it is expected that , as a general proposition , the database will have the desired phoneme type but will not have the precise average f 0 and / or duration that is requested . element 30 concatenates the phonemes under direction of controller 10 and outputs a train of speech samples that represent the combination of the phonemes retrieved from database 20 , smoothly combined . this train of speech samples is applied to element 40 , where the prosodic values are modified , and in particular where f 0 is modified . the modified signal is applied to element 50 , which modifies the magnitude spectrum of the speech signal in accord with the principles disclosed herein . as indicated above , research suggests that the spectral envelope modifications that element 40 needs to perform are related to the changes that are effected in f 0 ; hence , one should expect to find a correlation between the spectral envelope and f 0 . to learn about this correlation , one can investigate different parameters that are related to the spectral envelope , such as the linear predictive codes ( lpcs ), or the line spectral frequencies ( lsfs ). we chose to use bark - scale warped lsfs because of their good interpolation and coding properties , as demonstrated by k . k . paliwal , in “ interpolation properties of linear prediction parametric representations ,” proceedings of eurospeech , pp . 1029 - 32 , september 1995 . additionally , the bark - scale warping effects a frequency weighting that is in agreement with human perception . in consonance with the decision to use lsfs in seeking a method for estimating the necessary evolution of a spectral envelope with changes to f 0 , we chose to look at the frame records of database 20 and , in particular , at the correlation between the f 0 &# 39 ; s and the lsfs vectors of those records . through statistical analysis of this information we have determined that , indeed , there are significant correlations between f 0 and lsfs . we have also determined that these correlations are not uniform but , rather , dissimilar even within a set of records that correspond to a given phoneme . still further , we determined that useful correlation is found when each phoneme is considered to contain q speech classes . in accordance with the principles disclosed herein , therefore , the statistical dependency of f 0 and lsfs is modeled using a gaussian mixture model ( gmm ), which models the probability distribution of a statistical variable z that is related to both the f 0 and lsfs as the sum of q multivariate gaussian functions , p ⁡ ( z ) = ∑ i = 1 q ⁢ α i ⁢ n ⁡ ( z , μ i , σ i ) ( 1 ) where n ( z , μ i , σ i ) is a normal distribution with mean vector μ i and covariance matrix σ i , α i is the prior probability of class i , such that and α i ≧ 0 , and z , for example , is [ f 0 , lsfs ] t . specifically , employing a conventional expectation maximization ( em ) algorithm to which the value of q is applied , as well as the f 0 and lsfs vectors of all frame sub - records in database 20 that correspond to a particular phoneme type , yields the α i , μ i , and σ i , parameters for the q classes of that phoneme type . those parameters , which are developed prior to the synthesis process , for example by processor 51 , are stored in memory 60 under control of processor 51 . with the information thus developed from the information in database 20 , one can then investigate whether , for a particular phoneme label and a particular f 0 , e . g ., f desired , the appropriate corresponding lsf vector , lsf desired , can be estimated with the aid of the statistical information stored in memory 60 . more specifically , for a particular speech class , if x ={ x 1 , x 2 , . . . , x n } is the collection of f 0 &# 39 ; s and y ={ y 1 , y 2 , . . . , y n } is the corresponding collection of lsf vectors , the question is whether a mapping ℑ can be found that minimizes the mean squared error where e denotes expectation . to model the joint density , x and y are joined to form and the gmm parameters α i , μ i and σ i , are estimated as described above in connection with equation ( 1 ). based on various considerations it was deemed advisable to select the mapping function ℑ to be ⁢ ( x ) = e ⁡ [ y ❘ x ] = ∑ i = 1 q ⁢ h i ⁡ ( x ) · [ μ i y + ( σ i yx ) ⁢ ( σ i xx ) - 1 ⁢ ( x - μ i x ) ] ⁢ ⁢ where ( 4 ) h i = α i ⁢ n ⁡ ( x , μ i x , σ i xx ) ∑ j = 1 q ⁢ α j ⁢ n ⁡ ( x , μ j x , σ j xx ) , ( 5 ) σ i = [ σ i xx σ i xy σ i yx σ i yy ] , and ( 6 ) μ i = [ μ i x μ i y ] . ( 7 ) from the above , it can be seen that once the α i , μ i and σ i , parameters are known for a given phoneme type ( from the em algorithm ), equation ( 6 ) yields σ i xx σ i xy σ i yx and σ i yy , and equation ( 7 ) yields μ i x and μ i y . from this information , the parameter h i is evaluated in accordance with equation ( 5 ), allowing a practitioner to estimate the lsf vector , lsf desired , by evaluating ℑ ( x ), for x = f desired , in accordance with equation ( 4 ); i . e ., lsf desired ≅ ℑ ( f desired ). in the fig1 system described above , one input to element 50 is the train of speech samples from element 40 that represent the concatenated speech . this concatenated speech , it may be remembered , was derived from frames of speech samples that database 20 provided . in synchronism with the frames that database 20 outputs , it also outputs the phoneme label that corresponds to the parent phoneme record id of the frames that are being outputted , as well as the lpc vector coefficients . that is , the speech samples are outputted on line 210 , while the phoneme labels and the lpc coefficients are outputted on line 220 . the phoneme labels track the associated speech sample frames through elements 30 and 40 , and are thus applied to element 50 together with the associated ( modified ) speech sample frames of the phoneme ( or at least with the first frame of the phoneme ). the associated lpc coefficients are also applied to element 50 together with the associated ( modified ) speech sample frames of the phoneme . the speech samples are applied within element 50 to filter 52 , while the phoneme labels and the lpc coefficients are applied within element 50 to processor 51 . based on the phoneme label , in accord with the principles disclosed above , processor 51 obtains the lsf desired of that phoneme . to modify the magnitude spectrum for each voiced phoneme frame in this train of samples in accordance with the lsf desired of that phoneme frame , processor 51 within element 50 develops lpc coefficients that correspond to lsf desired in accordance with well - known techniques . filter 52 is a digital filter whose coefficients are set by processor 51 . the output of the filter is the spectrum - modified speech signal . we chose a transfer function for filter 52 to be 1 - ∑ i = 1 p ⁢ a i ⁢ z - i 1 - ∑ i = 1 p ⁢ b i ⁢ z - i , ( 8 ) where the a i &# 39 ; s are the lpc coefficients applied to element 50 from database 20 ( via elements 30 and 40 ), and the b i &# 39 ; s are the lpc coefficients computed within processor 51 . this yields a good result because the magnitude spectrum of the signal at the input to element 50 is approximately equal to the spectrum envelope as represented the lpc vector that is stored in database 20 , that is , the magnitude spectrum is equal to 1 1 - ∑ i = 1 p ⁢ a i ⁢ z - i , plus some small error . of course , other transfer functions can also be employed . actually , if desired , the speech samples stored in database 20 need not be employed at all in the synthesis process . that is , an arrangement can be employed where speech is coded to yield a sequence of tuples , each of which includes an f 0 value , duration , energy , and phoneme class . this rather small amount of information can then be communicated to a receiver ( e . g . in a cellular environment ), and the receiver synthesizes the speech . in such a receiver , elements 10 , 30 , and 40 degenerate into a front end receiver element 15 that . applies a synthesis list of the above - described tuples to element 50 . based on the desired phoneme and phoneme class , appropriate α i , μ i and σ 1 data is retrieved from memory 60 , and based on the desired f 0 the lsf desired vectors are generated as described above . from the available lsf desired vectors , lpc coefficients are computed , and a spectrum having the correct envelope is generated from the lpc coefficient . that spectrum is multiplied by sequences of pulses that are created based on the desired f 0 , duration , and energy , yielding the synthesized speech . in other words , a minimal receiver embodiment that employs the principles disclosed herein comprises a memory 60 that stores the information disclosed above , a processor 51 that is responsive to an incoming sequence of list entries , and a spectrum generator element 53 that generates a train of pulses of the required repetition rate ( f 0 ) with a spectrum envelope corresponding to where b i &# 39 ; s are the lpc coefficients computed within processor 51 . the minimal transmitter embodiment for communicating actual ( as contrasted to synthesized ) speech comprises a speech analyzer 21 that breaks up an incoming speech signal into phonemes , and frames , and for each frame it develops tuples that specify phoneme type , f 0 , duration , energy , and lsf vectors . the information corresponding to f 0 and the lsf vectors is applied to database 23 , which identifies the phoneme class . that information is combined with the phoneme type , f 0 , duration , and energy information in encoder 22 , and transmitted to the receiver . the above - disclosed technique applies to voiced phonemes . when the phonemes are known , as in the above - disclosed example , we call this mode of operation “ supervised .” in the supervised mode , we have employed 27 phoneme types in database 20 , and we used a value of 6 for q . that is , in ascertaining the parameters α i , μ i and σ i , the entire collection of frames that corresponded to a particular phoneme type was considered to be divisible into 6 classes . at times , the phonemes are not known a priori , or the practitioner has little confidence in the ability to properly divide the recorded speech into known phoneme types . in accordance with the principles disclosed herein , that is not a dispositive failing . we call such mode of operation “ unsupervised .” in such mode of operation we scale up the notion of classes . that is , without knowing the phoneme to which frames belong , we assume that the entire set of frames in database 20 forms a universe that can be divided into classes , for example 32 super - classes , or 64 super - classes , where z , for example , is [ lsfs ] t , and the em algorithm is applied to the entire set of frames . each frame is thus assigned to a super - class , and thereafter , each super - class is divided as described above , into q classes , as described above . the above discloses the principles of this invention through , inter alia , descriptions of illustrative embodiments . it should be understood , however , that various other embodiments are possible , and various modifications and improvements are possible without departing from the spirit and scope of this invention . for example , a processor 51 is described that computes the lsf desired based on a priori computed parameters α i , μ i and σ i , pursuant to equations ( 4 )-( 7 ). one can create an embodiment , however , where the lsf desired vectors can also be computed beforehand , and stored in memory 60 . in such an embodiment , processor 51 needs to only access the memory rather than perform significant computations .