US4852168A — Compression of stored waveforms for artificial sp…

Claim 1

Independent Claim 134 words

In a method of digitally converting text to speech, said method including the step of encoding waveforms representing sounds in the form of digital indices representing addresses in a table containing selected values of Δ, and the successive samples of the waveform are computed by the formula S.sub.t =aS.sub.t-1 +bS.sub.t-2 +Δ where S t is the sample being computed, S t-1 is the next preceding sample, S t-2 is the second preceding sample, a and b are constants, and Δ is the value stored in said table at the address defined by the index corresponding to S t , the improvement comprising encoding said indices by a Huffman coding in which the shortest codes of said Huffman coding represent the addresses of the Δ values occurring most frequently in the computation of said waveform.

Claim 2

Dependent Claim 134 words

In a method of digitally converting text to speech, said method including the step of encoding waveforms representing sounds in the form of digital indices representing addresses in a table containing selected values of Δ, and the successive samples of the waveform are computed by the formula S.sub.t =aS.sub.t-1 +bS.sub.t-2 +Δ where S t is the sample being computed, S t-1 is the next preceding sample, S t-2 is the second preceding sample, a and b are constants, and Δ is the value stored in said table at the address defined by the index corresponding to S t , the improvement comprising encoding said indices by a Huffman coding in which the shortest codes of said Huffman coding represent the addresses of the Δ values occurring most frequently in the computation of said waveform.

Claim 3

Dependent Claim 18 words

The improvement of claim 1, in which said table is stored in system memory immediately following said indices.

Claim 4

Dependent Claim 25 words

The improvement of claim 2, in which said table contains less than the maximum number of Δ values that can be addressed by said indices.

Claim 5

Dependent Claim 143 words

In a real-time text-to-speech conversion system in which waveforms are encoded in the form of digital indices representing addresses in a table containing selected values of Δ, and the successive samples of the waveform are computed by the formula S.sub.t =aS.sub.t-1 +bS.sub.t-2 +Δ where S t is the sample being computed, S t-1 is the next preceding sample, S t-2 is the second preceding sample, a and b are constants, and Δ is the value stored in said table at the address defined by the index corresponding to S t , the improvement comprising: (a) encoding successive waveforms so that each S t represents the difference between the corresponding waveform sample and the corresponding sample of a preceding waveform; and (b) adding each S t to the corresponding sample of said preceding waveform to form the corresponding sample of the waveform being computed.

Claim 6

Dependent Claim 143 words

In a real-time text-to-speech conversion system in which waveforms are encoded in the form of digital indices representing addresses in a table containing selected values of Δ, and the successive samples of the waveform are computed by the formula S.sub.t =aS.sub.t-1 +bS.sub.t-2 +Δ where S t is the sample being computed, S t-1 is the next preceding sample, S t-2 is the second preceding sample, a and b are constants, and Δ is the value stored in said table at the address defined by the index corresponding to S t , the improvement comprising: (a) encoding successive waveforms so that each S t represents the difference between the corresponding waveform sample and the corresponding sample of a preceding waveform; and (b) adding each S t to the corresponding sample of said preceding waveform to form the corresponding sample of the waveform being computed.

Claim 7

Dependent Claim 49 words

The improvement of claim 4, in which, when said preceding waveform and said waveform being computed have different numbers of samples, the shorter waveform is treated in the computation as if it were padded with sufficient zero value samples to equal the number of samples in the longer waveform.

Claim 8

Dependent Claim 113 words

In a real-time text-to-speech conversion system in which waveforms are encoded in the form of digital indices representing addresses in a table containing selected values of Δ, and the successive samples of the waveform are computed by the formula S.sub.t =aS.sub.t-1 +bS.sub.t-2 +Δ S t is the sample being computed, S t-1 is the next preceding sample, S t-2 is the second preceding sample, a and b are constants, and Δ is the value stored in said table at the address defined by the index corresponding to S t , the improvement comprising providing a single table for a plurality of waveforms, said single table being addressable by the indices of each waveform.

Claim 9

Dependent Claim 113 words

In a real-time text-to-speech conversion system in which waveforms are encoded in the form of digital indices representing addresses in a table containing selected values of Δ, and the successive samples of the waveform are computed by the formula S.sub.t =aS.sub.t-1 +bS.sub.t-2 +Δ S t is the sample being computed, S t-1 is the next preceding sample, S t-2 is the second preceding sample, a and b are constants, and Δ is the value stored in said table at the address defined by the index corresponding to S t , the improvement comprising providing a single table for a plurality of waveforms, said single table being addressable by the indices of each waveform.

Claim 10

Dependent Claim 123 words

In a real-time text-to-speech conversion system in which waveforms are encoded in the form of digital indices representing addresses in a table containing selected values of Δ, and the successive samples of the waveform are computed by the formula S.sub.t =aS.sub.t-1 +bS.sub.t-2 +Δ where S t is the sample being computed, S t-1 is the next preceding sample, S t-2 is the second preceding sample, a and b are constants, and Δ is the value stored in said table at the address defined by the index corresponding to S t , the improvement comprising encoding, in place of a plurality of different actual waveforms, a single compromise waveform precomputed off-line to contain the fewest possible differences from each of said plurality of waveforms.

Claim 11

Dependent Claim 123 words

In a real-time text-to-speech conversion system in which waveforms are encoded in the form of digital indices representing addresses in a table containing selected values of Δ, and the successive samples of the waveform are computed by the formula S.sub.t =aS.sub.t-1 +bS.sub.t-2 +Δ where S t is the sample being computed, S t-1 is the next preceding sample, S t-2 is the second preceding sample, a and b are constants, and Δ is the value stored in said table at the address defined by the index corresponding to S t , the improvement comprising encoding, in place of a plurality of different actual waveforms, a single compromise waveform precomputed off-line to contain the fewest possible differences from each of said plurality of waveforms.

Claim 12

Dependent Claim 54 words

In a method of digitally converting text to speech, said method including the step of producing fricative sounds by concatenating a plurality of segments each containing a plurality of repetitions of a digitally encoded waveform, the improvement comprising the step of increasingly truncating said waveform for each of said repetitions in any given segment.

Claim 13

Dependent Claim 54 words

In a method of digitally converting text to speech, said method including the step of producing fricative sounds by concatenating a plurality of segments each containing a plurality of repetitions of a digitally encoded waveform, the improvement comprising the step of increasingly truncating said waveform for each of said repetitions in any given segment.

Claim 14

Dependent Claim 24 words

The improvement of claim 8, in which the number n of samples in the i'th repetition of a waveform containing N samples is ##EQU2##

Claim 15

Dependent Claim 65 words

In a method of digitally converting text to speech, said method including the step of producing fricative sounds by concatenating a plurality of segments each containing a plurality of repetitions of a digitally encoded waveform, said segments containing different amplitudes of said waveform, the improvement comprising the step of progressively inteprolating the waveform of one of said segments with the waveform of an adjacent segment.

Claim 16

Dependent Claim 65 words

In a method of digitally converting text to speech, said method including the step of producing fricative sounds by concatenating a plurality of segments each containing a plurality of repetitions of a digitally encoded waveform, said segments containing different amplitudes of said waveform, the improvement comprising the step of progressively inteprolating the waveform of one of said segments with the waveform of an adjacent segment.

Claim 17

Dependent Claim 77 words

In a method of digitally converting text to speech, said method including the step of producing speech by concatenating a plurality of segments each containing at least one concantenated repetation of a stored digitally encoded waveform, a method of varying the speed of the speech comprising the steps of: (a) reiteratively counting said concatenated waveform repetitions; (b) deleting or repeating one of said waveform repetitions when said count reaches a selectable number; and (c) varying said number.

Claim 18

Dependent Claim 77 words

In a method of digitally converting text to speech, said method including the step of producing speech by concatenating a plurality of segments each containing at least one concantenated repetation of a stored digitally encoded waveform, a method of varying the speed of the speech comprising the steps of: (a) reiteratively counting said concatenated waveform repetitions; (b) deleting or repeating one of said waveform repetitions when said count reaches a selectable number; and (c) varying said number.

Claim 19

Dependent Claim 41 words

The method of claim 11, in which said segments are defined by segments blocks containing an index representing the number of waveform repetitions in the segment, and said index is temporarily incremented or decremented whenever said count reaches said selectable number.

Claim 20

Dependent Claim 26 words

The method of claim 12, in which said segment is omitted when said index becomes other than a positive integer as a result of being decremented.

Claim 21

Dependent Claim 117 words

In a method of digitally converting text to speech, said method including the step of producing speech by concatenating a plurality of segments each containing at least one concatenated repetition of a stored digitally encoded waveform, and in which the waveforms of predetermined successive segments are interpolated in accordance with the formula ##EQU3## where S t out is the output signal for a given sample; S t in is the input signal for that sample; S t-1 out is the output signal for the previous sample; and k is a non-negative integer, a method of preventing the slurring of formants comprising the step of varying the value of k in accordance with the speed of the speech.

Claim 22

Dependent Claim 117 words

In a method of digitally converting text to speech, said method including the step of producing speech by concatenating a plurality of segments each containing at least one concatenated repetition of a stored digitally encoded waveform, and in which the waveforms of predetermined successive segments are interpolated in accordance with the formula ##EQU3## where S t out is the output signal for a given sample; S t in is the input signal for that sample; S t-1 out is the output signal for the previous sample; and k is a non-negative integer, a method of preventing the slurring of formants comprising the step of varying the value of k in accordance with the speed of the speech.

Claim 23

Dependent Claim 27 words

The method of claim 14, in which the value of k is 2 for normal speech, 1 for accelerated speech, and 3 or 4 for slowed speech.

Claim 24

Dependent Claim 21 words

The method of claim 14, in which the interpolation of said waveforms is selectively disabled by making k equal to zero.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	1992-07-24	1993-01-23	1993-07-25	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	1996-07-24	1997-01-23	1997-07-25	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2000-07-24	2001-01-23	2001-07-25	$7700.00	Window Closed / Lapsed

Compression of stored waveforms for artificial speech

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag