# Patent

## Title
Method for improving the coding efficiency of an audio signal

## Abstract

Coding an audio signal includes selecting a reference sequence that has the smallest error relative to a sequence of the audio signal, calculating pitch predictor coefficients for the selected reference sequence using one of a set of pitch predictor orders, producing a predicted sequence from the selected reference sequence using the calculated pitch predictor coefficients, and calculating a coding error by comparing the predicted sequence to the sequence to be coded. Coding also includes calculating pitch predictor coefficients for the selected reference sequence, producing a predicted sequence from the selected reference sequence, and calculating a coding error by comparing the predicted sequence to the sequence to be coded, for each of the remaining orders of the set of pitch predictor orders, and using an order from the set of pitch predictor orders that results in the smallest coding error to select a coding method for the sequence to be coded.

## Background
This application is a divisional of U.S. application Ser. No. 09/610,461, filed 5 Jul. 2000, now U.S. Pat. No. 7,289,951, which is incorporated by reference herein in its entirety.


BACKGROUND
The disclosed embodiments are directed to methods for coding and decoding an audio signal, an encoder, and a decoder. The embodiments are also directed to a data transmission system and a data structure for transmitting a coded sequence.
BRIEF DESCRIPTION OF RELATED DEVELOPMENTS
In general, audio coding systems produce coded signals from an analog audio signal, such as a speech signal. Typically, the coded signals are transmitted to a receiver by means of data transmission methods specific to the data transmission system. In the receiver, an audio signal is produced on the basis of the coded signals. The amount of information to be transmitted is affected e.g. by the bandwidth used for the coded information in the system, as well as by the efficiency with which the coding can be executed.
For the purpose of coding, digital samples are produced from the analog signal e.g. at regular intervals of 0.125 ms. The samples are typically processed in groups of a fixed size, for example in groups having a duration of approximately 20 ms. These groups of samples are also referred to as “frames”. Generally, a frame is the basic unit in which audio data is processed.
The aim of audio coding systems is to produce a sound quality which is as good as possible within the scope of the available bandwidth. To this end, the periodicity present in an audio signal, especially in a speech signal, can be utilized. The periodicity in speech results e.g. from vibrations in the vocal cords. Typically, the period of vibration is in the order of 2 ms to 20 ms. In numerous speech coders according to prior art, a technique known as long-term prediction (LTP) is used, the purpose of which is to evaluate and utilize this periodicity to enhance the efficiency of the coding process. Thus, during encoding, the part (frame) of the signal to be coded is compared with previously coded parts of the signal. If a similar signal is located in the previously coded part, the time delay (lag) between the similar signal and the signal to be coded is examined. A predicted signal representing the signal to be coded is formed on the basis of the similar signal. In addition, an error signal is produced, which represents the difference between the predicted signal and the signal to be coded. Thus, coding is advantageously performed in such a way that only the lag information and the error signal are transmitted. In the receiver, the correct samples are retrieved from the memory, used to predict the part of the signal to be coded and combined with the error signal on the basis of the lag. Mathematically, such a pitch predictor can be thought of as performing a filtering operation which can be illustrated by a transfer function, such as that shown below:

P(z)=βz−α

The above equation illustrates the transfer function of a first order pitch predictor. β is the coefficient of the pitch predictor and α is the lag representing the periodicity. In the case of higher order pitch predictor filters it is possible to use a more general transfer function:




  
    P
    ⁡
    
      (
      z
      )
    
  
  =
  
    
      ∑
      
        k
        =
        
          -
          
            m
            1
          
        
      
      
        m
        2
      
    
    ⁢
    
      
    
    ⁢
    
      
        β
        k
      
      ⁢
      
        z
        
          -
          
            (
            
              α
              +
              k
            
            )
          
        
      
    
  




The aim is to select coefficients βk for each frame in such a way that the coding error, i.e. the difference between the actual signal and the signal formed using the preceding samples, is as small as possible. Advantageously, those coefficients are selected to be used in the coding with which the smallest error is achieved using the least squares method. Advantageously, the coefficients are updated frame-by-frame.
The patent U.S. Pat. No. 5,528,629 discloses a prior art speech coding system which employs short-term prediction (STP) as well as first order long-term prediction.
Prior art coders have the disadvantage that no attention is paid to the relationship between the frequency of the audio signal and its periodicity. Thus, the periodicity of the signal cannot be utilized effectively in all situations and the amount of coded information becomes unnecessarily large, or the sound quality of the audio signal reconstructed in the receiver deteriorates.
In some situations, for example, when an audio signal has a highly periodic nature and varies little over time, lag information alone provides a good basis for prediction of the signal. In this situation it is not necessary to use a high order pitch predictor. In certain other situations, the opposite is true. The lag is not necessarily an integer multiple of the sampling interval. For example, it may lie between two successive samples of the audio signal. In this situation, higher order pitch predictors can effectively interpolate between the discrete sampling times, to provide a more accurate representation of the signal. Furthermore, the frequency response of higher order pitch predictors tends to decrease as a function of frequency. This means that higher order pitch predictors provide better modeling of lower frequency components in the audio signal. In speech coding, this is advantageous, as lower frequency components have a more significant influence on the perceived quality of the speech signal than higher frequency components. Therefore, it should be appreciated that the ability to vary the order of pitch predictor used to predict an audio signal in accordance with the evolution of the signal is highly desirable. An encoder that employs a fixed order pitch predictor may be overly complex in some situations, while failing to model the audio signal sufficiently in others.
SUMMARY OF THE EXEMPLARY EMBODIMENTS
One purpose of the present invention is to implement a method for improving the coding accuracy and transmission efficiency of audio signals in a data transmission system, in which the audio data is coded to a greater accuracy and transferred with greater efficiency than in methods of prior art. In an encoder according to the invention, the aim is to predict the audio signal to be coded frame-by-frame as accurately as possible, while ensuring that the amount of information to be transmitted remains low. The method according to the present invention is characterized in what is presented in the characterizing part of the appended claim 1. The data transmission system according to the present invention is characterized in what is presented in the characterizing part of the appended claim 21. The encoder according to the present invention is characterized in what is presented in the characterizing part of the appended claim 27. The decoder according to the present invention is characterized in what is presented in the characterizing part of the appended claim 30. Furthermore, the decoding method according to the present invention is characterized in what is presented in the characterizing part of the appended claim 38.
The present invention achieves considerable advantages when compared to solutions according to prior art. The method according to the invention enables an audio signal to be coded more accurately when compared with prior art methods, while ensuring that the amount of information required to represent the coded signal remains low. The invention also allows coding of an audio signal to be performed in a more flexible manner than in methods according to prior art. The invention may be implemented in such a way as to give preference to the accuracy with which the audio signal is predicted (qualitative maximization), to give preference to the reduction of the amount of information required to represent the encoded audio signal (quantitative minimization), or to provide a trade-off between the two. Using the method according to the invention it is also possible to better take into account the periodicities of different frequencies that exist in the audio signal.



BRIEF DESCRIPTION OF THE DRAWINGS
In the following, the invention will be described in more detail with reference to the appended drawings in which
FIG. 1 shows an encoder according to a preferred embodiment of the invention,
FIG. 2 shows a decoder according to a preferred embodiment of the invention,
FIG. 3 is a reduced block diagram presenting a data transmission system according to a preferred embodiment of the invention,
FIG. 4 is a flow diagram showing a method according to a preferred embodiment of the invention, and
FIGS. 5a and 5b are examples of data transmission frames generated by the encoder according to a preferred embodiment of the invention.



DETAILED DESCRIPTION OF THE EXEMPLARY EMBODIMENTS
FIG. 1 is a reduced block diagram showing an encoder 1 according to a preferred embodiment of the invention. FIG. 4 is a flow diagram 400 illustrating the method according to the invention. The encoder 1 is, for example, a speech coder of a wireless communication device 2 (FIG. 3) for converting an audio signal into a coded signal to be transmitted in a data transmission system such as a mobile communication network or the Internet network. Thus, a decoder 33 is advantageously located in a base station of the mobile communication network. Correspondingly, an analog audio signal, e.g. a signal produced by a microphone 29 and amplified in an audio block 30 if necessary, is converted in an analog/digital converter 4 into a digital signal. The accuracy of the conversion is e.g. 8 or 12 bits, and the interval (time resolution) between successive samples is e.g. 0.125 ms. It is obvious that the numerical values presented in this description are only examples clarifying, not restricting the invention.
The samples obtained from the audio signal are stored in a sample buffer (not shown), which can be implemented in a way known as such e.g. in the memory means 5 of the wireless communication device 2. Advantageously, encoding of the audio signal is performed on a frame-by-frame basis such that a predetermined number of samples is transmitted to the encoder 1 to be coded, e.g. the samples produced within a period of 20 ms (=160 samples, assuming a time interval of 0.125 ms between successive samples). The samples of a frame to be coded are advantageously transmitted to a transform block 6, where the audio signal is transformed from the time domain to a transform domain (frequency domain), for example by means of a modified discrete cosine transform (MDCT). The output of the transform block 6 provides a group of values which represent the properties of the transformed signal in the frequency domain. This transformation is represented by block 404 in the flow diagram of FIG. 4.
An alternative implementation for transforming a time domain signal to the frequency domain is a filter bank composed of several band-pass filters. The pass band of each filter is relatively narrow, wherein the magnitudes of the signals at the outputs of the filters represent the frequency spectrum of the signal to be transformed.
A lag block 7 determines which preceding sequence of samples best corresponds to the frame to be coded at a given time (block 402). This stage of determining the lag is advantageously conducted in such a way that the lag block 7 compares the values stored in a reference buffer 8 with the samples of the frame to be coded and calculates the error between the samples of the frame to be coded and a corresponding sequence of samples stored in the reference buffer e.g. using a least squares method. Preferably, the sequence of samples composed of successive samples and having the smallest error is selected as a reference sequence of samples.
When the reference sequence of samples is selected from the stored samples by the lag block 7 (block 403), the lag block 7 transfers information concerning it to a coefficient calculation block 9, in order to conduct pitch predictor coefficient evaluation. Thus, in the coefficient calculation block 9, the pitch predictor coefficients b(k) for different pitch predictor orders, such as 1, 3, 5, and 7, are calculated on the basis of the samples in the reference sequence of samples. The calculated coefficients b(k) are then transferred to the pitch predictor block 10. In the flow diagram of FIG. 4, these stages are shown in blocks 405-411. It is obvious that the orders presented here function only as examples clarifying, not restricting the invention. The invention can also be applied with other orders, and the number of orders available can also differ from the total of four orders presented herein.
After the pitch predictor coefficients have been calculated, they are quantized, wherein quantized pitch predictor coefficients are obtained. The pitch predictor coefficients are preferably quantized in such a way that the reconstructed signal produced in the decoder 33 of the receiver corresponds to the original as closely as possible in error-free data transmission conditions. In quantizing the pitch predictor coefficients, it is advantageous to use the highest possible resolution (smallest possible quantization steps) in order to minimize errors caused by rounding.
The stored samples in the reference sequence of samples are transferred to the pitch predictor block 10 where a predicted signal is produced for each pitch predictor order from the samples of the reference sequence, using the calculated and quantized pitch predictor coefficients b(k). Each predicted signal represents the prediction of the signal to be coded, evaluated using the pitch predictor order in question. In the present preferred embodiment of the invention, the predicted signals are further transferred to a second transform block 11, where they are transformed into the frequency domain. The second transform block 11 performs the transformation using two or more different orders, wherein sets of transformed values corresponding to the signals predicted by different pitch predictor orders are produced. The pitch predictor block 10 and the second transform block 11 can be implemented in such a way that they perform the necessary operations for each pitch predictor order, or alternatively a separate pitch predictor block 10 and a separate second transform block 11 can be implemented for each order.
In calculation block 12, the frequency domain transformed values of the predicted signal are compared with the frequency domain transformed representation of the audio signal to be coded, obtained from transform block 6. A prediction error signal is calculated by taking the difference between the frequency spectrum of the audio signal to be coded and the frequency spectrum of the signal predicted using the pitch predictor. Advantageously, the prediction error signal comprises a set of prediction error values corresponding to the difference between the frequency components of the signal to be coded and the frequency components of the predicted signal. A coding error, representing e.g. the average difference between the frequency spectrum of the audio signal and the predicted signal is also calculated. Preferably, the coding error is calculated using a least squares method. Any other appropriate method, including methods based on psychoacoustic modeling of the audio signal, may be used to determine the predicted signal that best represents the audio signal to be coded.
A coding efficiency measure (prediction gain) is also calculated in block 12 to determine the information to be transmitted to the transmission channel (block 413). The aim is to minimize the amount of information (bits) to be transmitted (quantitative minimization) as well as the distortions in the signal (qualitative maximization).
In order to reconstruct the signal in the receiver on the basis of preceding samples stored in the receiving device, it is necessary to transmit e.g. the quantized pitch predictor coefficients for the selected order, information concerning the order, the lag, and information about the prediction error to the receiver. Advantageously, the coding efficiency measure indicates whether it is possible to transmit the information necessary to decode the signal encoded in the pitch predictor block 10 with a smaller number of bits than necessary to transmit information relating to the original signal. This determination can be implemented, for example, in such a way that a first reference value is defined, representing the amount of information to be transmitted if the information necessary for decoding is produced using a particular pitch predictor. Additionally, a second reference value is defined, representing the amount of information to be transmitted if the information necessary for decoding is formed on the basis of the original audio signal. The coding efficiency measure is advantageously the ratio of the second reference value to the first reference value. The number of bits required to represent the predicted signal depends on, for example, the order of the pitch predictor (i.e. the number of coefficients to be transmitted), the precision with which each coefficient is represented (quantized), as well as the amount and precision of the error information associated with the predicted signal. On the other hand, the number of bits required to transmit information relating to the original audio signal depends on, for example, the precision of the frequency domain representation of the audio signal.
If the coding efficiency determined in this way is greater than one, it indicates that the information necessary to decode the predicted signal can be transmitted with a smaller number of bits than the information relating to the original signal. In the calculation block 12 the number of bits necessary for the transmission of these different alternatives is determined and the alternative for which the number of bits to be transmitted is smaller is selected (block 414).
According to a first embodiment of the invention, the pitch predictor order with which the smallest coding error is attained is selected to code the audio signal (block 412). If the coding efficiency measure for the selected pitch predictor is greater than 1, the information relating to the predicted signal is selected for transmission. If the coding efficiency measure is not greater than 1, the information to be transmitted is formed on the basis of the original audio signal. According to this embodiment of the invention, emphasis is placed on minimising the prediction error (qualitative maximization).
According to a second advantageous embodiment of the invention, a coding efficiency measure is calculated for each pitch predictor order. The pitch predictor order that provides the smallest coding error, selected from those orders for which the coding efficiency measure is greater than 1, is then used to code the audio signal. If none of the pitch predictor orders provides a prediction gain (i.e. no coding efficiency measure is greater than 1) then advantageously, the information to be transmitted is formed on the basis of the original audio signal. This embodiment of the invention enables a trade-off between prediction error and coding efficiency.
According to a third embodiment of the invention, a coding efficiency measure is calculated for each pitch predictor order and the pitch predictor order that provides the highest coding efficiency, selected from those orders for which the coding efficiency measure is greater than 1, is selected to code the audio signal. If none of the pitch predictor orders provides a prediction gain (i.e. no coding efficiency measure is greater than 1) then advantageously, the information to be transmitted is formed on the basis of the original audio signal. Thus, this embodiment of the invention places emphasis on the maximisation of coding efficiency (quantitative minimization).
According to a fourth embodiment of the invention, a coding efficiency measure is calculated for each pitch predictor order and the pitch order that provides the highest coding efficiency is selected to code the audio signal, even if the coding efficiency is not greater than 1.
Calculation of the coding error and selection of the pitch predictor order is conducted at intervals, preferably separately for each frame, wherein in different frames it is possible to use the pitch predictor order which best corresponds to the properties of the audio signal at a given time.
As explained above, if the coding efficiency determined in block 12 is not greater than one, this indicates that it is advantageous to transmit the frequency spectrum of the original signal, wherein a bit string 501 to be transmitted to the data transmission channel is formed advantageously in the following way (block 415). Information from the calculation block 12 relating to the selected transmission alternative is transferred to selection block 13 (lines D1 and D4 in FIG. 1). In selection block 13 the frequency domain transformed values representing the original audio signal are selected to be transmitted to a quantization block 14. Transmission of the frequency domain transformed values of the original audio signal to quantization block 14 is illustrated by line Al in the block diagram of FIG. 1. In the quantization block 14, the frequency domain transformed signal values are quantized in a way known as such. The quantized values are transferred to a multiplexing block 15, in which the bit string to be transmitted is formed. FIGS. 5a and 5b show an example of a bit string structure which can be advantageously applied in connection with the present invention. Information concerning the selected coding method is transferred from the calculation block 12 to multiplexing block 15 (lines D1 and D3), where the bit string is formed according to the transmission alternative. A first logical value, e.g. the logical 0 state, is used as coding method information 502 to indicate that frequency domain transformed values representing the original audio signal are transmitted in the bit string in question. In addition to the coding method information 502, the values themselves are transmitted in the bit string, quantized to a given accuracy. The field used for transmission of these values is marked with the reference numeral 503 in FIG. 5a. The number of values transmitted in each bit string depends on the sampling frequency and on the length of the frame examined at a time. In this situation, pitch predictor order information, pitch predictor coefficients, lag and error information are not transmitted because the signal is reconstructed in the receiver on the basis of the frequency domain values of the original audio signal transmitted in the bit string 501.
If the coding efficiency is greater than one, it is advantageous to encode the audio signal using the selected pitch predictor and the bit string 501 (FIG. 5b) to be transmitted to the data transmission channel is formed advantageously in the following way (block 416). Information relating to the selected transmission alternative is transmitted from the calculation block 12 to the selection block 13. This is illustrated by lines D1 and D4 in the block diagram of FIG. 1. In the selection block 13 the quantized pitch predictor coefficients are selected to be transferred to the multiplexing block 15. This is illustrated by line B1 in the block diagram of FIG. 1. It is obvious that the pitch predictor coefficients can also be transferred to the multiplexing block 15 in another way than via the selection block 13. The bit string to be transmitted is formed in the multiplexing block 15. Information concerning the selected coding method is transferred from the calculation block 12 to multiplexing block 15 (lines D1 and D3), where the bit string is formed according to the transmission alternative. A second logical value, e.g. the logical 1 state, is used as coding method information 502, to indicate that said quantized pitch predictor coefficients are transmitted in the bit string in question. The bits of an order field 504 are set according to the selected pitch predictor order. If there are, for example, four different orders available, two bits (00, 01, 10, 11) are sufficient to indicate which order is selected at a given time. In addition, information on the lag is transmitted in the bit string in a lag field 505. In this preferred example, the lag is indicated with 11 bits, but it is obvious that other lengths can also be applied within the scope of the invention. The quantized pitch predictor coefficients are added to the bit string in the coefficient field 506. If the selected pitch predictor order is one, only one coefficient is transmitted, if the order is three, three coefficients are transmitted, etc. The number of bits used in the transmission of the coefficients can also vary in different embodiments. In an advantageous embodiment the first order coefficient is represented with three bits, the third order coefficients with a total of five bits, the fifth order coefficients with a total of nine bits and the seventh order coefficients with ten bits. Generally, it can be stated that the higher the selected order, the larger the number of bits required for transmission of the quantized pitch predictor coefficients.
In addition to the aforementioned information, when the audio signal is encoded on the basis of the selected pitch predictor, it is necessary to transmit prediction error information in an error field 507. This prediction error information is advantageously produced in the calculation block 12 as a difference signal, representing the difference between the frequency spectrum of the audio signal to be coded and the frequency spectrum of the signal that can be decoded (i.e. reconstructed) using the quantized pitch predictor coefficients of the selected pitch predictor in conjunction with the reference sequence of samples. Thus, the error signal is transferred e.g. via the first selection block 13 to the quantization block 14 to be quantized. The quantized error signal is transferred from the quantization block 14 to the multiplexing block 15, where the quantized prediction error values are added to the error field 507 of the bit string.
The encoder 1 according to the invention also includes local decoding functionality. The coded audio signal is transferred from the quantization block 14 to inverse quantization block 17. As described, above, in the situation where the coding efficiency is not greater than 1, the audio signal is represented by its quantized frequency spectrum values. In this case, the quantized frequency spectrum values are transferred to the inverse quantization block 17, where they are inverse quantized in a way known as such, so as to restore the original frequency spectrum of the audio signal as accurately as possible. The inverse quantized values representing the frequency spectrum of the original audio signal are provided as an output from block 17 to summing block 18.
If the coding efficiency is greater than 1, the audio signal is represented by pitch predictor information, e.g. pitch predictor order information, quantized pitch predictor coefficients, a lag value and prediction error information in the form of quantized frequency domain values. As described above, the prediction error information represents the difference between the frequency spectrum of the audio signal to be coded and the frequency spectrum of the audio signal that can be reconstructed on the basis of the selected pitch predictor and the reference sequence of samples. Therefore, in this case, the quantized frequency domain values that comprise the prediction error information are transferred to the inverse quantization block 17, where they are inverse quantized in such a way as to restore the frequency domain values of the prediction error as accurately as possible. Thus, the output of block 17 comprises inverse quantized prediction error values. These values are further provided as an input to summing block 18, where they are summed with the frequency domain values of the signal predicted using the selected pitch predictor. In this way, a reconstructed frequency domain representation of the original audio signal is formed. The frequency domain values of the predicted signal are available from calculation block 12, where they are calculated in connection with determination of the prediction error, and are transferred to summing block 18 as indicated by line C1 in FIG. 1.
The operation of summing block 18 is gated (switched on and off) according to control information provided by calculation block 12. The transfer of control information enabling this gating operation is indicated by the link between calculation block 12 and summing block 18 (lines D1 and D2 in FIG. 1). The gating operation is necessary in order to take into account the different types of inverse quantized frequency domain values provided by inverse quantization block 17. As described above, if the coding efficiency is not greater than 1, the output of block 17 comprises inverse quantized frequency domain values representing the original audio signal. In this case no summing operation is necessary and no information regarding the frequency domain values of any predicted audio signal, constructed in calculation block 12, is required. In this situation, the operation of summing block 18 is inhibited by the control information supplied from calculation block 12 and the inverse quantized frequency domain values representing the original audio signal pass through summing block 18. On the other hand, if the coding efficiency is greater than 1, the output of block 17 comprises inverse quantized prediction error values. In this case, it is necessary to sum the inverse quantised prediction error values with the frequency spectrum of the predicted signal in order to form a reconstructed frequency domain representation of the original audio signal. Now, the operation of summing block 18 is enabled by the control information transferred from calculation block 12, causing the inverse quantised prediction error values to be summed with the frequency spectrum of the predicted signal. Advantageously, the necessary control information is provided by the coding method information produced in block 12 in connection with the choice of coding to be applied to the audio signal.
In an alternative embodiment quantization can be performed before the calculation of prediction error and coding efficiency values, wherein prediction error and coding efficiency calculations are performed using quantized frequency domain values representing the original signal and the predicted signals. Advantageously the quantization is performed in quantization blocks positioned in between blocks 6 and 12 and blocks 11 and 12 (not shown). In this embodiment quantization block 14 is not required, but an additional inverse quantization block is required in the path indicated by line C1.
The output of summing block 18 is sampled frequency domain data that corresponds to the coded sequence of samples (audio signal). This sampled frequency domain data is further transformed to the time domain in an inverse modified DCT transformer 19 from which the decoded sequence of samples is transferred to the reference buffer 8 to be stored and used in connection with the coding of subsequent frames. The storage capacity of the reference buffer 8 is selected according to the number of samples necessary to attain the coding efficiency demands of the application in question. In the reference buffer 8, a new sequence of samples is preferably stored by over-writing the oldest samples in the buffer, i.e. the buffer is a so-called circular buffer.
The bit string formed in the encoder 1 is transferred to a transmitter 16, in which modulation is performed in a way known as such. The modulated signal is transferred via the data transmission channel 3 to the receiver e.g. as radio frequency signals. Advantageously, the coded audio signal is transmitted frame by frame, substantially immediately after encoding for a given frame is complete. Alternatively, the audio signal may be encoded, stored in the memory of the transmitting terminal and transmitted at some later time.
In a receiving device 31, the signal received from the data transmission channel is demodulated in a way known as such in a receiver block 20. The information contained in the demodulated data frame is determined in the decoder 33. In a demultiplexing block 21 of the decoder 33 it is first examined, on the basis of the coding method information 502 of the bit string, whether the received information was formed on the basis of the original audio signal. If the decoder determines that the bit string 501 formed in the encoder 1 does not contain the frequency domain transformed values of the original signal, decoding is advantageously conducted in the following way. The order M to be used in the pitch predictor block 24 is determined from the order field 504 and the lag is determined from the lag field 505. The quantized pitch predictor coefficients received in the coefficient field 506 of the bit string 501, as well as information concerning the order and the lag are transferred to the pitch predictor block 24 of the decoder. This is illustrated by line B2 in FIG. 2. The quantized values of the prediction error signal, received in field 507 of the bit string are inverse quantized in an inverse quantization block 22 and transferred to a summing block 23 of the decoder. On the basis of the lag information, the pitch predictor block 24 of the decoder retrieves the samples to be used as a reference sequence from a sample buffer 28, and performs a prediction according to the selected order M, in which the pitch predictor block 24 utilizes the received pitch predictor coefficients. Thereby, a first reconstructed time domain signal is produced, which is transformed into the frequency domain in a transform block 25. This frequency domain signal is transferred to the summing block 23, wherein a frequency domain signal is produced as a sum of this signal and the inverse quantized prediction error signal. Thus, in error-free data transmission conditions, the reconstructed frequency domain signal substantially corresponds to the original coded signal in the frequency domain. This frequency domain signal is transformed to the time domain by means of an inverse modified DCT transform in a inverse transform block 26, wherein a digital audio signal is present at the output of the inverse transform block 26. This signal is converted to an analog signal in a digital/analog converter 27, amplified if necessary and transmitted to other further processing stages in a way known as such. In FIG. 3, this is illustrated by audio block 32.
If the bit string 501 formed in the encoder 1 comprises the values of the original signal transformed into the frequency domain, decoding is advantageously conducted in the following way. The quantized frequency domain transformed values are inverse quantized in the inverse quantization block 22 and transferred via the summing block 23 to the inverse transform block 26. In the inverse transform block 26 the frequency domain signal is transformed to the time domain by means of an inverse modified DCT transform, wherein a time domain signal corresponding to the original audio signal is produced in digital format. If necessary, this signal is transformed into an analog signal in the digital/analog converter 27.
In FIG. 2, reference A2 illustrates the transmission of control information to the summing block 23. This control information is used in a manner analogous to that described in connection with the local decoder functionality of the encoder. In other words, if the coding method information provided in field 502 of a received bit string 501 indicates that the bit string contains quantized frequency domain values derived from the audio signal itself, the operation of summing block 23 is inhibited. This allows the quantized frequency domain values of the audio signal to pass through summing block 23 to inverse transform block 26. On the other hand, if the coding method information retrieved from field 502 of a received bit string indicates that the audio signal was encoded using a pitch predictor, the operation of summing block 23 is enabled, allowing inverse quantised prediction error data to be summed with the frequency domain representation of the predicted signal produced by transform block 25.
In the example of FIG. 3, the transmitting device is a wireless communication device 2 and the receiving device is a base station 31, wherein the signal transmitted from the wireless communication device 2 is decoded in the decoder 33 of the base station 31, from which the analog audio signal is transmitted to further processing stages in a way known as such.
It is obvious that in the present example, only the features most essential for applying the invention are presented, but in practical applications the data transmission system also comprises functions other than those presented herein. It is also possible to utilize other coding methods in connection with the coding according to the invention, such as short-term prediction. Furthermore, when transmitting the signal coded according to the invention, other processing steps can be performed, such as channel coding.
It is also possible to determine the correspondence between the predicted signal and the actual signal in the time domain. Thus, in an alternative embodiment of the invention, it is not necessary to transform the signals to the frequency domain, wherein the transform blocks 6, 11 are not necessarily required, and neither are the inverse transform block 19 of the coder as well as the transform block 25 and the inverse transform block 26 of the decoder. The coding efficiency and the prediction error are thus determined on the basis of time domain signals.
The previously described audio signal coding/decoding stages can be applied in different kinds of data transmission systems, such as mobile communication systems, satellite-TV systems, video on demand systems, etc. For example, a mobile communication system in which audio signals are transmitted in full duplex requires an encoder/decoder pair both in the wireless communication device 2 and in the base station 31 or the like. In the block diagram of FIG. 3, corresponding functional blocks of the wireless communication device 2 and the base station 31 are primarily marked with the same reference numerals. Although the encoder 1 and the decoder 33 are shown as separate units in FIG. 3, in practical applications they can be implemented in one unit, a so-called codec, in which all the functions necessary to perform encoding and decoding are implemented. If the audio signal is transmitted in digital format in the mobile communication system, analog/digital conversion and digital/analog conversion, respectively, are not necessary in the base station. Thus, these transformations are conducted in the wireless communication device and in the interface via which the mobile communication network is connected to another telecommunication network, such as a public telephone network. If this telephone network, however, is a digital telephone network, these transformations can also be made e.g. in a digital telephone (not shown) connected to such a telephone network.
The previously described encoding stages are not necessarily conducted in connection with transmission, but the coded information can be stored for later transmission. Furthermore, the audio signal applied to the encoder does not necessarily have to be a real-time audio signal, but the audio signal to be coded can be information stored earlier from the audio signal.
In the following, the different coding stages according to an advantageous embodiment of the invention are described mathematically. The transfer function of the pitch predictor block has the form:




  
    
      
        
          B
          ⁡
          
            (
            z
            )
          
        
        =
        
          
            ∑
            
              k
              =
              
                -
                
                  m
                  1
                
              
            
            
              m
              2
            
          
          ⁢
          
            
          
          ⁢
          
            
              b
              ⁡
              
                (
                k
                )
              
            
            ⁢
            
              z
              
                -
                
                  (
                  
                    α
                    +
                    k
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




where α is the lag, b(k) are the coefficients of the pitch predictor, and m1 and m2 are dependent on the order (M), advantageously in the following way:

m1=(M−1)/2

m2=M−m1−1

Advantageously, the best corresponding sequence of samples (i.e. the reference sequence) is determined using the least squares method. This can be expressed as:




  
    
      
        E
        =
        
          
            ∑
            
              i
              =
              0
            
            
              N
              -
              1
            
          
          ⁢
          
            
          
          ⁢
          
            
              (
              
                
                  x
                  ⁡
                  
                    (
                    i
                    )
                  
                
                -
                
                  
                    ∑
                    
                      j
                      =
                      
                        -
                        
                          m
                          1
                        
                      
                    
                    
                      m
                      2
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      b
                      ⁡
                      
                        (
                        j
                        )
                      
                    
                    ⁢
                    
                      
                        x
                        ~
                      
                      ⁡
                      
                        (
                        
                          i
                          +
                          j
                          -
                          α
                        
                        )
                      
                    
                  
                
              
              )
            
            2
          
        
      
    
    
      
        (
        2
        )
      
    
  




where E=error, x() is the input signal in the time domain, {tilde over (x)}() is the signal reconstructed from the preceding sequence of samples and N is the number of samples in the frame examined. The lag α can be calculated by setting the variable m1=0 and m2=0 and solving b from equation 2. Another alternative for solving the lag α is to use the normalized correlation method, by utilizing the formula:





  
    
      
        α
        =
        
          
            max
            lag
          
          ⁢
          
            {
            
              
                
                  
                    ∑
                    
                      i
                      =
                      0
                    
                    
                      N
                      -
                      1
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      
                        x
                        ⁡
                        
                          (
                          i
                          )
                        
                      
                      ⁢
                      
                        
                          x
                          ~
                        
                        ⁡
                        
                          (
                          
                            i
                            -
                            lag
                          
                          )
                        
                      
                    
                    )
                  
                
                
                  
                    
                      ∑
                      
                        i
                        =
                        0
                      
                      
                        N
                        -
                        1
                      
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        
                          x
                          ~
                        
                        ⁡
                        
                          (
                          
                            i
                            -
                            lag
                          
                          )
                        
                      
                      2
                    
                  
                
              
              ,
              
                lag
                =
                startlag
              
              ,
              ...
              ⁢
              
                
              
              ,
              endlag
            
            }
          
        
      
    
    
      
        (
        3
        )
      
    
  




When the best corresponding (reference) sequence of samples has been found, the lag block 7 has information about the lag, i.e. how much earlier the corresponding sequence of samples appeared in the audio signal.
The pitch predictor coefficients b(k) can be calculated for each order M from equation (2), which can be re-expressed in the form:




  
    
      
        E
        =
        
          
            
              ∑
              
                i
                =
                0
              
              
                N
                -
                1
              
            
            ⁢
            
              
            
            ⁢
            
              
                x
                ⁡
                
                  (
                  i
                  )
                
              
              2
            
          
          -
          
            2
            ·
            
              
                ∑
                
                  i
                  =
                  0
                
                
                  N
                  -
                  1
                
              
              ⁢
              
                
              
              ⁢
              
                
                  x
                  ⁡
                  
                    (
                    i
                    )
                  
                
                ⁢
                
                  
                    ∑
                    
                      j
                      =
                      
                        -
                        
                          m
                          1
                        
                      
                    
                    
                      m
                      2
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      b
                      ⁡
                      
                        (
                        j
                        )
                      
                    
                    ⁢
                    
                      
                        x
                        ~
                      
                      ⁡
                      
                        (
                        
                          i
                          +
                          j
                          -
                          α
                        
                        )
                      
                    
                  
                
              
            
          
          +
          
            
              ∑
              
                i
                =
                0
              
              
                N
                -
                1
              
            
            ⁢
            
              
            
            ⁢
            
              
                (
                
                  
                    ∑
                    
                      j
                      =
                      
                        -
                        
                          m
                          1
                        
                      
                    
                    
                      m
                      2
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      b
                      ⁡
                      
                        (
                        j
                        )
                      
                    
                    ⁢
                    
                      
                        x
                        ~
                      
                      ⁡
                      
                        (
                        
                          i
                          +
                          j
                          -
                          α
                        
                        )
                      
                    
                  
                
                )
              
              2
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




The optimum value for the coefficients b(k) can be determined by searching for a coefficient b(k) for which the change in the error with respect to b(k) is as small as possible. This can be calculated by setting the partial derivative of the error relationship with respect to b to zero (∂E/∂b=0) wherein the following formula is attained:




  
    
      
        
          
            
              
                -
                2
              
              ·
              
                
                  ∑
                  
                    i
                    =
                    0
                  
                  
                    N
                    -
                    1
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    x
                    ⁡
                    
                      (
                      i
                      )
                    
                  
                  ⁢
                  
                    
                      ∑
                      
                        j
                        =
                        
                          -
                          
                            m
                            1
                          
                        
                      
                      
                        m
                        2
                      
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        x
                        ~
                      
                      ⁡
                      
                        (
                        
                          i
                          +
                          j
                          -
                          α
                        
                        )
                      
                    
                  
                
              
            
            +
            
              2
              ·
              
                
                  ∑
                  
                    i
                    =
                    0
                  
                  
                    N
                    -
                    1
                  
                
                ⁢
                
                  
                
                ⁢
                
                  [
                  
                    
                      (
                      
                        
                          ∑
                          
                            j
                            =
                            
                              -
                              
                                m
                                1
                              
                            
                          
                          
                            m
                            2
                          
                        
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            b
                            ⁡
                            
                              (
                              j
                              )
                            
                          
                          ⁢
                          
                            
                              x
                              ~
                            
                            ⁡
                            
                              (
                              
                                i
                                +
                                j
                                -
                                α
                              
                              )
                            
                          
                        
                      
                      )
                    
                    ·
                    
                      
                        ∑
                        
                          j
                          =
                          
                            -
                            
                              m
                              1
                            
                          
                        
                        
                          m
                          2
                        
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        
                          x
                          ~
                        
                        ⁡
                        
                          (
                          
                            i
                            +
                            j
                            -
                            α
                          
                          )
                        
                      
                    
                  
                  ]
                
              
            
          
          =
          0
        
        ⁢
        
          

        
        ⁢
        
          i.e.:
        
        ⁢
        
          

        
        ⁢
        
          
            
              ∑
              
                i
                =
                0
              
              
                N
                -
                1
              
            
            ⁢
            
              
            
            ⁢
            
              [
              
                
                  ∑
                  
                    j
                    =
                    
                      -
                      
                        m
                        1
                      
                    
                  
                  
                    m
                    2
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    b
                    ⁡
                    
                      (
                      j
                      )
                    
                  
                  ⁢
                  
                    
                      
                        x
                        ~
                      
                      ⁡
                      
                        (
                        
                          i
                          +
                          j
                          -
                          α
                        
                        )
                      
                    
                    ·
                    
                      
                        ∑
                        
                          j
                          =
                          
                            -
                            
                              m
                              1
                            
                          
                        
                        
                          m
                          2
                        
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        
                          x
                          ~
                        
                        ⁡
                        
                          (
                          
                            i
                            +
                            j
                            -
                            α
                          
                          )
                        
                      
                    
                  
                
              
              ]
            
          
          =
          
            
              ∑
              
                i
                =
                0
              
              
                N
                -
                1
              
            
            ⁢
            
              
            
            ⁢
            
              
                x
                ⁡
                
                  (
                  i
                  )
                
              
              ⁢
              
                
                  ∑
                  
                    j
                    =
                    
                      -
                      
                        m
                        1
                      
                    
                  
                  
                    m
                    2
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    x
                    ~
                  
                  ⁡
                  
                    (
                    
                      i
                      +
                      j
                      -
                      α
                    
                    )
                  
                
              
            
          
        
      
    
    
      
        (
        5
        )
      
    
  




This equation can be written in matrix format, wherein the coefficients b(k) can be determined by solving the matrix equation:

 b=Ā−1· r

where





  
    
      
        
          
            b
            _
          
          =
          
            [
            
              
                
                  
                    b
                    
                      -
                      
                        m
                        1
                      
                    
                  
                
              
              
                
                  
                    b
                    
                      
                        -
                        
                          m
                          1
                        
                      
                      +
                      1
                    
                  
                
              
              
                
                  ⋮
                
              
              
                
                  
                    b
                    
                      m
                      2
                    
                  
                
              
            
            ]
          
        
        ,
        
          
            r
            _
          
          =
          
            [
            
              
                
                  
                    
                      ∑
                      
                        i
                        =
                        0
                      
                      
                        N
                        -
                        1
                      
                    
                    ⁢
                    
                      
                        x
                        ⁡
                        
                          (
                          i
                          )
                        
                      
                      ⁢
                      
                        
                          x
                          ~
                        
                        ⁡
                        
                          (
                          
                            i
                            -
                            
                              m
                              1
                            
                            -
                            α
                          
                          )
                        
                      
                    
                  
                
              
              
                
                  ⋮
                
              
              
                
                  
                    
                      ∑
                      
                        i
                        =
                        0
                      
                      
                        N
                        -
                        1
                      
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        x
                        ⁡
                        
                          (
                          i
                          )
                        
                      
                      ⁢
                      
                        
                          x
                          ~
                        
                        ⁡
                        
                          (
                          
                            i
                            +
                            
                              m
                              2
                            
                            -
                            α
                          
                          )
                        
                      
                    
                  
                
              
            
            ]
          
        
        ,
      
    
  
  
    
      
        
          A
          _
        
        =
        
          [
          
            
              
                
                  
                    ∑
                    
                      i
                      =
                      0
                    
                    
                      N
                      -
                      1
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      
                        x
                        ~
                      
                      ⁡
                      
                        (
                        
                          i
                          -
                          
                            m
                            1
                          
                          -
                          α
                        
                        )
                      
                    
                    ⁢
                    
                      
                        x
                        ~
                      
                      ⁡
                      
                        (
                        
                          i
                          -
                          
                            m
                            1
                          
                          -
                          α
                        
                        )
                      
                    
                  
                
              
              
                ⋯
              
              
                
                  
                    ∑
                    
                      i
                      =
                      0
                    
                    
                      N
                      -
                      1
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      
                        x
                        ~
                      
                      ⁡
                      
                        (
                        
                          i
                          -
                          
                            m
                            1
                          
                          -
                          α
                        
                        )
                      
                    
                    ⁢
                    
                      
                        x
                        ~
                      
                      ⁡
                      
                        (
                        
                          i
                          +
                          
                            m
                            2
                          
                          -
                          α
                        
                        )
                      
                    
                  
                
              
            
            
              
                ⋮
              
              
                ⋰
              
              
                ⋮
              
            
            
              
                
                  
                    ∑
                    
                      i
                      =
                      0
                    
                    
                      N
                      -
                      1
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      
                        x
                        ~
                      
                      ⁡
                      
                        (
                        
                          i
                          +
                          
                            m
                            2
                          
                          -
                          α
                        
                        )
                      
                    
                    ⁢
                    
                      
                        x
                        ~
                      
                      ⁡
                      
                        (
                        
                          i
                          -
                          
                            m
                            1
                          
                          -
                          α
                        
                        )
                      
                    
                  
                
              
              
                ⋯
              
              
                
                  
                    ∑
                    
                      i
                      =
                      0
                    
                    
                      N
                      -
                      1
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      
                        x
                        ~
                      
                      ⁡
                      
                        (
                        
                          i
                          +
                          
                            m
                            2
                          
                          -
                          α
                        
                        )
                      
                    
                    ⁢
                    
                      
                        x
                        ~
                      
                      ⁡
                      
                        (
                        
                          i
                          +
                          
                            m
                            2
                          
                          -
                          α
                        
                        )
                      
                    
                  
                
              
            
          
          ]
        
      
    
  




In the method according to the invention, the aim is to utilize the periodicity of the audio signal more effectively than in systems according to prior art. This is achieved by increasing the adaptability of the encoder to changes in the frequency of the audio signal by calculating pitch predictor coefficients for several orders. The pitch predictor order used to code the audio signal can be chosen in such a way as to minimise the prediction error, to maximise the coding efficiency or to provide a trade-off between prediction error and coding efficiency. The selection is performed at certain intervals, preferably independently for each frame. The order and the pitch predictor coefficients can thus vary on a frame-by-frame basis. In the method according to the invention, it is thus possible to increase the flexibility of the coding when compared to coding methods of prior art using a fixed order. Furthermore, in the method according to the invention, if the amount of information (number of bits) to be transmitted for a given frame cannot be reduced by means of coding, the original signal, transformed into the frequency domain, can be transmitted instead of the pitch predictor coefficients and the error signal.
The previously presented calculation procedures used in the method according to the invention, can be advantageously implemented in the form of a program, as program codes of the controller 34 in a digital signal processing unit or the like, and/or as a hardware implementation. On the basis of the above description of the invention, a person skilled in the art is able to implement the encoder 1 according to the invention, and thus it is not necessary to discuss the different functional blocks of the encoder 1 in more detail in this context.
To transmit said pitch predictor coefficients to the receiver, it is possible to use so-called look-up tables. In such a look-up table different coefficient values are stored, wherein instead of the coefficient, the index of this coefficient in the look-up table is transmitted. The look-up table is known to both the encoder 1 and the decoder 33. At the reception stage it is possible to determine the pitch predictor coefficient in question on the basis of the transmitted index by using the look-up table. In some cases the use of the look-up table can reduce the number of bits to be transmitted when compared to the transmission of pitch predictor coefficients.
The present invention is not restricted to the embodiments presented above, neither is it restricted in other respects, but it can be modified within the scope of the appended claims.

## Claims

1. A method of coding an audio signal comprising:
selecting a reference sequence from a number of stored sequences that has the smallest error relative to a sequence of the audio signal to be coded;
calculating pitch predictor coefficients for the selected reference sequence using one of a set of pitch predictor orders;
producing a predicted sequence from the selected reference sequence using the calculated pitch predictor coefficients;
calculating a coding error by comparing the predicted sequence to the sequence to be coded;
calculating pitch predictor coefficients for the selected reference sequence, producing a predicted sequence from the selected reference sequence, and calculating a coding error by comparing the predicted sequence to the sequence to be coded, for each of the remaining orders of the set of pitch predictor orders; and
using an order from the set of pitch predictor orders that results in the smallest coding error to select a coding method for the sequence to be coded.

2. The method of claim 1, wherein the selected coding method includes coding the sequence to be coded on the basis of the predicted sequence.

3. The method of claim 1, wherein the selected coding method includes coding the sequence to be coded on the basis of the audio signal itself.

4. The method of claim 1, further comprising:
defining a coding efficiency for the predicted sequence having the smallest coding error; and
performing the selected coding method on the basis of the predicted signal having the smallest coding error if the determined coding efficiency indicates that the amount of coded information is less than if the coding is performed on the audio signal itself.

5. The method of claim 4, further comprising:
transforming the sequence to be coded into the frequency domain to determine a frequency spectrum of the sequence of the audio signal;
transforming each predicted signal into the frequency domain to determine a frequency spectrum of each predicted signal; and
determining the coding efficiency for the predicted signal having the smallest coding error on the basis of the frequency spectrum of the audio signal and the frequency spectrum of the predicted signal.

6. The method of claim 5, further comprising determining the prediction error information for each of the predicted signals as a difference spectrum representing using the frequency spectrum of the audio signal and the frequency spectrum of the predicted signal.

7. The method of claim 5, wherein the transformation to the frequency domain is conducted using a modified DCT transform.

8. The method of claim 1, further comprising:
determining a coding efficiency for each of the predicted signals; and
determining a coding error for those predicted signals for which the determined coding efficiency information indicates that the amount of coded information is less than if the coding is performed on the basis of the audio signal to be coded and the coding is performed on the basis of the predicted signal that provides the smallest coding error.

9. The method of claim 1, further comprising:
determining a coding efficiency for each of the predicted signals; and
performing the coding on the basis of the predicted signal that provides the highest coding efficiency, if the determined coding efficiency information indicates that the amount of coded information is less than if the coding is performed on the basis of the audio signal to be coded.

10. The method of claim 1, further comprising:
determining a coding efficiency for each of the predicted signals; and
performing the coding on the basis of the predicted signal that provides the highest coding efficiency.

11. The method of claim 1, further comprising:
transforming the audio signal to be coded into the frequency domain to determine the frequency spectrum of the audio signal;
transforming each predicted signal into the frequency domain to determine the frequency spectrum of each predicted signal; and
determining a coding efficiency for each predicted signal on the basis of the frequency spectrum of the audio signal and the frequency spectrum of the predicted signal.

12. The method of claim 1, wherein the audio signal is a speech signal.

13. The method of claim 1, further comprising determining the coding error using one of the following:
at least squares method;
a method based on psychoacoustic modeling of the audio signal to be coded.

14. The method of claim 13, wherein if the coding error is determined using the least squares method, the coding error is calculated from the prediction error.

15. A method of decoding an audio signal comprising:
receiving a coded sequence;
determining if the coded sequence was formed from an original audio signal;
if the coded sequence was not formed from an original audio signal, extracting a pitch predictor order, pitch predictor coefficients, and lag information used to code the coded sequence from the coded sequence;
selecting a reference sequence from a number of stored sequences that has the smallest error relative to the coded sequence based on the lag information;
producing a predicted signal from the selected reference sequence, the extracted pitch predictor order and pitch predictor coefficients; and
transforming the predicted signal, wherein the transformed predicted signal substantially corresponds to the original audio signal;

the method further comprising:
transforming the coded sequence to the original signal if the coded sequence was formed from the original audio signal.

16. The method of claim 15, wherein the coded sequence is received in a bit string.

17. The method of claim 16, wherein the bit string includes an indication that the coded sequence was not formed from the original audio signal, the pitch predictor order, pitch predictor coefficients, and lag information.

18. The method of claim 16, wherein when the bit string includes an indication that the coded sequence was formed from the original audio signal and frequency spectrum values of the original audio signal.

19. An encoder of a data transmission system for encoding an audio signal, the encoder operable to:
select a reference sequence from a number of stored sequences that has the smallest error relative to a sequence of the audio signal to be coded;
calculate pitch predictor coefficients for the selected reference sequence using one of a set of pitch predictor orders;
produce a predicted sequence from the selected reference sequence using the calculated pitch predictor coefficients;
calculate a coding error by comparing the predicted sequence to the sequence to be coded;
calculate pitch predictor coefficients for the selected reference sequence, produce a predicted sequence from the selected reference sequence, and calculate a coding error by comparing the predicted sequence to the sequence to be coded, for each of the remaining orders of the set of pitch predictor orders; and
use an order from the set of pitch predictor orders that results in the smallest coding error to select a coding method for the sequence to be coded.

20. The encoder of claim 19, wherein the selected coding method includes coding the sequence to be coded on the basis of the predicted sequence.

21. The encoder of claim 19, wherein the selected coding method includes coding the sequence to be coded on the basis of the audio signal itself.

22. The encoder of claim 19, further operable to:
define a coding efficiency for the predicted sequence having the smallest coding error; and
perform the selected coding method on the basis of the predicted signal having the smallest coding error if the determined coding efficiency indicates that the amount of coded information is less than if the coding is performed on the audio signal itself.

23. The encoder of claim 22, further operable to:
transform the sequence to be coded into the frequency domain to determine a frequency spectrum of the sequence of the audio signal;
transform each predicted signal into the frequency domain to determine a frequency spectrum of each predicted signal; and
determine the coding efficiency for the predicted signal having the smallest coding error on the basis of the frequency spectrum of the audio signal and the frequency spectrum of the predicted signal.

24. The encoder of claim 23, further operable to determine the prediction error information for each of the predicted signals as a difference spectrum representing using the frequency spectrum of the audio signal and the frequency spectrum of the predicted signal.

25. The encoder of claim 23, wherein the transformation to the frequency domain is conducted using a modified DCT transform.

26. The encoder of claim 19, further operable to:
determine a coding efficiency for each of the predicted signals; and
determine a coding error for those predicted signals for which the determined coding efficiency information indicates that the amount of coded information is less than if the coding is performed on the basis of the audio signal to be coded and the coding is performed on the basis of the predicted signal that provides the smallest coding error.

27. The encoder of claim 19, further operable to:
determine a coding efficiency for each of the predicted signals; and
perform the coding on the basis of the predicted signal that provides the highest coding efficiency, if the determined coding efficiency information indicates that the amount of coded information is less than if the coding is performed on the basis of the audio signal to be coded.

28. The encoder of claim 19, further operable to:
determine a coding efficiency for each of the predicted signals; and
perform the coding on the basis of the predicted signal that provides the highest coding efficiency.

29. The encoder of claim 19, further operable to:
transform the audio signal to be coded into the frequency domain to determine the frequency spectrum of the audio signal;
transform each predicted signal into the frequency domain to determine the frequency spectrum of each predicted signal; and
determine a coding efficiency for each predicted signal on the basis of the frequency spectrum of the audio signal and the frequency spectrum of the predicted signal.

30. The encoder of claim 19, wherein the audio signal is a speech signal.

31. The encoder of claim 19, further operable to determine the coding error using one of the following:
at least squares method;
a method based on psychoacoustic modeling of the audio signal to be coded.

32. The encoder of claim 31, wherein if the coding error is determined using the least squares method, the encoder calculates the coding error from the prediction error.

33. A decoder of a data transmission system for decoding an audio signal, the decoder operable to:
receive a coded sequence;
determine if the coded sequence was formed from an original audio signal;
if the coded sequence was not formed from an original audio signal, extract a pitch predictor order, pitch predictor coefficients, and lag information used to code the coded sequence from the coded sequence;
select a reference sequence from a number of stored sequences that has the smallest error relative to the coded sequence based on the lag information;
produce a predicted signal from the selected reference sequence, the extracted pitch predictor order and pitch predictor coefficients; and
transform the predicted signal, wherein the transformed predicted signal substantially corresponds to the original audio signal;
the decoder further operable to:
transform the coded sequence to the original signal if the coded sequence was formed from the original audio signal.

34. The decoder of claim 33, further operable to receive the coded sequence in a bit string.

35. The decoder of claim 34, wherein the bit string includes an indication that the coded sequence was not formed from the original audio signal, the pitch predictor order, pitch predictor coefficients, and lag information.

36. The decoder of claim 34, wherein when the bit string includes an indication that the coded sequence was formed from the original audio signal and frequency spectrum values of the original audio signal.

37. A computer readable medium encoded with instructions for encoding an audio signal, the instructions capable of being executed by a computer causing the computer to:
select a reference sequence from a number of stored sequences that has the smallest error relative to a sequence of the audio signal to be coded;
calculate pitch predictor coefficients for the selected reference sequence using one of a set of pitch predictor orders;
produce a predicted sequence from the selected reference sequence using the calculated pitch predictor coefficients;
calculate a coding error by comparing the predicted sequence to the sequence to be coded;
calculate pitch predictor coefficients for the selected reference sequence, produce a predicted sequence from the selected reference sequence, and calculate a coding error by comparing the predicted sequence to the sequence to be coded, for each of the remaining orders of the set of pitch predictor orders; and
use an order from the set of pitch predictor orders that results in the smallest coding error to select a coding method for the sequence to be coded.

38. A computer readable medium encoded with instructions for decoding an audio signal, the instructions capable of being executed by a computer causing the computer to:
receive a coded sequence;
determine if the coded sequence was formed from an original audio signal;
if the coded sequence was not formed from an original audio signal, extract a pitch predictor order, pitch predictor coefficients, and lag information used to code the coded sequence from the coded sequence;
select a reference sequence from a number of stored sequences that has the smallest error relative to the coded sequence based on the lag information;
produce a predicted signal from the selected reference sequence, the extracted pitch predictor order and pitch predictor coefficients; and
transform the predicted signal, wherein the transformed predicted signal substantially corresponds to the original audio signal;

wherein the computer readable program when executed on a computer further causes the computer to:
transform the coded sequence to the original signal if the coded sequence was formed from the original audio signal.

39. An encoder for coding an audio signal comprising:
a lag block for selecting a reference sequence from a number of stored sequences that has the smallest error relative to a sequence to be coded;
a coefficient calculator for calculating pitch predictor coefficients for the selected reference sequence using one of a set of pitch predictor orders;
a pitch predictor block for producing a predicted sequence from the selected reference sequence using the calculated pitch predictor coefficients;
a calculation block for calculating a coding error by comparing the predicted sequence to the sequence to be coded;
wherein the coefficient calculator, the pitch predictor block, and the calculation block are operable to calculate pitch predictor coefficients for the selected reference sequence, produce a predicted sequence from the selected reference sequence, and calculate a coding error by comparing the predicted sequence to the sequence to be coded, for each of the remaining orders of the set of pitch predictor orders; and
wherein the calculation block is further operable to use an order from the set of pitch predictor orders that results in the smallest coding error to select a coding method for the sequence to be coded.

40. A decoder for decoding an audio signal comprising:
a receiving device for receiving a coded sequence;
a decoder for determining if the coded sequence was formed from an original audio signal;
the receiving device operable to extract a pitch predictor order, pitch predictor coefficients, and lag information used to code the coded sequence from the coded sequence if the coded sequence was not formed from an original audio signal;
a pitch predictor block for selecting a reference sequence from a number of stored sequences that has the smallest error relative to the coded sequence based on the lag information;
the pitch predictor block operable to produce a predicted signal from the selected reference sequence, the extracted pitch predictor order and pitch predictor coefficients, and to transform the predicted signal, wherein the transformed predicted signal substantially corresponds to the original audio signal;

wherein the decoder is operable to transform the coded sequence to the original signal if the coded sequence was formed from the original audio signal

41. A data transmission system for coding an audio signal comprising:
circuitry for coding having:
a lag block for selecting a reference sequence from a number of stored sequences that has the smallest error relative to a sequence to be coded;
a coefficient calculator for calculating pitch predictor coefficients for the selected reference sequence using one of a set of pitch predictor orders;
a pitch predictor block for producing a predicted sequence from the selected reference sequence using the calculated pitch predictor coefficients;
a calculation block for calculating a coding error by comparing the predicted sequence to the sequence to be coded;
wherein the coefficient calculator, the pitch predictor block, and the calculation block are operable to calculate pitch predictor coefficients for the selected reference sequence, produce a predicted sequence from the selected reference sequence, and calculate a coding error by comparing the predicted sequence to the sequence to be coded, for each of the remaining orders of the set of pitch predictor orders; and
wherein the calculation block is further operable to use an order from the set of pitch predictor orders that results in the smallest coding error to select a coding method for the sequence to be coded.

42. A data transmission system for decoding an audio signal comprising:
circuitry for decoding having:
a receiving device for receiving a coded sequence;
a decoder for determining if the coded sequence was formed from an original audio signal;
the receiving device operable to extract a pitch predictor order, pitch predictor coefficients, and lag information used to code the coded sequence from the coded sequence if the coded sequence was not formed from an original audio signal;
a pitch predictor block for selecting a reference sequence from a number of stored sequences that has the smallest error relative to the coded sequence based on the lag information;
the pitch predictor block operable to produce a predicted signal from the selected reference sequence, the extracted pitch predictor order and pitch predictor coefficients, and to transform the predicted signal, wherein the transformed predicted signal substantially corresponds to the original audio signal;

wherein the decoder is operable to transform the coded sequence to the original signal if the coded sequence was formed from the original audio signal

43. A data transmission system comprising:
circuitry for coding having:
a lag block for selecting a reference sequence from a number of stored sequences that has the smallest error relative to a sequence of an original audio signal to be coded;
a coefficient calculator for calculating pitch predictor coefficients for the selected reference sequence using one of a set of pitch predictor orders;
a pitch predictor block for producing a predicted sequence from the selected reference sequence using the calculated pitch predictor coefficients;
a calculation block for calculating a coding error by comparing the predicted sequence to the sequence to be coded;
wherein the coefficient calculator, the pitch predictor block, and the calculation block are operable to calculate pitch predictor coefficients for the selected reference sequence, produce a predicted sequence from the selected reference sequence, and calculate a coding error by comparing the predicted sequence to the sequence to be coded, for each of the remaining orders of the set of pitch predictor orders; and
wherein the calculation block is further operable to use an order from the set of pitch predictor orders that results in the smallest coding error to select a coding method for the sequence to be coded and to generate a coded sequence;

the data transmission system also including circuitry for decoding having:
a receiving device for receiving the coded sequence;
a decoder for determining if the coded sequence was formed from the original audio signal;
the receiving device operable to extract a pitch predictor order, pitch predictor coefficients, and lag information used to code the coded sequence from the coded sequence if the coded sequence was not formed from the original audio signal;
a pitch predictor block for selecting a reference sequence from a number of stored sequences that has the smallest error relative to the coded sequence based on the lag information;
the pitch predictor block operable to produce a predicted signal from the selected reference sequence, the extracted pitch predictor order and pitch predictor coefficients, and to transform the predicted signal, wherein the transformed predicted signal substantially corresponds to the original audio signal;

wherein the decoder is operable to transform the coded sequence to the original signal if the coded sequence was formed from the original audio signal.

44. A computer readable medium encoded with instructions for transmitting a coded sequence, the instructions capable of being executed by a computer causing the computer to transmit the coded sequence utilizing a data structure comprising:
an indication in the data structure that the coded sequence was not formed from an original audio signal, a pitch predictor order, pitch predictor coefficients, and lag information determined by:
selecting a reference sequence from a number of stored sequences that has the smallest lag relative to a sequence of the original audio signal;
calculating pitch predictor coefficients for the selected reference sequence using one of a set of pitch predictor orders;
producing a predicted sequence from the selected reference sequence using the calculated pitch predictor coefficients;
calculating a coding error by comparing the predicted sequence to the sequence to be coded;
calculating pitch predictor coefficients for the selected reference sequence, producing a predicted sequence from the selected reference sequence, and calculating a coding error by comparing the predicted sequence to the sequence to be coded, for each of the remaining orders of the set of pitch predictor orders; and
including the lag information and the pitch predictor order and pitch predictor coefficients in the data structure that result in the smallest coding error.