PATENT DOCUMENT

Abstract:
Disclosed is an encoding device, wherein the energy information of a given layer is efficiently encoded using a scalable encoding method in which the band to be encoded is selected in each layer, and the quality of decoded signals can be enhanced. An encoding device ( 101 ) is equipped with: a second layer encoding unit ( 205 ) which generates a second layer encoded information included in which is the first band information of said band; a second layer decoding unit ( 206 ) which generates a first decoding signal by using the second layer encoded information; an adding unit ( 207 ) which generates a second input signal by using the first decoding signal; and a third layer encoding unit ( 208 ) which generates a third layer encoded information included in which is a second band information obtained by selecting a second band to be quantized in the second input signal, and a corrected gain (energy information).

Full Description:
TECHNICAL FIELD 
       [0001]    The present invention relates to a coding apparatus, a decoding apparatus, and method thereof, which are used in a communication system that encodes and transmits a signal. 
       BACKGROUND ART 
       [0002]    When a speech/audio signal is transmitted in a packet communication system typified by Internet communication, a mobile communication system, or the like, compression/encoding technology is often used in order to increase speech/audio signal transmission efficiency. Also, recently, there is a growing need for technologies of simply encoding speech/audio signals at a low bit rate and encoding speech/audio signals of a wider band. 
         [0003]    Various technologies of integrating plural coding technologies in a hierarchical manner have been developed for the needs. For example, Non-Patent Literature 1 discloses a technique of encoding a spectrum (MDCT (Modified Discrete Cosine Transform) coefficient) of a desired frequency band in the hierarchical manner using TwinVQ (Transform Domain Weighted Interleave Vector Quantization) in which a basic constituting unit is modularized. Simple scalable coding having a high degree of freedom can be implemented by common use of the module plural times. In the technique, a sub-band that becomes a coding target of each hierarchy (layer) is basically a predetermined configuration. At the same time, there is also disclosed a configuration in which a position of the sub-band that becomes the coding target of each hierarchy (layer) is varied in a predetermined band according to a characteristic of an input signal. 
       CITATION LIST 
     Non-Patent Literature 
     NPTL 1 
       [0000]    
       
         Akio Kami et al., “Scalable Audio Coding Based on Hierarchical Transform Coding Modules”, Transaction of Institute of Electronics and Communication Engineers of Japan, A, Vol. J83-A, No. 3, pp. 241-252, March, 2000 
       
     
       SUMMARY OF INVENTION 
     Technical Problem 
       [0005]    However, in Non-Patent Literature 1, in the case that the sub-band that becomes the coding target is selected from plural candidates in each hierarchy (layer), the coding is performed without considering whether the selected sub-band is already encoded in a lower layer. Accordingly, for example, when the vector quantization is performed on energy information on the sub-band that is already selected in the lower layer, the vector quantization is performed irrespective of magnitude of residual energy of each sub-band, which results in a problem in that high coding performance cannot be obtained. 
         [0006]    The object of the present invention is to provide a coding apparatus, a decoding apparatus, and method thereof being able to efficiently encode the energy information on the current layer to improve the quality of the decoded signal in the scalable coding scheme in which the band of the coding target is selected in each hierarchy (layer). 
       Solution to Problem 
       [0007]    A coding apparatus of the present invention that includes at least two coding layers includes: a first layer coding section that inputs a first input signal of a frequency domain thereto, selects a first quantization target band of the first input signal from a plurality of sub-bands into which the frequency domain is divided, encodes the first input signal of the first quantization target band to generate first coded information including first band information on the first quantization target band, generates a first decoded signal using the first coded information, and generates a second input signal using the first input signal and the first decoded signal; and a second layer coding section that inputs the second input signal and the first coded information thereto, obtains second band information by selecting second quantization target band of the second input signal from the plurality of sub-bands, obtains a gain of the second input signal of the second quantization target band, encodes the second input signal of the second quantization target band using the first coded information, and generates second coded information including the second band information and gain coded information obtained by coding the gain. 
         [0008]    A decoding apparatus of the present invention that receives and decodes information generated by a coding apparatus including at least two coding layers includes: a receiving section that receives the information including first coded information and second coded information, the first coded information being obtained by coding a first layer of the coding apparatus, the first coded information including first band information generated by selecting a first quantization target band of the first layer from a plurality of sub-bands into which a frequency domain is divided, the second coded information being obtained by coding a second layer of the coding apparatus using the first coded information, the second coded information including second band information generated by selecting a second quantization target band of the second layer from the plurality of sub-bands; a first layer decoding section that inputs the first coded information obtained from the information thereto, and generates a first decoded signal with respect to the first coding quantization band set based on the first band information included in the first coded information; and a second layer decoding section that inputs the first coded information and the second coded information, which are obtained from the information, thereto, and generates a second decoded signal by correcting a signal for the second quantization target band, which is set based on the second band information included in the second coded information, using the first coded information and the second coded information. 
         [0009]    A coding method of the present invention for performing coding in at least two layers includes: a first layer coding step of inputting a first input signal of a frequency domain thereto, selecting a first quantization target band of the first input signal from a plurality of sub-bands into which the frequency domain is divided, encoding the first input signal of the first quantization target band to generate first coded information including first band information on the first quantization target band, generating a first decoded signal using the first coded information, and generating a second input signal using the first input signal and the first decoded signal; and a second layer coding step of inputting the second input signal and the first coded information thereto, obtaining second band information by selecting second quantization target band of the second input signal from the plurality of sub-bands, obtaining a gain of the second input signal of the second quantization target band, encoding the second input signal of the second quantization target band using the first coded information, and generating second coded information including the second band information and gain coded information obtained by coding the gain. 
         [0010]    A decoding method of the present invention for receiving and decoding information generated by a coding apparatus including at least two coding layers includes: a receiving step of receiving the information including first coded information and second coded information, the first coded information being obtained by coding a first layer of the coding apparatus, the first coded information including first band information generated by selecting a first quantization target band of the first layer from a plurality of sub-bands into which a frequency domain is divided, the second coded information being obtained by coding a second layer of the coding apparatus using the first coded information, the second coded information including second band information generated by selecting a second quantization target band of the second layer from the plurality of sub-bands; a first layer decoding step of inputting the first coded information obtained from the information thereto, and generating a first decoded signal with respect to the first quantization target band set based on the first band information included in the first coded information; and a second layer decoding step of inputting the first coded information and the second coded information, which are obtained from the information, thereto, and generating a second decoded signal by correcting a signal for the second quantization target band, which is set based on the second band information included in the second coded information, using the first coded information and the second coded information. 
       Advantageous Effects of Invention 
       [0011]    According to the invention, in the hierarchy coding scheme (scalable coding) in which the band of the coding target is selected in each hierarchy (layer), the energy information can efficiently be encoded by switching the method of encoding the energy information on the quantization target band of the current layer based on the coding result (quantized band) of the lower layer, and therefore the quality of the decoded signal can be improved. 
     
    
     
       BRIEF DESCRIPTION OF DRAWINGS 
         [0012]      FIG. 1  is a block diagram illustrating a configuration of a communication system including a coding apparatus and a decoding apparatus according to Embodiment of the invention; 
           [0013]      FIG. 2  is a block diagram illustrating a main configuration of the coding apparatus in  FIG. 1 ; 
           [0014]      FIG. 3  is a block diagram illustrating a main configuration of a second layer coding section in  FIG. 2 ; 
           [0015]      FIG. 4  is a view illustrating a configuration of a region according to Embodiment; 
           [0016]      FIG. 5  is a block diagram illustrating a main configuration of a second layer decoding section in  FIG. 2 ; 
           [0017]      FIG. 6  is a block diagram illustrating a main configuration of a third layer coding section in  FIG. 2 ; 
           [0018]      FIG. 7  is a block diagram illustrating a main configuration of the decoding apparatus in  FIG. 1 ; and 
           [0019]      FIG. 8  is a block diagram illustrating a main configuration of a third layer decoding section in  FIG. 7 . 
       
    
    
     DESCRIPTION OF EMBODIMENTS 
       [0020]    Referring to the drawings, one embodiment of the present invention will be described in detail. A speech coding apparatus and a sound decoding apparatus are described as examples of the coding apparatus and decoding apparatus of the invention. 
       Embodiment 
       [0021]      FIG. 1  is a block diagram illustrating a configuration of a communication system including a coding apparatus and a decoding apparatus according to Embodiment of the invention. In  FIG. 1 , the communication system includes coding apparatus  101  and decoding apparatus  103 , and coding apparatus  101  and decoding apparatus  103  can conduct communication with each other through transmission line  102 . Herein, coding apparatus  101  and decoding apparatus  103  are usually mounted in a base station apparatus, a communication terminal apparatus, and the like for use. 
         [0022]    Coding apparatus  101  divides an input signal into respective N samples (N is a natural number), and performs coding in each frame with the N samples as one frame. At this point, it is assumed that x(n) is the input signal that becomes a coding target. n (n=0, . . . , N−1) expresses an (n+1)th signal element in the input signal that is divided every N samples. Coding apparatus  101  transmits encoded input information (hereinafter referred to as “coded information”) to decoding apparatus  103  through transmission line  102 . 
         [0023]    Decoding apparatus  103  receives the coded information that is transmitted from coding apparatus  101  through transmission line  102 , and decodes the coded information to obtain an output signal. 
         [0024]      FIG. 2  is a block diagram illustrating a main configuration of coding apparatus  101  in  FIG. 1 . For example, it is assumed that coding apparatus  101  is a hierarchical coding apparatus including three coding hierarchies (layers). Hereinafter, it is assumed that the three layers are referred to as a first layer, a second layer, and a third layer in the ascending order of a bit rate. 
         [0025]    For example, first layer coding section  201  encodes the input signal by a CELP (Code Excited Linear Prediction) speech coding method to generate first layer coded information, and outputs the generated first layer coded information to first layer decoding section  202  and coded information integration section  209 . 
         [0026]    For example, first layer decoding section  202  decodes the first layer coded information, which is input from first layer coding section  201 , by the CELP speech decoding method to generate a first layer decoded signal, and outputs the generated first layer decoded signal to adder  203 . 
         [0027]    Adder  203  adds the first layer decoded signal to the input signal while inverting a polarity of the first layer decoded signal, thereby calculating a difference signal between the input signal and the first layer decoded signal. Then, adder  203  outputs the obtained difference signal as a first layer difference signal to orthogonal transform processing section  204 . 
         [0028]    Orthogonal transform processing section  204  includes buffer buf 1 ( n )(n=0, . . . , N−1) therein, and converts first layer difference signal x 1 ( n ) into a frequency domain parameter (frequency domain signal) by performing an MDCT (Modified Discrete Cosine Transform) to first layer difference signal x 1 ( n ). 
         [0029]    An orthogonal transform processing in orthogonal transform processing section  204 , namely, an orthogonal transform processing calculating procedure and data output to an internal buffer will be described below. 
         [0030]    Orthogonal transform processing section  204  initializes buffer buf 1 ( n ) to an initial value “0” by the following equation (1). 
         [0000]      [1] 
         [0000]      buf1( n )=0( n= 0, . . . , N− 1)  (Equation 1)
 
         [0031]    Then orthogonal transform processing section  204  performs the Modified Discrete Cosine Transform (MDCT) to the first layer difference signal x 1 ( n ) according to the following equation (2), and obtains an MDCT coefficient (hereinafter referred to as a “first layer difference spectrum”) X 1 ( k ) of the first layer difference signal x 1 ( n ). 
         [0000]    
       
         
           
             
               
                 
                   ( 
                   
                     Equation 
                      
                     
                         
                     
                      
                     2 
                   
                   ) 
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       X 
                        
                       
                           
                       
                        
                       1 
                        
                       
                         ( 
                         k 
                         ) 
                       
                     
                     = 
                     
                       
                         2 
                         N 
                       
                        
                       
                         
                           ∑ 
                           
                             n 
                             = 
                             0 
                           
                           
                             
                               2 
                                
                               N 
                             
                             - 
                             1 
                           
                         
                          
                         
                             
                         
                          
                         
                           x 
                            
                           
                               
                           
                            
                           
                             1 
                             ′ 
                           
                            
                           
                             ( 
                             n 
                             ) 
                           
                            
                           
                             cos 
                              
                             
                               [ 
                               
                                 
                                   
                                     ( 
                                     
                                       
                                         2 
                                          
                                         
                                             
                                         
                                          
                                         n 
                                       
                                       + 
                                       1 
                                       + 
                                       N 
                                     
                                     ) 
                                   
                                    
                                   
                                     ( 
                                     
                                       
                                         2 
                                          
                                         
                                             
                                         
                                          
                                         k 
                                       
                                       + 
                                       1 
                                     
                                     ) 
                                   
                                    
                                   π 
                                 
                                 
                                   4 
                                    
                                   
                                       
                                   
                                    
                                   N 
                                 
                               
                               ] 
                             
                           
                         
                       
                     
                   
                    
                   
                     
 
                   
                    
                   
                     ( 
                     
                       
                         k 
                         - 
                         0 
                       
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         N 
                         - 
                         1 
                       
                     
                     ) 
                   
                 
               
               
                 
                   [ 
                   2 
                   ] 
                 
               
             
           
         
       
     
         [0032]    Where k is an index of each sample in one frame. Using the following equation (3), orthogonal transform processing section  204  obtains x 1 ′( n ) that is a vector formed by coupling the first layer difference signal x 1 ( n ) and buffer buf 1 ( n ). 
         [0000]    
       
         
           
             
               
                 
                   ( 
                   
                     Equation 
                      
                     
                         
                     
                      
                     3 
                   
                   ) 
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     x 
                      
                     
                         
                     
                      
                     
                       1 
                       ′ 
                     
                      
                     
                       ( 
                       n 
                       ) 
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                             buf 
                              
                             
                                 
                             
                              
                             1 
                              
                             
                               ( 
                               n 
                               ) 
                             
                           
                         
                         
                           
                             ( 
                             
                               
                                 n 
                                 = 
                                 0 
                               
                               , 
                               … 
                                
                               
                                   
                               
                               , 
                               
                                 N 
                                 - 
                                 1 
                               
                             
                             ) 
                           
                         
                       
                       
                         
                           
                             x 
                              
                             
                                 
                             
                              
                             1 
                              
                             
                               ( 
                               
                                 n 
                                 - 
                                 N 
                               
                               ) 
                             
                           
                         
                         
                           
                             ( 
                             
                               
                                 n 
                                 = 
                                 N 
                               
                               , 
                               … 
                                
                               
                                   
                               
                               , 
                               
                                 
                                   2 
                                    
                                   N 
                                 
                                 - 
                                 1 
                               
                             
                             ) 
                           
                         
                       
                     
                   
                 
               
               
                 
                   [ 
                   3 
                   ] 
                 
               
             
           
         
       
     
         [0033]    Then, orthogonal transform processing section  204  updates buffer buf 1 ( n ) using the following equation (4). 
         [0000]      [4] 
         [0000]      buf1( n )= x 1( n )( n= 0, . . . , N− 1)  (Equation 4)
 
         [0034]    Orthogonal transform processing section  204  outputs the first layer difference spectrum X 1 ( k ) to second layer coding section  205  and adder  207 . 
         [0035]    Second layer coding section  205  generates second layer coded information using the first layer difference spectrum X 1 ( k ) input from orthogonal transform processing section  204 , and outputs the generated second layer coded information to second layer decoding section  206 , third layer coding section  208 , and coded information integration section  209 . The details of second layer coding section  205  will be described later. 
         [0036]    Second layer decoding section  206  decodes the second layer coded information input from second layer coding section  205 , and calculates a second layer decoded spectrum. Second layer decoding section  206  outputs the generated second layer decoded spectrum to adder  207 . The details of second layer decoding section  206  will be described later. 
         [0037]    Adder  207  adds the second layer decoded spectrum to the first layer difference spectrum while inverting the polarity of the second layer decoded spectrum, thereby calculating a difference spectrum between the first layer difference spectrum and the second layer decoded spectrum. Then, adder  207  outputs the obtained difference spectrum as a second layer difference spectrum to third layer coding section  208 . 
         [0038]    Third layer coding section  208  generates third layer coded information using the second layer coded information input from second layer coding section  205  and the second layer difference spectrum input from adder  207 , and outputs the generated third layer coded information to coded information integration section  209 . The details of third layer coding section  208  will be described later. 
         [0039]    Coded information integration section  209  integrates the first layer coded information input from first layer coding section  201 , the second layer coded information input from second layer coding section  205 , and the third layer coded information input from third layer coding section  208 . Then, if necessary, coded information integration section  209  attaches a transmission error code and the like to the integrated information source code, and outputs the result to transmission line  102  as coded information. 
         [0040]      FIG. 3  is a block diagram illustrating a main configuration of second layer coding section  205 . 
         [0041]    In  FIG. 3 , second layer coding section  205  includes band selecting section  301 , shape coding section  302 , gain coding section  303 , and multiplexing section  304 . 
         [0042]    Band selecting section  301  divides the first layer difference spectrum input from orthogonal transform processing section  204  into plural sub-bands, selects a band (quantization target band) that becomes a quantization target from the plural sub-bands, and outputs band information indicating the selected band to shape coding section  302  and multiplexing section  304 . Band selecting section  301  outputs the first layer difference spectrum to shape coding section  302 . As to the input of the first layer difference spectrum to shape coding section  302 , the first layer difference spectrum may directly be input from orthogonal transform processing section  204  to shape coding section  302  irrespective of the input of the first layer difference spectrum from orthogonal transform processing section  204  to band selecting section  301 . The details of processing of band selecting section  301  will be described later. 
         [0043]    Using the spectrum (MDCT coefficient) corresponding to the band indicated by the band information input from band selecting section  301  in the first layer difference spectrum input from band selecting section  301 , shape coding section  302  encodes the shape information to generate shape coded information, and outputs the generated shape coded information to multiplexing section  304 . Shape coding section  302  obtains an ideal gain (gain information) that is calculated during the shape coding, and outputs the obtained ideal gain to gain coding section  303 . The details of processing of shape coding section  302  will be described later. 
         [0044]    The ideal gain is input to gain coding section  303  from shape coding section  302 . Gain coding section  303  obtains gain coded information by quantizing the ideal gain input from shape coding section  302 . Gain coding section  303  outputs the obtained gain coded information to multiplexing section  304 . The details of processing of gain coding section  303  will be described later. 
         [0045]    Multiplexing section  304  multiplexes the band information input from band selecting section  301 , the shape coded information input from shape coding section  302 , and the gain coded information input from gain coding section  303 , and outputs an obtained bit stream as the second layer coded information to second layer decoding section  206 , third layer coding section  208 , and coded information integration section  209 . 
         [0046]    Second layer coding section  205  having the above configuration is operated as follows. 
         [0047]    The first layer difference spectrum X 1 ( k ) is input to band selecting section  301  from orthogonal transform processing section  204 . 
         [0048]    Band selecting section  301  divides the first layer difference spectrum X 1 ( k ) into the plural sub-bands. The case that the first layer difference spectrum X 1 ( k ) is equally divided into J (J is a natural number) sub-bands is described by way of example. Band selecting section  301  selects consecutive L (L is a natural number) sub-bands in the J sub-bands to obtain M (M is a natural number) kinds of groups of the sub-bands. Hereinafter, the M kinds of groups of the sub-bands are referred to as a region. 
         [0049]      FIG. 4  is a view illustrating a configuration of the region obtained by band selecting section  301 . 
         [0050]    In  FIG. 4 , the number of sub-bands is 17 (J=17), the number of kinds of the regions is 8 (M=8), and consecutive  5  (L=5) sub-bands constitute each region. For example, region  4  includes 6 to 10 sub-bands. 
         [0051]    Then band selecting section  301  calculates average energy E 1 ( m ) in each of the M kinds of regions according to the following equation (5). 
         [0000]    
       
         
           
             
               
                 
                   ( 
                   
                     Equation 
                      
                     
                         
                     
                      
                     5 
                   
                   ) 
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       E 
                        
                       
                           
                       
                        
                       1 
                        
                       
                         ( 
                         m 
                         ) 
                       
                     
                     = 
                     
                       
                         
                           ∑ 
                           
                             j 
                             = 
                             
                               S 
                                
                               
                                 ( 
                                 m 
                                 ) 
                               
                             
                           
                           
                             
                               S 
                                
                               
                                 ( 
                                 m 
                                 ) 
                               
                             
                             + 
                             L 
                             - 
                             1 
                           
                         
                          
                         
                             
                         
                          
                         
                           
                             ∑ 
                             
                               k 
                               = 
                               
                                 B 
                                  
                                 
                                   ( 
                                   j 
                                   ) 
                                 
                               
                             
                             
                               
                                 B 
                                  
                                 
                                   ( 
                                   j 
                                   ) 
                                 
                               
                               + 
                               
                                 W 
                                  
                                 
                                   ( 
                                   j 
                                   ) 
                                 
                               
                             
                           
                            
                           
                               
                           
                            
                           
                             
                               ( 
                               
                                 X 
                                  
                                 
                                     
                                 
                                  
                                 1 
                                  
                                 
                                   ( 
                                   k 
                                   ) 
                                 
                               
                               ) 
                             
                             2 
                           
                         
                       
                       L 
                     
                   
                    
                   
                     
 
                   
                    
                   
                     ( 
                     
                       
                         m 
                         = 
                         0 
                       
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         M 
                         - 
                         1 
                       
                     
                     ) 
                   
                 
               
               
                 
                   [ 
                   5 
                   ] 
                 
               
             
           
         
       
     
         [0052]    Where j is an index of each of the J sub-bands and m is an index of each of the M kinds of regions. S(m) indicates a minimum value in indexes of the L sub-bands constituting region m, and B(j) is a minimum value in indexes of the plural MDCT coefficients constituting sub-band j. W(j) indicates a band width of sub-band j. The case that J sub-bands have the equal band width, namely, W(j) is a constant, will be described below by way of example. 
         [0053]    Band selecting section  301  selects the region where the average energy E 1 ( m ) is maximized, for example, the band including sub-bands j″ to (j″+L−1) as a band (quantization target band) that becomes the quantization target, and band selecting section  301  outputs an index m_max indicating the region as the band information to shape coding section  302  and multiplexing section  304 . Band selecting section  301  outputs the first layer difference spectrum X 1 ( k ) of the quantization target band to shape coding section  302 . Hereinafter, it is assumed that j″ to (j″+L−1) are band indexes indicating the quantization target band selected by band selecting section  301 . 
         [0054]    Shape coding section  302  performs shape quantization in each sub-band to the first layer difference spectrum X 1 ( k ) corresponding to the band that is indicated by band information m_max input from band selecting section  301 . Specifically, shape coding section  302  searches a built-in shape code book including SQ shape code vectors in each of the L sub-bands, and obtains the index of the shape code vector in which an evaluation scale Shape_q(i) of the following equation (6) is maximized. 
         [0000]    
       
         
           
             
               
                 
                   ( 
                   
                     Equation 
                      
                     
                         
                     
                      
                     6 
                   
                   ) 
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       Shape_q 
                        
                       
                         ( 
                         i 
                         ) 
                       
                     
                     = 
                     
                       
                         
                           { 
                           
                             
                               ∑ 
                               
                                 k 
                                 = 
                                 0 
                               
                               
                                 W 
                                  
                                 
                                   ( 
                                   j 
                                   ) 
                                 
                               
                             
                              
                             
                                 
                             
                              
                             
                               ( 
                               
                                 X 
                                  
                                 
                                     
                                 
                                  
                                 1 
                                  
                                 
                                   
                                     ( 
                                     
                                       k 
                                       + 
                                       
                                         B 
                                          
                                         
                                           ( 
                                           j 
                                           ) 
                                         
                                       
                                     
                                     ) 
                                   
                                   · 
                                   
                                     SC 
                                     k 
                                     i 
                                   
                                 
                               
                               ) 
                             
                           
                           } 
                         
                         2 
                       
                       
                         
                           ∑ 
                           
                             k 
                             = 
                             0 
                           
                           
                             W 
                              
                             
                               ( 
                               j 
                               ) 
                             
                           
                         
                          
                         
                           
                             SC 
                             k 
                             i 
                           
                           · 
                           
                             SC 
                             k 
                             i 
                           
                         
                       
                     
                   
                    
                   
                     
 
                   
                    
                   
                     ( 
                     
                       
                         j 
                         = 
                         
                           j 
                           ″ 
                         
                       
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         
                           j 
                           ″ 
                         
                         + 
                         L 
                         - 
                         1 
                       
                       , 
                       
                         i 
                         = 
                         0 
                       
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         SQ 
                         - 
                         1 
                       
                     
                     ) 
                   
                 
               
               
                 
                   [ 
                   6 
                   ] 
                 
               
             
           
         
       
     
         [0055]    Where SC i   k  is the shape code vector constituting the shape code book, i is the index of the shape code vector, and k is the index of the element of the shape code vector. 
         [0056]    Shape coding section  302  outputs an index S_max of the shape code vector, in which the evaluation scale Shape_q(i) of the equation (6) is maximized, as the shape coded information to multiplexing section  304 . Shape coding section  302  calculates an ideal gain Gain_i(j) according to the following equation (7), and outputs the calculated ideal gain Gain_i(j) to gain coding section  303 . 
         [0000]    
       
         
           
             
               
                 
                   ( 
                   
                     Equation 
                      
                     
                         
                     
                      
                     7 
                   
                   ) 
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       Gain_i 
                        
                       
                         ( 
                         j 
                         ) 
                       
                     
                     = 
                     
                       
                         
                           ∑ 
                           
                             k 
                             = 
                             0 
                           
                           
                             W 
                              
                             
                               ( 
                               j 
                               ) 
                             
                           
                         
                          
                         
                             
                         
                          
                         
                           ( 
                           
                             X 
                              
                             
                                 
                             
                              
                             1 
                              
                             
                               
                                 ( 
                                 
                                   k 
                                   + 
                                   
                                     B 
                                      
                                     
                                       ( 
                                       j 
                                       ) 
                                     
                                   
                                 
                                 ) 
                               
                               · 
                               
                                 SC 
                                 k 
                                 
                                   S_ 
                                    
                                   max 
                                 
                               
                             
                           
                           ) 
                         
                       
                       
                         
                           ∑ 
                           
                             k 
                             = 
                             0 
                           
                           
                             W 
                              
                             
                               ( 
                               j 
                               ) 
                             
                           
                         
                          
                         
                           
                             SC 
                             k 
                             S 
                           
                           · 
                           
                             SC 
                             k 
                             S_max 
                           
                         
                       
                     
                   
                    
                   
                     
 
                   
                    
                   
                     ( 
                     
                       
                         j 
                         = 
                         
                           j 
                           ″ 
                         
                       
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         
                           j 
                           ″ 
                         
                         + 
                         L 
                         - 
                         1 
                       
                     
                     ) 
                   
                 
               
               
                 
                   [ 
                   7 
                   ] 
                 
               
             
           
         
       
     
         [0057]    Gain coding section  303  quantizes the ideal gain Gain_i(j) input from the shape coding section  302  according to the following equation (8). At this point, gain coding section  303  deals with the ideal gain as an L-dimensional vector, and searches the built-in gain code book including GQ gain code vectors to perform vector quantization. 
         [0000]    
       
         
           
             
               
                 
                   ( 
                   
                     Equation 
                      
                     
                         
                     
                      
                     8 
                   
                   ) 
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       Gain_q 
                        
                       
                         ( 
                         i 
                         ) 
                       
                     
                     = 
                     
                       
                         ∑ 
                         
                           j 
                           = 
                           0 
                         
                         
                           L 
                           - 
                           1 
                         
                       
                        
                       
                           
                       
                        
                       
                         
                           { 
                           
                             
                               Gain_i 
                                
                               
                                 ( 
                                 
                                   j 
                                   + 
                                   
                                     j 
                                     ″ 
                                   
                                 
                                 ) 
                               
                             
                             - 
                             
                               GC 
                               j 
                               i 
                             
                           
                           } 
                         
                         2 
                       
                     
                   
                    
                   
                     
 
                   
                    
                   
                     ( 
                     
                       
                         i 
                         = 
                         0 
                       
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         GQ 
                         - 
                         1 
                       
                     
                     ) 
                   
                 
               
               
                 
                   [ 
                   8 
                   ] 
                 
               
             
           
         
       
     
         [0058]    At this point, the index of the gain code book that minimizes a square error Gain_q(i) of the equation (8) is expressed by G_min. 
         [0059]    Gain coding section  303  outputs the index G_min as the gain coded information to multiplexing section  304 . 
         [0060]    Multiplexing section  304  multiplexes the band information m_max input from band selecting section  301 , the shape coded information S_max input from shape coding section  302 , and the gain coded information G_min input from gain coding section  303 , and outputs the obtained bit stream as the second layer coded information to second layer decoding section  206 , third layer coding section  208 , and coded information integration section  209 . 
         [0061]      FIG. 5  is a block diagram illustrating a main configuration of second layer decoding section  206 . 
         [0062]    In  FIG. 5 , second layer decoding section  206  includes demultiplexing section  401 , shape decoding section  402 , and gain decoding section  403 . 
         [0063]    Demultiplexing section  401  demultiplexes the band information, the shape coded information, and the gain coded information from the second layer coded information input from second layer coding section  205 , outputs the obtained band information and shape coded information to shape decoding section  402 , and outputs the obtained gain coded information to gain decoding section  403 . 
         [0064]    Shape decoding section  402  obtains the value of the shape of the MDCT coefficient corresponding to the quantization target band, which is indicated by the band information input from demultiplexing section  401 , by decoding the shape coded information input from demultiplexing section  401 , and shape decoding section  402  outputs the obtained value of the shape to gain decoding section  403 . The details of processing of shape decoding section  402  will be described later. 
         [0065]    Gain decoding section  403  obtains the gain value by performing dequantization to the gain coded information input from demultiplexing section  401  using the built-in gain code book. Gain decoding section  403  obtains a decoded MDCT coefficient of the coding target band using the obtained gain value and the value of the shape input from shape decoding section  402 , and outputs the obtained decoded MDCT coefficient as the second layer decoded spectrum to adder  207 . The details of processing of gain decoding section  403  will be described later. 
         [0066]    Second layer decoding section  206  having the above configuration is operated as follows. 
         [0067]    Demultiplexing section  401  demultiplexes the band information m_max, the shape coded information S_max, and the gain coded information G_min from the second layer coded information input from second layer coding section  205 , outputs the obtained band information m_max and shape coded information S_max to shape decoding section  402 , and outputs the obtained gain coded information G_min to gain decoding section  403 . 
         [0068]    Shape decoding section  402  is provided with the same shape code book as the shape code book included in shape coding section  302  of second layer coding section  205 . Shape decoding section  402  searches the shape code vector in which the shape coded information S_max input from demultiplexing section  401  is used as the index. Shape decoding section  402  outputs the searched shape code vector as the value of the shape of the MDCT coefficient of the quantization target band, which is indicated by the band information m_max input from demultiplexing section  401 , to gain decoding section  403 . At this point, the shape code vector that is searched as the value of the shape is expressed by Shape_q′(k) (k=B(j″), . . . , B(j″+L)−1). 
         [0069]    Gain decoding section  403  is provided with the same gain code book as the gain code book included in gain coding section  303  of second layer coding section  205 . Gain decoding section  403  performs the dequantization to the gain value according to the following equation (9). Gain decoding section  403  deals with the gain value as the L-dimensional vector to perform the vector dequantization. That is, a gain code vector GC j   G     —     min  corresponding to the gain coded information G_min is directly used as the gain value. 
         [0000]      [9] 
         [0000]      Gain —   q ′( j+j ″)= GC   j   G     —     min ( j= 0, . . . , L− 1)  (Equation 9)
 
         [0070]    Then gain decoding section  403  calculates the decoded MDCT coefficient as second layer decoded spectrum X 2 ″(k) according to the following equation (10) using the gain value obtained by the dequantization of the current frame and the value of the shape input from shape decoding section  402 . In the case that k exists in B(j″) to B(j″+1)−1 during the dequantization of the decoded MDCT coefficient, the gain value takes a value of Gain_q′(j″). 
         [0000]    
       
         
           
             
               
                 
                   ( 
                   
                     Equation 
                      
                     
                         
                     
                      
                     10 
                   
                   ) 
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       X 
                        
                       
                           
                       
                        
                       
                         2 
                         ″ 
                       
                        
                       
                         ( 
                         k 
                         ) 
                       
                     
                     = 
                     
                       
                         Gain_q 
                         ′ 
                       
                        
                       
                         
                           ( 
                           j 
                           ) 
                         
                         · 
                         
                           Shape_q 
                           ′ 
                         
                       
                        
                       
                         ( 
                         k 
                         ) 
                       
                     
                   
                    
                   
                     
 
                   
                    
                   
                     ( 
                     
                       
                         
                           
                             
                               k 
                               = 
                               
                                 B 
                                  
                                 
                                   ( 
                                   
                                     j 
                                     ″ 
                                   
                                   ) 
                                 
                               
                             
                             , 
                             … 
                              
                             
                                 
                             
                             , 
                             
                               
                                 B 
                                  
                                 
                                   ( 
                                   
                                     
                                       j 
                                       ″ 
                                     
                                     + 
                                     L 
                                   
                                   ) 
                                 
                               
                               - 
                               1 
                             
                           
                         
                       
                       
                         
                           
                             
                               j 
                               = 
                               
                                 j 
                                 ″ 
                               
                             
                             , 
                             … 
                              
                             
                                 
                             
                             , 
                             
                               
                                 j 
                                 ″ 
                               
                               + 
                               L 
                               - 
                               1 
                             
                           
                         
                       
                     
                     ) 
                   
                 
               
               
                 
                   [ 
                   10 
                   ] 
                 
               
             
           
         
       
     
         [0071]    Gain decoding section  403  outputs the calculated second layer decoded spectrum X 2 ″(k) to adder  207  according to the equation (10). 
         [0072]      FIG. 6  is a block diagram illustrating a main configuration of third layer coding section  208 . 
         [0073]    In  FIG. 6 , third layer coding section  208  includes band selecting section  301 , shape coding section  302 , gain correction coefficient setting section  601 , gain coding section  602 , and multiplexing section  304 . Since the structural elements of band selecting section  301  and shape coding section  302  are identical to those of second layer coding section  205  except input and output names, the structural elements are designated by the identical numeral, and the description thereof is omitted. 
         [0074]    The band information is input to gain correction coefficient setting section  601  from band selecting section  301 . The band information is information on the band that is selected as the coding target by third layer coding section  208 , and hereinafter the band information is referred to as “third layer band information”. 
         [0075]    The second layer coded information is input to gain correction coefficient setting section  601  from second layer coding section  205 . 
         [0076]    The second layer coded information includes information on the band that is selected as the coding target by second layer coding section  205 . Hereinafter, the information on the band that is selected as the coding target by second layer coding section  205  is referred to as “second layer band information”. 
         [0077]    Gain correction coefficient setting section  601  sets a correction coefficient that is used to quantize the gain information with respect to the sub-bands indicated by the third layer band information from the second layer band information and the third layer band information. 
         [0078]    Specifically, in the case that the sub-band indicated by the second layer band information is not included in the sub-band indicated by the third layer band information (that is, in the case that third layer coding section  208  encodes the band that is not selected as the coding target by second layer coding section  205 ), a gain correction coefficient γ j  is set as expressed by the following equation (11). 
         [0000]      [11] 
         [0000]      γ j =1.0( j=j″, . . . ,j″+L− 1)  (Equation 11)
 
         [0079]    In the case that the sub-band indicated by the second layer band information is included in the sub-band indicated by the third layer band information (that is, in the case that third layer coding section  208  re-encodes the band that is selected as the coding target by second layer coding section  205 ), the gain correction coefficient γ j  is set as expressed by the following equation (12). 
         [0000]      [12] 
         [0000]      γ j =0.5( j=j″, . . . ,j″+L− 1)  (Equation 12)
 
         [0080]    Gain correction coefficient setting section  601  outputs the set gain correction coefficient γ j  to gain coding section  602 . 
         [0081]    The ideal gain is input to gain coding section  602  from shape coding section  302 . The gain correction coefficient γ j  is input to gain coding section  602  from gain correction coefficient setting section  601 . Gain coding section  602  corrects the ideal gain by dividing the ideal gain input from shape coding section  302  by the gain correction coefficient γ j , as expressed by an equation (13). 
         [0000]      [13] 
         [0000]      Gain —   i ′( j )=Gain —   i ( j )/γ j ( j=j″, . . . ,j″+L− 1)  (Equation 13)
 
         [0082]    Then, gain coding section  602  obtains gain coded information by quantizing an ideal gain Gain_i′(j) that is corrected using the gain correction coefficient γ j  according to the equation (13). 
         [0083]    Specifically, using ideal gain Gain_i′(j) that is corrected using the gain correction coefficient γ j  according to the equation (13), gain coding section  602  searches the built-in gain code book including the GQ gain code vectors in each of the L sub-bands, and obtains the index of the gain code vector in which a square error Gainq_i(i) of an equation (14) is minimized. 
         [0000]    
       
         
           
             
               
                 
                   ( 
                   
                     Equation 
                      
                     
                         
                     
                      
                     14 
                   
                   ) 
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       Gain_q 
                        
                       
                         ( 
                         i 
                         ) 
                       
                     
                     = 
                     
                       
                         { 
                         
                           
                             ∑ 
                             
                               j 
                               = 
                               0 
                             
                             
                               L 
                               - 
                               1 
                             
                           
                            
                           
                               
                           
                            
                           
                             { 
                             
                               
                                 
                                   Gain_i 
                                   ′ 
                                 
                                  
                                 
                                   ( 
                                   
                                     j 
                                     + 
                                     
                                       j 
                                       ″ 
                                     
                                   
                                   ) 
                                 
                               
                               - 
                               
                                 GC 
                                 j 
                                 i 
                               
                             
                             } 
                           
                         
                         } 
                       
                       2 
                     
                   
                    
                   
                     
 
                   
                    
                   
                     ( 
                     
                       
                         i 
                         = 
                         0 
                       
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         GQ 
                         - 
                         1 
                       
                     
                     ) 
                   
                 
               
               
                 
                   [ 
                   14 
                   ] 
                 
               
             
           
         
       
     
         [0084]    Where GC i   j  is the gain code vector constituting the gain code book, i is the index of the gain code vector, and k is the index of the element of the gain code vector. For example, j has values of 0 to 4 in the case that the number of sub-bands constituting the region is 5 (in the case of L=5). Gain coding section  602  deals with the L sub-bands in one region as the L-dimensional vector to perform the vector quantization. 
         [0085]    Gain coding section  602  outputs an index G_min of the gain code vector, in which the square error Gainq_i(i) of the equation (14) is minimized, as the gain coded information to multiplexing section  304 . 
         [0086]    Thus, as expressed by the equation (11) or the equation (12), gain correction coefficient setting section  601  switches the gain correction coefficient γ j  used to correct the ideal gain according to the case that the sub-band indicated by the second layer band information in the lower layer is not included in the sub-band indicated by the third layer band information and the case that the sub-band indicated by the second layer band information in the lower layer is included in the sub-band indicated by the third layer band information. 
         [0087]    For the coding target band that is quantized in the lower layer upon quantizing the gain information on the coding target band of the current layer, gain coding section  602  searches the gain code vector, which best approximates the ideal gain after the correction, from the gain code book with respect to the corresponding element of the gain code book using the ideal gain that is corrected by the gain correction coefficient γ j . 
         [0088]    As can be seen from the equation (11) and the equation (12), in Embodiment, in the case that the sub-band indicated by the third layer band information in the current layer includes the sub-band indicated by the second layer band information in the lower layer, the correction is performed such that the ideal gain Gain_i(j) is increased. 
         [0089]    That is, it is said that the gain correction coefficient γ j  is a coefficient that brings a distribution of magnitude of the gain code vector of the quantization target band in the current layer close to a distribution (a distribution of the magnitude of the gain code vector in the gain code book) of the gain code vector of the quantization target band in the lower layer. 
         [0090]    As a result, even if the vector quantization is performed to the plural elements in which energy magnitude differs largely from each other, because the energy magnitude of the elements of the gain code vector can be smoothed, so that the vector quantization can efficiently be performed using the same gain code book. 
         [0091]    The processing of third layer coding section  208  has been described above. 
         [0092]    The processing of coding apparatus  101  has been described above. 
         [0093]      FIG. 7  is a block diagram illustrating a main configuration of decoding apparatus  103  in  FIG. 1 . For example, it is assumed that decoding apparatus  103  is a hierarchical decoding apparatus including three decoding hierarchies (layers). At this point, similarly to coding apparatus  101 , it is assumed that the three layers are referred to as a first layer, a second layer, and a third layer in the ascending order of the bit rate. 
         [0094]    The coded information transmitted from coding apparatus  101  through transmission line  102  is input to coded information demultiplexing section  701 , and coded information demultiplexing section  701  demultiplexes the coded information into the pieces of coded information of the layers to output each piece of coded information to the decoding section that performs the decoding processing of each piece of coded information. Specifically, coded information demultiplexing section  701  outputs the first layer coded information included in the coded information to first layer decoding section  702 , outputs the second layer coded information included in the coded information to second layer decoding section  703  and third layer decoding section  704 , and outputs the third layer coded information included in the coded information to third layer decoding section  704 . 
         [0095]    First layer decoding section  702  decodes the first layer coded information, which is input from coded information demultiplexing section  701 , by the CELP speech decoding method to generate the first layer decoded signal, and outputs the generated first layer decoded signal to adder  707 . 
         [0096]    Second layer decoding section  703  decodes the second layer coded information input from coded information demultiplexing section  701 , and outputs the obtained second layer decoded spectrum X 2 ″(k) to adder  705 . Since the processing of second layer decoding section  703  is identical to that of second layer decoding section  206 , the description is omitted. 
         [0097]    Third layer decoding section  704  decodes the third layer coded information input from coded information demultiplexing section  701 , and outputs the obtained third layer decoded spectrum X 3 ″(k) to adder  705 . The processing of third layer decoding section  704  will be described later. 
         [0098]    The second layer decoded spectrum X 2 ″(k) is input to adder  705  from second layer decoding section  703 . The third layer decoded spectrum X 3 ″(k) is input to adder  705  from third layer decoding section  704 . Adder  705  adds the input second layer decoded spectrum X 2 ″(k) and third layer decoded spectrum X 3 ″(k), and outputs the added spectrum as a first addition spectrum X 4 ″(k) to orthogonal transform processing section  706 . 
         [0099]    Orthogonal transform processing section  706  initializes built-in buffer buf′(k) to an initial value “0” by the following equation (15). 
         [0000]      [15] 
         [0000]      buf′( k )=0( k= 0, . . . , N− 1)  (Equation 15)
 
         [0100]    The first addition spectrum X 4 ″(k) is input to orthogonal transform processing section  706 , and orthogonal transform processing section  706  obtains a first addition decoded signal y″(n) according to the following equation (16). 
         [0000]    
       
         
           
             
               
                 
                   ( 
                   
                     Equation 
                      
                     
                         
                     
                      
                     16 
                   
                   ) 
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       
                         y 
                         ″ 
                       
                        
                       
                         ( 
                         n 
                         ) 
                       
                     
                     = 
                     
                       
                         2 
                         N 
                       
                        
                       
                         
                           ∑ 
                           
                             n 
                             = 
                             0 
                           
                           
                             
                               2 
                                
                               N 
                             
                             - 
                             1 
                           
                         
                          
                         
                             
                         
                          
                         
                           X 
                            
                           
                               
                           
                            
                           5 
                            
                           
                             ( 
                             k 
                             ) 
                           
                            
                           
                             cos 
                              
                             
                               [ 
                               
                                 
                                   
                                     ( 
                                     
                                       
                                         2 
                                          
                                         
                                             
                                         
                                          
                                         n 
                                       
                                       + 
                                       1 
                                       + 
                                       N 
                                     
                                     ) 
                                   
                                    
                                   
                                     ( 
                                     
                                       
                                         2 
                                          
                                         
                                             
                                         
                                          
                                         k 
                                       
                                       + 
                                       1 
                                     
                                     ) 
                                   
                                    
                                   π 
                                 
                                 
                                   4 
                                    
                                   
                                       
                                   
                                    
                                   N 
                                 
                               
                               ] 
                             
                           
                         
                       
                     
                   
                    
                   
                     
 
                   
                    
                   
                     ( 
                     
                       
                         n 
                         - 
                         0 
                       
                       , 
                       … 
                        
                       
                           
                       
                       , 
                       
                         N 
                         - 
                         1 
                       
                     
                     ) 
                   
                 
               
               
                 
                   [ 
                   16 
                   ] 
                 
               
             
           
         
       
     
         [0101]    In the equation (16), X 5 ( k ) is a vector in which the first addition spectrum X 4 ″(k) and buffer buf′(k) are coupled, and X 5 ( k ) is obtained using the following equation (17). 
         [0000]    
       
         
           
             
               
                 
                   ( 
                   
                     Equation 
                      
                     
                         
                     
                      
                     17 
                   
                   ) 
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     X 
                      
                     
                         
                     
                      
                     5 
                      
                     
                       ( 
                       k 
                       ) 
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           
                             
                               buf 
                               ′ 
                             
                              
                             
                               ( 
                               k 
                               ) 
                             
                           
                         
                         
                           
                             ( 
                             
                               
                                 k 
                                 = 
                                 0 
                               
                               , 
                               … 
                                
                               
                                   
                               
                               , 
                               
                                 N 
                                 - 
                                 1 
                               
                             
                             ) 
                           
                         
                       
                       
                         
                           
                             X 
                              
                             
                                 
                             
                              
                             
                               4 
                               ″ 
                             
                              
                             
                               ( 
                               k 
                               ) 
                             
                           
                         
                         
                           
                             ( 
                             
                               
                                 k 
                                 = 
                                 N 
                               
                               , 
                               … 
                                
                               
                                   
                               
                               , 
                               
                                 
                                   2 
                                    
                                   N 
                                 
                                 - 
                                 1 
                               
                             
                             ) 
                           
                         
                       
                     
                   
                 
               
               
                 
                   [ 
                   17 
                   ] 
                 
               
             
           
         
       
     
         [0102]    Then orthogonal transform processing section  706  updates buffer buf&#39;(k) according to the following equation (18). 
         [0000]      [18] 
         [0000]      buf′( k )= X″ 4( k )( k= 0, . . . , N− 1)  (Equation 18)
 
         [0103]    Orthogonal transform processing section  706  outputs the first addition decoded signal y″(n) to adder  707 . 
         [0104]    The first layer decoded signal is input to adder  707  from first layer decoding section  702 . The first addition decoded signal is input to adder  707  from orthogonal transform processing section  706 . Adder  707  adds the input first layer decoded signal and first addition decoded signal, and outputs the added signal as the output signal. 
         [0105]      FIG. 8  is a block diagram illustrating a main configuration of third layer decoding section  704 . 
         [0106]    In  FIG. 8 , third layer decoding section  704  includes demultiplexing section  801 , shape decoding section  402 , gain correction coefficient setting section  802 , and gain decoding section  803 . Since the structural element constituting shape decoding section  402  is identical to the above structural element, the structural element is designated by the identical numeral, and the description is omitted. 
         [0107]    Demultiplexing section  801  demultiplexes the band information, the shape coded information, and the gain coded information from the third layer coded information input from coded information demultiplexing section  701 , outputs the obtained band information to shape decoding section  402  and gain correction coefficient setting section  802 , outputs the obtained shape coded information to shape decoding section  402 , and outputs the obtained gain coded information to gain decoding section  803 . 
         [0108]    The band information is input to gain correction coefficient setting section  802  from demultiplexing section  801 . The band information is the third layer band information that is selected as the coding target by third layer coding section  208 . 
         [0109]    The second layer coded information is input to gain correction coefficient setting section  802  from coded information demultiplexing section  701 . The second layer coded information includes the second layer band information that is selected as the coding target by second layer coding section  205 . 
         [0110]    Gain correction coefficient setting section  802  sets a correction coefficient that is used to quantize the gain information with respect to the sub-bands indicated by the third layer band information from the second layer band information and the third layer band information. 
         [0111]    Specifically, in the case that the sub-band indicated by the second layer band information is not included in the sub-band indicated by the third layer band information (that is, in the case that third layer coding section  704  encodes the band that is not selected as the decoding target by second layer coding section  703 ), the gain correction coefficient γ j  is set as expressed by the equation (11). 
         [0112]    In the case that the sub-band indicated by the second layer band information is included in the sub-band indicated by the third layer band information (that is, in the case that third layer coding section  704  re-encodes the band that is not selected as the decoding target by second layer coding section  703 ), the gain correction coefficient γ j  is set as expressed by the equation (12). 
         [0113]    Gain correction coefficient setting section  802  outputs the set gain correction coefficient γ j  to gain decoding section  803 . 
         [0114]    Gain decoding section  803  obtains the gain value by performing the dequantization to the gain coded information input from demultiplexing section  801  using the built-in gain code book. Specifically, gain decoding section  803  is provided with the same gain code book as that of gain coding section  602  of third layer coding section  208 . Gain decoding section  803  performs the dequantization of the gain by utilizing the gain correction coefficient γ j  according to the following equation (19) to obtain the gain value Gain_q′. At this point, gain decoding section  803  deals with the L sub-bands in one region as the L-dimensional vector to perform the vector dequantization. 
         [0000]      [19] 
         [0000]      Gain —   q ′( j+j ″)= GC   j   G     —     min ·γ j ( j= 0, . . . , L− 1)  (Equation 19)
 
         [0115]    Then, gain decoding section  803  calculates the decoded MDCT coefficient as the third layer decoded spectrum according to the following equation (20) using the gain value obtained by the dequantization of the current frame and the value of the shape input from shape decoding section  402 . At this point, the calculated decoded MDCT coefficient is expressed by X 3 ″(k). In the case that k exists in B(j″) to B(j″+1)−1 during the dequantization of the MDCT coefficient, the gain value Gain_q′(j) takes a value of Gain_q′(j″). 
         [0000]    
       
         
           
             
               
                 
                   ( 
                   
                     Equation 
                      
                     
                         
                     
                      
                     20 
                   
                   ) 
                 
               
               
                 
                     
                 
               
             
             
               
                 
                   
                     
                       X 
                        
                       
                           
                       
                        
                       
                         3 
                         ″ 
                       
                        
                       
                         ( 
                         k 
                         ) 
                       
                     
                     = 
                     
                       
                         Gain_q 
                         ′ 
                       
                        
                       
                         
                           ( 
                           j 
                           ) 
                         
                         · 
                         
                           Shape_q 
                           ′ 
                         
                       
                        
                       
                         ( 
                         k 
                         ) 
                       
                     
                   
                    
                   
                     
 
                   
                    
                   
                     ( 
                     
                       
                         
                           
                             
                               k 
                               = 
                               
                                 B 
                                  
                                 
                                   ( 
                                   
                                     j 
                                     ″ 
                                   
                                   ) 
                                 
                               
                             
                             , 
                             … 
                              
                             
                                 
                             
                             , 
                             
                               
                                 B 
                                  
                                 
                                   ( 
                                   
                                     
                                       j 
                                       ″ 
                                     
                                     + 
                                     L 
                                   
                                   ) 
                                 
                               
                               - 
                               1 
                             
                           
                         
                       
                       
                         
                           
                             
                               j 
                               = 
                               
                                 j 
                                 ″ 
                               
                             
                             , 
                             … 
                              
                             
                                 
                             
                             , 
                             
                               
                                 j 
                                 ″ 
                               
                               + 
                               L 
                               - 
                               1 
                             
                           
                         
                       
                     
                     ) 
                   
                 
               
               
                 
                   [ 
                   20 
                   ] 
                 
               
             
           
         
       
     
         [0116]    Gain decoding section  803  outputs the calculated third layer decoded spectrum X 3 ″(k) to adder  705  according to the equation (20). 
         [0117]    The processing of third layer decoding section  704  has been described above. 
         [0118]    The processing of decoding apparatus  103  has been described above. 
         [0119]    According to the invention, in coding apparatus  101  that performs the hierarchy coding (scalable coding) in which the band (quantization target band) of the coding target is selected in each hierarchy (layer), third layer coding section  208  switches the method of quantizing the gain information (energy information) on the quantization target band in the current layer based on the comparison result of the quantization target band in the lower layer and the quantization target band in the current layer. 
         [0120]    In the case that the sub-band indicated by the third layer band information that is of the current layer in third layer coding section  208  includes the sub-band indicated by the second layer band information in the lower layer, gain coding section  602  performs the quantization after performing the correction such that the ideal gain Gain_i(j) is increased. As a result, even if the vector quantization is performed to the plural elements in which energy magnitude differs largely from each other, energy magnitude of the elements of the gain code vector can be smoothed. Therefore, using the same gain code book, the vector quantization can efficiently be performed to the pieces of gain information on the plural sub-bands including the sub-band that is selected and quantized in the lower layer and the sub-band that is not selected and quantized in the lower layer, and thus the quality of the decoded signal can be improved. 
         [0121]    In gain correction coefficient setting section of Embodiment, by way of example, γ j  is set to 0.5 for the sub-band that is selected in the lower layer, and γ j  is set to 1.0 for the sub-band that is not selected in the lower layer. However, the invention can also be applied to other setting values. 
         [0122]    The method of setting the gain correction coefficient is not limited to the above setting method, but the gain correction coefficient may be set by statistically calculating the gain correction coefficient using many input samples. 
         [0123]    In Embodiment, the ideal gain is divided by the gain correction coefficient to smooth the energy, and the vector quantization is performed to the smoothed value. However, the invention is not limited to this Embodiment. For example, the invention can also be applied to a configuration in which the gain correction coefficient is multiplied by each gain code vector in the searched gain code book. However, in the configuration of Embodiment, since the number of calculation times in which the gain correction coefficient is utilized is decreased compared with the above configuration, the quality can be improved while the calculation amount is not increased too much. 
         [0124]    In the method of Embodiment, the gain values of the vectors are equalized by increasing the gain value of the sub-band that is quantized in the lower layer. Alternatively, contrary to the method of Embodiment, the gain values of the vectors may be equalized by decreasing the gain value of the sub-band that is not quantized in the lower layer. 
         [0125]    In the configuration of Embodiment, the gain code vector in which the square error is minimized is searched with respect to the value in which the ideal gain is divided by the gain correction coefficient, and the gain value is encoded. Additionally, the invention can also be applied to the case that the square error is calculated based on the magnitude of the gain correction coefficient. A specific method will be described below. For example, in the case that the gain correction coefficient has the value of 0.5, a value divided by the gain correction coefficient becomes double the original gain value. Therefore, the calculation is performed to the corresponding sub-band while the value of the square error is multiplied by 0.5. A distance (error) can be calculated in the distribution before the correction is performed using the gain correction coefficient, and therefore the quality of the decoded signal can be improved. 
         [0126]    In Embodiment, the CELP coding method is adopted in the first layer coding section by way of example. The invention is not limited to Embodiment, but the invention can also be applied to the case that the first layer coding section does not exist. The invention can also be applied to a configuration in which the first layer coding section encodes the frequency component similarly to the second layer coding section. 
         [0127]    The invention can also be applied to a configuration in which, similarly to the second layer coding section, the first layer coding section does not encodes the whole band, but partially selects and encodes the band that becomes the coding target. In this case, since the first layer coding section does not quantize the frequency components of the whole bands, the configuration in which the method of quantizing the gain component (energy component) is switched similarly to the third layer coding section as explained in Embodiment can be applied to the second layer coding section. In the case that the configuration is applied to the second layer coding section, the same gain correction coefficient may be used in the coding section of each layer, or the different gain correction coefficients may be used in the coding section of the layers. 
         [0128]    In each band, the different gain correction coefficient can be set according to the number of times in which the band is selected as the quantization target band in the lower layer. In this case, the gain correction coefficient may also be set by statistically calculating the gain correction coefficient using many input samples. 
         [0129]    As to the decoding apparatus, the invention can also be applied to each configuration equivalent to the configuration of the coding apparatus. 
         [0130]    In Embodiment, the coding apparatus is configured to include the three coding hierarchies (three layers). The invention is not limited to the three coding hierarchies, but the invention can also be applied to the configuration other than the configuration having the three coding hierarchies. 
         [0131]    In Embodiment, the CELP coding/decoding method is adopted in the lowest first layer coding section/decoding section. The invention is not limited to Embodiment, but the invention can also be applied to the case that the layer in which the CELP coding/decoding method is adopted does not exist. For example, the adder that performs the addition and subtraction on the temporal axis in the coding apparatus and the decoding apparatus is eliminated for the configuration including the layers in each of which the frequency transform coding/decoding method is adopted. 
         [0132]    In Embodiment, the coding apparatus calculates the difference signal between the first layer decoded signal and the input signal, and performs the orthogonal transform processing to calculate the difference spectrum. However, the invention is not limited to Embodiment. Alternatively, the present invention can also be applied to the configuration that after the orthogonal transform processing may be performed to the input signal and the first layer decoded signal to calculate the input spectrum and the first layer decoded spectrum, the difference spectrum may be calculated. 
         [0133]    In Embodiment, the decoding apparatus performs the processing using the coded information transmitted from the coding apparatus of Embodiment. Alternatively, as long as the coded information includes the necessary parameter and data, the processing can be performed with no use of the coded information transmitted from the coding apparatus of Embodiment. 
         [0134]    In addition, the present invention is also applicable to cases where this signal processing program is recorded and written on a machine-readable recording medium such as memory, disk, tape, CD, or DVD, achieving behavior and effects similar to those of the present embodiment. 
         [0135]    Also, although cases have been described with Embodiment as an example where the present invention is configured by hardware, the present invention can also be realized by software. 
         [0136]    Each function block employed in the description of Embodiment may typically be implemented as an LSI constituted by an integrated circuit. These may be implemented individually as single chips, or a single chip may incorporate some or all of them. Here, the term LSI has been used, but the terms IC, system LSI, super LSI, and ultra LSI may also be used according to differences in the degree of integration. 
         [0137]    Further, the method of circuit integration is not limited to LSI, and implementation using dedicated circuitry or general purpose processors is also possible. After LSI manufacture, utilization of an FPGA (Field Programmable Gate Array) or a reconfigurable processor where connections and settings of circuit cells in an LSI can be reconfigured is also possible. 
         [0138]    Further, if integrated circuit technology comes out to replace LSI as a result of the advancement of semiconductor technology or a derivative other technology, it is naturally also possible to carry out function block integration using this technology. Application of biotechnology is also possible. 
         [0139]    The present invention contains the disclosures of the specification, the drawings, and the abstract of Japanese Patent Application No. 2009-237684 filed on Oct. 14, 2009, the entire contents of which being incorporated herein by reference. 
       INDUSTRIAL APPLICABILITY 
       [0140]    The coding apparatus, decoding apparatus, and methods thereof according to the present invention can improve the quality of the decoded signal in the configuration in which the coding target band is selected in the hierarchical manner to perform the coding/decoding. For example, the coding apparatus, decoding apparatus, and methods thereof according to the present can be applied to the packet communication system and the mobile communication system. 
       REFERENCE SIGNS LIST 
       [0000]    
       
           101  Coding apparatus 
           102  Transmission line 
           103  Decoding apparatus 
           201  First layer coding section 
           202 , 702  First layer decoding section 
           203 , 207 , 705 , 707  Adder 
           204 ,  706  Orthogonal transform processing section 
           205  Second layer coding section 
           206 , 703  Second layer decoding section 
           208  Third layer coding section 
           209  Coded information integration section 
           301  Band selecting section 
           302  Shape coding section 
           303 , 602  Gain coding section 
           304  Multiplexing section 
           401 , 801  Demultiplexing section 
           402  Shape decoding section 
           403 , 803  Gain decoding section 
           601 , 802  Gain correction coefficient setting section 
           701  Coded information demultiplexing section 
           704  Third layer decoding section