Abstract:
The invention relates to a method and a receiver having control logic means for determining a target packet level of a jitter buffer adapted to receive packets with digitized signal samples, which packets are subject to delay jitter, from a packet data network. According to the invention, the jitter buffer is made adaptive to current network conditions, i.e., the nature and magnitude of the jitter observed by the receiver, by collecting statistical measures that describe these conditions. The target buffer level is determined with regard to the effect of packet losses in terms of duration of the discontinued playback of the true signal. This effect is derived from statistical measures of the network conditions as perceived by the receiving side and as reflected by a probability mass function which is continuously updated with packet inter-arrival times. The target buffer level is the result of minimization of a cost function which weights the internal buffer delay and an expected length of buffer underflow.

Description:
TECHNICAL FIELD OF THE INVENTION 
       [0001]    The present invention generally relates to reception of data packets with digitized signal samples from a packet data network, and more specifically to determining a target packet level of a jitter buffer adapted to receive packets with delay jitter from the network. 
       BACKGROUND OF THE INVENTION 
       [0002]    In packet switched networks, such as the Internet, data packets transferred by the network are subject to varying delays due to network load when transferring a packet, network path for a transferred packet, and other network conditions. Thus, data packets that are produced by a transmitter at a constant rate arrive at a receiver with variable delays. The varying delay of a data packet is mainly due to the delay inflicted by the packet network and is often referred to as jitter. The severity of the jitter can vary significantly depending on network type and current conditions; the variance of the packet delay can change with several orders of magnitude from one network type to another. 
         [0003]    In order to reproduce an audio stream that is true to the original, a decoder must be provided with data packets at the same constant rate with which they were sent. Therefore, a device called a jitter buffer is commonly introduced in the receiver. The jitter buffer must de-jitter the incoming stream of packets and provide a constant flow of data to the decoder. This is done by holding the packets in a buffer, thus introducing a delay at the receiver, so that future packets that are subject to larger delays will have arrived before their respective time-of-use. In other words, packets are needed in the jitter buffer to prevent the buffer from underflowing, or at least minimizing the time during which the buffer is in a state of underflow. A long delay of a packet may not only result in that the buffer becomes empty, but also that the buffer may be empty for an unacceptable long time. If the buffer becomes empty, continued playback of the received signal is no longer possible and the delayed packet will be treated as a lost packet. However, a high buffer level will introduce a long delay at the receiver which is detrimental in itself for two-way human communication. 
         [0004]    There is an inevitable trade-off in jitter buffers between buffer delay on the one hand and packet losses due to late arrivals on the other. Aiming for a low buffer level, and thus a short delay, results in a larger portion of packets being discarded since they will arrive too late for continuous playback, while a high buffer level and a long delay will be very annoying for two-way human communication. 
         [0005]    In the prior art, attempts are often made to estimate and control an end-to-end delay, i.e. the total delay from the sound source, e.g. a microphone, to the destination, e.g. a loudspeaker. This total delay is hard to estimate and requires synchronized clocks on transmitting and receiving ends. In addition to requiring synchronized clocks, this solution suffers from the problem of sample clock drift. 
         [0006]    The present invention addresses the problem of how to determine a jitter buffer level which provides a suitable trade-off between buffer delay and packet losses. 
       SUMMARY OF THE INVENTION 
       [0007]    An object of the present invention is to determine a jitter buffer level which provides a suitable trade-off between buffer delay and packet losses. This object is achieved by a method as defined in independent claim  1  and a receiver as defined in independent claim  14 . 
         [0008]    The basic idea of the invention is to make a jitter buffer adaptive to current network conditions, i.e., the nature and magnitude of the jitter observed by the receiver, by collecting statistical measures that describe these conditions. 
         [0009]    According to the invention, a probability mass function is continuously updated with inter-arrival times between received packets. With the updated probability mass function, an expected duration of an empty jitter buffer is defined. 
         [0010]    Thus, a desired buffer level is not determined with regard to the probability of packet losses as such, but with regard to the effect of packet losses in terms of duration of the discontinued playback of the true signal. This effect is derived from statistical measures of the current and recent network conditions as perceived by the receiving side. The current and recent network conditions are reflected by the updated probability mass function. Using the probability mass function, the risk of “underflowing” the buffer can be derived, i.e. the probability that all packets at a certain buffer level will be decoded before the next packet arrives in the buffer. Moreover, for a certain buffer level, the expected duration of an empty buffer is given by the probability mass function. This “outage time” is approximately equal to the amount of synthetic data, or packet loss concealment data, that must be generated and played when the buffer becomes empty. Thus, an advantage of the invention is that a suitable buffer level is determined based on continuous statistical measures of the network conditions. 
         [0011]    The invention minimizes a cost function, which function includes a jitter buffer delay and an expected duration of an empty buffer. By applying a weighting factor to the cost function so as to weight the jitter buffer delay in relation to the expected duration of an empty buffer, the invention may consider the type of traffic carried by the data packets when determining the desired buffer level. This is advantageous since different kind of data traffic may have different requirements with regard to the trade-off between delay caused by the buffer and duration of any discontinued playback of data. 
         [0012]    Preferably, the actual current buffer level is compared with the determined suitable, or target, buffer level. If there is a difference, signaling is made that the length of the decoded signal sample information should be modified, i.e. lengthened or shortened. Thus, the current buffer level is indirectly controlled in the direction of the determined target buffer level. 
         [0013]    Further features of the invention, as well as advantages thereof, will become more readily apparent from the following detailed description. As is understood, various modifications, alterations and different combinations of features coming within the scope of the invention as defined by the appended claims will become apparent to those skilled in the art when studying the general teaching set forth herein and the following detailed description. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0014]    Exemplifying embodiments of the present invention will be described in greater detail with reference to the accompanying drawings, in which: 
           [0015]      FIG. 1  schematically shows an exemplified system in which an embodiment of the inventive receiver is included and configured to operate; 
           [0016]      FIG. 2  is a flow chart with the operation of the control logic means of the receiver shown in  FIG. 1  in accordance with an embodiment of the invention; and 
           [0017]      FIG. 3  shows a filter for filtering a current buffer level of the jitter buffer in  FIG. 1  in accordance with an embodiment of the invention. 
       
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
       [0018]    With reference to  FIG. 1 , an exemplified system is disclosed in which an embodiment of the inventive receiver is included and configured to operate. The transmitting end includes an audio source  110  and an encoder  120  for encoding and packetizing the audio for transmission as packet data over a packet data network  130 , here indicated as an Internet Protocol network. The receiving end includes a receiver  135  and an audio destination  140 . The receiver  135  includes a jitter buffer  150 , a decoder  160 , an audio buffer  170  and control logic means  180 . The control logic means  180  exchange signaling information with the jitter buffer and is also responsible for signaling to the decoder  160  and the audio buffer  170 . The present invention is concerned with the jitter buffer  150  and the control logic means  180  of the receiver  135 . The decoder  160  is at least in part controlled by the control logic means, as will be described below. However, the decoder  160  itself and its operations does not form part of the present invention, but is described in EP 1 243 090. 
         [0019]    The control logic means  180  are implemented by suitable state of the art hardware circuitry, including processing circuitry and interfacing circuitry, adapted to execute program instructions stored in a memory of the receiver  135  for causing the control logic means to operate in accordance with the present invention. The design of these program instructions will be appreciated by a person skilled in the art of programming after having studied the present invention disclosure. 
         [0020]    With reference to the flow chart in  FIG. 2 , the operation of the receiver  135  in  FIG. 1 , and in particular the control logic means  180 , in accordance with the present invention will now be described. 
         [0021]    In step  200  the receiver  135  at the receiving end receives data packets with digitized signal samples from the packet data network  130 . Received packets are inserted in the jitter buffer  150 . In step  210  the control logic means  180  logs the arrival time of a received packet in order to also log, in step  220 , a packet inter-arrival time defined as the time between receipt of the current packet and the previously packet. Alternatively, not every packet&#39;s arrival time is logged, but the inter-arrival time between two consecutive packets are logged with a predetermined regular interval with regard to two occurring consecutive packets. 
         [0022]    Continuing to step  230 , the packet arrival statistics are updated by the control logic means  180 . In accordance with above, the statistics may be updated for each received packet or at regular intervals. The time elapsed between two packet arrivals is of key interest and will be used in the forthcoming derivations. Let the time between the arrivals of the k:th and k+1:th incoming packets be τ k ≧0. Assume that τ k  is a stochastic variable with some PDF f τ (t), for all k. All times are here normalized, so that a packet carries speech information with duration 1, and the nominal packet inter-arrival time is also 1. Also define p τ (m) as the probability of a packet inter-arrival time in the interval m≦τ≦m+1, i.e., 
         [0000]    
       
         
           
             
               
                 p 
                 τ 
               
                
               
                 ( 
                 m 
                 ) 
               
             
             = 
             
               
                 Pr 
                  
                 
                   { 
                   
                     m 
                     ≤ 
                     τ 
                     &lt; 
                     
                       m 
                       + 
                       1 
                     
                   
                   } 
                 
               
               = 
               
                 
                   ∫ 
                   m 
                   
                     m 
                     + 
                     1 
                   
                 
                  
                 
                   
                     
                       f 
                       τ 
                     
                      
                     
                       ( 
                       t 
                       ) 
                     
                   
                    
                   
                      
                     t 
                   
                 
               
             
           
         
       
     
         [0000]    The function p τ (m) represents the probability mass function (PMF) for the inter-arrival time rounded down. This PMF is continuously updated by the control logic means  180  in order to reflect packet inter-arrival times. An estimate of this PMF p τ (m) for m=0, 1, . . . , M can be derived in accordance with the following. 
         [0023]    Let m denote the integer number of packet times that has elapsed since the last packet was received, wherein a packet time is the duration of audio produced from data carried by a packet. (For example, if the packet time is 20 ms and the last packet arrived 50 ms ago, then m=2, since two entire packet times have elapsed.) 
         [0024]    The inter-arrival time statistics are stored in a vector p=[p(0) p(1) . . . p(M)] with M+1 elements. The first element p(0) represents the probability of observing a packet inter-arrival time larger than or equal to 0 but smaller than 1, p(1) represents inter-arrival times between 1 and 2, and so on. The last element, p(1), represents the probability of observing an inter-arrival time larger than or equal to M. All times are given as packet times. Upon observing a given inter-arrival time, the corresponding element in the vector p is increased towards 1, while the remaining elements are decreased. The increasing and decreasing is governed by a forgetting factor μ, which is a design variable. The following steps constitute the statistics update method:
       1. When receiving a new packet, count the number of packet times elapsed since the last packet was received. Denote this number m.   2. Apply upper limit M on the measured time: if m&gt;M, let m=M.   3. Increase the statistics vector element corresponding to the currently measured time: let the m:th element p(m) be updated to p(m)+(1−μ).   4. Decrease the remaining statistics vector elements: multiply each element (except p(m)) with the factor μ.
 
The vector p will be a constantly evolving estimate of the packet inter-arrival time probability density function (PDF), and should by construction sum up to 1. The PDF estimate indicates what the network conditions are.
       
 
         [0029]    The purpose of estimating the inter-arrival time statistics is to calculate a buffer level suitable for the current network conditions. If the network conditions are fair, the probability of observing very long periods between arriving packets is small, and a low buffer level is appropriate. If, on the contrary, the same probability is high, the number of packets in the buffer should be kept higher in order to be prepared for long periods without incoming packets. 
         [0030]    Determining a suitable buffer level is a trade-off between low internal delay at the receiver and robustness against network jitter, as these two requirements are contradictory. The internal delay is simply the buffer level B. A measure of the robustness against network jitter is the duration of a buffer underflow, i.e., the expected duration of an empty jitter buffer given buffer level B. In this context, B is any arbitrary buffer level. 
         [0031]    In step  240  an expected duration of an empty jitter buffer is defined by the control logic means  180 . Assuming an arbitrary buffer level B, i.e., B packets are in the jitter buffer, an underflow occurs if we have decoded and used all B packets before the next packet arrives. In other words, if the inter-arrival time between the last received packet and the next packet is larger than B·T frame  seconds, where T frame  is the length of the audio data carried in each packet, a buffer underflow occurs. The probability of an underflow, given that we have B packets in the buffer, can be expressed in the PDF f τ (t) as 
         [0000]    
       
         
           
             
               Pr 
                
               
                   
               
                
               
                 { 
                 
                   underflow 
                   | 
                   B 
                 
                 } 
               
             
             = 
             
               
                 ∫ 
                 B 
                 ∞ 
               
                
               
                 
                   
                     f 
                     τ 
                   
                    
                   
                     ( 
                     t 
                     ) 
                   
                 
                  
                 
                    
                   t 
                 
               
             
           
         
       
     
         [0000]    Similarly, the expected length of an underflow, i.e., roughly the length of the concealment data that must be produced, can be written as 
         [0000]    
       
         
           
             
               E 
                
               
                 [ 
                 
                   
                     length 
                      
                     
                         
                     
                      
                     
                       ( 
                       underflow 
                       ) 
                     
                   
                   | 
                   B 
                 
                 ] 
               
             
             = 
             
               
                 ∫ 
                 B 
                 ∞ 
               
                
               
                 
                   ( 
                   
                     t 
                     - 
                     B 
                   
                   ) 
                 
                  
                 
                   
                     f 
                     τ 
                   
                    
                   
                     ( 
                     t 
                     ) 
                   
                 
                  
                 
                    
                   t 
                 
               
             
           
         
       
     
         [0000]    Thus, the above equation defines the expected duration of an empty jitter buffer given a buffer level B. 
         [0032]    As discussed above, determining a suitable buffer level is a trade-off between low internal delay at the receiver and robustness against network jitter in terms of a low expected duration of an empty jitter buffer. The combination of these two quantities forms the basis of an optimization problem that needs to be solved. 
         [0033]    Therefore, in step  250 , the control logic means  180  is configured to define and make use of a cost function in which these two quantities are weighted and combined. Typically, the cost function corresponds to a function, e.g., a sum, of the expected duration of an empty jitter buffer and a jitter buffer delay at buffer level B. 
         [0000]    
       
         
           
             
               η 
                
               
                 ( 
                 B 
                 ) 
               
             
             = 
             
               
                 
                   C 
                   · 
                   B 
                 
                 + 
                 
                   E 
                    
                   
                     [ 
                     
                       
                         length 
                          
                         
                             
                         
                          
                         
                           ( 
                           underflow 
                           ) 
                         
                       
                       | 
                       B 
                     
                     ] 
                   
                 
               
               = 
               
                 
                   C 
                   · 
                   B 
                 
                 + 
                 
                   
                     ∫ 
                     B 
                     ∞ 
                   
                    
                   
                     
                       ( 
                       
                         t 
                         - 
                         B 
                       
                       ) 
                     
                      
                     
                       
                         f 
                         τ 
                       
                        
                       
                         ( 
                         t 
                         ) 
                       
                     
                      
                     
                        
                       t 
                     
                   
                 
               
             
           
         
       
     
         [0000]    The parameter C is a weighting factor which sets the relative importance of the two quantities. A large C will punish a large internal buffer delay harder while a small C will punish severe buffer underflows. The goal is to find the B that minimizes the cost function. 
         [0034]    In step  260  the control logic means  180  minimizes the cost function with regard to buffer level B to thereby derive a target buffer level. Analytically this is performed in accordance with the following. 
         [0035]    Deriving the target buffer level starts with differentiating η(B) with respect to B and equating the result to zero: 
         [0000]    
       
         
           
             
               
                  
                 
                    
                   B 
                 
               
                
               
                 η 
                  
                 
                   ( 
                   B 
                   ) 
                 
               
             
             = 
             
               
                 
                   C 
                   - 
                   
                     
                       ∫ 
                       B 
                       ∞ 
                     
                      
                     
                       
                         
                           f 
                           τ 
                         
                          
                         
                           ( 
                           t 
                           ) 
                         
                       
                        
                       
                          
                         t 
                       
                     
                   
                 
                 ≡ 
                 
                   
                     ∫ 
                     
                       B 
                       * 
                     
                     ∞ 
                   
                    
                   
                     
                       
                         f 
                         τ 
                       
                        
                       
                         ( 
                         t 
                         ) 
                       
                     
                      
                     
                        
                       t 
                     
                   
                 
               
               = 
               
                 C 
                 . 
               
             
           
         
       
     
         [0000]    That is, the value B* for which the integral of f τ (t) from B* to infinity is equal to C is an extreme value of the cost function η(B). The optimum is unique and well defined for all 0&lt;C&lt;1, since f τ (t)≧0 and integrates to 1. Furthermore, differentiating η(B) a second time yields a positive result, indicating that η(B) is a convex function with one unique minimum. 
         [0036]    The above result is given using the continuous function f τ (t), while the available statistics in the implemented method is the discretized version p τ (m). Hence, we must re-write the above optimality criterion in terms of the discretized statistics. First, we use the fact that 
         [0000]    
       
         
           
             
               
                 ∫ 
                 0 
                 ∞ 
               
                
               
                 
                   
                     f 
                     τ 
                   
                    
                   
                     ( 
                     t 
                     ) 
                   
                 
                  
                 
                    
                   t 
                 
               
             
             = 
             
               
                 1 
                 ⇔ 
                 
                   
                     ∫ 
                     
                       B 
                       * 
                     
                     ∞ 
                   
                    
                   
                     
                       
                         f 
                         τ 
                       
                        
                       
                         ( 
                         t 
                         ) 
                       
                     
                      
                     
                        
                       t 
                     
                   
                 
               
               = 
               
                 1 
                 - 
                 
                   
                     ∫ 
                     0 
                     
                       B 
                       * 
                     
                   
                    
                   
                     
                       
                         f 
                         τ 
                       
                        
                       
                         ( 
                         t 
                         ) 
                       
                     
                      
                     
                        
                       t 
                     
                   
                 
               
             
           
         
       
     
         [0000]    to write the optimality criterion as 
         [0000]    
       
         
           
             
               1 
               - 
               
                 
                   ∫ 
                   0 
                   
                     B 
                     * 
                   
                 
                  
                 
                   
                     
                       f 
                       τ 
                     
                      
                     
                       ( 
                       t 
                       ) 
                     
                   
                    
                   
                      
                     t 
                   
                 
               
             
             = 
             
               C 
               . 
             
           
         
       
     
         [0000]    Now, since 
         [0000]    
       
         
           
             
               
                 
                   p 
                   τ 
                 
                  
                 
                   ( 
                   m 
                   ) 
                 
               
               = 
               
                 
                   Pr 
                    
                   
                     { 
                     
                       m 
                       ≤ 
                       τ 
                       &lt; 
                       
                         m 
                         + 
                         1 
                       
                     
                     } 
                   
                 
                 = 
                 
                   
                     ∫ 
                     m 
                     
                       m 
                       + 
                       1 
                     
                   
                    
                   
                     
                       
                         f 
                         τ 
                       
                        
                       
                         ( 
                         t 
                         ) 
                       
                     
                      
                     
                        
                       t 
                     
                   
                 
               
             
             , 
           
         
       
     
         [0000]    the integral of f τ (t) from 0 to B* can be expressed as 
         [0000]    
       
         
           
             
               
                 
                   ∫ 
                   0 
                   
                     B 
                     * 
                   
                 
                  
                 
                   
                     
                       f 
                       τ 
                     
                      
                     
                       ( 
                       t 
                       ) 
                     
                   
                    
                   
                      
                     t 
                   
                 
               
               = 
               
                 
                   ∑ 
                   
                     m 
                     = 
                     0 
                   
                   
                     
                       B 
                       * 
                     
                     - 
                     1 
                   
                 
                  
                 
                   
                     p 
                     τ 
                   
                    
                   
                     ( 
                     m 
                     ) 
                   
                 
               
             
             , 
           
         
       
     
         [0000]    but only when B* is an integer value. For non-integer values it holds that 
         [0000]    
       
         
           
             
               
                 ∑ 
                 
                   m 
                   = 
                   0 
                 
                 
                   
                     B 
                     * 
                   
                   - 
                   1 
                 
               
                
               
                 
                   p 
                   τ 
                 
                  
                 
                   ( 
                   m 
                   ) 
                 
               
             
             &lt; 
             
               
                 ∫ 
                 0 
                 
                   B 
                   * 
                 
               
                
               
                 
                   
                     f 
                     τ 
                   
                    
                   
                     ( 
                     t 
                     ) 
                   
                 
                  
                 
                    
                   t 
                 
               
             
             &lt; 
             
               
                 ∑ 
                 
                   m 
                   = 
                   0 
                 
                 
                   B 
                   * 
                 
               
                
               
                 
                   p 
                   τ 
                 
                  
                 
                   ( 
                   m 
                   ) 
                 
               
             
           
         
       
     
         [0000]    Thus, we cannot expect to find a B* for which 1 minus the sum is exactly C, as stipulated in the optimality criterion. Therefore, we define that the target buffer level is the smallest B such that 1 minus the sum of p τ (0), p τ (1), . . . , p τ (B) is smaller than or equal to C. This can be expressed as 
         [0000]    
       
         
           
             
               B 
               * 
             
             = 
             
               arg 
                
               
                   
               
                
               
                 
                   min 
                   B 
                 
                  
                 
                     
                 
                  
                 
                   
                     { 
                     
                       
                         
                           B 
                            
                           
                             : 
                           
                            
                           
                               
                           
                            
                           1 
                         
                         - 
                         
                           
                             ∑ 
                             
                               m 
                               = 
                               0 
                             
                             B 
                           
                            
                           
                             
                               p 
                               τ 
                             
                              
                             
                               ( 
                               m 
                               ) 
                             
                           
                         
                       
                       ≤ 
                       C 
                     
                     } 
                   
                   . 
                 
               
             
           
         
       
     
         [0000]    (The formula could be equivalently formulated as a sum going backwards from the last element P τ (M) towards the first element.) 
         [0037]    Thus, step  260  in  FIG. 2  concerns solving the above last expression to derive B*. One way to implement step  260  is by the following calculation steps 5-8 (being subsequent to steps 1-4 of the statistics update method described above). In the below steps, C denotes the weighting factor.
       5. Set a variable S to 1.   6. Initialize a variable B to 0.   7. Subtract the statistics vector element p(B) from S: S:=S−p(B)   8. While S&gt;C and B&lt;M, increase B with one and return to step 7. Otherwise, use the value of B as the target buffer level B*.       
 
         [0042]    According to an advantageous embodiment, the control logic means in step  270  compare the target buffer level with a current buffer level of the jitter buffer  150 . According to one embodiment, the target buffer level B* is compared with a filtered version B f  of the current buffer level, rather than with the instantaneous buffer level B. This is done because the instantaneous buffer level has an intrinsic variation that it is preferred not to respond to immediately. 
         [0043]    The current buffer level is influenced by three processes:
       Packets coming in to the buffer from the network;   Packets taken out of the buffer for decoding and playout;   Buffer level modifications because of active decisions to reduce or increase the buffer level (these decisions are further discussed below).
 
The first two processes are considered to be of a stochastic nature, and should preferably be smoothed. The last process consists of deliberate and known buffer level modifications, and these should preferably influence the filtered buffer level immediately, without filtering.
       
 
         [0047]    The smoothing is performed by a buffer level low pass filter implemented by the control logic means  180 , e.g. a filter as depicted in the  FIG. 3 . According to an embodiment of the filter, use is made of an exponential window in the form of an IIR (infinite impulse response) filter with exponentially decaying impulse response. In the  FIG. 3 , B(n) is the current buffer level at time n as reported by the jitter buffer  150 , B f (n) is the filtered buffer level at time n, D is a one-step delay block, ΔB(n−1) is the active buffer level modifications done since the last filter update (positive for level increase and negative for level decrease). The factor v is the filter coefficient, determining the response of the filter. 
         [0048]    The filter coefficient v is made adaptive in this exemplary implementation, motivated by the following argument. In a network scenario with large variance in packet inter-arrival times, the natural fluctuations in the instantaneous buffer level are larger, and a larger v is desired in order to increase noise resistance. When the network conditions are better, a smaller v can be applied to improve response time. The optimal buffer level B* is an indicator of the current network conditions: a larger B* implies larger variance in inter-arrival times, and should result in a larger filter coefficient v, and vice versa. 
         [0049]    The filter process is performed by the control logic means  180  each time audio is played out and is summarized in the following steps 9-14 (being subsequent to the calculation steps 5-8 described above):
       9. Calculate filter coefficient v based on optimal buffer level B*:       
 
         [0000]    
       
         
           
             ν 
             = 
             
               { 
               
                 
                   
                     
                       
                         250 
                         / 
                         256 
                       
                       , 
                     
                   
                   
                     
                       
                         
                           B 
                           * 
                         
                         = 
                         0 
                       
                       ; 
                     
                   
                 
                 
                   
                     
                       
                         251 
                         / 
                         256 
                       
                       , 
                     
                   
                   
                     
                       
                         
                           B 
                           * 
                         
                         = 
                         1 
                       
                       ; 
                     
                   
                 
                 
                   
                     
                       
                         252 
                         / 
                         256 
                       
                       , 
                     
                   
                   
                     
                       
                         2 
                         ≤ 
                         
                           B 
                           * 
                         
                         ≤ 
                         3 
                       
                       ; 
                     
                   
                 
                 
                   
                     
                       
                         253 
                         / 
                         256 
                       
                       , 
                     
                   
                   
                     
                       
                         4 
                         ≤ 
                         
                           B 
                           * 
                         
                         ≤ 
                         7 
                       
                       ; 
                     
                   
                 
                 
                   
                     
                       
                         254 
                         / 
                         256 
                       
                       , 
                     
                   
                   
                     
                       
                         B 
                         * 
                       
                       ≥ 
                       8. 
                     
                   
                 
               
             
           
         
       
       
         
           
             10. Measure the current number of packets B in the jitter buffer (possibly a fraction of packets). Multiply this level with 1−v. 
             11. Add to this product the filtered buffer level from the previous filter update multiplied with the filter coefficient v. 
             12 Add the amount of data (possibly a fraction of packets) inserted into the jitter buffer through active jitter buffer expansion to the above sum. 
             13. Subtract the amount of data (possibly a fraction of packets) removed from the jitter buffer through active jitter buffer reduction from the above sum. 
             14. The result is the new filtered buffer level. 
           
         
       
     
         [0056]    Thus, after calculating the target buffer level, and possibly the filtered buffer level, the control logic means  180  compare the target buffer level and the current, or current filtered, buffer level to make a decision regarding any signaling that the current buffer level should be modified in the direction of the target buffer level. The comparison and resulting signaling is quite straightforward and is described with the subsequent steps 15 and 16:
       15. If the (filtered) current buffer level is sufficiently larger than the target buffer level, then signal that data in the buffer should be reduced. Preferably, signaling that data in the buffer should be reduced is made if B f &gt;a·B*, where a is a parameter larger than or equal to 1.   16. If the (filtered) current buffer level is sufficiently smaller than the target buffer level, then signal that data in the buffer should be increased. Preferably, signaling that data in the buffer should be increased is made if B f &lt;b·B*, where b is a parameter smaller than or equal to 1.
 
The parameters a and b define a tolerance window around the target buffer level B*. If the current level is within this window, no buffer level adjustment, i.e. no signaling, is necessary. The signaling that data in the buffer should be reduced or increased is made from the control logic means  180  to the decoder  160  or to the audio buffer  170 . In response to the signaling, the decoder  160  or the audio buffer  170  will modify the length of decoded signal sample information. This will result in a change of packet demand by the decoder  160  from the jitter buffer  150 , i.e. it will increase or reduce the frequency with which packets are read from the jitter buffer  150 , thereby reducing or increasing the buffer level. The actual implementation of how to reduce or increase the buffer level is, however, beyond the scope of this invention. For a detailed description of such an implementation, reference is made to EP 1 243 090.