WAVEFORM BLENDING TECHNIQUE FOR TEXT-TO-SPEECH SYSTEM

Abstract: A concatenator for a first digital frame with a second digital frame, such as the ending and beginning of adjacent diphone strings being concatenated to form speech is based on determining an optimun blend point for the first and second digital frames in response to the magnitudes of samples in the first and second digital frames. The frames are then blended to generate a digital sequence representing a concatenation of the first and second frames with reference to the optimum blend point. The system operates by first computing an extended frame in response to the first digital frame, and then finding a subset of the extended frame with matches the second digital frame using a minimum average magnitude difference function over the samples in the subset. The blend point is the first sample of the matching subset. To generate the concatenated waveform, the subset of the extended frame is combined with the second digital frame and concatenated with the beginning segments of the extended frame to produce the concatenate waveform.

Description: WAVEFORM BLENDING TECHNIQUE FOR TEXT-TO-SPEECH SYSTEM LIMITED COPYRIGHT WAIVER A portion of the disclosure of this patent document contains material to which the claim of copyright protection is made. The copyright owner has no objection to the facsimile reproduction by any person of the patent document or the patent disclosure, as it appears in the U.S. Patent and Trademark Office file or records, but reserves all other rights whatsoever. BACKGROUND OF THE INVENTION Field of the Invention The present invention relates to systems for smoothly concatenating quasi-periodic waveforms, such as encoded diphone records used in translating text in a computer system to synthesized speech. Description of the Related Art In text-to-speech systems, stored text in a computer is translated to synthesized speech. As can be appreciated, this kind of system would have wide spread application if it were of reasonable cost. For instance, a text-to-speech system could be used for reviewing electronic mail remotely across a telephone line, by causing the computer storing the electronic mail to synthesize speech representing the electronic mail. Also, such systems could be used for reading to people who are visually impaired. In the word processing context, text-to-speech systems might be used to assist in proofreading a large document. However in prior art systems which have reasonable cost, the quality of the speech has been relatively poor making it uncomfortable to use or difficult to understand. In order to achieve good quality speech, prior art speech synthesis systems need specialized hardware which is very expensive, and/or a large amount of memory space in the computer system generating the sound. In text-to-speech systems, an algorithm reviews an input text string, and translates the words in the text string into a sequence of diphones which must be translated into synthesized speech. Also, text- to-speech systems analyze the text based on word type and context to generate intonation control used for adjusting the duration of the sounds and the pitch of the sounds involved in the speech. Diphones consist of a unit of speech composed of the transition between one sound, or phoneme, and an adjacent sound, or phoneme. Diphones typically start at the center of one phoneme and end at the center of a neighboring phoneme. This preserves the transition between the sounds relatively well. American English based text-to-speech systems, depending on the particular implementation, use about fifty different sounds referred to as phones. Of these fifty different sounds, the standard language uses about 1800 diphones out of possible 2500 phone pairs. Thus, a text-to- speech system must be capable of reproducing 1800 diphones. To store the speech data directly for each diphone would involve a huge amount of memory. Thus, compression techniques have evolved to limit the amount of memory required for storing the diphones. Prior art text-to-speech systems are described in part in United States Patent No. 8,452,168, entitled COMPRESSION OF STORED WAVE FORMS FOR ARTIFICIAL SPEECH, invented by Sprague; and United States Patent No. 4,692,941 , entitled REAL-TIME TEXT-TO- SPEECH CONVERSION SYSTEM, invented by Jacks, et al. Further background concerning speech synthesis may be found in United States Patent No. 4,384,169, entitled METHOD AND APPARATUS FOR SPEECH SYNTHESIZING, invented by Mozer, et al. Two concatenated diphones will have an ending frame and a beginning frame. The ending frame of the left diphone must be blended with the beginning frame of the right diphone without audible discontinuities or clicks being generated. Since the right boundary of the first diphone and the left boundary of the second diphone correspond to the same phoneme in most situations, they are expected to be similar looking at the point of concatenation. However, because the two diphone codings are extracted from different contexts, they will not look identical. Thus, blending techniques of the prior art have attempted to blend concatenated waveforms at the end and beginning of left and right frames, respectively. Because the end and beginning of frames may not match well, blending noise results. Continuity of sound between adjacent diphones is thus distorted. Notwithstanding the prior work in this area, the use of text-to- speech systems has not gained widespread acceptance. It is desireable therefore to provide a software only text-to-speech system which is portable to a wide variety of microcomputer platforms, produces high quality speech and operates in real time on such platforms. SUMMARY OF THE INVENTION The present invention provides an apparatus for concatenating a first digital frame with a second digital frame of quasi-periodic waveforms, such as the ending and beginning of adjacent diphone strings being concatenated to form speech. The system is based on determining an optimum blend point for the first and second digital frames in response to the magnitudes of samples in the first and second digital frames. The frames are then blended to generate a digital sequence representing a concatenation of the first and second frames, with reference to the optimum blend point. This has the effect of providing much better continuity in the blending or concatenation of diphones in text-to-speech systems than has been available in the prior art. Further, the technique is applicable to concatenating any two quasi-periodic waveforms, commonly encountered in sound synthesis or speech, music, sound effects, or the like. According to one aspect of the present invention, the system operates by first computing an extended frame in response to the first digital frame, and then finding a subset of the extended frame which matches the second digital frame relatively well. The optimum blend point is then defined as a sample in the subset of the extended frame. The subset of the extended frame which matches the second digital frame relatively well is determined using a minimum average magnitude difference function over the samples in the subset. The blend point in this aspect comprises the first sample of the subset. To generate the concatenated waveform, the subset of the extended frame is combined with the second digital frame and concatenated with the beginning segment of the extended frame to produce the concatenate waveform. The concatenated sequence is then converted to analog form, or other physical representation of the waveforms being blended. According to another aspect, the present invention provides an apparatus for synthesizing speech in response to text. The system includes a translator, by which text is translated to a sequence of sound segment codes which identify diphones. Next, a decoder is applied to the sequence of sound segment codes to produce strings of digital frames which represent diphones for respective sound segment codes in the sequence. A concatenator is provided by which a first digital frame at the ending of an identified string of digital frames for a particular sound segment code in the sequence is concatenated with a second digital frame at the beginning of an identified string of digital frames of an adjacent sound segment code in the sequence to produce a speech data sequence. The concatenating system includes a buffer to store samples of the first and second digital frames. Software, or other processing resources, determine a blend point for the first and second digital frames and blend the first and second frames in response to the blend point to produce a concatenation of the first and second sound segments. An audio transducer is coupled to the concatenating system to generate synthesized speech in response to the speech data sequence. In one embodiment of the invention, the resources that determine the optimum blend point include computing resources that compute an extended frame comprising a discontinuity smoothed concatenation of the first digital frame with a replica of the first digital frame. Further resources find a subset of the extended frame with a minimum average magnitude difference between the samples in the subset and in the second digital frame and define the optimum blend point as the first sample in the subset. The blending resources include software or other computing resources that supply a first set of samples derived from the first digital frame and the blend point as a first segment of the digital sequence. Next, the second digital frame is combined with the subset of the extended frame, with emphasis on the subset of the extended frame in a starting sample and emphasis on the second digital frame in an ending sample to produce a second segment of the digital sequence. The first segment and second segment are combined produce the speech data sequence. According to yet further aspects of the present invention, the text-to-speech apparatus includes a processing module for adjusting the pitch and duration of the identified strings of digital frames in the speech data sequence in response to the input text. Also, the decoder is based on a vector quantization technique which provides excellent quality compression with very small decoding resources required. Other aspects and advantages of the present invention can be seen upon review of the figures, the detailed description, and the claims which follow. BRIEF DESCRIPTION OF THE FIGURES Fig. 1 is a block diagram of a generic hardware platform incorporating the text-to-speech system of the present invention. Fig. 2 is a flow chart illustrating the basic text-to-speech routine according to the present invention. Fig. 3 illustrates the format of diphone records according to one embodiment of the present invention. Fig. 4 is a flow chart illustrating the encoder for speech data according to the present invention. Fig. 5 is a graph discussed in reference to the estimation of pitch filter parameters in the encoder of Fig. 4. Fig. 6 is a flow chart illustrating the full search used in the encoder of Fig. 4. Fig. 7 is a flow chart illustrating a decoder for speech data according to the present invention. Fig. 8 is a flow chart illustrating a technique for blending the beginning and ending of adjacent diphone records. Fig. 9 consists of a set of graphs referred to in explanation of the blending technique of Fig. 8. Fig. 10 is a graph illustrating a typical pitch versus time diagram for a sequence of frames of speech data. Fig. 1 1 is a flow chart illustrating a technique for increasing the pitch period of a particular frame. Fig. 12 is a set of graphs referred to in explanation of the technique of Fig. 1 1. Fig. 13 is a flow chart illustrating a technique for decreasing the pitch period of a particular frame. Fig. 14 is a set of graphs referred to in explanation of the technique of Fig. 1 3. Fig. 1 5 is a flow chart illustrating a technique for inserting a pitch period between two frames in a sequence. Fig. 1 6 is a set of graphs referred to in explanation of the technique of Fig. 1 5. Fig. 1 7 is a flow chart illustrating a technique for deleting a pitch period in a sequence of frames. Fig. 18 is a set of graphs referred to in explanation of the technique of Fig. 1 7. DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS A detailed description of preferred embodiments of the present invention is provided with reference to the figures. Figs. 1 and 2 provide a overview of a system incorporating the present invention. Fig. 3 illustrates the basic manner in which diphone records are stored according to the present invention. Figs. 4-6 illustrate the encoding methods based on vector quantization of the present invention. Fig. 7 illustrates the decoding algorithm according to the present invention. Figs. 8 and 9 illustrate a preferred technique for blending the beginning and ending of adjacent diphone records. Figs. 10-18 illustrate the techniques for controlling the pitch and duration of sounds in the text-to-speech system. I. System Overview (Figs. 1 -3) Fig. 1 illustrates a basic microcomputer platform incorporating a text-to-speech system based on vector quantization according to the present invention. The platform includes a central processing unit 10 coupled to a host system bus 1 1 . A keyboard 1 2 or other text input device is provided in the system. Also, a display system 13 is coupled to the host system bus. The host system also includes a non-volatile storage system such as a disk drive 14. Further, the system includes host memory 15. The host memory includes text-to-speech (TTS) code, including encoded voice tables, buffers, and other host memory. The text-to-speech code is used to generate speech data for supply to an audio output module 16 which includes a speaker 17. The code also includes an optimum blend point, diphone concatenation routine as described in detail with reference to Figs. 8 and 9. According to the present invention, the encoded voice tables include a TTS dictionary which is used to translate text to a string of diphones. Also included is a diphone table which translates the diphones to identified strings of quantization vectors. A quantization vector table is used for decoding the sound segment codes of the diphone table into the speech data for audio output. Also, the system may include a vector quantization table for encoding which is loaded into the host memory 15 when necessary. The platform illustrated in Fig. 1 represents any generic microcomputer system, including a Macintosh based system, an DOS based system, a UNIX based system or other types of microcomputers. The text-to-speech code and encoded voice tables according to the present invention for decoding occupy a relatively small amount of host memory 15. For instance, a text-to-speech decoding system according to the present invention may be implemented which occupies less than 640 kilobytes of main memory, and yet produces high quality, natural sounding synthesized speech. The basic algorithm executed by the text-to-speech code is illustrated in Fig. 2. The system first receives the input text (block 20). The input text is translated to diphone strings using the TTS dictionary (block 21 ). At the same time, the input text is analyzed to generate intonation control data, to control the pitch and duration of the diphones making up the speech (block 22). After the text has been translated to diphone strings, the diphone strings are decompressed to generate vector quantized data frames (block 23). After the vector quantized (VQ) data frames are produced, the beginnings and endings of adjacent diphones are blended to smooth any discontinuities (block 24). Next, the duration and pitch of the diphone VQ data frames are adjusted in response to the intonation control data (block 25 and 26). Finally, the speech data is supplied to the audio output system for real time speech production (block 27). For systems having sufficient processing power, an adaptive post filter may be applied to further improve the speech quality. The TTS dictionary can be implemented using any one of a variety of techniques known in the art. According to the present invention, diphone records are implemented as shown in Fig. 3 in a highly compressed format. As shown in Fig. 3, records for a left diphone 30 and a record for a right diphone 31 are shown. The record for the left diphone 30 includes a count 32 of the number NL of pitch periods in the diphone. Next, a pointer 33 is included which points to a table of length NL storing the number LP. for each pitch period, i goes from 0 to NL-1 of pitch values for corresponding compressed frame records. Finally, pointer 34 is included to a table 36 of ML vector quantized compressed speech records, each having a fixed set length of encoded frame size related to nominal pitch of the encoded speech for the left diphone. The nominal pitch is based upon the average number of samples for a given pitch period for the speech data base. A similar structure can be seen for the right diphone 31. Using vector quantization, a length of the compressed speech records is very short relative to the quality of the speech generated. The format of the vector quantized speech records can be understood further with reference to the frame encoder routine and the frame decoder routine described below with reference to Figs. 4-7. II. The Encoder/Decoder Routines (Figs. 4-7) The encoder routine is illustrated in Fig. 4. The encoder accepts as input a frame s of speech data. In the preferred system, the speech samples are represented as 12 or 16 bit two's complement numbers, sampled at 22,252 Hz. This data is divided into non-overlapping frames s having a length of N, where N is referred to as the frame size. The value of N depends on the nominal pitch of the speech data. If the nominal pitch of the recorded speech is less than 165 samples (or 135 Hz), the value of N is chosen to be 96. Otherwise a frame size of 160 is used. The encoder transforms the N-point data sequence s into a byte stream of shorter length, which depends on the desired compression rate. For example, if N = 160 and very high data compression is desired, the output byte stream can be as short as 12 eight bit bytes. A block diagram of the encoder is shown in Fig. 4. Thus, the routine begins by accepting a frame s (block 50). To remove low frequency noise, such as DC or 60 Hz power line noise, and produce offset free speech data, signal s is passed through a high pass filter. A difference equation used in a preferred system to accomplish this is set out in Equation 1 for 0 n < N. x = s - s Λ + 0.999 *x - n n n-1 n-1 Equation 1 The value x is the "offset free" signal. The variables s 1 and x _, are initialized to zero for each diphone and are subsequently updated using the relation of Equation 2. x_ 1 = x N and s ^ = s^ Equation 2 This step can be referred to as offset compensation or DC removal (block 51 ). In order to partially decorrelate the speech samples and the quantization noise, the sequence x is passed through a fixed first order linear prediction filter. The difference equation to accomplish this is set forth in Equation 3. y = x - 0.875 * x . ' n n n-1 Equation 3 The linear prediction filtering of Equation 3 produces a frame y (block 52). The filter parameter, which is equal to 0.875 in Equation 3, will have to be modified if a different speech sampling rate is used. The value of x 1 is initialized to zero for each diphone, but will be updated in the step of inverse linear prediction filtering (block 60) as described below. It is possible to use a variety of filter types, including, for instance, an adaptive filter in which the filter parameters are dependent on the diphones to be encoded, or higher order filters. The sequence y produced by Equation 3 is then utilized to determine an optimum pitch value, P__ t # and an associated gain factor, B. P „ is computed using the functions s (P), s (P), s (P), and the opt xy xx yy coherence function Coh(P) defined by Equations 4, 5, 6 and 7 as set out below. N-1 P) = ∑ V n * PBUF p . P + n y n = 0 max Equation 4 N-1 s (P) XX = = Σ. n n = 0 Equation 5 N-1 s (Pl = ∑ PBUF p . - PBUF p y y N = 0 max max Equation 6 and Coh(P) = s (P) * s (P) / (s (P) * s (P)) xy xy xx yy Equation 7 PBUF is a pitch buffer of size P , which is initialized to zero, ^ max and updated in the pitch buffer update block 59 as described below. P ^ is the value of P for which Coh(P) is maximum and s (P) is opt xy positive. The range of P considered depends on the nominal pitch of the speech being coded. The range is (96 to 350) if the frame size is equal to 96 and is (1 60 to 414) if the frame size is equal to 160. P is ^ max 350 if nominal pitch is less than 1 60 and is equal to 414 otherwise. The parameter P can be represented using 8 bits. The computation of P can be understood with reference to Fig. 5. In Fig. 5, the buffer PBUF is represented by the sequence 100 and the frame y is represented by the sequence 101 . In a segment of speech data in which the preceding frames are substantially equal to the frame will have the value at point 102, where the vector y 101 matches as closely as possible a corresponding segment of similar length in PBUF 100. The pitch filter gain parameter β is determined using the expression of Equation 8. β = s (P J / s (P J. H xy opt yy opt Equation 8 β is quantized to four bits, so that the quantized value of β can range from 1 /1 6 to 1 , in steps of 1 /1 6. Next, a pitch filter is applied (block 54). The long term correlations in the pre-emphasized speech data y are removed using the relation of Equation 9. r = y 0 . P BUF p 0 ≤ n < N. max opt Equation 9 This results in computation of a residual signal r . Next, a scaling parameter G is generated using a block gain estimation routine (block 55). In order to increase the computational accuracy of the following stages of processing, the residual signal r is rescaled. The scaling parameter, G, is obtained by first determining the largest magnitude of the signal r and quantizing it using a 7-level quantizer. The parameter G can take one of the following 7 values: 256, 51 2, 1024, 2048, 4096, 8192, and 1 6384. The consequence of choosing these quantization levels is that the rescaling operation can be implemented using only shift operations. Next the routine proceeds to residual coding using a full search vector quantization code (block 56). In order to code the residual signal r , the n point sequence r is divided into non-overlapping blocks of length M, where M is referred to as the "vector size". Thus, M sample blocks b.. are created, where i is an index from zero to M-1 on the block number, and j is an index from zero to N/M-1 on the sample within the block. Each block may be defined as set out in Equation 10. b.. = r. .. , . , (0 < i < N/M and j ≤ 0 < M) ij Mi +j J Equation 10 Each of these M sample blocks b.. will be coded into an 8 bit number using vector quantization. The value of M depends on the desired compression ratio. For example, with M equal to 1 6, very high compression is achieved (i.e., 1 6 residual samples are coded using only 8 bits). However, the decoded speech quality can be perceived to be somewhat noisy with M = 1 6. On the other hand, with M = 2, the decompressed speech quality will be very close to that of uncompressed speech. However the length of the compressed speech records will be longer. The preferred implementation, the value M can take values 2, 4, 8, and 1 6. The vector quantization is performed as shown in Fig. 6. Thus, for all blocks b.. a sequence of quantization vectors is identified (block 120). First, the components of block b.. are passed through a noise shaping filter and scaled as set out in Equation 1 1 (block 121 ). w. = 0.875 * w. , - 0.5 * w. „ + 0.4375 * w. + b.., J J-1 J-2 J-3 ij' 0 ≤ j < M v.. = G * w. O≤ j < M 'J J J Equation 1 1 Thus, v.. is the jth component of the vector v., and the values w - , w „ and „ are the states of the noise shaping filter and are initialized to zero for each diphone. The filter coefficients are chosen to shape the quantization noise spectra in order to improve the subjective quality of the decompressed speech. After each vector is coded and decoded, these states are updated as described below with reference to blocks 1 24-126. Next, the routine finds a pointer to the best match in a vector quantization table (block 122). The vector quantization table 123 consists of a sequence of vectors C Q through C 255 (block 123). Thus, the vector v. is compared against 256 M-point vectors, which are precomputed and stored in the code table 123. The vector C . which is closest to v. is determined according to Equation 12. The value C for p = 0 through 255 represents the p encoding vector from the vector quantization code table 123. M-1 min 2- (v.. - C .) . . 'J PJ P J = 0 Equation 1 2 The closest vector C . can also be determined efficiently using the technique of Equation 1 3. T v. • : . < v. • C for all p(0 < p 255) I qi i p Equation 13 In Equation 13, the value vT represen _t.s _ t._h.e _ t,ranspose o .f_. _ t_._h__e vector v, and "•" represents the inner product operation in the inequality. The encoding vectors C in table 123 are utilized to match on the noise filtered value v... However in decoding, a decoding vector table 125 is used which consists of a sequence of vectors QV . The values QV are selected for the purpose of achieving quality sound data using the vector quantization technique. Thus, after finding the vector C ., the pointer q is utilized to access the vector QV .. The decoded samples corresponding to the vector b. which is produced at step 55 of Fig. 4, is the M-point vector (1 /G) * QV .. The vector C is related to qi p the vector QV by the noise shaping filter operation of Equation 1 1. Thus, when the decoding vector QV is accessed, no inverse noise shaping filter needs to be computed in the decode operation. The table 125 of Fig. 6 thus includes noise compensated quantization vectors. In continuing to compute the encoding vectors for the vectors b.. which make up the residual signal r , the decoding vector of the pointer to the vector b. is accessed (block 124). That decoding vector is used for filter and PBUF updates (block 126). For the noise shaping filter, after the decoded samples are computed for each sub-block b., the error vector (b.-QV .) is passed i i qi through the noise shaping filter as shown in Equation 14. W. = 0.875 * W. 1 - 0.5 * W. 0 + 0.4375 * W. , + [b.. - Q V qi (j)] 0 j < M Equation 14 In Equation 14, the value QV .(j) represents the j component of the decoding vector QV .. The noise shaping filter states for the next block are updated as shown in Equation 15. W -1 = W M-1 w_ 2 = w M _ 2 w = w -3 M-3 Equation 1 5 This coding and decoding is performed for all of the N/M sub- blocks to obtain N/M indices to the decoding vector table 1 25. This string of indices Q , for n going from zero to N/M-1 represent identifiers for a string of decoding vectors for the residual signal r . Thus, four parameters represent the N-point data sequence y : 1 ) Optimum pitch, P (8 bits), 2) Pitch filter gain, β (4 bits), 3) Scaling parameter, G (3 bits), and 4) A string of decoding table indices, Q (0 ≤ n < N/M). The parameters β and G can be coded into a single byte. Thus, only (N/M) plus 2 bytes are used to represent N samples of speech. For example, suppose nominal pitch is 100 samples long, and M = 16. In this case, a frame of 96 samples of speech are represented by 8 bytes: 1 byte for P , 1 byte for β and G, and 6 bytes for the decoding table indices Q . If the uncompressed speech consists of 16 bit samples, then this represents a compression of 24: 1 . Back to Fig. 4, four parameters identifying the speech data are stored (block 57). In a preferred system, they are stored in a structure as described with respect to Fig. 3 where the structure of the frame can be characterized as follows: #define NumOfVectorsPerFrame (FrameSize / VectorSize) struct frame { unsigned Gain : 4; unsigned Beta : 3; unsigned UnusedBit: 1 ; unsigned char Pitch ; unsigned char VQcodesfNumOfVectorsPerFrame]; }; The diphone record of Fig. 3 utilizing this frame structure can be characterized as follows: DiphoneRecord { char LeftPhone, RightPhone; short LeftPitchPeriodCount,RightPitchPeriodCount; short *LeftPeriods, *RightPeriods; struct frame *LeftData, *RightData; } These stored parameters uniquely provide for identification of the diphones required for text-to-speech synthesis. As mentioned above with respect to Fig. 6, the encoder continues decoding the data being encoded in order to update the filter and PBUF values. The first step involved in this is an inverse pitch filter (block 58). With the vector r' corresponding to the decoded signal formed by concatenating the string of decoding vectors to represent the residual signal r' , the inverse filter is implemented as set out in Equation 1 6. y' = r' + β * PBUF D D + , , 0 ≤ n < N. 1 n n Pmax - Popt + n Equation 16 Next, the pitch buffer is updated (block 59) with the output of the inverse pitch filter. The pitch buffer PBUF is updated as set out in Equation 17. PBUF n n = PBUF (,n + N.) 0 < n < (P m ma a x v - N) PBUF ,( D Pmax - N M j+ . n) = Y''n 0 ≤ n < N Equation 1 7 Finally, the linear prediction filter parameters are updated using an inverse linear prediction filter step (block 60). The output of the inverse pitch filter is passed through a first order inverse linear prediction filter to obtain the decoded speech. The difference equation to implement this filter is set out in Equation 18. x = 0.875 n n-1 + Y' Equation 1 8 In Equation 1 8, x' is the decompressed speech. From this, the value of x ' for the next frame is set to the value x * . for use in the step of block 52. Fig. 7 illustrates the decoder routine. The decoder module accepts as input (N/M) + 2 bytes of data, generated by the encoder module, and applies as output N samples of speech. The value of N depends on the nominal pitch of the speech data and the value of M depends on the desired compression ratio. In software only text-to-speech systems, the computational complexity of the decoder must be as small as possible to ensure that the text-to-speech system can run in real time even on slow computers. A block diagram of the encoder is shown in Fig. 7. The routine starts by accepting diphone records at block 200. The first step involves parsing the parameters G, β, P , and the vector quantization string Q (block 201 ). Next, the residual signal r' is decoded (block 202). This involves accessing and concatenating the decoding vectors for the vector quantization string as shown schematically at block 203 with access to the decoding vector table 125. After the residual signal r' is decoded, an inverse pitch filter is applied (block 204). This inverse pitch filter is implemented as shown in Equation 19: y' = r' + *SPBUF(P - P + + n), 0 <n < N. 1 n n max opt Equation 19 SPBUF is a synthesizer pitch buffer of length P initialized as zero for each diphone, as described above with respect to the encoder pitch buffer PBUF. For each frame, the synthesis pitch buffer is updated (block 205). The manner in which it is updated is shown in Equation 20: SPBUF = SPBUF, , ... 0≤n < (P - N) n (n + N) max SPBUF /D .. , . = y' 0<n < N (Pmax - N - n) n Equation 20 After updating SPBUF, the sequence y' is applied to an inverse linear prediction filtering step (block 206). Thus, the output of the inverse pitch filter y' is passed through a first order inverse linear prediction filter to obtain the decoded speech. The difference equation to implement the inverse linear prediction filter is set out in Equation 21 : x' = 0.875 n n-1 n Equation 21 In Equation 21 , the vector x' corresponds to the decompressed speech. This filtering operation can be implemented using simple shift operations without requiring any multiplication. Therefore, it executes very quickly and utilizes a very small amount of the host computer resources. Encoding and decoding speech according to the algorithms described above, provide several advantages over prior art systems. First, this technique offers higher speech compression rates with decoders simple enough to be used in the implementation of software only text-to-speech systems on computer systems with low processing power. Second, the technique offers a very flexible trade-off between the compression ratio and synthesizer speech quality. A high-end computer system can opt for higher quality synthesized speech at the expense of a bigger RAM memory requirement. III. Waveform Blending For Discontinuity Smoothing (Figs. 8 and 9) As mentioned above with respect to Fig. 2, the synthesized frames of speech data generated using the vector quantization technique may result in slight discontinuities between diphones in a text string. Thus, the text-to-speech system provides a module for blending the diphone data frames to smooth such discontinuities. The blending technique of the preferred embodiment is shown with respect to Figs. 8 and 9. Two concatenated diphones will have an ending frame and a beginning frame. The ending frame of the left diphone must be blended with the beginning frame of the right diphone without audible discontinuities or clicks being generated. Since the right boundary of the first diphone and the left boundary of the second diphone correspond to the same phoneme in most situations, they are expected to be similar looking at the point of concatenation. However, because the two diphone codings are extracted from different context, they will not look identical. This blending technique is applied to eliminate discontinuities at the point of concatenation. In Fig. 9, the last frame, referring here to one pitch period, of the left diphone is designated L (0<n < PL) at the top of the page. The first frame (pitch period) of the right diphone is designated R (0<n < PR). The blending of L and R according to the present invention will alter these two pitch periods only and is performed as discussed with reference to Fig. 8. The waveforms in Fig. 9 are chosen to illustrate the algorithm, and may not be representative of real speech data. Thus, the algorithm as shown in Fig. 8 begins with receiving the left and right diphone in a sequence (block 300). Next, the last frame of the left diphone is stored in the buffer L (block 301 ). Also, the first frame of the right diphone is stored in buffer R (block 302). Next, the algorithm replicates and concatenates the left frame L to form extend frame (block 303). In the next step, the discontinuities in the extended frame between the replicated left frames are smoothed (block 304). This smoothed and extended left frame is referred to as El in Fig. 9. The extended sequence El (0 < n < PL) is obtained in the first step as shown in Equation 22: El n = n n = 0, 1 PL-1 El PL + n = L n n = °' 1 PL"1 Equation 22 Then discontinuity smoothing from the point n = PL is conducted according to the filter of Equation 23: El = El + 1EI - El' l *Δ n + 1 PL + n PL + n + l cl (PL-1 ) (PL-1 ) J n = 0, 1 (PL/2). Equation 23 In Equation 23, the value Δ is equal to 1 5/1 6 and El' . .. . = EL + 3 * (EL -EI 0 ). Thus, as indicated in Fig. 9, the extended sequence El is substantially equal to L on the left hand side, has a smoothed region beginning at the point PL and converges on the original shape of L toward the point 2PL. If L was perfectly periodic, then El = El' U PL-1 cι PL-T In the next step, the optimum match of R with the vector El is n n found. This match point is referred to as P _. (Block 305.) This is opt accomplished essentially as shown in Fig. 9 by comparing R with El to find the section of El which most closely matches R . This optimum blend point determination is performed using Equation 23 where W is the minimum of PL and PR, and AMDF represents the average magnitude difference function. W-1 AMDF(p) = Σ I El , - R | ^ ' n + p n ' n = 0 Equation 24 This function is computed for values of p in the range of 0 to PL- 1 . The vertical bars in the operation denote the absolute value. W is the window size for the AMDF computation. P is chosen to be the value at which AMDF(p) is minimum. This means that p = P corresponds to the point at which sequences El (0< n <W) and R (0 n < W) are very close to each other. After determining the optimum blend point P , the waveforms are blended (block 306). The blending utilizes a first weighting ramp WL which is shown in Fig • = » . 9 beg •* - • inning » at P op Λ t in the El n trace. In a second ramp, WR is shown in Fig. 9 at the R trace which is lined up with P . Thus, in the beginning of the blending operation, the value of El is emphasized. At the end of the blending operation, the value of R is emphasized. Before blending, the length PL of L is altered as needed to ensure that when the modified L and R are concatenated, the waveforms are n n as continuous as possible. Thus, the length P'L is set to P _ if P _ is p a opt opt greater than PL/2. Otherwise, the length P'L is equal to W + P and the sequence L is equal to El for 0 < n ≤ (P'L-1 ). The blending ramp beginning at P is set out in Equation 25: R„ = El + (R - El , p J *(n + 1 )/W 0≤n <W n n + Popt n n + Popt R = R W ≤n < PR n n Equation 25 Thus, the sequences L and R are windowed and added to get the blended R . The beginning of L and the ending of R are preserved to prevent any discontinuities with adjacent frames. This blending technique is believed to minimize blending noise in synthesized speech produced by any concatenated speech synthesis. IV. Pitch and Duration Modification (Figs. 10-18) As mentioned above with respect to Fig. 2, a text analysis program analyzes the text and determines the duration and pitch contour of each phone that needs to be synthesized and generates intonation control signals. A typical control for a phone will indicate that a given phoneme, such as AE, should have a duration of 200 milliseconds and a pitch should rise linearly from 220Hz to 300Hz. This requirement is graphically shown in Fig. 1 0. As shown in Fig. 10, T equals the desired duration (e.g. 200 milliseconds) of the phoneme. The frequency f. is the desired beginning pitch in Hz. The frequency f is the desired ending pitch in Hz. The labels P.. , P,-...,P fi indicate the number of samples of each frame to achieve the desired pitch frequencies f. , f„...,f fi . The relationship between the desired number of samples, P., and the desired pitch frequency f. (f . = f. ), is defined by the relation: P. = F Ii., where F is the sampling frequency for the data. As can be seen in Fig. 10, the pitch period for a lower frequency period of the phoneme is longer than the pitch period for a higher frequency period of the phoneme. If the nominal frequency were P„, then the algorithm would be required to lengthen the pitch period for frames P_. and P ? and decrease the pitch periods for frames P . , P p . and P fi . Also, the given duration T of the phoneme will indicate how many pitch periods should be inserted or deleted from the encoded phoneme to achieve the desired duration period. Figs. 1 1 through 18 illustrate a preferred implementation of such algorithms. Fig. 1 1 illustrates an algorithm for increasing the pitch period, with reference to the graphs of Fig. 12. The algorithm begins by receiving a control to increase the pitch period to N + Δ, where N is the pitch period of the encoded frame. (Block 350). In the next step, the pitch period data is stored in a buffer x (block 351 ). x is shown in n n Fig. 1 2 at the top of the page. In the next step, a left vector L is generated by applying a weighting function WL to the pitch period data x with reference to Δ (block 352). This weighting function is illustrated in Equation 26 where M = N-Δ: L = x for 0 < n < Δ n n = x (N-n)/(M + 1 ) for Δ < n < N Equation 26 As can be seen in Fig. 1 2, the weighting function WL is constant from the first sample to sample Δ, and decreases from Δ to N. Next, a weighting function WR is applied to x (block 353) as can be seen in the Fig. 1 2. This weighting function is executed as shown in Equation 27: R = x * (n + 1 )/(M + 1 ) for O ≤ n < N-Δ n n + Δ R = x , Λ for N-Δ ≤n < N. n n + Δ Equation 27 As can be seen in Fig. 1 2, the weighting function WR increases from 0 to N-Δ and remains constant from N-Δ to N. The resulting waveforms L and R are shown conceptually in Fig. 1 2. As can be seen, L maintains the beginning of the sequence x , while R maintains the ending of the data x . a n The pitch modified sequence y is formed (block 354) by adding the two sequences as shown in Equation 28: y = L + R (n-Δ) Equation 28 This is graphically shown in Fig. 12 by placing R shifted by Δ below L . The combination of L and R shifted by Δ is shown to be y at the n n n 7 n bottom of Fig. 1 2. The pitch period for y is N + Δ. The beginning of y is the same as the beginning of x , and the ending of y is substantially the same as the ending of x . This maintains continuity with adjacent frames in the sequence, and accomplishes a smooth transition while extending the pitch period of the data. Equation 28 is executed with the assumption that L is 0, for n ≤ N, and R is 0 for n < 0. This is illustrated pictorially in Fig. 1 2. An efficient implementation of this scheme which requires at most one multiply per sample, is shown in Equation 29: y = x 0 ≤ n < Δ n n = x ] * (n-Δ + 1 )/(N-Δ + 1 ) Δ ≤ n < N n + [x x n-Δ n y = x . ' n n - Δ N < n < N, Equation 29 This results in a new pitch period having a pitch period of N + Δ. There are also instances in which the pitch period must be decreased. The algorithm for decreasing the pitch period is shown in Fig. 13 with reference to the graphs of Fig. 14. Thus, the algorithm begins with a control signal indicating that the pitch period must be decreased to N-Δ. (Block 400). The first step is to store two consecutive pitch periods in the buffer x (block 401 ). Thus, the buffer x as can be seen in Fig. 14 consists of two consecutive pitch periods, with the period N. being the length of the first pitch period, and N being the length of the second pitch period. Next, two sequences L and R are conceptually created using weighting functions WL and WR (blocks 402 and 403). The weighting function WL emphasizes the beginning of the first pitch period, and the weighting function WR emphasizes the ending of the second pitch period. These functions can be conceptually represented as shown in Equations 30 and 31 , respectively: L = for O <n < N j - W n = x (N,-n)/(W + 1 ) W≤n < N L n = 0 otherwise, Equation 30 and R n = x n * (n-N. I + W-Δ + 1 )/{W+ 1 ) for N. I-W + Δ≤n <N,I -l-Δ R = x for N, + Δ≤n < N, + N R n = 0 otherwise, Equation 31 In these equations, Δ is equal to the difference between N. and the desired pitch period N .. The value W is equal to 2*Δ, unless 2*Δ is greater than N ., in which case W is equal to N .. These two sequences L and R are blended to form a pitch modified sequence y (block 404). The length of the pitch modified sequence y will be equal to the sum of the desired length and the length of the right phoneme frame N . It is formed by adding the two sequences as shown in Equation 32: y n = L n + R (n + Δ) Equation 32 Thus, when a pitch period is decreased, two consecutive pitch periods of data are affected, even though only the length of one pitch period is changed. This is done because pitch periods are divided at places where short-term energy is the lowest within a pitch period. Thus, this strategy affects only the low energy portion of the pitch periods. This minimizes the degradation in speech quality due to the pitch modification. It should be appreciated that the drawings in Fig. 14 are simplified and do not represent actual pitch period data. An efficient implementation of this scheme, which requires at most one multiply per sample, is set out in Equations 33 and 34. The first pitch period of length N , is given by Equation 33: y = x 0_≤n<N.-W 'n n I y n = χ n + [x n Δ -x n ]*(n-N | + W+1)/(W + 1) N!-W≤n<N d Equation 33 The second pitch period of length N is generated as shown in Equation 34: Y, n-Δ + [x. ]*(n-Δ-N. + W+1)/(W+1) n-Δ N.≤n<N. + Δ Y n = x n N | + Δ≤ n<N | + N r Equation 34 As can be seen in Fig.14, the sequence L is essentially equal to the first pitch period until the point N.-W. At that point, a decreasing ramp WL is applied to the signal to dampen the effect of the first pitch period. As also can be seen, the weighting function WR begins at the point N.-W + Δ and applies an increasing ramp to the sequence x until the point N. + Δ. From that point, a constant value is applied. This has the effect of damping the effect of the right sequence and emphasizing the left during the beginning of the weighting functions, and generating a ending segment which is substantially equal to the ending segment of x emphasizing the right sequence and damping the left. When the two functions are blended, the resulting waveform y is substantially equal to the beginning of x at the beginning of the sequence, at the point N, -W a modified sequence is generated until the point N.. From N. to the ending, sequence x shifted by Δ results. A need also arises for insertion of pitch periods to increase the duration of a given sound. A pitch period is inserted according to the algorithm shown in Fig. 1 5 with reference to the drawings of Fig. 1 6. The algorithm begins by receiving a control signal to insert a pitch period between frames L and R (block 450). Next, both L and R n n n n are stored in the buffer (block 451 ), where L and R are two adjacent n n pitch periods of a voice diphone. (Without loss of generality, it is assumed for the description that the two sequences are of equal lengths NJ In order to insert a pitch period, x of the same duration, without causing a discontinuity between L and x and between x and R , the a ' n n n n pitch period x should resemble R around n = 0 (preserving L to x n n a n n continuity), and should resemble L around n = N (preserving x to R continuity). This is accomplished by defining x as shown in Equation 35: x = R + (L - R ) * [(n + 1 )/(N + 1 )] 0< n < N-1 n n n n Equation 35 Conceptually, as shown in Fig. 1 5, the algorithm proceeds by generating a left vector WL(L ), essentially applying to the increasing ramp WL to the signal L . (Block 452). A right vector WR (R ) is generated using the weighting vector WR (block 453) which is essentially a decreasing ramp as shown in Fig. 1 6. Thus, the ending of L is emphasized with the left vector, and the beginning of R is emphasized with the vector WR. Next, WR (L ) and WR (R ) are blended to create an inserted n n period x (block 454). The computation requirement for inserting a pitch period is thus just a multiplication and two additions per speech sample. Finally, concatenation of L , x and R produces a sequence with an inserted pitch period (block 455). Deletion of a pitch period is accomplished as shown in Fig. 1 7 with reference to the graphs of Fig. 1 8. This algorithm, which is very similar to the algorithm for inserting a pitch period, begins with receiving a control signal indicating deletion of pitch period R which follows L (block 500). Next, the pitch periods L and R are stored in the buffer n n (block 501 ). This is pictorially illustrated in Fig. 18 at the top of the page. Again, without loss of generality, it is assumed that the two sequences have equal lengths N. The algorithm operates to modify the pitch period L which precedes R (to be deleted) so that it resembles R , as n approaches N. This is done as set forth in Equation 36: L' = L + (R - L ) * [(n + 1 )/(N + 1 )] 0 < n < N-1 n n n n Equation 36 In Equation 36, the resulting sequence L' is shown at the bottom of Fig. 18. Conceptually, Equation 36 applies a weighting function WL to the sequence L (block 502). This emphasizes the beginning of the sequence L as shown. Next, a right vector WR (R ) is generated by applying a weighting vector WR to the sequence R that emphasizes the ending of R (block 503). WL (L ) and WR (R ) are blended to create the resulting vector n n L' . (Block 504). Finally, the sequence L -R is replaced with the sequence L' in the pitch period string. (Block 505). IV. Conclusion Accordingly, the present invention presents a software only text- to-speech system which is efficient, uses a very small amount of memory, and is portable to a wide variety of standard microcomputer platforms. It takes advantage of knowledge about speech data, and to create a speech compression, blending, and duration control routine which produces very high quality speech with very little computational resources. A source code listing of the software for executing the compression and decompression, the blending, and the duration and pitch control routines is provided in the Appendix as an example of a preferred embodiment of the present invention. The foregoing description of preferred embodiments of the present invention has been provided for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Obviously, many modifications and variations will be apparent to practitioners skilled in this art. The embodiments were chosen and described in order to best explain the principles of the invention and its practical application, thereby enabling others skilled in the art to understand the invention for various embodiments and with various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the following claims and their equivalents. APPENDIX © APPLE COMPUTER, INC. 1 993 37 C.F.R. § 1 .96(a) COMPUTER PROGRAM LISTINGS TABLE OF CONTENTS Section Page I. ENCODER MODULE 33 II. DECODER MODULE 43 III. BLENDING MODULE 55 IV. INTONATION ADJUSTMENT MODULE 59 I. ENCODER MODULE #include <stdio.h> #include <math.h> include <StdLib.h> #include <types.h> #include <fcntl.h> #include <string.h> #include < types. h> #include <files.h> #include < resources. h> #include < memory. h> #include "vqcoder.h" #define LAST_FRAME_FLAG 128 #define PBUF SIZE 440 static float oc_state[2], nsf_state[NSF_ORDER+ 1]; static short pstatelPORDER + 1], dstate[PORDER+ 1]; static short AnaPbuf[PBUF_SIZE]; static short vsize, cbook_size, bs_size; #pragma segment vqlib /* Read Code Books */ float *EncodeBook[MAX_CBOOK_SIZE]; short *DecodeBook[MAX_CBOOK_SIZE]; get_cbook(short ratio) { short *p; short frame size, i; static short last_ratio = 0; Handle h; int skip; h = GetResourceCCBOK'J); HLock(h); p = (short *) *h; if (ratio = = last_ratio) return; last_ratio = ratio; if (ratio < 3) return; if (NOMINAL PITCH < 165) frame_size = 96; else frame_size = 1 60; get_compr_pars(ratio, frame_size, &vsize, &cbook_size, &bs_size); skip = 0; while (p[skip + 1 ] ! = vsize) { short t1 , t2; t2 = plskipl; t1 = p[skip + 1 ]; skip + = sizeof(float) * (2 * t2-1 ) * (t1 + 1 ) / sizeof(short) + (2 * t2 * t1 + 2); } /*Skip Binary search tree */ skip + = sizeof (float) * (cbook_size-1 ) * (vsize + 1 ) / sizeof (short) -t- (cbook_size * vsize + 2); /* Get pointers to Full search code books */ for (i = 0; i < cbook_size; i -t- + ) { EncodeBookfi] = (float *) &p[skipl; skip + = (vsize + 1 ) * sizeof (float) / sizeof (short); } for (i = 0; i < cbook_size; i -t- + ) { DecodeBookli] = p + skip; skip + = vsize; } } char *getcbook(long *len, short ratio) { get_cbook(ratio); *len = sizeof(short) * vsize * cbook_size; /* plus one is to make space at the end for the array of pointers */ return (char*) DecodeBook[0]; } /* A Routine for Pitch filter parameter Estimation */ GetPitchFilterPars (x, len, pbuf, min pitch, max_pitch, pitch, beta) float *beta; short *x, *pbuf; short min_pitch, max_pitch; short len; unsigned int * pitch; { /* Estimate long-term predictor */ int best_pitch, i, j; float syy, sxy, be ' st_sxy = 0.0, best_syy = 1.0; short *ptr; best_pitch = min_pitch; ptr = pbuf + PBUF_SIZE - min_pitch; syy = 1.0; for (i = 0; i < len; i+ +) { syy + = (*ptr) * (*ptr); ptr + + ; } for (j = min_pitch; j < max_pitch; J+ +) { sxy = 0.0; ptr = pbuf + PBUF_SIZE - j; for (i = 0; i < len; + +) sxy + = x[i] * (*ptr+ +); if (sxy > 0 && (sxy * sxy * best syy > best_sxy * best_sxy * syy)) { best_syy — syy; best sxy = sxy; best_pitch = j; } syy = syy - pbuf [PBUF_SIZE - j + len - 1 ] * pbuf [PBUF_SIZE - j + len - 1 ] + pbuf[PBUF_SIZE - j - 1] * pbuf[PBUF_SIZE - j - 1]; } pitch = best_pitch; beta = best sxy / best_syy; } /* Quantization of LTP gain parameter */ CodePitchFilterGainfbeta, bcode) float beta; unsigned int *bcode; { int i; for (i = 0; i < DLB_TAB_SIZE; i + + ) { if (beta < = dlb_tab[i]) break; } *bcode = i; } /* Pitch filter */ PitchFilter(data, len, pbuf, pitch, ibeta) float *data; short ibeta; short *pbuf; short len; unsigned int pitch; { long pn; int i, j; j = PBUF_SIZE - pitch; for (i = 0; i < len; i+ +) { pn = ((ibeta * pbuf[j++]) >> 4); data[i] -= pn; } } /* Forward Noise Shaping filter */ FNSFilter(float *inp, float *state, short len, float *out) { short i, j; for (j = 0; j < len; j+ +) { float tmp = inp[j]; for (i = 1; i < = NSF_ORDER; i+ +) tmp + = state[i] * nsf[i]; out[j] = state[0] = tmp; for (i = NSF_ORDER; i > 0; i~) statefil = state[i-1]; } } I* Update Noise shaping Filter states */ UpdateNSFState(float *inp, float * state, short len) { short i, j; float temp_state[NSF_ORDER + 1 ]; for (i = 0; i < = NSF_ORDER; i+ +) temp_state[i] = 0; for (j = 0; j < len; j+ +) { float tmp = inp[j]; for (i = 1 ; i < = NSF_ORDER; i + + ) tmp + = temp_state[i] * nsf[i]; temp_state[0] = tmp; for (i = NSF ORDER; i > 0; i~) temp_state[i] = temp_state[i-1]; } for (i = 0; i < = NSF DRDER; i + + ) stateli] = stateli] - temp_state[i]; } /* Quantization of Segment Power */ CodeBlockGain(power, gcode) float power; unsigned int *gcode; { int i; for (i = 0; i < DLG_TAB_SIZE; i + + ) { if (power < = dlg_tab[i]) break; } *gcode = i; } /* Full search Coder */ VQCoder(float *x, float *nsf_state, short len, struct frame *bs) { float max x, tmp; int i, j, k, index, lshift_count; unsigned int gcode; float min_err = 0; max_x = xIO]; for (i = 1 ; i < len; i -t- + ) if ( fabs(x[i]) > max_x) max_x = fabs(x[i]); CodeBlockGain(max_x, &gcode); max_x = qlg_tab[gcode]; lshift_count = 7 - gcode; /* To scale 14-bit Code book output to the 16-bit actual value */ bs-> gcode = gcode; for (i = 0; i < len; i + = vsize) { /* Filter the data vector */ FNSFilter(&x[i], nsf_state, vsize, &x[i]); /* Scale data */ for (j = i; j < i + vsize; j + + ) x[j] = xlj] * 1024 / max_x; index = 0; for (j = 0; j < cbook_size; j -t- + ) { tmp = EncodeBook[j][vsize] * 1024.0; for (k = 0;. k < vsize; k+ +) tmp -= x[i + k] * EncodeBook[j][k]; if (tmp < min_err | | j = = 0) { index = j; min_err = tmp; } } bs->vqcode[i/vsize] = index; /* Rescale data: Decoded data is 14-bits, convert to 16 bits */ if (lshift_count) { for (k = 0; k < vsize; k+ +) x[i + k] = ((4 * DecodeBook[index][k]) >> lshift_count); } else { for (k = 0; k < vsize; k+ +) x[i + k] = 4 * DecodeBookfindexlIk]; } /* Update noise shaping filter state */ UpdateNSFState(&x[i], nsf_state, vsize); } init_compress() { int i; oc_state[0] = 0;; oc_state[1] = 0;; for (i = 0; i < = PORDER; i+ +) pstatefi] = dstatefi] = 0; for (i = 0; i < PBUF_SIZE; i+ +) AnaPbuf[i] = 0; for (i = 0; i < = NSF DRDER; i+ +) nsf_state[i] = 0; } Encoder(xn, frame_size, min_pitch, max_pitch, bs) short xn[]; struct frame *bs; short frame_size, min pitch, max_pitch; { unsigned int pitch, bcode; float preemp xnIPBUF SIZE], beta; short xn_copy[PBUF_SIZE]; short ibeta; float ace; int i, j; /* Offset Compensation */ for (i = 0; i < frame_size; i+ +) { float inp = xn[i]; xn[i] = inp - oc_state[0] + ALPHA * oc_stateI1 ]; oc_state[1] = xn[i]; oc_state[0] = inp; } /* Linear Prediction Filtering */ for (i = 0; i < frame size; i + + ) { ace = pstatelO] = xn[i]; for (j = 1; j < = PORDER; j+ +) acc-= pstatelj] * pfiltljl; xn_copy[i] = preemp_xn[i] = ace; for (j = PORDER; j > 0; j--) pstatefj] = pstatelj- 1]; } GetPitchFilterPars (xn copy, frame size, AnaPbuf, min_pitch, max_pitch, &pitch, &beta); CodePitchFilterGain(beta, &bcode); ibeta = qlb_tab[bcode]; bs->bcode = bcode; bs-> pitch = pitch - min_pitch + 1; PitchFilter(preemp_xn, frame_size, AnaPbuf, pitch, ibeta); VQCoder(preemp_xn, nsf_state, frame_size, bs); /* Inverse Filtering */ j = PBUF_SIZE - pitch; for (i = 0; i < frame_size; i+ +) { xn_copy[i] = preemp_xn[i]; xn_copy[i] + = ((ibeta * AnaPbuf [J+ +]) > > 4); } /* Update Pitch Buffer */ j = 0; for (i = frame_size; i < PBUF_SIZE; i-t- +) AnaPbuf [j ++ ] = AnaPbuf [i]; for (i = 0; i < frame size; i-t- +) AnaPbuf[j++] = xn_copy[i]; /* Inverse LP filtering */ for (i = 0; i < frame_size; i+ +) { ace = xn_copy[i]; for (j = 1; j < = PORDER; j+ +) ace = ace + dstatelj] * pfiltfj]; dstate[0] = ace; for (j = PORDER; j > 0; j-) dstatelj] = dstate[j-1]; } for (j = 0; j < = PORDER; j+ +) pstatelj] = dstatelj]; } compress (short *input, short ilen, unsigned char *output, long *olen, long docomp) { int i, j, vcount; unsigned char temp; short frame_size, min_pitch, max_pitch; if (docomp > 2) { init_compress(); if (NOMINAL PITCH < 165) { min_pitch = 96; frame_size = 96; max_pitch = 350; } else { min_pitch = 160; frame size = 160; max_pitch = 414; } bs_size = frame_size / vsize + 2; /* TEMPORARY: Storing State information */ pstateH ] = *(input - 1); if (pstate[1] > 0) pstate[1] = (pstateMl + 128) / 256 + 128; else pstateH] = (pstateH ] - 128) / 256 + 128; if (pstateMl < 0) pstateMl = 0; if (pstateH ] > 255) pstateH] .= 255; •output = pstateH]; J = 1; pstateH] = pstateH] - 128; pstateH] = 256 * pstateH ]; dstateHl = pstateH]; /* End of Hack */ for (i = 0; i < ilen; i + = frame_size) { Encoder(input + i, frame_size, min_pitch, max_pitch, output -t-j); j + = bs_size; } j -= bs_size; /* Number of vectors in last frame */ vcount = (ilen + f rame_size - i + vsize - 1 ) / vsize; temp = outputlj]; outputlj] = vcount + LAST_FRAME_FLAG; outputlj + vcount + 2] = temp; *olen = j + vcount + 3; } else { static long SampCount = 0; copy(input, output, 2*ilen); SampCount -t- = ilen; *olen = ilen; } } copy(a, b, len) short *a, *b; short len; { int i; for (i = 0; i < len; i-t- +) *b+ + = (*a+ +); } II. DECODER MODULE #include <Types.h> #include < Memory. h> #include <Quickdraw.h> #include <ToolUtils.h> #include < errors. h> #include <files.h> #include "vtcint.h" #include <stdlib.h> #include <math.h> #include <sysequ.h> #include < string. h> #define MAX_CBOOK_SIZE 256 #define LAST_FRAME_FLAG 128 #define PORDER 1 #define IPCONS 7 /* 7/8 */ 100000000 0 1 0 #define PFILT_ORDER 8 struct frame { unsigned gcode : 4; unsigned bcode : 4; unsigned pitch : 8; unsigned char vqcodetl; }: void expand(short **DecodeBook, short frame_size, short vsize, short min_pitch, struct frame *bs, short * output, short smpnum); get_compr_pars(short ratio, short frame_size, short *vsize, short *cbook_size, short *bs_size) { switch (ratio) { case 4: *vsize = 2; *cbook_size = 256; *bs_size = frame_size/2 + 2; break; case 7: * vsize = 4*; *cbook_size = 256; *bs_size = frame_size/4 -t- 2; break; case 14: *vsize = 8; *cbook_size = 256; *bs_size = frame_size/8 + 2; break; case 24: *vsize = 16; *cbook_size = 256; *bs_size = frame_size/16 -t- 2; break; default: * vsize = 2; *cbook_size = 256; *bs_size = frame_size/2 + 2; break; } short *Snlnit(short comp_ratio) { short * state, *ptr; int i; state = ptr = (short *)NewPtr((PFILT_ORDER+ 1 + PFILT_0RDER/2 + 2) sizeof (short)); if ( state = = nil ) { return nil; } for (i = 0;i<PFILT_ORDER+1;i++) *ptr+ + = 0; /* if (comp_ratio = = 24) { *ptr++ = 0.036953 * 32768 + 0.5; *ptr++ = -0.132232 * 32768-0.5; *ptr++ = 0.047798 * 32768 + 0.5; *ptr+ + = 0.403220 * 32768 + 0.5; *ptr+ + = 0.290033 * 32768 + 0.5; } else { *ptr++ = 0.074539 * 32768 + 0.5; *ptr+ + = -0.174290 * 32768 - 0.5; *ptr++ = 0.013704 * 32768 + 0.5; short * *SnDelnit(p, ratio, frame_size) short *p, ratio, frame_size; { int i; short cbook_size = 256, vsize = 1 6, bs_size; short * *DecodeBook; get_compr_pars(ratio, frame_size, &vsize, &cbook_size, &bs_size); DecodeBook = (short* *)NewPtr(cbook_size * sizeof(short*)); if (DecodeBook) { for (i = 0; i < cbook_size; i -t- 4- ) { DecodeBookli] = p; p 4- = vsize; } } return DecodeBook; } SnDeDone(char *DecodeBook) { if ( DecodeBook ! = nil ) { DisposPtr(DecodeBook); } } void expand(short **DecodeBook, short frame size, short vsize, short min_pitch, struct frame *bs, short *output, short smpnum) { short count; short *bptr, *sptr1, *sptr2; unsigned short pitch, bcode; / • short qlb_tab[] = { 1,2,3,4,5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 }; • / bcode = bs-> bcode; pitch = bs-> pitch 4- min_pitch - 1; /* Decode VQ vectors */ { unsigned char *cptr; short k, vsize_by_2; short rshift count = 7 - bs-> gcode; /* We want the output to be 14-bit number */ sptrl = output 4- smpnum; cptr = bs->vqcode; vsize_by_2 = (vsize > > 1) 4- 1; /* 4-1 since we do a while H) instead of while (i--) */ if (rshift_count) { for (k = 0; k < frame_size; k 4- = vsize) { ' bptr = DecodeBook! *cptr 4- 4-]; count = vsize_by_2; while (-count) { * sptrl 4- 4- = ((*bptr-t- -f) >> rshift_count); * sptrl 4- 4- = ((*bptr4-4J >> rshift_count); } } } else { for (k = 0; k < frame_size; k 4- = vsize) { bptr = DecodeBook! *cptr 4- ■ +•]; count = vsize_by_2; while (-count) { *sptr14- 4- = * bptr 4- 4-; *sptr14- 4- = *bptr+ - ; } } } } /* Inverse Filtering */ if (smpnum < pitch) { sptrl = output 4- pitch; count = smpnum 4- frame_size 4- 1 - pitch; /* 4-1 since we do a while (— i) instead of while (i~) */ sptr2 = sptrl - pitch; switch (bcode) { case 0: while (-count) *sptr14- 4- 4- = ((*sptr2- 4-) > > 4); break; case 1 : while (-count) • sptrl 4- 4- 4-= ((*sptr24- 4-) >> 3); break; case 2: while (-count) *sptr14-4- 4- = ((3 * (*sptr2+ +)) > > 4); break; case 3: while (-count) * sptrl 4- 4- 4- = ((*sptr24- +) >> 2); break; case 4: while (-count) *sptr14-4- 4- = ((5 * (*sptr2+ +)) > > 4); break; case 5: while (-count) *sptr14- + 4- = ((3 * (*sptr24- +)) > > 3); break; case 6: while (-count) *sptr1 + 4- 4- = ((7 * (*sptr2+ 4-)) > > 4); break: case 7: while (--count) * sptrl + 4- 4- = ((*sptr24- 4J >> 1); break; case 8: while (-count) { long tmp; tmp = *sptr2- 4-; *sptr14- 4- 4- = (((tmp < < 3) 4- tmp) > > 4); } break; case 9: while (--count) *sptr14-4- 4- = ((5 * (*sptr2+ 4-)) > > 3); break; case 10: while (-count) { long tmp; tmp = *sptr2-t- 4-; *sptr14* 4- 4* = (((tmp < < 3) 4- 3 * tmp) > > 4); } break; case 11 : while (—count) *sptr14-4- 4- = ((3 * (*sptr2-t- •+-)) >> 2); break; case 12: while (-count) { long tmp; tmp = *sptr24- 4-; *sptr14- 4- 4- = (((tmp < < 4) - 3 * tmp) > > 4); } break; case 13: while (--count) *sptr14-4- 4- = ((7 * (*sptr2-t- 4-)) > > 3); break; case 14: while (-count) { long tmp; tmp = *sptr24- 4-; • sptrl 4- 4- 4- = (((tmp < < 4) - tmp) > > 4); } break; case 15: while (--count) • sptrl 4- 4- 4- = f sptr24- 4-; break; } } else { sptrl = output 4- smpnum sptr2 = sptrl - pitch; count = (frame_size / 4) 4- 1; switch (bcode) { case 0: while (-count) { *sptr14- 4- + = ((*sptr2++) >> 4) *sptr14- -f -t- = ((*sptr2++) >> 4) *sptr14- 4- 4- = ((*sptr2++) >> 4) *sptr14- 4- 4- = ((*sptr2++) >> 4) } break; case 1 : while (-count) { *sptr14- -t- 4- = ((*sptr2++) >> 3) *sptr14- 4- 4- = ((*sptr2++) >> 3) *sptr14- ■ + • 4- = «*sptr2+4J >> 3) *sptr14- 4- 4- = ((*sptr24- 4-) > > 3) } break; case 2: while (-count) { *sptr14- 4- 4- = ((3 * (*sptr24-4-)) >> 4) *sptr14- 4- 4- = ((3 * (*sptr2++)) >> 4) *sptr14- 4- 4- = ({3 * (*sptr2++)) >> 4) *sptr1 -t- -t- -t- = ((3 * (*sptr2++» >> 4) } break; case 3: while (-count) { *sptr14-4- 4- ((*sptr2++) >> 2) *sptr14-4- 4- ((*sptr2++) >> 2) *sptr14-4- 4- ((*sptr2++) >> 2) *sptr14-4- 4- (Csptr2++) >> 2) } break; case 4: while (-count) { *sptr14-4- 4- ((5 * (*sptr2++)) >> 4) *sptr14-4- 4- ((5 * (*sptr2+4-)) >> 4) *sptr14-4- 4- ((5 * (*sptr2++)) >> 4) *sptr14-4- 4- ((5 * (*sptr2+4-)) >> 4) } break; case 5: while (--count) { • sptrl 4-4- 4- ((3 * (*sptr2+4J) >> 3) *sptr14- + 4 * ((3 * (*sptr2++)) >> 3) *sptr14-4- 4 * ((3 * <*sptr2+4J) >> 3) *sptr14-4- 4- ((3 * (*sptr2++)) >> 3) } break; case 6: while (-count) { *sptr14-4- 4- ((7 * (*sptr2-t-4-)) >> 4) *sptr14-4- 4- ((7 * (*sptr24-4J) >> 4) *sptr14-4- 4 * ((7 * (*sptr24-4-)) >> 4) *sptr14-4- 4- ((7 * (*sptr2-t-4J) >> 4) } break; case 7: while (-count) { • sptrl 4-4- 4- (Csptr24-4-) >> 1) •sptrl 4-4- 4- ((*sptr24-4J >> 1) • sptrl 4-4- 4- ((*sptr24-4-) >> 1) *sptr14-4- 4- ((*sptr24-4-) >> 1) } break; case 8: while (-count) { long tmp; tmp = *sptr2 4-; •sptrl 4-4- 4- ((8 * tmp 4- tmp) > > 4) tmp = *sptr2 4-; • sptrl 4-4- 4- ((8 * tmp 4- tmp) > > 4) tmp = *sptr2 + ; *sptr14-4- 4- ((8 * tmp 4- tmp) > > 4) tmp = *sptr2 • sptrl 4-4- 4- = ((8 * tmp 4- tmp) > > 4) } break; case 9: while (--count) { *sptr14-4- 4- ((5 * (*sptr2+4J) >> 3) • sptrl 4-4- 4- ((5 * (*sptr24-4J) >> 3) • sptrl 4-4- 4- ((5 * (*sptr24-4J) >> 3) *sptr14-4- 4- ((5 • (*sptr24-4-)) >> 3) } break; case 10: while (-count) { long tmp; tmp = *sptr2 + 4 * ; *sptr1 + 4- 4- = (((tmp < < 3) 4- 3 * tmp) > > 4); tmp = *sptr24- 4-; *sptr1 + 4- 4- = (((tmp < < 3) 4- 3 * tmp) > > 4); tmp = *sptr24- 4-; *sptr14- 4- 4- = (((tmp < < 3) 4- 3 * tmp) > > 4); tmp = *sptr2-t- 4-; *sptr14- 4- 4- = (((tmp < < 3) 4- 3 * tmp) > > 4); } break; case 11 : while (-count) { •sptrl 4- 4- 4- = ((3 • (*sptr2++)) >> 2) • sptrl 4-4- 4- ((3 * (*sptr2++)) >> 2) *sptr14-4- 4- ((3 • (*sptr2++)) >> 2) *sptr14-4- 4- ((3 * (*sptr2+4-)) >> 2) } break; case 12: while (-count) { long tmp; tmp = *sptr2-t- 4-; •sptrl 4- 4- 4* = (((tmp < < 4) - 3 • tmp) > > 4) tmp = *sptr2 + 4-; *sptr1 -t- 4- 4- = (((tmp < < 4) - 3 • tmp) > > 4) tmp = *sptr2 + 4-; *sptr14- 4- 4- = (((tmp < < 4) - 3 * tmp) > > 4) tmp = *sptr2-t- 4-; *sptr14- 4- 4- = (((tmp < < 4) - 3 * tmp) > > 4) } break; case 13: while (-count) { • sptrl 4-4- 4- ((7 * (*sptr2++)) >> 3) *sptr14-4- 4- ((7 • (*sptr2++» >> 3) *sptr14-4- 4- ((7 • (*sptr24-4J) >> 3) • sptrl 4-4- 4- ((7 • (*sptr2++)) >> 3) } break; case 14: while (-count) { long tmp; tmp = *sptr2-t- -f; *sptr14* 4- 4- = (((tmp < < 4) - tmp) > > 4) tmp = *sptr2-t- 4-; *sptr1 -t- -t- 4- = (((tmp < < 4) - tmp) > > 4) tmp = *sptr2-f 4-; *sptr14- 4- 4- = (((tmp < < 4) - tmp) > > 4) tmp = *sptr2-t- 4-; *sptr1 -t- + -t- = (((tmp < < 4) - tmp) > > 4) } } short SnDecompress(DecodeBook, ratio, frame_size, min_pitch, bstream, output) short * *DecodeBook, ratio; unsigned char *bstream; short * output, frame_size, min_pitch; { short count, SampCount; register short dstate; short vcount; short vsize, cbook_size, bs_size; get_compr_pars(ratio, frame_size, &vsize, &cbook_size, &bs_size); dstate = * bstream 4- -t- ; dstate = (dstate - 1 28) < < 6; SampCount = 0; while((* bstream & LAST_FRAME_FLAG) = = 0) { expand(DecodeBook, frame_size, vsize, min_pitch, (struct frame *)bstream, output, SampCount); bstream 4- = bs_size; SampCount 4- = frame_size; } vcount = * bstream - LAST_FRAME_FLAG; • bstream = *(bstream 4- 2 4* vcount); expand(DecodeBook, frame_size, vsize, min_pitch, (struct frame *)bstream, output, SampCount); •bstream = vcount 4- LAST_FRAME_FLAG; SampCount 4- = vcount * vsize; count = (SampCount > > 1 ) 4- 1 ; while (-count) { •output-!- 4* = dstate = ((IPCONS * dstate) > > 3) 4- *output; • output 4- + = dstate = ((IPCONS * dstate) > > 3) 4- *output; } output - = SampCount; return SampCount; * } #define FILTER state 4- PFILT 0RDER + 1 #define DC_VAL state 4- PFILT_ORDER 4- PFILT_0RDER/2 4- 2 void SnSampExpandFilt(short *src, short off, short len, char *dest, short *state) { short input, temp; long ace; register short dc = *(DC_VAL); register short *sptr1, *sptr2; sre 4- = off; len 4- 4-; sptrl = state; sptr2 = state 4- PF1LT_0RDER; while (--len) { input = *src4- 4- - dc; dc 4- = input > > 5; temp = input 4- *sptr14-4-; /* (state[0] 4- statelδ]) * filter[0] */ ace = temp * *(FILTER); temp = *-sptr2 4- *sptr14-4-; /* (stated] 4- state[7]) * filter[1] */ ace 4-= temp * * (FILTER 4- 1); temp = *-sptr2 4- *sptr14-4-; /* (state[2] + state[61) * filter[2] • / ace 4- = temp * *(FILTER4-2); temp = *-sptr2 4- *sptr14-4-; /* (state[3] 4- state[5]) * filter[3] */ ace 4- = temp * *(FILTER4-3); ace 4- = *sptr1 * "(FILTER + 4); /* state[4] * filter[4] */ if (ace > 0) { temp = (ace 4- (257 << 20)) >> 21; if (temp > 255) temp = 255; } else { temp = (ace 4- (255 << 20)) >> 21; if (temp < 0) temp = 0; } *dest4- -t- = temp; III. BLENDING MODULE /* A module for blending two diphones */ typedef struct { short Iptr, pitch; short weight, weightjnc; } bstate; void SnBlend(pitchp lp, pitehp rp, short cur_tot, short tot, short type, bstate *bs) { #pragma unused (tot) short count; short *ptr1 , *ptr2; jf (type = = VOICED) { if (cur_tot) return; { short weight; long min_amdf; short bestjag = 0, lag; short window_size; short weightjnc; /* First replicate the left pitch period */ ptrl = lp->bufp; ptr2 = ptrl 4- lp->olen; count = lp->olen 4- 1; while (-count) *ptr24- 4- = *ptr14- 4-; /* Smooth the discontinuity */ { register short en, e2; en = lp->bufp[2] 4- 3 * (lp->bufp[0] - lp->bufp[1l) - lp->bufp[lp->olen - 1]; e2 = lp->bufp[0] - lp->bufp[lp->olen - 1]; if (en * en > e2 e2) en = e2; ptr2 = lp->bufp 4- lp->olen; count* = (lp->olen >> 1) 4- 1: while (-count) { *--ptr24- = en; en = (((en < < 4) - en) > > 4); } } minjamdf = LARGEjMUM; windowjsize = rp->olen; if (lp->oien < rp->olen) window size = lp->olen; lag = rp->olen; while (-lag) { long amdf = 0; ptrl = rp->bufp; ptr2 = lp->bufp 4- lag; count = ((window 3ize4-3) >> 2) 4- 1; while (-count) { short tmp; tmp = ( * ptr 1 - *ptr2); if (tmp > 0) amdf 4- = tmp; else amdf -= tmp; ptrl 4- = 4; ptr2 4- = 4; } if (amdf < minjamdf) { bestjag = lag; minjamdf = amdf; } } bs-> pitch = lp->olen; /* Update left buffer */ if (bestjag < (lp->olen >> 1)) { /* Add bestjag samples to the length of left pulse*/ lp->olen 4- = bestjag; } else { /* Delete a few samples from the left pulse */ lp->olen = bestjag; } bs->lptr = bestjag; weightjnc = 32767/ windowjsize; weight = 32767 - weightjnc; ptrl = rp->bufp; ptr2 = lp->bufp 4- bs->lptr; count = windowjsize 4- 1; while (--count) { • ptrl 4- 4- 4- = (((short) (*ptr24- 4- - *ptr1) * weight) >> 15); weight -= weightjnc; } } } else { register short delta; /* Just blend 15 samples */ ptr2 = lp->bufp 4- lp->olen - 15; ptrl = rp->bufp; /* for (i = 1; i < 16; i 4- - ) { *ptr1 = *ptr2 4- (i * (*ptr1 - *ptr2)) > > 4; ptrl 4- 4-; ptr24- 4- ; } • / delta = *ptr1 - *ptr2; *ptr14- 4- = *ptr24- 4- 4- (delta > > 4); delta = *ptr1 - *ptr2; *ptrl4-4- = *ptr24-4- 4- ((delta) >> 3); delta = *ptr1 - *ptr2; *ptr14- 4- = *ptr2+ 4- 4- ((3 * delta) > > 4); delta = *ptr1 - *ptr2; • ptrl 4* 4- = *ptr24-4- 4- (delta >> 2); delta = *ptr1 - *ptr2; *ptr14- 4- = *ptr24- + 4- ((5 * delta) > > 4); delta = *ptr1 - *ptr2; *ptr1 + + = *ptr2+ 4- 4- ((3 * delta) > > 8); delta = *ptr1 - *ptr2; *ptr14- 4- = *ptr24- 4- 4- ((7 * delta) > > 4); delta = *ptr1 - *ptr2; *ptrl 4-+ = *ptr2+4- 4- (delta >> 1); delta = *ptr1 - *ptr2; *ptr14- 4- = *ptr24-4- 4- (((delta < < 3) 4- delta) >> 4); delta = *ptr1 - *ptr2; •ptrl 4- + = *ptr2+ 4* 4- ((5 * delta) > > 3); delta = *ptr1 - *ptr2; *ptr14- 4 * = *ptr24- 4- 4- (((delta < < 3) 4- 3 * delta) > > 4); delta = *ptr1 - *ptr2; •ptrl 4- 4- = *ptr2-t- 4- 4- ((3 * delta) > > 2); delta = *ptr1 - *ptr2; •ptrl 4- 4- = *ptr2-t- 4- 4- (((delta < < 4) - 3 * delta) > > 4); delta = *ptr1 - *ptr2; •ptrl 4- 4- = *ptr24- 4- 4- ((7 * delta) > > 3); delta = *ptr1 - *ptr2; •ptrl = *ptr2 4- (((delta < < 4) - delta) > > 4); lp->olen -= 15; IV. INTONATION ADJUSTMENT MODULE /* A module for deleting a pitch period */ /• Pointer srd points to Left Pitch period Pointer src2 points to Right Pitch period Pointer dst points to Resulting Pitch period len = length of the pitch periods */ skipjρulses(short *src1 , short *src2, short *dst, short len) { short i; register short weight, cweight; i = len 4- 1 ; weight = cweight = 32767/i; while (~i) { • dst 4* 4- = *src 1 4- 4- 4- (((short) ( *src2 -t- 4- - *src1 ) * cweight) > > 1 5); cweight 4- = weight; } } /• A module for Inserting a pitch period */ /• Locn bufferlcurbeg] points to Left Pitch period Locn bufferlcurbeg 4- curlen] points to Right Pitch period Pointer dst points to Resulting Pitch period curlen = length of the pitch periods */ insert pulse (short *buffer, short *dst, short curlen, short curbeg) { short weight, cweight, count; short *src1 , *src2; srd = buffer 4- curbeg; src2 = buffer 4- curbeg 4- curlen; weight = 32767 / curlen; cweight = weight; count = curlen -t- 1 ; while (-count) { •dst 4- 4- = *src 1 4- 4- = *src2 -t- 4- 4- (((short) ( *src1 - *src2) * cweight) > > 15); cweight 4- = weight; } } /* This module is used to change pitch information in the concatenated speech */ // This routine depends on the desired length (deslen) being at least half // and no more than twice the actual length (len). void SnChangePitchfshort * buf, short *next, short len, short deslen, short Ivoc, short rvoc, short dosmooth) { #pragma unused(rvoc, dosmooth) short delta; short count; short *bptr, *aptr; short weight, weightjnc; if (llvoc j ] (deslen = = len)) return; if (deslen > len) { /* Increase Pitch period */ delta = deslen - len; bptr = buf 4- len; aptr = buf 4- deslen; count = delta 4- 1 ; while (-count) *-aptr = *-bptr; count = len - delta 4- 1 ; weight = weightjnc = 32767 / count; while (-count) { register short tmp2; tmp2 = ( *-aptr - *-bptr); • aptr = * bptr 4- ((tmp2 * weight) > > 1 5); weight -t- = weightjnc; } return; /* Shorten Pitch Period */ short wsize; delta = len - deslen; wsize = 2 * delta; if (wsize > deslen) wsize = deslen; weightjnc = 32767 / (wsize 4- 1 ); weight = weightjnc; aptr = buf 4- deslen; bptr = buf 4- len - wsize; count = wsize - delta 4- 1 : while (--count) { *bptr+ 4- 4- = (((short) (*aptr+ -t- - *bptr) * weight ) > > 15); weight 4- = weightjnc; } aptr = buf 4- deslen; bptr - next; count = delta 4- 1 ; weight = 32767 - weight; while (--count) { •bptr 4- 4- 4- = (((short) (*aptr - 4- - *bptr) * weight ) > > 15); weight -= weightjnc; }

Claims: CLAIMS What is claimed is: 1 . An apparatus for concatenating a first digital frame of N samples having respective magnitudes representing a first quasi- periodic waveform and a second digital frame of M samples having respective magnitudes representing a second quasi-periodic waveform, comprising: a buffer store to store the samples of first and second digital frames; means, coupled to the buffer store, for determining a blend point for the first and second digital frames in response to magnitudes of samples in the first and second digital frames; blending means, coupled with the buffer store and the means for determining, for computing a digital sequence representing a concatenation of the first and second quasi-periodic waveforms in response to the first frame, the second frame and the blend point. 2. The apparatus of claim 1 , further including: transducer means, coupled to the means for computing, for transducing the digital sequence to an analog concatenated waveform. 3. The apparatus of claim 1 , wherein the means for determining includes: first means for computing an extended frame in response to the first digital frame; second means for finding a subset of the extended frame which matches the second digital frame relatively well, and defining the blend point as a sample in the subset. 4. The apparatus of claim 3, wherein the extended frame comprises a concatenation of the first digital frame with a replica of the first digital frame. 5. The apparatus of claim 3, wherein the subset of the extended frame which matches the second digital frame relatively well comprises a subset with a minimum average magnitude difference over the samples in the subset, and the blend point comprises a first sample in the subset. 6. The apparatus of claim 1 , wherein the means for determining includes: first means for computing an extended frame comprising a discontinuity-smoothed concatenation of the first digital frame with a replica of the first digital frame; second means for finding a subset of the extended frame with a minimum average magnitude difference between the samples in the subset and the second digital frame, and defining the blend point as a first sample in the subset. 7. The apparatus of claim 1 , wherein the blending means includes: means for supplying a first set of samples derived from the first digital frame and the blend point as a first segment of the digital sequence; and means for combining the second digital frame with a second set of samples derived from the first digital frame and the blend point, with emphasis on the second set in a starting sample and emphasis on the second digital frame in an ending sample to produce a second segment of the digital sequence. 8. The apparatus of claim 1 , wherein the means for determining includes: first means for computing an extended frame comprising a discontinuity-smoothed concatenation of the first digital frame with a replica of the first digital frame; second means for finding a subset of the extended frame with a minimum average magnitude difference between the samples in the subset and the second digital frame, and defining the blend point as a first sample in the subset; and wherein the blending means includes: means for supplying a first set of samples derived from the first digital frame and the blend point as a first segment of the digital sequence; and means for combining the second digital frame with the subset of the extended frame, with emphasis on the subset of the extended frame in a starting sample and emphasis on the second digital frame in an ending sample to produce a second segment of the digital sequence. 9. The apparatus of claim 8, wherein the first and second digital frames represent endings and beginnings respectively of adjacent diphones in speech, and further including: transducer means, coupled to the blending means, for transducing the digital sequence to an sound in speech synthesis. 10. An apparatus for concatenating a first digital frame of N samples having respective magnitudes representing a first sound segment and a second digital frame of M samples having respective magnitudes representing a second sound segment, comprising: a buffer store to store the samples of first and second digital frames; means, coupled to the buffer store, for determining a blend point for the first and second digital frames in response to magnitudes of samples in the first and second digital frames; blending means, coupled with the buffer store and the means for determining, for computing a digital sequence representing a concatenation of the first and second quasi-periodic waveforms in response to the first frame, the second frame and the blend point; and transducer means, coupled to the blending means, for transducing the digital sequence to sound. 1 1 . The apparatus of claim 10, wherein the means for determining includes: first means for computing an extended frame in response to the first digital frame; second means for finding a subset of the extended frame which matches the second digital frame relatively well, and defining the blend point as a sample in the subset. 1 2. The apparatus of claim 1 1 , wherein the extended frame comprises a concatenation of the first digital frame with a replica of the first digital frame. 1 3. The apparatus of claim 1 1 , wherein the subset of the extended frame which matches the second digital frame relatively well comprises a subset with a minimum average magnitude difference over the samples in the subset, and the blend point comprises a first sample in the subset. 14. The apparatus of claim 10, wherein the means for determining includes: first means for computing an extended frame comprising a discontinuity-smoothed concatenation of the first digital frame with a replica of the first digital frame; second means for finding a subset of the extended frame with a minimum average magnitude difference between the samples in the subset and the second digital frame, and defining the blend point as a first sample in the subset. 1 5. The apparatus of claim 10, wherein the blending means includes: means for supplying a first set of samples derived from the first digital frame and the blend point as a first segment of the digital sequence; and means for combining the second digital frame with a second set of samples derived from the first digital frame and the blend point, with emphasis on the second set in a starting sample and emphasis on the second digital frame in an ending sample to produce a second segment of the digital sequence. 1 6. The apparatus of claim 10, wherein the means for determining includes: first means for computing an extended frame comprising a discontinuity-smoothed concatenation of the first digital frame with a replica of the first digital frame; second means for finding a subset of the extended frame with a minimum average magnitude difference between the samples in the subset and the second digital frame, and defining the blend point as a first sample in the subset; and wherein the blending means includes: means for supplying a first set of samples derived from the first digital frame and the blend point as a first segment of the digital sequence; and means for combining the second digital frame with the subset of the extended frame, with emphasis on the subset of the extended frame in a starting sample and emphasis on the second digital frame in an ending sample to produce a second segment of the digital sequence. 1 7. The apparatus of claim 1 6, wherein the first and second digital frames represent endings and beginnings respectively of adjacent diphones in speech, and the transducer means produces synthesized speech. 1 8. An apparatus for synthesizing speech in response to a text, comprising: means for translating text to a sequence of sound segment codes; means, responsive to sound segment codes in the sequence, for decoding the sequence of sound segment codes to produce strings of digital frames of a plurality of samples representing sounds for respective sound segment codes in the sequence, wherein the identified strings of digital frames have beginnings and endings; means for concatenating a first digital frame at the ending of an identified string of digital frames of a particular sound segment code in the sequence with a second digital frame at the beginning an identified string of digital frames of an adjacent sound segment code in the sequence to produce a speech data sequence, including a buffer store to store the samples of first and second digital frames; means, coupled to the buffer store, for determining a blend point for the first and second digital frames in response to magnitudes of samples in the first and second digital frames; and blending means, coupled with the buffer store and the means for determining, for computing a digital sequence representing a concatenation of the first and second sound segments in response to the first frame, the second frame and the blend point; and an audio transducer, coupled to the means for concatenating, to generate synthesized speech in response to the speech data sequence. 1 9. The apparatus of claim 1 8, further including: means, responsive to the sound segment codes for adjusting pitch and duration of the identified strings of digital frames in the speech data sequence. 20. The apparatus of claim 1 8, wherein the means for determining includes: first means for computing an extended frame in response to the first digital frame; second means for finding a subset of the extended frame which matches the second digital frame relatively well, and defining the blend point as a sample in the subset. 21 . The apparatus of claim 20, wherein the extended frame comprises a concatenation of the first digital frame with a replica of the first digital frame. 22. The apparatus of claim 20, wherein the subset of the extended frame which matches the second digital frame relatively well comprises a subset with a minimum average magnitude difference over the samples in the subset, and the blend point comprises a first sample in the subset. 23. The apparatus of claim 1 8, wherein the means for determining includes: first means for computing an extended frame comprising a discontinuity-smoothed concatenation of the first digital frame with a replica of the first digital frame; second means for finding a subset of the extended frame with a minimum average magnitude difference between the samples in the subset and the second digital frame, and defining the blend point as a first sample in the subset. 24. The apparatus of claim 1 8, wherein the blending means includes: means for supplying a first set of samples derived from the first digital frame and the blend point as a first segment of the digital sequence; and means for combining the second digital frame with a second set of samples derived from the first digital frame and the blend point, with emphasis on the second set in a starting sample and emphasis on the second digital frame in an ending sample to produce a second segment of the digital sequence. 25. The apparatus of claim 1 8, wherein the means for determining includes: first means for computing an extended frame comprising a discontinuity-smoothed concatenation of the first digital frame with a replica of the first digital frame; second means for finding a subset of the extended frame with a minimum average magnitude difference between the samples in the subset and the second digital frame, and defining the blend point as a first sample in the subset; and wherein the blending means includes: means for supplying a first set of samples derived from the first digital frame and the blend point as a first segment of the digital sequence; and means for combining the second digital frame with the subset of the extended frame, with emphasis on the subset of the extended frame in a starting sample and emphasis on the second digital frame in an ending sample to produce a second segment of the digital sequence. 26. The apparatus of claim 1 8, wherein the sound segment codes represent speech diphones, and the first and second digital frames represent endings and beginnings respectively of adjacent diphones in speech.

Inventors: NARAYAN SHANKAR, NARAYAN, SHANKAR
Applicants: APPLE COMPUTER, NARAYAN SHANKAR, APPLE COMPUTER, INC., NARAYAN, SHANKAR
Application year: 1994
Main classification: G10L3
IPC codes: G10L13