Method, medium, and apparatus with scalable channel decoding

Abstract

A method, medium, and apparatus with scalable channel decoding. The method includes recognizing the configuration of channels or speakers, calculating the respective number of same path decoding levels for each multi-channel signal using the recognized configuration of the channels or speakers, and performing decoding and up-mixing according to the calculated respective number of decoding levels.

Description

BACKGROUND

1. Field of the Invention

One or more embodiments of the present invention relate to audio coding, and more particularly, to surround audio coding for an encoding/decoding for multi-channel signals.

2. Description of the Related Art

Multi-channel audio coding can be classified into waveform multi-channel audio coding and parametric multi-channel audio coding. Waveform multi-channel audio coding can be classified into moving picture experts group (MPEG)-2 MC audio coding, AAC MC audio coding, and BSAC/AVS MC audio coding, where 5 channel signals are encoded and 5 channel signals are decoded. Parametric multi-channel audio coding includes MPEG surround coding, where the encoding generates 1 or 2 encoded channels from 6 or 8 multi-channels, and then the 6 or 8 multi-channels are decoded from the 1 or 2 encoded channels. Here, such 6 or 8 multi-channels are merely examples of such a multi-channel environment.

Generally, in such multi-channel audio coding, the number of channels to be output from a decoder is fixed by encoder. For example, in MPEG surround coding, an encoder may encode 6 or 8 multi-channel signals into the 1 or 2 encoded channels, and a decoder must decode the 1 or 2 encoded channels to 6 or 8 multi-channels, i.e., due to the staging of encoding of the multi-channel signals by the encoder all available channels are decoded in a similar reverse order staging before any particular channels are output. Thus, if the number of speakers to be used for reproduction and a channel configuration corresponding to positions of the speakers in the decoder are different from the number of channels configured in the encoder, sound quality is degraded during up-mixing in the decoder.

According to the MPEG surround specification, multi-channel signals can be encoded through a staging of down-mixing modules, which can sequentially down-mix the multi-channel signals ultimately to the one or two encoded channels. The one or two encoded channels can be decoded to the multi-channel signal through a similar staging (tree structure) of up-mixing modules. Here, for example, the up-mixing stages initially receive the encoded down-mixed signal(s) and up-mix the encoded down-mixed signal(s) to multi-channel signals of a Front Left (FL) channel, a Front Right (FR) channel, a Center (C) channel, a Low Frequency Enhancement (LFE) channel, a Back Left (BL) channel, and a Back Right (BR) channel, using combinations of 1-to-2 (OTT) up-mixing modules. Here, the up-mixing of the stages of OTT modules can be accomplished with spatial information (spatial cues) of Channel Level Differences (CLDs) and/or Inter-Channel Correlations (ICCs) generated by the encoder during the encoding of the multi-channel signals, with the CLD being information about an energy ratio or difference between predetermined channels in multi-channels, and with the ICC being information about correlation or coherence corresponding to a time/frequency tile of input signals. With respective CLDs and ICCs, each staged OTT can up-mix a single input signal to respective output signals through each staged OTT. See FIGS. 4-8 as examples of staged up-mixing tree structures according to embodiments of the present invention.

Thus, due to this requirement of the decoder having to have a particular staged structure mirroring the staging of the encoder, and due to the conventional ordering of down-mixing, it is difficult to selectively decode encoded channels based upon the number or speakers to be used for reproduction or a corresponding channel configuration corresponding to the positions of the speakers in the decoder.

SUMMARY

One or more embodiments of the present invention set forth a method, medium, and apparatus with scalable channel decoding, wherein a configuration of channels or speakers in a decoder is recognized to calculate the number of levels to be decoded for each multi-channel signal encoded by an encoder and to perform decoding according to the calculated number of levels.

Additional aspects and/or advantages of the invention will be set forth in part in the description which follows and, in part, will be apparent from the description, or may be learned by practice of the invention.

To achieve at least the above and/or other aspects and advantages, an embodiment of the present invention includes a method for scalable channel decoding, the method including setting a number of decoding levels for at least one encoded multi-channel signal, and performing selective decoding and up-mixing of the at least one encoded multi-channel signal according to the set number of decoding levels such that when the set number of decoding levels is set to indicate a full number of decoding levels all levels of the at least one encoded multi-channel signal are decoded and up-mixed and when the set number of decoding levels is set to indicate a number of decoding levels different from the full number of decoding levels not all available decoding levels of the at least one encoded multi-channel signal are decoded and up-mixed.

To achieve at least the above and/or other aspects and advantages, an embodiment of the present invention includes at least one medium including computer readable code to control at least one processing element to implement an embodiment of the present invention.

To achieve at least the above and/or other aspects and advantages, an embodiment of the present invention includes an apparatus with scalable channel decoding, the apparatus including a level setting unit to set a number of decoding levels for at least one encoded multi-channel signal, and an up-mixing unit to perform selective decoding and up-mixing of the at least one encoded multi-channel signal according to the set number of decoding levels such that when the set number of decoding levels is set to indicate a full number of decoding levels all levels of the at least one encoded multi-channel signal are decoded and up-mixed and when the set number of decoding levels is set to indicate a number of decoding levels different from the full number of decoding levels not all available decoding levels of the at least one encoded multi-channel signal are decoded and up-mixed.

To achieve at least the above and/or other aspects and advantages, an embodiment of the present invention includes a method for scalable channel decoding, the method including recognizing a configuration of channels or speakers for a decoder, and selectively up-mixing at least one down-mixed encoded multi-channel signal to a multi-channel signal corresponding to the recognized configuration of the channels or speakers.

To achieve at least the above and/or other aspects and advantages, an embodiment of the present invention includes a method for scalable channel decoding, the method including recognizing a configuration of channels or speakers for a decoder, setting a number of modules through which respective up-mixed signals up-mixed from at least one down-mixed encoded multi-channel signal pass based on the recognized configuration of the channels or speakers, and performing selective decoding and up-mixing of the at least one down-mixed encoded multi-channel signal according to the set number of modules.

To achieve at least the above and/or other aspects and advantages, an embodiment of the present invention includes a method for scalable channel decoding, the method including recognizing a configuration of channels or speakers for a decoder, determining whether to decode a channel, of a plurality of channels represented by at least one down-mixed encoded multi-channel signal, based upon availability of reproducing the channel by the decoder, determining whether there are multi-channels to be decoded in a same path except for a multi-channel that is determined not to be decoded by the determining of whether to decode the channel, calculating a number of decoding and up-mixing modules through which each multi-channel signal has to pass according to the determining of whether there are multi-channels to be decoded in the same path except for the multi-channel that is determined not to be decoded, and performing selective decoding and up-mixing according to the calculated number of decoding and up-mixing modules.

BRIEF DESCRIPTION OF THE DRAWINGS

These and/or other aspects and advantages of the invention will become apparent and more readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:

FIG. 1 illustrates a multi-channel decoding method, according to an embodiment of the present invention;

FIG. 2 illustrates an apparatus with scalable channel decoding, according to an embodiment of the present invention;

FIG. 3 illustrates a complex structure of a 5-2-5 tree structure and an arbitrary tree structure, according to an embodiment of the present invention;

FIG. 4 illustrates a predetermined tree structure for explaining a method, medium, and apparatus with scalable channel decoding, according to an embodiment of the present invention;

FIG. 5 illustrates 4 channels being output in a 5-1-5₁ tree structure, according to an embodiment of the present invention;

FIG. 6 illustrates 4 channels being output in a 5-1-5₂ tree structure, according to an embodiment of the present invention;

FIG. 7 illustrates 3 channels being output in a 5-1-5₁ tree structure, according to an embodiment of the present invention;

FIG. 8 illustrates 3 channels being output in a 5-1-5₂ tree structure, according to an embodiment of the present invention;

FIG. 9 illustrates a pseudo code for setting Tree_sign(v,) using a method, medium, and apparatus with scalable channel decoding, according to an embodiment of the present invention; and

FIG. 10 illustrates a pseudo code for removing a component of a matrix or of a vector corresponding to an unnecessary module using a method, medium, and apparatus with scalable channel decoding, according to an embodiment of the present invention.

DETAILED DESCRIPTION

Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like reference numerals refer to the like elements throughout. Embodiments are described below to explain the present invention by referring to the figures.

FIG. 1 illustrating a multi-channel decoding method, according to an embodiment of the present invention.

First, a surround bitstream transmitted from an encoder is parsed to extract spatial cues and additional information, in operation 100. A configuration of channels or speakers provided in a decoder is recognized, in operation 103. Here, the configuration of multi-channels in the decoder corresponds to the number of speakers included/available in/to the decoder (below referenced as “numPlayChan”), the positions of operable speakers among the speakers included/available in/to the decoder (below referenced as “playChanPos(ch)”), and a vector indicating whether a channel encoded in the encoder is available in the multi-channels provided in the decoder (below referenced as “bPlaySpk(ch)”).

Here, bPlaySpk(ch) expresses, among channels encoded in the encoder, a speaker that is available in multi-channels provided in the decoder using a ‘1’, and a speaker that is not available in the multi-channels using a ‘0’, as in the below Equation 1, for example.

$\begin{array}{cc}\mathrm{bPlaySpk}\left(i\right)=\{\begin{array}{cc}1,& \mathrm{if}\mathrm{the}\mathrm{loudspeaker}\mathrm{position}\mathrm{of}{i}^{\mathrm{th}}\\ & \mathrm{output}\mathrm{channel}\in \mathrm{playChanPos}\\ 0,& \mathrm{otherwise}\end{array}\mathrm{for}0\le i\le \mathrm{numOutChanAT}& \mathrm{Equation}1\end{array}$

Similarly, the referenced numOutChanAT can be calculated with the below Equation 2.

$\begin{array}{cc}\mathrm{numOutChaAT}=\sum _{k=0}^{\mathrm{numOutChan}-1}{\mathrm{Tree}}_{\mathrm{OutChan}}\left(k\right)& \mathrm{Equation}2\end{array}$

Further, the referenced playChanPos can be expressed for, e.g., a 5.1 channel system, using the below Equation 3.playChanPos=[FL FR C LFE BL BR]  Equation 3:

In operation 106, it may be determined to not decode a channel that is not available in the multi-channels, for example.

A matrix Tree_sign(v,) may include components indicating whether each output signal is to be output to an upper level of an OTT module (in which case, the component is expressed with a ‘1’) or whether each output signal is to be output to a lower level of the OTT module (in which case the component is expressed with a ‘−1’), e.g., as in tree structures illustrated in FIGS. 3 through 8. In the matrix Tree_sign(v,), v is greater than 0 and less than numOutChan. Hereinafter, embodiments of the present invention will be described using the matrix Tree_sign(v,), but it can be understood by those skilled in the art that embodiments of the present invention can be implemented without being limited to such a matrix Tree_sign(v,). For example, a matrix that is obtained by exchanging rows and columns of the matrix Tree_sign(v,) may be used, noting that alternate methodologies for implementing the invention may equally be utilized.

For example, in a tree structure illustrated in FIG. 4, in a matrix Tree_sign, a first column to be output to an upper level from Box 0, an upper level from Box 1, and an upper level from Box 2 is indicated by [1 1 1], and a fourth column to be output to a lower level from Box 0 and an upper level from Box 3 is indicated by [−1 1 n/a]. Here, ‘n/a’ is an identifier indicating a corresponding channel, module, or box is not available. In this way, all multi-channels can be expressed with Tree_sign as follows:

${\mathrm{Tree}}_{\mathrm{sign}}=\left(\begin{array}{cccccc}1& 1& 1& -1& -1& -1\\ 1& 1& -1& 1& -1& -1\\ 1& -1& n/a& n/a& 1& -1\end{array}\right)$

In operation 106, a column corresponding to a channel that is not available in the multi-channels provided in the decoder, among the channels encoded in the encoder, are all set to ‘n/a’ in the matrix Tree_sign(v,).

For example, in the tree structure illustrated in FIG. 4, the vector bPlaySpk, indicating whether a channel encoded in the encoder is available in the multi-channels provided in the decoder, is expressed with a ‘0’ in a second channel and a fourth channel. Thus, the second channel and the fourth channel among the multi-channels provided in the decoder are not available in the multi-channels provided in the decoder. Thus, in operation 106, a second column and a fourth column corresponding to the second channel and the fourth channel are set to n/a in the matrix Tree_sign, thereby generating Tree′_sign.

${\mathrm{Tree}}_{\mathrm{sign}}^{\prime }=\left(\begin{array}{cccccc}1& n/a& 1& n/a& -1& -1\\ 1& n/a& -1& n/a& -1& -1\\ 1& n/a& n/a& n/a& 1& -1\end{array}\right)$

In operation 108, it is determined whether there are multi-channels to be decoded in the same path, except for the channel that is determined not to be decoded in operation 106. In operation 108, on the assumption that predetermined integers j and k are not equal to each other in a matrix Tree_sign (v,i,j) set in operation 106, it is determined whether Tree_sign(v,0:i−1,j) and Tree_sign (v,0:i−1,k) are the same in order to determine whether there are multi-channels to be decoded in the same path.

For example, in the tree structure illustrated in FIG. 4, since Tree_sign(v,0:1,1) and Tree_sign (v,0:1,3) are not the same as each other, a first channel and a third channel in the matrix Tree′_sign generated in operation 106 are determined as multi-channels that are not to be decoded in the same path in operation 108. However, since Tree_sign(v,0:1,5) and Tree_sign (v,0:1,6) are the same as each other, fifth channel and a sixth channel in the matrix Tree′_sign generated in operation 106 are determined as multi-channels that are to be decoded in the same path in operation 108.

In operation 110, a decoding level is reduced for channels determined as multi-channels that are not to be decoded in the same path in operation 108. Here, the decoding level indicates the number of modules or boxes for decoding, like an OTT module or a 2-to-3 (TTT) module, through which a signal has to pass to be output from each of the multi-channels. A decoding level that is finally determined for channels determined as multi-channels that are not to be decoded in the same path in operation 108 is expressed as n/a.

For example, in the tree structure illustrated in FIG. 4, since the first channel and the third channel are determined as multi-channels that are not to be decoded in the same path in operation 108, the last row of a first column corresponding to the first channel and the last row of a third column corresponding to the third channel are set to n/a as follows:

${\mathrm{Tree}}_{\mathrm{sign}}^{\prime }=\left(\begin{array}{cccccc}1& n/a& 1& n/a& -1& -1\\ 1& n/a& -1& n/a& -1& -1\\ n/a& n/a& n/a& n/a& 1& -1\end{array}\right)$

Operations 108 and 110 may be repeated while the decoding level is reduced one-by-one. Thus, operations 108 and 110 can be repeated from the last row to the first row of Tree_sign(v,) on a row-by-row basis.

In operations 106 through 110, Tree_sign(v,) may be set for each sub-tree using a pseudo code, such as that illustrated in FIG. 9.

In operation 113, the number of decoding levels may be calculated for each of the multi-channels using the result obtained in operation 110.

The number of decoding levels may be calculated according to the following Equation 4.

$\begin{array}{cc}\mathrm{DL}\left(v\right)=\left[\begin{array}{cccc}{\mathrm{dl}}_{i_{\mathrm{offset}\left(v\right)}}& {\mathrm{dl}}_{i_{\mathrm{offset}\left(v\right)}+1}& \dots & {\mathrm{dl}}_{i_{\mathrm{offset}\left(v\right)}+{\mathrm{Tree}}_{\mathrm{outChan}}\left(v\right)-1}\end{array}\right]\mathrm{where}{i}_{\mathrm{offset}}\left(v\right)=\{\begin{array}{cc}\sum _{k=0}^{v-1}{\mathrm{Tree}}_{\mathrm{outChan}}\left(k\right),& v>0\\ 0& \mathrm{otherwise}\end{array},0<=v<\mathrm{numOutChan}{\mathrm{dl}}_{i_{\mathrm{offset}}\left(v\right)+i}=\{\begin{array}{cc}\sum _{j=0}^{{\mathrm{Tree}}_{\mathrm{depth}}\left(v,1\right)-1}\mathrm{abs}\left({\mathrm{Tree}}_{\mathrm{sign}}\left(v,j,i\right)\right),& \begin{array}{c}\mathrm{if}\mathrm{bPlaySpk}\left[i\right]\\ \mathrm{is}\mathrm{equal}\mathrm{to}1\end{array}\\ -1,& \mathrm{otherwise}\end{array},\mathrm{for}0\le i<{\mathrm{Tree}}_{\mathrm{outChan}}\left(v\right),0\le v<\mathrm{numOutChan}\mathrm{where}\mathrm{abs}\left(n/a\right)=0,i_{\mathrm{offset}}\left(v\right)=\{\begin{array}{cc}\sum _{k=0}^{v-1}{\mathrm{Tree}}_{\mathrm{outChan}}\left(k\right),& v>0\\ 0& \mathrm{otherwise}\end{array}& \mathrm{Equation}4\end{array}$

For example, in the tree structure illustrated in FIG. 4, the number of decoding levels of the matrix Tree′_sign, set in operation 110, may be calculated as follows:DL=[2 −1 2 −1 3 3]

Since the absolute value of n/a is assumed to be 0 and a column whose components are all n/a is assumed to be −1, the sum of absolute values of components of the first column in the matrix Tree′_sign is 2 and the second column whose components are all n/a in the matrix Tree′_sign is set to −1.

By using the DL calculated as described above, modules before a dotted line illustrated in FIG. 4 perform decoding, thereby implementing scalable decoding.

In operation 116, spatial cues extracted in operation 100 may be selectively smoothed in order to prevent a sharp change in the spatial cues at low bitrates.

In operation 119, for compatibility with a conventional matrix surround techniques, a gain and pre-vectors may be calculated for each additional channel and a parameter for compensating for a gain for each channel may be extracted in the case of the use of an external downmix at the decoder, thereby generating a matrix R₁. R₁ is used to generate a signal to be input to a decorrelator for decorrelation.

For example, in this embodiment it will be assumed that a 5-1-5₁ tree structure, illustrated in FIG. 5, and a 5-1-5₂ tree structure, illustrated in FIG. 6, are set to the following matrices.

$\mathrm{Tree}\left(0,,\right)=\left[\begin{array}{cccccc}0& 0& 0& 0& 0& 0\\ 1& 1& 1& 1& 2& 2\\ 3& 3& 4& 4& n/a& n/a\end{array}\right],{\mathrm{Tree}}_{\mathrm{sign}}\left(0,,\right)=\left[\begin{array}{cccccc}1& 1& 1& 1& -1& -1\\ 1& 1& -1& -1& 1& -1\\ 1& -1& 1& -1& n/a& n/a\end{array}\right],{\mathrm{Tree}}_{\mathrm{depth}}\left(0,\right)=\left[\begin{array}{cccccc}3& 3& 3& 3& 2& 2\end{array}\right],{\mathrm{Tree}}_{\mathrm{outChan}}\left(0\right)=\left[6\right].$

In this case, in the 5-1-5₁ tree structure, R₁ is calculated as follows, in operation 119.

$R_1^{l,m}=\left[\begin{array}{c}1\\ 1\\ K1\\ K2\\ K3\end{array}\right],\mathrm{where}\begin{array}{c}K1=\{\begin{array}{cc}{c}_{1,{\mathrm{OTT}}_0}^{l,m},& \sum _{i=0}^3\mathrm{DL}\left(0,i\right)!=-4\\ 0,& \mathrm{otherwise}\end{array}\\ K2=\{\begin{array}{cc}{c}_{1,{\mathrm{OTT}}_0}^{l,m}{c}_{1,{\mathrm{OTT}}_1}^{l,m},& \mathrm{DL}\left(0,0\right)=3,\\ & \mathrm{DL}\left(0,1\right)=3\\ 0,& \mathrm{otherwise}\end{array}\\ K3=\{\begin{array}{cc}{c}_{2,{\mathrm{OTT}}_0}^{l,m},& \mathrm{DL}\left(0,4\right)=2,\mathrm{DL}\left(0,5\right)=2\\ 0,& \mathrm{otherwise}\end{array}\end{array},,\mathrm{where}$ $c_{1,{\mathrm{OTT}}_X}^{l,m}=\sqrt{\frac{{10}^{\frac{{\mathrm{CLD}}_X^{l,m}}{10}}}{1+{10}^{\frac{{\mathrm{CLD}}_X^{l,m}}{10}}}}\mathrm{and}{c}_{2,{\mathrm{OTT}}_X}^{l,m}=\sqrt{\frac{1}{1+{10}^{\frac{{\mathrm{CLD}}_X^{l,m}}{10}}}},|\mathrm{and}\mathrm{where}\text{:}$ ${\mathrm{CLD}}_X^{l,m}=D_{\mathrm{CLD}}\left(X,l,m\right),0\le X<2,0\le m<M_{\mathrm{proc}},0\le l<L.$

In this case, in the 5-1-5₂ tree structure, R₁ may be calculated as follows, in operation 119.

$R_1^{l,m}=\left[\begin{array}{c}1\\ 1\\ K1\\ K2\\ K3\end{array}\right],\mathrm{where}\begin{array}{c}K1=\{\begin{array}{cc}{c}_{1,{\mathrm{OTT}}_0}^{l,m},& \sum _{i=0}^3\mathrm{DL}\left(0,i\right)!=-4\\ 0,& \mathrm{otherwise}\end{array}\\ K2=\{\begin{array}{cc}{c}_{1,{\mathrm{OTT}}_0}^{l,m}{c}_{1,{\mathrm{OTT}}_1}^{l,m},& \mathrm{DL}\left(0,0\right)=3,\\ & \mathrm{DL}\left(0,1\right)=3\\ 0,& \mathrm{otherwise}\end{array}\\ K3=\{\begin{array}{cc}{c}_{2,{\mathrm{OTT}}_0}^{l,m}{c}_{2,{\mathrm{OTT}}_1}^{l,m},& \mathrm{DL}\left(0,2\right)=3,\\ & \mathrm{DL}\left(0,3\right)=3\\ 0,& \mathrm{otherwise}\end{array}\end{array},,\mathrm{where}{c}_{1,{\mathrm{OTT}}_X}^{l,m}=\sqrt{\frac{{10}^{\frac{{\mathrm{CLD}}_X^{l,m}}{10}}}{1+{10}^{\frac{{\mathrm{CLD}}_X^{l,m}}{10}}}}\mathrm{and}{c}_{2,{\mathrm{OTT}}_X}^{l,m}=\sqrt{\frac{1}{1+{10}^{\frac{{\mathrm{CLD}}_X^{l,m}}{10}}}},\mathrm{and}\mathrm{where}\text{:}$ ${\mathrm{CLD}}_X^{l,m}=D_{\mathrm{CLD}}\left(X,l,m\right),0\le X<2,0\le m<M_{\mathrm{proc}},0\le l<L$

In operation 120, the matrix R₁ generated in operation 119 is interpolated in order to generate a matrix M₁.

In operation 123, a matrix R₂ for mixing a decorrelated signal with a direct signal may be generated. In order for a module determined as an unnecessary module, in operations 106 through 113, not to perform decoding, the matrix R₂ generated in operation 123 removes a component of a matrix or of a vector corresponding to the unnecessary module using a pseudo code, such as that illustrated in FIG. 10.

Hereinafter, examples for application to the 5-1-5₁ tree structure and the 5-1-5₂ tree structure will be described.

First, FIG. 5 illustrates the case where only 4 channels are output in the 5-1-5₁ tree structure. If operations 103 through 113 are performed for the 5-1-5₁ tree structure illustrated in FIG. 5, Tree′_sign(0,,) and DL(0,) are generated as follows:

${\mathrm{Tree}}_{\mathrm{sign}}^{\prime }\left(0,,\right)=\left[\begin{array}{cccccc}1& 1& 1& n/a& -1& n/a\\ 1& 1& -1& n/a& n/a& n/a\\ 1& -1& n/a& n/a& n/a& n/a\end{array}\right],\mathrm{DL}\left(0,\right)=\left[\begin{array}{cccccc}3& 3& 2& -1& 1& -1\end{array}\right].$

Decoding is stopped in a module before the illustrated dotted lines by the generated DL(0,). Thus, since OTT2 and OTT4 do not perform up-mixing, the matrix R₂ can be generated in operation 126 as follows:

$R_2^{l,m}=\left[\begin{array}{ccccc}H{11}_{{\mathrm{OTT}}_3}^{l,m}H{11}_{{\mathrm{OTT}}_1}^{l,m}H{11}_{{\mathrm{OTT}}_0}^{l,m}& H{11}_{{\mathrm{OTT}}_3}^{l,m}H{11}_{{\mathrm{OTT}}_1}^{l,m}H{12}_{{\mathrm{OTT}}_0}^{l,m}& H{11}_{{\mathrm{OTT}}_3}^{l,m}H{12}_{{\mathrm{OTT}}_1}^{l,m}& H{12}_{{\mathrm{OTT}}_3}^{l,m}& 0\\ H{21}_{{\mathrm{OTT}}_3}^{l,m}H{11}_{{\mathrm{OTT}}_1}^{l,m}H{11}_{{\mathrm{OTT}}_0}^{l,m}& H{21}_{{\mathrm{OTT}}_3}^{l,m}H{11}_{{\mathrm{OTT}}_1}^{l,m}H{12}_{{\mathrm{OTT}}_0}^{l,m}& H{21}_{{\mathrm{OTT}}_3}^{l,m}H{12}_{{\mathrm{OTT}}_1}^{l,m}& H{22}_{{\mathrm{OTT}}_3}^{l,m}& 0\\ H{21}_{{\mathrm{OTT}}_1}^{l,m}H{11}_{{\mathrm{OTT}}_0}^{l,m}& H{21}_{{\mathrm{OTT}}_1}^{l,m}H{12}_{{\mathrm{OTT}}_0}^{l,m}& H{22}_{{\mathrm{OTT}}_1}^{l,m}& 0& 0\\ 0& 0& 0& 0& 0\\ H{21}_{{\mathrm{OTT}}_0}^{l,m}& H{22}_{{\mathrm{OTT}}_0}^{l,m}& 0& 0& 0\\ 0& 0& 0& 0& 0\end{array}\right]$

Second, FIG. 6 illustrates the case where only 4 channels are output in the 5-1-5₂ tree structure. If operations 103 through 113 are performed for the 5-1-5₂ tree structure illustrated in FIG. 6, Tree′_sign (0,,) and DL(0,) are generated as follows:

${\mathrm{Tree}}_{\mathrm{sign}}^{\prime }\left(0,,\right)=\left[\begin{array}{cccccc}1& 1& 1& 1& n/a& n/a\\ 1& 1& -1& -1& n/a& n/a\\ 1& -1& 1& -1& n/a& n/a\end{array}\right],\mathrm{DL}\left(0,\right)=\left[\begin{array}{cccccc}3& 3& 3& 3& -1& -1\end{array}\right].$

Decoding is thus stopped in a module before the dotted lines by the generated DL(0,).

FIG. 7 illustrates the case where only 3 channels are output in the 5-1-5₁ tree structure. In this case, after operations 103 through 113 are performed, Tree′_sign(0,,) and DL(0,) are generated as follows:

${\mathrm{Tree}}_{\mathrm{sign}}^{\prime }\left(0,,\right)=\left[\begin{array}{cccccc}1& 1& 1& n/a& n/a& n/a\\ 1& 1& -1& n/a& n/a& n/a\\ 1& -1& n/a& n/a& n/a& n/a\end{array}\right],\mathrm{DL}\left(0,\right)=\left[\begin{array}{cccccc}3& 3& 2& -1& -1& -1\end{array}\right].$

Decoding is thus stopped in the module before the dotted lines by the generated DL(0,).

FIG. 8 illustrates the case where only 3 channels are output in the 5-1-5₂ tree structure. In this case, after operations 103 through 113 are performed, Tree′_sign(0,,) and DL(0,) are generated as follows:

${\mathrm{Tree}}_{\mathrm{sign}}^{\prime }\left(0,,\right)=\left[\begin{array}{cccccc}1& n/a& 1& n/a& -1& n/a\\ 1& n/a& -1& n/a& n/a& n/a\\ n/a& n/a& n/a& n/a& n/a& n/a\end{array}\right],\mathrm{DL}\left(0,\right)=\left[\begin{array}{cccccc}2& -1& 2& -1& 1& -1\end{array}\right].$

Here, decoding is stopped in the module before the dotted lines by the generated DL(0,).

For further example application to a 5-2-5 tree structure, a 7-2-7₁ tree structure, and a 7-2-7₂ tree structure, the corresponding Tree_sign and Tree_depth can also be defined.

First, in the 5-2-5 tree structure, Tree_sign, Tree_depth, and R₁ may be defined as follows:

${\mathrm{Tree}}_{\mathrm{sign}}\left(0,,\right)={\mathrm{Tree}}_{\mathrm{sign}}\left(1,,\right)={\mathrm{Tree}}_{\mathrm{sign}}\left(2,,\right)=\left[\begin{array}{cc}1& -1\end{array}\right],{\mathrm{Tree}}_{\mathrm{depth}}\left(0,\right)={\mathrm{Tree}}_{\mathrm{depth}}\left(1,\right)={\mathrm{Tree}}_{\mathrm{depth}}\left(2,\right)=\left[\begin{array}{cc}1& 1\end{array}\right].R_1^{l,m}\left(i,j\right)=0,\mathrm{when}\sum _{k=0}^1\mathrm{DL}\left(i-3,k\right)!=2,\mathrm{for}3\le i<6,0\le j<3$

Second, in the 7-2-7₁ tree structure, Tree_sign, Tree_depth, and R₁ may be defined as follows:

${\mathrm{Tree}}_{\mathrm{sign}}\left(0,,\right)={\mathrm{Tree}}_{\mathrm{sign}}\left(1,,\right)=\left[\begin{array}{ccc}1& 1& -1\\ 1& -1& n/a\end{array}\right],{\mathrm{Tree}}_{\mathrm{sign}}\left(2,,\right)=\left[\begin{array}{cc}1& -1\end{array}\right]$ ${\mathrm{Tree}}_{\mathrm{depth}}\left(0,,\right)={\mathrm{Tree}}_{\mathrm{depth}}\left(1,\right)=\left[\begin{array}{ccc}2& 2& 1\end{array}\right]$ ${\mathrm{Tree}}_{\mathrm{depth}}\left(2,\right)=\left[\begin{array}{cc}1& 1\end{array}\right]$ $R_1^{l,m}\left(i,j\right)=0,\mathrm{when}\sum _{k=0}^2\mathrm{DL}\left(i-3,k\right)<1,\mathrm{for}3\le i<5,0\le j<3$ $R_1^{l,m}\left(5,j\right)=0,\mathrm{when}\sum _{k=0}^1\mathrm{DL}\left(2,k\right)!=2,\mathrm{for}0\le j<3$ $R_1^{l,m}\left(i,j\right)=0,\mathrm{when}\sum _{k=t1}^{t2}\mathrm{DL}\left(i-6,k\right)!=4,\mathrm{for}6\le i<8,0\le j<3|,\mathrm{where}t1=0,t2=1\mathrm{for}7\text{-}2\text{-}{7}_1\mathrm{configuration},t1=1,t2=2\mathrm{for}7\text{-}2\text{-}{7}_2\mathrm{configuration}$

Third, in the 7-2-7₁ tree structure, Tree_sign, Tree_depth and R₁ may be defined as follows:

$❘{\mathrm{Tree}}_{\mathrm{sign}}\left(0,,\right)={\mathrm{Tree}}_{\mathrm{sign}}\left(1,,\right)=\left[\begin{array}{ccc}-1& 1& 1\\ n/a& 1& 1\end{array}\right],{\mathrm{Tree}}_{\mathrm{sign}}\left(2,,\right)=\left[\begin{array}{cc}1& -1\end{array}\right]{\mathrm{Tree}}_{\mathrm{depth}}\left(0,\right)={\mathrm{Tree}}_{\mathrm{depth}}\left(1,\right)=\left[\begin{array}{ccc}1& 2& 2\end{array}\right],|{\mathrm{Tree}}_{\mathrm{depth}}\left(2,\right)=\left[\begin{array}{cc}1& 1\end{array}\right]R_1^{l,m}\left(i,j\right)=0,\mathrm{when}\sum _{k=0}^2\mathrm{DL}\left(i-3,k\right)<1,\mathrm{for}3\le i<5,0\le j<3R_1^{l,m}\left(5,j\right)=0,\mathrm{when}\sum _{k=0}^1\mathrm{DL}\left(2,k\right)!=2,\mathrm{for}0\le j<3R_1^{l,m}\left(i,j\right)=0,\mathrm{when}\sum _{k=t1}^{t2}\mathrm{DL}\left(i-6,k\right)!=4,\mathrm{for}6\le i<8,0\le j<3,\mathrm{where}t1=0,t2=1\mathrm{for}7\text{-}2\text{-}{7}_1\mathrm{configuration},t1=1,t2=2\mathrm{for}7\text{-}2\text{-}{7}_2\mathrm{configuration}$

Each of the 5-2-5 tree structure and the 7-2-7 tree structures can be divided into three sub trees. Thus, the matrix R₂ can be obtained in operation 123 using the same technique as applied to the 5-1-5 tree structure.

In operation 126, the matrix R₂ generated in operation 123 may be interpolated in order to generate a matrix M₂.

In operation 129, a residual coded signal obtained by coding a down-mixed signal and the original signal using AAC (Advanced Audio Coding) in the encoder may be decoded.

An MDCT coefficient decoded in operation 129 may further be transformed into a QMF domain in operation 130.

In operation 133, overlap-add between frames may be performed for a signal output in operation 130.

Further, since a low-frequency band signal has a low frequency resolution only with QMF filterbank, additional filtering may be performed on the low-frequency band signal in order to improve the frequency resolution in operation 136.

Still further, in operation 140, an input signal may be split according to frequency bands using QMF Hybrid analysis filter bank.

In operation 143, a direct signal and a signal to be decorrelated may be generated using the matrix M₁ generated in operation 120.

In operation 146, decorrelation may be performed on the generated signal to be decorrelated such that the generated signal can be reconstructed to have a sense of space.

In operation 148, the matrix M₂ generated in operation 126 may be applied to the signal decorrelated in operation 146 and the direct signal generated in operation 143.

In operation 150, temporal envelope shaping (TES) may be applied to the signal to which the matrix M₂ is applied in operation 148.

In operation 153, the signal to which TES is applied in operation 150 may be transformed into a time domain using QMF hybrid synthesis filter bank.

In operation 156, temporal processing (TP) may be applied to the signal transformed in operation 153.

Here, operations 153 and 156 may be performed to improve sound quality for a signal in which a temporal structure is important, such as applause, and may be selectively performed.

In operation 158, the direct signal and the decorrelated signal may thus be mixed.

Accordingly, a matrix R₃ may be calculated and applied to an arbitrary tree structure using the following equation:

${\mathrm{Tree}}_{\mathrm{depth}}\left(v,i\right)=\{\begin{array}{cc}\mathrm{DL}\left(v,i\right),& {\mathrm{Tree}}_{\mathrm{depth}}\left(v,i\right)>\mathrm{DL}\left(v,i\right),\\ {\mathrm{Tree}}_{\mathrm{depth}}\left(v,i\right),& \mathrm{otherwise}\end{array}\mathrm{for}0\le i<{\mathrm{Tree}}_{\mathrm{outchan}}\left(v\right),0\le v<\mathrm{numOutChan}{R}_g^{l,m}\left(i,v\right)=\{\begin{array}{cc}\begin{array}{c}{\mathrm{Tree}}_{\mathrm{depth}}\prod _{\rho =0}^{\left(i-i_{\mathrm{offset}}(,)\right)-1}\\ X_{\mathrm{Tree}\left(r,\rho ,i-i_{\mathrm{offset}}(,)\right)}\end{array},& \begin{array}{c}\begin{array}{c}\mathrm{if}{i}_{\mathrm{offset}}\left(v\right)\le i<i_{\mathrm{offset}}\left(v\right)+\\ {\mathrm{Tree}}_{\mathrm{outChan}}\left(v\right)\end{array},\\ {\mathrm{Tree}}_{\mathrm{depth}}\left(v,i-i_{\mathrm{offset}}\left(v\right)\right)>0\end{array}\\ 1,& \mathrm{else}\mathrm{if}{\mathrm{Tree}}_{\mathrm{depth}}\left(v,i-i_{\mathrm{offset}}\left(v\right)\right)=0\\ 0,& \mathrm{otherwise}\end{array},\mathrm{for}0\le i<\mathrm{numChanOutAT}\mathrm{and}0\le v<\mathrm{numOutChan}\mathrm{where}{i}_{\mathrm{offset}}\left(v\right)=\{\begin{array}{cc}\sum _{k=0}^{v-1}{\mathrm{Tree}}_{\mathrm{outChan}}\left(k\right),& v>0\\ 0& \mathrm{otherwise}\end{array}\mathrm{and}{X}_{\mathrm{Tree}\left(r,\rho ,i_{\mathrm{imp}}\right)}=\{\begin{array}{cc}{c}_{l,\mathrm{Mz}\left(r,\rho ,i_{\mathrm{imp}}\right)},& {\mathrm{Tree}}_{\mathrm{sign}}\left(v,{\mathrm{pi}}_{\mathrm{imp}}\right)=1\\ c_{r,\mathrm{Mz}\left(r,\rho ,i_{\mathrm{imp}}\right)},& {\mathrm{Tree}}_{\mathrm{sign}}\left(v,{\mathrm{pi}}_{\mathrm{imp}}\right)=-1\end{array}\mathrm{where}\mathrm{idx}\left(v,p,i_{\mathrm{imp}}\right)=\{\begin{array}{cc}\sum _{k=0}^{r-1}\left({\mathrm{Tree}}_{\mathrm{outChan}}\left(k\right)\right)+\mathrm{Tree}\left(v,p,i_{\mathrm{imp}}\right),& v>0\\ \mathrm{Tree}\left(v,p,i_{\mathrm{imp}}\right)& \mathrm{otherwise}\end{array}\mathrm{and}\mathrm{where}{c}_{l,X}=\sqrt{\frac{{\mathrm{CLD}}_{1\ln ,X}^2}{1+{\mathrm{CLD}}_{\ln ,X}^2}}\mathrm{and}{c}_{r,X=}\sqrt{\frac{1}{1+{\mathrm{CLD}}_{1\ln ,X}^2}},\mathrm{where}{\mathrm{CLD}}_{1\ln ,X}={10}^{\frac{{\mathrm{CLD}}_x}{20}}\mathrm{and}\mathrm{where}{\mathrm{CLD}}_x^{l,m}=D_{\mathrm{ATD}}\left(X,l,m\right),0\le m<M,0\le l<L.$

FIG. 2 illustrates an apparatus with scalable channel decoding, according to an embodiment of the present invention.

A bitstream decoder 200 may thus parse a surround bitstream transmitted from an encoder to extract spatial cues and additional information.

Similar to above, a configuration recognition unit 230 may recognize the configuration of channels or speakers provided/available in/to a decoder. The configuration of multi-channels in the decoder corresponds to the number of speakers included/available in/to the decoder (i.e., the aforementioned numPlayChan), the positions of operable speakers among the speakers included/available in/to the decoder (i.e., the aforementioned playChanPos(ch)), and a vector indicating whether a channel encoded in the encoder is available in the multi-channels provided in the decoder (i.e., the aforementioned bPlaySpk(ch)).

Here, bPlaySpk(ch) expresses, among channels encoded in the encoder, a channel that is available in multi-channels provided in the decoder using a ‘1’ and a channel that is not available in the multi-channels using ‘0’, according to the aforementioned Equation 1, repeated below.

$\begin{array}{cc}\mathrm{bPlaySpk}\left(i\right)=\{\begin{array}{cc}1,& \mathrm{if}\mathrm{the}\mathrm{loudspeaker}\mathrm{positon}\mathrm{of}{i}^{\mathrm{th}}\mathrm{output}\mathrm{channel}\in \mathrm{playChanPos}\\ 0,& \mathrm{otherwise}\end{array}\mathrm{for}0\le i\le \mathrm{numOutChanAT}& \mathrm{Equation}1\end{array}$

Again, the referenced numOutChanAT may be calculated according to the aforementioned Equation 2, repeated below.

$\begin{array}{cc}\mathrm{numOutChaAT}=\sum _{k=0}^{\mathrm{numOutChan}-1}{\mathrm{Tree}}_{\mathrm{OutChan}}\left(k\right)& \mathrm{Equation}2\end{array}$

Similarly, the referenced playChanPos may be, again, expressed for, e.g., a 5.1 channel system, according to the aforementioned Equation 3, repeated below.playChanPos=[FL FR C LFE BL BR]  Equation 3:

A level calculation unit 235 may calculate the number of decoding levels for each multi-channel signal, e.g., using the configuration of multi-channels recognized by the configuration recognition unit 230. Here, the level calculation unit 235 may include a decoding determination unit 240 and a first calculation unit 250, for example.

The decoding determination unit 240 may determine not to decode a channel, among channels encoded in the encoder, e.g., which may not be available in multi-channels, using the recognition result of the configuration recognition unit 230.

Thus, the aforementioned matrix Tree_sign(v,) may include components indicating whether each output signal is to be output to an upper level of an OTT module (in which case, the component may be expressed with a ‘1’) or whether each output signal is to be output to a lower level of the OTT module (in which case the component is expressed with a ‘−1’), e.g., as in tree structures illustrated in FIGS. 3 through 8. In the matrix Tree_sign(v,), v is greater than 0 and less than numOutChan. As noted above, embodiments of the present invention have been described using this matrix Tree_sign(v,), but it can be understood by those skilled in the art that embodiments of the present invention can be implemented without being limited to such a matrix Tree_sign(v,). For example, a matrix that is obtained by exchanging rows and columns of the matrix Tree_sign(v,) may equally be used, for example.

Again, as an example, in a tree structure illustrated in FIG. 4, in a matrix Tree_sign, a first column to be output to an upper level from Box 0, an upper level from Box 1, and an upper level from Box 2 is indicated by [1 1 1], and a fourth column to be output to a lower level from Box 0 and an upper level from Box 3 is indicated by [−1 1 n/a]. Here, ‘n/a’ is an identifier indicating a corresponding channel, module, or box is not available. In this way, all multi-channels can be expressed with Tree_sign as follows:

${\mathrm{Tree}}_{\mathrm{sign}}=\left(\begin{array}{cccccc}1& 1& 1& -1& -1& -1\\ 1& 1& -1& 1& -1& -1\\ 1& -1& n\text{/}a& n\text{/}a& 1& -1\end{array}\right)$

Thus, the decoding determination unit 240 may set a column corresponding to a channel that is not available in the multi-channels, for example as provided in the decoder, among the channels encoded in the encoder, to ‘n/a’ in the matrix Tree_sign.

For example, in the tree structure illustrated in FIG. 4, the vector bPlaySpk, indicating whether a channel encoded in the encoder is available in the multi-channels provided in the decoder, is expressed with a ‘0’ in a second channel and a fourth channel. Thus, the second channel and the fourth channel among the multi-channels provided in the decoder are not available in the multi-channels provided in the decoder. Thus, the decoding determination unit 240 may set a second column and a fourth column corresponding to the second channel and the fourth channel to n/a in the matrix Tree_sign, thereby generating Tree′_sign.

${\mathrm{Tree}}_{\mathrm{sign}}^{\prime }=\left(\begin{array}{cccccc}1& n\text{/}a& 1& n\text{/}a& -1& -1\\ 1& n\text{/}a& -1& n\text{/}a& -1& -1\\ 1& n\text{/}a& n\text{/}a& n\text{/}a& 1& -1\end{array}\right)$

The first calculation unit 250 may further determine whether there are multi-channels to be decoded in the same path, except for the channel that is determined not to be decoded by the decoding determination unit 240, for example, in order to calculate the number of decoding levels. Here, the decoding level indicates the number of modules or boxes for decoding, like an OTT module or a TTT module, through which a signal has to pass to be output from each of the multi-channels.

The first calculation unit 250 may, thus, include a path determination unit 252, a level reduction unit 254, and a second calculation unit 256, for example.

The path determination unit 252 may determine whether there are multi-channels to be decoded in the same path, except for the channel that is determined not to be decoded by the decoding determination unit 240. The path determination unit 252 determines whether Tree_sign(v,0:i−1,j) and Tree_sign(v,0:i−1,k) are the same in order to determine whether there are multi-channels to be decoded in the same path on the assumption that predetermined integers j and k are not equal in a matrix Tree_sign(v,i,j) set by the decoding determination unit 240.

For example, in the tree structure illustrated in FIG. 4, since Tree_sign(v,0:1,1) and Tree_sign(v,0:1,3) are not the same, the path determination unit 252 may determine a first channel and a third channel in the matrix Tree′_sign as multi-channels that are not to be decoded in the same path. However, since Tree_sign (v,0:1,5) and Tree_sign(v,0:1,6) are the same, the path determination unit 252 may determine a fifth channel and a sixth channel in the matrix Tree′_sign as multi-channels that are to be decoded in the same path.

The level reduction unit 254 may reduce a decoding level for channels that are determined, e.g., by the path determination unit 252, as multi-channels that are not to be decoded in the same path. Here, the decoding level indicates the number of modules or boxes for decoding, like an OTT module or a TTT module, through which a signal has to pass to be output from each of the multi-channels. A decoding level that is finally determined, e.g., by the path determination unit 252, for channels determined as multi-channels that are not to be decoded in the same path is expressed as n/a.

Again, as an example, in the tree structure illustrated in FIG. 4, since the first channel and the third channel are determined to be multi-channels that are not to be decoded in the same path, the last row of a first column corresponding to the first channel and the last row of a third column corresponding to the third channel are set to n/a as follows:

${\mathrm{Tree}}_{\mathrm{sign}}^{\prime }=\left(\begin{array}{cccccc}1& n\text{/}a& 1& n\text{/}a& -1& -1\\ 1& n\text{/}a& -1& n\text{/}a& -1& -1\\ n\text{/}a& n\text{/}a& n\text{/}a& n\text{/}a& 1& -1\end{array}\right)$

Thus, the path determination unit 252 and the level reduction unit 254 may repeat operations while reducing the decoding level one-by-one. Accordingly, the path determination unit 252 and the level reduction unit 254 may repeat operations from the last row to the first row of Tree_sign(v,) on a row-by-row basis, for example.

The level calculation unit 235 sets Tree_sign(v,) for each sub-tree using a pseudo code illustrated in FIG. 9.

Further, the second calculation unit 256 may calculate the number of decoding levels for each of the multi-channels, e.g., using the result obtained by the level reduction unit 254. Here, the second calculation unit 256 may calculate the number of decoding levels, as discussed above and repeated below, as follows:

$\begin{array}{c}\mathrm{DL}\left(v\right)=\left[{\mathrm{dl}}_{i_{\mathrm{offset}\left(v\right)}}{\mathrm{dl}}_{i_{\mathrm{offset}\left(v\right)}+1}\cdots {\mathrm{dl}}_{i_{\mathrm{offset}\left(v\right)}+{\mathrm{Tree}}_{\mathrm{outChan}}\left(v\right)-1}\right]\mathrm{where}\\ i_{\mathrm{offset}}\left(v\right)=\{\begin{array}{cc}\begin{array}{c}\sum _{k=0}^{v-1}{\mathrm{Tree}}_{\mathrm{outChan}}\left(k\right),\\ 0\end{array}& \begin{array}{c}v>0\\ \mathrm{otherwise}\end{array}\end{array},0<=v<\mathrm{numOutChan}\\ {\mathrm{dl}}_{i_{\mathrm{offset}}\left(v\right)+i}=\{\begin{array}{cc}\begin{array}{c}\sum _{j=0}^{{\mathrm{Tree}}_{\mathrm{depth}}\left(v,i\right)-1}\mathrm{abs}\left({\mathrm{Tree}}_{\mathrm{sign}}\left(v,j,i\right)\right),\\ -1,\end{array}& \begin{array}{c}\mathrm{if}\mathrm{bPlaySpk}\left[i\right]\mathrm{is}\mathrm{equal}\mathrm{to}1\\ \mathrm{otherwise}\end{array}\end{array},\\ \mathrm{for}0\le i<{\mathrm{Tree}}_{\mathrm{outChan}}\left(v\right),0\le v<\mathrm{numOutChan}\\ \mathrm{where}\mathrm{abs}\left(n\text{/}a\right)=0,\\ i_{\mathrm{offset}}\left(v\right)=\{\begin{array}{cc}\begin{array}{c}\sum _{k=0}^{v-1}{\mathrm{Tree}}_{\mathrm{outChan}}\left(k\right),\\ 0\end{array}& \begin{array}{c}v>0\\ \mathrm{otherwise}\end{array}\end{array}\end{array}$

For example, in the tree structure illustrated in FIG. 4, the number of decoding levels of the matrix Tree′_sign may be set by the level reduction unit 254 and may be calculated according to the repeated:DL=[2 −1 2 −1 3 3]

Since, in this embodiment, the absolute value of n/a may be assumed to be 0 and a column whose components are all n/a may be assumed to be −1, the sum of absolute values of components of the first column in the matrix Tree′_sign is 2 and the second column whose components are all n/a in the matrix Tree′_sign is set to −1.

By using the aforementioned DL, calculated as described above, modules before the dotted line illustrated in FIG. 4 may perform decoding, thereby implementing scalable decoding.

A control unit 260 may control generation of the aforementioned matrices R₁, R₂, and R₃ in order for an unnecessary module to not perform decoding, e.g., using the decoding level calculated by the second calculation unit 256.

A smoothing unit 202 may selectively smooth the extracted spatial cues, e.g., extracted by the bitstream decoder 200, in order to prevent a sharp change in the spatial cues at low bitrates.

For compatibility with a conventional matrix surround method, a matrix component calculation unit 204 may calculate a gain for each additional channel.

A pre-vector calculation unit 206 may further calculate pre-vectors.

An arbitrary downmix gain extraction unit 208 may extract a parameter for compensating for a gain for each channel in the case an external downmix is used at the decoder.

A matrix generation unit 212 may generate a matrix R₁, e.g., using the results output from the matrix component calculation unit 204, the pre-vector calculation unit 206, and the arbitrary downmix gain extraction unit 208. The matrix R₁ can be used for generation of a signal to be input to a decorrelator for decorrelation.

Again, as an example, the 5-1-5₁ tree structure illustrated in FIG. 5 and the 5-1-5₂ tree structure illustrated in FIG. 6 may be set to the aforementioned matrices, repeated below.

$\begin{array}{c}\mathrm{Tree}\left(0,,\right)=\left[\begin{array}{cccccc}0& 0& 0& 0& 0& 0\\ 1& 1& 1& 1& 2& 2\\ 3& 3& 4& 4& n\text{/}a& n\text{/}a\end{array}\right],\\ {\mathrm{Tree}}_{\mathrm{sign}}\left(0,,\right)=\left[\begin{array}{cccccc}1& 1& 1& 1& -1& -1\\ 1& 1& -1& -1& 1& -1\\ 1& -1& 1& -1& n\text{/}a& n\text{/}a\end{array}\right],\\ {\mathrm{Tree}}_{\mathrm{depth}}\left(0,\right)=\left[\begin{array}{cccccc}3& 3& 3& 3& 2& 2\end{array}\right],\\ {\mathrm{Tree}}_{\mathrm{outChan}}\left(0\right)=\left[6\right].\end{array}$

In the 5-1-5₁ tree structure, the matrix generation unit 212, for example, R₁, discussed above and repeated below.

$R_1^{l,m}=\left[\begin{array}{c}1\\ 1\\ K1\\ K2\\ K3\end{array}\right],\mathrm{where}\begin{array}{c}K1=\{\begin{array}{c}{c}_{1,{\mathrm{OTT}}_0}^{l,m},\sum _{i=0}^3\mathrm{DL}\left(0,i\right)!=-4\\ 0,\mathrm{otherwise}\end{array}\\ K2=\{\begin{array}{c}{c}_{1,{\mathrm{OTT}}_0}^{l,m}{c}_{1,{\mathrm{OTT}}_1}^{l,m},\mathrm{DL}\left(0,0\right)=3,\mathrm{DL}\left(0,1\right)=3\\ 0,\mathrm{otherwise}\end{array}\\ K3=\{\begin{array}{c}{c}_{2,{\mathrm{OTT}}_0}^{l,m},\mathrm{DL}\left(0,4\right)=2,\mathrm{DL}\left(0,5\right)=2\\ 0,\mathrm{otherwise}\end{array}\end{array},,\mathrm{where}$ $c_{1,{\mathrm{OTT}}_X}^{l,m}=\sqrt{\frac{{10}^{\frac{{\mathrm{CLD}}_X^{l,m}}{10}}}{1+{10}^{\frac{{\mathrm{CLD}}_X^{l,m}}{10}}}}\mathrm{and}{c}_{2,{\mathrm{OTT}}_X}^{l,m}=\sqrt{\frac{1}{1+{10}^{\frac{{\mathrm{CLD}}_X^{l,m}}{10}}}},❘\mathrm{and}\mathrm{where}\text{:}$ ${\mathrm{CLD}}_X^{l,m}=D_{\mathrm{CLD}}\left(X,l,m\right),0\le X<2,0\le m<M_{\mathrm{proc}},0\le l<L.$

In this case, in the 5-1-5₂ tree structure, the matrix generation unit 212 may generate the matrix R₁, again, as follows:

$R_1^{l,m}=\left[\begin{array}{c}1\\ 1\\ K1\\ K2\\ K3\end{array}\right],\mathrm{where}\begin{array}{c}K1=\{\begin{array}{c}{c}_{1,{\mathrm{OTT}}_0}^{l,m},\sum _{i=0}^3\mathrm{DL}\left(0,i\right)!=-4\\ 0,\mathrm{otherwise}\end{array}\\ K2=\{\begin{array}{c}{c}_{1,{\mathrm{OTT}}_0}^{l,m}{c}_{1,{\mathrm{OTT}}_1}^{l,m},\mathrm{DL}\left(0,0\right)=3,\mathrm{DL}\left(0,1\right)=3\\ 0,\mathrm{otherwise}\end{array}\\ K3=\{\begin{array}{c}{c}_{1,{\mathrm{OTT}}_0}^{l,m}{c}_{2,{\mathrm{OTT}}_1}^{l,m},\mathrm{DL}\left(0,2\right)=3,\mathrm{DL}\left(0,3\right)=3\\ 0,\mathrm{otherwise}\end{array}\end{array},,\mathrm{where}{c}_{1,{\mathrm{OTT}}_X}^{l,m}=\sqrt{\frac{{10}^{\frac{{\mathrm{CLD}}_X^{l,m}}{10}}}{1+{10}^{\frac{{\mathrm{CLD}}_X^{l,m}}{10}}}}\mathrm{and}{c}_{2,{\mathrm{OTT}}_X}^{l,m}=\sqrt{\frac{1}{1+{10}^{\frac{{\mathrm{CLD}}_X^{l,m}}{10}}}},\mathrm{and}\mathrm{where}\text{:}$ ${\mathrm{CLD}}_X^{l,m}=D_{\mathrm{CLD}}\left(X,l,m\right),0\le X<2,0\le m<M_{\mathrm{proc}},0\le l<L$

An interpolation unit 214 may interpolate the matrix R₁, e.g., as generated by the matrix generation unit 212, in order to generate the matrix M₁.

A mix-vector calculation unit 210 may generate the matrix R₂ for mixing a decorrelated signal with a direct signal.

The matrix R₂ generated by the mix-vector calculation unit 210 removes a component of a matrix or of a vector corresponding to the unnecessary module, e.g., determined by the level calculation unit 235, using the aforementioned pseudo code illustrated in FIG. 10.

An interpolation unit 215 may interpolate the matrix R₂ generated by the mix-vector calculation unit 210 in order to generate the matrix M₂.

Similar to above, examples for application to the 5-1-5₁ tree structure and the 5-1-5₂ tree structure will be described again.

First, FIG. 5 illustrates the case where only 4 channels are output in the 5-1-5₁ tree structure. Here, Tree′_sign (0,,) and DL(0,) may be generated by the level calculation unit 235 as follows:

${\mathrm{Tree}}_{\mathrm{sign}}^{\prime }\left(0,,\right)=\left[\begin{array}{cccccc}1& 1& 1& n\text{/}a& -1& n\text{/}a\\ 1& 1& -1& n\text{/}a& n\text{/}a& n\text{/}a\\ 1& -1& n\text{/}a& n\text{/}a& n\text{/}a& n\text{/}a\end{array}\right],\mathrm{DL}\left(0,\right)=\left[\begin{array}{cccccc}3& 3& 2& -1& 1& -1\end{array}\right].$

Decoding may be stopped in a module before the dotted line by the generated DL(0,). Thus, since OTT2 and OTT4 do not perform up-mixing, the matrix R₂ may be generated, e.g., by the mix-vector calculation unit 210, again as follows:

$R_2^{l,m}=[\begin{array}{ccccc}{H11}_{{\mathrm{OTT}}_3}^{l,m}{H11}_{{\mathrm{OTT}}_1}^{l,m}{H11}_{{\mathrm{OTT}}_0}^{l,m}& {H11}_{{\mathrm{OTT}}_3}^{l,m}{H11}_{{\mathrm{OTT}}_1}^{l,m}{H12}_{{\mathrm{OTT}}_0}^{l,m}& {H11}_{{\mathrm{OTT}}_3}^{l,m}{H12}_{{\mathrm{OTT}}_1}^{l,m}& {H12}_{{\mathrm{OTT}}_3}^{l,m}& 0\\ {H21}_{{\mathrm{OTT}}_3}^{l,m}{H11}_{{\mathrm{OTT}}_1}^{l,m}{H11}_{{\mathrm{OTT}}_0}^{l,m}& {H21}_{{\mathrm{OTT}}_3}^{l,m}{H11}_{{\mathrm{OTT}}_1}^{l,m}{H12}_{{\mathrm{OTT}}_0}^{l,m}& {H21}_{{\mathrm{OTT}}_3}^{l,m}{H12}_{{\mathrm{OTT}}_1}^{l,m}& {H22}_{{\mathrm{OTT}}_3}^{l,m}& 0\\ {H21}_{{\mathrm{OTT}}_1}^{l,m}{H11}_{{\mathrm{OTT}}_0}^{l,m}& {H21}_{{\mathrm{OTT}}_1}^{l,m}{H12}_{{\mathrm{OTT}}_0}^{l,m}& {H22}_{{\mathrm{OTT}}_1}^{l,m}& 0& 0\\ 0& 0& 0& 0& 0\\ {H21}_{{\mathrm{OTT}}_0}^{l,m}& {H22}_{{\mathrm{OTT}}_0}^{l,m}& 0& 0& 0\\ 0& 0& 0& 0& 0\end{array}]$

Second, FIG. 6 illustrates the case where only 4 channels are output in the 5-1-5₂ tree structure. Here, Tree′_sign(0,,) and DL(0,) may be generated, e.g., by the level calculation unit 235, as follows:

${\mathrm{Tree}}_{\mathrm{sign}}^{\prime }\left(0,,\right)=\left[\begin{array}{cccccc}1& 1& 1& 1& n\text{/}a& n\text{/}a\\ 1& 1& -1& -1& n\text{/}a& n\text{/}a\\ 1& -1& 1& -1& n\text{/}a& n\text{/}a\end{array}\right],\mathrm{DL}\left(0,\right)=\left[\begin{array}{cccccc}3& 3& 3& 3& -1& -1\end{array}\right].$

Decoding is stopped in a module before a dotted line by the generated DL(0,).

FIG. 7 illustrates a case where only 3 channels can be output in the 5-1-5₁ tree structure. Tree′_sign(0,,) and DL(0,) are generated by the level calculation unit 235 as follows:

${\mathrm{Tree}}_{\mathrm{sign}}^{\prime }\left(0,,\right)=\left[\begin{array}{cccccc}1& 1& 1& n/a& n/a& n/a\\ 1& 1& -1& n/a& n/a& n/a\\ 1& -1& n/a& n/a& n/a& n/a\end{array}\right],\mathrm{DL}\left(0,\right)=\left[\begin{array}{cccccc}3& 3& 2& -1& -1& -1\end{array}\right].$

Here, decoding may be stopped in a module before the dotted line by the generated DL(0,).

FIG. 8 illustrates the case where only 3 channels are output in the 5-1-5₂ tree structure. Here, Tree′_sign(0,,) and DL(0,) may be generated, e.g., by the level calculation unit 235, as follows:

${\mathrm{Tree}}_{\mathrm{sign}}^{\prime }\left(0,,\right)=\left[\begin{array}{cccccc}1& n/a& 1& n/a& -1& n/a\\ 1& n/a& -1& n/a& n/a& n/a\\ n/a& n/a& n/a& n/a& n/a& n/a\end{array}\right],\mathrm{DL}\left(0,\right)=\left[\begin{array}{cccccc}2& -1& 2& -1& 1& -1\end{array}\right].$

Here, again, decoding may be stopped in a module before the dotted line by the generated DL(0,).

For the aforementioned example application to the 5-2-5 tree structure, the 7-2-7₁ tree structure, and the 7-2-7₂ tree structure, the corresponding Tree_sign and Tree_depth may also be defined.

First, in the 5-2-5 tree structure, Tree_sign, Tree_depth, and R₁ may be defined as follows:

${\mathrm{Tree}}_{\mathrm{sign}}\left(0,,\right)={\mathrm{Tree}}_{\mathrm{sign}}\left(1,,\right)={\mathrm{Tree}}_{\mathrm{sign}}\left(2,,\right)=\left[\begin{array}{cc}1& -1\end{array}\right],{\mathrm{Tree}}_{\mathrm{depth}}\left(0,\right)={\mathrm{Tree}}_{\mathrm{depth}}\left(1,\right)={\mathrm{Tree}}_{\mathrm{depth}}\left(2,\right)=\left[\begin{array}{cc}1& 1\end{array}\right].R_1^{l,m}\left(i,j\right)=0,\mathrm{when}\sum _{k=0}^l\mathrm{DL}\left(i-3,k\right)!=2,\mathrm{for}3\le i<6,0\le j<3$

Second, in the 7-2-7₁ tree structure, Tree_sign, Tree_depth, and R₁ may be defined as follows:

${\mathrm{Tree}}_{\mathrm{sign}}\left(0,,\right)={\mathrm{Tree}}_{\mathrm{sign}}\left(1,,\right)=\left[\begin{array}{ccc}1& 1& -1\\ 1& -1& n/a\end{array}\right],{\mathrm{Tree}}_{\mathrm{sign}}\left(2,,\right)=\left[\begin{array}{cc}1& -1\end{array}\right]$ ${\mathrm{Tree}}_{\mathrm{depth}}\left(0,\right)={\mathrm{Tree}}_{\mathrm{depth}}\left(1,\right)=\left[\begin{array}{ccc}2& 2& 1\end{array}\right]$ ${\mathrm{Tree}}_{\mathrm{depth}}\left(2,\right)=\left[\begin{array}{cc}1& 1\end{array}\right]$ $R_1^{l,m}\left(i,j\right)=0,\mathrm{when}\sum _{k=0}^2\mathrm{DL}\left(i-3,k\right)<1,\mathrm{for}3\le i<5,0\le j<3$ $R_1^{l,m}\left(5,j\right)=0,\mathrm{when}\sum _{k=0}^1\mathrm{DL}\left(2,k\right)!=2,\mathrm{for}0\le j<3$ $R_1^{l,m}\left(i,j\right)=0,\mathrm{when}\sum _{k=t1}^{t2}\mathrm{DL}\left(i-6,k\right)!=4,\mathrm{for}6\le i<8,0\le j<3|,\mathrm{where}t1=0,t2=1\mathrm{for}7\text{-}2\text{-}{7}_1\mathrm{configuration},t1=1,t2=2\mathrm{for}7\text{-}2\text{-}{7}_2\mathrm{configuration}$

Third, in the 7-2-7₁ tree structure, Tree_sign, Tree_depth, and R₁ may be defined as follows:

${\mathrm{Tree}}_{\mathrm{sign}}\left(0,,\right)={\mathrm{Tree}}_{\mathrm{sign}}\left(1,,\right)=\left[\begin{array}{ccc}-1& 1& 1\\ n/a& 1& 1\end{array}\right],{\mathrm{Tree}}_{\mathrm{sign}}\left(2,,\right)=\left[\begin{array}{cc}1& -1\end{array}\right]$ ${\mathrm{Tree}}_{\mathrm{depth}}\left(0,\right)={\mathrm{Tree}}_{\mathrm{depth}}\left(1,\right)=\left[\begin{array}{ccc}1& 2& 2\end{array}\right],{\mathrm{Tree}}_{\mathrm{depth}}\left(2,\right)=\left[\begin{array}{cc}1& 1\end{array}\right]$ $R_1^{l,m}\left(i,j\right)=0,\mathrm{when}\sum _{k=0}^2\mathrm{DL}\left(i-3,k\right)<1,\mathrm{for}3\le i<5,0\le j<3$ $R_1^{l,m}\left(5,j\right)=0,\mathrm{when}\sum _{k=0}^1\mathrm{DL}\left(2,k\right)!=2,\mathrm{for}0\le j<3R_1^{l,m}\left(i,j\right)=0,\mathrm{when}\sum _{k=t1}^{t2}\mathrm{DL}\left(i-6,k\right)!=4,\mathrm{for}6\le i<8,0\le j<3,\mathrm{where}t1=0,t2=1\mathrm{for}7\text{-}2\text{-}{7}_1\mathrm{configuration},t1=1,t2=2\mathrm{for}7\text{-}2\text{-}{7}_2\mathrm{configuration}$

As noted above, each of the 5-2-5 tree structure and the 7-2-7 tree structures can be divided into three sub trees. Thus, the matrix R₂ may be obtained by the mix-vector generation unit 210, for example, using the same technique as applied to the 5-1-5 tree structure.

An AAC decoder 216 may decode a residual coded signal obtained by coding a down-mixed signal and the original signal using ACC in the encoder.

A MDCT2QMF unit 218 may transform an MDCT coefficient, e.g., as decoded by the MC decoder 216, into a QMF domain.

An overlap-add unit 220 may perform overlap-add between frames for a signal output by the MDCT2QMF unit 218.

A hybrid analysis unit 222 may further perform additional filtering in order to improve the frequency resolution of a low-frequency band signal because the low-frequency band signal has a low frequency resolution only with QMF filterbank.

In addition, a hybrid analysis unit 270 may split an input signal according to frequency bands using QMF Hybrid analysis filter bank.

A pre-matrix application unit 273 may generate a direct signal and a signal to be decorrelated using the matrix M₁, e.g., as generated by the interpolation unit 214.

A decorrelation unit 276 may perform decorrelation on the generated signal to be decorrelated such that the generated signal can be reconstructed to have a sense of space.

A mix-matrix application unit 279 may apply the matrix M₂, e.g., as generated by the interpolation unit 215, to the signal decorrelated by the decorrelation unit 276 and the direct signal generated by the pre-matrix application unit 273.

A temporal envelope shaping (TES) application unit 282 may further apply TES to the signal to which the matrix M₂ is applied by the mix-matrix application unit 279.

A QMF hybrid synthesis unit 285 may transform the signal to which TES is applied by the TES application unit 282 into a time domain using QMF hybrid synthesis filter bank.

A temporal processing (TP) application unit 288 further applies TP to the signal transformed by the QMF hybrid synthesis unit 285.

Here, the TES application unit 282 and the TP application unit 288 may be used to improve sound quality for a signal in which a temporal structure is important, like applause, and may be selectively used.

A mixing unit 290 may mix the direct signal with the decorrelated signal.

The aforementioned matrix R₃ may be calculated and applied to an arbitrary tree structure using the aforementioned equation, repeated below:

${\mathrm{Tree}}_{\mathrm{depth}}\left(v,i\right)=\{\begin{array}{cc}\mathrm{DL}\left(v,i\right),& {\mathrm{Tree}}_{\mathrm{depth}}\left(v,i\right)>\mathrm{DL}\left(v,i\right),\\ {\mathrm{Tree}}_{\mathrm{depth}}\left(v,i\right),& \mathrm{otherwise}\end{array}\mathrm{for}0\le i<{\mathrm{Tree}}_{\mathrm{outchan}}\left(v\right),0\le v<\mathrm{numOutChan}{R}_g^{l,m}\left(i,v\right)=\{\begin{array}{cc}\begin{array}{c}{\mathrm{Tree}}_{\mathrm{depth}}\prod _{\rho =0}^{\left(i-i_{\mathrm{offset}}(,)\right)-1}\\ X_{\mathrm{Tree}\left(o,\rho ,i-i_{\mathrm{offset}}(,)\right)}\end{array},& \begin{array}{c}\begin{array}{c}\mathrm{if}{i}_{\mathrm{offset}}\left(v\right)\le i<i_{\mathrm{offset}}\left(v\right)+\\ {\mathrm{Tree}}_{\mathrm{outChan}}\left(v\right)\end{array},\\ {\mathrm{Tree}}_{\mathrm{depth}}\left(v,i-i_{\mathrm{offset}}\left(v\right)\right)>0\end{array}\\ 1,& \mathrm{else}\mathrm{if}{\mathrm{Tree}}_{\mathrm{depth}}\left(v,i-i_{\mathrm{offset}}\left(v\right)\right)=0\\ 0,& \mathrm{otherwise}\end{array},\mathrm{for}0\le i<\mathrm{numChanOutAT}\mathrm{and}0\le v<\mathrm{numOutChan}\mathrm{where}{i}_{\mathrm{offset}}\left(v\right)=\{\begin{array}{cc}\sum _{k=0}^{v-1}{\mathrm{Tree}}_{\mathrm{outChan}}\left(k\right),& v>0\mathrm{and}\\ 0& \mathrm{otherwise}\end{array}{X}_{\mathrm{Tree}\left(r,\rho ,i_{\mathrm{imp}}\right)}=\{\begin{array}{cc}{C}_{l,\mathrm{Mz}\left(r,\rho ,i_{\mathrm{imp}}\right)},& {\mathrm{Tree}}_{\mathrm{sign}}\left(v,{\mathrm{pi}}_{\mathrm{imp}}\right)=1\\ C_{r,\mathrm{Mz}\left(r,\rho ,i_{\mathrm{imp}}\right)},& {\mathrm{Tree}}_{\mathrm{sign}}\left(v,{\mathrm{pi}}_{\mathrm{imp}}\right)=-1\end{array}\mathrm{where}\mathrm{idx}\left(v,p,i_{\mathrm{imp}}\right)=\{\begin{array}{cc}\sum _{k=0}^{r-1}\left({\mathrm{Tree}}_{\mathrm{outChan}}\left(k\right)\right)+\mathrm{Tree}\left(v,p,i_{\mathrm{imp}}\right),& v>0\\ \mathrm{Tree}\left(v,p,i_{\mathrm{imp}}\right)& \mathrm{otherwise}\end{array}\mathrm{and}\mathrm{where}{C}_{l,X}=\sqrt{\frac{{\mathrm{CLD}}_{1\ln ,X}^2}{1+{\mathrm{CLD}}_{\ln ,X}^2}}\mathrm{and}{C}_{r,X=}\sqrt{\frac{1}{1+{\mathrm{CLD}}_{1\ln ,X}^2}},\mathrm{where}{\mathrm{CLD}}_{1\ln ,X}={10}^{\frac{{\mathrm{CLD}}_x}{20}}\mathrm{and}\mathrm{where}{\mathrm{CLD}}_x^{l,m}=D_{\mathrm{ATD}}\left(X,l,m\right),0\le m<M,0\le l<L.$

In addition to the above described embodiments, embodiments of the present invention can also be implemented through computer readable code/instructions in/on a medium, e.g., a computer readable medium, to control at least one processing element to implement any above described embodiment. The medium can correspond to any medium/media permitting the storing and/or transmission of the computer readable code.

The computer readable code can be recorded/transferred on a medium in a variety of ways, with examples of the medium including magnetic storage media (e.g., ROM, floppy disks, hard disks, etc.), optical recording media (e.g., CD-ROMs, or DVDS), and storage/transmission media such as carrier waves, as well as through the Internet, for example. Here, the medium may further be a signal, such as a resultant signal or bitstream, according to embodiments of the present invention. The media may also be a distributed network, so that the computer readable code is stored/transferred and executed in a distributed fashion. Still further, as only an example, the processing element could include a processor or a computer processor, and processing elements may be distributed and/or included in a single device.

According to an embodiment of the present invention, a configuration of channels or speakers provided/available in/to a decoder may be recognized to calculate the number of decoding levels for each multi-channel signal, such that decoding and up-mixing can be performed according to the calculated number of decoding levels.

In this way, it is possible to reduce the number of output channels in the decoder and complexity in decoding. Moreover, the optimal sound quality can be provided adaptively according to the configuration of various speakers of users.

Although a few embodiments of the present invention have been shown and described, it would be appreciated by those skilled in the art that changes may be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the claims and their equivalents.

Claims

1. A method for scalable channel decoding, the method comprising: decoding two down-mixed signals and a first residual signal into first, second and third channel signals, based on two-to-three (TTT) spatial information;decoding the first channel signal and a second residual signal into first plural channel signals, based on first one-to-two (OTT) spatial information;decoding the second channel signal and a third residual signal into second plural channel signals, based on second OTT spatial information;decoding the third channel signal into third plural channel signals, based on third OTT spatial information;decoding one of the first plural channel signals and a fourth residual signal into fourth plural channel signals, based on fourth OTT spatial information; anddecoding one of the second plural channel signals and a fifth residual signal into fifth plural channel signals, based on fifth OTT spatial information,wherein the decoding one of the first plural channel signals and the fourth residual signal and the decoding one of the second plural channel signals and the fifth residual signal are selectively performed such that either a 7.1 channel output or a 5.1 channel output is generated,wherein if the 5.1 channel output is generated, the fourth OTT spatial information and the fourth residual signal and the fifth OTT spatial information and the fifth residual signal are not used, andwherein the TTT spatial information and the first to the fifth OTT spatial information are obtained from a bitstream.

2. The method of claim 1, wherein the TTT spatial information and the first to the fifth OTT spatial information comprises information of magnitude differences and/or similarities between corresponding channels.

3. At least one non-transitory computer readable recording medium comprising computer readable code to control at least one processing element to implement the method of claim 1.

4. An apparatus with scalable channel decoding, the apparatus comprising: a two-to-three (TTT) decoder configured to decode two down-mixed signals and a first residual signal into first, second and third channel signals, based on TTT spatial information;a first one-to-two (OTT) decoder configured to decode the first channel signal and a second residual signal into first plural channel signals, based on first OTT spatial information;a second OTT decoder configured to decode the second channel signal and a third residual signal into second plural channel signals, based on second OTT spatial information;a third OTT decoder configured to decode the third channel signal into third plural channel signals, based on third OTT spatial information;a fourth OTT decoder configured to decode one of the first plural channel signals and a fourth residual signal into fourth plural channel signals, based on fourth OTT spatial information; anda fifth OTT decoder configured to decode one of the second plural channel signals and a fifth residual signal into fifth plural channel signals, based on fifth OTT spatial information,wherein the fourth OTT decoder and the fifth OTT decoder are configured to perform selective decoding such that either a 7.1 channel output or a 5.1 channel output is generated,wherein if the 5.1 channel output is generated, the fourth OTT spatial information and the fourth residual signal and the fifth OTT spatial information and the fifth residual signal are not used, andwherein the TTT spatial information and the first to the fifth OTT spatial information are obtained from a bitstream.

5. The apparatus of claim 4, wherein the TTT spatial information and the first to the fifth OTT spatial information comprises information of magnitude differences and/or similarities between corresponding channels.