# Patent

## Title
LPC-harmonic vocoder with superframe structure

## Abstract

An enhanced low-bit rate parametric voice coder that groups a number of frames from an underlying frame-based vocoder, such as MELP, into a superframe structure. Parameters are extracted from the group of underlying frames and quantized into the superframe which allows the bit rate of the underlying coding to be reduced without increasing the distortion. The speech data coded in the superframe structure can then be directly synthesized to speech or may be transcoded to a format so that an underlying frame-based vocoder performs the synthesis. The superframe structure includes additional error detection and correction data to reduce the distortion caused by the communication of bit errors.

## Background
STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT
This invention was made with U.S. Government Support under Contract No. MDA904-98-C-A857, awarded by the Department of Defense. The U.S. Government has certain rights in the invention.


CROSS-REFERENCE TO RELATED APPLICATIONS
Not Applicable
REFERENCE TO A MICROFICHE APPENDIX
Not Applicable
INCORPORATION BY REFERENCE
The following patents and publications which are sometimes referenced using numbers inside square brackets (e.g., [1]) are incorporated herein by reference:

    
    
        [1] Gersho, A., “ADVANCES IN SPEECH AND AUDIO COMPRESSION”, Proceedings of the IEEE, Vol. 82, No. 6, pp. 900-918, June 1994.
        [2] McCree et al., “A 2.4 KBIT/S MELP CODER CANDIDATE FOR THE NEW U.S. FEDERAL STANDARD”, 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings, Atlanta, GA (Cat. No. 96CH35903), Vol. 1., pp.. 200-203, 7-10 May 1996.
        [3] Supplee, L. M. et al., “MELP: THE NEW FEDERAL STANDARD AT 2400 BPS”, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing proceedings (Cat. No. 97CB36052), Munich, Germany, Vol. 2, pp. 21-24 April 1997.
        [4] McCree, A.V. et al., “A MIXED EXCITATION LPC VOCODER MODEL FOR LOW BIT RATE SPEECH CODING”, IEEE Transactions on Speech and Audio Processing, Vol. 3, No. 4, pp. 242-250, July 1995.
        [5] Specifications for the Analog to Digital Conversion of Voice by 2,400 Bit/Second Mixed Excitation Linear Prediction FIPS, Draft document of proposed federal standard, dated May 28, 1998.
        [6] U.S. Patent No. 5,699,477.
        [7] Gersho, A. et al., “VECTOR QUANTIZATION AND SIGNAL COMPRESSION”, Dordrecht, Netherlands: Kluwer Academic Publishers, 1992, xxii+732 pp.
        [8] W. P. LeBlanc, et al., “EFFICIENT SEARCH AND DESIGN PROCEDURES FOR ROBUST MULTI-STAGE VQ OF LPC PARAMETERS FOR 4 KB/S SPEECH CODING”in IEEE Trans. Speech & Audio Processing, Vol. 1, pp. 272-285, Oct. 1993.
        [9] Mouy, B. M.; de la Noue, P.E., “VOICE TRANSMISSION AT A VERY LOW BIT RATE ON A NOISY CHANNEL: 800 BPS VOCODER WITH ERROR PROTECTION TO 1200 BPS”, ICASSP-92: 1992 IEEE International Conference Acoustics, Speech and Signal, San Francisco, Calif., USA, 23-26 March 1992, New York, NY, USA: IEEE, 1992, Vol. 2, pp. 149-152.
        [10] Mouy, B.; De La Noue, P.; Goudezeune, G. “NATO STANAG 4479: A STANDARD FOR AN 800 BPS VOCODER AND CHANNEL CODING IN HF-ECCM SYSTEM”, 1995 International Conference on Acoustics, Speech, and Signal Processing. Conference Proceedings, Detroit, MI, USA, 9-12 May 1995; New York, NY, USA: IEEE, 1995, Vol. 1, pp. 480-483
        [11] Kemp, D. P.; Collura, J. S.; Tremain, T. E. “MULTI-FRAME CODING OF LPC PARAMETERS 600-800 BPS”, ICASSP 91, 1991 International Conference on Acoustics, Speech and Signal Processing, Toronto, Ont., Canada, 14-17 May 1991; New York, N.Y., USA: IEEE, 1991, Vol. 1, pp. 609-612.
        [12] U.S. Patent No. 5,255,339.
        [13] U.S. Patent No. 4,815,134.
        [14] Hardwick, J.C.; Lim, J. S., “A 4.8 KBPS MULTI-BAND EXCITATION SPEECH CODER”, ICASSP 1988 International Conference on Acoustics, Speech, and Signal, New York, N.Y., USA, 11-14 April 1988, New York, N.Y., USA: IEEE, 1988. Vol. 1, pp. 374-377.
        [15] Nishiguchi, L.; Iijima, K.; Matsumoto, J, “HARMONIC VECTOR EXCITATION CODING OF SPEECH AT 2.0 KBPS”, 1997 IEEE Workshop on Speech Coding for Telecommunications Proceedings, Pocono Manor, PA, USA, 7-10 Sept. 1997, New York, N.Y., USA: IEEE, 1997, pp. 39-40.
        [16] Nomura, T., Iwadare, M., Serizawa, M., Ozawa, K., “A BITRATE AND BANDWIDTH SCALABLE CELP CODER”, ICASSP 1998 International Conference on Acoustics, Speech, and Signal, Seattle, Wash., USA, 12-15 May 1998, IEEE, 1998, Vol. 1, pp. 341-344.
    
    


BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates generally to digital communications and, in particular, to parametric speech coding and decoding methods and apparatus.
2. Description of the Background Art
For the purpose of definition, it should be noted that the term “vocoder” is frequently used to describe voice coding methods wherein voice parameters are transmitted instead of digitized waveform samples. In the production of digitized waveform samples, an incoming waveform is periodically sampled and digitized into a stream of digitized waveform data which can be converted back to an analog waveform virtually identical to the original waveform. The encoding of a voice using voice parameters provides sufficient accuracy to allow subsequent synthesis of a voice which is substantially similar to the one encoded. Note that the use of voice parameter encoding does not provide sufficient information to exactly reproduce the voice waveform, as is the case with digitized waveforms; however the voice can be encoded at a lower data rate than is required with waveform samples.
In the speech coding community, the term “coder” is often used to refer to a speech encoding and decoding system, although it also often refers to an encoder by itself. As used herein, the term encoder generally refers to the encoding operation of mapping a speech signal to a compressed data signal (the bitstream), and the term decoder generally refers to the decoding operation where the data signal is mapped into a reconstructed or synthesized speech signal.
Digital compression of speech (also called voice compression) is increasingly important for modern communication systems. The need for low bit rates in the range of 500 bps (bits per second) to 2 kbps (kilobits per second) for transmission of voice is desirable for efficient and secure voice communication over high frequency (HF) and other radio channels, for satellite voice paging systems, for multi-player Internet games, and numerous additional applications. Most compression methods (also called “coding methods”) for 2.4 kbps, or below, are based on parametric vocoders. The majority of contemporary vocoders of interest are based on variations of the classical linear predictive coding (LPC) vocoder and enhancements of that technique, or are based on sinusoidal coding methods such as harmonic coders and multiband excitation coders [1]. Recently an enhanced version of the LPC vocoder has been developed which is called MELP (Mixed Excitation Linear Prediction) [2, 5, 6]. The present invention can provide similar voice quality levels at a lower bit rate than is required in the conventional encoding methods described above.
This invention is generally described in relation to its use with MELP, since MELP coding has advantages over other frame-based coding methods. However the invention is applicable to a variety of coders, such as harmonic coders [15], or multiband excitation (MBE) type coders [14].
The MELP encoder observes the input speech and, for each 22.5 ms frame, it generates data for transmission to a decoder. This data consists of bits representing line spectral frequencies (LSFs) (which is a form of linear prediction parameter), Fourier magnitudes (sometimes called “spectral magnitudes), gains (2 per frame), pitch and voicing, and additionally contains an aperiodic flag bit, error protection bits, and a synchronization (sync) bit. FIG. 1 shows the buffer structure used in a conventional 2.4 kbps MELP encoder. The encoder employed with other harmonic or MBE coding methods generates data representing many of the same or similar parameters (typically these are LSFs, spectral magnitudes, gain, pitch, and voicing). The MELP decoder receives these parameters for each frame and synthesizes a corresponding frame of speech that approximates the original frame.
Different communication systems require speech coders with different bit-rates. For example, a high frequency (HF) radio channel may have severely limited capacity and require extensive error correction and a bit rate of 1.2 kbps may be most suitable for representing the speech parameters, whereas a secure voice telephone communication system often requires a bit rate of 2.4 kbps. In some applications it is necessary to interconnect different communication systems so that a voice signal originally encoded for one system at one bit rate is subsequently converted into an encoded voice signal at the other bit rate for another system. This conversion is referred to as “transcoding”, and it can be performed by a “transcoder” typically located at a gateway between two communication systems.
BRIEF SUMMARY OF THE INVENTION
In general terms, the present invention takes an existing vocoder technique, such as MELP and substantially reduces the bit rate, typically by a factor of two, while maintaining approximately the same reproduced voice quality. The existing vocoder techniques are made use of within the invention, and they are therefore referred to as “baseline” coding or alternately “conventional” parametric voice encoding.
By way of example, and not of limitation, the present invention comprises a 1.2 kbps vocoder that has analysis modules similar to a 2.4 kbps MELP coder to which an additional superframe vocoder is overlayed. A block or “superframe” structure comprising three consecutive frames is adopted within the superframe vocoder to more efficiently quantize the parameters that are to be transmitted for the 1.2 kbps vocoder of the present invention. To simplify the description, the superframe is chosen to encode three frames, as this ratio has been found to perform well. It should be noted, however, that the inventive methods can be applied to superframes comprising any discrete number of frames. A superframe structure has been mentioned in previous patents and publications [9], [10], [11], [13]. Within the MELP coding standard, each time a frame is analyzed (e.g., every 22.5 ms), its parameters are encoded and transmitted. However, in the present invention each frame of a superframe is concurrently available in a buffer, each frame is analyzed, and the parameters of all three frames within the superframe are simultaneously available for quantization. Although this introduces additional encoding delay, the temporal correlation that exists among the parameters of the three frames can be efficiently exploited by quantizing them together rather than separately.
The frame size of the 1.2 kbps coder of the present invention is preferably 22.5 ms (or 180 samples of speech) at a sampling rate of 8000 samples per second, which is the same as in the MELP standard coder. However, in order to avoid large pitch errors, the length of the look-ahead is increased in the invention by 129 samples. In this regard, note that the term “look-ahead” refers to the time duration of the “future” speech segment beyond the current frame boundary that must be available in the buffer for processing needed to encode the current frame. A pitch smoother is also used in the 1.2 kbps coder of the present invention, and the algorithmic delay for the 1.2 kbps coder is 103.75 ms. The transmitted parameters for the 1.2 kbps coder are the same as for the 2.4 kbps MELP coder.
Within the MELP coding standard, the low band voicing decision or Unvoiced/Voiced decision (UN decision) is found for each frame. The frame is said to be “voiced” when the low band voicing value is “1”, and “unvoiced” when it is “0”. This voicing condition determines which of two different bit allocations is used for the frame. However, in the 1.2 kbps coder of the present invention, each superframe is categorized into one of several coding states with a different bit allocation for each state. State selection is done according to the U/V (unvoiced or voiced) pattern of the superframe. If a channel bit error leads to an incorrect state identification by the decoder, serious degradation of the synthesized speech for that superframe will result. Therefore an aspect of the present invention comprises techniques to reduce the effect of state mismatch between encoder and decoder due to channel errors, which techniques have been developed and integrated into the decoder.
In the present invention, three frames of speech are simultaneously available in a memory buffer and each frame is separately analyzed by conventional MELP analysis modules, generating (unquantized) parameter values for each of the three frames. These parameters are collectively available for subsequent processing and quantization. The pitch smoother observes pitch and U/V decisions for the three frames and also performs additional analysis on the buffered speech data to extract parameters needed to classify each frame as one of two types (onset or offset) for use in a pitch smoothing operation. The smoother then outputs modified (smoothed) versions of the pitch decisions, and these pitch values for the superframe are then quantized. The bandpass voicing smoother observes the bandpass voicing strengths for the three frames, as well as examines energy values extracted directly from the buffered speech, and then determines a cutoff frequency for each of the three frames. The bandpass voicing strengths are parameters generated by the MELP encoder to describe the degree of voicing in each of five frequency bands of the speech spectrum. The cutoff frequencies, defined later, describe the time evolution of the bandwidth of the voiced part of the speech spectrum. The cutoff frequency for each voiced frame in the superframe is encoded with 2 bits. The LSF parameters, Jitter parameter, and Fourier magnitude parameters for the superframe are each quantized. Binary data is obtained from the quantizers for transmission. Not described for the sake of simplicity are the error correction bits, synchronization bit, parity bit, and the multiplexing of the bits into a serial data stream for transmission, all of which are well-known to those skilled in the art. At the receiver, the data bits for the various parameters are extracted, decoded and applied to inverse quantizers that recreate the quantized parameter values from the compressed data. A receiver typically includes a synchronization module which identifies the starting point of a superframe, and a means for error correction decoding and demultiplexing. The recovered parameters for each frame can be applied to a synthesizer. After decoding, the synthesized speech frames are concatenated to form the speech output signal. The synthesizer may be a conventional frame-based synthesizer, such as MELP, or it may be provided by an alternative method as disclosed herein.
An object of the invention is to introduce greater coding efficiencies and exploit the correlation from one frame of speech to another by grouping frames into superframes and performing novel quantization techniques on the superframe parameters.
Another object of the invention is to allow the existing speech processing functions of the baseline encoder and decoder to be retained so that the enhanced coder operates on the parameters found in the baseline coder operation, thereby preserving the wealth of experimentation and design results already obtained with baseline encoders and decoders while still offering greatly reduced bit rates.
Another object of the invention is to provide a mechanism for transcoding, wherein a bit stream obtained from the enhanced encoder is converted (transcoded) into a bit stream that will be recognized by the baseline decoder, while similarly providing a way to convert the bit stream coming from a baseline encoder into a bit stream that can be recognized by an enhanced decoder. This transcoding feature is important in applications where terminal equipment implementing a baseline coder/decoder must communicate with terminal equipment implementing the enhanced coder/decoder.
Another object of the invention is to provide methods for improving the performance of the MELP encoder by wherein new methods generate pitch and voicing parameters.
Another object of the invention is to provide a new decoding procedure that replaces the MELP decoding procedure and substantially reduces complexity while maintaining the synthesized voice quality.
Another object of the invention is to provide a 1.2 kbps coding scheme that gives approximately equal quality to the MELP standard coder operating at 2.4 kbps.
Further objects and advantages of the invention will be brought out in the following portions of the specification, wherein the detailed description is for the purpose of fully disclosing preferred embodiments of the invention without placing limitations thereon.



BRIEF DESCRIPTION OF THE DRAWINGS
The invention will be more fully understood by reference to the following drawings which are for illustrative purposes only:
FIG. 1 is a diagram of data positions used within the input speech buffer structure of a conventional 2.4 kbps MELP coder. The units shown indicate samples of speech.
FIG. 2 is a diagram of data positions used within the input superframe speech buffer structure of the 1.2 kbps coder of the present invention. The units shown indicate samples of speech.
FIG. 3A is a functional block diagram of the 1.2 kbps encoder of the present invention.
FIG. 3B is a functional block diagram of the 1.2 kbps decoder of the present invention.
FIG. 4 is a diagram of data positions within the 1.2 kbps encoder of the present invention showing computation positions for computing pitch smoother parameters within the present invention, where the units shown indicate samples of speech.
FIG. 5A is a functional block diagram of a 1200 bps stream up-converted by a transcoder into a 2400 bps stream.
FIG. 5B is a functional block diagram of a 2400 bps stream down-converted by an transcoder into a 1200 bps stream.
FIG. 6 is a functional block diagram of hardware within a digital vocoder terminal which employs the inventive principles in accord with the present invention.



DETAILED DESCRIPTION OF THE INVENTION
For illustrative purposes the present invention will be described with reference to FIG. 2 through FIG. 6. It will be appreciated that the apparatus may vary as to configuration and as to details of the parts, and that the method may vary as to the specific steps and sequence, without departing from the basic concepts as disclosed herein.
1. OVERVIEW OF THE VOCODER
The 1.2 kbps encoder of the present invention employs analysis modules similar to those used in a conventional 2.4 kbps MELP coder, but adds a block or “superframe” encoder which encodes three consecutive frames and quantizes the transmitted parameters more efficiently to provide the 1.2 kbps vocoding. Those skilled in the art will appreciate that although the invention is described with reference to using three frames per superframe, the method of the invention can be applied to superframes comprising other integral numbers of frames as well. Furthermore, those skilled in the art will also appreciate that although the invention is described with respect to the use of MELP as the baseline coder, the methods of the invention can be applied to other harmonic vocoders. Such vocoders may have a similar, but not identical, set of parameters extracted from analysis of a speech frame and the frame size and bit rates may be different from those used in the description presented here.
It will be appreciated that when a frame is analyzed within a MELP encoder, (e.g. every 22.5 ms), voice parameters are encoded for each frame and then transmitted. Yet, in the present invention, data from a group of frames, forming a superframe, is collected and processed with the parameters of all three frames in the superframe which are simultaneously available for quantization. Although this introduces additional encoding delay, the temporal correlation that exists among the parameters of the three frames can be efficiently exploited by quantizing them together rather than separately.
The frame size employed in the present invention is preferably 22.5 ms (or 180 samples of speech) at a sampling rate of 8000 samples per second, which is the same sample rate used in the original MELP coder. The buffer structure of a conventional 2.4 kbps MELP is shown in FIG. 1. The length of look-ahead buffer has been increased in the preferred embodiment by 129 samples, so as to reduce the occurrence of large pitch errors, although the invention can be practiced with various levels of look-ahead. Additionally, a pitch smoother has been introduced to further reduce pitch errors. The algorithmic delay for the 1.2 kbps coder described is 103.75 ms. The transmitted parameters for the 1.2 kbps coder are the same as for the 2.4 kbps MELP coder. The buffer structure of the present invention can be seen in FIG. 2.
1.1 Bit Allocation
When using MELP coding, the low band voicing decision, or U/V decision, is found for each “voiced” frame when the low band voicing value is 1 and unvoiced when it is 0. However in the 1.2 kbps coder of the present invention each superframe is categorized into one of several coding states employing different quantization schemes. State selection is performed according to the U/V pattern of the superframe. If a channel bit error leads to an incorrect state identification by the decoder, serious degradation of the synthesized speech for that superframe will result. Therefore, techniques to reduce the effect of state mismatch between encoder and decoder due to channel errors have been developed and integrated into the decoder. For comparison purposes, the bit allocation schemes for both the 2.4 kbps (MELP) coder and the 1.2 kbps coder are shown in Table 1.
FIG. 3A is a general block diagram of the 1.2 kbps coding scheme 10 in accord with the present invention. Input speech 12 fills a memory buffer called a superframe buffer 14 which comprises a superframe and in addition stores the history samples that preceded the start of the oldest of the three frames and the look-ahead samples that follow the most recent of the three frames. The actual range of samples stored in this buffer for the preferred embodiment are as shown in FIG. 2. Frames within the superframe buffer 14 are separately analyzed by conventional MELP analysis modules 16, 18, 20 which generate a set of unquantized parameter values 22 for each of the frames within the superframe buffer 14. Specifically, a MELP analysis module 16 operates on the first (oldest) frame stored in the superframe buffer, another MELP analysis module 18 operates on the second frame stored in the buffer, and another MELP analysis module 20 operates on the third (most recent) frame stored in the buffer. Each MELP analysis block has access to a frame plus prior and future samples associated with that frame. The parameters generated by the MELP analysis modules are collected to form the set of unquantized parameters stored in memory unit 22, which is available for subsequent processing and quantization. The pitch smoother 24 observes pitch values for the frames within the superframe buffer 14, in conjunction with a set of parameters computed by the smoothing analysis block 26 and outputs modified versions of the pitch values when the output is quantized 28. A bandpass voicing smoother 30 observes an average energy value computed by the energy analysis module 32 and it also observes the bandpass voicing strengths for the frames within the superframe buffer 14 and suitably modifies them for subsequent quantization by the bandpass voicing quantizer 32. An LSP quantizer 34, Jitter quantizer 36, and Fourier magnitudes quantizer 38 each output encoded data. Encoded binary data is obtained from the quantizers for transmission. Not shown for simplicity are the generation of error correction data bits, a synchronization bit, and multiplexing of the bits into a serial data stream for transmission which those skilled in the art will readily understand how to implement.
At the decoder 50, shown in FIG. 3B, the data bits for the various parameters are contained in the channel data 52 which enters a decoding and inverse quantizer 54, which extracts, decodes and applies inverse quantizers to recreate the quantized parameter values from the compressed data. Not shown are the synchronization module (which identifies the starting point of a superframe) and the error correction decoding and demultiplexing which those skilled in the art will readily understand how to implement. The recovered parameters for each frame are then applied to conventional MELP synthesizers 56, 58, 60. It should be noted that this invention includes an alternative method of synthesizing speech for each frame that is entirely different from the prior art MELP synthesizer. After being decoded, the synthesized speech frames 62, 64, 66 are concatenated to form the speech output signal 68.
2. SPEECH ANALYSIS
2.1 Overview
The basic structure of the encoder is based on the same analysis module used in the 2.4 kbps MELP coder except that a new pitch smoother and bandpass-voicing smoother are added to take advantage of the superframe structure. The coder extracts the feature parameters from three successive frames in a superframe using the same MELP analysis algorithm, operating on each frame, as used in the 2.4 kbps MELP coder. The pitch and bandpass voicing parameters are enhanced by smoothing. This enhancement is possible because of the simultaneous availability of three adjacent frames and the look-ahead. By operating in this manner on the superframe, the parameters for all three frames are available as input data to the quantization modules, thereby allowing more efficient quantization than is possible when each frame is separately and independently quantized.
2.2 Pitch Smoother
The pitch smoother takes the pitch estimates from the MELP analysis module for each frame in the superframe and a set of parameters from the smoothing analysis module 26 shown in FIG. 3A. The smoothing analysis module 26 computes a set of new parameters every half frame (11.25 ms) from direct observation of the speech samples stored in the superframe buffer. The nine computation positions in the current superframe are illustrated in FIG. 4. Each computation position is at the center of a window in which the parameters are computed. The computed parameters are then applied as additional information to the pitch smoother.
In the 1.2 kbps encoder, each frame is classified into two categories, comprising either onset or offset frames in order to guide the pitch smoothing process. The new waveform feature parameters computed by the smoothing analysis module 26, and then used by the pitch smoother module 24 for the onset/offset classification, are as follows:











Description
Abbreviation







energy in dB
subEnergy


zero crossing rate
zeroCrosRate


peakiness measurement
peakiness


maximum correlation coefficient of input speech
corx


maximum correlation coefficient of 500 Hz low pass
lowBandCorx


filtered speech


Energy of low pass filtered speech
lowBandEn


Energy of high pass filtered speech
highBandEn









Input speech is denoted as x(n),n=. . . , 0, 1, . . . where x(0) corresponds to the speech sample that is 45 samples to the left of the current computation position, and n is 90 samples, which is half of the frame size. The parameters are computed as following

(1) Energy:




  subEnergy
  =
  
    10
    ⁢
    
      
        log
        10
      
      ⁡
      
        [
        
          
            ∑
            
              n
              =
              0
            
            
              N
              -
              1
            
          
          ⁢
          
            
          
          ⁢
          
            
              x
              2
            
            ⁡
            
              (
              n
              )
            
          
        
        ]
      
    
  




(2) Zero crossing rate:




  zeroCrossRate
  =
  
    
      ∑
      
        i
        =
        0
      
      
        N
        -
        2
      
    
    ⁢
    
      [
      
        
          
            
              x
              ⁡
              
                (
                i
                )
              
            
            *
            
              x
              ⁡
              
                (
                
                  i
                  +
                  1
                
                )
              
            
          
          >
          
            0
            ?
            0
          
        
        :
        1
      
      ]
    
  




where the expression in square brackets has value 1 when the product x(i)*x(i+1) is negative (i.e., when a zero crossing occurs) and otherwise it has value zero.

(3) Peakiness measurement in speech domain:





  peakiness
  =
  
    
      
        
          ∑
          
            n
            =
            0
          
          
            N
            -
            1
          
        
        ⁢
        
          
            
              x
              2
            
            ⁡
            
              (
              n
              )
            
          
          /
          N
        
      
    
    
      
        ∑
        
          n
          =
          0
        
        
          N
          -
          1
        
      
      ⁢
      
        
        
          x
          ⁡
          
            (
            n
            )
          
        
        
      
    
  




The peakiness measure is defined as in the MELP coder [5], however, here this measure is computed from the speech signal itself, whereas in MELP it is computed from the prediction residual signal that is derived from the speech signal.

(4) Maximum correlation coefficient in pitch search range:
First the input speech signal is passed through a low-pass filter with an 800 Hz cutoff frequency, where:

H(z)=0.3069/(1−2.4552z−1+2.4552z−2−1.152z−3+0.2099z−4)

The low-pass filtered signal is passed through a 2nd order LPC inverse filter. The inverse filtered signal is denoted as Slv(n) . The DC component is removed from slv(n) to obtain slv(n) . Then, the autocorrelation function is computed by:





  
    
      
        
          r
          k
        
        =
        
          
            
              ∑
              
                n
                =
                0
              
              
                M
                -
                1
              
            
            ⁢
            
              
            
            ⁢
            
              
                
                  
                    s
                    _
                  
                  lv
                
                ⁡
                
                  (
                  n
                  )
                
              
              ⁢
              
                
                  
                    s
                    _
                  
                  lv
                
                ⁡
                
                  (
                  
                    n
                    +
                    k
                  
                  )
                
              
            
          
          
            
              
                ∑
                
                  n
                  =
                  0
                
                
                  M
                  -
                  1
                
              
              ⁢
              
                
                  
                    
                      s
                      _
                    
                    lv
                    2
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
                ·
                
                  
                    ∑
                    
                      n
                      =
                      0
                    
                    
                      M
                      -
                      1
                    
                  
                  ⁢
                  
                    
                      
                        s
                        _
                      
                      lv
                      2
                    
                    ⁡
                    
                      (
                      
                        n
                        +
                        k
                      
                      )
                    
                  
                
              
            
          
        
      
    
    
      
        
          k
          =
          20
        
        ,
        ...
        ⁢
        
          
        
        ,
        150
      
    
  




where M=70. The samples are selected using a sliding window chosen to align the current computation position to the center of the autocorrelation window. The maximum correlation coefficient parameter corx is the maximum of the function rk. The corresponding pitch is l.





  
    
      
        corx
        =
        
          
            
              max
              ⁢
              
                
              
            
            
              20
              ≤
              k
              ≤
              150
            
          
          ⁢
          
            r
            k
          
        
      
    
    
      
        l
        =
        
          arg
          ⁢
          
            
              max
              ⁢
              
                
              
            
            
              20
              ≤
              k
              ≤
              150
            
          
          ⁢
          
            r
            k
          
        
      
    
  




(5) Maximum correlation coefficient of low pass filtered speech:
In the standard MELP, five filters are used in bandpass voicing analysis. The first filter is actually a low-pass filter with passband of 0-500 Hz. The same filter is used on input speech to generate the low-pass filtered signal sl (n) . Then the correlation function defined in (4) is computed on sl (n) . The range of the indices is limited by [max(20, l−5), min(150, l+5)]. The maximum of the correlation function is denoted as lowBandCorx.
(6) Low band energy and high band energy:
In the LPC analysis module, the first 17 autocorrelation coefficients r(n), n=0, . . . , 16 are computed. The low band energy and high band energy are obtained by filtering the autocorrelation coefficients.




  
    
      
        lowBandEn
        =
        
          
            
              r
              ⁡
              
                (
                0
                )
              
            
            ·
            
              
                C
                l
              
              ⁡
              
                (
                0
                )
              
            
          
          +
          
            2
            ⁢
            
              
                ∑
                
                  n
                  =
                  1
                
                16
              
              ⁢
              
                
              
              ⁢
              
                
                  r
                  ⁡
                  
                    (
                    n
                    )
                  
                
                ·
                
                  
                    C
                    l
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
              
            
          
        
      
    
  
  
    
      
        highBandEn
        =
        
          
            
              r
              ⁡
              
                (
                0
                )
              
            
            ·
            
              
                C
                h
              
              ⁡
              
                (
                0
                )
              
            
          
          +
          
            2
            ⁢
            
              
                ∑
                
                  n
                  =
                  1
                
                16
              
              ⁢
              
                
              
              ⁢
              
                
                  r
                  ⁡
                  
                    (
                    n
                    )
                  
                
                ·
                
                  
                    C
                    h
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
              
            
          
        
      
    
  




The Cl (n) and Ch (n) are the coefficients for low pass filter and the high pass filter. The 16 filter coefficients for each filter are chosen for a cutoff frequency of 2 kHz and are obtained with a standard FIR filter design technique.

The parameters enumerated above are used to make rough U/V decisions for each half frame. The classification logic for making the voicing decisions shown below is performed in the pitch smoother module 24. The voicedEn and silenceEn are the running average energies of voiced frames and silence frames.












structure {








 subEnergy;
/* energy in dB */


 zeroCorsRate;
/* zero crossing rate */


 peakiness;
/* peakiness measurement */


 corx;
/* maximum correlation coefficient of input speech */


 lowBandCorx;
/* maximum correlation coefficient of



  500 Hz low pass filtered speech */


 lowBand En;
/* Energy of low pass filtered speech */


 highBandEn;
/* Energy of high pass filtered speech */







} classStat[9];


if( classStat −> subEnergy < 30 ){


 classy = SILENCE;


}else if( classStat −> subEnergy < 0.35*voicedEn + 0.65*silenceEn ){


 if( (classStat−>zeroCrosRate > 0.6) &&


  ((classStat−>corx<0.4) ∥ (classStat−>lowBandCorx < 0.5)) )


  classy = UNVOICED;


 else if( (classStat−>lowBandCorx > 0.7) ∥


  ((classStat−>lowBandCorx > 0.4) && (classStat−>corx > 0.7)) )


  classy = VOICED;


 else if( (classStat−>zeroCrosRate−classStat[−1].zeroCrosRate>0.3) ∥


   (classStat−>subEnergy − classStat[−1].subEnergy > 20) ∥


   (classStat−>peakiness > 1.6) )


  classy = TRANSITION;


 else if((classStat−>zeroCrosRate > 0.55) ∥


   ((classStat−>highBandEn > classStat−>lowBandEn−5) &&


    (classStat−>zeroCrosRate > 0.4)) )


  classy = UNVOICED;


 else classy = SILENCE;


}else{


 if( (classStat−>zeroCrosRate − classStat[−1].zeroCrosRate > 0.2) ∥


   (classStat−>subEnergy − classStat[−1].subEnergy > 20) ∥


   (classStat−>peakiness > 1.6) ){


  if( (classStat−>lowBandCorx > 0.7) ∥ (classStat−>corx > 0.8) )


   classy = VOICED;


  else


   classy = TRANSITION;


 }else if( classStat −> zeroCrosRate < 0.2 ){


  if( (classStat−>lowBandCorx > 0.5) ∥


   ((classStat−>lowBandCorx > 0.3) && (classStat−>corx > 0.6))


   classy = VOICED;


  else if( classStat−>subEnergy > 0.7*voicedEn+0.3*silenceEn ){


   if( classStat−>peakiness > 1.5)


    classy = TRANSITION;


   else{


    classy = VOICED;


   }


  }else{


   classy = SILENCE;


  }


 }else if( classStat −> zeroCrosRate < 0.5 ){


  if( (classStat−>lowBandCorx > 0.55) ∥


   ((classStat−>lowBandCorx > 0.3) && (classStat−>corx > 0.65)) )


   classy = VOICED;


  else if( (classStat−>subEnergy < 0.4*voicedEn+0.6*silenceEn) &&


   (classStat−>highBandEn < classStat−>lowBandEn−10) )


   classy = SILENCE;


  else if( classStat−>peakiness > 1.4)


   classy = TRANSITION;


  else


   classy = UNVOICED;


}else if( classStat −> zeroCrosRate < 0.7 ){


  if( ((classStat−>lowBandCorx > 0.6) && (classStat−>corx > 0.3)) ∥


   ((classStat−>lowBandCorx > 0.4) && (classStat−>corx > 0.7)) )


   classy = VOICED;


  else if( classStat−>peakiness > 1.5 )


   classy = TRANSITION;


  else


   classy = UNVOICED;


 }else{


  if( ((classStat−>lowBandCorx > 0.65) && (classStat−>corx > 0.3)) ∥


   ((classStat−>lowBandCorx > 0.45) && (classStat−>corx > 0.7)) )


   classy = VOICED;


  else if( classStat−>peakiness > 2.0 )


   classy = TRANSITION;


  else


   classy = UNVOICED;


 }


}









The U/V decisions for each subframe are then used to classify the frames as onset or offset. This classification is internal to the encoder and is not transmitted. For each current frame, first the possibility of an offset is checked. An offset frame is selected if the current voiced frame is followed by a sequence of unvoiced frames, or the energy declines at least 8 dB within one frame or 12 dB within one and one-half frames. The pitch of an offset frame is not smoothed.
If the current frame is the first voiced frame, or the energy increases by at least 8 dB within one frame or 12 dB within one and one-half frames, the current frame is classified as an onset frame. For the onset frames, a look-ahead pitch candidate is estimated from one of the local maximums of the autocorrelation function evaluated in the look-ahead region. First, the 8 largest local maximums of the autocorrelation function given above are selected. The maximums are denoted for the current computation position as R(0)(i), i=0, . . . , 7. The maximums for the next two computation positions are R(1)(i), R(2)(i) . A cost function for each computation position is computed, and the cost function for the current computation position is used to estimate the predicted pitch. The cost function for R(2)(i) is computed first as:

C(2)(i)=W[1−R(2)(i)]

where W is a constant which is 100. For each maximum R(1)(i), the corresponding pitch is denoted as p(1)(i). The cost function C(1)(i) is computed as:

C(1)(i)=W[1−R(1)(i)]+|p(1)(i)−p(2)(ki)|+C(2)(ki)

The index ki is chosen as:





  
    
      
        
          k
          i
        
        =
        
          arg
          ⁢
          
            
          
          ⁢
          
            
              max
              l
            
            ⁢
            
              (
              
                
                  R
                  
                    (
                    2
                    )
                  
                
                ⁡
                
                  (
                  l
                  )
                
              
              )
            
          
        
      
    
    
      
        
          
            
            
              
                
                  p
                  
                    (
                    2
                    )
                  
                
                ⁡
                
                  (
                  l
                  )
                
              
              -
              
                
                  p
                  
                    (
                    1
                    )
                  
                
                ⁡
                
                  (
                  i
                  )
                
              
            
            
          
          /
          
            
              p
              
                (
                1
                )
              
            
            ⁡
            
              (
              i
              )
            
          
        
        <
        0.2
      
    
  




If the range for l is an empty set in the above equation, then we use range lε[0, 7]. The cost function C(0)(i) is computed in a similar way as the C(1)(i). The predicted pitch is chosen as





  p
  =
  
    arg
    ⁢
    
      
    
    ⁢
    
      
        max
        
          
            p
            
              (
              0
              )
            
          
          ⁡
          
            (
            i
            )
          
        
      
      ⁢
      
        
          
            
              (
              
                
                  C
                  
                    (
                    0
                    )
                  
                
                ⁡
                
                  (
                  i
                  )
                
              
              )
            
          
          
            
              
                i
                =
                0
              
              ,
              ...
              ⁢
              
                
              
              ,
              7
            
          
        
      
    
  




The look-ahead pitch candidate is selected as current pitch, if the difference between the original pitch estimate and the look-ahead pitch is larger than 15%.

If the current frame is neither offset nor onset, the pitch variation is checked. If a pitch jump is detected, which means the pitch decreases and then increases or increases and then decreases, the pitch of the current frame is smoothed using interpolation between the pitch of the previous frame and the pitch of the next frame. For the last frame in the superframe the pitch of the next frame is not available, therefore a predicted pitch value is used instead of the next frame pitch value. The above pitch smoother detect many of the large pitch errors that would otherwise occur and in formal subjective quality tests, the pitch smoother provided significant quality improvement.
2.3 Bandpass Voicing Smoother
In MELP encoding, the input speech is filtered into five subbands. Bandpass voicing strengths are computed for each of these subbands with each voicing strength normalized to a value of between 0 and 1. These strengths are subsequently quantized to 0s or 1s, to obtain bandpass voicing decisions. The quantized lowband (0 to 500 Hz) voicing strength determines the unvoiced, or voiced, (U/V) character of the frame. The binary voicing information of the remaining four bands partially describes the harmonic or nonharmonic character of the spectrum of a frame and can be represented by a four bit codeword. In this invention, a bandpass voicing smoother is used to more compactly describe this information for each frame in a superframe and to smooth the time evolution of this information across frames. First the four bit codeword is mapped (1 for voiced, 0 for unvoiced) for the remaining four bands for each frame into a single cutoff frequency with one of four allowed values. This cutoff frequency approximately identifies the boundary between the lower region of the spectrum that has a voiced (or harmonic) character and the higher region that has an unvoiced character. The smoother then modifies the three cutoff frequencies in the superframe to produce a more natural time evolution for the spectral character of the frames. The 4-bit binary voicing codeword for each of the frame decisions is mapped into four codewords using the 2-bit codebook shown in Table 2. The entries of the codebook are equivalent to the four cutoff frequencies: 500 Hz, 1000 Hz, 2000 Hz and 4000 Hz which correspond respectively to the columns labeled: 0000, 1000, 1100, and 1111 in the mapping table given in Table 2. For example, when the bandpass voicing pattern for a voiced frame is 1001, this index is mapped into 1000, which corresponds to a cutoff frequency of 1000 Hz.
For the first two frames of the current superframe, the cutoff frequency is smoothed according to the bandpass voicing information of the previous frame and the next frame. The cutoff frequency in the third frame is left unchanged. The average energy of voiced frames is denoted as VE. The value of VE is updated at each voiced frame for which the two prior frames are voiced. The updating rule is:

VEnew=10log10[0.9eVEold10+0.1esubEnergy/10]

For the frame i, the energy of the current frame is denoted as eni. The voicing strengths for the five bands are denoted as bp[k]i, k=1, . . . , 5. The following three conditions are considered to smooth the cutoff frequency fi.
(1) If the cutoff frequencies of the previous frame and the next frame are both above 2000 Hz, then execute the following procedure.

If(f i<2000 and ((eni>VE−5 dB) or (bp[2]i−1>0.5 and bp[3]i−1>0.5)))

fi=2000 Hz

else if (fi<1000)

fi=1000 Hz

(2) If the cutoff frequencies of the previous frame and the next frame are both above 1000 Hz, then execute the following procedure.

If (fi<1000 and ((eni>VE−10 dB) or (bp[2]i−1>0.4)))

fi=1000 Hz

(3) If the cutoff frequencies of the previous frame and the next frame are all below 1000 Hz, then execute the following procedure.

If (fi>2000 and eni<VE−5 dB and bp[3]i−1<0.7)

fi=2000 Hz

3. QUANTIZATION

3.1 Overview
The transmitted parameters of the 1.2 kbps coder are the same as those of the 2.4 kbps MELP coder except that in the 1.2 kbps coder the parameters are not transmitted frame by frame but are sent once for each superframe. The bit-allocation is shown in Table 1. New quantization schemes were designed to take advantage of the long block size (the superframe) by using interpolation and vector quantization (VQ). The statistical properties of voiced and unvoiced speech are also taken into account. The same Fourier magnitude codebook of the 2.4 MELP kbps coder is used in the 1.2 kbps coder in order to save memory and to make the transcoding easier.
3.2 Pitch Quantization
The pitch parameters are applicable only for voiced frames. Different pitch quantization schemes are used for different U/V combinations across the three frames. The detailed method for quantizing the pitch values of a superframe is herein described for a particular voicing pattern. The quantization method described in this section is used in the joint quantization of the voicing pattern, while the pitch will be described in the following section. The pitch quantization schemes are summarized in Table 3. Within those superframes where the voicing pattern contains either two or three voiced frames, the pitch parameters are vector-quantized. For voicing patterns containing only one voiced frame, the scalar quantizer specified in the MELP standard is applied for the pitch of the voiced frame. For the UUU voicing pattern, where each frame is unvoiced, no bits are needed for pitch information. Note that U denotes “Unvoiced” and V denotes “Voiced”.
Each pitch value, P, obtained from the pitch analysis of the 2.4 kbps standard is transformed into a logarithmic value, p=log P, before quantization. For each superframe, a pitch vector is constructed with components equal to the log pitch value for each voiced frame and a zero value for each unvoiced frame. For voicing patterns with two or three voiced frames, the pitch vector is quantized using a VQ (Vector Quantization) algorithm with a new distortion measure that takes into account the evolution of the pitch. This algorithm incorporates pitch differentials in the codebook search, which makes it possible to consider the time evolution of the pitch. A standard VQ codebook design is used [7]. The VQ encoding algorithm incorporates pitch differentials in the codebook search, which makes it possible to consider the time evolution of the pitch in selecting the VQ codebook entry. This feature is motivated by the perceptual importance of adequately tracking the pitch trajectory. The algorithm has three steps for obtaining the best index:
Step 1: Select the M-best candidates using the weighted squared Euclidean distance measure:




  
    
      
        
          
            
              d
              =
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  3
                
                ⁢
                
                  
                
                ⁢
                
                  
                    w
                    i
                  
                  ⁢
                  
                    
                      
                      
                        
                          
                            p
                            ^
                          
                          i
                        
                        -
                        
                          
                            p
                            ^
                          
                          i
                        
                      
                      
                    
                    2
                  
                
              
            
          
          
            
              
            
          
        
        
          
            where
          
          
            
              
            
          
        
        
          
            
              
                w
                i
              
              =
              
                {
                
                  
                    
                      
                        
                          1
                          ,
                        
                      
                      
                        
                          if
                          ⁢
                          
                            
                          
                          ⁢
                          the
                          ⁢
                          
                            
                          
                          ⁢
                          corresponding
                          ⁢
                          
                            
                          
                          ⁢
                          frame
                          ⁢
                          
                            
                          
                          ⁢
                          is
                          ⁢
                          
                            
                          
                          ⁢
                          voiced
                        
                      
                    
                    
                      
                        
                          0
                          ,
                        
                      
                      
                        
                          if
                          ⁢
                          
                            
                          
                          ⁢
                          the
                          ⁢
                          
                            
                          
                          ⁢
                          corresponding
                          ⁢
                          
                            
                          
                          ⁢
                          frame
                          ⁢
                          
                            
                          
                          ⁢
                          is
                          ⁢
                          
                            
                          
                          ⁢
                          unvoiced
                        
                      
                    
                  
                  .
                
              
            
          
          
            
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




and Pi is the unquantized log pitch, {circumflex over (p)}i is the quantized log pitch value. The above equation indicates that only voiced frames are taken into consideration in the codebook search.

Step 2: Calculate differentials of the unquantized log pitch values using:




  
    
      
        
          Δ
          ⁢
          
            
          
          ⁢
          
            p
            i
          
        
        =
        
          {
          
            
              
                
                  
                    p
                    i
                  
                  -
                  
                    p
                    
                      i
                      -
                      1
                    
                  
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    i
                  
                  -
                  
                    th
                    ⁢
                    
                      
                    
                    ⁢
                    and
                    ⁢
                    
                      
                    
                    ⁢
                    
                      (
                      
                        i
                        -
                        1
                      
                      )
                    
                  
                  -
                  
                    th
                    ⁢
                    
                      
                    
                    ⁢
                    frames
                    ⁢
                    
                      
                    
                    ⁢
                    are
                    ⁢
                    
                      
                    
                    ⁢
                    voiced
                  
                
              
            
            
              
                0
              
              
                else
              
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




for i=1, 2, 3, where P0 is the last log pitch value of the previous superframe. For the candidate log pitch values selected in step 1, calculate differentials of the candidates by replacing Δpi and pi by Δ{circumflex over (p)}i and {circumflex over (p)}i respectively in equation (2), where {circumflex over (p)}0 is the quantized version of p0.

Step 3: Select the index from the M best candidates that minimizes:




  
    
      
        
          d
          ′
        
        =
        
          
            
              
                ∑
                
                  i
                  =
                  1
                
                3
              
              ⁢
              
                
              
              ⁢
              
                
                  w
                  i
                
                ⁢
                
                  
                    
                    
                      
                        p
                        i
                      
                      -
                      
                        
                          p
                          ^
                        
                        i
                      
                    
                    
                  
                  2
                
              
            
            +
            
              δ
              ⁢
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  3
                
                ⁢
                
                  
                    
                    
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          p
                          i
                        
                      
                      -
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            p
                            ^
                          
                          i
                        
                      
                    
                    
                  
                  2
                
              
            
          
          =
          
            d
            +
            
              δ
              ⁢
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  3
                
                ⁢
                
                  
                
                ⁢
                
                  
                    
                    
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          p
                          i
                        
                      
                      -
                      
                        Δ
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            p
                            ^
                          
                          i
                        
                      
                    
                    
                  
                  2
                
              
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




where δ is a parameter to control the contribution of pitch differentials which is set to be 1.

For superframes that contain only one voiced frame, scalar quantization of the pitch is performed. The pitch value is quantized on a logarithmic scale with a 99-level uniform quantizer ranging from 20 to 160 samples. The quantizer is the same as that in the 2.4 kbps MELP standard, where the 99 levels are mapped to a 7 bit pitch codeword and the 28 unused codewords with Hamming weight 1 or 2 are used for error protection.
3.3 Joint Quantization of Pitch and U/V Decisions
The U/V decisions and pitch parameters for each superframe are jointly quantized using 12 bits. The joint quantization scheme is summarized in Table 4. In other words, the voicing pattern or mode (one of 8 possible patterns) and the set of three pitch values for the superframe form the input to a joint quantization scheme whose output is a 12 bit word. The decoder subsequently maps this 12 bit word by means of a table lookup into a particular voicing pattern and a quantized set of 3 pitch values.
In this scheme, the allocation of 12-bits consists of 3 mode bits (representing the 8 possible combinations of U/V decisions for the 3 frames in a superframe) and the remaining 9 bits for pitch values. The scheme employs six separate pitch codebooks, five having 9 bits (i.e. 512 entries each) and one being the scalar quantizer as indicated in Table 4; the specific codebook is determined according to the bit patterns of the 3-bit codeword representing the quantized voicing pattern. Therefore the U/V voicing pattern is first encoded into a 3-bit codeword as shown in Table 4, which is then used to select one of the 6 codebooks shown. The ordered set of 3 pitch values is then vector quantized with the selected codebook to generate a 9-bit codeword that identifies the quantized set of 3 pitch values. Note that four codebooks are assigned to the superframes in the VVV (voiced-voiced-voiced) mode, which means that the pitch vectors in the VVV type superframes are each quantized by one of 2048 codewords. If the number of voiced frames in the superframe is not larger than one, the 3-bit codeword is set to 000 and the distinction between different modes is determined within the 9-bit codebook. Note that the latter case consists of the 4 modes UUU, VUU, UVU, and UUV (where U denotes an unvoiced frame and V a voiced frame and the three symbols indicate the voicing status of the ordered set of 3 frames in a superframe). In this case, the 9 available bits are more than sufficient to represent the mode information as well as the pitch value since there are 3 modes with 128 pitch values and one mode with no pitch value.
3.4 Parity Bit
To improve robustness to transmission errors, a parity check bit is computed and transmitted for the three mode bits (representing voicing patterns) in the superframe as defined above in Section 3.3.
3.5 LSF Quantization
The bit allocation for quantizing the line spectral frequencies (LSF's) is shown in Table 5, with the original LSF vectors for the three frames denoted by l1, l2, l3. For the UUU, UUV, UVU and VUU modes, the LSF vectors of unvoiced frames are quantized using a 9-bit codebook, while the LSF vector of the voiced frame is quantized with a 24 bit multistage VQ (MSVQ) quantizer based on the approach described in [8].
The LSF vectors for the other U/V patterns are encoded using the following forward-backward interpolation scheme. This scheme works as follows: The quantized LSF vector of the previous frame is denoted by {circumflex over (l)}p. First the LSF's of the last frame in the current superframe, l3, is directly quantized to {circumflex over (l)}3 using the 9-bit codebook for unvoiced frames or the 24 bit MSVQ for voiced frames. Predicted values of l1 and l2 are then obtained by interpolating {circumflex over (l)}p and {circumflex over (l)}3 using the following equations:

{tilde over (l)}1(j)=α1(j)·{tilde over (l)}p(n)+[1−α1(j)]·{tilde over (l)}3(j)

{tilde over (l)}2(j)=α2(j)·{tilde over (l)}p(j)+[1−α2(j)]·{tilde over (l)}3(j) j=1, . . . , 10   (4)

where α1(j) and α2(j) are the interpolation coefficients.

The design of the MSVQ (multistage vector quantization) codebooks follows the procedure explained in [8].
The coefficients are stored in a codebook and the best coefficients are selected by minimizing the distortion measure:




  
    
      
        E
        =
        
          
            
              ∑
              
                j
                =
                1
              
              10
            
            ⁢
            
              
                
                  w
                  1
                
                ⁡
                
                  (
                  j
                  )
                
              
              ⁢
              
                
                  
                  
                    
                      
                        l
                        1
                      
                      ⁡
                      
                        (
                        j
                        )
                      
                    
                    -
                    
                      
                        
                          l
                          ~
                        
                        1
                      
                      ⁡
                      
                        (
                        j
                        )
                      
                    
                  
                  
                
                2
              
            
          
          +
          
            
              ∑
              
                j
                =
                1
              
              10
            
            ⁢
            
              
                
                  w
                  2
                
                ⁡
                
                  (
                  j
                  )
                
              
              ⁢
              
                
                  
                  
                    
                      
                        l
                        2
                      
                      ⁡
                      
                        (
                        j
                        )
                      
                    
                    -
                    
                      
                        
                          l
                          ~
                        
                        2
                      
                      ⁡
                      
                        (
                        j
                        )
                      
                    
                  
                  
                
                2
              
            
          
        
      
    
    
      
        (
        5
        )
      
    
  




where the coefficients wi(j) are the same as in the 2.4 kbps MELP standard. After obtaining the best interpolation coefficients, the residual LSF vector for frames 1 and 2 are computed by:

r1(j)=l1(j)−{tilde over (l)}1(j)

r2(j)=l2(j)−{tilde over (l)}2(j) j=1, . . . , 10   (6)

The 20-dimension residual vector R=[r1(1), r1(2), . . . , r1(10), r2(1), r2(2), . . . , r2(10)] is then quantized using weighted multi-stage vector quantization.

3.6 Method for Designing the Interpolation Codebook
The interpolation coefficients were obtained as follows. The optimal interpolation coefficients for each superframe were computed by minimizing the weighted mean square error between l1, l2 and li1, li2 which can be shown to result in:




  
    
      
        
          
            
              
                
                  a
                  1
                
                ⁡
                
                  (
                  j
                  )
                
              
              =
              
                
                  
                    
                      
                        w
                        1
                      
                      ⁡
                      
                        (
                        j
                        )
                      
                    
                    ⁡
                    
                      [
                      
                        
                          
                            
                              l
                              ^
                            
                            3
                          
                          ⁡
                          
                            (
                            j
                            )
                          
                        
                        -
                        
                          
                            l
                            1
                          
                          ⁡
                          
                            (
                            j
                            )
                          
                        
                      
                      ]
                    
                  
                  ·
                  
                    [
                    
                      
                        
                          
                            l
                            ^
                          
                          3
                        
                        ⁡
                        
                          (
                          j
                          )
                        
                      
                      -
                      
                        
                          
                            l
                            ^
                          
                          p
                        
                        ⁡
                        
                          (
                          j
                          )
                        
                      
                    
                    ]
                  
                
                
                  
                    
                      
                        w
                        1
                      
                      ⁡
                      
                        (
                        j
                        )
                      
                    
                    ⁡
                    
                      [
                      
                        
                          
                            
                              l
                              ^
                            
                            3
                          
                          ⁡
                          
                            (
                            j
                            )
                          
                        
                        -
                        
                          
                            
                              l
                              ^
                            
                            p
                          
                          ⁡
                          
                            (
                            j
                            )
                          
                        
                      
                      ]
                    
                  
                  2
                
              
            
          
          
            
              
            
          
        
        
          
            
              
                
                  a
                  2
                
                ⁡
                
                  (
                  j
                  )
                
              
              =
              
                
                  
                    
                      
                        w
                        2
                      
                      ⁡
                      
                        (
                        j
                        )
                      
                    
                    ⁡
                    
                      [
                      
                        
                          
                            
                              l
                              ^
                            
                            3
                          
                          ⁡
                          
                            (
                            j
                            )
                          
                        
                        -
                        
                          
                            l
                            2
                          
                          ⁡
                          
                            (
                            j
                            )
                          
                        
                      
                      ]
                    
                  
                  ·
                  
                    [
                    
                      
                        
                          
                            l
                            ^
                          
                          3
                        
                        ⁡
                        
                          (
                          j
                          )
                        
                      
                      -
                      
                        
                          
                            l
                            ^
                          
                          p
                        
                        ⁡
                        
                          (
                          j
                          )
                        
                      
                    
                    ]
                  
                
                
                  
                    
                      
                        w
                        2
                      
                      ⁡
                      
                        (
                        j
                        )
                      
                    
                    ⁡
                    
                      [
                      
                        
                          
                            
                              l
                              ^
                            
                            3
                          
                          ⁡
                          
                            (
                            j
                            )
                          
                        
                        -
                        
                          
                            
                              l
                              ^
                            
                            p
                          
                          ⁡
                          
                            (
                            j
                            )
                          
                        
                      
                      ]
                    
                  
                  2
                
              
            
          
          
            
              
                j
                =
                1
              
              ,
              ...
              ⁢
              
                
              
              ,
              10
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




Each entry of the training database for the codebook design employs the 40-dimension vector ({circumflex over (l)}p, l1, l2, l3), and the training procedure described below. The database is denoted as L={({circumflex over (l)}p,n, l1,n, l2,n, l3,n), n=0, 2, . . . , N−1}, where ({circumflex over (l)}p,n,l1,n{circumflex over (l)}3,n)=[{circumflex over (l)}p,n(1), . . . , {circumflex over (l)}p,n(10), l1,n(1), . . . , l1,n(10), {circumflex over (l)}3,n(1), . . . , m{circumflex over (l)}3,n(10)] is a 40 dimension vector. The output codebook is C={(α1,m, α2,m), m=0, . . . M−1}, where (α1,m, α2,m)=[α1,m(1), . . . , α1,m(10), α2,m(1), . . . , α2,m(10)] is a 20-dimension vector.

3.6.1 The two main procedures of the codebook training are now described. Given the codebook C={(α1,m, α2,m), m=0, . . . M′−1}, each database entry Ln=({circumflex over (l)}p,n, l1,n, l2,n,{circumflex over (l)}3,n) is associated to a particular centroid. The equation below is used to compute the error finction a between the entry (input vector) and each centroid in the codebook. The entry Ln is associated to the centroid which gives the smallest error. This step defines a partition on the input vectors.




  
    
      
        
          ɛ
          m
        
        =
        
          
            
              ∑
              
                j
                =
                1
              
              10
            
            ⁢
            
              
                
                  w
                  1
                
                ⁡
                
                  (
                  j
                  )
                
              
              ⁢
              
                
                  {
                  
                    
                      
                        l
                        
                          1
                          ,
                          n
                        
                      
                      ⁡
                      
                        (
                        j
                        )
                      
                    
                    -
                    
                      [
                      
                        
                          
                            
                              a
                              
                                1
                                ,
                                m
                              
                            
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                          ⁢
                          
                            
                              
                                l
                                ^
                              
                              
                                p
                                ,
                                n
                              
                            
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                        
                        +
                        
                          (
                          
                            1
                            -
                            
                              
                                
                                  a
                                  
                                    1
                                    ,
                                    m
                                  
                                
                                ⁡
                                
                                  (
                                  j
                                  )
                                
                              
                              ⁢
                              
                                
                                  
                                    l
                                    ^
                                  
                                  
                                    3
                                    ,
                                    n
                                  
                                
                                ⁡
                                
                                  (
                                  j
                                  )
                                
                              
                            
                          
                          )
                        
                      
                      ]
                    
                  
                  }
                
                2
              
            
          
          +
          
            
              ∑
              
                j
                =
                1
              
              10
            
            ⁢
            
              
                
                  w
                  2
                
                ⁡
                
                  (
                  j
                  )
                
              
              ⁢
              
                
                  {
                  
                    
                      
                        l
                        
                          2
                          ,
                          n
                        
                      
                      ⁡
                      
                        (
                        j
                        )
                      
                    
                    -
                    
                      [
                      
                        
                          
                            
                              a
                              
                                2
                                ,
                                m
                              
                            
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                          ⁢
                          
                            
                              
                                l
                                ^
                              
                              
                                p
                                ,
                                n
                              
                            
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                        
                        +
                        
                          (
                          
                            1
                            -
                            
                              
                                
                                  a
                                  
                                    2
                                    ,
                                    m
                                  
                                
                                ⁡
                                
                                  (
                                  j
                                  )
                                
                              
                              ⁢
                              
                                
                                  
                                    l
                                    ^
                                  
                                  
                                    3
                                    ,
                                    n
                                  
                                
                                ⁡
                                
                                  (
                                  j
                                  )
                                
                              
                            
                          
                          )
                        
                      
                      ]
                    
                  
                  }
                
                2
              
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




3.6.2 Given a particular partition, the codebook is updated. Assume N′ database entries are associated to the centroid Am=(α1,mα2,m) then the centroid is updated using the following equation:




  
    
      
        
          
            
              
                
                  a
                  
                    1
                    ,
                    m
                  
                
                ⁡
                
                  (
                  j
                  )
                
              
              =
              
                
                  
                    ∑
                    
                      n
                      =
                      0
                    
                    
                      
                        N
                        ′
                      
                      -
                      1
                    
                  
                  ⁢
                  
                    
                      
                        
                          w
                          
                            1
                            ,
                            n
                          
                        
                        ⁡
                        
                          (
                          j
                          )
                        
                      
                      ⁡
                      
                        [
                        
                          
                            
                              
                                l
                                ^
                              
                              
                                3
                                ,
                                n
                              
                            
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                          -
                          
                            
                              l
                              
                                1
                                ,
                                n
                              
                            
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                        
                        ]
                      
                    
                    ·
                    
                      [
                      
                        
                          
                            
                              l
                              ^
                            
                            
                              3
                              ,
                              n
                            
                          
                          ⁡
                          
                            (
                            j
                            )
                          
                        
                        -
                        
                          
                            
                              l
                              ^
                            
                            
                              p
                              ,
                              n
                            
                          
                          ⁡
                          
                            (
                            j
                            )
                          
                        
                      
                      ]
                    
                  
                
                
                  
                    ∑
                    
                      n
                      =
                      0
                    
                    
                      
                        N
                        ′
                      
                      -
                      1
                    
                  
                  ⁢
                  
                    
                      
                        
                          w
                          
                            1
                            ,
                            n
                          
                        
                        ⁡
                        
                          (
                          j
                          )
                        
                      
                      ⁡
                      
                        [
                        
                          
                            
                              
                                l
                                ^
                              
                              
                                3
                                ,
                                n
                              
                            
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                          -
                          
                            
                              
                                l
                                ^
                              
                              
                                p
                                ,
                                n
                              
                            
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                        
                        ]
                      
                    
                    2
                  
                
              
            
          
        
        
          
            
              
                
                  a
                  
                    2
                    ,
                    m
                  
                
                ⁡
                
                  (
                  j
                  )
                
              
              =
              
                
                  
                    ∑
                    
                      n
                      =
                      0
                    
                    
                      
                        N
                        ′
                      
                      -
                      1
                    
                  
                  ⁢
                  
                    
                      
                        
                          w
                          
                            2
                            ,
                            n
                          
                        
                        ⁡
                        
                          (
                          j
                          )
                        
                      
                      ⁡
                      
                        [
                        
                          
                            
                              
                                l
                                ^
                              
                              
                                3
                                ,
                                n
                              
                            
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                          -
                          
                            
                              l
                              
                                2
                                ,
                                n
                              
                            
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                        
                        ]
                      
                    
                    ·
                    
                      [
                      
                        
                          
                            
                              l
                              ^
                            
                            
                              3
                              ,
                              n
                            
                          
                          ⁡
                          
                            (
                            j
                            )
                          
                        
                        -
                        
                          
                            
                              l
                              ^
                            
                            
                              p
                              ,
                              n
                            
                          
                          ⁡
                          
                            (
                            j
                            )
                          
                        
                      
                      ]
                    
                  
                
                
                  
                    ∑
                    
                      n
                      =
                      0
                    
                    
                      
                        N
                        ′
                      
                      -
                      1
                    
                  
                  ⁢
                  
                    
                      
                        
                          w
                          
                            2
                            ,
                            n
                          
                        
                        ⁡
                        
                          (
                          j
                          )
                        
                      
                      ⁡
                      
                        [
                        
                          
                            
                              
                                l
                                ^
                              
                              
                                3
                                ,
                                n
                              
                            
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                          -
                          
                            
                              
                                l
                                ^
                              
                              
                                p
                                ,
                                n
                              
                            
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                        
                        ]
                      
                    
                    2
                  
                
              
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




The interpolation coefficients codebook was trained and tested for several codebook sizes. A codebook with 16 entries was found to be quite efficient. The above procedure is readily understood by engineers familiar with the general concepts of vector quantization and codebook design as described in [7].

3.7 Gain Quantization
In the 1.2 kbps coder, two gain parameters are calculated per frame, with 6 gains per superframe. The 6 gain parameters are vector-quantized using a 10 bit vector quantizer with a MSE criterion defined in the logarithmic domain.
3.8 Bandpass Voicing Quantization
The voicing information for the lowest band out of the total of 5 bands is determined from the U/V decision. The voicing decisions of the remaining 4 bands are employed only for voiced frames. The binary voicing decisions (1 for voiced and 0 for unvoiced) of the 4 bands are quantized using the 2-bit codebook shown in Table 2. This procedure results in two bits being used for voicing in each voiced frame. The bit allocation required in different coding modes for bandpass voicing quantization is shown in Table 6.
3.9 Quantization of Fourier Magnitudes
The Fourier magnitude vector is computed only for voiced frames. The quantization procedure for Fourier magnitudes is summarized in Table 7. The unquantized Fourier magnitude vectors for the three frames in a superframe are denoted as fi,i=1,2,3. Denoted by f0 is the Fourier magnitude vector of the last frame in the previous superframe, {circumflex over (f)}i denotes the quantized vector fi, and Q(.) denotes the quantizer function for the Fourier magnitude vector when using the same 8-bit codebook as used within the MELP standard. The quantized Fourier magnitude vectors for the three frames in a superframe are obtained as shown in Table 7.
3.10 Aperiodic flag quantization
The 1.2 kbps coder uses 1-bit per superframe for the quantization of the aperiodic flag. In the 2.4 kbps MELP standard, the aperiodic flag requires one bit per frame, which is three bits per superframe. The compression to one bit per superframe is obtained using the quantization procedure shown in Table 8. In the table, “J” and “-” indicate respectively the aperiodic flag states of set and not set.
3.11 Error Protection

    
    
        3.11.1 Mode protection
    
    


Aside from the parity bit, additional mode error protection techniques are applied to superframes by employing the spare bits that are available in all superframes except the superframes in the VVV mode. The 1.2 kbps coder uses two bits for the quantization of the bandpass voicing for each voiced frame. Hence, in superframes that have one unvoiced frame, two bandpass voicing bits are spare and can be used for mode protection. In superframes that have two unvoiced frames, four bits can be used for mode protection. In addition 4 bits of LSF quantization are used for mode protection in the UUU and VVU modes. Table 9 shows how these mode protection bits are used. Mode protection implies protection of the coding state, which was described in Section 1.1.

    
    
        3.11.2 Forward Error Correction for UUU Superframe
    
    


In the UUU mode, the first 8 MSB's of the gain index are divided into two groups of 4 bits and each group is protected by the Hamming (8, 4) code. The remaining 2 bits of the gain index are protected with the Hamming (7, 4) code. Note that the Hamming (7, 4) code corrects single bit-errors, while the (8, 4) code corrects single bit errors and in addition detects double bit-errors. The LSF bits for each frame in the UUU superframes are protected by a cyclic redundancy check (CRC) with a CRC (13, 9) code which detects single and double bit-errors.
4. DECODER
4.1 Bit Unpacking and Error Correction
Within the decoder, the received bits are unpacked from the channel and assembled into parameter codewords. Since the decoding procedures for most parameters depend on the mode (the U/V pattern), the 12 bits allocated for pitch and U/V decisions are decoded first. For the bit pattern 000 in the 3-bit codebook, the 9-bit codeword specifies one of the UUU, UUV, UVU, and VUU modes. If the code of the 9-bit codebook is all-zeros, or has one bit set, the UUU mode is used. If the code has two bits set, or specifies an index unused for pitch, a frame erasure is indicated.
After decoding the U/V pattern, the resulting mode information is checked using the parity bit and the mode protection bits. If an error is detected, a mode correction algorithm is performed. The algorithm attempts to correct the mode error using the parity bits and mode protection bits. In the case that an uncorrectable error is detected, different decoding methods are applied for each parameter according to the mode error patterns. In addition, if a parity error is found, a parameter-smoothing flag is set. The correction procedures are described in Table 10.
In the UUU mode, assuming no errors were detected in the mode information, the two (8, 4) Hamming codes representing the gain parameters are decoded to correct single bit errors and detect double errors. If an uncorrectable error is detected, a frame erasure is indicated. Otherwise the (7, 4) Hamming code for gain and the (13, 9) CRC (cyclic redundancy check) codes for LSF's are decoded to correct single errors and detect single and double errors, respectively. If an error is found in the CRC (13, 9) codes, the incorrect LSF's are replaced by repeating previous LSF's or interpolating between the neighboring correct LSF's.
If a frame erasure is detected in the current superframe by the Hamming decoder, or an erasure is directly signaled from the channel, a frame repeat mechanism is implemented. All the parameters of the current superframe are replaced with the parameters from the last frame of the previous superframe.
For a superframe in which an erasure is not detected, the remaining parameters are decoded. If smoothing is necessary, the post-smoothing parameter is obtained by:

x=0.5{circumflex over (x)}+0.5x′  (10)

where {circumflex over (x)} and x′ represent the decoded parameter of the current frame and the corresponding parameter of the previous frame, respectively.

4.2 Pitch Decoding
The pitch decoding is performed as shown in Table 4. For unvoiced frames, the pitch value is set to 50 samples.
4.3 LSF Decoding
The LSF's are decoded as described in Section 4.4 and Table 5. The LSF's are checked for ascending order and minimum separation.
4.4 Gain decoding
The gain index is used to retrieve a codeword containing six gain parameters from the 10-bit VQ gain codebook.
4.5 Decoding of Bandpass Voicing
In the unvoiced frames, all of the bandpass voicing strengths are set to zero. In the voiced frames, Vbpl is set to 1 and the remaining voicing patterns are decoded as shown in Table 2.
4.6 Decoding of Fourier Magnitudes
The Fourier magnitudes of unvoiced frames are set equal to 1. For the last voiced frame of the current superframe, the Fourier magnitudes are decoded directly. The Fourier magnitudes of other voiced frames are generated by repetition or linear interpolation as shown in Table 7.
4.7 Aperiodic Flag Decoding
The aperiodic flags are obtained from the new flag as shown in Table 8. The jitter is set to 25% if the aperiodic flag is 1, otherwise the jitter is set to 0%.
4.8 MELP Synthesis
The basic structure of the decoder is the same as in the MELP standard except that a new harmonic synthesis method is introduced to generate the excitation signal for each pitch cycle. In the original 2.4 kbps MELP algorithm, the mixed excitation is generated as the sum of the filtered pulse and noise excitations. The pulse excitation is computed using an inverse discrete Fourier transform (IDFT) of one pitch period in length and the noise excitation is generated in the time domain. In the new harmonic synthesis algorithm, the mixed excitation is generated completely in the frequency domain and then an inverse discrete Fourier transform operation is performed to convert it into the time domain. This avoids the need for bandpass filtering of the pulse and noise excitations, thereby reducing complexity of the decoder.
In the new harmonic synthesis procedure, the excitation in the frequency domain is generated for each pitch cycle based on the cutoff frequency and the Fourier magnitude vector Al, l=1, 2, . . . , L. The cutoff frequency is obtained from the bandpass voicing parameters as previously described and it is then interpolated for each pitch cycle. The Fourier magnitudes are interpolated in the same way as in the MELP standard.
With the pitch length denoted as N, the corresponding fuidamental frequency is described by: f0=2π/N. The Fourier magnitude vector length is then given by: L=N/2. Two transition frequencies FH and FL are determined from the cutoff frequency F employing an empirically derived algorithm. algorithm as follows,




  
    F
    H
  
  =
  
    {
    
      
        
          
            
              
                0.85
                ⁢
                F
              
            
            
              
                
                  0
                  ⁢
                  
                    
                  
                  ⁢
                  Hz
                
                ≤
                F
                ≤
                
                  500
                  ⁢
                  Hz
                
              
            
          
          
            
              
                0.95
                ⁢
                F
              
            
            
              
                
                  500
                  ⁢
                  
                    
                  
                  ⁢
                  Hz
                
                ≤
                F
                ≤
                
                  1000
                  ⁢
                  Hz
                
              
            
          
          
            
              
                0.98
                ⁢
                F
              
            
            
              
                
                  1000
                  ⁢
                  
                    
                  
                  ⁢
                  Hz
                
                ≤
                F
                ≤
                
                  2000
                  ⁢
                  Hz
                
              
            
          
          
            
              
                0.95
                ⁢
                F
              
            
            
              
                
                  2000
                  ⁢
                  
                    
                  
                  ⁢
                  Hz
                
                ≤
                F
                ≤
                
                  3000
                  ⁢
                  Hz
                
              
            
          
          
            
              
                0.92
                ⁢
                F
              
            
            
              
                
                  3000
                  ⁢
                  
                    
                  
                  ⁢
                  Hz
                
                ≤
                F
                ≤
                
                  4000
                  ⁢
                  Hz
                
              
            
          
        
        ⁢
        
          
        
        ⁢
        
          

        
        ⁢
        
          F
          L
        
      
      =
      
        {
        
          
            
              
                1.05
                ⁢
                F
              
            
            
              
                
                  0
                  ⁢
                  
                    
                  
                  ⁢
                  Hz
                
                ≤
                F
                ≤
                
                  500
                  ⁢
                  Hz
                
              
            
          
          
            
              
                1.05
                ⁢
                F
              
            
            
              
                
                  500
                  ⁢
                  
                    
                  
                  ⁢
                  Hz
                
                ≤
                F
                ≤
                
                  1000
                  ⁢
                  Hz
                
              
            
          
          
            
              
                1.02
                ⁢
                F
              
            
            
              
                
                  1000
                  ⁢
                  
                    
                  
                  ⁢
                  Hz
                
                ≤
                F
                ≤
                
                  2000
                  ⁢
                  Hz
                
              
            
          
          
            
              
                1.05
                ⁢
                F
              
            
            
              
                
                  2000
                  ⁢
                  
                    
                  
                  ⁢
                  Hz
                
                ≤
                F
                ≤
                
                  3000
                  ⁢
                  Hz
                
              
            
          
          
            
              
                1.00
                ⁢
                F
              
            
            
              
                
                  3000
                  ⁢
                  
                    
                  
                  ⁢
                  Hz
                
                ≤
                F
                ≤
                
                  4000
                  ⁢
                  Hz
                
              
            
          
        
      
    
  




These transition frequencies are equivalent to two frequency component indices VH and VL. A voiced model is used for all the frequency samples below VL, a mixed model is used for frequency samples between VL and VH, and an unvoiced model is used for frequency samples above VH. To define the mixed mode, a gain factor g is selected with the value depending on the cutoff frequency (the higher the cutoff frequency F, the smaller the gain factor).





  g
  =
  
    {
    
      
        
          1.0
        
        
          
            
              0
              ⁢
              
                
              
              ⁢
              Hz
            
            ≤
            F
            ≤
            
              500
              ⁢
              Hz
            
          
        
      
      
        
          0.9
        
        
          
            
              500
              ⁢
              
                
              
              ⁢
              Hz
            
            ≤
            F
            ≤
            
              1000
              ⁢
              Hz
            
          
        
      
      
        
          0.8
        
        
          
            
              1000
              ⁢
              
                
              
              ⁢
              Hz
            
            ≤
            F
            ≤
            
              2000
              ⁢
              Hz
            
          
        
      
      
        
          0.75
        
        
          
            
              2000
              ⁢
              
                
              
              ⁢
              Hz
            
            ≤
            F
            ≤
            
              3000
              ⁢
              Hz
            
          
        
      
      
        
          0.7
        
        
          
            
              3000
              ⁢
              
                
              
              ⁢
              Hz
            
            ≤
            F
            ≤
            
              4000
              ⁢
              Hz
            
          
        
      
    
  




The magnitude and phase of the frequency components of the excitation are determined as follows:




  
    
      
        
          
          
            X
            ⁡
            
              (
              l
              )
            
          
          
        
        =
        
          {
          
            
              
                
                  A
                  l
                
              
              
                
                  l
                  <
                  
                    V
                    L
                  
                
              
            
            
              
                
                  
                    
                      
                        l
                        -
                        
                          V
                          l
                        
                      
                      
                        
                          V
                          H
                        
                        -
                        
                          V
                          L
                        
                      
                    
                    ·
                    g
                    ·
                    
                      A
                      l
                    
                  
                  +
                  
                    
                      
                        
                          V
                          H
                        
                        -
                        1
                      
                      
                        
                          V
                          H
                        
                        -
                        
                          V
                          L
                        
                      
                    
                    ·
                    
                      A
                      l
                    
                  
                
              
              
                
                  
                    V
                    L
                  
                  ≤
                  l
                  ≤
                  
                    V
                    H
                  
                
              
            
            
              
                
                  g
                  ·
                  
                    A
                    l
                  
                
              
              
                
                  l
                  >
                  
                    V
                    H
                  
                
              
            
          
          ⁢
          
            

          
        
      
    
    
      
        (
        11
        )
      
    
  
  
    
      
        
          ∠X
          ⁡
          
            (
            l
            )
          
        
        =
        
          {
          
            
              
                
                  l
                  ⁢
                  
                    
                  
                  ⁢
                  
                    φ
                    0
                  
                
              
              
                
                  l
                  <
                  
                    V
                    L
                  
                
              
            
            
              
                
                  
                    l
                    ⁢
                    
                      
                    
                    ⁢
                    
                      φ
                      0
                    
                  
                  -
                  
                    
                      
                        l
                        -
                        
                          V
                          L
                        
                      
                      
                        
                          V
                          H
                        
                        -
                        
                          V
                          L
                        
                      
                    
                    ·
                    
                      
                        φ
                        RND
                      
                      ⁡
                      
                        (
                        l
                        )
                      
                    
                  
                
              
              
                
                  
                    V
                    L
                  
                  ≤
                  l
                  ≤
                  
                    V
                    H
                  
                
              
            
            
              
                
                  
                    φ
                    RND
                  
                  ⁡
                  
                    (
                    l
                    )
                  
                
              
              
                
                  l
                  >
                  
                    V
                    H
                  
                
              
            
          
        
      
    
    
      
        (
        12
        )
      
    
  




where l is an index identifying a particular frequency component of the IDFT frequency range and φ0 is a constant selected so as to avoid a pitch pulse at the pitch cycle boundary. The phase φRND(l) is a uniformly distributed random number between −2π and 2π independently generated for each value of l.

In other words, the spectrum of the mixed excitation signal in each pitch period is modeled by considering three regions of the spectrum, as determined by the cutoff frequency, which determines a transition interval from FL to FH. In the low region, from 0 to FL, the Fourier magnitudes directly determine the spectrum. In the high region, above FH, the Fourier magnitudes are scaled down by the gain factor g. In the transition region, from FL to FH, the Fourier magnitudes are scaled by a linearly decreasing weighting factor that drops from unity to g across the transition region. A linearly increasing phase is used for the low region, and random phases are used for the high region. In the transition region, the phase is the sum of the linear phase and a weighted random phase with the weight increasing linearly from 0 to 1 across the transition region. The frequency samples of the mixed excitation are then converted to the time domain using an inverse Discrete Fourier Transform.
5. TRANSCODER
5.1 Concepts
In some applications, it is important to allow interoperation between two different speech coding schemes. In particular, it is useful to allow interoperability between a 2400 bps MELP coder and a 1200 bps superframe coder. The general operation of a transcoder is illustrated in the block diagrams of FIGS. 5A and 5B. In the up-converting transcoder 70 of FIG. 5A, speech is input 72 to a 1200 bps vocoder 74 whose output is an encoded bit stream at 1200 bps 76 which is converted by the “Up-Transcoder” 78 into a 2400 bps bit stream 80 in a form allowing it to be decoded by a 2400 bps MELP decoder 82, that outputs synthesized speech 84. Conversely, in the down-converting transcoder 90 of FIG. 3B speech is input 92 to a 2400 bps MELP encoder 94, which outputs a 2400 bps bit stream 96 into a “Down-Transcoder” 98, that converts the parametric data stream into a 1200 bps bit stream 100 that can be decoded by the 1200 bps decoder 102, that outputs synthesized speech 104. In full-duplex (two-way) voice communication both the up-transcoder and the down-transcoder are needed to provide interoperability.
A simple way to implement an up-transcoder is to decode the 1200 bps bit stream with a 1200 bps decoder to obtain a raw digital representation of the recovered speech signal which is then re-encoded with a 2400 bps encoder. Similarly, a simple method for implementing a down-transcoder is to decode the 2400 bps bit stream with a 2400 bps decoder to obtain a raw digital representation of the recovered speech signal which is then re-encoded with a 1200 bps encoder. This approach to implementing up and down transcoders, corresponds to what is called “tandem” encoding and has the disadvantages that the voice quality is substantially degraded and the complexity of the transcoder is unnecessarily high. Transcoder efficiency is improved with the following method for transcoding that reduces complexity while avoiding much of the quality degradation associated with tandem encoding.
5.2 Down-Transcoder
In the down-transcoder, after synchronization and channel error correction decoding are performed, the bits representing each parameter are separately extracted from the bit stream for each of three consecutive frames (constituting a superframe) and the set of parameter information is stored in a parameter buffer. Each parameter set consists of the values of a given parameter for the three consecutive frames. The same methods used to quantize superframe parameters are applied here to each parameter set for recoding into the lower-rate bit stream. For example, the pitch and U/V decision for each of 3 frames in a superframe is applied to the pitch and U/V quantization scheme described in Section 3.2. In this case, the parameter set consists of 3 pitch values each represented with 7 bits and 3 U/V decisions each given by 1 bit, giving a total of 24 bits. This is extracted from the 2400 bps bit stream and the recoding operation converts this into 12 bits to represent the pitch and voicing for the superframe. In this way, the down-transcoder does not have to perform the MELP analysis functions and only performs the needed quantization operations for the superframe. Note that the parity check bit, synchronization bit, and error correction bits must be regenerated as part of the down transcoding operation.
5.3 Up-Transcoder
In the case of an up-transcoder the input bit stream of 1200 bps contains quantized parameters for each superframe. After synchronization and error correction decoding are performed, the up-transcoder extracts the bits representing each parameter for the superframe which are mapped (recoded) into a larger number of bits that specify separately the corresponding values of that parameter for each of the three frames in the current superframe. The method of performing this mapping, which is parameter dependent, is described below. Once all parameters for a frame of the superframe have been determined, the sequence of bits representing three frames of speech are generated. From this data sequence, the 2400 bps bit stream is generated, after insertion of the synchronization bit, parity bit, and error correction encoding.
The following is a description of the general approach to mapping (decoding) the parameter bits for a superframe into separate parameter bits for each of the three frames. Quantization tables and codebooks are used in the 1200 bps decoder for each parameter as described previously. The decoding operation takes a binary word that represents one or more parameters and outputs a value for each parameter, e.g. a particular LSF value or pitch value as stored in a codebook. The parameter values are requantized, i.e. applied as input to a new quantizing operation employing the quantization tables of the 2400 bps MELP coder. This requantization leads to a new binary word that represents the parameter values in a form suitable for decoding by the 2400 bps MELP decoder.
As an example to illustrate the use of requantization, from the 1200 bps bit stream, the bits containing the pitch and voicing information for a particular superframe are extracted and decoded into 3 voicing (V/U) decisions and 3 pitch values for the 3 frames in the superframe; The 3 voicing decisions are binary and are directly usable as the voicing bits for the 2400 bps MELP bitstream (one bit for each of 3 frames). The 3 pitch values are requantized by applying each to the MELP pitch scalar quantizer obtaining a 7 bit word for each pitch value. Numerous alternative implementation of pitch requantization which follow the inventive method described can be designed by a person skilled in the art.
One specific alteration can be created by bypassing pitch requantization when only a single frame of the superframe is voiced, since in this case the pitch value for the voiced frame is already specified in quantized form consistent with the format of the MELP vocoder. Similarly, for the Fourier magnitudes, requantization is not needed for the last frame of a superframe since it is has already been scalar quantized in the MELP format. However the interpolated Fourier magnitudes for the other two frames of the superframe need to be requantized by the MELP quantization scheme. The jitter, or aperiodic flag, is simply obtained by table lookup using the last two columns of Table 8.
6. DIGITAL VOCODER TERMINAL HARDWARE
FIG. 6 shows a digital vocoder terminal containing an encoder and decoder that operate in accordance with the voice coding methods and apparatus of this invention. The microphone MIC 112 is an input speech transducer providing an analog output signal 114 which is sampled and digitized by an Analog to Digital Converter (A/D) 116. The resulting sampled and digitized speech 118 is digitally processed and compressed within a DSP/controller chip 120, by the voice encoding operations performed in the Encode block 122, which is implemented in software within the DSP/Controller according to the invention.
The digital signal processor (DSP) 120 is exemplified by the Texas Instruments TMC320C5416 integrated circuit, which contains random access memory (RAM) providing sufficient buffer space for storing speech data and intermediate data and parameters; the DSP circuit also contains read-only memory (ROM) for containing the program instructions, as previously described, to implement the vocoder operations. A DSP is well suited for performing the vocoder operations described in this invention. The resultant bitstream from the encoding operation 124 is a low rate bit-stream, Tx data stream. The Tx data 124 enters a Channel Interface Unit 126 to be transmitted over a channel 128.
On the receiving side, data from a channel 128 enters a Channel Interface Unit 126 which outputs an Rx bit-stream 130. The Rx data 130 is applied to a set of voice decoding operations within the decode block; the operations have been previously described. The resulting sampled and digitized speech 134, is applied to a Digital to Analog Converter (D/A) 136. The D/A outputs reconstructed analog speech 138. The reconstructed analog speech 138 is applied to a speaker 140, or other audio transducer which reproduces the reconstructed sound.
FIG. 6 is a representation of one configuration of hardware on which the inventive principles may be practiced. The inventive principles may be practiced on various forms of vocoder implementations that can support the processing functions described herein for the encoding and decoding of the speech data. Specifically the following are but a few of the many variations included within the scope of the inventive implementation:
(a) Using Channel Interface Units which contain a voiceband data modem for use when the transmission path is a conventional telephone line.
(b) Using encrypted digital signals for transmission and described for reception via a suitable encryption device to provide secure transmission. In this case, the encryption unit would also be contained in the Channel Interface Unit.
(c) Using a Channel Interface Unit that contains a radio frequency modulator and demodulator for wireless signal transmission by radio waves for cases in which the transmission channel is a wireless radio link.
(d) Using a Channel Interface Unit that contains multiplexing and demultiplexing equipment for sharing a common transmission channel with multiple voice and/or data channels. In this case multiple Tx and Rx signals would be connected to the Channel Interface Unit.
(e) Employing discrete components, or a mix of discrete elements and processing elements, to replace the instruction processing operations of the DSP/Controller. Examples that could be employed include programmable gate arrays (PGAs). It must be noted that the invention can be fully reduced to practice in hardware, without the need of a processing element.
Hardware to support the inventive principles need only support the data operations described. However, use of a DSP/processor chips are the most common circuits used for implementing speech coders or vocoders in the current state of the art.
Although the description above contains many specificities, these should not be construed as limiting the scope of the invention but as merely providing illustrations of some of the presently preferred embodiments of this invention. Thus the scope of this invention should be determined by the appended claims and their legal equivalents.







TABLE 1







Bit Allocation of both 2.4 kbps and 1.2 kbps Coding Schemes









Bits for quantization of three frames(540 samples)















2.4 kbps
2.4 kbps
1.2 kbps
1.2 kb
1.2 kb
1.2 kb
1.2 kbps


Parameters
Voiced
Unvoiced
state 1
state 2
state 3
state 4
state 5

















Pitch & Global
7 * 3
7 * 3
12
12
12
12
12


UV Decisions


Parity
0
0
1
1
1
1
1


LSF's
25 * 3 
25 * 3 
42
42
39
42
27


Gains
8 * 3
8 * 3
10
10
10
10
10


Bandpass Voicing
4 * 3
0
6
4
4
2
0


Fourier Magnitudes
8 * 3
0
8
8
8
8
0


Jitter
1 * 3
0
1
1
1
1
0


Synchronization
1 * 3
1 * 3
1
1
1
1
1


Error Protection
0
13 * 3 
0
2
5
4
30


Total
162
162
81
81
81
81
81





*Note:


1.2 kbps State 1: All three frames are voiced.


1.2 kbps State 2: One of the first two frames is unvoiced, other frames are voiced.


1.2 kbps State 3: The 1st and 2nd frames are voiced. The 3rd frame is unvoiced.


1.2 kbps State 4: One of the three frames is voiced, other two frames are unvoiced.


1.2 kbps State 5: All three frames are unvoiced.













TABLE 2







Bandpass voicing index mapping











Codeword:
0000
1000
1100
1111





Voicing patterns
0000
1000
1100
0111


assigned to the
0001
1001

1011


codeword.
0010
1010

1101



0011


1110



0100


1111



0101



0110


Cutoff Frequency
500 Hz
1000 Hz
2000 Hz
4000 Hz
















TABLE 3







Pitch quantization schemes








U/V pattern
Pitch quantization method





U U U
N/A


U U V
The pitch of the only voiced frame is scalar quantized using


U V U
a 7-bit quantizer.


V U U


U V V
The pitches of the voiced frames are quantized using the


V U V
same VQ as for the VVV case. A weighting function is


V V U
applied which takes into account the U/V information.


V V V
Vector quantization of three pitches
















TABLE 4







Joint quantization scheme of pitch and voicing decisions










3-bit



U/V patterns
codewords
9-bit codebooks





UUU
000
The pitch value is quantized with the same 99-


UUV

level uniform quantizer as in the 2.4 kbps


UVU

standard. The pitch value and U/V pattern are


VUU

then mapped to a codevector in this 9-bit




codebook.


VVU
001
These U/V patterns share the same codebook


VUV
010
containing 512 codevectors of the pitch triple.


UVV
100


VVV
011
512-entry codebook A



101
512-entry codebook B



110
512-entry codebook C



111
512-entry codebook D
















TABLE 5







Bit allocation for LSF quantization according to UV decisions


















Resid-








ual






Interpola-
of l1 and


U/V pattern
LSF l1
LSF l2
LSF l3
tion
l2
Total





U U U
9
9
9
0
0
27


V U U
8 + 6 +
9
9
0
0
42



5 + 5


U V U
9
8 + 6 +
9
0
0
42




5 + 5


U U V
9
9
8 + 6 +
0
0
42





5 + 5


U V V
0
0
8 + 6 +
4
8 + 6
42





5 + 5


V U V


V V V


V V U
0
0
9
4
8 + 6 +
39







6 + 6
















TABLE 6







Bit Allocation for bandpass voicing quantization













VVU, VUV,
VUU, UVU,



UV decisions pattern
VVV
UVV
UUV
UUU





Bits for bandpass
6
4
2
0


voicing information
















TABLE 7







Fourier magnitude vector quantization








U/V pattern



for current
U/V decision for the last frame of the previous superframe









superframe
U
V





UUU
N/A



VUU
{circumflex over (f)}1 = Q(f1)


UVU
{circumflex over (f)}2 = Q(f2)


UUV
{circumflex over (f)}3 = Q(f3)


UVV
{circumflex over (f)}3 = Q(f3), {circumflex over (f)}2 = {circumflex over (f)}3


VUV
{circumflex over (f)}3 = Q(f3), {circumflex over (f)}1 = {circumflex over (f)}3
{circumflex over (f)}3 = Q(f3), {circumflex over (f)}1 = {circumflex over (f)}0


VVU
{circumflex over (f)}2 = Q(f2), {circumflex over (f)}1 = {circumflex over (f)}2
{circumflex over (f)}2 = Q(f2),








  
    
      f
      ^
    
    1
  
  =
  
    
      
        
          f
          ^
        
        0
      
      +
      
        
          f
          2
        
        ^
      
    
    2
  






 


VVV
{circumflex over (f)}2 = Q(f2), {circumflex over (f)}1 = {circumflex over (f)}2 = {circumflex over (f)}3
{circumflex over (f)}3 = Q(f3),








  
    
      
        f
        ^
      
      1
    
    =
    
      
        
          2
          ·
          
            
              f
              ^
            
            0
          
        
        +
        
          
            f
            3
          
          ^
        
      
      3
    
  
  ,
  
    
      
        f
        ^
      
      2
    
    =
    
      
        
          
            f
            ^
          
          0
        
        +
        
          2
          ·
          
            
              f
              3
            
            ^
          
        
      
      3
    
  




















TABLE 8







Aperiodic flag quantization using 1 bit









Quantization Patterns










U/V pattern
Quantization Procedure
New flag = 0
New flag = 1

















U U U
N/A
J
J
J
J
J
J


U U V
If the voiced frame has
J
J
-
J
J
J


U V U
aperiodic flag, set new
J
-
J
J
J
J


V U U
flag.
-
J
J
J
J
J


U V V
If the second frame has
J
-
-
J
J
-


V V U
aperiodic flag, set new
-
-
J
-
J
J



flag.


V U V
N/A
-
J
-
-
J
-


V V V
If >1 frame has the aperiodic
-
-
-
J
J
J



flag set, set new flag.
















TABLE 9







Mode protection schemes












3-b codebook of






joint quantization
Bit pattern of
Bit pattern of




for pitch and U/V
bandpass
bandpass
Bit pattern


U/V pattern
decisions
voicing 1
voicing 2
of LSF





U U U
000
00
00
0000


U U V

00
01
—


U V U

00
10
—


V U U

00
11
—


V V U
001
01
—
0101


V U V
010
10
—
—


U V V
100
11
—
—


V V V
011, 101,
—
—
—



110, 111
















TABLE 10







Parameter decoding schemes if a mode error is detected














Correc-








ted


U/V
U/V




Fourier


pat-
pat-



Bandpass
Mag-


tern
tern
LSF's
Gain
Pitch
voicing
nitude





UUU
UUU
Repeat
Decode

Set to 0
Set to


UUV

LSF's of
and apply


1 all


UVU

the last
smoothing


mag-


VUU

frame in



nitudes




the previous




superframe


VVU
VVV
Decode and
Decode
Decode
Set the


VUV

apply
and apply
and
first


VVU

smoothing
smoothing
apply
band to






smooth-
1,






ing
others







to 0

## Claims

1. A voice compression apparatus, comprising:
(a) a superframe buffer for receiving multiple frames of voice data;
(b) a frame-based encoder analysis module for analyzing characteristics of voice data within frames contained in the superframe to produce an associated set of voice data parameters; and
(c) a superframe encoder for receiving voice data parameters from the analysis module for a group of frames contained within the superframe buffer, for reducing by analysis data for the group of frames and for quantizing and encoding said data into an outgoing digital bit stream for transmission, wherein said superframe encoder includes a bandpass voicing smoother for mapping multiband voicing decisions for each frame into a single cutoff frequency for that frame, wherein said cutoff frequency takes on one value from a predetermined list of allowable values.

2. A voice compression apparatus as recited in claim 1, wherein the analysis module is selected from the group of voice encoders consisting of linear predictive coders, mixed-excitation linear prediction coders, harmonic coders, and multi-band excitation coders.

3. A voice compression apparatus as recited in claim 1, wherein said superframe encoder includes at least two parametric processing modules selected from the group of parametric processing modules consisting of pitch smoothers, bandpass voicing smoothers, linear predictive quantizers, jitter quantizers, and Fourier magnitude quantizers.

4. A voice compression apparatus as recited in claim 1, wherein said superframe encoder includes a vector quantizer wherein pitch values within a superframe are vector quantized with a distortion measure responsive to pitch errors.

5. A voice compression apparatus as recited in claim 1, wherein said superfrane encoder includes a vector quantizer wherein pitch values within a superframe are vector quantized with a distortion measure responsive to pitch differentials as well as pitch errors.

6. A voice compression apparatus as recited in claim 1, wherein said super-frame encoder includes a quantizer of linear prediction parameters, wherein quantization is performed with a codebook-based interpolation of linear prediction parameters that employ different interpolation coefficients for each linear prediction parameter, and wherein said quantizer operates in closed loop mode to minimize overall error over a number of frames.

7. A voice compression apparatus as recited in claim 6, wherein said quantizer is capable of performing a line spectral frequency (LSF) quantization using said codebook-based interpolation.

8. A voice compression apparatus as recited in claim 7, wherein said codebook is created by means of a training database operated on by a centroid-based training procedure.

9. A voice compression apparatus as recited in claim 1, wherein said superframe encoder includes a pitch smoother wherein calculations are based on an onset/offset classifier.

10. A voice compression apparatus as recited in claim 1, wherein said superframe encoder includes a pitch smoother wherein pitch trajectory is calculated using a plurality of voicing decisions.

11. A voice compression apparatus as recited in claim 10, wherein said pitch smoother classifies frames into onset and offset frames based on at least four waveform feature parameters selected from the group of waveform feature parameters consisting of energy zerocrossing rate, peakiness, maximum correlation coefficient of input speech, maximum correlation coefficient of 500 Hz low pass filtered speech, energy of low pass filtered speech, and energy of high pass filtered speech.

12. A voice compression apparatus as recited in claim 1, wherein said bandpass voicing smoother performs smoothing by modifying the cutoff frequency of a frame as a function of the cutoff frequencies of neighboring frames and the average frame energy.

13. A voice compression apparatus as recited in claim 1, further comprising means for compressing aperiodic flag bits for each frame in a superframe into a single bit per superframe, which bit is created based on the distribution of voiced and unvoiced frames within the superframe.

14. A voice compression apparatus as recited in claim 1, wherein said superframe encoder includes a plurality of quantizers for encoding parametric data into a set of bits, wherein at least one of said quantizers employs vector quantization to represent interpolation coefficients.

15. A voice compression apparatus as recited in claim 1, wherein a superframe is categorized into one of a plurality of coding states based on the combination of voiced and unvoiced frames within the superframe, and wherein each of said coding states is associated with a different bit allocation to be used with the superframe.

16. A voice compression apparatus, comprising:
(a) a superframe buffer for receiving multiple frames of voice data;
(b) a frame-based analysis module for determining a set of voice data parameters for said voice data; and
(c) a super-frame encoder for receiving a unquantized voice data parameters for groups of frames within a superframe, said superframe encoder comprising:
(i) a pitch smoother for determining pitch and U/V decisions for each frame of the superframe and for extracting parameters needed for frame classification into onset and offset frames,
(ii) a bandpass voicing smoother for determining bandpass voicing strengths for the frames within the superframe and for determining cutoff frequencies for each frame, and
(iii) a parameter quantizer and encoder for quantizing and encoding voicing parameters received from said analysis module, said pitch smoother, and said bandpass voicing smoother into a set of bits and encoding said bits into an outgoing digital bitstream for transmission.

17. A method of decoding a parametric voice encoded data stream into an audio voice signal comprising the steps of:
(a) buffering a received parametric voice data stream having a plurality of pitch periods;
(b) constructing an estimated spectrum of excitation within each pitch period by breaking down the frequency spectrum into regions based on a cutoff frequency, wherein said construction comprises the steps of:
(i) computing a Fourier magnitude for each region, wherein the resultant computed Fourier magnitude for at least one of said regions is then scaled by a gain factor computed for that region,
(ii) computing phase within each region, wherein the resultant phase for at least one of said regions has been modified by use of a weighted random phase, and
(iii) converting said Fourier magnitude and said phase within each region to a time domain representation by the computation of an inverse discrete Fourier transform; and

(c) generating an analog voice signal from said time domain representation; wherein said regions into which the frequency spectrum is broken down comprise:
a lower region wherein Fourier magnitudes directly determine the spectrum;
a transition region wherein Fourier magnitudes are scaled down by a linearly decreasing weighting factor that drops from unity to a nonzero positive value dependent on the cutoff frequency of the current frame: and
an upper region wherein Fourier magnitudes are scaled down by a weighting factor depending on the cutoff frequency of the current frame.

18. A vocoder method for encoding digitized voice into parametric voice data, comprising the steps of:
(a) loading multiple frames of digitized voice into a superframe buffer;
(b) encoding digitized voice within each frame of the superframe buffer by parametric analysis to produce frame-based parametric voice data;
(c) classifying frames as onset frames and offset frames by calculating pitch and U/V parameters within each frame of the superframe;
(d) determining a cutoff frequency for each frame within the superframe by calculating a bandpass voicing strength parameter for the frames within the superframe buffer;
(e) collecting a set of superframe parameters from the parametric analysis, frame classification, and cutoff frequency determination steps for the group of frames within the superframe;
(f) quantizing the superframe parameters into discrete values represented by a reduced set of data bits that form quantized superframe parameter data; and
(g) encoding quantized superframe parameter data into a data stream of superframe-based parametric voice data that contains substantially equivalent voice information to the frame-based parametric voice data, yet at a lower bit per second rate of encoded voice.

19. A method of encoding an audio voice signal comprising:
receiving a superframe comprised of a plurality of frames of voice data corresponding to the audio voice signal;
determining for each frame in the superframe a set of unquantized voice data parameters;
determining pitch and U/V decisions for each frame in the superframe, and extracting parameters for frame classification from each frame in the superframe;
determining bandpass voicing strengths and cutoff frequencies for the frames within the superframe; and
quantizing the voice data parameters, pitch, U/V decision, frame classification, bandpass voicing strengths and cutoff frequencies into a set of bits and encoding the set of bits.

20. A computer-readable medium having thereon computer-readable instructions for performing a method of encoding an audio voice signal comprising the steps of:
receiving a superframe comprised of a plurality of frames of voice data corresponding to the audio voice signal;
determining for each frame in the superframe a set of unquantized voice data parameters;
determining pitch and U/V decisions for each frame in the superframe, and extracting parameters for frame classification from each frame in the superframe;
determining bandpass voicing strengths and cutoff frequencies for the frames within the superframe; and
quantizing the voice data parameters, pitch, U/V decision, frame classification, bandpass voicing strengths and cutoff frequencies into a set of bits and encoding the set of bits.