Source: https://patents.google.com/patent/US20070233296A1/en
Timestamp: 2019-09-19 19:55:26
Document Index: 284013730

Matched Legal Cases: ['Application No. 60', 'Application No. 60', 'Application No. 60', 'Application No. 60', 'Application No. 60', 'Application No. 10']

US20070233296A1 - Method, medium, and apparatus with scalable channel decoding - Google Patents
Method, medium, and apparatus with scalable channel decoding Download PDF
US20070233296A1
US20070233296A1 US11/652,031 US65203107A US2007233296A1 US 20070233296 A1 US20070233296 A1 US 20070233296A1 US 65203107 A US65203107 A US 65203107A US 2007233296 A1 US2007233296 A1 US 2007233296A1
US11/652,031
US9934789B2 (en
Mino Lei
2006-04-05 Priority to US78914706P priority
2006-04-06 Priority to US78960106P priority
2006-05-30 Priority to KR10-2006-0049033 priority
2006-05-30 Priority to KR1020060049033A priority patent/KR100803212B1/en
2007-01-11 Priority to US11/652,031 priority patent/US9934789B2/en
2007-04-06 Assigned to SAMSUNG ELECTRONICS CO., LTD. reassignment SAMSUNG ELECTRONICS CO., LTD. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: CHOO, KIHYUN, KIM, JUNGHOE, LEI, MIAO, OH, EUNMI
2007-10-04 Publication of US20070233296A1 publication Critical patent/US20070233296A1/en
2018-04-03 Publication of US9934789B2 publication Critical patent/US9934789B2/en
A method, medium, and apparatus with scalable channel decoding. The method includes recognizing the configuration of channels or speakers, calculating the number of 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 number of decoding levels.
This application claims the benefits of U.S. Provisional Patent Application No. 60/757,857, filed on Jan. 11, 2006, U.S. Provisional Patent Application No. 60/758,985, filed on Jan. 17, 2006, U.S. Provisional Patent Application No. 60/759,543, filed on Jan. 18, 2006, U.S. Provisional Patent Application No. 60/789,147, filed on Apr. 5, 2006, U.S. Provisional Patent Application No. 60/789,601, filed on Apr. 6, 2006, in the U.S. Patent and Trademark Office, and Korean Patent Application No. 10-2006-0049033, filed on May 30, 2006, in the Korean Intellectual Property Office, the disclosures of which are incorporated herein in their entirety by reference.
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.
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.
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.
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.
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-51 tree structure, according to an embodiment of the present invention;
FIG. 6 illustrates 4 channels being output in a 5-1-52 tree structure, according to an embodiment of the present invention;
FIG. 7 illustrates 3 channels being output in a 5-1-51 tree structure, according to an embodiment of the present invention;
FIG. 8 illustrates 3 channels being output in a 5-1-52 tree structure, according to an embodiment of the present invention;
FIG. 9 illustrates a pseudo code for setting Treesign(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.
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. Equation ⁢ ⁢ 1 ⁢ : ⁢ ⁢ bPlaySpk ⁡ ( i ) = { 1 , if ⁢ ⁢ the ⁢ ⁢ loudspeaker ⁢ ⁢ position ⁢ ⁢ of ⁢ ⁢ i th output ⁢ ⁢ channel ∈ playChanPos 0 , otherwise ⁢ ⁢ for ⁢ ⁢ 0 ≤ i ≤ numOutChanAT
Similarly, the referenced numOutChanAT can be calculated with the below Equation 2. Equation ⁢ ⁢ 2 ⁢ ∷ numOutChaAT = ∑ k = 0 numOutChan - 1 ⁢ Tree OutChan ⁡ ( k )
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 Treesign(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 Treesign(v,), v is greater than 0 and less than numOutChan. Hereinafter, embodiments of the present invention will be described using the matrix Treesign(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 Treesign(v,). For example, a matrix that is obtained by exchanging rows and columns of the matrix Treesign(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 Treesign, 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 Treesign as follows: Tree sign = ( 1 1 1 - 1 - 1 - 1 1 1 - 1 1 - 1 - 1 1 - 1 n / a n / a 1 - 1 )
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 Treesign(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 Treesign, thereby generating Tree′sign. Tree sign ′ = ( 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 )
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 Treesign(v,i,j) set in operation 106, it is determined whether Treesign(v,0:i−1, j) and Treesign(v,0:i−11,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 Treesign(v,0:1,1) and Treesign(v,0:1,3) are not the same as each other, a first channel and a third channel in the matrix Tree′sigh generated in operation 106 are determined as multi-channels that are not to be decoded in the same path in operation 108. However, since Treesign(v,0:1,5) and Treesign(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 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: Tree sign ′ = ( 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 )
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 Treesign(v,) on a row-by-row basis.
In operations 106 through 110, Treesign(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. Equation ⁢ ⁢ 4 ⁢ : DL ⁡ ( v ) = [ dl i offset ⁡ ( v ) dl i offset ⁡ ( v ) + 1 … dl i offset ⁡ ( v ) + Tree outChan ⁡ ( v ) - 1 ] where ⁢ ⁢ i offset ⁡ ( v ) = { ∑ k = 0 v - 1 ⁢ Tree outChan ⁡ ( k ) , v > 0 0 otherwise , 0 <= v < numOutChan ⁢ ⁢ dl i offset ⁡ ( v ) + i = { ∑ j = 0 Tree depth ⁡ ( v , 1 ) - 1 ⁢ abs ⁡ ( Tree sign ⁡ ( v , j , i ) ) , if ⁢ ⁢ bPlaySpk ⁡ [ i ] is ⁢ ⁢ equal ⁢ ⁢ to ⁢ ⁢ 1 - 1 , otherwise , ⁢ for ⁢ ⁢ 0 ≤ i < Tree outChan ⁡ ( v ) , 0 ≤ v < numOutChan ⁢ ⁢ where ⁢ ⁢ abs ⁡ ( n / a ) = 0 , ⁢ i offset ⁡ ( v ) = { ∑ k = 0 v - 1 ⁢ Tree outChan ⁡ ( k ) , v > 0 0 , otherwise
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 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 R1. R1 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-51 tree structure, illustrated in FIG. 5, and a 5-1-52 tree structure, illustrated in FIG. 6, are set to the following matrices. Tree ⁡ ( 0 , , ) = [ 0 0 0 0 0 0 1 1 1 1 2 2 3 3 4 4 n / a n / a ] , ⁢ Tree sign ⁡ ( 0 , , ) = [ 1 1 1 1 - 1 - 1 1 1 - 1 - 1 1 - 1 1 - 1 1 - 1 n / a n / a ] , ⁢ Tree depth ⁡ ( 0 , ) = [ 3 3 3 3 2 2 ] , ⁢ Tree outChan ⁡ ( 0 ) = [ 6 ] .
In this case, in the 5-1-51 tree structure, R1 is calculated as follows, in operation 119. R 1 l , m = [ 1 1 K ⁢ ⁢ 1 K ⁢ ⁢ 2 K ⁢ ⁢ 3 ] , where ⁢ ⁢ K ⁢ ⁢ 1 = { c 1 , OTT 0 l , m , ∑ i = 0 3 ⁢ DL ⁡ ( 0 , i ) != - 4 0 , otherwise K ⁢ ⁢ 2 = { c 1 , OTT 0 l , m ⁢ c 1 , OTT 1 l , m , DL ⁡ ( 0 , 0 ) = 3 , DL ⁡ ( 0 , 1 ) = 3 0 , otherwise K ⁢ ⁢ 3 = { c 2 , OTT 0 l , m , DL ⁡ ( 0 , 4 ) = 2 , DL ⁡ ( 0 , 5 ) = 2 0 , otherwise , , where c 1 , OTT X l , m = 10 CLD X l , m 10 1 + 10 CLD X l , m 10 ⁢ ⁢ and ⁢ ⁢ c 2 , OTT X l , m = 1 1 + 10 CLD X l , m 10 , | ⁢ and ⁢ ⁢ where ⁢ : CLD X l , m = D CLD ⁡ ( X , l , m ) , 0 ≤ X < 2 , 0 ≤ m < M proc , 0 ≤ l < L .
In this case, in the 5-1-52 tree structure, R1 may be calculated as follows, in operation 119. R 1 l , m = [ 1 1 K ⁢ ⁢ 1 K ⁢ ⁢ 2 K ⁢ ⁢ 3 ] , where ⁢ ⁢ K ⁢ ⁢ 1 = { c 1 , OTT 0 l , m , ∑ i = 0 3 ⁢ DL ⁡ ( 0 , i ) != - 4 0 , otherwise K ⁢ ⁢ 2 = { c 1 , OTT 0 l , m ⁢ c 1 , OTT 1 l , m , DL ⁡ ( 0 , 0 ) = 3 , DL ⁡ ( 0 , 1 ) = 3 0 , otherwise K ⁢ ⁢ 3 = { c 2 , OTT 0 l , m ⁢ c 2 , OTT 1 l , m , DL ⁡ ( 0 , 2 ) = 3 , DL ⁡ ( 0 , 3 ) = 3 0 , otherwise , , where ⁢ ⁢ c 1 , OTT X l , m = 10 CLD X l , m 10 1 + 10 CLD X l , m 10 ⁢ ⁢ and ⁢ ⁢ c 2 , OTT X l , m = 1 1 + 10 CLD X l , m 10 , ⁢ and ⁢ ⁢ where ⁢ : CLD X l , m = D CLD ⁡ ( X , l , m ) , 0 ≤ X < 2 , 0 ≤ m < M proc , 0 ≤ l < L
In operation 120, the matrix R1 generated in operation 119 is interpolated in order to generate a matrix M1.
In operation 123, a matrix R2 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 R2 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-51 tree structure and the 5-1-52 tree structure will be described.
First, FIG. 5 illustrates the case where only 4 channels are output in the 5-1-51 tree structure. If operations 103 through 113 are performed for the 5-1-51 tree structure illustrated in FIG. 5, Tree′sign(0,,) and DL(0,) are generated as follows: Tree sign ′ ⁡ ( 0 , , ) = [ 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 ] , ⁢ DL ⁡ ( 0 , ) = [ 3 3 2 - 1 1 - 1 ] .
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 R2 can be generated in operation 126 as follows: R 2 l , m = [ H ⁢ ⁢ 11 OTT 3 l , m ⁢ H ⁢ ⁢ 11 OTT 1 l , m ⁢ H ⁢ ⁢ 11 OTT 0 l , m H ⁢ ⁢ 11 OTT 3 l , m ⁢ H ⁢ ⁢ 11 OTT 1 l , m ⁢ H ⁢ ⁢ 12 OTT 0 l , m H ⁢ ⁢ 11 OTT 3 l , m ⁢ H ⁢ ⁢ 12 OTT 1 l , m H ⁢ ⁢ 12 OTT 3 l , m 0 H ⁢ ⁢ 21 OTT 3 l , m ⁢ H ⁢ ⁢ 11 OTT 1 l , m ⁢ H ⁢ ⁢ 11 OTT 0 l , m H ⁢ ⁢ 21 OTT 3 l , m ⁢ H ⁢ ⁢ 11 OTT 1 l , m ⁢ H ⁢ ⁢ 12 OTT 0 l , m H ⁢ ⁢ 21 OTT 3 l , m ⁢ H ⁢ ⁢ 12 OTT 1 l , m H ⁢ ⁢ 22 OTT 3 l , m 0 H ⁢ ⁢ 21 OTT 1 l , m ⁢ H ⁢ ⁢ 11 OTT 0 l , m H ⁢ ⁢ 21 OTT 1 l , m ⁢ H ⁢ ⁢ 12 OTT 0 l , m H ⁢ ⁢ 22 OTT 1 l , m 0 0 0 0 0 0 0 H ⁢ ⁢ 21 OTT 0 l , m H ⁢ ⁢ 22 OTT 0 l , m 0 0 0 0 0 0 0 0 ]
Second, FIG. 6 illustrates the case where only 4 channels are output in the 5-1-52 tree structure. If operations 103 through 113 are performed for the 5-1-52 tree structure illustrated in FIG. 6, Tree′sign (0,,) and DL(0,) are generated as follows: Tree sign ′ ⁡ ( 0 , , ) = [ 1 1 1 1 n / a n / a 1 1 - 1 - 1 n / a n / a 1 - 1 1 - 1 n / a n / a ] , ⁢ DL ⁡ ( 0 , ) = [ 3 3 3 3 - 1 - 1 ] .
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-51 tree structure. In this case, after operations 103 through 113 are performed, Tree′sign(0,,) and DL(0,) are generated as follows: Tree sign ′ ⁡ ( 0 , , ) = [ 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 ] , ⁢ DL ⁡ ( 0 , ) = [ 3 3 2 - 1 - 1 - 1 ] .
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-52 tree structure. In this case, after operations 103 through 113 are performed, Tree′sign(0,,) and DL(0,) are generated as follows: Tree sign ′ ⁡ ( 0 , , ) = [ 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 ] , ⁢ DL ⁡ ( 0 , ) = [ 2 - 1 2 - 1 1 - 1 ] .
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-71 tree structure, and a 7-2-72 tree structure, the corresponding Treesign and Treedepth can also be defined.
First, in the 5-2-5 tree structure, Treesign, Treedepth, and R1 may be defined as follows: Tree sign ⁡ ( 0 , , ) = Tree sign ⁡ ( 1 , , ) = Tree sign ⁡ ( 2 , , ) = [ 1 - 1 ] , ⁢ Tree depth ⁡ ( 0 , ) = Tree depth ⁡ ( 1 , ) = Tree depth ⁡ ( 2 , ) = [ 1 1 ] . ⁢ R 1 l , m ⁡ ( i , j ) = 0 , when ⁢ ∑ k = 0 1 ⁢ DL ⁡ ( i - 3 , k ) != 2 , ⁢ for ⁢ ⁢ 3 ≤ i < 6 , 0 ≤ j < 3
Second, in the 7-2-71 tree structure, Treesign, Treedepth, and R1 may be defined as follows: Tree sign ⁡ ( 0 , , ) = Tree sign ⁡ ( 1 , , ) = [ 1 1 - 1 1 - 1 n / a ] , ⁢ Tree sign ⁡ ( 2 , , ) = [ 1 - 1 ] Tree depth ⁡ ( 0 , , ) = Tree depth ⁡ ( 1 , ) = [ 2 2 1 ] Tree depth ⁡ ( 2 , ) = [ 1 1 ] R 1 l , m ⁡ ( i , j ) = 0 , when ⁢ ∑ k = 0 2 ⁢ DL ⁡ ( i - 3 , k ) < 1 , ⁢ for ⁢ ⁢ 3 ≤ i < 5 , 0 ≤ j < 3 R 1 l , m ⁡ ( 5 , j ) = 0 , when ⁢ ∑ k = 0 1 ⁢ DL ⁡ ( 2 , k ) != 2 , ⁢ for ⁢ ⁢ 0 ≤ j < 3 R 1 l , m ⁡ ( i , j ) = 0 , when ⁢ ∑ k = t ⁢ ⁢ 1 t ⁢ ⁢ 2 ⁢ DL ⁡ ( i - 6 , k ) != 4 , ⁢ for ⁢ ⁢ 6 ≤ i < 8 , 0 ≤ j < 3 ⁢ | , where ⁢ ⁢ t ⁢ ⁢ 1 = 0 , ⁢ t ⁢ ⁢ 2 = 1 ⁢ ⁢ for ⁢ ⁢ 7 ⁢ - ⁢ 2 ⁢ - ⁢ 7 1 ⁢ ⁢ configuration , ⁢ t ⁢ ⁢ 1 = 1 , t ⁢ ⁢ 2 = 2 ⁢ ⁢ for ⁢ ⁢ 7 ⁢ - ⁢ 2 ⁢ - ⁢ 7 2 ⁢ ⁢ configuration
Third, in the 7-2-71 tree structure, Treesign, Treedepth and R1 may be defined as follows: Tree sign ⁡ ( 0 , , ) = Tree sign ⁡ ( 1 , , ) = [ - 1 1 1 n / a 1 1 ] , ⁢ Tree sign ⁡ ( 2 , , ) = [ 1 - 1 ] Tree depth ⁡ ( 0 , ) = Tree depth ⁡ ( 1 , ) = [ 1 2 2 ] , | ⁢ Tree depth ⁡ ( 2 , ) = [ 1 1 ] ⁢ ⁢ R 1 l , m ⁡ ( i , j ) = 0 , when ⁢ ∑ k = 0 2 ⁢ DL ⁡ ( i - 3 , k ) < 1 , ⁢ for ⁢ ⁢ 3 ≤ i < 5 , 0 ≤ j < 3 ⁢ ⁢ R 1 l , m ⁡ ( 5 , j ) = 0 , when ⁢ ∑ k = 0 1 ⁢ DL ⁡ ( 2 , k ) != 2 , ⁢ for ⁢ ⁢ 0 ≤ j < 3 ⁢ ⁢ R 1 l , m ⁡ ( i , j ) = 0 , when ⁢ ∑ k = t ⁢ ⁢ 1 t ⁢ ⁢ 2 ⁢ DL ⁡ ( i - 6 , k ) != 4 , ⁢ for ⁢ ⁢ 6 ≤ i < 8 , 0 ≤ j < 3 ⁢ , where ⁢ ⁢ t ⁢ ⁢ 1 = 0 , ⁢ t ⁢ ⁢ 2 = 1 ⁢ ⁢ for ⁢ ⁢ 7 ⁢ - ⁢ 2 ⁢ - ⁢ 7 1 ⁢ ⁢ configuration , ⁢ t ⁢ ⁢ 1 = 1 , t ⁢ ⁢ 2 = 2 ⁢ ⁢ for ⁢ ⁢ 7 ⁢ - ⁢ 2 ⁢ - ⁢ 7 2 ⁢ ⁢ 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 R2 can be obtained in operation 123 using the same technique as applied to the 5-1-5 tree structure.
In operation 126, the matrix R2 generated in operation 123 may be interpolated in order to generate a matrix M2.
In operation 129, a residual coded signal obtained by coding a down-mixed signal and the original signal using ACC 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 M1 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 M2 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 M2 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 R3 may be calculated and applied to an arbitrary tree structure using the following equation: Tree depth ⁡ ( v , i ) = { DL ⁡ ( v , i ) , Tree depth ⁡ ( v , i ) > DL ⁡ ( v , i ) , Tree depth ⁡ ( v , i ) , otherwise ⁢ ⁢ for ⁢ ⁢ 0 ≤ i < Tree outchan ⁡ ( v ) , 0 ≤ v < numOutChan ⁢ ⁢ R g l , m ⁡ ( i , v ) = { Tree depth ⁢ ∏ ρ = 0 ( i - i offset ⁡ ( , ) ) - 1 X Tree ⁡ ( r , ρ , i - i offset ⁡ ( , ) ) , if ⁢ ⁢ i offset ⁡ ( v ) ≤ i < i offset ⁡ ( v ) + Tree outChan ⁡ ( v ) , Tree depth ⁡ ( v , i - i offset ⁡ ( v ) ) > 0 1 , else ⁢ ⁢ if ⁢ ⁢ Tree depth ⁡ ( v , i - i offset ⁡ ( v ) ) = 0 0 , otherwise , ⁢ for ⁢ ⁢ 0 ≤ i < numChanOutAT ⁢ ⁢ and ⁢ ⁢ 0 ≤ v < numOutChan ⁢ ⁢ where ⁢ ⁢ i offset ⁡ ( v ) = { ∑ k = 0 v - 1 ⁢ Tree outChan ⁡ ( k ) , v > 0 ⁢ 0 otherwise ⁢ and ⁢ ⁢ X Tree ⁡ ( r , ρ , i imp ) = { c l , Mz ⁡ ( r , ρ , i imp ) , Tree sign ⁡ ( v , pi imp ) = 1 c r , Mz ⁡ ( r , ρ , i imp ) , Tree sign ⁡ ( v , pi imp ) = - 1 ⁢ ⁢ where ⁢ ⁢ idx ⁡ ( v , p , i imp ) = { ∑ k = 0 r - 1 ⁢ ( Tree outChan ⁡ ( k ) ) + Tree ⁡ ( v , p , i imp ) , v > 0 Tree ⁡ ( v , p , i imp ) otherwise ⁢ ⁢ and ⁢ ⁢ where ⁢ ⁢ c l , X = CLD 1 ⁢ ln , X 2 1 + CLD ln , X 2 ⁢ ⁢ and ⁢ ⁢ c r , X = ⁢ 1 1 + CLD 1 ⁢ ln , X 2 , ⁢ where ⁢ ⁢ CLD 1 ⁢ ln , X = 10 CLD x 20 ⁢ ⁢ and ⁢ ⁢ where ⁢ ⁢ CLD x l , m = D ATD ⁡ ( X , l , m ) , 0 ≤ m < M , 0 ≤ 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. Equation ⁢ ⁢ 1 ⁢ : bPlaySpk ⁡ ( i ) = { 1 , if ⁢ ⁢ the ⁢ ⁢ loudspeaker ⁢ ⁢ positon ⁢ ⁢ of ⁢ ⁢ i th ⁢ ⁢ output ⁢ ⁢ channel ∈ playChanPos 0 , otherwise ⁢ ⁢ for ⁢ ⁢ 0 ≤ i ≤ numOutChanAT
Again, the referenced numOutChanAT may be calculated according to the aforementioned Equation 2, repeated below. Equation ⁢ ⁢ 2 ⁢ : ⁢ ⁢ numOutChaAT = ∑ k = 0 numOutChan - 1 ⁢ Tree OutChan ⁡ ( k )
Similarly, the referenced playChanPos may be, again, expressed for, e.g., a 5.1 channel system, according to the aforementioned Equation 3, repeated below.
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 Treesign(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 Treesign(v,), v is greater than 0 and less than numOutChan. As noted above, embodiments of the present invention have been described using this matrix Treesign(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 Treesign(v,). For example, a matrix that is obtained by exchanging rows and columns of the matrix Treesign(v,) may equally be used, for example.
Again, as an example, in a tree structure illustrated in FIG. 4, in a matrix Treesign, 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 Treesign as follows: Tree sign = ( 1 1 1 - 1 - 1 - 1 1 1 - 1 1 - 1 - 1 1 - 1 n ⁢ / ⁢ a n ⁢ / ⁢ a 1 - 1 )
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 Treesign.
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 Treesign, thereby generating Tree′sign. Tree sign ′ = ( 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 )
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 Treesign(v,0:i−1,j) and Treesign(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 Treesign(v,i,j) set by the decoding determination unit 240.
For example, in the tree structure illustrated in FIG. 4, since Treesign(v,0:1,1) and Treesign(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 Treesign(v,0:1,5) and Treesign(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: Tree sign ′ = ( 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 )
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 Treesign(v,) on a row-by-row basis, for example.
The level calculation unit 235 sets Treesign(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: DL ⁡ ( v ) = ⁢ [ dl i offset ⁡ ( v ) ⁢ dl i offset ⁡ ( v ) ⁢ + ⁢ 1 ⁢ ⁢ ⋯ ⁢ ⁢ dl i offset ⁡ ( v ) ⁢ + ⁢ Tree outChan ⁡ ( v ) ⁢ - ⁢ 1 ] ⁢ ⁢ where ⁢ ⁢ ⁢ ⁢ i offset ⁡ ( v ) = ⁢ { ⁢ ∑ k ⁢ = ⁢ 0 ⁢ v ⁢ - ⁢ 1 ⁢ ⁢ Tree ⁢ outChan ⁡ ( k ) , v > 0 , ⁢ 0 ⁢ ⁢ otherwise ⁢ 0 <= v < ⁢ numOutChan ⁢ dl ⁢ i ⁢ offset ⁢ ( v ) ⁢ + ⁢ i = ⁢ { ⁢ ∑ j = 0 Tree depth ⁢ ( v , i ) - 1 ⁢ ⁢ abs ⁡ ( Tree sign ⁢ ( v , j , i ) ) , ⁢ - 1 , ⁢ otherwise , ⁢ if ⁢ ⁢ bPlaySpk ⁡ [ i ] ⁢ ⁢ is ⁢ ⁢ equal ⁢ ⁢ to ⁢ ⁢ 1 ⁢ for ⁢ ⁢ 0 ≤ i < Tree outChan ⁡ ( v ) , 0 ≤ v < numOutChan ⁢ where ⁢ ⁢ abs ( n ⁢ / ⁢ a ) = 0 , ⁢ i offset ⁡ ( v ) = ⁢ { ⁢ ∑ k = 0 v - 1 ⁢ ⁢ Tree outChan ⁡ ( k ) , v > 0 ⁢ 0 ⁢ ⁢ otherwise
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:
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 R1, R2, and R3 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 R1, 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 R1 can be used for generation of a signal to be input to a decorrelator for decorrelation.
Again, as an example, the 5-1-51 tree structure illustrated in FIG. 5 and the 5-1-52 tree structure illustrated in FIG. 6 may be set to the aforementioned matrices, repeated below. ⁢ Tree ⁡ ( 0 , , ) = [ 0 0 0 0 0 0 1 1 1 1 2 2 3 3 4 4 n ⁢ / ⁢ a n ⁢ / ⁢ a ] , ⁢ Tree sign ⁡ ( 0 , , ) = [ 1 1 1 1 - 1 - 1 1 1 - 1 - 1 1 - 1 1 - 1 1 - 1 n ⁢ / ⁢ a n ⁢ / ⁢ a ] , ⁢ Tree depth ⁡ ( 0 , ) = [ 3 3 3 3 2 2 ] , ⁢ Tree outChan ⁡ ( 0 ) = [ 6 ] .
In the 5-1-51 tree structure, the matrix generation unit 212, for example, R1, discussed above and repeated below. ⁢ R 1 l , m = [ 1 1 K ⁢ 1 K ⁢ 2 K ⁢ 3 ] , ⁢ where ⁢ ⁢ ⁢ K ⁢ 1 = { ⁢ c 1 , OTT 0 l , m , ∑ i = 0 3 ⁢ ⁢ DL ⁡ ( 0 , i ) != - 4 ⁢ 0 , ⁢ otherwise ⁢ K ⁢ 2 = { ⁢ c 1 , OTT 0 l , m ⁢ c 1 , OTT 1 l , m , DL ⁡ ( 0 , 0 ) = 3 , DL ⁡ ( 0 , 1 ) = 3 ⁢ 0 , ⁢ otherwise K ⁢ 3 = { ⁢ c 2 , OTT 0 l , m , DL ⁡ ( 0 , 4 ) = 2 , DL ⁡ ( 0 , 5 ) = 2 ⁢ 0 , ⁢ otherwise , , ⁢ ⁢ where c 1 , OTT X l , m = 10 CLD X l , m 10 1 + 10 CLD X l , m 10 ⁢ ⁢ and ⁢ ⁢ c 2 , OTT X l , m = 1 1 + 10 CLD X l , m 10 , ❘ ⁢ and ⁢ ⁢ where ⁢ : CLD X l , m = D CLD ⁡ ( X , l , m ) , 0 ≤ X < 2 , 0 ≤ m < M proc , 0 ≤ l < L . ⁢
In this case, in the 5-1-52 tree structure, the matrix generation unit 212 may generate the matrix R1, again, as follows: R 1 l , m = [ 1 1 K ⁢ 1 K ⁢ 2 K ⁢ 3 ] , ⁢ where ⁢ ⁢ ⁢ K ⁢ ⁢ 1 = { ⁢ c 1 , OTT 0 l , m , ∑ i = 0 3 ⁢ ⁢ DL ⁡ ( 0 , i ) != - 4 ⁢ 0 , ⁢ otherwise ⁢ K ⁢ ⁢ 2 = { ⁢ c 1 , OTT 0 l , m ⁢ c 1 , OTT 1 l , m , DL ⁡ ( 0 , 0 ) = 3 , DL ⁡ ( 0 , 1 ) = 3 ⁢ 0 , ⁢ otherwise ⁢ K ⁢ ⁢ 3 = { ⁢ c 1 , OTT 0 l , m ⁢ c 2 , OTT 1 l , m , DL ⁡ ( 0 , 2 ) = 3 , DL ⁡ ( 0 , 3 ) = 3 ⁢ 0 , ⁢ otherwise , , ⁢ where ⁢ ⁢ c 1 , OTT X l , m = 10 CLD X l , m 10 1 + 10 CLD X l , m 10 ⁢ ⁢ and ⁢ ⁢ c 2 , OTT X l , m = 1 1 + 10 CLD X l , m 10 , ⁢ and ⁢ ⁢ where ⁢ : CLD X l , m = D CLD ⁡ ( X , l , m ) , 0 ≤ X < 2 , 0 ≤ m < M proc , 0 ≤ l < L
An interpolation unit 214 may interpolate the matrix R1, e.g., as generated by the matrix generation unit 212, in order to generate the matrix M1.
A mix-vector calculation unit 210 may generate the matrix R2 for mixing a decorrelated signal with a direct signal.
The matrix R2 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 R2 generated by the mix-vector calculation unit 210 in order to generate the matrix M2.
Similar to above, examples for application to the 5-1-51 tree structure and the 5-1-52 tree structure will be described again.
First, FIG. 5 illustrates the case where only 4 channels are output in the 5-1-51 tree structure. Here, Tree′sign (0,,) and DL(0,) may be generated by the level calculation unit 235 as follows: Tree sign ′ ⁡ ( 0 , , ) = [ 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 ] , ⁢ DL ⁡ ( 0 , ) = [ 3 3 2 - 1 1 - 1 ] .
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 R2 may be generated, e.g., by the mix-vector calculation unit 210, again as follows: R 2 l , m = [ ⁢ H ⁢ 11 OTT 3 l , m ⁢ H ⁢ 11 OTT 1 l , m ⁢ H ⁢ 11 OTT 0 l , m H ⁢ 11 OTT 3 l , m ⁢ H ⁢ 11 OTT 1 l , m ⁢ H ⁢ 12 OTT 0 l , m H ⁢ 11 OTT 3 l , m ⁢ H ⁢ 12 OTT 1 l , m H ⁢ 12 OTT 3 l , m 0 H ⁢ 21 OTT 3 l , m ⁢ H ⁢ 11 OTT 1 l , m ⁢ H ⁢ 11 OTT 0 l , m ⁢ H ⁢ 21 OTT 3 l , m ⁢ H ⁢ 11 OTT 1 l , m ⁢ H ⁢ 12 OTT 0 l , m ⁢ H ⁢ 21 OTT 3 l , m ⁢ H ⁢ 12 OTT 1 l , m H ⁢ 22 OTT 3 l , m 0 ⁢ H ⁢ 21 OTT 1 l , m ⁢ H ⁢ 11 OTT 0 l , m ⁢ H ⁢ 21 OTT 1 l , m ⁢ H ⁢ 12 OTT 0 l , m ⁢ H ⁢ 22 OTT 1 l , m 0 0 ⁢ 0 ⁢ 0 ⁢ 0 0 0 ⁢ H ⁢ 21 OTT 0 l , m ⁢ H ⁢ 22 OTT 0 l , m ⁢ 0 0 0 ⁢ 0 ⁢ 0 ⁢ 0 0 0 ]
Second, FIG. 6 illustrates the case where only 4 channels are output in the 5-1-52 tree structure. Here, Tree′sign(0,,) and DL(0,) may be generated, e.g., by the level calculation unit 235, as follows: Tree sign ′ ⁡ ( 0 , , ) = [ 1 1 1 1 n ⁢ / ⁢ a n ⁢ / ⁢ a 1 1 - 1 - 1 n ⁢ / ⁢ a n ⁢ / ⁢ a 1 - 1 1 - 1 n ⁢ / ⁢ a n ⁢ / ⁢ a ] , ⁢ DL ⁡ ( 0 , ) = [ 3 3 3 3 - 1 - 1 ] .
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-51 tree structure. Tree′sign(0,,) and DL(0,) are generated by the level calculation unit 235 as follows: Tree sign ′ ⁡ ( 0 , , ) = [ 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 ] , ⁢ DL ⁡ ( 0 , ) = [ 3 3 2 - 1 - 1 - 1 ] .
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-52 tree structure. Here, Tree′sign(0,,) and DL(0,) may be generated, e.g., by the level calculation unit 235, as follows: Tree sign ′ ⁡ ( 0 , , ) = [ 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 ] , ⁢ DL ⁡ ( 0 , ) = [ 2 - 1 2 - 1 1 - 1 ] .
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-71 tree structure, and the 7-2-72 tree structure, the corresponding Treesign and Treedepth may also be defined.
First, in the 5-2-5 tree structure, Treesign, Treedepth, and R1 may be defined as follows: Tree sign ⁡ ( 0 , , ) = Tree sign ⁡ ( 1 , , ) = Tree sign ⁡ ( 2 , , ) = [ 1 - 1 ] , ⁢ Tree depth ⁡ ( 0 , ) = Tree depth ⁡ ( 1 , ) = Tree depth ⁡ ( 2 , ) = [ 1 1 ] . ⁢ R 1 l , m ⁡ ( i , j ) = 0 , when ⁢ ∑ k = 0 l ⁢ DL ⁡ ( i - 3 , k ) != 2 , ⁢ for ⁢ ⁢ 3 ≤ i < 6 , 0 ≤ j < 3
Second, in the 7-2-71 tree structure, Treesign, Treedepth, and R1 may be defined as follows: Tree sign ⁡ ( 0 , , ) = Tree sign ⁡ ( 1 , , ) = [ 1 1 - 1 1 - 1 n / a ] , ⁢ Tree sign ⁡ ( 2 , , ) = [ 1 - 1 ] Tree depth ⁡ ( 0 , ) = Tree depth ⁢ ( 1 , ) = [ 2 2 1 ] Tree depth ⁡ ( 2 , ) = [ 1 1 ] R 1 l , m ⁡ ( i , j ) = 0 , when ⁢ ⁢ ∑ k = 0 2 ⁢ DL ⁡ ( i - 3 , k ) < 1 , ⁢ for ⁢ ⁢ 3 ≤ i < 5 , 0 ≤ j < 3 R 1 l , m ⁡ ( 5 , j ) = 0 , when ⁢ ⁢ ∑ k = 0 1 ⁢ DL ⁡ ( 2 , k ) != 2 , ⁢ for ⁢ ⁢ 0 ≤ j < 3 R 1 l , m ⁡ ( i , j ) = 0 , when ⁢ ⁢ ∑ k = t ⁢ ⁢ 1 t ⁢ ⁢ 2 ⁢ DL ⁡ ( i - 6 , k ) != 4 , ⁢ for ⁢ ⁢ 6 ≤ i < 8 , 0 ≤ j < 3 ⁢ | , where ⁢ ⁢ t ⁢ ⁢ 1 = 0 , t ⁢ ⁢ 2 = 1 ⁢ ⁢ for ⁢ ⁢ 7 ⁢ - ⁢ 2 ⁢ - ⁢ 7 1 ⁢ configuration , ⁢ t ⁢ ⁢ 1 = 1 , t ⁢ ⁢ 2 = 2 ⁢ ⁢ for ⁢ ⁢ 7 ⁢ - ⁢ 2 ⁢ - ⁢ 7 2 ⁢ configuration
Third, in the 7-2-71 tree structure, Treesign, Treedepth, and R1 may be defined as follows: Tree sign ⁡ ( 0 , , ) = Tree sign ⁡ ( 1 , , ) = [ - 1 1 1 n / a 1 1 ] , ⁢ Tree sign ⁡ ( 2 , , ) = [ 1 - 1 ] Tree depth ⁡ ( 0 , ) = Tree depth ⁢ ( 1 , ) = [ 1 2 2 ] , ⁢ Tree depth ⁡ ( 2 , ) = [ 1 1 ] R 1 l , m ⁡ ( i , j ) = 0 , when ⁢ ⁢ ∑ k = 0 2 ⁢ DL ⁡ ( i - 3 , k ) < 1 , ⁢ for ⁢ ⁢ 3 ≤ i < 5 , 0 ≤ j < 3 R 1 l , m ⁡ ( 5 , j ) = 0 , when ⁢ ⁢ ∑ k = 0 1 ⁢ DL ⁡ ( 2 , k ) != 2 , ⁢ for ⁢ ⁢ 0 ≤ j < 3 ⁢ ⁢ R 1 l , m ⁡ ( i , j ) = 0 , when ⁢ ⁢ ∑ k = t ⁢ ⁢ 1 t ⁢ ⁢ 2 ⁢ DL ⁡ ( i - 6 , k ) != 4 , ⁢ for ⁢ ⁢ 6 ≤ i < 8 , 0 ≤ j < 3 ⁢ , where ⁢ ⁢ t ⁢ ⁢ 1 = 0 , t ⁢ ⁢ 2 = 1 ⁢ ⁢ for ⁢ ⁢ 7 ⁢ - ⁢ 2 ⁢ - ⁢ 7 1 ⁢ configuration , ⁢ t ⁢ ⁢ 1 = 1 , t ⁢ ⁢ 2 = 2 ⁢ ⁢ for ⁢ ⁢ 7 ⁢ - ⁢ 2 ⁢ - ⁢ 7 2 ⁢ 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 R2 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 M1, 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 M2, 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 M2 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 R3 may be calculated and applied to an arbitrary tree structure using the aforementioned equation, repeated below: Tree depth ⁡ ( v , i ) = { DL ⁡ ( v , i ) , Tree depth ⁡ ( v , i ) > DL ⁡ ( v , i ) , Tree depth ⁡ ( v , i ) , otherwise ⁢ ⁢ for ⁢ ⁢ 0 ≤ i < Tree outchan ⁡ ( v ) , 0 ≤ v < numOutChan ⁢ ⁢ R g l , m ⁡ ( i , v ) = { Tree depth ⁢ ∏ ρ = 0 ( i - i offset ⁡ ( , ) ) - 1 X Tree ⁡ ( o , ρ , i - i offset ⁡ ( , ) ) , if ⁢ ⁢ i offset ⁡ ( v ) ≤ i < i offset ⁡ ( v ) + Tree outChan ⁡ ( v ) , Tree depth ⁡ ( v , i - i offset ⁡ ( v ) ) > 0 1 , else ⁢ ⁢ if ⁢ ⁢ Tree depth ⁡ ( v , i - i offset ⁡ ( v ) ) = 0 0 , otherwise , ⁢ for ⁢ ⁢ 0 ≤ i < numChanOutAT ⁢ ⁢ and ⁢ ⁢ 0 ≤ v < numOutChan ⁢ ⁢ where ⁢ ⁢ i offset ⁡ ( v ) = { ∑ k = 0 v - 1 ⁢ Tree outChan ⁡ ( k ) , v > 0 ⁢ ⁢ and 0 otherwise ⁢ ⁢ X Tree ⁡ ( r , ρ , i imp ) = { C l , Mz ⁡ ( r , ρ , i imp ) , Tree sign ⁡ ( v , pi imp ) = 1 C r , Mz ⁡ ( r , ρ , i imp ) , Tree sign ⁡ ( v , pi imp ) = - 1 ⁢ ⁢ where ⁢ ⁢ idx ⁡ ( v , p , i imp ) = { ∑ k = 0 r - 1 ⁢ ( Tree outChan ⁡ ( k ) ) + Tree ⁡ ( v , p , i imp ) , v > 0 Tree ⁡ ( v , p , i imp ) otherwise ⁢ ⁢ and ⁢ ⁢ where ⁢ ⁢ C l , X = CLD 1 ⁢ ln , X 2 1 + CLD ln , X 2 ⁢ ⁢ and ⁢ ⁢ C r , X = ⁢ 1 1 + CLD 1 ⁢ ln , X 2 , ⁢ where ⁢ ⁢ CLD 1 ⁢ ln , X = 10 CLD x 20 ⁢ ⁢ and ⁢ ⁢ where ⁢ ⁢ CLD x l , m = D ATD ⁡ ( X , l , m ) , 0 ≤ m < M , 0 ≤ l < L .
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.
1. A method for scalable channel decoding, the method comprising:
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.
2. The method of claim 1, further comprising recognizing a configuration of channels or speakers and setting the number of decoding levels with consideration of the recognized configuration of channels or speakers.
3. The method of claim 2, wherein the configuration of the channels indicates information about channels that are available in multi-channels for reproduction by a decoder among channels encoded in an encoder corresponding to the at least one encoded multi-channel signal.
4. The method of claim 3, wherein the information about the channels is at least one of a number of multi-channels available in the decoder, positions of the speakers corresponding to the decoder, a vector indicating whether a channel is available in the multi-channels available in the decoder among channels encoded in the encoder, and a number of modules through which each multi-channel signal has to pass.
5. The method of claim 1, wherein the setting of the number of decoding levels comprises:
determining not to decode a channel that is not available for reproduction by the decoder among channels encoded in an encoder corresponding to the at least one encoded multi-channel signal; and
determining whether there are multi-channels to be decoded in a same decoding and up-mixing path except for a multi-channel that is determined not to be decoded, in order to set the number of decoding levels.
6. The method of claim 5, wherein the setting of the number of decoding levels further comprises:
determining whether there are multi-channels to be decoded in the same decoding and up-mixing path except for the multi-channel that is determined not to be decoded;
reducing a decoding level of the number of decoding levels for multi-channels that are not to be decoded in the same decoding and up-mixing path; and
setting the number of decoding levels for the multi-channels based on the reduced decoding level.
7. The method of claim 5, wherein the setting of the number of decoding levels further comprises transforming a row or a column of a matrix, indicating a decoding path for the channel that is not available for reproduction, into an identifier indicating a decoding unavailability, the matrix expressing a respective decoding channel for each multi-channel and expressing whether respective channels are available in the multi-channels among encoded channels of the at least one multi-channel signal.
8. The method of claim 7, wherein the setting of the number of decoding levels further comprises determining whether there is a row or a column indicating channels to be decoded in a same decoding and up-mixing path except for the row or the column in the matrix transformed into the identifier indicating the decoding unavailability.
9. The method of claim 8, wherein the reduction of the decoding level comprises transforming a component of the matrix indicating a decoding level that is finally determined for a channel that is determined not to have the row or the column indicating channels to be decoded in the same decoding and up-mixing path into the identifier indicating the decoding unavailability, and the setting of the number of decoding levels comprises selectively repeating the reducing of the reduced decoding level one-by-one.
10. The method of claim 9, wherein the setting of the number of decoding levels comprises setting a number of decoding levels for each channel except for the component of the matrix expressed with the identifier.
12. An apparatus with scalable channel decoding, the apparatus comprising:
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.
13. The apparatus of claim 12, further comprising a configuration recognition unit to recognize a configuration of channels or speakers and the level setting unit sets the number of decoding levels with consideration of the recognized configuration of channels or speakers.
14. The apparatus of claim 13, wherein the configuration of the channels indicates information about channels that are available in multi-channels for reproduction by a decoder among channels encoded in an encoder corresponding to the at least one encoded multi-channel signal.
15. The apparatus of claim 14, wherein the information about the channels is at least one of a number of multi-channels available in the decoder, positions of the speakers corresponding to the decoder, a vector indicating whether a channel is available in the multi-channels available in the decoder among channels encoded in the encoder, and a number of modules through which each multi-channel signal has to pass.
16. The apparatus of claim 12, wherein the level setting unit comprises:
a decoding determination unit to determine not to decode a channel that is not available for reproduction by the decoder among channels encoded in an encoder corresponding to the at least one encoded multi-channel signal; and
a first setting unit to determine whether there are multi-channels to be decoded in a same decoding and up-mixing path except for a multi-channel that is determined not to be decoded, in order to set the number of decoding levels.
17. The apparatus of claim 16, wherein the level setting unit further comprises:
a path determination unit to determine whether there are multi-channels to be decoded in the same decoding and up-mixing path except for the multi-channel that is determined not to be decoded;
a level reduction unit to reduce a decoding level of the number of decoding levels for multi-channels that are not to be decoded in the same decoding and up-mixing path; and
a second setting unit to set the number of decoding levels for the multi-channels based on the reduced decoding level.
18. The apparatus of claim 16, wherein the decoding determination unit transforms a row or a column of a matrix, indicating a decoding path for the channel that is not available for reproduction, into an identifier indicating a decoding unavailability, the matrix expressing a respective decoding channel for each multi-channel and expressing whether respective channels are available in the multi-channels among encoded channels of the at least one multi-channel signal.
19. The apparatus of claim 18, wherein the path determination unit determines whether there is a row or a column indicating channels to be decoded in a same decoding and up-mixing path except for the row or the column in the matrix transformed into the identifier indicating the decoding unavailability.
20. The apparatus of claim 19, wherein the level reduction unit transforms a component of the matrix indicating a decoding level that is finally determined for a channel that is determined not to have the row or the column indicating channels to be decoded in the same decoding and up-mixing path into the identifier indicating the decoding unavailability, and the path determination unit selectively repeats the reducing of the decoding level one-by-one.
21. The apparatus of claim 20, wherein the second setting unit sets a number of decoding levels for each channel except for the component of the matrix expressed with the identifier.
22. A method for scalable channel decoding, the method comprising:
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.
23. A method for scalable channel decoding, the method comprising:
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.
24. A method for scalable channel decoding, the method comprising:
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.
US11/652,031 2006-01-11 2007-01-11 Method, medium, and apparatus with scalable channel decoding Active 2029-07-05 US9934789B2 (en)
US78914706P true 2006-04-05 2006-04-05
US78960106P true 2006-04-06 2006-04-06
KR10-2006-0049033 2006-05-30
KR1020060049033A KR100803212B1 (en) 2006-01-11 2006-05-30 Method and apparatus for scalable channel decoding
US11/652,031 US9934789B2 (en) 2006-01-11 2007-01-11 Method, medium, and apparatus with scalable channel decoding
US20070233296A1 true US20070233296A1 (en) 2007-10-04
US9934789B2 US9934789B2 (en) 2018-04-03
ID=38500416
US11/652,031 Active 2029-07-05 US9934789B2 (en) 2006-01-11 2007-01-11 Method, medium, and apparatus with scalable channel decoding
US (1) US9934789B2 (en)
EP (2) EP1977418A4 (en)
JP (2) JP4801742B2 (en)
KR (5) KR100803212B1 (en)
CN (5) CN103354090B (en)
WO (1) WO2007081164A1 (en)
WO2011042149A1 (en) * 2009-10-06 2011-04-14 Dolby International Ab Efficient multichannel signal processing by selective channel decoding
EP2698789A3 (en) * 2010-02-18 2014-04-30 Dolby Laboratories Licensing Corporation Audio decoder and decoding method using efficient downmixing
AU2013201583B2 (en) * 2010-02-18 2015-07-16 Dolby International Ab Audio decoder and decoding method using efficient downmixing
US20160293173A1 (en) * 2013-11-15 2016-10-06 Orange Transition from a transform coding/decoding to a predictive coding/decoding
US9838823B2 (en) 2013-04-27 2017-12-05 Intellectual Discovery Co., Ltd. Audio signal processing method
JP6228389B2 (en) * 2013-05-14 2017-11-08 日本放送協会 Audio signal reproducing apparatus
JP6228387B2 (en) * 2013-05-14 2017-11-08 日本放送協会 Audio signal reproducing apparatus
US5850456A (en) * 1996-02-08 1998-12-15 U.S. Philips Corporation 7-channel transmission, compatible with 5-channel transmission and 2-channel transmission
US20020006081A1 (en) * 2000-06-07 2002-01-17 Kaneaki Fujishita Multi-channel audio reproducing apparatus
US20040117193A1 (en) * 2002-12-12 2004-06-17 Renesas Technology Corporation Audio decoding reproduction apparatus
US7487097B2 (en) * 2003-04-30 2009-02-03 Coding Technologies Ab Advanced processing based on a complex-exponential-modulated filterbank and adaptive time signalling methods
US7711552B2 (en) * 2006-01-27 2010-05-04 Dolby International Ab Efficient filtering with a complex modulated filterbank
KR20040078183A (en) 2003-03-03 2004-09-10 학교법인고려중앙학원 Magnetic tunnel junctions using amorphous CoNbZr as a underlayer
JP2004312484A (en) * 2003-04-09 2004-11-04 Sony Corp Device and method for acoustic conversion
JP2005069274A (en) 2003-08-28 2005-03-17 Nsk Ltd Roller bearing
JP4221263B2 (en) 2003-09-12 2009-02-12 財団法人鉄道総合技術研究所 Ride the train identification system
JP4089895B2 (en) 2003-09-25 2008-05-28 株式会社オーバル Vortex flowmeter
JP4134869B2 (en) 2003-09-25 2008-08-20 三菱電機株式会社 Imaging device
KR20060109296A (en) 2005-04-14 2006-10-19 엘지전자 주식회사 Reference channel adaptation method considering subband spatial cues for multi-channel audio signal
JP5025113B2 (en) * 2005-09-29 2012-09-12 三洋電機株式会社 Circuit device
KR200478183Y1 (en) 2015-04-07 2015-09-08 (주)아이셈자원 Apparatus for separating scrap iron
2006-05-30 KR KR1020060049033A patent/KR100803212B1/en active IP Right Grant
2007-01-11 CN CN201210457153.XA patent/CN103354090B/en active Search and Examination
2007-01-11 JP JP2008550237A patent/JP4801742B2/en active Active
2007-01-11 CN CN201210458826.3A patent/CN103021417B/en active IP Right Grant
2007-01-11 CN CN200780002329XA patent/CN101371300B/en active IP Right Grant
2007-01-11 US US11/652,031 patent/US9934789B2/en active Active
2007-01-11 WO PCT/KR2007/000201 patent/WO2007081164A1/en active Application Filing
2007-01-11 CN CN201210458715.2A patent/CN102938253B/en active IP Right Grant
2007-01-11 EP EP07708487A patent/EP1977418A4/en not_active Withdrawn
2007-01-11 EP EP12002670.3A patent/EP2509071B1/en active Active
2007-01-11 CN CN201210459124.7A patent/CN103000182B/en active IP Right Grant
2007-07-04 KR KR1020070067134A patent/KR101058041B1/en active IP Right Grant
2011-06-10 KR KR1020110056345A patent/KR101259016B1/en active IP Right Grant
2011-06-15 JP JP2011133621A patent/JP5129368B2/en active Active
2012-06-15 KR KR1020120064601A patent/KR101414455B1/en active IP Right Grant
2012-09-27 KR KR1020120108275A patent/KR101414456B1/en active IP Right Grant
US10277999B2 (en) 2006-02-03 2019-04-30 Electronics And Telecommunications Research Institute Method and apparatus for control of randering multiobject or multichannel audio signal using spatial cue
CN102549656A (en) * 2009-10-06 2012-07-04 杜比国际公司 Efficient multichannel signal processing by selective channel decoding
US8738386B2 (en) 2009-10-06 2014-05-27 Dolby International Ab Efficient multichannel signal processing by selective channel decoding
US10271156B2 (en) 2013-04-27 2019-04-23 Intellectual Discovery Co., Ltd. Audio signal processing method
US9984696B2 (en) * 2013-11-15 2018-05-29 Orange Transition from a transform coding/decoding to a predictive coding/decoding
US9934789B2 (en) 2018-04-03
KR100803212B1 (en) 2008-02-14
CN103354090B (en) 2017-06-16
KR20120084278A (en) 2012-07-27
CN103000182A (en) 2013-03-27
CN101371300A (en) 2009-02-18
CN103354090A (en) 2013-10-16
KR101058041B1 (en) 2011-08-19
CN102938253B (en) 2015-09-09
KR20070080850A (en) 2007-08-13
KR101414455B1 (en) 2014-07-03
CN102938253A (en) 2013-02-20
KR20120121378A (en) 2012-11-05
EP1977418A4 (en) 2010-02-03
CN103021417B (en) 2015-07-22
JP5129368B2 (en) 2013-01-30
JP2011217395A (en) 2011-10-27
CN103000182B (en) 2016-05-11
EP1977418A1 (en) 2008-10-08
WO2007081164A1 (en) 2007-07-19
KR20070075236A (en) 2007-07-18
JP4801742B2 (en) 2011-10-26
EP2509071B1 (en) 2016-01-06
EP2509071A1 (en) 2012-10-10
CN103021417A (en) 2013-04-03
JP2009523354A (en) 2009-06-18
KR101414456B1 (en) 2014-07-03
KR101259016B1 (en) 2013-04-29
KR20110083580A (en) 2011-07-20
CN101371300B (en) 2013-01-02
AU2006285538B2 (en) 2011-03-24 Apparatus for encoding and decoding audio signal and method thereof
CN101849257B (en) 2016-03-30 The audio coding using down-mix
RU2544789C2 (en) 2015-03-20 Method of encoding and device for decoding object-based audio signal
JP4527782B2 (en) 2010-08-18 Multi-channel multi-parameterized-based reconstruction
US8311227B2 (en) 2012-11-13 Method and an apparatus for decoding an audio signal
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:KIM, JUNGHOE;OH, EUNMI;CHOO, KIHYUN;AND OTHERS;REEL/FRAME:019172/0407