Abstract:
There are two representations for Higher Order Ambisonics denoted HOA: spatial domain and coefficient domain. The invention generates from a coefficient domain representation a mixed spatial/coefficient domain representation, wherein the number of said HOA signals can be variable. A vector of coefficient domain signals is separated into a vector of coefficient domain signals having a constant number of HOA coefficients and a vector of coefficient domain signals having a variable number of HOA coefficients. The constant-number HOA coefficients vector is transformed to a corresponding spatial domain signal vector. In order to facilitate high-quality coding, without creating signal discontinuities the variable-number HOA coefficients vector of coefficient domain signals is adaptively normalised and multiplexed with the vector of spatial domain signals.

Description:
TECHNICAL FIELD 
       [0001]    The invention relates to a method and to an apparatus for generating from a coefficient domain representation of HOA signals a mixed spatial/coefficient domain representation of said HOA signals, wherein the number of the HOA signals can be variable. 
       BACKGROUND 
       [0002]    Higher Order Ambisonics denoted HOA is a mathematical description of a two- or three-dimensional sound field. The sound field may be captured by a microphone array, designed from synthetic sound sources, or it is a combination of both. HOA can be used as a transport format for two- or three-dimensional surround sound. In contrast to loudspeaker-based surround sound representations, an advantage of HOA is the reproduction of the sound field on different loudspeaker arrangements. Therefore, HOA is suited for a universal audio format. 
         [0003]    The spatial resolution of HOA is determined by the HOA order. This order defines the number of HOA signals that are describing the sound field. There are two representations for HOA, which are called the spatial domain and the coefficient domain, respectively. In most cases HOA is originally represented in the coefficient domain, and such representation can be converted to the spatial domain by a matrix multiplication (or transform) as described in EP 2469742 A2. The spatial domain consists of the same number of signals as the coefficient domain. However, in spatial domain each signal is related to a direction, where the directions are uniformly distributed on the unit sphere. This facilitates analysing of the spatial distribution of the HOA representation. Coefficient domain representations as well as spatial domain representations are time domain representations. 
       SUMMARY OF INVENTION 
       [0004]    In the following, basically, the aim is to use for PCM transmission of HOA representations as far as possible the spatial domain in order to provide an identical dynamic range for each direction. This means that the PCM samples of the HOA signals in the spatial domain have to be normalised to a pre-defined value range. However, a drawback of such normalisation is that the dynamic range of the HOA signals in the spatial domain is smaller than in the coefficient domain. This is caused by the transform matrix that generates the spatial domain signal from the coefficient domain signals. 
         [0005]    In some applications HOA signals are transmitted in the coefficient domain, for example in the processing described in EP 13305558.2 in which all signals are transmitted in the coefficient domain because a constant number of HOA signals and a variable number of extra HOA signals are to be transmitted. But, as mentioned above and shown EP 2469742 A2, a transmission in the coefficient domain is not beneficial. As a solution, the constant number of HOA signals can be transmitted in the spatial domain and only the extra HOA signals with variable number are transmitted in the coefficient domain. A transmission of the extra HOA signals in the spatial domain is not possible since a time-variant number of HOA signals would result in time-variant coefficient-to-spatial domain transform matrices, and discontinuities, which are suboptimal for a subsequent perceptual coding of the PCM signals, could occur in all spatial domain signals. 
         [0006]    To ensure the transmission of these extra HOA signals without exceeding a pre-defined value range, an invertible normalisation processing can be used that is designed to prevent such signal discontinuities, and that also achieves an efficient transmission of the inversion parameters. 
         [0007]    Regarding the dynamic range of the two HOA representations and normalisation of HOA signals for PCM coding, it is derived in the following whether such normalisation should take place in coefficient domain or in spatial domain. 
         [0008]    In the coefficient time domain, the HOA representation consists of successive frames of N coefficient signals d n (k), n=0, . . . , N−1, where k denotes the sample index and n denotes the signal index. 
         [0009]    These coefficient signals are collected in a vector d(k)=[d 0 (k), . . . , d N-1 (k)] T  in order to obtain a compact representation. 
         [0010]    Transformation to spatial domain is performed by the N×N transform matrix 
         [0000]    
       
         
           
             Ψ 
             = 
             
               [ 
               
                 
                   
                     
                       ψ 
                       
                         0 
                         , 
                         0 
                       
                     
                   
                   
                     … 
                   
                   
                     
                       ψ 
                       
                         0 
                         , 
                         
                           N 
                           - 
                           1 
                         
                       
                     
                   
                 
                 
                   
                     ⋮ 
                   
                   
                     ⋱ 
                   
                   
                     ⋮ 
                   
                 
                 
                   
                     
                       ψ 
                       
                         
                           N 
                           - 
                           1 
                         
                         , 
                         0 
                       
                     
                   
                   
                     … 
                   
                   
                     
                       ψ 
                       
                         
                           N 
                           - 
                           1 
                         
                         , 
                         
                           N 
                           - 
                           1 
                         
                       
                     
                   
                 
               
               ] 
             
           
         
       
     
         [0000]    as defined in EP 12306569.0, see the definition of Ξ GRID  in connection with equations (21) and (22). 
         [0011]    The spatial domain vector w(k)=[w 0 (k) . . . w N-1 (k)] T  is obtained from 
         [0000]        w ( k )=Ψ −1   d ( k ),  (1)
 
         [0000]    where Ψ −1  is the inverse of matrix Ψ. 
         [0012]    The inverse transformation from spatial to coefficient domain is performed by 
         [0000]        d ( k )=Ψ w ( k ).  (2)
 
         [0013]    If the value range of the samples is defined in one domain, then the transform matrix Ψ automatically defines the value range of the other domain. The term (k) for the k-th sample is omitted in the following. 
         [0014]    Because the HOA representation is actually reproduced in spatial domain, the value range, the loudness and the dynamic range are defined in this domain. The dynamic range is defined by the bit resolution of the PCM coding. In this application, ‘PCM coding’ means a conversion of floating point representation samples into integer representation samples in fix-point notation. 
         [0015]    For the PCM coding of the HOA representation, the N spatial domain signals have to be normalised to the value range of −1≦w n &lt;1 so that they can be up-scaled to the maximum PCM value W max  and rounded to the fix-point integer PCM notation 
         [0000]        w′   n   =└w   n   W   max ┘.  (3)
 
         [0016]    Remark: this is a generalised PCM coding representation. The value range for the samples of the coefficient domain can be computed by the infinity norm of matrix Ψ, which is defined by 
         [0000]      ∥Ψ∥ ∞ =max n Σ m=1   N =|ψ nm |,  (4)
 
         [0000]    and the maximum absolute value in the spatial domain w max =1 to −∥Ψ∥ ∞ w max ≦d n &lt;∥Ψ∥ ∞ w max . Since the value of ∥Ψ∥ ∞  is greater than ‘1’ for the used definition of matrix P, the value range of d n  increases. 
         [0017]    The reverse means that normalisation by ∥Ψ∥ ∞  is required for a PCM coding of the signals in the coefficient domain since −1≦d n /∥Ψ∥ ∞ &lt;1. However, this normalisation reduces the dynamic range of the signals in coefficient domain, which would result in a lower signal-to-quantisation-noise ratio. Therefore a PCM coding of the spatial domain signals should be preferred. 
         [0018]    A problem to be solved by the invention is how to transmit part of spatial domain desired HOA signals in coefficient domain using normalisation, without reducing the dynamic range in the coefficient domain. Further, the normalised signals shall not contain signal level jumps such that they can be perceptually coded without jump-caused loss of quality. This problem is solved by the methods disclosed in claims  1  and  6 . Apparatuses that utilise these methods are disclosed in claims  2  and  7 , respectively. 
         [0019]    In principle, the inventive generating method is suited for generating from a coefficient domain representation of HOA signals a mixed spatial/coefficient domain representation of said HOA signals, wherein the number of said HOA signals can be variable over time in successive coefficient frames, said method including the steps:
       separating a vector of HOA coefficient domain signals into a first vector of coefficient domain signals having a constant number of HOA coefficients and a second vector of coefficient domain signals having over time a variable number of HOA coefficients;   transforming said first vector of coefficient domain signals to a corresponding vector of spatial domain signals by multiplying said vector of coefficient domain signals with the inverse of a transform matrix;   PCM encoding said vector of spatial domain signals so as to get a vector of PCM encoded spatial domain signals;   normalising said second vector of coefficient domain signals by a normalisation factor, wherein said normalising is an adaptive normalisation with respect to a current value range of the HOA coefficients of said second vector of coefficient domain signals and in said normalising the available value range for the HOA coefficients of the vector is not exceeded, and in which normalisation a uniformly continuous transition function is applied to the coefficients of a current second vector in order to continuously change the gain within that vector from the gain in a previous second vector to the gain in a following second vector, and which normalisation provides side information for a corresponding decoder-side de-normalisation;   PCM encoding said vector of normalised coefficient domain signals so as to get a vector of PCM encoded and normalised coefficient domain signals;   multiplexing said vector of PCM encoded spatial domain signals and said vector of PCM encoded and normalised coefficient domain signals.       
 
         [0026]    In principle the inventive generating apparatus is suited for generating from a coefficient domain representation of HOA signals a mixed spatial/coefficient domain representation of said HOA signals, wherein the number of said HOA signals can be variable over time in successive coefficient frames, said apparatus including:
       means being adapted for separating a vector of HOA coefficient domain signals into a first vector of coefficient domain signals having a constant number of HOA coefficients and a second vector of coefficient domain signals having over time a variable number of HOA coefficients;   means being adapted for transforming said first vector of coefficient domain signals to a corresponding vector of spatial domain signals by multiplying said vector of coefficient domain signals with the inverse of a transform matrix;   means being adapted for PCM encoding said vector of spatial domain signals so as to get a vector of PCM encoded spatial domain signals;   means being adapted for normalising said second vector of coefficient domain signals by a normalisation factor, wherein said normalising is an adaptive normalisation with respect to a current value range of the HOA coefficients of said second vector of coefficient domain signals and in said normalising the available value range for the HOA coefficients of the vector is not exceeded, and in which normalisation a uniformly continuous transition function is applied to the coefficients of a current second vector in order to continuously change the gain within that vector from the gain in a previous second vector to the gain in a following second vector, and which normalisation provides side information for a corresponding decoder-side de-normalisation;   means being adapted for PCM encoding said vector of normalised coefficient domain signals so as to get a vector of PCM encoded and normalised coefficient domain signals;   means being adapted for multiplexing said vector of PCM encoded spatial domain signals and said vector of PCM encoded and normalised coefficient domain signals.       
 
         [0033]    In principle, the inventive decoding method is suited for decoding a mixed spatial/coefficient domain representation of coded HOA signals, wherein the number of said HOA signals can be variable over time in successive coefficient frames and wherein said mixed spatial/coefficient domain representation of coded HOA signals was generated according to the above inventive generating method, said decoding including the steps:
       de-multiplexing said multiplexed vectors of PCM encoded spatial domain signals and PCM encoded and normalised coefficient domain signals;   transforming said vector of PCM encoded spatial domain signals to a corresponding vector of coefficient domain signals by multiplying said vector of PCM encoded spatial domain signals with said transform matrix;   de-normalising said vector of PCM encoded and normalised coefficient domain signals, wherein said de-normalising includes:
           computing, using a corresponding exponent e n (j−1) of the side information received and a recursively computed gain value g n (j−2), a transition vector h n (j−1), wherein the gain value g n (j−1) for the corresponding processing of a following vector of the PCM encoded and normalised coefficient domain signals to be processed is kept, j being a running index of an input matrix of HOA signal vectors;   applying the corresponding inverse gain value to a current vector of the PCM-coded and normalised signal so as to get a corresponding vector of the PCM-coded and de-normalised signal;   
           combining said vector of coefficient domain signals and the vector of de-normalised coefficient domain signals so as to get a combined vector of HOA coefficient domain signals that can have a variable number of HOA coefficients.       
 
         [0040]    In principle the inventive decoding apparatus is suited for decoding a mixed spatial/coefficient domain representation of coded HOA signals, wherein the number of said HOA signals can be variable over time in successive coefficient frames and wherein said mixed spatial/coefficient domain representation of coded HOA signals was generated according to the above inventive generating method, said decoding apparatus including:
       means being adapted for de-multiplexing said multiplexed vectors of PCM encoded spatial domain signals and PCM encoded and normalised coefficient domain signals;   means being adapted for transforming said vector of PCM encoded spatial domain signals to a corresponding vector of coefficient domain signals by multiplying said vector of PCM encoded spatial domain signals with said transform matrix;   means being adapted for de-normalising said vector of PCM encoded and normalised coefficient domain signals, wherein said de-normalising includes:
           computing, using a corresponding exponent e n (j−1) of the side information received and a recursively computed gain value g n (j−2), a transition vector h n (j−1), wherein the gain value g n (j−1) for the corresponding processing of a following vector of the PCM encoded and normalised coefficient domain signals to be processed is kept, j being a running index of an input matrix of HOA signal vectors;   applying the corresponding inverse gain value to a current vector of the PCM-coded and normalised signal so as to get a corresponding vector of the PCM-coded and de-normalised signal;   
           means being adapted for combining said vector of coefficient domain signals and the vector of de-normalised coefficient domain signals so as to get a combined vector of HOA coefficient domain signals that can have a variable number of HOA coefficients.       
 
         [0047]    Advantageous additional embodiments of the invention are disclosed in the respective dependent claims. 
     
    
     
       BRIEF DESCRIPTION OF DRAWINGS 
         [0048]    Exemplary embodiments of the invention are described with reference to the accompanying drawings, which show in: 
           [0049]      FIG. 1  PCM transmission of an original coefficient domain HOA representation in spatial domain; 
           [0050]      FIG. 2  Combined transmission of the HOA representation in coefficient and spatial domains; 
           [0051]      FIG. 3  Combined transmission of the HOA representation in coefficient and spatial domains using block-wise adaptive normalisation for the signals in coefficient domain; 
           [0052]      FIG. 4  Adaptive normalisation processing for an HOA signal x n (j) represented in coefficient domain; 
           [0053]      FIG. 5  A transition function used for a smooth transition between two different gain values; 
           [0054]      FIG. 6  Adaptive de-normalisation processing; 
           [0055]      FIG. 7  FFT frequency spectrum of the transition functions h n (l) using different exponents e n , wherein the maximum amplitude of each function is normalised to 0 dB; 
           [0056]      FIG. 8  Example transition functions for three successive signal vectors. 
       
    
    
     DESCRIPTION OF EMBODIMENTS 
       [0057]    Regarding the PCM coding of an HOA representation in the spatial domain, it is assumed that (in floating point representation) −1≦w n &lt;1 is fulfilled so that the PCM transmission of an HOA representation can be performed as shown in  FIG. 1 . A converter step or stage  11  at the input of an HOA encoder transforms the coefficient domain signal d of a current input signal frame to the spatial domain signal w using equation (1). The PCM coding step or stage  12  converts the floating point samples w to the PCM coded integer samples w′ in fix-point notation using equation (3). In multiplexer step or stage  13  the samples w′ are multiplexed into an HOA transmission format. 
         [0058]    The HOA decoder de-multiplexes the signals w′ from the received transmission HOA format in de-multiplexer step or stage  14 , and re-transforms them in step or stage  15  to the coefficient domain signals d′ using equation (2). This inverse transform increases the dynamic range of d′ so that the transform from spatial domain to coefficient domain always includes a format conversion from integer (PCM) to floating point. 
         [0059]    The standard HOA transmission of  FIG. 1  will fail if matrix Ψ is time-variant, which is the case if the number or the index of the HOA signals is time-variant for successive HOA coefficient sequences, i.e. successive input signal frames. As mentioned above, one example for such case is the HOA compression processing described in EP 13305558.2: a constant number of HOA signals is transmitted continuously and a variable number of HOA signals with changing signal indices n is transmitted in parallel. All signals are transmitted in the coefficient domain, which is suboptimal as explained above. According to the invention, the processing described in connection with  FIG. 1  is extended as shown in  FIG. 2 . 
         [0060]    In step or stage  20 , the HOA encoder separates the HOA vector d into two vectors d 1  and d 2 , where the number M of HOA coefficients for the vector d 1  is constant and the vector d 2  contains a variable number K of HOA coefficients. Because the signal indices n are time-invariant for the vector d 1 , the PCM coding is performed in spatial domain in steps or stages  21 ,  22 ,  23 ,  24  and  25  with signals corresponding w 1  and w 1 ′ shown in the lower signal path of  FIG. 2 , corresponding to steps/stages  11  to  15  of  FIG. 1 . However, multiplexer step/stage  23  gets an additional input signal d 2 ″ and de-multiplexer step/stage  24  in the HOA decoder provides a different output signal d 2 ″. 
         [0061]    The number of HOA coefficients, or the size, K of the vector d 2  is time-variant and the indices of the transmitted HOA signals n can change over time. This prevents a transmission in spatial domain because a time-variant transform matrix would be required, which would result in signal discontinuities in all perceptually encoded HOA signals (a perceptual coding step or stage is not depicted). But such signal discontinuities should be avoided because they would reduce the quality of the perceptual coding of the transmitted signals. Thus, d 2  is to be transmitted in coefficient domain. Due to the greater value range of the signals in coefficient domain, the signals are to be scaled in step or stage  26  by factor 1/∥Ψ∥ ∞  before PCM coding can be applied in step or stage  27 . However, a drawback of such scaling is that the maximum absolute value of ∥Ψ∥ ∞  is a worst-case estimate, which maximum absolute sample value will not occur very frequently because a normally to be expected value range is smaller. As a result, the available resolution for the PCM coding is not used efficiently and the signal-to-quantisation-noise ratio is low. 
         [0062]    The output signal d 2 ″ of de-multiplexer step/stage  24  is inversely scaled in step or stage  28  using factor ∥Ψ∥ ∞ . The resulting signal d 2 ′″ is combined in step or stage  29  with signal d 1 ′, resulting in decoded coefficient domain HOA signal d′. 
         [0063]    According to the invention, the efficiency of the PCM coding in coefficient domain can be increased by using a signal-adaptive normalisation of the signals. However, such normalisation has to be invertible and uniformly continuous from sample to sample. The required block-wise adaptive processing is shown in  FIG. 3 . The j-th input matrix D(j)=[d(jL+0) . . . d(jL+L−1)] comprises L HOA signal vectors d (index j is not depicted in  FIG. 3 ). Matrix D is separated into the two matrixes D 1  and D 2  like in the processing in  FIG. 2 . The processing of D 1  in steps or stages  31  to  35  corresponds to the processing in the spatial domain described in connection with  FIG. 2  and  FIG. 1 . But the coding of the coefficient domain signal includes a block-wise adaptive normalisation step or stage  36  that automatically adapts to the current value range of the signal, followed by the PCM coding step or stage  37 . The required side information for the de-normalisation of each PCM coded signal in matrix D 2 ″ is stored and transferred in a vector e. Vector e=[e n     1    . . . e n     K   ] T  contains one value per signal. The corresponding adaptive de-normalisation step or stage  38  of the decoder at receiving side inverts the normalisation of the signals D 2 ″ to D 2 ′″ using information from the transmitted vector e. The resulting signal D 2 ′″ is combined in step or stage  39  with signal D 1 ′, resulting in decoded coefficient domain HOA signal D′. 
         [0064]    In the adaptive normalisation in step/stage  36 , a uniformly continuous transition function is applied to the samples of the current input coefficient block in order to continuously change the gain from a last input coefficient block to the gain of the next input coefficient block. This kind of processing requires a delay of one block because a change of the normalisation gain has to be detected one input coefficient block ahead. The advantage is that the introduced amplitude modulation is small, so that a perceptual coding of the modulated signal has nearly no impact on the de-normalised signal. 
         [0065]    Regarding implementation of the adaptive normalisation, it is performed independently for each HOA signal of D 2 (j). The signals are represented by the row vectors x n   T  of the matrix 
         [0000]    
       
         
           
             
               
                 
                   D 
                   2 
                 
                  
                 
                   ( 
                   j 
                   ) 
                 
               
               = 
               
                 
                   [ 
                   
                     
                       
                         d 
                         2 
                       
                        
                       
                         ( 
                         
                           
                             j 
                              
                             
                                 
                             
                              
                             L 
                           
                           + 
                           0 
                         
                         ) 
                       
                     
                      
                     
                         
                     
                      
                     … 
                      
                     
                         
                     
                      
                     
                       
                         d 
                         2 
                       
                        
                       
                         ( 
                         
                           
                             j 
                              
                             
                                 
                             
                              
                             L 
                           
                           + 
                           L 
                           - 
                           1 
                         
                         ) 
                       
                     
                   
                   ] 
                 
                 = 
                 
                   [ 
                   
                     
                       
                         
                           
                             x 
                             1 
                             T 
                           
                            
                           
                             ( 
                             j 
                             ) 
                           
                         
                       
                     
                     
                       
                         ⋮ 
                       
                     
                     
                       
                         
                           
                             x 
                             n 
                             T 
                           
                            
                           
                             ( 
                             j 
                             ) 
                           
                         
                       
                     
                     
                       
                         ⋮ 
                       
                     
                     
                       
                         
                           
                             x 
                             K 
                             T 
                           
                            
                           
                             ( 
                             j 
                             ) 
                           
                         
                       
                     
                   
                   ] 
                 
               
             
             , 
           
         
       
     
         [0000]    wherein n denotes the indices of the transmitted HOA signals. x n  is transposed because it originally is a column vector but here a row vector is required. 
         [0066]      FIG. 4  depicts this adaptive normalisation in step/stage  36  in more detail. The input values of the processing are:
       the temporally smoothed maximum value x n,max,sm (j−2),   the gain value g n (j−2), i.e. the gain that has been applied to the last coefficient of the corresponding signal vector block x n (j−2),   the signal vector of the current block x n (j),   the signal vector of the previous block x n (j−1).       
 
         [0071]    When starting the processing of the first block x n (0) the recursive input values are initialised by pre-defined values: the coefficients of vector x n (−1) can be set to zero, gain value g n (−2) should be set to ‘1’, and x n,max,sm (−2) should be set to a pre-defined average amplitude value. 
         [0072]    Thereafter, the gain value of the last block g n (j−1), the corresponding value e n (j−1) of the side information vector e(j−1), the temporally smoothed maximum value x n,max,sm (j−1) and the normalised signal vector x n ′(j−1) are the outputs of the processing. 
         [0073]    The aim of this processing is to continuously change the gain values applied to signal vector x n (j−1) from g n (j−2) to g n (j−1) such that the gain value g n (j−1) normalises the signal vector x n (j) to the appropriate value range. 
         [0074]    In the first processing step or stage  41 , each coefficient of signal vector x n (j)=[x n,0 (j) . . . x n,L-1 (j)] is multiplied by gain value g n (j−2), wherein g n (j−2) was kept from the signal vector x n (j−1) normalisation processing as basis for a new normalisation gain. From the resulting normalised signal vector x n (j) the maximum x n,max  of the absolute values is obtained in step or stage  42  using equation (5): 
         [0000]        x   n,max =max 0≦l&lt;L   |g   n ( j− 2) x   n,l ( j )|  (5)
 
         [0075]    In step or stage  43 , a temporal smoothing is applied to x n,max  using a recursive filter receiving a previous value x n,max,sm (j−2) of said smoothed maximum, and resulting in a current temporally smoothed maximum x n,max,sm (j−1). The purpose of such smoothing is to attenuate the adaptation of the normalisation gain over time, which reduces the number of gain changes and therefore the amplitude modulation of the signal. The temporal smoothing is only applied if the value x n,max  is within a pre-defined value range. Otherwise x n,max,sm (j−1) is set to x n,max  (i.e. the value of x n,max  is kept as it is) because the subsequent processing has to attenuate the actual value of x n,max  to the pre-defined value range. Therefore, the temporal smoothing is only active when the normalisation gain is constant or when the signal x n (j) can be amplified without leaving the value range. x n,max,sm (j−1) is calculated in step/stage  43  as follows: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       x 
                       
                         n 
                         , 
                         max 
                         , 
                         sm 
                       
                     
                      
                     
                       ( 
                       
                         j 
                         - 
                         1 
                       
                       ) 
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                             
                               x 
                               
                                 n 
                                 , 
                                 max 
                               
                             
                           
                           
                             
                               
                                 for 
                                  
                                 
                                     
                                 
                                  
                                 
                                   x 
                                   
                                     n 
                                     , 
                                     max 
                                   
                                 
                               
                               ≥ 
                               1 
                             
                           
                         
                         
                           
                             
                               
                                 
                                   ( 
                                   
                                     1 
                                     - 
                                     a 
                                   
                                   ) 
                                 
                                  
                                 
                                   
                                     x 
                                     
                                       n 
                                       , 
                                       max 
                                       , 
                                       sm 
                                     
                                   
                                    
                                   
                                     ( 
                                     
                                       j 
                                       - 
                                       1 
                                     
                                     ) 
                                   
                                 
                               
                               + 
                               
                                 a 
                                  
                                 
                                     
                                 
                                  
                                 
                                   x 
                                   
                                     n 
                                     , 
                                     max 
                                   
                                 
                               
                             
                           
                           
                             otherwise 
                           
                         
                       
                       , 
                     
                   
                 
               
               
                 
                   ( 
                   6 
                   ) 
                 
               
             
           
         
       
     
         [0000]    wherein 0&lt;a≦1 is the attenuation constant. 
         [0076]    In order to reduce the bit rate for the transmission of vector e, the normalisation gain is computed from the current temporally smoothed maximum value x n,max,sm (j−1) and is transmitted as an exponent to the base of ‘2’. Thus 
         [0000]        x   n,max,sm ( j− 1)2 e     n     (j-1) ≦1  (7)
 
         [0000]    has to be fulfilled and the quantised exponent e n (j−1) is obtained from 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       e 
                       n 
                     
                      
                     
                       ( 
                       
                         j 
                         - 
                         1 
                       
                       ) 
                     
                   
                   = 
                   
                     ⌊ 
                     
                       
                         log 
                         2 
                       
                        
                       
                         1 
                         
                           
                             x 
                             
                               n 
                               , 
                               max 
                               , 
                               sm 
                             
                           
                            
                           
                             ( 
                             
                               j 
                               - 
                               1 
                             
                             ) 
                           
                         
                       
                     
                     ⌋ 
                   
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
           
         
       
     
         [0000]    in step or stage  44 . 
         [0077]    In periods, where the signal is re-amplified (i.e. the value of the total gain is increased over time) in order to exploit the available resolution for efficient PCM coding, the exponent e n (j) can be limited, (and thus the gain difference between successive blocks) to a small maximum value, e.g. ‘1’. This operation has two advantageous effects. On one hand, small gain differences between successive blocks lead to only small amplitude modulations through the transition function, resulting in reduced cross-talk between adjacent sub-bands of the FFT spectrum (see the related description of the impact of the transition function on perceptual coding in connection with  FIG. 7 ). On the other hand, the bit rate for coding the exponent is reduced by constraining its value range. 
         [0078]    The value of the total maximum amplification 
         [0000]        g   n ( j− 1)= g   n ( j− 2)2 e     n     (j-1)   (9)
 
         [0000]    can be limited e.g. to ‘1’. The reason is that, if one of the coefficient signals exhibits a great amplitude change between two successive blocks, of which the first one has very small amplitudes and the second one has the highest possible amplitude (assuming the normalisation of the HOA representation in the spatial domain), very large gain differences between these two blocks will lead to large amplitude modulations through the transition function, resulting in severe cross-talk between adjacent sub-bands of the FFT spectrum. This might be suboptimal for a subsequent perceptual coding a discussed below. 
         [0079]    In step or stage  45 , the exponent value e n (j−1) is applied to a transition function so as to get a current gain value g n (j−1). For a continuous transition from gain value g n (j−2) to gain value g n (j−1) the function depicted in  FIG. 5  is used. The computational rule for that function is 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       f 
                        
                       
                         ( 
                         l 
                         ) 
                       
                     
                     = 
                     
                       
                         0.25 
                          
                         
                             
                         
                          
                         
                           cos 
                            
                           
                             ( 
                             
                               
                                 π 
                                  
                                 
                                     
                                 
                                  
                                 l 
                               
                               
                                 ( 
                                 
                                   L 
                                   - 
                                   1 
                                 
                                 ) 
                               
                             
                             ) 
                           
                         
                       
                       + 
                       0.75 
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   10 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where l=0, 1, 2, . . . ,L−1. The actual transition function vector 
         [0000]        h   n ( j− 1)=[ h   n (0) . . .  h   n ( L− 1)] T    
         [0000]      with 
         [0000]        h   n ( l )= g   n ( j− 2) f ( l ) −e     n     (j-1)   (11)
 
         [0000]    is used for the continuous fade from g n (j−2) to g n (j−1). For each value of e n (j−1) the value of h n (0) is equal to g n (j−2) since f(0)=1. The last value of f(L−1) is equal to 0.5, so that h n (L−1)=g n (j−2)0.5 −e     n     (j-1)  will result in the required amplification g n (j−1) for the normalisation of x n (j) from equation (9). 
         [0080]    In step or stage  46 , the samples of the signal vector x n (j−1) are weighted by the gain values of the transition vector h n (j−1) in order to obtain 
         [0000]        x   n ′( j− 1)= x   n ( j− 1)           h   n ( j− 1),  (12)
 
         [0000]    where the ‘         ’ operator represents a vector element-wise multiplication of two vectors. This multiplication can also be considered as representing an amplitude modulation of the signal x n (j−1). 
         [0081]    In more detail, the coefficients of the transition vector h n (j−1) [h n (0) . . . h n (L−1)] T  are multiplied by the corresponding coefficients of the signal vector x n (j−1), where the value of h n (0) is h n (0)=g n (j−2) and the value of h n (L−1) is h n (L−1)=g n (j−1). Therefore the transition function continuously fades from the gain value g n (j−2) to the gain value g n (j−1) as depicted in the example of  FIG. 8 , which shows gain values from the transition functions h n (j), h n (j−1) and h n (j−2) that are applied to the corresponding signal vectors x n (j), x n (j−1) and x n (j−2) for three successive blocks. The advantage with respect to a downstream perceptual encoding is that at the block borders the applied gains are continuous: The transition function h n (j−1) continuously fades the gains for the coefficients of x n (j−1) from g n (j−2) to g n (j−1). 
         [0082]    The adaptive de-normalisation processing at decoder or receiver side is shown in  FIG. 6 . Input values are the PCM-coded and normalised signal x n ″(j−1), the appropriate exponent e n (j−1), and the gain value of the last block g n (j−2). The gain value of the last block g n (j−2) is computed recursively, where g n (j−2) has to be initialised by a pre-defined value that has also been used in the encoder. The outputs are the gain value g n (j−1) from step/stage  61  and the de-normalised signal x n ′″(j−1) from step/stage  62 . 
         [0083]    In step or stage  61  the exponent is applied to the transition function. To recover the value range of x n (j−1), equation (11) computes the transition vector h n (j−1) from the received exponent e n (j−1), and the recursively computed gain g n (j−2). The gain g n (j−1) for the processing of the next block is set equal to h n (L−1). 
         [0084]    In step or stage  62  the inverse gain is applied. The applied amplitude modulation of the normalisation processing is inverted by 
         [0000]        x   n ′″( j− 1)= x   n ″( j− 1)           h   n ( j− 1) −1 ,  (13)
 
         [0000]    where 
         [0000]    
       
         
           
             
               
                 
                   h 
                   n 
                 
                  
                 
                   ( 
                   
                     j 
                     - 
                     1 
                   
                   ) 
                 
               
               
                 - 
                 1 
               
             
             = 
             
               
                 [ 
                 
                   
                     1 
                     
                       
                         h 
                         n 
                       
                        
                       
                         ( 
                         0 
                         ) 
                       
                     
                   
                    
                   
                       
                   
                    
                   … 
                    
                   
                       
                   
                    
                   
                     1 
                     
                       
                         h 
                         n 
                       
                        
                       
                         ( 
                         
                           L 
                           - 
                           1 
                         
                         ) 
                       
                     
                   
                 
                 ] 
               
               T 
             
           
         
       
     
         [0000]    and ‘         ’ is the vector element-wise multiplication that has been used at encoder or transmitter side. The samples of x n ′(j−1) cannot be represented by the input PCM format of x n ″(j−1) so that the de-normalisation requires a conversion to a format of a greater value range, like for example the floating point format. 
         [0085]    Regarding side information transmission, for the transmission of the exponents e n (j−1) it cannot be assumed that their probability is uniform because the applied normalisation gain would be constant for consecutive blocks of the same value range. Thus entropy coding, like for example Huffman coding, can be applied to the exponent values in order to reduce the required data rate. 
         [0086]    One drawback of the described processing could be the recursive computation of the gain value g n (j−2). Consequently, the de-normalisation processing can only start from the beginning of the HOA stream. 
         [0087]    A solution for this problem is to add access units into the HOA format in order to provide the information for computing g n (j−2) regularly. In this case the access unit has to provide the exponents 
         [0000]        e   n,access =log 2   g   n ( j− 2)  (14)
 
         [0000]    for every t-th block so that g n (j−2)=2 e     n,access    can be computed and the de-normalisation can start at every t-th block. 
         [0088]    The impact on a perceptual coding of the normalised signal x n ″(j−1) is analysed by the absolute value of the frequency response 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       H 
                       n 
                     
                      
                     
                       ( 
                       u 
                       ) 
                     
                   
                   = 
                   
                     
                       ∑ 
                       
                         l 
                         = 
                         0 
                       
                       
                         L 
                         - 
                         1 
                       
                     
                      
                     
                       
                         
                           h 
                           n 
                         
                          
                         
                           ( 
                           l 
                           ) 
                         
                       
                        
                       
                          
                         
                           - 
                           
                             
                               2 
                                
                               π 
                                
                               
                                   
                               
                                
                               lu 
                             
                             
                               L 
                               - 
                               1 
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   15 
                   ) 
                 
               
             
           
         
       
     
         [0000]    of the function h n (l). The frequency response is defined by the Fast Fourier Transform (FFT) of h n (l) as shown in equation (15). 
         [0089]      FIG. 7  shows the normalised (to 0 dB) magnitude FFT spectrum H n (u) in order to clarify the spectral distortion introduced by the amplitude modulation. The decay of |H n (u)| is relatively steep for small exponents and gets flat for greater exponents. 
         [0090]    Since the amplitude modulation of x n (j−1) by h n (l) in time domain is equivalent to a convolution by H n (u) in frequency domain, a steep decay of the frequency response H n (u) reduces the cross-talk between adjacent sub-bands of the FFT spectrum of x n ′(j−1). This is highly relevant for a subsequent perceptual coding of x n ′(j−1) because the sub-band cross-talk has an influence on the estimated perceptual characteristics of the signal. Thus, for a steep decay of H n (u), the perceptual encoding assumptions for x n ′(j−1) are also valid for the un-normalised signal x n (j−1). 
         [0091]    This shows that for small exponents a perceptual coding of x n ′(j−1) is nearly equivalent to the perceptual coding of x n (j−1) and that a perceptual coding of the normalised signal has nearly no effects on the de-normalised signal as long as the magnitude of the exponent is small. 
         [0092]    The inventive processing can be carried out by a single processor or electronic circuit at transmitting side and at receiving side, or by several processors or electronic circuits operating in parallel and/or operating on different parts of the inventive processing.