Abstract: Efficient assignment of bit numbers is performed even under a low bit rate condition. A quantizer 12 obtains a quantized spectral sequence from a frequency spectral sequence. An integer transformer 13 obtains a unified quantized spectral sequence by obtaining, by a bijective transformation, a transformed integer for each of the sets, each being made up of integer values, obtained from the quantized spectral sequence. An integer encoder 15 obtains an integer code by encoding the unified quantized spectral sequence using a bit assignment sequence. An object-to-be-encoded estimator 18 obtains an estimated unified spectral sequence from the frequency spectral sequence by a transformation which is performed by the integer transformer 13 or a transformation that approximates the magnitude relationship between values before and after the above transformation. A bit assigner 14 obtains a bit assignment sequence and a bit assignment code from the estimated unified spectral sequence.

Abstract: A decoding apparatus includes: a bandwidth extending part 25 obtaining a decoded extended frequency spectrum sequence by arranging samples based on K samples included in a frequency-domain sample sequence obtained by decoding, on a higher side than the frequency-domain sample sequence; and a fricative sound adjustment releasing part 23 obtaining, if inputted information indicating whether a hissing sound or not indicates being a hissing sound, what is obtained by exchanging all or a part of a low-side frequency sample sequence existing on a lower side than a predetermined frequency in the decoded extended frequency spectrum sequence for all or a part of a high-side frequency sample sequence existing on a higher side than the predetermined frequency in the decoded extended frequency spectrum sequence as an adjusted frequency spectrum sequence, the number of all or the part of the high-side frequency spectrum sequence being the same as the number of all or the part of the low-side frequency spectrum sequence.

Abstract: A pitch enhancement apparatus obtains an output signal by performing, for each time segment, pitch enhancement processing on a signal derived from an input audio signal. The pitch enhancement apparatus includes a pitch enhancement unit that performs, as the pitch enhancement processing, for each time segment, processing to obtain, as an output signal at each time of the time segment, a signal including the signal at the time, a first signal for enhancement that is the signal at a time which is an earlier time than the time by the number of samples T0 corresponding to a pitch period of the time segment, and a second signal for enhancement that is the signal at a time which is an earlier time than the time by the number of samples T?? corresponding to a pitch period of the ?-th time segment previous to the time segment.

Abstract: An encoding/decoding technique is provided with which encoding can be performed using a small average number of bits even for a sequence of integer values including small non-zero values and having a distribution heavily biased toward small values. The present invention includes an integer encoding part 110 that, with respect to an inputted sequence of non-negative integer values x_n, n?{1, 2, . . . , N} (hereinafter referred to as an “integer sequence”), obtains a 1-bit code as a code corresponding to a run of integer values 0 of length L, a predetermined number which satisfies 2?L?2K?1, which is included in the integer sequence and obtains a (K×x_n)-bit or (K×x_n+1)-bit code as a code corresponding to a set of a run of integer values 0 of length from 0 to L?1 and one non-zero integer value x_n included in the integer sequence, where K is assumed to be an integer equal to or larger than 2.

Abstract: A technology of accurately coding and decoding coefficients which are convertible into linear prediction coefficients even for a frame in which the spectrum variation is great while suppressing an increase in the code amount as a whole is provided. A coding device includes: a first coding unit that obtains a first code by coding coefficients which are convertible into linear prediction coefficients of more than one order; and a second coding unit that obtains a second code by coding at least quantization errors of the first coding unit if (A?1) an index Q commensurate with how high the peak-to-valley height of a spectral envelope is, the spectral envelope corresponding to the coefficients which are convertible into the linear prediction coefficients of more than one order, is larger than or equal to a predetermined threshold value Th1 and/or (B?1) an index Q? commensurate with how short the peak-to-valley height of the spectral envelope is, is smaller than or equal to a predetermined threshold value Th1?.

Abstract: An envelope sequence is provided that can improve approximation accuracy near peaks caused by the pitch period of an audio signal. A periodic-combined-envelope-sequence generation device according to the present invention takes, as an input audio signal, a time-domain audio digital signal in each frame, which is a predetermined time segment, and generates a periodic combined envelope sequence as an envelope sequence. The periodic-combined-envelope-sequence generation device according to the present invention comprises at least a spectral-envelope-sequence calculating part and a periodic-combined-envelope generating part. The spectral-envelope-sequence calculating part calculates a spectral envelope sequence of the input audio signal on the basis of time-domain linear prediction of the input audio signal.

Abstract: An envelope sequence is provided that can improve approximation accuracy near peaks caused by the pitch period of an audio signal. A periodic-combined-envelope-sequence generation device according to the present invention takes, as an input audio signal, a time-domain audio digital signal in each frame, which is a predetermined time segment, and generates a periodic combined envelope sequence as an envelope sequence. The periodic-combined-envelope-sequence generation device according to the present invention comprises at least a spectral-envelope-sequence calculating part and a periodic-combined-envelope generating part. The spectral-envelope-sequence calculating part calculates a spectral envelope sequence of the input audio signal on the basis of time-domain linear prediction of the input audio signal.

Abstract: An encoder and a decoder are provided that are capable of reproducing a frequency-domain envelope sequence that provides high approximation accuracy around peaks caused by the pitch period of an audio signal by using a small amount of code. An encoder of the present invention comprises a periodic-combined-envelope generating part and a variable-length coding part. The periodic-combined-envelope generating part generates a periodic combined envelope sequence which is a frequency-domain sequence based on a spectral envelope sequence which is a frequency-domain sequence corresponding to a linear predictive coefficient code obtained from an input audio signal and on a frequency-domain period. The variable-length coding part encodes a frequency-domain sequence derived from the input audio signal. A decoder of the present invention comprises a periodic-combined-envelope generating part and a variable-length decoding part.

Abstract: A log spectral envelope sequence L0, L1, . . . , LN?1 and an envelope code for the log spectral envelope sequence L0, L1, . . . , LN?1 are obtained. The log spectral envelope sequence L0, L1, . . . , LN?1 is an integer value sequence corresponding to binary logarithms of respective sample values of a spectral envelope sequence and is an integer value sequence whose total sum is 0. For a quantized spectral sequence {circumflex over (?)}X0, {circumflex over (?)}X1, . . . , {circumflex over (?)}XN?1, a smoothed spectral sequence ˜X0, ˜X1, . . . , ˜XN?1 is obtained by: for {circumflex over (?)}Xk with Lk being a positive value, adopting {circumflex over (?)}Xk with Lk digits from its least significant digit removed as ˜Xk; for {circumflex over (?)}Xk with Lk being a negative value, adopting {circumflex over (?)}Xk with ?Lk digits added to its least significant digit in accordance with a predefined rule as ˜Xk; and when Lk is 0, adopting {circumflex over (?)}Xk as ˜Xk.

Abstract: A coding technology that efficiently codes an input sound signal irrespective of the characteristics thereof and can obtain a decoded sound signal that sounds less artificial to a listener. A coding method codes an input sound signal frame by frame of a predetermined time segment by a selected coding processing from a plurality of types of coding processing in the frequency domain, the coding method makes it possible for a selection unit to select coding processing which is different from the coding processing of the preceding frame as coding processing of the present frame if at least one of the magnitude of the energy of high frequency components of the input sound signal of the preceding frame and the magnitude of the energy of high frequency components of the input sound signal of the present frame is smaller than or equal to a predetermined threshold value.

Abstract: A coding technology that efficiently codes an input sound signal irrespective of the characteristics thereof and can obtain a decoded sound signal that sounds less artificial to a listener. A coding method codes an input sound signal frame by frame of a predetermined time segment by a selected coding processing from a plurality of types of coding processing in the frequency domain, the coding method makes it possible for a selection unit to select coding processing which is different from the coding processing of the preceding frame as coding processing of the present frame if at least one of the magnitude of the energy of high frequency components of the input sound signal of the preceding frame and the magnitude of the energy of high frequency components of the input sound signal of the present frame is smaller than or equal to a predetermined threshold value.

Abstract: An encoding/decoding technique is provided with which encoding can be performed using a small average number of bits even for a sequence of integer values including small non-zero values and having a distribution heavily biased toward small values. The present invention includes an integer encoding part 110 that, with respect to an inputted sequence of non-negative integer values x_n, n? {1, 2, . . . , N} (hereinafter referred to as an “integer sequence”), obtains a 1-bit code as a code corresponding to a run of integer values 0 of length L, a predetermined number which satisfies 2?L?2K?1, which is included in the integer sequence and obtains a (K×x_n)-bit or (K×x_n+1)-bit code as a code corresponding to a set of a run of integer values 0 of length from 0 to L?1 and one non-zero integer value x_n included in the integer sequence, where K is assumed to be an integer equal to or larger than 2.

Abstract: The present invention reduces encoding distortion in frequency domain encoding compared to conventional techniques, and obtains LSP parameters that correspond to quantized LSP parameters for the preceding frame and are to be used in time domain encoding from coefficients equivalent to linear prediction coefficients resulting from frequency domain encoding. When p is an integer equal to or greater than 1, a linear prediction coefficient sequence which is obtained by linear prediction analysis of audio signals in a predetermined time segment is represented as a[1], a[2], . . . , a[p], and ?[1], ?[2], . . . , ?[p] are a frequency domain parameter sequence derived from the linear prediction coefficient sequence a[1], a[2], . . . , a[p], an LSP linear transformation unit (300) determines the value of each converted frequency domain parameter ˜?[i] (i=1, 2, . . . , p) in a converted frequency domain parameter sequence ˜?[1], ˜?[2], . . . , ˜?[p] using the frequency domain parameter sequence ?[1], ?[2], . . .

Abstract: A coding technology that efficiently codes an input sound signal irrespective of the characteristics thereof and can obtain a decoded sound signal that sounds less artificial to a listener. A coding method codes an input sound signal frame by frame of a predetermined time segment by a selected coding processing from a plurality of types of coding processing in the frequency domain, the coding method makes it possible for a selection unit to select coding processing which is different from the coding processing of the preceding frame as coding processing of the present frame if at least one of the magnitude of the energy of high frequency components of the input sound signal of the preceding frame and the magnitude of the energy of high frequency components of the input sound signal of the present frame is smaller than or equal to a predetermined threshold value.

Abstract: An encoder and a decoder are provided that are capable of reproducing a frequency-domain envelope sequence that provides high approximation accuracy around peaks caused by the pitch period of an audio signal by using a small amount of code. An encoder of the present invention comprises a periodic-combined-envelope generating part and a variable-length coding part. The periodic-combined-envelope generating part generates a periodic combined envelope sequence which is a frequency-domain sequence based on a spectral envelope sequence which is a frequency-domain sequence corresponding to a linear predictive coefficient code obtained from an input audio signal and on a frequency-domain period. The variable-length coding part encodes a frequency-domain sequence derived from the input audio signal. A decoder of the present invention comprises a periodic-combined-envelope generating part and a variable-length decoding part.

Abstract: An encoder and a decoder are provided that are capable of reproducing a frequency-domain envelope sequence that provides high approximation accuracy around peaks caused by the pitch period of an audio signal by using a small amount of code. An encoder of the present invention comprises a periodic-combined-envelope generating part and a variable-length coding part. The periodic-combined-envelope generating part generates a periodic combined envelope sequence which is a frequency-domain sequence based on a spectral envelope sequence which is a frequency-domain sequence corresponding to a linear predictive coefficient code obtained from an input audio signal and on a frequency-domain period. The variable-length coding part encodes a frequency-domain sequence derived from the input audio signal. A decoder of the present invention comprises a periodic-combined-envelope generating part and a variable-length decoding part.

Abstract: In encoding, a frequency-domain sample sequence derived from an acoustic signal is divided by a weighted envelope and is then divided by a gain, the result obtained is quantized, and each sample is variable-length encoded. The error between the sample before quantization and the sample after quantization is quantized with information saved in this variable-length encoding. This quantization is performed under a rule that specifies, according to the number of saved bits, samples whose errors are to be quantized. In decoding, variable-length codes in an input sequence of codes are decoded to obtain a frequency-domain sample sequence; an error signal is further decoded under a rule that depends on the number of bits of the variable-length codes; and from the obtained sample sequence, the original sample sequence is obtained according to supplementary information.

Abstract: A technology of accurately coding and decoding coefficients which are convertible into linear prediction coefficients even for a frame in which the spectrum variation is great while suppressing an increase in the code amount as a whole is provided. A coding device includes: a first coding unit that obtains a first code by coding coefficients which are convertible into linear prediction coefficients of more than one order; and a second coding unit that obtains a second code by coding at least quantization errors of the first coding unit if (A?1) an index Q commensurate with how high the peak-to-valley height of a spectral envelope is, the spectral envelope corresponding to the coefficients which are convertible into the linear prediction coefficients of more than one order, is larger than or equal to a predetermined threshold value Th1 and/or (B?1) an index Q? commensurate with how short the peak-to-valley height of the spectral envelope is, is smaller than or equal to a predetermined threshold value Th1?.

Abstract: In encoding, a frequency-domain sample sequence derived from an acoustic signal is divided by a weighted envelope and is then divided by a gain, the result obtained is quantized, and each sample is variable-length encoded. The error between the sample before quantization and the sample after quantization is quantized with information saved in this variable-length encoding. This quantization is performed under a rule that specifies, according to the number of saved bits, samples whose errors are to be quantized. In decoding, variable-length codes in an input sequence of codes are decoded to obtain a frequency-domain sample sequence; an error signal is further decoded under a rule that depends on the number of bits of the variable-length codes; and from the obtained sample sequence, the original sample sequence is obtained according to supplementary information.

Abstract: The present invention reduces encoding distortion in frequency domain encoding compared to conventional techniques, and obtains LSP parameters that correspond to quantized LSP parameters for the preceding frame and are to be used in time domain encoding from coefficients equivalent to linear prediction coefficients resulting from frequency domain encoding. When p is an integer equal to or greater than 1, a linear prediction coefficient sequence which is obtained by linear prediction analysis of audio signals in a predetermined time segment is represented as a[1], a[2], . . . , a[p], and ?[1], ?[2], . . . , ?[p] are a frequency domain parameter sequence derived from the linear prediction coefficient sequence a[1], a[2], . . . , a[p], an LSP linear transformation unit (300) determines the value of each converted frequency domain parameter ˜?[i] (i=1, 2, . . . , p) in a converted frequency domain parameter sequence ˜?[1], ˜?[2], . . . , ˜?[p] using the frequency domain parameter sequence ?[1], c[2], . . .