SPEECH PATTERN PROCESSING UTILIZING SPEECH PATTERN COMPRESSION

Abstract: A speech pattern is compressed to a degree not previously attainable by analyzing the pattern to generate (210, 215, 275, 280) a sequence of signals representative of its acoustic feature at a first rate. Responsive to the acoustic feature feature signals, a sequence of speech event representative signals is generated (225, 275, 280). A sequence of coded signals corresponding to the speech pattern is formed (235, 275, 280) at rate less than said first rate responsive to the speech event representative signals.

Description: SPEECH PATTERN PROCESSING UTILIZING SPEECH PATTERN COMPRESSION Background of the Invention My invention relates to speech processing and, particularly, to the compression of speech patterns and to the synthesis of speech patterns from such compressed patterns. It is generally accepted that a speech signal requires a bandwidth of at least 4 kHz for reasonable intelligibility. In digital speech processing systems such as speech synthesizers, recognizers, or coders, the channel capacity needed for transmission or memory required for storage of the digital elements of the full 4 kHz bandwidth waveform is very large. Many techniques have been devised to reduce the number of digital codes needed to represent a speech signal. Waveform coding such as Pulse Code Modulation (PCM) , Differential Pulse Code Modulation (DPCM) , Delta Modulation or adaptive predictive coding result in natural sounding, high quality speech at bit rates between 16 and 64 kbps. The speech quality obtained from waveform coders, however, degrades as the bit rate is reduced below 16 kbps. An alternative speech coding technique disclosed in U. S. Patent 3,624,302 utilizes a small number, e.g., 12-16, of slowly varying parameters which may be processed to produce a low distortion replica of a speech pattern. Such parameters, e.g.. Linear Prediction Coefficient (LPC) or log area, generated by linear prediction analysis can be spectrum limited to 50 Hz without significant band limiting distortion. Encoding of the LPC or log area parameters generally requires sampling at a rate of twice the bandwidth and quantizing each resulting frame of log area parameters. Each frame of a log area parameter can be quantized using 48 bits. Consequently, 12 log area parameters each having a 50 Hz bandwidth results in a total OMPI bit.rate of 4800 bits/sec. Further reduction of bandwidth decreases the bit rate, but the resulting increase in distortion interferes with the intelligibility of speech synthesized from the lower bandwidth parameters. It is well known that sounds in speech patterns do not occur at a uniform rate and techniques have been devised to take into account such nonunifor occurrences. U. S. Patent 4,349,700 discloses arrangements that permit recognition of speech patterns having diverse sound patterns utilizing dynamic programming. U. S. Patent 4,038,503 discloses a technique for nonlinear warping of time intervals of speech patterns so that the sound features are represented in a more uniform manner. These arrangements, however, require storing and processing acoustic feature signals that are sampled at a rate corresponding to the most rapidly changing feature in the pattern. It is an object of the invention to provide an improved speech representation and/or speech synthesis arrangements having reduced digital storage and processing requirements. Summary of the Invention Sounds or events in human speech are produced at an average rate that varies between 10 and 20 events per second. It has been observed that such speech events generally occur at nonuniformly spaced time intervals and that articulatory movements differ widely for various speech sounds. Consequently, a significant degree of compression may be achieved by transforming acoustic feature parameters into short speech event related units located at nonuniformly spaced time intervals. The coding of such speech event units results in higher efficiency without degradation of the accuracy of the the pattern representation. The invention is directed to an arrangement for compressing speech in which a speech pattern is analyzed to generate a set of signals representative of acoustic features of a speech pattern at a first rate. A sequence of signals representative of acoustic features of successive speech events in the speech pattern is produced responsive to said acoustic feature signals and a digitally coded signal corresponding to each speech event representative signal is produced at a rate less than said first rate. According to one aspect of the invention a speech pattern is synthesized by storing a prescribed set of speech element signals, combining said speech element signals to form a signal representative of the acoustic features of a speech pattern, and producing said speech pattern responsive to the set of acoustic feature signals. The prescribed speech element signals are formed by analyzing a speech pattern to generate a set of acoustic feature representative signals at a first rate. A sequence of signals representative of acoustic features of successive speech events in said speech pattern is produced responsive to said sampled acoustic feature signals and a sequence of digitally coded signals corresponding to the speech event representative signal is formed at a rate less than said first rate. Description of the Drawing FIG. 1 depicts a flowchart illustrating the general method of the invention; FIG. 2 depicts a block diagram of a speech pattern coding circuit illustrative of the invention; FIGS. 3-8 depict detailed flowcharts illustrating the operation of the circuit of FIG. 2; FIG. 9 depicts a speech synthesizer illustrative of the invention; FIG. 10 depicts a flow chart illustrating the operation of the circuit of FIG. 9; FIG. 11 shows a waveform illustrating a speech event timing signal obtained in the circuit of FIG. 2; and FIG. 12 shows waveforms illustrative of a speech pattern and the speech event feature signals associated therewith. General Description It is well known in the art to represent a speech pattern by a sequence of acoustic feature signals derived from a linear prediction or other spectral analysis. Log area parameter signals sampled at closely spaced time intervals have been used in speech synthesis to obtain efficient representation of a speech pattern. In accordance with the invention, log area parameters are transformed into a sequence of individual speech event feature signals Φ k (n) such that the log area parameters m l < n < N l < i < p The speech event feature signals Φ j (n) are sequential and occur at the speech event rate of the pattern which is substantially lower than the the log area parameter frame rate. In equation (1) , £ is the total number of log area parameters y^ (n) determined by linear prediction analysis, in corresponds to the number of speech events in the pattern, n is the index of samples in the speech pattern at the sampling rate of the log area parameters, Φ jζ fn) is the kth speech- event signal at sampling instant ri, and a^ is a combining coefficient corresponding to the contribution of the kth speech event function to the ith log area parameter. Equation (1) may be expressed in matrix form as Y = A (2) where Y is a pxN matrix whose (_^,n_) element is y^(n), A is a pxm matrix whose (i_,J element is a^, and φ is an mxN matrix whose (k_,n_) element is Φ k (n). Since each speech event k_ occupies only a small segment of the speech pattern, the signal Φ j ^Cn) representative thereof should be non-zero over only a small range of the sampling intervals of the total pattern. Each log area parameter yi ( n ) in equation (1) is a linear combination of the speech event functions - Cn) and the bandwidth of each y^ (n) parameter is the maximum bandwidth of any one of the speech event functions Φ-^fn). It is therefore readily seen that the direct coding of y^ (n) signals will take more bits than the coding of the Φ- ζ (n) switch event signals and the combining coefficient signals a^ in equation (1) . FIG. 1 shows a flow chart illustrative of the general method of the invention. In accordance with the invention, a speech pattern is analyzed to form a sequence of signals representative of log area parameter acoustic feature signals. It is to be understood, however, that LPC, Partial Autocorrelation (PARCOR) or other speech features (see, e.g., U.S. patent 3,624,302) may be used instead of log area parameters. The feature signals are then converted into a set of speech event representative signals that are " encoded at a lower bit rate for transmission or storage. With reference to FIG. 1, box 101 is entered in which an electrical signal corresponding to a speech pattern is low pass filtered to remove unwanted higher frequency noise and speech components and the filtered signal is sampled at twice the low pass filtering cutoff frequency The speech pattern samples are then converted into a sequence of digitally coded signals corresponding to the pattern as per box 110. Since the storage required for the sample signals is too large for most practical applications, they are utilized to generate log area parameter signals as per box 120 by linear prediction techniques well known in the art. The log area parameter signals y^ (n) are produced at a constant sampling rate high enough to accurately represent the fastest expected event in the speech pattern. Typically, a sampling interval between two and five milliseconds is selected. After the log area parameter signals are stored, the times of occurrence of the successive speech events in the pattern are detected and signals representative of the f OM event timing are generated and stored as per box 130. This is done by partitioning the pattern into prescribed smaller segments, e.g., 0.25 second intervals. For each successive interval having a beginning frame n^ and an ending frame n e , a matrix of log area parameter signals is formed corresponding to the log area parameters y^ (n) of the segment. The redundancy in the matrix is reduced by factoring out the first four principal components so that yi (n) = ∑ [c im u m (n) 3 (3) m=l and um(n) = .Σ, [Lβ M m. iy--- 1. (n) '-l> (4) ι=l The first four principal components may be obtained by methods well known in the art such as described in the article "An Efficient Linear Prediction Vocoder" by M. R. Sambur appearing in the Bell System Technical Journal Vol. 54, No. 10, pp. 1693-1723, December 1975. The resulting u m (n) functions may be linearly combined to define the desired speech event signals as *k (n) - Σ - fckm u rα (n) -J (5) m-=ι by selecting coefficients b km such that each (n) are most compact in time. In this way, the speech pattern is represented by a sequence of successive compact (minimum spreading) speech event feature signals Φ-^Cn) each of which can be efficiently coded. In order to obtain the shapes and locations of the speech event signals, a distance measure Θ(L) = π∑(n-L) 2 φ 2 (n)/Σφ 2 (nj] 1 ' /2 (6) n n OMPI is minimized to choose the optimum Φ (n) and its location is obtained from a speech event timing signal v(L) = [∑(n-L)φ 2" (n)] /∑φ 2 (n) (7) n n In terms of equations 5, 6, and 7, a speech event signal φ k (n) with minimum spreading is centered at each negative zero crossing of v(L) . Subsequent to the generation of the v(L) signals in box 130, box 140 is entered and the speech event signals Φ j (n) are accurately determined using the process of box 130 with the speech event occurrence signals from the negative going zero crossings of v(L). Having generated the sequence of speech event representative signals, the combining coefficients a^ in equations (1) and (2) may be generated by minimizing the- mean-squared error E = £ [Y (n) - k Ϊ ! a iΛ (n) ] (8) where M is the total number of speech events within the range of index ri over which the sum is performed. The partial derivatives of E with respect to the coefficients are obtained from the set of simultaneous linear equations M ∑ a. Σφ v (n)Φ r (n) = ∑y. (n)φ (n) (9) k=l n κ n 1<_ r <_ 1<_ i <P Detailed Description FIG. 2 shows a speech coding arrangement that includes electroacoustic transducer 201, filter and sampler circuit -203, analog to digital converter 205, and speech sample store 210 which cooperate to convert a speech pattern into a stored sequence of digital codes representative of the pattern. Central processor 275 may comprise a microprocessor such as the Motorola type MC68000 controlled by permanently stored instructions in read only memories (ROM) 215, 220, 225, 230 and 235. Processor 275 is adapted to direct the operations of arithmetic processor 280, and stores 210, 240, 245, 250, 255 and 260 so that the digital codes from store 210 are compressed into a compact set of speech event feature signals. The speech event feature signals are then supplied to utilization device 285 via input output interface 265. The utilization device may be a digital communication facility or a storage arrangement for delayed transmission or a store associated with a speech synthesizer. The Motorola MC68000 integrated circuit is described in the publication MC68000 16 Bit Microprocessor User's Manual, second edition. Motorola, Inc., 1980 and arithmetic processor 280 may comprise the TRW type MPY-16HJ integrated circuit. Referring to FIG. 2, a speech pattern is applied to electroacoustic transducer 201 and the electrical signal therefrom .is supplied to low pass filter and sampler circuit 203 which is operative to limit the upper end of the signal bandwidth to 3.5 KHz and to sample the filtered signal at an 8 KHz rate. Analog to digital converter 205 converts the sampled signal from filter and sampler 203 into a sequence of digital codes, each representative of the magnitude of a signal sample. The resulting digital codes are sequentially stored in speech sample store 210. Subsequent to the storage of the sampled speech pattern codes in store 210, central processor 275 causes the instructions stored in log area parameter program store 215 to be transferred to the random access memory associated with the central processor. The flow chart of FIG. 3 illustrates the sequence of operations performed by I the controller responsive to the instructions from store 215. Referring to FIG. 3, box 305 is initially entered and frame count index n * - s reset to 1. The speech samples of the current frame are then transferred from store 210 to arithmetic processor 280 via central processor 275 as per box 310. The occurrence of an end of speech sample signal is checked in decision box 315. Until the detection of the end of speech pattern signal, control is passed to box 325 and an LPC analysis is performed for the frame in processors 275 and 280. The LPC parameter signals of the current frame are then converted to log area parameter signals - ^ (k) as per box 330 and the log area parameter signals are stored in log area parameter store 240 (box 335) . The frame count is incremented by one in box 345 and the speech samples of the next frame are read (box 310) . When the end of speech pattern signal occurs, control is passed to box 320 and a signal corresponding to the number of frames in the pattern is stored in processor 275. Central processor 275 is operative after the log area parameter storing operation is completed to transfer the stored instructions of ROM 220 into its random access memory. The instruction codes from store 220 correspond to the operations illustrated in the flow chart of FIGS. 4 and 5. These instruction codes are effective to generate a signal v(L) from which the occurrences of the speech events in the speech pattern may be detected and located. Referring to FIG. 4, the frame count of the log area parameters is initially reset in processor 275 as per box 403 and the log area parameters y^ (n) for an initial time interval n^ to n2 of the speech pattern are transferred from log area parameter store 240 to processor 275 (box 410) . After determining whether the end of the speech pattern has been reached in decision box 415, box 420 is entered and the redundancy of the log area parameter signals is removed by factoring out the first four-principal components u^ (n) , i=l,...,4 as aforementioned. The log area parameters of the current time interval are then represented by from which a set of signals 16 are to be obtained. The u^(n) signals over the interval may be combined through use of parameters b^, i=l,... ,4, in box 425 so that a set of signals Φ k (n) = ∑ [b. u (n.)J (12) m=l km m are produced such that φ ^ is most compact over the range n- to n2« This is accomplished through use of the θ (L) function of equation 6. A signal v(L) representative of the speech. event timing of the speech pattern is then formed in accordance with equation 7 in box 430 and the v(L) signal is stored in timing parameter store 245. Frame counter n_ is incremented by a constant value, e.g., 5, on the basis of how close adjacent speech event signals Φ ] (n) are expected to occur (box 435) and box 410 is reentered to generate the φ k (n) and v(L) signals for the next time interval of the speech pattern. When the end of the speech pattern is detected in decision box 415, the frame count of the speech pattern is stored (box 440) and the generation of the speech event timing parameter signal for the speech pattern is completed. FIG. 11 illustrates the speech event timing parameter signal for the an utterance exemplary message. Each negative going zero crossing in FIG. 11 corresponds to the centroid of a speech event feature signal Φ -(n). Referring to FIG. 5, box 501 is entered in which speech event index I is reset to zero and frame index n_ is again reset to one. After indices I and n_ are initialized, the successive frames of speech event timing parameter signal are read from store 245 (box 505) and zero crossings therein are detected in processor 275 as per box 510. Whenever a zero crossing is found, the speech event index I is incremented (box 515) and the speech event location frame is stored in speech event location store 250 (box 520) . The frame index n_ is then incremented in box 525 and a check is made for the end of the speech pattern frames in box 530. Until the end of speech pattern frames signal is -detected, box 505 is reentered from box 530 after each iteration to detect the subsequent speech event location frames of the pattern. Upon detection of end of the speech pattern signal in box 530, central processor 235 addresses speech event feature signal generation program store 225 and causes its contents to be transferred to the processor. Central processor 275 and arithmetic processor 280 are thereby adapted to form a sequence of speech event feature signals ( ) responsive to the log area parameter signals in store 240 and the speech event location signals in store 250. The speech event feature signal generation instructions are illustrated in the flow chart of FIG. 6. Initially, location index I is set to one as per box 601 and the locations of the speech events in store 250 are transferred to central processor 275 (box 605) . As per box 610, the limit frames for a prescribed number of speech event locations, e.g., 5, are determined. The log area parameters for the speech pattern interval defined by the limit frames are read from store 240 and are placed in a section of the memory of central processor 275 (box 615) . The redundancy in the log area parameters is removed by factoring out the number of principal components therein corresponding to the number of prescribed number of events (box 620). Immediately thereafter, the speech event feature signal φ L (n) for the current location L is generated. The minimization of equation (6) to determine φ L (n) is accomplished by forming the derivative (n)J ( 13 ) where m Φ(n) = Σ i u i (n) (14) i=l m is the prescribed number of speech events and _r can be either 1,2,..., or m. The derivative of equation (13) is set equal to zero to determine the minimum and - ?2 φ(n) .a -tel / ;2 φ 2 (n) (15) n=n r n=n. is obtained. From equation (14) so that equation (15) can be changed to OMPI n 9 "2 = (n-L) 2 φ 2 (n)/ Σ 2 Φ ( π ) j |∑ Φ(n)u ( n= n»] (17) n n=l n=n. φ (n) in equation (17) can be replaced by the right side of equation 14. Thus, n 2 2 M Z (n-L) Σ b i u i (n)u r (n) (18) n=n, i=l where n. n. λ = (n-L) 2 φ 2 (n)/ Φ 2 (n) = min. value θ (L) (19) n=n. n=n. Rearranging equation (18) yields n- Σ b j _ Δ (n-L)^u i (n)u r (n) i=l n=n, M rx =θ (L) Σ b i Σ u i (n)u r (n) (20) i=l n=n_. OMPI Since u^ (n) is the principal component of matrix Y, n. u i (n)u r (n) = 0 i ≠ r n=n., = 1 i = r (21) 10 equation (20) can be simplified to M 15 .^ b i R ir = V {L) (22) where (n) (23) Equation (22) can be expressed in matrix notation as Rb = Lb (24) where 25 λ = θ (L) (25) Equation 25 has exactly πi solutions and the solution which minimizes θ (L) is the one for which λ is minimum. The coefficients b-^ , b2,..->,b m for which λ = Θ(L) attains its 30 minimum value results in the optimum speech event feature signal Φ L (n) . In FIG. 6, the speech event feature signal Φ L (n) is generated in box 625 and is stored in store 255. Until the end of the speech pattern is detected in decision 35 box 635, the loop including boxes 605, 610, 615, 620, 625 O and ' 630 is iterated so that the complete sequence of speech events for the speech pattern is formed. FIG. 12 shows waveforms illustrating a speech pattern and the speech event feature signals generated therefrom in accordance with the invention. Waveform 1201 corresponds to a portion of a speech pattern and waveforms 1205-1 through 1205-n correspond to the sequence of speech event feature signals ^(n) obtained from the waveform in the circuit of FIG. 2. Each feature signal is representative of 'the acoustic characteristics of a speech event of the pattern of waveform 1201. The speech event feature signals may be combined with coefficients a^ of equation 1 to reform log area parameter signals that are representative of the acoustic features of the speech pattern. Upon completion of the operations shown in Fig. 6, the sequence of speech event feature signals for the speech pattern is stored in store 255. Each speech event feature signal Φ j (n) is encoded and transferred to utilization device 285 as illustrated in the flow chart of FIG. 7. Central processor is adapted to receive the speech event signal encoding program instruction set stored in ROM 235. -Referring to FIG. 7, the speech event index I is reset to one as per box 701 and the speech event feature signal Φ- j -(n) is read from store 255. The sampling rate for the current speech event feature signal is selected in box 710 by one of the many methods well known in the art. For example, the instruction codes perform a Fourier analysis and generate a signal corresponding to the upper band limit of the feature signal from which a sampling rate signal j is determined. As is well known in the art, the sampling rate need only be sufficient to adequately represent the feature signal. Thus, a slowly changing feature signal may utilize a lower sampling rate than a rapidly changing feature signal and the sampling rate for each feature signal may be different. Once a sampling rate signal has been determined for- speech event feature signal φ j (n), it is encoded at rate R-r as per box 715. Any of the well-known encoding schemes can be used. For example, each sample may be converted into a PCM, ADPCM or Δ modulated signal and concatenated with a signal indicative of the feature signal location in the speech pattern and a signal representative of the sampling rate R ∑ . The coded speech event feature signal is then transferred to utilization device 285 via input output interface 265. Speech event index I is then incremented (box 720) and decision box 725 is entered to determine if the last speech event signal has been coded. The loop including boxes 705 through 725 is iterated until the last speech event signal has been encoded (I>I F ) at which time the coding of the speech event feature signals is completed. The speech event feature signals must be combined in accordance with equation 1 to form replicas of the log area feature signals therein. Accordingly, the combining coefficients for the speech pattern are generated and encoded as shown in the flow chart of FIG. 8. After the speech event feature signal encoding, central processor 275 is conditioned to read the contents of ROM 225. The instruction codes permanently stored in the ROM control the formation and encoding of the combining coefficients. The combining coefficients are produced for the entire speech pattern by matrix processing in central processor 275 and arithmetic processor 280. Referring to FIG. 8, the log area parameters of the speech pattern are transferred to processor 275 as per box 801. A speech event feature signal coefficient matrix G is generated (box 805) in accordance with g kr =∑Φ k (n)Φ r (n) (26) and a Y-Φ correlation matrix C is formed (box 810) in accordance with OMPI c ir =∑y i (n) φ r (n) ( 27) n The combining coefficient matrix is then produced as per box 815 according to the relationship A=G~ 1 C (28) The elements of matrix A are the combining coefficients a^ of equation 1. These combining coefficients are encoded, as is well known in the art, in box 820 and the encoded coefficients are transferred to utilization device 285. In accordance with the invention, the linear predictive parameters sampled at a rate corresponding to the most rapid change therein are converted into a sequence of speech event feature signals that are encoded at the much lower speech event occurrence rate and the speech pattern is further compressed to reduce transmission and storage requirements without adversely affecting intelligibility. Utilization device 285 may be a communication facility connected to one of the many speech synthesizer circuits using an LPC all pole filter known in the art. The circuit of FIG. 2 is adapted to compress a spoken message into a sequence of coded speech event feature signals which are transmitted via utilization device 285 to a synthesizer. In the synthesizer, the speech event feature signals and the combining coefficients of the message are decoded and recombined to form the message log area parameter signals. These log area parameter signals are then utilized to produce a replica of the original message. FIG. 9 depicts a block diagram of a speech synthesizer circuit illustrative of the invention and FIG. 10 shows a flow chart illustrating its operation. Store 915 of FIG. 9 is adapted to store the successive coded speech event feature signals and combining signals OMPI received- from utilization device 285 of FIG. 2 via line 901 and* interface circuit 904. Store 920 receives the sequence of excitation signals required for synthesis via line 903. The excitation signals may comprise a succession of pitch period and voiced/unvoiced signals generated responsive to the voice message by methods well known in the art. Microprocessor 910 is adapted to control the operation of the synthesizer and may be the aforementioned Motorola-type MC68000 integrated circuit. LPC feature signal store 925 is utilized to store the successive log area parameter signals of the spoken message which are formed from the speech event feature signals and combining signals of store 915. Formation of a replica of the spoken message is accomplished in LPC synthesizer 930 responsive to the LPC feature signals from store 925 and the excitation signals from store 920 under control of microprocessor 910. The synthesizer operation is directed by microprocessor 910 under control of permanently stored instruction codes resident in a read only memory associated therewith. The operation of the synthesizer is described - in the flow chart of FIG. 10. Referring to FIG. 10, The coded speech event feature signals, the corresponding combining signals, and the excitation signals of the spoken message are received by interface 904 and are transferred to speech event feature signal and combining coefficient signal store 915 and to excitation signal store 920 as per box 1010. The log area parameter signal index I is then reset to one in processor 910 (box 1020) so that the reconstruction of the first log area feature signal y-^(n) is initiated. The formation of the log area signal requires _ combining the speech event feature signals with the combining coefficients of index I in accordance with equation 1. Speech event feature signal location counter L is reset to one by processor 910 as per box 1025 and the current speech event feature signal samples are read from store 915 (box 1030) . The signal sample sequence is filtered to smooth the speech event feature signal as per (box 1035) and the current log area parameter signal is partially formed in box 1040. Speech event location counter L is incremented to address the next speech event feature signal in store 915 (box 1045) and the occurrence of the last feature signal is tested in decision box 1050. Until the last speech event feature signal has been processed, the loop including boxes 1030 through 1050 is iterated so that the current log area parameter signal is generated and stored in LPC feature signal store 925 under control of processor 910. Upon storage of a log area feature signal in store 925, box 1055 is entered from box 1050 and the log area index signal I is incremented (box 1055) to initiate the formation of the next log area parameter signal. The loop from box 1030 through box 1050 is reentered via decision box 1060. After the last log area parameter signal is stored, processor 910 causes a replica of the spoken message to be formed in LPC synthesizer 930. The synthesizer circuit of FIG. 9 may be readily modified to store the speech event feature signal sequences corresponding to a plurality of spoken messages and to selectively generate replicas of these messages by techniques well known in the art. For such an arrangement, the speech event feature signal generating circuit of FIG. 2 may receive a sequence of predetermined spoken messages and utilization device 285 may comprise an arrangement to permanently store the speech event feature signals and corresponding combining coefficients for the messages and to generate a read only memory containing said spoken message speech event and combining signals. The read only memory containing the coded speech event and combining signals can be inserted as store 915 in the synthesizer circuit of FIG. 9.

Claims: Claims 1. A method for compressing speech patterns comprising the steps of: analyzing (210, 215, 275, 280) a speech pattern to generate a set of signals representative of acoustic features of the speech pattern at a first rate; CHARACTERIZED BY the steps of generating (225, 240) a sequence of signals each representative of a speech event of said speech pattern responsive to said set of acoustic feature signals; and forming (230, 235, 250) a sequence of coded signals corresponding to said speech pattern at a rate less than said first rate responsive to said speech event representative signals. 2. A method for compressing speech patterns according to claim 1 wherein each speech event representative signal comprises a prescribed linear combination of said acoustic feature signals. 3. A method for compressing speech patterns according to claim 2 further comprising the step of generating (230) a set of speech event representative signal combining coefficient signals jointly responsive to said speech event representative signals and said acoustic feature signals; and said coded signal forming step further comprises producing (235) a set of digitally coded signals corresponding to said combining coefficient signals. 4. A method for compressing speech patterns according to claim 3 wherein the said generation of the sequence of speech event signals comprises: producing (225) a sequence of signals representative of the times of occurrence of speech events in said speech pattern responsive to said acoustic feature signals and generating a sequence of speech event feature signals jointly responsive to said acoustic feature signals and said speech event time of occurrence signals. 5. A method for compressing speech patterns according to claim 4 wherein each speech event signal is a controlled time spreading linear combination of said acoustic feature signals having its centroid at the time of occurrence of the corresponding speech event. 6. A method for compressing speech patterns according to claim 5 wherein said speech event time of occurrence signal generation comprises: producing (220) a signal representative of speech event timing in said speech pattern responsive to said acoustic feature signals and detecting the times of occurrence of negative going zero crossings in said speech event timing signal. 7. A method for compressing speech patterns according to claim 6 wherein said coded signal forming step comprises: generating (235) a signal representative of the bandwidth of each speech representative signal; sampling said speech event feature signal at a rate corresponding to its bandwidth representative signal; coding each sampled speech event feature signal; and producing a sequence of encoded speech event coded signals at a rate corresponding to the rate of occurrence of speech events in said speech pattern. 8. A method for compressing speech patterns according to claim 1, 2, 3, 4, 5, 6, or 7 wherein: said acoustic feature signals are linear predictive parameter signals representative of the speech pattern. 9. A method for compressing speech patterns according to claim 8 wherein: said linear predictive parameter signals are log area parameter signals representative of the speech pattern. 10. A method for compressing speech patterns according to claim 8 wherein: said linear predictive parameter signals are PARCOR signals representative of the speech pattern. 11. Apparatus for generating a speech pattern comprising: means (915) for storing a prescribed set of speech element signals formed by one of the compression methods of claims 1-10; means (910) for combining said speech element signals to form a set of signals representative of the acoustic features of said speech pattern; and means (930) responsive to said set of acoustic feature signals for producing said speech pattern.

Inventors: ATAL BISHNU SAROOP, ATAL, BISHNU, SAROOP
Applicants: AMERICAN TELEPHONE & TELEGRAPH, AMERICAN TELEPHONE & TELEGRAPH COMPANY
Application year: 1984
Main classification: G10L1
IPC codes: G10L11, G10L19