Abstract:
The invention is suited for improving a low bit rate compressed and decompressed Higher Order Ambisonics HOA signal representation of a sound field, wherein the decompression provides a spatially sparse decoded HOA representation and a set of indices of coefficient sequences of this representation. From reconstructed signals of the original HOA representation a number of modified phase spectra signals are created using de-correlation filters, which modified phase spectra signals are uncorrelated with the signals of said original representation. The modified phase spectra signals are mixed with each other using predetermined mixing parameters, in order to provide a replicated ambient HOA component. Finally the spatially sparse decoded HOA representation is enhanced with the replicated time domain HOA representation.

Description:
TECHNICAL FIELD 
       [0001]    The invention relates to a method and to an apparatus for low bit rate compression of a Higher Order Ambisonics HOA signal representation of a sound field, wherein the HOA signal representation is spatially sparse due to the low bit rate. 
       BACKGROUND 
       [0002]    Higher Order Ambisonics (HOA) offers one possibility to represent three-dimensional sound, among other techniques like wave field synthesis (WFS) or channel based approaches like 22.2. In contrast to channel based methods, however, the HOA representation offers the advantage of being independent of a specific loudspeaker set-up. But this flexibility is at the expense of a decoding process which is required for the playback of the HOA representation on a particular loudspeaker set-up. Compared to the WFS approach, where the number of required loudspeakers is usually very large, HOA may also be rendered to set-ups consisting of only few loud-speakers. A further advantage of HOA is that the same representation can also be employed without any modification for binaural rendering to head-phones. 
         [0003]    HOA is based on the representation of the spatial density of complex harmonic plane wave amplitudes by a truncated Spherical Harmonics (SH) expansion. Each expansion coefficient is a function of angular frequency, which can be equivalently represented by a time domain function. Hence, without loss of generality, the complete HOA sound field representation actually can be assumed to consist of O time domain functions, where O denotes the number of expansion coefficients. These time domain functions will be equivalently referred to as HOA coefficient sequences or as HOA channels in the following. 
         [0004]    The spatial resolution of the HOA representation improves with a growing maximum order N of the expansion. Unfortunately, the number of expansion coefficients O grows quadratically with the order N, in particular O=(N+1) 2 . For example, typical HOA representations using order N=4 require O=25 HOA (expansion) coefficients. According to the previously made considerations, the total bit rate for the transmission of HOA representation, given a desired single-channel sampling rate f S  and the number of bits N b  per sample, is determined by O·f S ·N b . Consequently, transmitting an HOA representation of order N=4 with a sampling rate of f S =48 kHz employing N b =16 bits per sample results in a bit rate of 19.2 MBits/s, which is very high for many practical applications like streaming for example. Thus, compression of HOA representations is highly desirable. 
         [0005]    The compression of HOA sound field representations was proposed in EP 2665208 A1, EP 2743922 A1 and International application PCT/EP2013/059363, cf. ISO/IEC DIS 23008-3, MPEG-H 3D audio, July 2014. These approaches have in common that they perform a sound field analysis and decompose the given HOA representation into a directional and a residual ambient component. The final compressed representation is on one hand assumed to consist of a number of quantised signals, resulting from the perceptual coding of directional and vector-based signals as well as relevant coefficient sequences of the ambient HOA component. On the other hand it is assumed to comprise additional side information related to the quantised signals, which is necessary for the reconstruction of the HOA representation from its compressed version. A reasonable minimum number of quantised signals is ‘8’ for the approaches in EP 2665208 A1, EP 2743922 A1 and International application PCT/EP2013/059363. Hence, the data rate with one of these methods is typically not lower than 256 kbit/s assuming a data rate of 32 kbit/s for each individual perceptual coder. For certain applications, like e.g. the audio streaming to mobile devices, this total data rate might be too high, which makes desirable HOA compression methods for significantly lower data rates, e.g. 128 kbit/s. 
         [0006]    In European patent application EP 14306077.0 a method for the low bit-rate compression of HOA representations of sound fields is described that uses a smaller number of quantised signals, which are basically a small subset of the original HOA representation. For the replication of the missing HOA coefficients, prediction parameters are obtained for different frequency bands in order to predict additional directional HOA components from the quantised signals. 
       SUMMARY OF INVENTION 
       [0007]    In the EP 14306077.0 processing, the reconstructed HOA representation consists of highly correlated components because all HOA components are reconstructed from only a small number of quantised signals. Due to such small number of quantised signals, the prediction of directional HOA components thereof can be unsatisfactory and can lead to the effect that the reconstructed HOA representation is spatially sparse. This can make the sound dry and quieter than in the original HOA representation. Ambient sound fields, which typically consist of spatially uncorrelated signal components, are not reconstructed properly if the number of quantised signals is very small, e.g. ‘1’ or ‘2’. 
         [0008]    A problem to be solved by the invention is to improve low bit-rate compression of HOA representations of sound fields. This problem is solved by the methods disclosed in claims  1  and  8 . Apparatuses that utilise these methods are disclosed in claims  2  and  9 . 
         [0009]    Advantageous additional embodiments of the invention are disclosed in the respective dependent claims. 
         [0010]    The processing described in the following deals with compression of Higher Order Ambisonics representation at low bit rates, and re-creates the ambient sound field components, and it improves the above-described EP 14306077.0 processing in case of a very small number of quantised signals. 
         [0011]    The processing described is called Parametric Ambience Replication (PAR), and it complements a reconstructed, spatially sparse HOA representation by potentially missing ambient components, which are parametrically replicated from itself. The replication is performed by first creating from the signals of the sparse HOA representation (which may include directional signals and an ambient component) a number of new signals with modified phase spectra, thus being uncorrelated with the former signals. Second, the newly created signals are mixed with each other in order to provide a replicated ambient HOA component. The final enhanced HOA representation is computed by the superposition of the original sparse HOA representation and the replicated ambient HOA component. The mixing is carried out so as to match the spatial acoustic properties of the final enhanced HOA representation with that of the original HOA representation. Preferably, the mixing is performed in the frequency domain, offering the possibility to vary between different frequency bands. Assuming the process of creating the uncorrelated signals from the sparse HOA representation to be deterministically specified, the side information for PAR to be included into the compressed HOA representation consists only of the mixing parameters, which are essentially complex-valued mixing matrices. 
         [0012]    One particular method for creating the uncorrelated signals from the sparse HOA representation with the goal to reduce the amount of side information for PAR is to first represent the sparse HOA representations by virtual loudspeaker signals (or equivalently by general plane wave functions) from some predefined directions, which should be distributed on the unit sphere as uniformly as possible. The rendering for creating the virtual loudspeaker signals from the HOA representation is referred to as a spatial transform in the following. Second, for each of these directions one uncorrelated signal is created by modifying the phase spectrum of the corresponding virtual loudspeaker signal of the sparse HOA representation using a de-correlation filter. Third, the replicated ambient HOA component is also represented by virtual loudspeaker signals for the same directions, where each virtual loudspeaker signal for a certain direction is mixed only from uncorrelated signals created for predefined directions in the neighbourhood of that particular direction. The mixing from only a small number of uncorrelated signals offers the advantage that the number of mixing coefficients to create one uncorrelated signal can be kept low, as well as the amount of side information for PAR. Another advantage is that for the mixing of the individual virtual loudspeaker signals of the replicated ambient HOA component only signals from the spatial neighbourhood, and thus with similar amplitude spectrum, are considered. This operation prevents that directional components of the sparse HOA representation are undesirably spatially distributed over all directions. For this approach it is assumed that the de-correlation filters are pairwise different and that their number is equal to the number of virtual loudspeaker directions. The practical construction of many such de-correlation filters usually causes each individual filter to have only a limited de-correlation effect. The assignment of the de-correlation filters to the virtual directions (or equivalently spatial positions) should be reasonably chosen in order to minimise the mutual correlation between the signals to be mixed for creating a single virtual loudspeaker signal of the replicated ambient HOA component. 
         [0013]    The number of virtual loudspeaker directions is allowed to vary for individual frequency bands and can be used for specifying a frequency-dependent order of the replicated ambient HOA component. 
         [0014]    A further extension of the method of creating the uncorrelated signals from the sparse HOA representation is the usage of a time-varying number of uncorrelated signals to be considered for the mixing of a virtual loudspeaker signal of the replicated ambient HOA component. The number of uncorrelated signals to be mixed depends on the amount of missing ambience in the sparse HOA representation. This variation usually would lead to changes in the assignment of the de-correlation filters to the virtual loudspeaker positions. In order to avoid discontinuities of the de-correlated signals due to the temporal assignment change, the assignment of the de-correlation filters to the virtual loudspeaker signals of the sparse HOA representation can be exchanged by an equivalent assignment of the virtual loudspeaker signals to the de-correlation filters. This assignment can be expressed by a simple permutation matrix. In case the assignment changes, the input to each de-correlation filter can be computed by overlap-add between the signals arising from two different assignments. Hence, the input to and output of each de-correlation filter is continuous. Afterwards, the assignment has to be inverted in order to re-assign the output of each de-correlation filter to each virtual loudspeaker direction. 
         [0015]    In the context of multi-channel audio, the problem of creating ambient sound components is addressed in V. Pulkki, “Directional audio coding in spatial sound reproduction and stereo upmixing”, in AES 28th International Conference, Piteå, Sweden, June 2006, in J. Vilkamo, T. Baeckstroem, A. Kuntz, “Optimized covariance domain framework for time-frequency processing of spatial audio”, J. Audio Eng. Soc, vol. 61(6), pages 403-411, 2013, in ISO/IEC 23003-1 MPEG Surround, and in ISO/IEC 23003-2 Spatial Audio Object Coding. 
         [0016]    This application, however, describes a processing for the creation of ambience in the context of HOA representations. 
         [0017]    In principle, the inventive compression improving method is adapted for improving a low bit rate compressed and decompressed Higher Order Ambisonics HOA signal representation of a sound field, so as to provide a Parametric Ambience Replication parameter set, wherein said decompression provides a spatially sparse decoded HOA representation and a set of indices of coefficient sequences of this representation, said method including:
       transforming said spatially sparse decoded HOA representation into a number of complex-valued frequency domain sub-band representations and transforming using an analysis filter bank a correspondingly delayed version of said HOA signal representation into a corresponding number of complex-valued frequency domain sub-band representations;   grouping said sub-bands into a number of sub-band groups, and within each of these sub-band groups:   creating, using de-correlation filters, for each sub-band in a sub-band group from said complex-valued frequency domain sub-band representation a number of modified phase spectra signals which are uncorrelated with said complex-valued frequency domain sub-band representation;   computing for each sub-band in a sub-band group from said modified phase spectra signals a decorrelation covariance matrix;   transforming for each sub-band in a sub-band group said complex-valued frequency domain sub-band representation into its spatial domain representation and computing therefrom a corresponding covariance matrix;   transforming for each sub-band in a sub-band group a complex-valued frequency domain sub-band representation for said HOA signal representation into its spatial domain representation and computing therefrom a corresponding covariance matrix,
 
for each sub-band group:
   for all sub-bands of a sub-band group, combining said decorrelation covariance matrices so as to provide a sub-band group decorrelation covariance matrix {tilde over (Σ)} DECO,g (k′−1);   for all sub-bands of a sub-band group, combining the covariance matrices for said spatial domain representation of said complex-valued frequency domain sub-band representations so as to provide a sub-band group covariance matrix {tilde over (Σ)} SPARS,g  (k′−1);   for all sub-bands of a sub-band group, combining the covariance matrices for said spatial domain representation of said complex-valued frequency domain sub-band representations for said HOA signal representation so as to provide a sub-band group covariance matrix {tilde over (Σ)} ORIG,g (k′−1);   forming the residual between the combined covariance matrices {tilde over (Σ)} ORIG,g (k′−1) and {tilde over (Σ)} SPARS,g (k′−1), so as to provide a matrix ΔΣ g (k′−1);   computing, using matrix {tilde over (Σ)} DECO,g (k′−1) and matrix ΔΣ g (k′−1), a corresponding mixing matrix;   encoding said mixing matrix so as to provide a parameter set for the sub-band group;   multiplexing said parameter sets for said sub-band groups
 
and encoded sub-band configuration data and Parametric Ambience Replication coding parameters so as to provide a Parametric Ambience Replication parameter set.
       
 
         [0031]    In principle, the inventive compression improving apparatus is adapted for improving a low bit rate compressed and decompressed Higher Order Ambisonics HOA signal representation of a sound field, so as to provide a Parametric Ambience Replication parameter set, wherein said decompression provides a spatially sparse decoded HOA representation and a set of indices of coefficient sequences of this representation, said apparatus including means adapted to:
       transform said spatially sparse decoded HOA representation into a number of complex-valued frequency domain sub-band representations and transform using an analysis filter bank a correspondingly delayed version of said HOA signal representation into a corresponding number of complex-valued frequency domain sub-band representations;   group said sub-bands into a number of sub-band groups, and within each of these sub-band groups:   create, using de-correlation filters, for each sub-band in a sub-band group from said complex-valued frequency domain sub-band representation a number of modified phase spectra signals which are uncorrelated with said complex-valued frequency domain sub-band representation;   compute for each sub-band in a sub-band group from said modified phase spectra signals a decorrelation covariance matrix;   transform for each sub-band in a sub-band group said complex-valued frequency domain sub-band representation into its spatial domain representation and compute therefrom a corresponding covariance matrix;   transform for each sub-band in a sub-band group a complex-valued frequency domain sub-band representation for said HOA signal representation into its spatial domain representation and compute therefrom a corresponding covariance matrix,
 
for each sub-band group:
   for all sub-bands of a sub-band group, combine said decorrelation covariance matrices so as to provide a sub-band group decorrelation covariance matrix {tilde over (Σ)} DECO,g (k′−1);   for all sub-bands of a sub-band group, combine the covariance matrices for said spatial domain representation of said complex-valued frequency domain sub-band representations so as to provide a sub-band group covariance matrix {tilde over (Σ)} SPARS,g  (k′−1);   for all sub-bands of a sub-band group, combine the covariance matrices for said spatial domain representation of said complex-valued frequency domain sub-band representations for said HOA signal representation so as to provide a sub-band group covariance matrix {tilde over (Σ)} ORIG,g (k′−1);   form the residual between the combined covariance matrices {tilde over (Σ)} ORIG,g (k′−1) and {tilde over (Σ)} SPARS,g (k′−1), so as to provide a matrix ΔΣ g (k′−1);   compute, using matrix {tilde over (Σ)} DECO,g (k′−1) and matrix ΔΣ g (k′−1), a corresponding mixing matrix;   encode said mixing matrix so as to provide a parameter set for the sub-band group;   multiplex said parameter sets for said sub-band groups
 
and encoded sub-band configuration data and Parametric Ambience Replication coding parameters so as to provide a Parametric Ambience Replication parameter set.
       
 
         [0045]    In principle, the inventive decompression improving method is adapted for improving a spatially sparse decoded HOA representation, for which a set of indices of coefficient sequences of this representation was provided by said decoding, using a Parametric Ambience Replication parameter set generated according to the above compression improving method, said method including:
       reconstructing from said spatially sparse decoded HOA representation, said set of indices of coefficient sequences and said Parametric Ambience Replication parameter set an improved HOA representation, said reconstructing including:   determining from said Parametric Ambience Replication parameter set a sub-band configuration;   converting said spatially sparse decoded HOA representation into a number of frequency-band HOA representations;   according to said sub-band configuration, allocating corresponding groups of frequency-band HOA representations together with related parameters to a corresponding number of Parametric Ambience Replication sub-band decoder steps or stages which create de-correlated coefficient sequences of a replicated ambience HOA representation;   transforming said coefficient sequences of said replicated ambience HOA representation to a replicated time domain HOA representation;   enhancing with said replicated time domain HOA representation said spatially sparse decoded HOA representation, so as to provide an enhanced decompressed HOA representation.       
 
         [0052]    In principle, the inventive decompression improving apparatus is adapted for improving a spatially sparse decoded HOA representation, for which a set of indices of coefficient sequences of this representation was provided by said decoding, using a Parametric Ambience Replication parameter set generated according to the above compression improving method, said apparatus including means adapted to:
       reconstruct from said spatially sparse decoded HOA representation, said set of indices of coefficient sequences and said Parametric Ambience Replication parameter set an improved HOA representation, wherein that reconstruction includes:   determine from said Parametric Ambience Replication parameter set a sub-band configuration;   convert said spatially sparse decoded HOA representation into a number of frequency-band HOA representations;   according to said sub-band configuration, allocate corresponding groups of frequency-band HOA representations together with related parameters to a corresponding number of Parametric Ambience Replication sub-band decoder steps or stages which create de-correlated coefficient sequences of a replicated ambience HOA representation;   transform said coefficient sequences of said replicated ambience HOA representation to a replicated time domain HOA representation;   enhance with said replicated time domain HOA representation said spatially sparse decoded HOA representation, so as to provide an enhanced decompressed HOA representation.       
 
     
    
     
       BRIEF DESCRIPTION OF DRAWINGS 
         [0059]    Exemplary embodiments of the invention are described with reference to the accompanying drawings, which show in: 
           [0060]      FIG. 1  HOA data encoder including a PAR encoder; 
           [0061]      FIG. 2  PAR encoder in more detail, with k′=k−k HOA ; 
           [0062]      FIG. 3  PAR sub-band encoder; 
           [0063]      FIG. 4  HOA data decompressor including a PAR decoder; 
           [0064]      FIG. 5  PAR decoder in more detail; 
           [0065]      FIG. 6  PAR sub-band decoder; 
           [0066]      FIG. 7  spherical coordinate system. 
       
    
    
     DESCRIPTION OF EMBODIMENTS 
       [0067]    Even if not explicitly described, the following embodiments may be employed in any combination or sub-combination. 
       HOA Encoder 
       [0068]    The Parametric Ambience Replication (PAR) processing is used as an additional coding tool that extends the basic HOA compression, like it is shown in  FIG. 1 , where a frame based processing of frames with a frame index k is assumed. The HOA encoder step or stage  11  decomposes the HOA representation C(k) into the transport signal matrix Z(k−k HOA ) and a set of HOA side information Γ HOA (k−k HOA ) like it is described in EP 2665208 A1, EP 2743922 A1, International application PCT/EP2013/059363 and European patent application EP 14306077.0. The HOA representation matrix C(k) for the frame index k consists of O rows, where each row holds L time domain samples of the corresponding HOA coefficient, and it is also fed to a frame delay step or stage  14 . The rows of the matrix Z(k−k HOA ) hold the L time domain samples of the transport signals in which C(k) has been composed. The time domain signals from Z(k−k HOA ) are perceptually encoded in perceptual audio encoder step or stage  15  to the transport signal parameter set Γ Trans  (k−k HOA −k enc ) which are fed to a multiplexer and frame synchronisation step or stage  16 . The O×L matrix D(k−k HOA ) of the sparse HOA representation is restored from Γ HOA (k−k HOA ) and Z(k−k HOA ) in a HOA decoder step or stage  12 , which also provides a set of active ambience coefficients            used (k−k HOA ) This HOA decoder step/stage  12  is identical to the HOA decoder step or stage  43  used in the HOA data decompressor shown in  FIG. 4 . 
         [0069]    The term ‘sparse’ or ‘spatially sparse HOA representation’ means that in this representation spatially uncorrelated signal components of the original sound field are missing. In particular, the term ‘sparse’ may, but does not have to mean that the most coefficient sequences of the respective HOA representation are zero. E.g. a sound field that is coded/represented by only two plane waves is meant to be spatially sparse. However, usually none of the respective HOA coefficient sequences will be zero. 
         [0070]    The sparse HOA representation D(k−k HOA ) is fed into a PAR encoder step or stage  13  together with the delay-compensated HOA representation C(k−k HOA ), the set of active ambience coefficients            used (k−k HOA ), and PAR encoder parameters F, o PAR , n SIG (k−k HOA ) and v COMPLEX  delay compensated in step/stage  14 . The PAR processing is performed in N SB  sub-band groups, where the rows of the matrix F hold the first and the last sub-band index of the PAR filter bank for each corresponding sub-band group. The vector o PAR  contains for all PAR sub-band groups the HOA order used for the processing. The index set            used (k−k HOA ) holds the indexes of the rows from D(k−k HOA ) that are used for the PAR processing. The number of spatial domain signals per sub-band group that are used to compute one spatial domain signal of the replicated ambient HOA representation is defined by the vector n SIG (k) for frame k. The vector v COMPLEX  indicates for each sub-band group whether the elements of the PAR mixing matrix are complex-valued numbers or real-valued non-negative numbers. From these input signals and parameters the PAR encoder computes the encoded PAR parameter set Γ PAR (k−k HOA −1) that is also fed to step/stage  16 . 
         [0071]    Multiplexer and frame synchronisation step/stage  16  synchronises the frame delays of the parameter sets Γ HOA (k−k HOA ), Γ PAR (k−k HOA −1) and Γ Trans (k−k HOA −k enc ), and combines them into the coded HOA frame Γ(k−k max ). 
         [0072]    The HOA encoder delay is defined by k HOA , where it is assumed that the HOA decoder does not introduce any additional delay. The same definitions hold for the perceptual encoder delay k enc . The PAR processing adds also one frame of delay, so that the overall delay is k max =max{k HOA +k enc ,k HOA +1}. 
       PAR Encoder 
       [0073]    A basic feature of the PAR processing is the creation of de-correlated signals from the sparse HOA representation D(k′), and obtaining mixing matrices in the frequency domain that combine these de-correlated signals to a replicated ambient HOA representation that enhances the sparse and highly correlated HOA representation, in order to match the spatial properties of the original HOA representation C(k′). De-correlation means in this context that the phase of the sub-band signals is modified without changing its magnitude. Therefore the PAR encoder shown in  FIG. 2  computes from the input HOA representations C(k′) and D(k′) the coded PAR parameter set Γ PAR (k′−1) under consideration of the PAR encoding parameters o PAR , n SIG (k′), v COMPLEX  and            used (k′), wherein index k′=k−k HOA  is introduced for simplicity. 
         [0074]    The PAR processing is performed in frequency domain. The PAR analysis filter bank transforms the input HOA representation into its complex-valued frequency domain representation, where it is assumed that the number of time domain samples is equal to the number of frequency domain samples. For example, Quadrature Mirror Filter banks (QMF) with N FB  sub-bands can be used as filter banks. A first filter bank  24  transforms the O×L matrix C(k′) into N FB  frequency domain O×{tilde over (L)} matrices {tilde over (C)}(k′,j), with j=1, . . . , N FB  and 
         [0000]    
       
         
           
             
               
                 L 
                 ~ 
               
               = 
               
                 L 
                 
                   N 
                   FB 
                 
               
             
             , 
           
         
       
     
         [0000]    and a second filter bank  23  transforms the O×L matrix D(k′) into N FB  frequency domain O×{tilde over (L)} matrices {tilde over (D)}(k′,j), with j=1, . . . , N FB  and 
         [0000]    
       
         
           
             
               L 
               ~ 
             
             = 
             
               
                 L 
                 
                   N 
                   FB 
                 
               
               . 
             
           
         
       
     
         [0000]    In step or stage  25 , which also receives F, o PAR , n SIG (k′) and v COMPLEX , these sub-bands are grouped into N SB  sub-band groups. The signals of each sub-band group g=1 . . . N SB  are encoded individually by a corresponding number of PAR sub-band encoder steps or stages  26  and  27 . 
         [0075]    The PAR sub-band configuration is defined by the matrix 
         [0000]    
       
         
           
             
               
                 
                   
                     F 
                     = 
                     
                       [ 
                       
                         
                           
                             
                               f 
                               
                                 1 
                                 , 
                                 1 
                               
                             
                           
                           
                             
                               f 
                               
                                 1 
                                 , 
                                 2 
                               
                             
                           
                         
                         
                           
                             ⋮ 
                           
                           
                             ⋮ 
                           
                         
                         
                           
                             
                               f 
                               
                                 
                                   N 
                                   SB 
                                 
                                 , 
                                 1 
                               
                             
                           
                           
                             
                               f 
                               
                                 
                                   N 
                                   SB 
                                 
                                 , 
                                 2 
                               
                             
                           
                         
                       
                       ] 
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where the first and second columns hold the index j of the first and last sub-band index of the corresponding sub-band group g. The sub-band configuration is encoded in step or stage  21  to the parameter set Γ SUBBAND  by the method described in European patent application EP 14306347.7. Because it is fixed for each frame index k, it has to be transmitted to the decoder only once for initialisation. 
         [0076]    The grouping of sub-bands in step/stage  25  directs the input signals and parameters to each PAR sub-band encoder step/stage  26 ,  27  according to the given sub-band configuration, so that each PAR sub-band encoder of the sub-band group g gets {tilde over (C)}(k′,j g ), {tilde over (D)}(k′,j g ), o PAR,g , n SIG,g (k′), and v COMPLEX,g  as input for all j g =f g,1 , . . . , f f,2 . 
         [0077]    The parameter o PAR,g  indicates the HOA order for which the PAR encoder computes parameters. This order is equal or less than the HOA order N of the HOA representation C(k′). It is used to reduce the data rate for transmitting the encoded PAR parameters Γ M     g   (k′−1). The vector 
         [0000]        o   PAR   =[o   PAR,1   , . . . ,o   PAR,N     SB   ] T   (2)
 
         [0000]    holds the HOA orders for all sub-band groups. 
         [0078]    The number of de-correlated signals used to create one spatial domain signal of the replicated ambient HOA representation is defined by the vector 
         [0000]        n   SIG ( k ′)=[ n   SIG,1 ( k ′), . . . , n   SIG,N     SB   ( k ′)] T ,  (3)
 
         [0000]    with 0≦n SIG,g (k′)≦(o PAR,g +1) 2  and n SIG,g (k′)ε           0 . It is updated per frame because the number of required signals depends on the HOA representation. For HOA representations comprising highly spatially diffuse scenes, more de-correlated signals are required than for a HOA representation that are less spatially diffuse. Because the data rate for the encoded PAR parameters increases with the used number of de-correlated signals, the parameter can also be used for reducing the data rate. 
         [0079]    The mixing of the de-correlated signals is done by a matrix multiplication, where the encoded matrix is included in the PAR parameter set Γ M     g   (k′−1). The vector 
         [0000]        v   COMPLEX   =[v   COMPLEX,1   , . . . ,v   COMPLEX,N     SB   ] T   (4)
 
         [0000]    comprises a Boolean variable that indicates whether or not the elements of the mixing matrix are real-valued non-negative or complex-valued numbers, where it can be defined that for v COMPLEX,g =1 a matrix of complex-valued elements is used in sub-band group g. Due to the compression of the transport signals Z(k), the phase information of the decoded transport signals might get lost at decoder side due to parametric coding tools (for example in case the spectral band replication method is applied). In this case the PAR processing can only replicate the spatial power distribution of the missing ambience components, which means that the phase information of the PAR mixing matrix is obsolete. Furthermore the parameter            used (k′) is input to each PAR sub-band encoder step/stage  26 ,  27 . This set holds the indexes of the sparse HOA coefficient sequences from D(k′) that are used to create de-correlated signals. The indexes should address coefficient sequences within the HOA order o PAR,g , which should not differ significantly from the sequences of the original HOA representation C(k′). In the best case the sequences are identical at the PAR encoder so that at decoder side the selected sequences differ only by the distortions added by the perceptual coding. 
         [0080]    Finally, the encoded PAR parameter sets 
         [0000]    
       
         
           
             
               
                 Γ 
                 
                   M 
                   1 
                 
               
                
               
                 ( 
                 
                   
                     k 
                     ′ 
                   
                   - 
                   1 
                 
                 ) 
               
             
             , 
             … 
              
             
                 
             
             , 
             
               
                 Γ 
                 
                   M 
                   
                     N 
                     SB 
                   
                 
               
                
               
                 ( 
                 
                   
                     k 
                     ′ 
                   
                   - 
                   1 
                 
                 ) 
               
             
             , 
           
         
       
     
         [0000]    the encoded sub-band configuration set Γ SUBBAND  and the PAR coding parameters o PAR , n SIG (k′) and v COMPLEX  are synchronised by their frame indexes and multiplexed into the PAR bit stream parameter set Γ PAR (k′−1) in a multiplexer and frame synchronisation step or stage  22 . 
       PAR Sub-Band Encoder 
       [0081]    The PAR sub-band encoder steps/stages  26  and  27  are shown in more detail in  FIG. 3 . For each sub-band j g =f g,1 , . . . , f g,2  of the PAR sub-band g the matrices {tilde over (C)}(k′,j g ) and {tilde over (D)}(k′,j g ) are transformed in steps or stages  311 ,  312 ,  313  to their spatial domain representations {tilde over (W)}(k′,j g ) and {tilde over (E)}(k′,j g ) by a spatial transform that is described below in section Spatial transform. Therefrom in steps or stages  321 ,  322 ,  323  and  324  the covariance matrices 
         [0000]      {tilde over (Σ)} S,j     g   ( k′− 1)={tilde over ( E )}( k′,j   g ){tilde over ( E )}( k′,j   g ) H   +{tilde over (E)} ( k′− 1, j   g ){tilde over ( E )}( k− 1, j   g ) H   (5)
 
         [0000]      and 
         [0000]      {tilde over (Σ)} O,j     g   ( k′− 1)={tilde over ( W )}( k′,j   g ){tilde over ( W )}( k′,j   g ) H   +{tilde over (W)} ( k′− 1, j   g ){tilde over ( W )}( k− 1, j   g ) H   (6)
 
         [0000]    are computed where A H  denotes the hermitian transposed of a matrix A. The matrices of the previous frame are included in order to obtain covariance matrices that are valid for the current and previous frame for enabling a cross-fade between the matrices of two adjacent frames at the PAR decoder. The creation of de-correlated signals in steps or stages  331  and  332  transforms a sub-set of coefficient sequences from {tilde over (D)}(k′,j g ), which is selected according to the index set of used coefficients            used  (k′) to the spatial domain and permutes these spatial domain signals with the permutation matrix P o     PAR,g     ,n     SIG,g     (k′−1)  in order to assign the signals to the corresponding de-correlators that create a matrix {tilde over (B)}(k′,j g ). A detailed description of these processing steps is given below in section Creation of de-correlated signals. 
         [0082]    For obtaining in steps or stages  341  and  342  the covariance matrix of the corresponding spatial domain signals, the permutation included in {tilde over (B)}(k′,j g ) has to be inverted by the matrix P H   o     PAR,g     ,n     SIG,g     (k′−1) . Therefore the covariance matrices of the de-correlated signals are obtained from 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         Σ 
                         ~ 
                       
                       
                         D 
                         , 
                         
                           j 
                           g 
                         
                       
                     
                      
                     
                       ( 
                       
                         
                           k 
                           ′ 
                         
                         - 
                         1 
                       
                       ) 
                     
                   
                   = 
                   
                     
                       
                         P 
                         
                           
                             o 
                             
                               PAR 
                               , 
                               g 
                               , 
                             
                           
                            
                           
                             
                               n 
                               
                                 SIG 
                                 , 
                                 g 
                               
                             
                              
                             
                               ( 
                               
                                 
                                   k 
                                   ′ 
                                 
                                 - 
                                 1 
                               
                               ) 
                             
                           
                         
                         H 
                       
                        
                       
                         
                           B 
                           ~ 
                         
                          
                         
                           ( 
                           
                             
                               k 
                               ′ 
                             
                             , 
                             
                               j 
                               g 
                             
                           
                           ) 
                         
                       
                        
                       
                         
                           
                             B 
                             ~ 
                           
                            
                           
                             ( 
                             
                               
                                 k 
                                 ′ 
                               
                               , 
                               
                                 j 
                                 g 
                               
                             
                             ) 
                           
                         
                         H 
                       
                        
                       
                         P 
                         
                           
                             o 
                             
                               PAR 
                               , 
                               g 
                             
                           
                           , 
                           
                             
                               n 
                               
                                 SIG 
                                 , 
                                 g 
                               
                             
                              
                             
                               ( 
                               
                                 
                                   k 
                                   ′ 
                                 
                                 - 
                                 1 
                               
                               ) 
                             
                           
                         
                       
                     
                     + 
                   
                 
               
               
                 
                   ( 
                   7 
                   ) 
                 
               
             
             
               
                 
                   
                     P 
                     
                       
                         o 
                         
                           PAR 
                           , 
                           g 
                           , 
                         
                       
                        
                       
                         
                           n 
                           
                             SIG 
                             , 
                             g 
                           
                         
                          
                         
                           ( 
                           
                             
                               k 
                               ′ 
                             
                             - 
                             1 
                           
                           ) 
                         
                       
                     
                     H 
                   
                    
                   
                     
                       B 
                       ~ 
                     
                      
                     
                       ( 
                       
                         
                           
                             k 
                             ′ 
                           
                           - 
                           1 
                         
                         , 
                         
                           j 
                           g 
                         
                       
                       ) 
                     
                   
                    
                   
                     
                       
                         B 
                         ~ 
                       
                        
                       
                         ( 
                         
                           
                             
                               k 
                               ′ 
                             
                             - 
                             1 
                           
                           , 
                           
                             j 
                             g 
                           
                         
                         ) 
                       
                     
                     H 
                   
                    
                   
                     
                       P 
                       
                         
                           o 
                           
                             PAR 
                             , 
                             g 
                             , 
                           
                         
                          
                         
                           
                             n 
                             
                               SIG 
                               , 
                               g 
                             
                           
                            
                           
                             ( 
                             
                               
                                 k 
                                 ′ 
                               
                               - 
                               1 
                             
                             ) 
                           
                         
                       
                     
                     . 
                   
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
           
         
       
     
         [0083]    For the computation of {tilde over (Σ)} D,j     g   (k′−1) the inverse permutation matrix P H   o     PAR,g     ,n     SIG,g     (k′−1)  is applied to the current and the previous frame for obtaining covariance matrices that are valid for both frames. This is required for a valid cross-fade between the mixing matrices and the permutations of two adjacent frames. 
         [0084]    It is assumed that the HOA representations of each sub-band are independent of each other, so that the covariance matrix of a sub-band group can be computed by the sum of the covariance matrices of its sub-bands. Accordingly, the PAR sub-band encoder computes the covariance matrix 
         [0000]      {tilde over (Σ)} SPARS,g ( k′− 1)=Σ j     g     =f     g,1     f     g,2   {tilde over (Σ)} S,j     g   ( k′− 1)  (9)
 
         [0000]    in a combiner step or stage  352 , the covariance matrix 
         [0000]      {tilde over (Σ)} ORIG,g ( k′− 1)=Σ j     g     =f     g,1     f     g,2   {tilde over (Σ)} O,j     g   ( k′− 1)  (10)
 
         [0000]    in a combiner step or stage  354 , and the covariance matrix 
         [0000]      {tilde over (Σ)} DECO,g ( k′− 1)=Σ j     g     =f     g,1     f     g,2   {tilde over (Σ)} D,j     g   ( k′− 1)  (11)
 
         [0000]    in a combiner step or stage  351 . 
         [0085]    From the covariance matrix of the de-correlated signals {tilde over (Σ)} DECO,g (k′−1), from the matrix 
         [0000]      ΔΣ g ( k′− 1)={tilde over (Σ)} ORIG,g ( K′− 1)−{tilde over (Σ)} SPARS,g ( k′− 1)  (12)
 
         [0000]    generated in combiner step or stage  353 , and from the matrices {tilde over (W)}(k′,j g ) and {tilde over (B)}(k′,j g ) the mixing matrix M g (k′−1) is obtained by a mixing matrix computing step or stage  36 , the processing of which is described in section Computation of the mixing matrix. 
         [0086]    Finally in step or stage  37  mixing matrix M g (k′−1) is quantised and encoded to the parameter set Γ M     g   (k′−1) as described in section Encoding of the mixing matrix. 
       Spatial Transform 
       [0087]    In the spatial transform the input HOA representation C is transformed to its spatial domain representation W using the spherical harmonic transform from section Definition of real valued Spherical Harmonics for the given HOA order o PAR,g . Because the HOA order o PAR,g  is usually smaller than the input HOA order N, the rows from C having an index higher than Q PAR,g =(o PAR,g +1) 2  have to be removed before the spherical harmonic transform can be applied. 
       Creation of De-Correlated Signals 
       [0088]    The creation of the de-correlated signals includes the following processing steps:
       Select a sub-set of coefficient sequences defined by the index set of used coefficients            used (k′) from the sparse HOA representation {tilde over (D)}(k′,j g );   Perform the spatial transform of the selected coefficient sequences according to section Spatial transform for the HOA order o PAR,g ;   Permutation of the spatial domain signals for the assignment to the de-correlators by the permutation matrix P o     PAR,g     ,n     SIG,g   (k′), which is selected for the number of signals n SIG,g  (k′) used for the ambience replication and the HOA order o PAR,g ;   De-correlate the permuted signals using an individual processing that modifies the phase of the sub-band signals while best preserving the magnitude of the sub-band signals.       
 
         [0093]    In the following a detailed description of these processing steps is given. 
         [0094]    The de-correlator removes all inactive HOA coefficient sequences from the input matrix {tilde over (D)}(k′,j g ) by replacing rows that have an index that is not an element of the index set            used (k′) by an 1×{tilde over (L)} vector of zeros. The resulting matrix {tilde over (D)} ACT  is then transformed to its Q PAR,g ×{tilde over (L)} spatial domain representation matrix {tilde over (W)} ACT  using the spatial transform from section Spatial transform. 
         [0095]    During the computation of each row of the mixing matrix n SIG,g  (k′) spatially adjacent signals from {tilde over (B)}(k′,j g ) are selected. Therefore the matrix {tilde over (W)} ACT  is permuted for directing the signals from {tilde over (W)} ACT  to the de-correlators, so that the best de-correlation between the n SIG,g (k′) selected signals is guaranteed. A fixed Q PAR,g ×Q PAR,g  permutation matrix P o     PAR,g     ,n     SIG,g     (k′)  has to be defined for each predefined combination of n SIG,g (k′) and o PAR,g  The computation of these permutations matrices and the corresponding signal selection tables are given in section Computation of permutation and selection matrices. 
         [0096]    The actual permutation is then performed by 
         [0000]    
       
         
           
             
                 
             
              
             
               ( 
               13 
               ) 
             
           
         
       
       
         
           
             
               
                 W 
                 ~ 
               
               PERMUTE 
             
             = 
             
               { 
               
                 
                   
                     
                       
                         
                           P 
                           
                             
                               o 
                               
                                 PAR 
                                 , 
                                 g 
                               
                             
                             , 
                             
                               
                                 n 
                                 
                                   SIG 
                                   , 
                                   g 
                                 
                               
                                
                               
                                 ( 
                                 
                                   k 
                                   ′ 
                                 
                                 ) 
                               
                             
                           
                         
                          
                         
                           
                             W 
                             ~ 
                           
                           ACT 
                         
                       
                     
                     
                       
                         
                           if 
                            
                           
                               
                           
                            
                           
                             
                               n 
                               
                                 SIG 
                                 , 
                                 g 
                               
                             
                              
                             
                               ( 
                               
                                 k 
                                 ′ 
                               
                               ) 
                             
                           
                         
                         = 
                         
                           
                             n 
                             
                               SIG 
                               , 
                               g 
                             
                           
                            
                           
                             ( 
                             
                               
                                 k 
                                 ′ 
                               
                               - 
                               1 
                             
                             ) 
                           
                         
                       
                     
                   
                   
                     
                       
                         
                           ( 
                           
                             
                               
                                 
                                   
                                     
                                       P 
                                       
                                         
                                           o 
                                           
                                             PAR 
                                             , 
                                             g 
                                           
                                         
                                         , 
                                         
                                           
                                             n 
                                             
                                               SIG 
                                               , 
                                               g 
                                             
                                           
                                            
                                           
                                             ( 
                                             
                                               k 
                                               ′ 
                                             
                                             ) 
                                           
                                         
                                       
                                     
                                      
                                     
                                       diag 
                                        
                                       
                                         ( 
                                         
                                           f 
                                           
                                             i 
                                              
                                             
                                                 
                                             
                                              
                                             n 
                                           
                                         
                                         ) 
                                       
                                     
                                   
                                   + 
                                 
                               
                             
                             
                               
                                 
                                   
                                     P 
                                     
                                       
                                         o 
                                         
                                           PAR 
                                           , 
                                           g 
                                         
                                       
                                       , 
                                       
                                         
                                           n 
                                           
                                             SIG 
                                             , 
                                             g 
                                           
                                         
                                          
                                         
                                           ( 
                                           
                                             
                                               k 
                                               ′ 
                                             
                                             - 
                                             1 
                                           
                                           ) 
                                         
                                       
                                     
                                   
                                    
                                   
                                     diag 
                                      
                                     
                                       ( 
                                       
                                         f 
                                         out 
                                       
                                       ) 
                                     
                                   
                                 
                               
                             
                           
                           ) 
                         
                          
                         
                           
                             W 
                             ~ 
                           
                           ACT 
                         
                       
                     
                     
                       else 
                     
                   
                 
                 , 
               
             
           
         
       
     
         [0000]    where diag(f) forms a diagonal matrix from the elements of f. 
         [0097]    The fade-in and fade-out vectors for the switching between different permutation matrices are defined by 
         [0000]        f   in   :=[f   win (1) f   win (2) . . .  f   win ({tilde over ( L )})]  (14)
 
         [0000]        f   out   :=[f   win ( {tilde over (L)}+ 1) f   win ( {tilde over (L)}+ 2) . . .  f   win (2{tilde over ( L )})]  (15)
 
         [0000]    and whose elements are obtained from 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         f 
                         win 
                       
                        
                       
                         ( 
                         l 
                         ) 
                       
                     
                     := 
                     
                       
                         1 
                         2 
                       
                        
                       
                         [ 
                         
                           1 
                           - 
                           
                             cos 
                              
                             
                               ( 
                               
                                 2 
                                  
                                 
                                     
                                 
                                  
                                 π 
                                  
                                 
                                   
                                     l 
                                     - 
                                     1 
                                   
                                   
                                     2 
                                      
                                     
                                         
                                     
                                      
                                     
                                       L 
                                       ~ 
                                     
                                   
                                 
                               
                               ) 
                             
                           
                         
                         ] 
                       
                     
                   
                   , 
                   
                     l 
                     = 
                     1 
                   
                   , 
                   … 
                    
                   
                       
                   
                   , 
                   
                     2 
                      
                     
                       
                         L 
                         ~ 
                       
                       . 
                     
                   
                 
               
               
                 
                   ( 
                   16 
                   ) 
                 
               
             
           
         
       
     
         [0098]    The fading from one permutation matrix to the other prevents discontinuities in the input signals of the de-correlators. Subsequently the Q PAR,g  signals in each row of {tilde over (W)} PERMUTE  are de-correlated by the corresponding de-correlators in order to form the matrix {tilde over (B)}(k′,j g ). The used de-correlation method is defined in the MPEG Surround standard ISO/IEC FDIS 23003-1, MPEG Surround, section 6.6. 
         [0099]    Basically each de-correlator delays each frequency band signal by an individual number of samples, where the delay is equal for all Q PAR,g  de-correlators. Additionally each of the de-correlators applies an individual all-pass filter to its input signal. The different configurations of the de-correlators distort the phase information of the spatial domain signals {tilde over (W)} PERMUTE  differently, which results in a de-correlation of the spatial domain signals. 
       Computation of the Mixing Matrix 
       [0100]    The mixing matrix M g (k′−1) can be computed for real-valued non-negative or complex-valued matrix elements which is signalled by the variable v COMPLEX,g . For v COMPLEX,g  equal to one, the complex-valued mixing matrix is computed according to section Complex-valued mixing matrices, whereby this computation is only applicable if the perceptual coding of the transport channels does not destroy the phase information of the samples in the sub-band group g. 
         [0101]    Otherwise a mixing matrix of real-valued non-negative elements is sufficient for the extraction of the replicated ambient HOA representation. An example processing for the computation of the real-valued non-negative mixing matrix is given in section Real-valued non-negative mixing matrices. 
       Complex-Valued Mixing Matrices 
       [0102]    The computation of the mixing matrix is based on the method described in the above-mentioned Vilkamo/Baeckstroem/Kuntz article. A mixing matrix M is computed for up-mixing multi-channel signals X to the signals Y with a higher number of channels by Y=MX. The solution for the mixing matrix M 
         [0000]      satisfying  M =argmin M′εA (∥ M′X−GQX∥   FRO   2 )  (17)
 
         [0000]      with  A={M ′=argmin M″ ∥Σ Y   −M″Σ   X   M″   H ∥ 2 }  (18)
 
         [0000]      is given by  M=K   Y   VU   H   K   X   −1   (19)
 
         [0000]      with Σ Y   =K   Y   K   Y   H   =YY   H   ,K   Y ε           Q     PAR     ×Q     PAR    and  Yε             Q     PAR     ×L   (20)
 
         [0000]      Σ X   =K   X   K   X   H   =XX   H   ,K   X ε           Q     PAR     ×Q     PAR    and  Xε             Q     PAR     ×L   (21)
 
         [0000]        USV   H   =K   X   H   Q   H   G   H   K   Y ,  (22)
 
         [0000]    where ∥·∥ FRO  denotes the Frobenius norm of a matrix, and the signal vector X and the covariance matrix Σ Y  of Ŷ are known. The prototype mixing matrix Q satisfies Ŷ=QX so that Ŷ is a good approximation of Y. As the energies of the signals from Ŷ and Y might differ, the diagonal matrix G normalises the energy of Ŷ to the energy of Y where the diagonal elements of G are given by 
         [0000]    
       
         
           
             
               
                 
                   
                     g 
                     ii 
                   
                   = 
                   
                     
                       
                         σ 
                         
                           Y 
                           ii 
                         
                       
                       
                         σ 
                         
                           
                             Y 
                             ^ 
                           
                           ii 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   23 
                   ) 
                 
               
             
           
         
       
     
         [0000]    and σ Y     ii    and σ Ŷ     ii    are the diagonal elements of Σ Y  and Σ Ŷ =ŶŶ H . Each sub-band j g =f g,1 , . . . , f g,2  of the g-th sub-band group the matrix C out ({k′,k′−1},j g ) of the enhanced spatial domain signals is assumed to be computed from the sum of the spatial domain signals of the sparse HOA representation and the mixed spatial domain de-correlated signals by 
         [0000]        C   out ({ k′,k′− 1}, j   g )={tilde over ( E )}({ k′,k ′−1}, j   g )+ M   g ( k′− 1){tilde over ( B )}({ k′,k′− 1}, j   g ),  (24)
 
         [0000]    where the notation {k′,k′−1} is used to express that the mixing matrix M g (k′−1) is valid for the current and the previous frame. 
         [0103]    Since the spatial domain signals {tilde over (E)}({k′,k′−1},j g ) and {tilde over (B)}({k′,k′−1},j g ) are assumed to be uncorrelated per definition, the correlation matrix Σ out (k′−1) of the enhanced spatial domain signals C out ({k′,k′−1},j g ) can be written as the sum of the correlation matrices of the two components by 
         [0000]      Σ out ( k′− 1)={tilde over (Σ)} SPARS,g ( k′+ 1)+ M   g ( k′+ 1){tilde over (Σ)} DECO,g ( k′− 1) M   g ( k′− 1) H .  (25)
 
         [0104]    In order to make the enhanced sparse HOA representation sound like the original HOA representation {tilde over (C)}(k′,j g ) from a psycho-acoustic perspective, their correlation matrices can be matched, i.e. 
         [0000]      Σ out ( k′− 1)         {tilde over (Σ)} ORIG,g ( k′− 1).  (26)
 
         [0105]    This requirement leads to the following constraint of the mixing matrix: 
         [0000]      ΔΣ g ( k− 1)           M   g ( k′− 1){tilde over (Σ)} DECO,g ( k′− 1) M   g ( k′− 1) H ,  (27)
 
         [0000]    where ΔΣ g (k′−1) is defined in equation (12). 
         [0106]    The comparison of equations (18) and (27) results in the assignments 
         [0000]      Σ Y :=ΔΣ g ( k′− 1)  (28)
 
         [0000]      Σ X :={tilde over (Σ)} DECO,g ( k′− 1)  (29)
 
         [0000]        X:={tilde over (B)} ({ k′,k′− 1}, j   g )  (30)
 
         [0000]        Y:={tilde over (W)} ({ k′,k′− 1}, j   g )−{tilde over ( E )}({ k′,k− 1}, j   g ),  (31)
 
         [0000]    where K Y  and K X  can be computed from the singular value decomposition of ΔΣ g (k′−1) and {tilde over (Σ)} DECO,g  (k′−1). 
         [0107]    Finally a matrix Q has to be defined for the proposed method. Because matrix Ŷ should be a good approximation of Y, Q has to solve the equation 
         [0000]      {tilde over ( W )}({ k′,k′− 1}, j   g )−{tilde over (Σ)}({ k′,k′− 1}, j   g )           Q{tilde over (B)} ({ k′,k′− 1}, j   g ) for all  j   g   =f   g,1   f   g,2 .  (32)
 
         [0108]    A well-known solution for this problem is to minimise the Euclidean norm of the approximation error defined as 
         [0000]    
       
         
           
             
               
                 
                   
                     Q 
                     g 
                   
                   = 
                   
                     arg 
                      
                     
                         
                     
                      
                     
                       
                         min 
                         
                           Q 
                           ′ 
                         
                       
                        
                       
                         ( 
                         
                           
                             ∑ 
                             
                               
                                 j 
                                 g 
                               
                               = 
                               
                                 f 
                                 
                                   g 
                                   , 
                                   1 
                                 
                               
                             
                             
                               f 
                               
                                 g 
                                 , 
                                 2 
                               
                             
                           
                            
                           
                             
                                
                               
                                 
                                   
                                     
                                       
                                         
                                           W 
                                           ~ 
                                         
                                          
                                         
                                           ( 
                                           
                                             
                                               { 
                                               
                                                 
                                                   k 
                                                   ′ 
                                                 
                                                 , 
                                                 
                                                   
                                                     k 
                                                     ′ 
                                                   
                                                   - 
                                                   1 
                                                 
                                               
                                               } 
                                             
                                              
                                             
                                               j 
                                               g 
                                             
                                           
                                           ) 
                                         
                                       
                                       - 
                                       
                                         
                                           E 
                                           ~ 
                                         
                                          
                                         
                                           ( 
                                           
                                             
                                               { 
                                               
                                                 
                                                   k 
                                                   ′ 
                                                 
                                                 , 
                                                 
                                                   
                                                     k 
                                                     ′ 
                                                   
                                                   - 
                                                   1 
                                                 
                                               
                                               } 
                                             
                                             , 
                                             
                                               j 
                                               g 
                                             
                                           
                                           ) 
                                         
                                       
                                       - 
                                     
                                   
                                 
                                 
                                   
                                     
                                       
                                         Q 
                                         ′ 
                                       
                                        
                                       
                                         
                                           B 
                                           ~ 
                                         
                                          
                                         
                                           ( 
                                           
                                             
                                               { 
                                               
                                                 
                                                   k 
                                                   ′ 
                                                 
                                                 , 
                                                 
                                                   
                                                     k 
                                                     ′ 
                                                   
                                                   - 
                                                   1 
                                                 
                                               
                                               } 
                                             
                                             , 
                                             
                                               j 
                                               g 
                                             
                                           
                                           ) 
                                         
                                       
                                     
                                   
                                 
                               
                                
                             
                             2 
                             2 
                           
                         
                         ) 
                       
                     
                   
                 
               
               
                 
                   ( 
                   33 
                   ) 
                 
               
             
           
         
       
     
         [0000]    by using the Moore-Penrose pseudoinverse. 
         [0109]    For the reduction of the data rate for transmitting the mixing matrix, n SIG,g (k′−1) spatially adjacent signals from {tilde over (B)}({k′,k′−1},j g ) can be selected for the computation of each spatial domain signal of the replicated ambient HOA representation. Hence each row of the mixing matrix M g (k′−1) has to be computed individually according to the selection matrix 
         [0000]    
       
         
           
             
               
                 
                   
                     S 
                     
                       
                         n 
                         
                           SIG 
                           , 
                           g 
                         
                       
                        
                       
                         ( 
                         
                           
                             k 
                             ′ 
                           
                           - 
                           1 
                         
                         ) 
                       
                     
                     
                       ( 
                       
                         o 
                         
                           PAR 
                           , 
                           g 
                         
                       
                       ) 
                     
                   
                   = 
                   
                     [ 
                     
                       
                         
                           
                             s 
                             
                               1 
                               , 
                               1 
                             
                           
                         
                         
                           … 
                         
                         
                           
                             s 
                             
                               1 
                               , 
                               
                                 
                                   n 
                                   
                                     SIG 
                                     , 
                                     g 
                                   
                                 
                                  
                                 
                                   ( 
                                   
                                     
                                       k 
                                       ′ 
                                     
                                     - 
                                     1 
                                   
                                   ) 
                                 
                               
                             
                           
                         
                       
                       
                         
                           ⋮ 
                         
                         
                           ⋱ 
                         
                         
                           ⋮ 
                         
                       
                       
                         
                           
                             s 
                             
                               
                                 Q 
                                 
                                   PAR 
                                   , 
                                   g 
                                 
                               
                               , 
                               1 
                             
                           
                         
                         
                           … 
                         
                         
                           
                             s 
                             
                               
                                 Q 
                                 
                                   PAR 
                                   , 
                                   g 
                                 
                               
                               , 
                               
                                 
                                   n 
                                   
                                     SIG 
                                     , 
                                     g 
                                   
                                 
                                  
                                 
                                   ( 
                                   
                                     
                                       k 
                                       ′ 
                                     
                                     - 
                                     1 
                                   
                                   ) 
                                 
                               
                             
                           
                         
                       
                     
                     ] 
                   
                 
               
               
                 
                   ( 
                   34 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where the elements s o,n  denote the indexes of the row vectors from {tilde over (B)}({k′,k′−1},j g ) that are used to create the o-th spatial domain signal of the replicated ambient HOA representation with n=1 . . . n SIG,g (k′−1). To solve equation (19) individually for each row of the mixing matrix, it has to be transformed to 
         [0000]        P   −H   K   X   H   M   H   =K   Y   H ,  (35)
 
         [0000]      with  P=VU   H . It is defined that  T:=P   −H   K   X   H   (36)
 
         [0000]    and t a  is one of the a=1 . . . Q PAR,g  column vectors of T. For the computation of each of the o=1 . . . Q PAR,g  rows of M g (k′−1), the sub-matrix 
         [0000]    
       
         
           
             
               
                 
                   
                     T 
                     o 
                   
                   = 
                   
                     [ 
                     
                       
                         t 
                         
                           s 
                           
                             o 
                             , 
                             1 
                           
                         
                       
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         t 
                         
                           s 
                           
                             o 
                             , 
                             
                               
                                 n 
                                 
                                   SIG 
                                   , 
                                   g 
                                 
                               
                                
                               
                                 ( 
                                 
                                   
                                     k 
                                     ′ 
                                   
                                   - 
                                   1 
                                 
                                 ) 
                               
                             
                           
                         
                       
                     
                     ] 
                   
                 
               
               
                 
                   ( 
                   37 
                   ) 
                 
               
             
           
         
       
     
         [0000]    is built and the vector m row,o  is determined by 
         [0000]        m   row,o   =T   o   +   k   Y,o   H   (38)
 
         [0000]    where k Y,o  is the o-th row vector from K Y  and T o   +  denotes the Moore-Penrose pseudoinverse. In some cases T o  can be ill-conditioned which might require a regularisation in the computation of the pseudoinverse. 
         [0110]    At least the elements m o,i  of the mixing matrix M g (k′−1) are assigned to 
         [0000]    
       
         
           
             
               
                 
                   
                     m 
                     
                       o 
                       , 
                       b 
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                             
                               m 
                               
                                 row 
                                 , 
                                 o 
                                 , 
                                 a 
                               
                             
                           
                           
                             
                               
                                 if 
                                  
                                 
                                     
                                 
                                  
                                 
                                   ∃ 
                                   
                                     a 
                                      
                                     
                                         
                                     
                                      
                                     
                                       s 
                                       . 
                                       t 
                                       . 
                                       
                                           
                                       
                                        
                                       
                                         s 
                                         
                                           o 
                                           , 
                                           a 
                                         
                                       
                                     
                                   
                                 
                               
                               = 
                               b 
                             
                           
                         
                         
                           
                             0 
                           
                           
                             else 
                           
                         
                       
                       , 
                     
                   
                 
               
               
                 
                   ( 
                   39 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where m row,o,a  are the elements of the vector m row,o  and o=1 . . . Q PAR,g . 
       Real-Valued Non-Negative Mixing Matrices 
       [0111]    However, for high-frequency sub-band groups g which might be affected by the spectral bandwidth replication of the perceptual coding, the method described in section Complex-valued mixing matrices is not reasonable because the phases of the reconstructed sub-band signals of the sparse HOA representation cannot be assumed to even rudimentary resemble that of the original sub-band signals. 
         [0112]    For such cases the phases can be disregarded. Instead, one concentrates only on the signal powers for the computation of the mixing matrices M g (k′−1). A reasonable criterion for the determination of the prediction coefficients is to minimise the error 
         [0000]      |{tilde over ( W )}({ k′,k′− 1}, j   g )−{tilde over ( E )}({ k′,k′− 1}, j   g )| 2   −|M   g ( k′− 1)| 2   |{tilde over (B)} ({ k′,k′− 1}, j   g )| 2   (40)
 
         [0000]    where the operation |·| 2  is assumed to be applied element-wise to the matrices. In other words, the mixing matrix is chosen such that the sum of the powers of all weighted spatial sub-band signals of the de-correlated HOA representation best approximates the power of the residuum of the original and the spatial domain sub-band signals of the sparse HOA representation. In this case, Nonnegative Matrix Factorisation (NMF) techniques can be used to solve this optimisation problem. For an introduction to NMF, see e.g. D. D. Lee, H. S. Seung, “Learning the parts of objects by nonnegative matrix factorization”, Nature, vol. 401, pages 788-791, 1999. 
       Encoding of the Mixing Matrix 
       [0113]    The mixing matrix M g (k′−1) of each sub-band group g=1, . . . , N SB  is to be quantised and encoded to the parameter set Γ M     g   (k′−1), where only a Q PAR,g ×n SIG,g (k′−1) sub-matrix defined by the selection matrix S n     SIG,g     (k′−1)   (o     PAR,g     ) . The quantisation of the matrix elements has to reduce the data rate without decreasing the perceived audio quality of the replicated ambient HOA representation. Therefore the fact can be exploited that, due to the computation of the covariance matrices on overlapping frames, there is a high correlation between the mixing matrices of successive frames. In particular, each sub-matrix element can be represented by its magnitude and its angle, and then the differences of angles and magnitudes between successive frames are coded. 
         [0114]    If it is assumed that the magnitude lies within the interval [0,m max ] the magnitude difference lies within the interval [−m max ,m max ] The difference of angles is assumed to lie within the interval [−π,π]. For the quantisation of these differences predefined numbers of bits for the magnitude and angle difference are used correspondingly. In the case of using mixing matrices with real-valued non-negative elements, only the magnitude differences are coded because the phase difference is always zero. 
         [0115]    The inventors have found experimentally that the occurrence probabilities of the individual differences are distributed in a highly non-uniform manner. In particular, small differences in the magnitudes as well as in the angles occur significantly more frequently than big ones. Hence, a coding method (like Huffman coding) that is based on the a-priori probabilities of the individual values to be coded can be exploited in order to reduce significantly the average number of bits per mixing matrix element. 
         [0116]    Additionally the value of n SIG,g (k′−1) has to be transmitted per frame. An index of a predefined table can be signalled for this purpose, which index is defined for each valid PAR HOA order. 
       Computation of Permutation and Selection Matrices 
       [0117]    To reduce the data rate for the transmission of the mixing matrices, the number of active (i.e. non-zero) elements per row can be reduced. The active row elements correspond to n SIG  of Q PAR  de-correlated signals in the spatial domain that are used for mixing one spatial domain signal of the replicated ambient HOA representation, which is now called target signal. The complex-valued sub-band signals of the de-correlated spatial domain signals to be mixed should ideally have a scaled magnitude spectrum as the target signal, but different phase spectra. This can be achieved by selecting the signals to be mixed from the spatial vicinity of the target signal. 
         [0118]    Thus, in a first step for each o-th target signal position, o=1, . . . , Q PAR , groups of n SIG  spatially adjacent positions have to be found for each HOA order o PAR  and for each number of active rows n SIG . In a second step, the assignment of the Q PAR  input signals to the Q PAR  de-correlators is obtained in order to minimise the mutual correlation between the n SIG  signals in each group. 
         [0119]    One way to find the n SIG  signals of a group for a given HOA order o PAR  is to compute the angular distance between all spatial domain positions and the position of the o-th target signal, and to select the signal indexes belonging to the n SIG  smallest distances into the o-th group. Thus the o-th row vector of the matrix S n     SIG     (o     PAR     )  from equation (34) consists of the ascendingly sorted indexes of the o-th group. The matrices for each predefined combination of o PAR  and n SIG  are assumed to be known in the PAR encoder and decoder. 
         [0120]    Now the assignment of the spatial domain signals to the de-correlators has to be found and stored in the permutation matrix P o     PAR     ,n     SIG    for each predefined combination of o PAR  and n SIG . Therefore a search over all possible assignments is applied in order to find the best assignment under a certain criterion. One possible criterion is to build the covariance matrix Σ of the all-pass impulse responses of all de-correlators. The penalty of an assignment is computed by the following steps:
       Build for each group a covariance sub-matrix by selecting only the elements from matrix Σ that are assigned to the signals of the group;   Sum the quotient of the maximum and the minimum singular value of each covariance sub-matrix.       
 
         [0123]    From the assignment with the lowest penalty the permutation matrix P o     PAR     ,n     SIG    is obtained, so that each row of the matrix {tilde over (W)} ACT  from section Creation of de-correlated signals is permuted to the corresponding index of the assigned de-correlator. 
       HOA Decoder Framework 
       [0124]    The framework of the HOA decoder/HOA decompressor including the PAR decoder is depicted in  FIG. 4 . The bit steam parameter set Γ(k) is de-multiplexed in a demultiplexer step or stage  41  into the side information parameter sets Γ HOA (k) and Γ PAR (k), and the signal parameter set Γ Trans (k). Because the delay between the side information and the signal parameters has already been aligned in the HOA encoder, the decoder side receives its data already synchronised. 
         [0125]    The signal parameter set Γ Trans (k) is fed to a perceptual audio decoder step or stage  42  that decodes the sparse HOA representation {circumflex over (Z)}(k) from the signal parameter set Γ Trans (k) following HOA decoder step or stage  43  composes the decoded sparse HOA representation {circumflex over (D)}(k) from the decoded transport signals {circumflex over (Z)}(k) and the side information parameter set Γ HOA (k). The index set            used (k) is also reconstructed by the HOA decoder step/stage  43 . The decoded sparse HOA representation {circumflex over (D)}(k), the index set            used (k) and the PAR side information parameter set γ PAR (k) are fed to a PAR decoder step or stage  44 , which reconstructs therefrom the replicated ambient HOA representation and enhances the decoded sparse HOA representation {circumflex over (D)}(k) to the decoded HOA representation Ĉ(k). 
       PAR Decoder Framework 
       [0126]    The PAR decoder framework shown in  FIG. 5  enhances the decoded sparse HOA representation {circumflex over (D)}(k) by the decoded replicated ambient HOA representation C PAR (k) in order to reconstruct the decoded HOA representation Ĉ(k). The samples of the decoded HOA representation Ĉ(k) are delayed according to the analysis and synthesis delays of the applied filter banks. The PAR side information parameter set Γ PAR (k) is de-multiplexed in a demultiplexer step or stage  51  into the sub-band configuration set F SUBBAND , the PAR parameters o PAR , n SIG (k) v COMPLEX , and the data sets of the encoded mixing matrices Γ M     g   (k) for each sub-band group g=1, . . . , N SB . 
         [0127]    In parallel the decoded sparse HOA representation {circumflex over (D)}(k) is converted in an analysis filter bank step or stage  52  into j=1, . . . , N FB  frequency-band HOA representation matrices          (k,j). The applied filter-bank has to be identical to the one that has been used in the PAR encoder at encoder side. 
         [0128]    From the set of sub-band configurations Γ SUBBAND  the number of sub-band groups N SB  and the sub-band configuration matrix F, as defined in equation (1), is decoded in step or stage  53 , and is fed into a group allocation step or stage  54 . According to these parameters the group allocation step or stage  54  directs the parameters from steps/stages  51  and  53  and the frequency-band HOA representations          (k,j) from step/stage  52  to the corresponding PAR sub-band decoder steps or stages  55 ,  56  for sub-bands 1 . . . N SB . 
         [0129]    The N SB  PAR sub-band decoders  55 ,  56  create the coefficient sequences of the replicated ambient HOA representation {tilde over (C)} PAR (k,j g ) from the coefficient sequences of the decoded sparse HOA representation matrices          (k,j g ) and the PAR sub-band parameters o PAR , v COMPLEX , n SIG (k) Γ M     g   (k) and            used (k) for the corresponding frequency-bands j g =f g,1 , . . . , f g,2 . 
         [0130]    The resulting replicated ambient HOA representation matrices {tilde over (C)} PAR (k,j) of each frequency-band are transformed to the time domain HOA representation C PAR (k) in a synthesis filter bank step or stage  58 . Finally C PAR (k) is in a combining step or stage  59  sample-wise added to the delay compensated (in filter bank delay compensation  57 ) sparse HOA representation {circumflex over (D)} DELAY (k), so as to create the decoded HOA representation Ĉ(k). 
       PAR Sub-Band Decoder 
       [0131]    The PAR sub-band decoder depicted in  FIG. 6  creates the frequency domain replicated ambient HOA representation matrices {tilde over (C)} PAR (k,j g ) for the frequency-bands j g =f g,1 , . . . , f g,2  of a sub-band group g. 
         [0132]    In parallel the permuted and de-correlated spatial domain signal matrices {tilde over (B)}(g,j g ) are generated in steps or stages  611 ,  612  from the coefficients sequences of the sparse HOA representation matrices          (g,j g ) using the parameters            used (k), o PAR,g  and n SIG,g (k), where the processing is identical to the processing from section Creation of de-correlated signals used in the PAR sub-band encoder. 
         [0133]    Further, the mixing matrix {circumflex over (M)} g (k) is obtained in mixing matrix decoding step or stage  63  from the data set of the encoded mixing matrix Γ M     g   (k) using the parameters o PAR,g , n SIG,g (k) and v COMPLEX,g  The actual decoding of the mixing matrix elements is described in section Decoding of mixing matrix. Subsequently the spatial domain signals of the replicated ambient HOA representation {tilde over (W)} PAR (k,j g ) are generated in ambience replication steps or stages  621 ,  622  from the corresponding de-correlated spatial domain signals          (k,j g ), using o PAR,g , n SIG,g (k) and {circumflex over (M)} g (k), by the ambience replication processing described in section Ambience replication for each frequency band j g  of the sub-band group g. 
         [0134]    Finally the spatial domain signals of the replicated ambient HOA representation {tilde over (W)} PAR (k,j g ) are transformed back in steps or stages  641 ,  642  to their HOA representation using o PAR,g  and the inverse spatial transform, where the inverse spherical harmonic transform from section Spherical Harmonic transform is applied. The created replicated ambient HOA representation matrix {tilde over (C)} PAR (k,j g ) must have the dimensions N×{tilde over (L)} where only the first Q PAR,g  rows of the corresponding PAR HOA order o PAR,g  have non-zero elements. 
       Decoding of the Mixing Matrix 
       [0135]    The indexes of the elements of the encoded mixing matrix are defined by the current selection matrix S n     SIG,g     (k)   (o     PAR,g     ) , so that Q PAR,g  times n SIG,g (k) elements per mixing matrix have to be decoded. 
         [0136]    Therefore in a first step the angular and magnitude differences of each matrix element are decoded according to the corresponding entropy encoding applied in the PAR encoder. Then the decoded angle and magnitude differences are added to the reconstructed Q PAR,g ×Q PAR,g  angle and magnitude mixing matrices of the previous frame, where only the elements from the current selection matrix S n     SIG,g     (k)   (o     PAR,g     )  are used and all other elements have to be set to zero. From the updated reconstructed angle and magnitude mixing matrices the complex values of the decoded mixing matrix {circumflex over (M)} g (k) are restored by 
         [0000]        m   a,b   =m   ABS,a,b   ·e   im     ANGLE,a,b    with  a= 1, . . . , Q   PAR,g   ,b= 1, . . . , Q   PAR,g ,  (41)
 
         [0000]    where m a,b  is the element of {circumflex over (M)} g (k) in the a-th row and in the b-th column, m ANGLE,a,b  and m ABS,a,b  are the corresponding elements of the updated reconstructed angle and magnitude mixing matrices. 
       Ambience Replication 
       [0137]    The ambience replication performs an inverse permutation of the de-correlated spatial domain signals, which is defined by the permutation matrix for the parameters o PAR,g  and n SIG,g (k), followed by a multiplication by the mixing matrix {circumflex over (M)} g (k). For a smooth transition of the parameters of adjacent frames, the de-correlated signals from the current frame are processed and cross-faded using the parameters of the current and the previous frame. The processing of the ambience replication is therefore defined by 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           W 
                           ~ 
                         
                         PAR 
                       
                        
                       
                         ( 
                         
                           k 
                           , 
                           
                             j 
                             g 
                           
                         
                         ) 
                       
                     
                     = 
                     
                       
                         ( 
                         
                           
                             
                               
                                 
                                   
                                     diag 
                                      
                                     
                                       ( 
                                       
                                         f 
                                         
                                           i 
                                            
                                           
                                               
                                           
                                            
                                           n 
                                         
                                       
                                       ) 
                                     
                                   
                                    
                                   
                                     
                                       
                                         M 
                                         ^ 
                                       
                                       g 
                                     
                                      
                                     
                                       ( 
                                       k 
                                       ) 
                                     
                                   
                                    
                                   
                                     P 
                                     
                                       
                                         o 
                                         
                                           PAR 
                                           , 
                                           g 
                                         
                                       
                                       , 
                                       
                                         
                                           n 
                                           
                                             SIG 
                                             , 
                                             g 
                                           
                                         
                                          
                                         
                                           ( 
                                           k 
                                           ) 
                                         
                                       
                                     
                                     H 
                                   
                                 
                                 + 
                               
                             
                           
                           
                             
                               
                                 
                                   diag 
                                    
                                   
                                     ( 
                                     
                                       f 
                                       out 
                                     
                                     ) 
                                   
                                 
                                  
                                 
                                   
                                     
                                       M 
                                       ^ 
                                     
                                     g 
                                   
                                    
                                   
                                     ( 
                                     
                                       k 
                                       - 
                                       1 
                                     
                                     ) 
                                   
                                 
                                  
                                 
                                   P 
                                   
                                     
                                       o 
                                       
                                         PAR 
                                         , 
                                         g 
                                       
                                     
                                     , 
                                     
                                       
                                         n 
                                         
                                           SIG 
                                           , 
                                           g 
                                         
                                       
                                        
                                       
                                         ( 
                                         
                                           k 
                                           - 
                                           1 
                                         
                                         ) 
                                       
                                     
                                   
                                   H 
                                 
                               
                             
                           
                         
                         ) 
                       
                        
                       
                         
                           
                             B 
                             ~ 
                           
                           ^ 
                         
                          
                         
                           ( 
                           
                             k 
                             , 
                             
                               j 
                               g 
                             
                           
                           ) 
                         
                       
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   42 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where the cross-fade function from equations (14) and (15) are used. 
       Basics of Higher Order Ambisonics 
       [0138]    Higher Order Ambisonics (HOA) is based on the description of a sound field within a compact area of interest, which is assumed to be free of sound sources. In that case the spatiotemporal behaviour of the sound pressure p(t,x) at time t and position x within the area of interest is physically fully determined by the homogeneous wave equation. In the following a spherical coordinate system as shown in  FIG. 7  is assumed. In the used coordinate system the x axis points to the frontal position, the y axis points to the left, and the z axis points to the top. A position in space x=(r,θ,φ) T  is represented by a radius r&gt;0 (i.e. the distance to the coordinate origin), an inclination angle θε[0,π] measured from the polar axis z and an azimuth angle φε[0,2π ] measured counter-clockwise in the x-y plane from the x axis. Further, (·) T  denotes the transposition. 
         [0139]    Then, it can be shown from the “Fourier Acoustics” text book that the Fourier transform of the sound pressure with respect to time denoted by            t (·), i.e. 
         [0000]        P (ω, x )=           t ( p ( t,x ))=∫ −∞   ∞   p ( t,x ) e   −iωt   dt   (43)
 
         [0000]    with ω denoting the angular frequency and i indicating the imaginary unit, may be expanded into the series of Spherical Harmonics according to 
         [0000]        P (ω= kc   s   ,r ,θ,φ)=Σ n=0   N Σ m=−n   n   A   n   m ( k ) j   n ( kr ) S   n   m (θ,φ),  (44)
 
         [0000]    wherein c s  denotes the speed of sound and k denotes the angular wave number, which is related to the angular frequency ω by 
         [0000]    
       
         
           
             k 
             = 
             
               
                 ω 
                 
                   c 
                   s 
                 
               
               . 
             
           
         
       
     
         [0000]    Further, j n  (·) denote the spherical Bessel functions of the first kind and S n   m (θ,φ) denote the real valued Spherical Harmonics of order n and degree m, which are defined in section Definition of real valued Spherical Harmonics. The expansion coefficients A n   m (k) only depend on the angular wave number k. Note that it has been implicitly assumed that the sound pressure is spatially band-limited. Thus the series is truncated with respect to the order index n at an upper limit N, which is called the order of the HOA representation. If the sound field is represented by a superposition of an infinite number of harmonic plane waves of different angular frequencies ω arriving from all possible directions specified by the angle tuple (θ,φ), it can be shown (see B. Rafaely, “Plane-wave decomposition of the sound field on a sphere by spherical convolution”, J. Acoust. Soc. Am., vol. 4(116), pages 2149-2157, October 2004) that the respective plane wave complex amplitude function C(ω,θ,φ) can be expressed by the following Spherical Harmonics expansion 
         [0000]        C (ω= kc   s ,θ,φ)=Σ n=0   N Σ m=−n   n   C   n   m ( k ) S   n   m (θ,φ),  (45)
 
         [0000]    where the expansion coefficients C n   m (k) are related to the expansion coefficients A n   m (k) by 
         [0000]        A   n   m ( k )= i   n   C   n   m ( k ).  (46)
 
         [0140]    Assuming the individual coefficients C n   m (k=ω/c s ) to be functions of the angular frequency ω, the application of the inverse Fourier transform (denoted by            −1 (·)) provides time domain functions 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       c 
                       n 
                       m 
                     
                      
                     
                       ( 
                       t 
                       ) 
                     
                   
                   = 
                   
                     
                       
                         ℱ 
                         t 
                         
                           - 
                           1 
                         
                       
                        
                       
                         ( 
                         
                           
                             C 
                             n 
                             m 
                           
                            
                           
                             ( 
                             
                               ω 
                               / 
                               
                                 c 
                                 s 
                               
                             
                             ) 
                           
                         
                         ) 
                       
                     
                     = 
                     
                       
                         1 
                         
                           2 
                            
                           
                               
                           
                            
                           π 
                         
                       
                        
                       
                         
                           ∫ 
                           
                             - 
                             ∞ 
                           
                           ∞ 
                         
                          
                         
                           
                             
                               C 
                               n 
                               m 
                             
                              
                             
                               ( 
                               
                                 ω 
                                 
                                   c 
                                   s 
                                 
                               
                               ) 
                             
                           
                            
                           
                             e 
                             
                               i 
                                
                               
                                   
                               
                                
                               ω 
                                
                               
                                   
                               
                                
                               t 
                             
                           
                            
                           d 
                            
                           
                               
                           
                            
                           ω 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   47 
                   ) 
                 
               
             
           
         
       
     
         [0000]    for each order n and degree m. These time domain functions are referred to as continuous-time HOA coefficient sequences here, which can be collected in a single vector c(t) by 
         [0000]    
       
         
           
             
               
                 
                   
                     c 
                      
                     
                       ( 
                       t 
                       ) 
                     
                   
                   = 
                   
                     
                       [ 
                       
                         
                           
                             
                               
                                 c 
                                 0 
                                 0 
                               
                                
                               
                                 ( 
                                 t 
                                 ) 
                               
                             
                           
                           
                             
                               
                                 c 
                                 1 
                                 
                                   - 
                                   1 
                                 
                               
                                
                               
                                 ( 
                                 t 
                                 ) 
                               
                             
                           
                           
                             
                               
                                 c 
                                 1 
                                 0 
                               
                                
                               
                                 ( 
                                 t 
                                 ) 
                               
                             
                           
                           
                             
                               
                                 c 
                                 1 
                                 1 
                               
                                
                               
                                 ( 
                                 t 
                                 ) 
                               
                             
                           
                           
                             
                               
                                 c 
                                 2 
                                 
                                   - 
                                   2 
                                 
                               
                                
                               
                                 ( 
                                 t 
                                 ) 
                               
                             
                           
                           
                             
                               
                                 c 
                                 2 
                                 
                                   - 
                                   1 
                                 
                               
                                
                               
                                 ( 
                                 t 
                                 ) 
                               
                             
                           
                           
                             
                               
                                 c 
                                 2 
                                 0 
                               
                                
                               
                                 ( 
                                 t 
                                 ) 
                               
                             
                           
                           
                             
                               
                                 c 
                                 2 
                                 1 
                               
                                
                               
                                 ( 
                                 t 
                                 ) 
                               
                             
                           
                           
                             
                               
                                 c 
                                 2 
                                 2 
                               
                                
                               
                                 ( 
                                 t 
                                 ) 
                               
                             
                           
                           
                             … 
                           
                           
                             
                               
                                 c 
                                 N 
                                 
                                   N 
                                   - 
                                   1 
                                 
                               
                                
                               
                                 ( 
                                 t 
                                 ) 
                               
                             
                           
                           
                             
                               
                                 c 
                                 N 
                                 N 
                               
                                
                               
                                 ( 
                                 t 
                                 ) 
                               
                             
                           
                         
                       
                       ] 
                     
                     T 
                   
                 
               
               
                 
                   ( 
                   48 
                   ) 
                 
               
             
           
         
       
     
         [0141]    The position index of an HOA coefficient sequence x n   m (t) within vector c(t) is given by n(n+1)+1+m. The overall number of elements in vector c(t) is given by O=(N+1) 2 . 
         [0142]    The final Ambisonics format provides the sampled version of c(t) using a sampling frequency f S  as 
         [0000]                ={ c ( T   S ), c (2 T   S ), c (3 T   S ), c (4 T   S ), . . . }  (49)
 
         [0000]    where T S =1/f S  denotes the sampling period. The elements of c(lT S ) are referred to as discrete-time HOA coefficient sequences, which can be shown to always be real-valued. This property also holds for the continuous-time versions c n   m (t). 
       Definition of Real Valued Spherical Harmonics 
       [0143]    The real-valued spherical harmonics S n   m (θ,φ) (assuming SN3D normalisation according to J. Daniel, “Représentation de champs acoustiques, application à la transmission et à la reproduction de scènes sonores complexes dans un contexte multimédia”, PhD thesis, Université Paris, 6, 2001, chapter 3.1) are given by 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       S 
                       n 
                       m 
                     
                      
                     
                       ( 
                       
                         θ 
                         , 
                         φ 
                       
                       ) 
                     
                   
                   = 
                   
                     
                       
                         
                           ( 
                           
                             
                               2 
                                
                               n 
                             
                             + 
                             1 
                           
                           ) 
                         
                          
                         
                           
                             
                               ( 
                               
                                 n 
                                 - 
                                 
                                    
                                   m 
                                    
                                 
                               
                               ) 
                             
                             ! 
                           
                           
                             
                               ( 
                               
                                 n 
                                 + 
                                 
                                    
                                   m 
                                    
                                 
                               
                               ) 
                             
                             ! 
                           
                         
                       
                     
                      
                     
                       
                         P 
                         
                           n 
                           , 
                           
                              
                             m 
                              
                           
                         
                       
                        
                       
                         ( 
                         
                           cos 
                            
                           
                               
                           
                            
                           θ 
                         
                         ) 
                       
                     
                      
                     
                       
                         trg 
                         m 
                       
                        
                       
                         ( 
                         φ 
                         ) 
                       
                     
                   
                 
               
               
                 
                   ( 
                   50 
                   ) 
                 
               
             
           
         
       
     
         [0000]    with 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       trg 
                       m 
                     
                      
                     
                       ( 
                       φ 
                       ) 
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                             
                               
                                 2 
                               
                                
                               
                                 cos 
                                  
                                 
                                   ( 
                                   
                                     m 
                                      
                                     
                                         
                                     
                                      
                                     φ 
                                   
                                   ) 
                                 
                               
                             
                           
                           
                             
                               m 
                               &gt; 
                               0 
                             
                           
                         
                         
                           
                             1 
                           
                           
                             
                               m 
                               = 
                               0 
                             
                           
                         
                         
                           
                             
                               
                                 - 
                                 
                                   2 
                                 
                               
                                
                               
                                 sin 
                                  
                                 
                                   ( 
                                   
                                     m 
                                      
                                     
                                         
                                     
                                      
                                     φ 
                                   
                                   ) 
                                 
                               
                             
                           
                           
                             
                               m 
                               &lt; 
                               0 
                             
                           
                         
                       
                       . 
                     
                   
                 
               
               
                 
                   ( 
                   51 
                   ) 
                 
               
             
           
         
       
     
         [0144]    The associated Legendre functions P n,m (x) are defined as 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         P 
                         
                           n 
                           , 
                           m 
                         
                       
                        
                       
                         ( 
                         x 
                         ) 
                       
                     
                     = 
                     
                       
                         
                           ( 
                           
                             1 
                             - 
                             
                               x 
                               2 
                             
                           
                           ) 
                         
                         
                           m 
                           - 
                           2 
                         
                       
                        
                       
                         
                           d 
                           m 
                         
                         
                           dx 
                           m 
                         
                       
                        
                       
                         
                           P 
                           n 
                         
                          
                         
                           ( 
                           x 
                           ) 
                         
                       
                     
                   
                   , 
                   
                     m 
                     ≥ 
                     0 
                   
                 
               
               
                 
                   ( 
                   52 
                   ) 
                 
               
             
           
         
       
     
         [0000]    with the Legendre polynomial P n (x) and, unlike in E. G. Williams, “Fourier Acoustics”, vol. 93 of Applied Mathematical Sciences, Academic Press, 1999, without the Condon-Shortley phase term (−1) m . 
       Spherical Harmonic Transform 
       [0145]    If the spatial representation of an HOA sequence is discretised at a number of O spatial directions Ω o , 1≦o≦O, which are nearly uniformly distributed on the unit sphere, O directional signals c(t,Ω o ) are obtained. Collecting these signals into a vector as 
         [0000]        c   SPAT ( t ):=[ c ( t,Ω   1 ) . . .  c ( t,Ω   O )] T ,  (53)
 
         [0000]    it can be computed from the continuous Ambisonics representation c(t) defined in equation (48) by a simple matrix multiplication as 
         [0000]        c   SPAT ( t )=Ψ H   c ( t ),  (54)
 
         [0000]    where (·) H  indicates the joint transposition and conjugation, and Ψ denotes a mode-matrix defined by 
         [0000]      Ψ:=[ S   1    . . . S   O ]  (55)
 
         [0000]      with 
         [0000]        S   O   :=[S   0   0 (Ω O ) S   1   −1 (Ω o ) 1   0 (Ω O ) S   1   1 (Ω O ) . . .  S   N   N−1 (Ω O ) S   N   N (Ω O )].  (56)
 
         [0146]    Since the directions Ω O  are nearly uniformly distributed on the unit sphere, the mode matrix is invertible in general. Hence, the continuous Ambisonics representation can be computed from the directional signals c(t,Ω o ) by 
         [0000]        c ( t )=Ψ −H   c   SPAT ( t ).  (57)
 
         [0147]    Both equations constitute a transform and an inverse transform between the Ambisonics representation and the spatial domain. These transforms are called the Spherical Harmonic Transform and the inverse Spherical Harmonic Transform. Because the directions Ω O  are nearly uniformly distributed on the unit sphere, the approximation 
         [0000]      Ψ H ≈Ψ −1   (58)
 
         [0000]    is available, which justifies the use of Ψ −1  instead of Ψ H  in equation (54). Advantageously, all the mentioned relations are valid for the discrete-time domain, too. 
         [0148]    The described processing can be carried out by a single processor or electronic circuit, or by several processors or electronic circuits operating in parallel and/or operating on different parts of the complete processing. 
         [0149]    The instructions for operating the processor or the processors according to the described processing can be stored in one or more memories. The at least one processor is configured to carry out these instructions.