Classifications

• • G—PHYSICS
  • G10—MUSICAL INSTRUMENTS; ACOUSTICS
  • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
  • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
  • G10L19/02—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using spectral analysis, e.g. transform vocoders or subband vocoders
• • G—PHYSICS
  • G10—MUSICAL INSTRUMENTS; ACOUSTICS
  • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
  • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
  • G10L19/02—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using spectral analysis, e.g. transform vocoders or subband vocoders
  • G10L19/032—Quantisation or dequantisation of spectral components
• • G—PHYSICS
  • G10—MUSICAL INSTRUMENTS; ACOUSTICS
  • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
  • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
  • G10L19/04—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using predictive techniques
  • G10L19/16—Vocoder architecture
  • G10L19/18—Vocoders using multiple modes
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
  • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
  • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
  • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N7/00—Television systems
  • H04N7/24—Systems for the transmission of television signals using pulse code modulation

Definitions

• the present invention relates to an encoding method and an apparatus, a decoding method and an apparatus, and a program and a recording medium, and particularly to digital data such as an audio signal and an audio signal.
• the present invention relates to a program to be executed by a computer and a computer-readable recording medium on which such a program is recorded.
• the audio signal on the time axis is divided into a plurality of frequency bands and encoded without being blocked.
• a signal on the time axis is converted into a signal on the frequency axis (spectral conversion) and divided into a plurality of frequency bands, that is, coefficients obtained by spectrum conversion are obtained. Encoding is performed for each band, collectively for each predetermined frequency band.
• a method of high-efficiency coding that combines the non-blocking frequency band division method and the block frequency band division method described above.
• a law has also been proposed. According to this method, for example, after band division is performed by band division coding, a signal of each band is spectrally transformed into a signal on a frequency axis, and a code is produced for each band after the spectrum transformation. Is performed.
• QMF Quadrature Mirror Filter
• PQF Polyphase Quadrature Filter
• the input audio signal is broken down into frames of a predetermined unit time, and discrete Fourier transform (DFT), discrete cosine transform (Discrete Cosine Transformation) is performed for each block.
• DFT discrete Fourier transform
• Discrete Cosine Transformation discrete Cosine Transformation
• M DCT Modified Discrete Cosine Transformation
• MDCT The details of MDCT are described in CASSP 1987, Subband / Transform Coding Usage Filter Bank Designs Based on Time Domain Aliasing Cancellation, JPP incen, ABBradley, Univ. Of Surrey Royal Melbourne Inst, of Tech.j, etc. Has been described.
• each frequency band when performing band division is determined in consideration of, for example, human auditory characteristics. That is, in general, for example, the critical band
• An audio signal may be divided into multiple (eg, 32 bands) bands, called bandwidths that are wider at higher frequencies.
• a predetermined bit allocation is performed for each band, or adaptive bit allocation (bit allocation) is performed for each band. That is, for example, when the coefficient data obtained by the MDCT processing is encoded by bit allocation, the MDCT coefficient data of each band obtained by performing the MDCT processing on the signal for each block is calculated as follows. The number of bits is adaptively allocated and coding is performed.
• bit allocation method for example, a method of performing bit allocation based on the signal magnitude of each band (hereinafter, appropriately referred to as a first bit allocation method) or an auditory masking method is used.
• a method of obtaining a required signal-to-noise ratio for each band and performing fixed bit allocation hereinafter, appropriately referred to as a second bit allocation method and the like are known.
• the first bit allocation method is described in, for example, ⁇ Adaptive Transform Coding of Speech Signals, R. Zelinski and P. Nol, IEEE Transactions of Accou ties, Speech and Signal Processing, vol. 25, No., August 1977 ”and the like.
• the quantization noise spectrum becomes flat and the noise energy is minimized.
• the masking effect is not used for the auditory sense, the actual auditory noise is not optimal.
• the characteristic value is not so large because the bit allocation is fixed. Not a good value.
• DFT or DCT When DFT or DCT is used as a method of converting a waveform signal into a spectrum, if a conversion is performed using a time cycle consisting of M samples, M independent real number data can be obtained. However, in order to reduce the connection distortion between time blocks (frames), usually, one pro- gram is configured to overlap each of the neighboring pro- Waits by a predetermined number M1 of samples. In an encoding method using DCT, M real data is quantized and encoded for an average of (M-Ml) samples.
• the decoding device adds the waveform elements obtained by performing the inverse transform in each pro and the sock while interfering with each other from the code obtained by using the MDCT as described above, thereby obtaining a waveform signal. Is reconstructed.
• quantization accuracy information which is information indicating a quantization step when performing quantization
• each signal component are normalized.
• a normalization coefficient which is information representing the coefficient used in the above, is encoded with a predetermined number of bits, and then the normalized and quantized vector signal is encoded.
• 1993 '' describes a high-efficiency coding method in which the number of bits representing quantization accuracy information is set differently depending on the band. According to this, standardization is performed such that the number of bits representing quantization accuracy information becomes smaller as the frequency band becomes higher.
• a method of encoding a spectrum signal using a variable length code such as a Huffman code is known.
• the Huffman code is described in, for example, r Davia A. Huffman, "A Method for the Construction of Minimum-Redundancy Codes", Proceedings of the I.RE, ppl098-1101, Sep. 1952. Details are provided.
• the number of bits for coding the spectrum information is 16 bits (48 bits). (Toe 32 bits) will be reduced.
• the compression ratio increases by 16 bits or more due to the increase in the number of code string tables, but if it does not increase, the overall compression ratio will decrease. .
• the present invention has been proposed in view of such a conventional situation, and an optimal code string table according to the signal characteristics for various input signals is obtained without reducing the compression ratio.
• a selectable encoding method and apparatus a decoding method and apparatus for receiving or reproducing and decoding encoded data
• a recording medium capable of performing encoding or decoding processing on a computer. The purpose is to do.
• the encoding method and apparatus when encoding a digital signal using one code string table for each predetermined unit, divide the digital signal into a plurality of groups in advance. One group is selected from the obtained code sequence table group according to the characteristics of the digital signal, and one code sequence table is determined from the code sequence table group of the selected group. The digital signal is encoded using a column table.
• the group when selecting one code string table group, the group can be selected according to, for example, the tonality of the digital signal.
• the encoding method and apparatus when encoding a digital signal using one code sequence table for each predetermined unit, select a code sequence included in a code sequence table group.
• the number of possible code sequence tables is set, one of the code sequence tables is selected from the code sequence table group, and the digital signal is encoded using the selected code sequence table.
• the decoding method and apparatus provide the following in order to achieve the above object.
• one group to be used is selected from a code string table group previously divided into a plurality of groups, and the selected group is selected.
• One code string table to be used is determined from among the code string tables, and the digital signal is decoded using the determined code string table.
• the same group as the group selected in accordance with the tonality of the digital signal is selected at the time of encoding ( decoding method and decoding method according to the present invention).
• the apparatus sets the number of code string tables included in the code string table group when decoding a digital signal encoded using one code string table for each predetermined unit in order to achieve the above-described object.
• One of the above code string tables is selected from the code string table group, and the digitized signal is decoded based on the selected code string table.
• a program according to the present invention causes the above-described encoding processing or decoding processing to be executed at a convenient time
• a recording medium according to the present invention includes a computer-readable recording medium storing such a program. It is.
• FIG. 1A and FIG. 1B are diagrams for explaining an example of the spectrum.
• FIG. 1A shows a tonic signal
• FIG. 1B shows a noise signal.
• FIG. 2 is a diagram for describing an example of encoding a tone characteristic spectrum.
• FIG. 3 is a diagram illustrating an example of encoding a noise spectrum.
• FIG. 4 is a diagram for explaining a specific example of the number of coded bits of the index and the spectrum of the conventional code string table.
• FIG. 5 is a diagram illustrating a specific example of the index of the code string table and the number of coded bits of the spectrum according to the present embodiment.
• FIG. 6 is a diagram illustrating an example of the ratio of selection probabilities in each code string table.
• FIG. 6 is a diagram illustrating a specific example of an index of a code string table and the number of coded bits of a spectrum in the present invention.
• Fig. 8 shows a specific example of the index of the code table and the number of coded bits of the spectrum when Huffman coding is applied to the coding of the index of the code table, with the number of code tables being four.
• FIG. 9 is a diagram illustrating a schematic configuration of the encoding device according to the present embodiment.
• FIG. 10 is a diagram illustrating a schematic configuration of a decoding device according to the present embodiment.
• BEST MODE FOR CARRYING OUT THE INVENTION an encoding method and apparatus for transmitting the present invention by encoding digital data such as an audio signal with high efficiency, or recording on a recording medium, and receiving encoded data;
• the present invention is applied to a decoding method for reproducing and decoding and an apparatus thereof.
• the principle of the present invention will be described, and then, a configuration example of an encoding device and a decoding device to which the present invention is applied will be described.
• audio signals can be broadly divided into two patterns, tone and noise.
• FIGS. 1A and 1B show the spectrum of the tone signal and the noise signal.
• the frequency-converted signal that is, the spectrum shape is significantly different between the tone signal and the noise signal, the appearance probability of the value of the quantization coefficient is obtained.
• the appearance probability of the value of the quantization coefficient is obtained.
• Tables 1 and 2 below show examples of Huffman code string tables for tone signals and noise signals.
• the range of the value of the quantization coefficient is 3 to +3
• FIG. 2 shows a specific example in the case of encoding a tone signal spectrum using the code string tables shown in Tables 1 and 2.
• the values of the quantization coefficients are 0, 0, 3, 1, 2, 0, 0, 0 in this order.
• the code length is 1, 1, 4, 4, 1, 1, 1: 1 in order, and the total is 14 bits.
• the code length is 2, 2, 3, 3, 2, 2, 2, 2, 2 in order, and the total is It becomes 18 bits. That is, the tone signal In the case of a spectrum, it is possible to encode with a smaller number of bits by, for example, 4 bits by using a code sequence table for a tone signal than using a code table for a noise signal. Becomes
• FIG. 3 shows a specific example in which the noise signal spectrum is encoded using the code string tables shown in Tables 1 and 2.
• the values of the quantized coefficients are 3, 3, 11, 12, --3, --2, 3, 2 in this order.
• the code lengths are 4, 4, 3, 4, 4, 4, 4, 4, in that order, and the total is 31 bits.
• the code sequence table for the noisy signal shown in Table 2 is used, the code length is 3, 3, 3, 3, 3, 3, 3, 3, 3, 3 in order, and the total is 24 bits.
• the number of bits is reduced by, for example, 7 bits by using the code table for the noise signal as compared with the case of using the code table for the tone signal. It is possible to encode with.
• the Huffman code sequence table for encoding the S-child coefficient is not used for any signal, but for the characteristics of the input signal, for example, whether it is tonal or noise.
• a high compression ratio can be realized by preparing and using optimized ones depending on whether there is any.
• tone property and the noise property are mixed minutely for each band. In most cases, tone and noise are interchanged.
• both a group of the code sequence table for the tone signal and a group of the code sequence table for the noise signal are prepared, and they are switched according to the properties of the input signal.
• the coding efficiency is improved. For example, consider the case where the number of quantization units is 16.
• the code string table is not switched, if the number of code string tables is 8, the number of bits for coding the index of the code string table is 48 bits (3 ⁇ 16).
• the number of bits to be switched is 1 bit, and the coding bit in the code table is The total number of bits is 48 bits, for a total of 49 bits. This is one bit more than when the code string table is not switched.
• the code string table is divided into two sets, one for a tone signal and the other for a noise signal, as in the present embodiment, and a case where a conventional code string table is used. Compare the number of coded bits, etc., when using only one of them.
• Fig. 4 shows the number of coded bits when a conventional code string table is used.
• the index of the code table is selected from 8 (3 bits) from 0 to 7, and the number of bits of the spectrum encoded using the code table is calculated. It is shown.
• each code string table is represented by 3 bits and the number of quantization units is 16, so that the total number of bits in the code string table is 48 bits. Also, the number of encoded bits in the spectrum is 663 bits. Therefore, the total number of these bits is 711 bits.
• the code string table is divided into two sets, a group for a tone signal and a group for a noise signal, and coding bits when only one of them is selected and used.
• Figure 5 shows the numbers. It is assumed that eight code string tables are prepared for each of the tone signal and the noise signal. Since the index of the code string table is represented by three bits from 0 to 7, the total is 48 bits, but one bit is used to switch the set of the code string table depending on tone and noise. Therefore, the number of coding bits in the code string table is 49 bits in total. Also, when encoding is performed using a code sequence table for a tone signal, the number of coding bits of the spectrum is 640 bits, and coding is performed using a code sequence table for a noise signal.
• the number of coding bits of the spectrum is 682 bits. Therefore, in the case of this example, the spectrum can be more efficiently compressed by using the code sequence table for the tone signal.
• the total number of these bits is 689 bits, which is 22 bits less than the example in FIG. By redistributing these 22 bits to the spectrum, it is possible to further improve the sound quality.
• the probability that each code string table is actually selected depends on how to learn the code string table, but is generally not uniformly distributed and often has some bias. Therefore, by using variable length coding adapted to the bias, it is possible to efficiently code the index of the code string table.
• Fig. 6 shows an example of the selection probabilities of each code string table. As is evident from FIG. 6, the selection probabilities of each symbol 3 ⁇ 4; -column table are biased. Table 3 below shows the variable-length codes created to optimize the index coding efficiency from this bias. Note that the code string table shown in Table 3 is optimized for a tone signal. Table 3
• FIG. 7 shows an example in which the variable length codes in Table 3 are applied to the specific example in FIG.
• the number of bits in the code string table index is 40 bits by applying the variable length code to the code string table index, which is 8 bits compared to the case of FIG. I need less. By redistributing these 8 bits to spectrum coding, it is possible to further improve sound quality.
• the encoding speed is increased by reducing the number of code string tables actually used for encoding. Can be manifested. It is to be noted that, instead of simply reducing the number of code string tables, using only a code string table having a high selection probability makes it possible to suppress a decrease in coding efficiency.
• Such a setting may be performed by a user of the encoder, or may be performed on the encoder side by determining a state of an encoding resource or a processing speed.
• the number of code table is four
• the number of coding bits for coding the index of the code table is smaller than that in the case of eight.
• Table 4 below shows an example of the Huffman code string table for the code string table index when the number of code string tables is four.
• FIG. 8 shows an example in which the variable length codes in Table 4 are applied to the specific example in FIG. Since the number of code string tables becomes four, the quantization units 3, 5, 6, and 8 cannot select a code string table that encodes a spectrum with the least number of bits. The number of coded bits has increased slightly. However, as described above, four code string tables are used in the descending order of selection probability, and the four code tables cover about 80% of the pattern in the graph of FIG. It occurs only in about 20% of the cases.
• the number of code strings in the code table itself is decreasing, it can be expected that the number of bits for coding the index of the code string table can be reduced.
• the number of coding bits of the code string table index is 30 bits, which is 10 bits smaller than that of FIG. Note that, in the above specific example, when the number of code string tables used for encoding is changed from eight to four, for example, it is described that four are selected in descending order of selection probability, but the present invention is not limited to this. Instead, which code string table to select may be set in advance on the encoding side and the decoding side.
• encoding apparatus 10 includes a spectrum conversion unit 11, a code sequence 3 ⁇ 4 group switching determination unit 12, a normalization unit 13, and B: It is composed of a decision unit 14, a quantization unit 15, a code string table index encoding unit 16, a code string table number switching determination unit 1 ⁇ , and a multiplexer 18.
• the spectrum converter 11 receives an audio signal D 10 to be encoded, and performs spectrum conversion such as MDCT (Modified Discrete Cosine Transformation) on the audio signal D 10.
• the signal on the time axis is converted into the spectrum signal D11 on the frequency axis.
• the spectrum conversion section 11 converts the vector signal D 11 into a code string table group switching determination section 12, a normalization section 13, and a quantization precision determination for each predetermined time block (frame).
• the code string table group switching determination unit 12 is configured to select one group from a plurality of code string table groups according to the property of the vector signal D 11 supplied from the spectrum conversion unit 11, for example, the tonality. And a group index D 12 indicating the group is supplied to the quantization unit 15 and the multiplexer 18.
• the code string table group switching determination unit 12 checks the tonality of the spectrum signal D 11 and determines the tonality. If is larger than a predetermined threshold value, the code string table for toned signals is selected, and if smaller than the threshold value, the code string table for noise signals is selected. Then, the code string table group switching determination unit 12 supplies the group index D12 indicating the selected group to the quantization unit 15 and the multiplexer 18 as, for example, 1-bit information for each channel. It should be noted that the tone property / noise property may be determined independently for each of the divided frequency bands, and 1-bit information may be transmitted as the group index D 12 for each band.
• the normalizing unit 13 calculates the absolute value of each signal component constituting the spectrum signal D 11 The dogs are extracted and the coefficient corresponding to this value is used as the normalization coefficient. Then, the normalizing unit 13 normalizes (divides) each signal component constituting the spectrum signal D 11 by a value corresponding to the normalization coefficient. Therefore, in this case, the normalized data D 13 obtained by normalization has a value in the range of 1.0 to 1.0.
• the normalization unit 13 supplies the normalized data D 13 to the quantization unit 15 and supplies the normalization coefficient D 14 to the multiplexer 18. Note that the normalization unit 13 may perform predetermined encoding on the normalization coefficient D 14 as necessary, and then supply the result to the multiplexer 18.
• the quantization accuracy determination unit 14 performs quantization when the normalized data D 13 is quantized based on the spectrum signal D 11 supplied from the spectrum conversion unit 11. Determine the steps. Then, the quantization accuracy determination unit 14 supplies the quantization accuracy information D15 corresponding to the quantization step to the quantization unit 15 and the multiplexer 18. Note that the quantization accuracy determination unit 14 may perform predetermined encoding on the quantization accuracy information D15 as necessary, and then supply the resultant to the multiplexer 18.
• the quantization unit 15 quantizes the normalized data D 13 in a quantization step corresponding to the quantization accuracy information D 15 supplied from the quantization accuracy determination unit 14. Then, based on the group index D 12 supplied from the code sequence table group switching determination unit 12, the quantization unit 15 encodes the M child coefficients using the code sequence table of the selected group. I do. Specifically, coding is actually performed using the code string table included in the selected group, and the code string table with the smallest number of required bits is determined as the code string table to be used for coding. The quantization unit 15 supplies the determined code sequence table index D 16 to the code sequence table index encoding unit 16, and supplies the encoded coefficient data D 17 to the multiplexer 18.
• the code sequence table index encoding unit 16 encodes the code sequence table index D 16 supplied from the quantization unit 15 and supplies the encoded code sequence table index D 18 to the multiplexer 18.
• the code string table index encoding unit 16 generates the code of the code string table index.
• the decoding bit number information Dl9 is supplied to the quantization unit 15. As a result, the quantization unit 15 can redistribute the number of bits obtained by the index coding to the spectrum.
• the code string table number switch determination unit 17 switches the number of code string tables to be used among the code string tables included in the code string table group, and sets the code string table number index D 21 for each frame or bit stream.
• the information is supplied to the quantizer 15, the code string table index encoder 16 and the multiplexer 18 as 1-bit information. That is, as described above, when the resources to be applied to the encoder are small and the sound quality has to be somewhat sacrificed in order to realize a practical encoding speed, etc., the code sequence table actually used for encoding is used. By reducing the number, it is possible to increase the encoding speed.
• the switching operation of the code string table to be used may be performed based on a predetermined setting signal D 20 supplied from the outside according to the judgment of the user or the device itself, or another method may be used. .
• the code string table number switch determination unit 17 converts the 1-bit code string table number index D 21 into the quantization unit 15, It is supplied to the code string table index coding unit 16 and the multiplexer 18.
• the quantization unit 15 actually performs encoding using four predetermined code sequence tables out of the eight code sequence tables, and uses the code sequence table with the smallest number of required bits for encoding. Determined as a column table.
• the quantization unit 15 supplies the determined code string table index D 16 to the code string table index coding unit 16.
• the code sequence table index coding unit 16 reassigns the index of the code sequence table of the predetermined four code sequence tables, and corresponds to the code sequence table index D 16 supplied from the quantization unit 15. Encode a new index.
• the multiplexer 18 converts the coefficient data D 17 supplied from the quantization unit 15 into a group index D 12, a normalization coefficient D 14, quantization accuracy information D 15, and a code string table index D. 18 and multiplexed with the code string table index D 21.
• the multiplexer 18 transmits the encoded data D22 obtained as a result of the multiplexing via a transmission path, or records the encoded data D22 on a recording medium (not shown).
• the code string table group switching determination unit 12 uses the spectrum signal D 11 The tonality of 1 was examined, and it was explained that one of the code sequence table for the tone signal and the code sequence for the noise signal was selected.However, the present invention is not limited to this. It is also possible to calculate the required number of bits by actually performing encoding in the column table and select the group with the smaller number of bits.
• the decoding device 30 in the present embodiment includes a demultiplexer 31, a code string table index decoding unit 32, an inverse quantization unit 33, an inverse normalization unit 34, It is composed of a spectrum inverse transform unit 35.
• the demultiplexer 31 decodes the input coded data D 30, and decodes the coefficient data D 31, the S child accuracy information D 32, the normalization coefficient D 33, the group index D 34, and the code string table index.
• D 3 5 and c and the demultiplexer 3 1 separates the code sequence table number Indedzukusu D 3 6, as well as supplies the coefficient data D 3 1 Conversely g Coca 3 3, quantization accuracy information D 3 2 and normalization
• the coefficient D33 is decoded as necessary and supplied to the inverse quantization unit 33 and the inverse normalization unit 34, respectively.
• the demultiplexer 31 supplies the group index D34 and the code string table index D35 to the inverse quantization unit 33 and the code string table index decoding unit 32, respectively.
• the demultiplexer 31 supplies the code sequence table index D36 to the code sequence table index decoding unit 32 and the inverse quantization unit 33.
• the code sequence table index decoding unit 32 decodes the code sequence table index D 35 based on the code sequence table index D 36, and supplies the decoded index D 37 to the inverse quantization unit 33.
• the inverse quantization unit 33 determines a code sequence table to be used based on the group index D 34, the code sequence table number index D 36 and the index D 37 supplied from the code sequence table index decoding unit 32, and Decode the coefficient data D 31 in the column table. Then, the inverse quantization unit 33 inversely quantizes the obtained quantization coefficient in a quantization step corresponding to the quantization accuracy information D 32 supplied from the demultiplexer 31, and outputs the normalized data D 3 Generate 8.
• the inverse quantization unit 33 supplies the normalized data D 38 to the inverse normalization unit 34.
• the denormalization unit 34 multiplies the normalized data D 38 by multiplying the normalized data D 38 by the value corresponding to the normalization coefficient D 33 supplied from the demultiplexer 31.
• the decoded and obtained spectrum signal D39 is supplied to the spectrum inverse conversion unit 35.
• the spectrum inverse transform section 35 is 1] ⁇ with respect to the spectrum signal D39 supplied from the inverse normalization section 34. .
• Ding Inverse Modified Di screte Cos ine Transformation
• Gyakusupeku torr transform such as, thereby, as described above c to restore the original audio signal D 4 0, the coding apparatus 1 0 of the present embodiment Selects one group from a plurality of code string table groups according to the nature of the spectrum signal D11, for example, tonality, and encodes the quantization coefficient using the code string table included in the group .
• the encoding apparatus 10 has a small number of resources to be applied to the encoder, and when it is necessary to sacrifice some sound quality in order to realize a practical encoding speed, for example, the encoding apparatus 10 uses a code sequence table that is actually used for encoding. By reducing the number, the speed of the encoding speed can be increased.
• decoding apparatus 30 in the present embodiment performs encoding based on group index D 34, code sequence table index D 35, and code sequence table number index D 36 included in encoded data D 30. By selecting the code string table corresponding to the side, the coefficient data D 31 can be decoded.
• the hardware configuration has been described.
• the present invention is not limited to this. Any processing may be implemented by causing a CPU (Central Processing Unit) to execute a computer program.
• the program may be recorded on a recording medium and provided, or may be provided by being transmitted via the Internet or other transmission media.

Landscapes

• Engineering & Computer Science (AREA)
• Physics & Mathematics (AREA)
• Multimedia (AREA)
• Signal Processing (AREA)
• Health & Medical Sciences (AREA)
• Computational Linguistics (AREA)
• Spectroscopy & Molecular Physics (AREA)
• Audiology, Speech & Language Pathology (AREA)
• Human Computer Interaction (AREA)
• Acoustics & Sound (AREA)
• Theoretical Computer Science (AREA)
• Compression, Expansion, Code Conversion, And Decoders (AREA)
• Compression Or Coding Systems Of Tv Signals (AREA)

Priority Applications (3)

Applications Claiming Priority (2)

Publications (1)

Family

ID=29416631

Family Applications (1)

Country Status (6)

Families Citing this family (18)

Citations (6)

Family Cites Families (13)

• 2002
  • 2002-05-07 JP JP2002132189A patent/JP3900000B2/ja not_active Expired - Fee Related
• 2003
  • 2003-04-30 CN CNB038006219A patent/CN100355210C/zh not_active Expired - Fee Related
  • 2003-04-30 US US10/483,105 patent/US6930618B2/en not_active Expired - Lifetime
  • 2003-04-30 WO PCT/JP2003/005546 patent/WO2003096545A1/ja not_active Ceased
  • 2003-04-30 KR KR20047000176A patent/KR100968057B1/ko not_active Expired - Fee Related
  • 2003-04-30 EP EP20030725719 patent/EP1503502B1/en not_active Expired - Lifetime

Patent Citations (6)

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events