Abstract:
For the purpose of error masking, binary representations of parameter values are precoded at the transmitting end by a linear block code before transmission over a faulty channel, and the redundant information added in this way is not used at the receiving end for error detection within the binary parameter representations, but is utilized in the course of a parameter estimation to improve the quality of the estimated parameter values.

Description:
CROSS-REFERENCE TO RELATED APPLICATION  
       [0001]    This is a continuation of copending International Application PCT/EP99/03765, filed May 31, 1999, which designated the United States. 
     
    
     
       BACKGROUND OF THE INVENTION  
         [0002]    1. Field of the Invention  
           [0003]    The invention relates to a method and to configurations for error masking in the transmission and/or storage of digital data, in particular in the case of application of source coding (for example speech coding using the Code Excited Linear Predictive-CELP principle). Within the scope of the invention, transmission (sending and/or receiving) is also understood as the transfer of data to/from a storage medium, that is to say also the storage of data.  
           [0004]    Source signals or source information such as speech, sound, image and video signals virtually always include statistical redundance, that is to say redundant information. This redundancy can be greatly reduced by source coding, thus permitting efficient transmission and/or storage of the source signal. This reduction in redundancy removes, before transmission, redundant signal contents which are based on the prior knowledge of, for example, statistics of the signal shape. The bit rate of the source-coded information is also called coding rate or source bit rate. After the transmission, these components are added to the signal again during the source decoding so that no loss of quality can be detected objectively and/or subjectively.  
           [0005]    On the other hand, it is customary in signal transmission specifically to make use of channel coding to add redundancy again, in order largely to eliminate the influence of channel faults on transmission. Additional redundant bits permit the receiver and/or decoder to detect errors and possibly also to correct them. The bit rate of the channel-coded information is also called gross bit rate.  
           [0006]    In order to be able to transmit as efficiently as possible information, in particular speech data, image data or other useful data, by means of the limited transmission capacities of a transmission medium, in particular of an air interface, this information which is to be transmitted is therefore compressed before transmission by a source coding and protected against channel errors by a channel coding. Different methods are respectively known for these purposes. Thus, for example, in the GSM (Global System for Mobile Communication) speech can be coded by means of a full rate speech codec, a half rate speech codec or an enhanced full rate speech codec.  
           [0007]    Within the scope of this application, a method for encoding and/or for corresponding decoding, which can also comprise a source and/or channel coding, is also denoted as a speech codec.  
           [0008]    Residual bit errors which cannot be corrected by the channel decoding, occasionally lead to a substantial impairment of the speech reproduction. An additional method for error masking is capable of substantially improving the subjectively perceived reproduction quality.  
           [0009]    By way of example, in the case of a frame extinction in the GSM, the last correctly received speech frame is repeated instead of the instantaneous one. After five successive faulty frames muting is performed in stages. This method is controlled by binary frame reliability information, the Bad Frame Indicator (BFI).  
           [0010]    Soft bit speech decoding can be used for error masking by systematic expansion of the reliability information passed on to the speech decoder by the channel decoder. Methods are known in this case (Tim Fingscheidt, Peter Vary, “Error Concealment by Softbit Speech Decoding”, ITG Fachbericht No.  139  “Sprachkommunikation” [“Speech communication”], pages 7-10, Frankfurt a.M., 1996), in which methods of decision and estimation theory are used and are briefly explained below.  
           [0011]    The signal-to-noise power ratio (SNR) between transmitted and received parameter values proves to be an informative quality criterion for the majority of the speech parameters determined, for example, by an CELP speech codec. Subjectively perceived speech quality and parameter SNR are thereby well correlated as a rule.  
           [0012]    For this reason, a parameter decoder (for example a speech coder based on CELP) is sensible; it maximizes this SNR between a transmitted parameter (which is not, however, limited to speech parameters) X and the appropriately decoded parameter {circumflex over (X)} on average, or minimizes their quadratic difference, that is to say  
               X   ^     =     arg                 min                   E     x   ~            {       (     X   -     X   ~       )     2     }               (   1.1   )                               
 
           [0013]    In order to transmit the continuous-value parameter X, it is first necessary to undertake coding by means of the bit sequence {x 1 , . . . x w }. This is performed by quantization, as a rule. For this purpose, the entire value range of the parameter X is decomposed into 2 w  intervals (or cells in the case of vector quantization) S i . Each of these cells is respectively assigned a unique transmit bit sequence x i ={x i (i) , . . . x w (i) }.  
           [0014]    A channel with a binary input x and continuous-value output z is now adopted as a transmission channel. In this case, the values z observed at the output are a function of the input values x and a random process which is not initially specified in more detail. All that is presupposed for interference which acts on successive bit sequences and/or parameters is statistical independence. This channel can be completely described by the likelihood function p z|x (z 1 , . . . z w |x 1 , . . . x w ).  
           [0015]    The expectation in (1.1) is therefore determined by two random processes: by the parameter-generating process X and the observed received values z, that is to say  
               E   X     ,         {     z1   ,   …              ,   zW     }                     {       [     X   -       X   ~          (       z   1     ,   ,     z   W       )         ]     2     }       =       ∫       z   1     ,   …              ,     z   W                ∫   X              [     X   -       X   ~          (       z   1     ,   …              ,     z   W       )         ]     2            p     x   ,     z   1     ,   …              ,     z   W              (     X   ,     z   1     ,   …              ,     z   W       )               X               z   1          …                          z   W       .                     (   1.2   )                               
 
           [0016]    Since the integrand is always positive, the expectation can be minimized by minimizing the inner integral with respect to {tilde over (X)} for each possible reception sequence {z 1 , . . . z w }. The result is the formula of the Mean Square (MS) estimator  
                 X   ~     opt     =       ∫   X            X   ·       p       x   |       z   1        …                  ,     z   W              (       X   |     z   1       ,   …              ,     z   W       )                 X                 (   1.3   )                               
 
           [0017]    Taking account of the quantization at the transmitting end, this further yields  
                 X   ~     opt     =       ∑   1            ∫     X   ∈     S   i                X   ·           p       z   1     ,   …              ,       z   W        x              (       z   1     ,   …              ,       z   W     |   x       )       ·       p   x          (   X   )             p       z   1     ,   …              ,     z   W              (       z   1     ,   …              ,     z   W       )                     X     .                   (   1.4   )                               
 
           [0018]    Since the same bit sequence x i  is transmitted for all XεS i , the conditional probability in the numerator is a constant with respect to the integration, and it follows that  
                       X   ~        opt     =       ∑   i                p       z   1     ,   …              ,       z   W     |   x              (       z   1     ,   …              ,       z   W     |     x   i         )           p       z   1     ,   …              ,     z   W              (       z   1     ,   …              ,     z   W       )                ∫     X   ∈     S   i                X   ·       p   x          (   X   )                 X                         =       ∑   i                p       z   1     ,   …              ,       z   W     |   x              (       z   1     ,   …              ,       z   W     |     x   i         )           p       z   1     ,   …              ,     z   W              (       z   1     ,   …              ,     z   W       )         ·     E        (     X   |     x   i       )       ·     Pr        (     x   i     )                       =       ∑   i            E        (     X   |     x   i       )       ·     Pr        (         x   i     |     z   i       ,   …              ,     z   W       )                         (   1.5   )                               
 
           [0019]    If the parameter-generating process X is not devoid of memory, there are additional statistical connections between successive parameter values and/or bit sequences x.  
           [0020]    An analogous derivation then follows taking account of the time index n  
                   X   ~     opt          (   n   )       =       ∑   i            E        (     X   |     x   i       )       ·       Pr        (         x   i     |       z   1          (   n   )         ,   …              ,       z   W          (   n   )       ,   …              ,       z   1          (   0   )       ,   …              ,       z   W          (   0   )         )       .                 (   1.6   )                               
 
           [0021]    It is shown below how the a posteriori probabilities can be determined in (1.5) and (1.6):  
           [0022]    It may be assumed by way of simplification that the transmission channel located between a source coder and a source decoder and comprising a channel coder, modulator, physical channel, demodulator, equalizer and channel decoder can be considered, as shown in FIG. 3, as a faulty channel, devoid of memory at the bit level, with a binary input x and continuous output z. In this case, the source coder is illustrated in a simplified fashion by a parameter coder PC, and the source decoder is illustrated in a simplified fashion by an estimator S. This channel is completely described by the likelihood function p z|y (z k |y k ) and/or by the L values L(z k |x k ). Initially, the a posteriori probability is to be specified for white parameter sources in accordance with (1.5). The Bayes formula is applied for this purpose:  
               Pr        (         x   i     |     z   1       ,   …              ,     z   W       )       =           p       z   1     ,   …              ,       z   W     |   x              (       z   1     ,   …              ,       z   W     |     x   i         )           ∑   j              p       z   1     ,   …              ,       z   W     |   x              (       z   1     ,   …              ,       z   W     |     x   j         )       ·     Pr        (     x   j     )             ·     Pr        (     x   i     )                 (   1.7   )                               
 
           [0023]    All the variables are now known in this: the likelihood function p z     1   , . . . , z w |x(z 1 , . . . , z w |x i ) is given by the channel characteristics, and Pr(x i ) is the a priori probability that the bit sequence x i  is being transmitted. These probabilities are measured in advance for all i with the aid of representative signal data (for example speech samples in the case of speech coding).  
           [0024]    The likelihood function can be written as a product since a channel which is devoid of memory at the bit level was presupposed  
                 Pr       z   1     ,   …              ,       z   W     |   x              (       z   1     ,   …              ,       z   W     |     x   i         )       =       ∏     k   =   1     W              p     z   |   x            (       z   k     |       x   k          (   i   )         )       .               (   1.8   )                               
 
           [0025]    If the source decoder is provided with reliability information on the parameter X in the form of an L value sequence {L(z 1 |x 1 ) , . . . , L(z w |x w )}, it is possible to calculate (1.8) efficiently in the logarithmic region. The following is yielded  
                 Pr       z   1     ,   …              ,       z   W     |   x              (       z   1     ,   …              ,       z   W     |     x   i         )       =       C   ·   exp                       (       ∑     k   ∈     {       k   |       x   k          (   i   )         =     +   1       }              L        (       z   k     |     x   k       )         )     .               (   1.9   )                               
 
           [0026]    In this case, C is a constant which can be determined by the normalizing condition  
                 ∑   i          Pr        (         x   i     |     z   1       ,   …              ,     z   W       )         =   1           (   1.10   )                               
 
           [0027]    If the parameter source X is not white, that is to say there is a statistical dependence between successive output values, the source can be modeled by a Markov chain. Only the case of a first order Markov chain is to be considered here. It holds in this case with z n ={z 1 (n), . . . , z w (n)} 
                       Pr        (           x   i          (   n   )       |     z   n       ,     z     n   -   1       ,   …              ,     z   0       )       =                  p        (       z   n     ,   …              ,       z   0     |       x   i          (   n   )           )         p        (       z   n     ,   …              ,     z   0       )                     =                  P        (       z   n     |       x   i          (   n   )         )       ·                                  ∑   j          p        (         x   i          (   n   )       ,       x   j          (     n   -   1     )       ,     z     n   -   1       ,   …              ,     z   0       )           p        (       z   n     ,   …              ,     z   0       )                      
              p        (       z     n   -   1       ,   …              ,     z   0       )           p        (       z   n     ,   …              ,     z   0       )            const         ·     p        (       z   n     |       x   i          (   n   )         )       ·       ∑   j          Pr                     (         x   i          (   n   )       |       x   j          (     n   -   1     )         )     ·     Pr        (           x   i          (     n   -   1     )       |     z     n   -   1         ,   …              ,     z   0       )                       (   1.11   )                               
 
           [0028]    The indices of the distribution density functions have been dispensed with in the derivation for reasons of clarity. The fraction in (1.11) is a constant with respect to x i (n), and can be determined with the aid of the normalizing condition (1.10). The transitional probabilities (Pr(x i (n)|x j (n−1)) of the Markov chain must be measured just like the a priori probabilities on a long output sequence of the parameter source.  
           [0029]    An expansion of this recursion formula to a Markov chain of higher order is certainly directly possible, but the increase thereby caused in computational complexity and required storage space is not, as a rule, acceptably related to the increase in accuracy of estimation.  
         SUMMARY OF THE INVENTION  
         [0030]    It is accordingly an object of the invention to provide a method and a configuration for error masking which permit a high-quality reconstruction of source signals from signal data transmitted over a transmission channel affected by error, and which overcomes the above-mentioned disadvantageous of the prior art methods and configurations of this general type.  
           [0031]    With the foregoing and other objects in view there is provided, in accordance with the invention a method for error masking that can be used when transmitting parameter values. The method includes steps of: converting parameter values into a binary representation; at a transmitting end, adding first redundant information to at least some of the parameter values by preceding the binary representation of the at least some of the parameter values with a linear block code, and performing the preceding before transmitting the binary representation of the at least some of the parameter values over a faulty channel; and using the first redundant information at a receiving end to estimate the parameter values rather than using the first redundant information for error detection.  
           [0032]    The invention is therefore based on the idea that redundancy which is still present in the transmitted signal after the source coding and added explicitly in the form of channel coding is used at the receiving end not for error detection or correction, but is utilized for an estimate which is optimum for the purpose of a measure of quality.  
           [0033]    It is therefore possible to carry out the error masking with a higher quality.  
           [0034]    In accordance with an added feature of the invention, the method includes steps of: at the transmitting end, performing at least a source coding to obtain the parameter values; adding second redundant information to the precoded binary representation of the at least some of the parameter values; and after the binary representation of the at least some of the parameter values have been transmitted over the faulty channel to a receiving end, using the second redundant information, at the receiving end, for a process selected from the group consisting of error detection and error correction.  
           [0035]    In accordance with an additional feature of the invention, the second redundant information is added for channel coding.  
           [0036]    In accordance with another feature of the invention, the first redundant information is used at the receiving end as a posteriori information to estimate the parameter values.  
           [0037]    In accordance with a further feature of the invention, a soft bit speech decoding method is used to estimate the parameter values.  
           [0038]    With the foregoing and other objects in view there is also provided, in accordance with the invention a transmitting device for transmitting parameter values. The transmitting device includes a processor unit configured for: converting parameter values into a binary representation; adding first redundant information to at least some of the parameter values by preceding the binary representation of the at least some of the parameter values with a linear block code, and performing the preceding before transmitting the binary representation of the at least some of the parameter values over a faulty channel; and adding the first redundant information to the at least some of the parameter values in a manner such that at a receiving end, the first redundant information can be used for estimating the parameter values rather than for error detection.  
           [0039]    With the foregoing and other objects in view there is provided, in accordance with the invention a receiving device for receiving parameter values which have been converted into a binary representation at a transmitting end before being transmitted over a faulty channel. First redundant information has been added to the binary representation of the parameter values by preceding with a linear block code before the binary representation of the parameter values have been transmitted over the faulty channel. The receiving device includes a processor unit configured for using the first redundant information to estimate the parameter values rather than for using the first redundant information for error detection.  
           [0040]    Other features which are considered as characteristic for the invention are set forth in the appended claims.  
           [0041]    Although the invention is illustrated and described herein as embodied in a method and configuration for error masking, it is nevertheless not intended to be limited to the details shown, since various modifications and structural changes may be made therein without departing from the spirit of the invention and within the scope and range of equivalents of the claims. 
       
    
    
       [0042]    The construction and method of operation of the invention, however, together with additional objects and advantages thereof will be best understood from the following description of specific embodiments when read in connection with the accompanying drawings.  
       BRIEF DESCRIPTION OF THE DRAWINGS  
       [0043]    [0043]FIG. 1 shows a schematic of essential elements of a telecommunication transmission chain;  
         [0044]    [0044]FIG. 2 shows a schematic of an AMR coder based on the CELP principle;  
         [0045]    [0045]FIG. 3 shows a schematic of the transmission of a speech parameter; and  
         [0046]    [0046]FIG. 4 shows a block diagram of a processor unit. 
     
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0047]    Referring now to the figures of the drawing in detail and first, particularly, to FIG. 1 thereof, there is shown a source Q which generates source signals qs which are compressed by a source coder QE, such as the GSM full rate speech coder, to form symbol sequences consisting of symbols. In the case of parametric source coding methods, the source signals qs (for example speech) generated by the source Q are subdivided into blocks (for example time frames) and processed. The source coder QE generates quantized parameters (for example speech parameters) which are also designated below as symbols of a symbol sequence, and which reflect the characteristics of the source in the current block in a certain way (for example the spectrum of the speech in the form of filter coefficients, amplitude factors, excitation vectors). These symbols have a specific symbol value after quantization.  
         [0048]    The symbols of the symbol sequence and/or the corresponding symbol values are mapped onto a sequence of binary code words, which respectively have a plurality of bit positions, by a binary mapping (allocation rule) which is frequently described as part of the source coding QE. If these binary code words are further processed, for example one after another as a sequence of binary code words, the result is a sequence of source-coded bit positions which can be embedded in a framework structure. Source coding carried out in such a way therefore provides in a fashion structured in a frame source bits or data bits db with a source bit rate (coding rate) depending on the type of source coding.  
         [0049]    [0049]FIG. 2 shows an illustration of the principle of a specific variant of a source coder, in particular a speech coder, specifically a speech coder based on a CELP (Code Excited Linear Predictive) principle.  
         [0050]    The CELP principle is an analysis-by-synthesis method. In this case, a filter structure obtained from the current speech section is excited by excitation vectors (code vectors) taken sequentially from a code book. The output signal of the filter is compared with the current speech section by means of a suitable error criterion, and the error-minimizing excitation vector is selected. A representation of the filter structure, and the place number of the selected excitation vector are transmitted to the receiver.  
         [0051]    A specific variant of a CELP method uses an algebraic code book which is also frequently denoted as sparse algebraic code. It is a multipulse code book which is filled with binary (+/−1) or ternary (0, +/−1) pulses. Only a few positions are respectively occupied by pulses inside the excitation vectors. After selection of the positions, the entire vector is weighted with an amplitude factor. Such a code book has a plurality of advantages. Firstly, it does not occupy any storage space, since the permitted positions of the pulses are determined by an algebraic computing rule, while secondly because of its design it can be searched very efficiently for the best pulse positions.  
         [0052]    A variant design of a conventional CELP coder is first described below with the aid of FIG. 2. A target signal to be approximated is simulated by searching two code books. In this case, a distinction is made between an adaptive code book (a 2 ), whose task is to simulate the harmonic speech components, and a stochastic code book (a 4 ) which serves to synthesize the speech components which cannot be obtained by prediction. The adaptive code book (a 2 ) varies as a function of the speech signal, whereas the stochastic code book (a 4 ) is time-invariant. The search for the best excitation code vectors runs in such a way that no common, that is to say simultaneous search is made in the code books, as would be required for an optimum selection of the excitation code vectors, but the adaptive code book (a 2 ) is first searched through, for reasons of cost. If the best excitation code vector in accordance with the error criterion is found, its contribution to the reconstructed target signal is subtracted from the target vector (target signal), and the part of the target signal still to be reconstructed is obtained from a vector from the stochastic code book (a 4 ). The search in the individual code books is performed using the same principle. In both cases, the quotient of the square of the correlation of the filtered excitation code vector with the target vector and the energy of the filtered target vector is calculated for all excitation code vectors. That excitation code vector which maximizes this quotient is regarded as the best excitation code vector which minimizes the error criterion (a 5 ). The upstream error weighting (a 6 ) weights the error in accordance with the characteristics of human hearing. The position of the excitation code vector found in the excitation code book is transmitted to the decoder.  
         [0053]    The correct (code book) amplitude factor (gain  1 , gain  2 ) is determined implicitly for each excitation code vector by calculating the above-described quotient. After the best candidate has been determined from the two code books, the quality-reducing influence of the code book search carried out sequentially can be reduced by a common optimization of the gain. In this case, the original target vector is specified anew, and the best gains are calculated in a fitting fashion relative to the now selected excitation code vectors, said gains mostly differing slightly from those which were determined during the code book search.  
         [0054]    In the case of the CELP principle, each candidate vector can be filtered (a 3 ) individually and compared with the target signal in order to find the best excitation code vector. Finally, filter parameters, amplitude factors and excitation code vectors are converted into binary signals and transmitted in frames in a fashion embedded in a fixed structure. The filter parameters can be LPC (Linear Predictive Coding) coefficients, LTP (Long Term Prediction) indices or LTP (Long Term Prediction) amplitude factors.  
         [0055]    The efficiency of a known method described above for error masking can be considerably enhanced by preceding the speech parameter bits with a linear block code at the transmitting end in the way according to the invention. By contrast with conventional channel coding methods, the added redundancy is used not for error detection or error correction at the receiving end, but for a more accurate determination of the a posteriori probabilities required for the estimation.  
         [0056]    This principle may be illustrated using a simple Single Parity Check (SPC) code. This systematic linear code adds an additional parity bit x p (i) to the speech parameter bits. This is determined by the equation  
                 x   p          (   i   )       =       ∑     j   =   1     W          ⊕       x   j          (   i   )                   (   1.13   )                               
 
         [0057]    The parity bit x p (i) is transmitted in common with the remaining parameter bits. Consequently, the additional soft information of the received parity bit z p  is available at the receiving end for the parameter estimator. Equation 1.8 can therefore be expanded to  
                 p       z   1     ,   …              ,     z   W     ,       z   P     |   x     ,     x   P              (       z   1     ,   …              ,     z   W     ,       z   P     |     x   j       ,       x   P          (   i   )         )       =         p     z   /   x            (       z   P     |       x   P          (   i   )         )       ·       ∏     k   =   1     W              p     z   |   x            (       z   k     |       x   k          (   i   )         )       .                 (   1.14   )                               
 
         [0058]    The effect caused by the additional factor p z|x (z p |x p (i)) can be understood descriptively as follows: the a posteriori probabilities of those bit patterns x i  whose parity bit x p (i) correspond to the actually received value z p  are raised, while all others are lowered. This may be illustrated using a simple example. The quantization of a parameter with a four-stage uniform quantizer is considered. The quantization stages and the associated bit codes are as follows:  
                                                        0.75:   +1, −1            0.25:   +1, +1           −0.25:   −1, +1           −0.75:   −1, −1                      
 
         [0059]    At the receiving end, the entry 0.25 is selected in this example, that is to say the bit sequence {+1,+1} is transmitted. Because of channel disturbances, a faulty sequence of soft values is received which can be converted into L values, for example  
         [0060]    {9.1,−0.3}.  
         [0061]    The following probabilities are yielded herefrom for the table entries, assuming that all entries occur with equal frequency:  
                                                        0.75:   0.574            0.25:   0.426           −0.25:   ˜0           −0.75:   ˜0                      
 
         [0062]    This yields the estimated value of  
         [0063]    MS=0.537.  
         [0064]    If there is now transmitted for the purpose of the invention an additional parity bit whose received L value is assumed to be  
         [0065]    5.3.  
         [0066]    the a posteriori probabilities  
                                                        0.75:   0.007            0.25:   0.993           −0.25:   ˜0           −0.75:   ˜0                      
 
         [0067]    and thus the estimated value  
         [0068]    MS′=0.2535  
         [0069]    are obtained.  
         [0070]    This example shows that the estimated value determined at the receiving end is much closer to the value of 0.25 actually transmitted because of the parity bit additionally transmitted. An expansion of this method to more complex linear codes is directly possible.  
         [0071]    In a variant design of the invention, the method is used for the LPC index of the first stage at a coding rate of 6.1 kbit/s. A shortened (13.9) Hamming code is used for this purpose. Simulations show that a clearer gain by comparison with hard decoding can be achieved simply by parameter estimation. The robustness of the transmission can be further raised by linear precoding using a parity bit and the (13.9) Hamming code.  
         [0072]    The net data rate is raised after speech coding from 6.1 to 6.3 kbit/s by the 4 parity bits additionally to be transmitted, and this leads to a reduced error protection by the channel coding on account of the gross data rate, which is to be held constant. Informal hearing tests show, however, that in the case of poor channel states (C/I≦4 dB) the reduction in the error robustness is overcompensated because of the reduced channel error protection by the method of linear preceding, that is to say a conspicuous increase in the speech intelligibility can be ascertained on account of the preceding.  
         [0073]    [0073]FIG. 4 shows a processor unit PE which can, in particular, be included in a communication device such as a base station BS or a mobile station MS. It includes a control device STE which essentially comprises a program-controlled microcontroller, and a processing device VE which comprises a processor, in particular a digital signal processor, which can access memory modules SPE both in write or read mode.  
         [0074]    The microcontroller controls and monitors all the essential elements and functions of a function unit which includes the processor unit PE. The digital signal processor, a portion of the digital signal processor or a specific processor is responsible for carrying out the speech coding or speech decoding. The selection of a speech codec can also be performed by the microcontroller or the digital signal processor itself.  
         [0075]    An input/output interface I/O serves for inputting/outputting useful or control data, for example to an operator&#39;s station MMI, which can include a keyboard and/or a display. The individual elements of the processor unit can be interconnected by a digital bus system BUS.  
         [0076]    A person skilled in the art can use the description to apply the invention to other CELP coding methods explained in the application, as well.