# US 2011/0254713 A1 · Encoding method and decoding method, and devices, program and recording medium for the same

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2011/0254713 A1
- Document ID: US20110254713A1
- Status: Published application
- Kind: A1
- Application number: 13/132,418
- Filed: 2009-12-08
- Published: 2011-10-20
- Earliest claimed: 2008-12-09
- Assignees: Nippon Telegraph and Telephone Corporation
- Inventors: Takehiro Moriya; Noboru Harada; Yutaka Kamamoto
- Web page: https://patentgrep.com/patent/US20110254713A1

## CPC

- H03M 7/40: Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

Information that includes first information identifying integer quotients obtained by divisions using prediction residuals or integers not smaller than 0 that increase monotonically with increases in the amplitude of the prediction residuals, as dividends, and a separation parameter decided for a time segment corresponding to the prediction residuals or a mapped integer value of the separation parameter, as a modulus, and second information identifying the remainders obtained when the dividends are divided by the modulus is generated as a code corresponding to the prediction residuals, and each piece of side information that includes the separation parameter is subjected to variable length coding.

## Claims

### Claim 1

An encoding method for encoding prediction residuals in integer representation generated on the basis of the result of prediction analysis of time-series signals, the encoding method comprising:
(A) a step of deciding a separation parameter for each given time segment;
(B) a step of outputting, as a code corresponding to the prediction residuals, information that includes first information identifying integer quotients obtained by divisions using the prediction residuals or integers not smaller than 0 that monotonically increase with increases in the amplitude of the prediction residuals, as dividends, and the separation parameter decided for the time segment corresponding to the prediction residuals or a mapped integer value of the separation parameter, as a modulus, and second information identifying the remainders obtained when the dividends are divided by the modulus; and
(C) a step of outputting a code obtained by performing variable length coding of each piece of side information that includes the separation parameter.

### Claim 2 (depends on 1)

The encoding method according to claim 1, wherein the separation parameter is a Rice parameter for performing Golomb-Rice coding of the prediction residuals corresponding to the time segment or mapped values of the prediction residuals, a mapped value of the Rice parameter, or a value for minimizing the total amount of a code corresponding to the prediction residuals in the time segment.

### Claim 3 (depends on 2)

The encoding method according to claim 2, wherein the separation parameter is the mapped value of the Rice parameter;
the separation parameter decided for the time segment is smaller than the Rice parameter for performing Golomb-Rice coding of the prediction residuals corresponding to the time segment or of the mapped values of the prediction residuals; and
the first information has codes each of which is obtained by performing variable length coding of each of the quotients with a variable length coding scheme selected from a plurality of variable length coding schemes, and the plurality of variable length coding schemes include variable length coding schemes other than an Alpha coding scheme.

### Claim 4 (depends on 1)

The encoding method according to claim 1, wherein conditions are satisfied in which the separation parameter is an integer that weakly increases with increases in amplitude of the prediction residuals, and the modulus is an integer that increases monotonically with an increase in the separation parameter, or conditions are satisfied in which the separation parameter is an integer that weakly decreases with increases in the amplitude of the prediction residuals, and the modulus is an integer that increases monotonically with a decrease in the separation parameter; and
the step (C) has a step of performing variable length coding of the side information, by using a variable length coding scheme in which code length of a first code being shorter than code length of a second code is more frequent than the code length of the first code being longer than the code length of the second code, where the first code is assigned to side information that includes a separation parameter whose distance from a predetermined specific value is a first distance, and the second code is assigned to side information that includes a separation parameter whose distance from the predetermined specific value is a second distance being greater than the first distance.

### Claim 5 (depends on 4)

The encoding method according to claim 4, wherein the predetermined specific value is within a possible range of the separation parameter that brings the modulus to a value not smaller than 1 and not greater than the maximum value of the dividends; and
the predetermined specific value is a value other than the lower limit value or the upper limit value in the possible range of the separation parameter.

### Claim 6 (depends on 5)

The encoding method according to claim 5, wherein the dividends are integers not smaller than 0 and smaller than 2B where B is an integer not smaller than 3; and
the possible range of the separation parameter is from 0 to B−1 both inclusive.

### Claim 7 (depends on 4)

The encoding method according to claim 4, wherein the predetermined specific value is within a possible range of the separation parameter that brings the modulus to a value not smaller than 1 and not greater than the maximum value of the dividends; and
the predetermined specific value is closer to an intermediate value between the lower limit value and the upper limit value in the possible range of the separation parameter than the lower limit value or the upper limit value.

### Claim 8 (depends on 7)

The encoding method according to claim 7, wherein the dividends are integers not smaller than 0 and smaller than 2B where B is an integer not smaller than 3; and
the possible range of the separation parameter is from 0 to B−1 both inclusive.

### Claim 9 (depends on 4)

The encoding method according to claim 4, wherein the possible range of the separation parameter is from 0 to 7 both inclusive; and
the predetermined specific value is 2 or 3.

### Claim 10 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9)

The encoding method according to any one of claims 1 to 9, wherein the prediction residuals are obtained from the result of prediction analysis of the time-series signals in each frame, which is a predetermined time segment;
the step (A) is a step of deciding respective separation parameters in respective subframes, which are time segments subdivided from the frame;
the modulus of the divisions is each of the separation parameters decided for the subframes corresponding to the prediction residuals or each mapped integer value of each of the separation parameters; and
the side information includes a connected parameter formed by connecting the separation parameters decided for different subframes included in the same frame.

### Claim 11 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9)

The encoding method according to any one of claims 1 to 9, wherein the first information has codes which are obtained by performing variable length coding of the quotients;
the step (B) comprises:
(B-1) a step of obtaining the quotients;
(B-2) a step of selecting each coding scheme for performing variable length coding of the quotients for each predetermined time segment; and
(B-3) a step of generating the first information through variable length coding of the quotients, by using the coding scheme selected for the time segment to which the prediction residuals corresponding to the quotients belong; and
the side information includes a combination of the separation parameter and an index for identifying the coding scheme selected in the step (B-2).

### Claim 12 (depends on 11)

The encoding method according to claim 11, wherein the step (C) comprises a step of performing variable length coding of a plurality of pieces of side information having the separation parameter of an identical value, by using a specific variable length coding scheme;
the specific variable length coding scheme assigns a code having smallest length among codes assigned respectively to the plurality of pieces of the side information having the separation parameter of the identical value, to specific side information among the plurality of pieces of the side information having the separation parameter of the identical value; and
the specific side information includes an index for identifying a coding scheme for performing Alpha coding or variable length coding closest to Alpha coding.

### Claim 13 (depends on 12)

The encoding method according to claim 12, wherein given variable length coding is closer to Alpha coding as the sum of (bu(k)−bx(k))(fu(k)−(fx(k)) corresponding to values k to be encoded is smaller, where bu(k) is bit length of a code assigned to a value k to be encoded by Alpha coding, bx(k) is bit length of a code assigned to a value k to be encoded by the given variable length coding, fu(k) equals 0.5bu(k), and fx(k) equals 0.5bx(k).

### Claim 14 (depends on 11)

The encoding method according to claim 11, wherein the step (C) has a step of performing variable length coding of the side information by using a variable length coding scheme in which code length of a third code being smaller than code length of a fourth code is more frequent than the code length of the third code being longer than the code length of the fourth code, when the separation parameter brings the modulus to a value not smaller than a predetermined threshold;
the fourth code is assigned to side information that includes an index for identifying a first coding scheme for performing first variable length coding differing from Alpha coding; and
the third code is assigned to side information that includes an index for identifying a second coding scheme for performing second variable length coding closer to Alpha coding than the first variable encoding.

### Claim 15 (depends on 14)

The encoding method according to claim 14, wherein given variable length coding is closer to Alpha coding as the sum of (bu(k)−bx(k))(fu(k)−fx(k)) corresponding to values k to be encoded is smaller, where bu(k) is bit length of a code assigned to a value k to be encoded by Alpha coding, bx(k) is bit length of a code assigned to a value k to be encoded by the given variable length coding, fu(k) equals 0.5bu(k), and fx(k) equals 0.5bx(k).

### Claim 16 (depends on 11)

The encoding method according to claim 11, wherein the prediction residuals are obtained from the result of prediction analysis of the time-series signals in each frame, which is a predetermined time segment;
the step (B-2) is a step of selecting each coding scheme for each subframe, which is a time segment subdivided from the frame;
the step (B-3) is a step of generating the first information through variable length coding of the quotients by using the coding scheme decided for the subframe to which the prediction residuals corresponding to the quotients belong; and
the side information includes a combination of the separation parameter and a connected index, the connected index being formed by connecting indices for identifying coding schemes selected for different subframes included in the same frame.

### Claim 17 (depends on 16)

The encoding method according to claim 16, wherein the step (C) comprises a step of performing variable length coding of side information having the separation parameter of an identical value, by using a variable length coding scheme which assigns a code having the smallest length among codes assigned respectively to pieces of side information having the separation parameter of the identical value, to side information having an index for identifying a coding scheme for performing Alpha coding or variable length coding closest to Alpha coding, among the side information having the separation parameter of the identical value.

### Claim 18 (depends on 16)

The encoding method according to claim 16, wherein the step (C) has a step of performing variable length coding of the side information by using a variable length coding scheme in which code length of a third code being shorter than code length of a fourth code is more frequent than the code length of the third code being longer than the code length of the fourth code, when the separation parameter brings the modulus to a value not smaller than a predetermined threshold;
the fourth code is assigned to side information that includes an index for identifying a first coding scheme for performing first variable length coding differing from Alpha coding; and
the third code is assigned to side information that includes an index for identifying a second coding scheme for performing second variable length coding closer to Alpha coding than the first variable length coding.

### Claim 19

An encoding method for encoding prediction residuals in integer representation generated on the basis of the result of prediction analysis of time-series signals, the encoding method comprising:
a step of deciding a separation parameter for each given time segment; and
a step of outputting a code obtained by performing variable length coding of each piece of side information that includes the separation parameter,
wherein the separation parameter decided for the time segment is smaller than a Rice parameter for performing Golomb-Rice coding of the prediction residuals corresponding to the time segment or of mapped values of the prediction residuals.

### Claim 20

A decoding method for decoding a code corresponding to prediction residuals in integer representation generated on the basis of the result of prediction analysis of time-series signals, the decoding method comprising:
(D) a step of decoding a variable length code of side information that includes a separation parameter to generate the side information that includes the separation parameter; and
(E) a step of generating the prediction residuals or integers not smaller than 0 that monotonically increase with increases in the amplitude of the prediction residuals, by using the code corresponding to the prediction residuals and the side information, wherein
the code corresponds to the prediction residuals containing first information and second information,
the first information is information identifying integer quotients obtained from divisions using the prediction residuals or integers not smaller than 0 that monotonically increase with increases in the amplitude of the prediction residuals, as dividends, and the separation parameter decided for the time segment corresponding to the prediction residuals or a mapped integer value of the separation parameter, as a modulus, and
the second information is information identifying the remainders obtained when the dividends are divided by the modulus.

### Claim 21

An encoder for encoding prediction residuals in integer representation generated on the basis of the result of prediction analysis of time-series signals, the encoder comprising:
an encoding unit for deciding an integer separation parameter for each given time segment, and outputting, as a code corresponding to the prediction residuals, information that includes first information identifying integer quotients obtained from divisions using the prediction residuals or integers not smaller than 0 that monotonically increase with increases in the amplitude of the prediction residuals, as dividends, and the separation parameter decided for the time segment corresponding to the prediction residuals or a mapped integer value of the separation parameter, as a modulus, and second information identifying the remainders obtained when the dividends are divided by the modulus; and
a variable length coding unit for outputting a code obtained by performing variable length coding of each piece of side information that includes the separation parameter.

### Claim 22

An encoder for encoding prediction residuals in integer representation generated on the basis of the result of prediction analysis of time-series signals, the encoder comprising:
an encoding unit for deciding a separation parameter for each given time segment; and
a variable length coding unit for outputting a code obtained by performing variable length coding of each piece of side information that includes the separation parameter,
wherein the separation parameter decided for the time segment is smaller than a Rice parameter for performing Golomb-Rice coding of the prediction residuals corresponding to the time segment or of mapped values of the prediction residuals.

### Claim 23

A decoder for decoding a code obtained by encoding prediction residuals in integer representation generated on the basis of the result of prediction analysis of time-series signals, the decoder comprising:
a variable length decoding unit for decoding a variable length code of side information that includes a separation parameter to generate the side information that includes the separation parameter; and
a decoding unit for generating the prediction residuals or integers not smaller than 0 that monotonically increase with increases in the amplitude of the prediction residuals, by using the code corresponding to the prediction residuals and the side information, wherein
the code corresponds to the prediction residuals containing first information and second information,
the first information is information identifying integer quotients obtained by divisions using the prediction residuals or integers not smaller than 0 that increase monotonically with increases in the amplitude of the prediction residuals, as dividends, and the separation parameter decided for the time segment corresponding to the prediction residuals or a mapped integer value of the separation parameter, as a modulus, and
the second information is information identifying the remainders obtained when the dividends are divided by the modulus.

### Claim 24 (depends on 1, 19)

A program for making a computer execute the steps of the encoding method according to claim 1 or claim 19.

### Claim 25 (depends on 20)

A program for making a computer execute the steps of the decoding method according to claim 20.

### Claim 26 (depends on 1, 19)

A computer-readable recording medium having stored a program for making a computer execute the steps of the encoding method according to claim 1 or claim 19.

### Claim 27 (depends on 20)

A computer-readable recording medium having stored a program for making a computer execute the steps of the decoding method according to claim 20.
