# US 2003/0216925 A1 · Compression method and apparatus, decompression method and apparatus, compression/decompression system, peak detection method, program, and recording medium

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

- Number: US 2003/0216925 A1
- Document ID: US20030216925A1
- Status: Published application
- Kind: A1
- Application number: 10/463,786
- Filed: 2003-06-18
- Published: 2003-11-20
- Earliest claimed: 2001-04-16
- Assignees: Yasue Sakai
- Inventors: Yukio Koyanagi
- Web page: https://patentgrep.com/patent/US20030216925A1

## CPC

- G10L 25/90: Pitch determination of speech signals
- G10L 19/0204: {using subband decomposition}
- G10L 19/09: Long term prediction, i.e. removing periodical redundancies, e.g. by using adaptive codebook or pitch predictor
- G10L: SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING

## Abstract

With respect to data having periodicity to be compressed, windows of the same size are set for every two sections according to an interval of peaks appearing substantially periodically and processing for sorting sample data alternately among the set windows of the same size is sequentially performed, whereby a frequency of data having periodicity is replaced with an approximately half frequency without damaging reproducibility to original data at all to make it possible to apply compression processing to data of the replaced low frequency. If this sorting processing is applied to compression processing having a characteristic that a compression ratio is not increased in a high-frequency region, it becomes possible to improve a compression ratio without damaging a quality of reproduced data by decompression at all.

## Claims

### Claim 1

A compression method, characterized by setting, with respect to data having periodicity to be compressed, windows of the same size for every plurality of sections according to a period of the data, sequentially performing processing for sorting sample data alternately among the set windows of the same size, and applying compression processing to data obtained by the sorting processing.

### Claim 2

A compression method, characterized by setting, with respect to data having periodicity to be compressed, windows of the same size for every plurality of sections according to a period of the data, sequentially performing processing for sorting sample data alternately among the set windows of the same size, and applying processing for sequentially detecting sampling points where, when data of two sampling points are subjected to linear interpolation, an error between the interpolated data and original data is equal to or less than a desired value, as sample points of the compression data to data obtained by the sorting processing.

### Claim 3

A compression method, characterized by setting, with respect to data having periodicity to be compressed, windows of the same size for every plurality of sections according to a period of the data, sequentially performing processing for sorting sample data alternately among the set windows of the same size, and applying processing for sequentially detecting sampling points where an error between a data value on a straight line connecting data of two sampling points and a sample data value in the same sampling point as the data value on the straight line is equal to or less than a desired value as sample points of the compression data to data obtained by the sorting processing.

### Claim 4

A compression method, characterized by setting, with respect to data having periodicity to be compressed, windows of the same size for every plurality of sections according to a period of the data, sequentially performing processing for sorting sample data alternately among the set windows of the same size, and applying processing for sequentially detecting sampling points where all errors between a data value on a straight line connecting data of two sampling points and each sample data value in the same sampling point as each data value on the straight line are equal to or less than a desired value, which are sampling points where a time interval between said two sampling points is the longest within a predetermined range, as sample points of the compression data to data obtained by the sorting processing.

### Claim 5

A compression method, characterized by setting, with respect to data having periodicity to be compressed, windows of the same size for every plurality of sections according to a period of the data, sequentially performing processing for sorting sample data alternately among the set windows of the same size, and applying processing for sequentially detecting sampling points where an error between a data value on a straight line connecting data of two sampling points and a sample data value in the same sampling point as the data value on the straight line is equal to or less than a desired value, which are sampling points immediately preceding sampling points where said error exceeds said desired value, as sample points of the compression data to data obtained by the sorting processing.

### Claim 6 (depends on 2)

The compression method according to claim 2, characterized in that said compression data includes pitch data representing a size of each window, amplitude data of each sample point, and timing data representing a time interval between said each sample point.

### Claim 7 (depends on 1)

The compression method according to claim 1, characterized by setting, with respect to said data having periodicity to be compressed, windows of the same size for every two sections according to said period, and sequentially performing processing for sorting sample data alternately between two windows for every two sections.

### Claim 8 (depends on 1)

The compression method according to claim 1, characterized by setting, with respect to said data having periodicity to be compressed, windows of the same size for every plurality of sections according to said period, sequentially performing processing for sorting sample data alternately among the set windows of the same size, and further setting, with respect to data obtained by the processing, windows of the same size for every plurality of sections according to the period of the data, and performing processing for sorting sample data alternately among the set windows of the same size, and applying compression processing to data obtained by the processing.

### Claim 9 (depends on 1)

The compression method according to claim 1, characterized by detecting, with respect to said data having periodicity to be compressed, peaks appearing substantially periodically, and setting said windows according to an interval of the detected peaks.

### Claim 10 (depends on 9)

The compression method according to claim 9, characterized by detecting a maximum value of data in a first section existing before a certain sampling point inclusive (pre-maximum value) and a maximum value of data in a second section existing after said certain sampling point inclusive (post-maximum value) and, if a data value of said certain sampling point, said pre-maximum value and said post-maximum value are coincide with each other, detecting said certain sampling point as said peak.

### Claim 11 (depends on 10)

The compression method according to claim 10, characterized in that said first section and said second section are the same size.

### Claim 12 (depends on 10)

The compression method according to claim 10, characterized in that said first section is larger than said second section or said second section is larger than said first section.

### Claim 13 (depends on 9)

The compression method according to claim 9, characterized by detecting a maximum value of data in a first section existing before a certain sampling point inclusive (pre-maximum value), a maximum value of data in a second section, which is the same size as said first section, existing after said certain sampling point inclusive (first post-maximum value), and a maximum value of data in a third section, which is larger than said second section, existing after said certain sampling point inclusive (second post-maximum value) and, if a data value of said certain sampling point, said pre-maximum value, said first post-maximum value and said second post-maximum value are coincide with each other, detecting said certain sampling point as said peak.

### Claim 14 (depends on 9)

The compression method according to claim 9, characterized by adopting every other intervals of said plurality of detected peaks to set windows of sizes corresponding to the intervals for every two sections, and sequentially performing processing for sorting sample data alternately between two windows for every two sections.

### Claim 15

A compression apparatus, characterized by comprising:
sorting means for, with respect to data having periodicity to be compressed, setting windows of the same size for every plurality of sections according to a period of the data and sequentially performing processing for sorting sample data alternately among the set windows of the same size; and
compressing means for applying compression processing to data obtained by said sorting means.

### Claim 16

A compression apparatus, characterized by comprising:
sorting means for, with respect to data having periodicity to be compressed, setting windows of the same size for every plurality of sections according to a period of the data and sequentially performing processing for sorting sample data alternately among the set windows of the same size; and
linear compression means for applying processing for sequentially detecting sampling points where, when data of two sampling points are subjected to linear interpolation, an error between the interpolated data and original data is equal to or less than a desired value, as sample points of the compression data to data obtained by said sorting means.

### Claim 17 (depends on 16)

The compression apparatus according to claim 16, characterized in that said linear compression means applies processing for sequentially detecting sampling points where all errors between each data value on a straight line connecting data of said two sampling points and each sample data value in the same sampling point as each data value on the straight line are equal to or less than a desired value, which are sampling points where a time interval between said two sampling points is the longest within a predetermined range, as sample points of said compression data to data obtained by said sorting means.

### Claim 18 (depends on 16)

The compression apparatus according to claim 16, characterized in that said linear compression means applies processing for sequentially detecting sampling points where an error between a data value on a straight line connecting data of said two sampling points and a sample data value in the same sampling point as the data value on the straight line is equal to or less than a desired value, which are sampling points immediately preceding sampling points where said error exceeds said desired value, as sample points of said compression data to data obtained by said sorting means.

### Claim 19 (depends on 16)

The compression apparatus according to claim 16, characterized in that said compression data includes pitch data representing a size of each window, amplitude data of each sample point, and timing data representing a time interval between said each sample point.

### Claim 20 (depends on 15)

The compression apparatus according to claim 15, characterized in that said sorting means comprises:
peak detection means for detecting peaks appearing substantially periodically with respect to said data having periodicity to be compressed; and
zigzag processing means for setting said windows according to an interval of peaks detected by said peak detection means and sequentially performing processing for sorting sample data alternately among the set windows of the same size.

### Claim 21 (depends on 20)

The compression apparatus according to claim 20, characterized in that said peak detection means detects a maximum value of data in a first section existing before a certain sampling point inclusive (pre-maximum value) and a maximum value of data in a second section existing after said certain sampling point inclusive (post-maximum value) and, if a data value of said certain sampling point, said pre-maximum value and said post-maximum value are coincide with each other, detects said certain sampling point as said peak.

### Claim 22 (depends on 20)

The compression apparatus according to claim 20, characterized in that said zigzag processing means adopts every other intervals of said plurality of peaks detected by said peak detection means to set windows of sizes corresponding to the intervals for every two sections, and sequentially performs processing for sorting sample data alternately between two windows for every two sections.

### Claim 23 (depends on 1)

A decompression method, characterized by applying decompression processing corresponding to said compression processing to compression data generated in accordance with said compression method according to claim 1, setting the same windows as claim one for data obtained by the decompression processing, and sequentially performing processing for sorting said data alternately among the set windows of the same size, thereby obtaining decompression data.

### Claim 24 (depends on 2)

A decompression method, characterized by using amplitude data of each sample point included in compression data generated in accordance with said compression method according to claim 2 and timing data representing a time interval between said each sample point to find interpolation data for interpolating amplitude data having the time interval indicated by said timing data, setting the same windows as claim 2 for the interpolation data obtained in this way, and sequentially performing processing for sorting said interpolation data alternately among the set windows of the same size, thereby obtaining decompression data.

### Claim 25 (depends on 15)

A decompression apparatus, characterized by comprising:
amplitude data calculation means for applying decompression processing corresponding to said compression processing to compression data generated by said compression apparatus according to claim 15, thereby finding amplitude data of each sampling point; and
reverse sorting means for setting the same windows as claim 15 for amplitude data found by said amplitude data calculation means and sequentially performing processing for sorting said amplitude data alternately among the set windows of the same size, thereby obtaining decompression data.

### Claim 26 (depends on 16)

A decompression apparatus, characterized by comprising:
data interpolation means for using amplitude data of each sample point included in compression data generated by said compression apparatus according to claim 16 and timing data representing a time interval between said each sample point to find interpolation data for interpolating amplitude data having the time interval indicated by said timing data; and
reverse sorting means for setting the same windows as claim 16 for interpolation data found by said data interpolation means and sequentially performing processing for sorting said interpolation data alternately among the set windows of the same size, thereby obtaining decompression data.

### Claim 27

A compression/decompression system, characterized by, on a compression side, with respect to data having periodicity to be compressed, setting windows of the same size for every plurality of sections according to a period of the data, sequentially performing processing for sorting sample data alternately among the set windows of the same size, and applying compression processing to data obtained by the processing, thereby obtaining compression data, and on a decompression side, applying decompression processing corresponding to said compression processing to said compression data, setting windows of the same size for said every plurality of sections for data obtained by the processing, and sequentially performing processing for sorting said data alternately among the set windows of the same size, thereby obtaining decompression data.

### Claim 28

A compression/decompression system, characterized by, on a compression side, with respect to data having periodicity to be compressed, setting windows of the same size for every plurality of sections according to a period of the data, sequentially performing processing for sorting sample data alternately among the set windows of the same size, and applying processing for sequentially detecting sampling points where, at the time when linear interpolation is applied to data of two sampling points, an error between interpolated data and original data is equal to or less than a desired value as sample points to data obtained by the processing, thereby obtaining amplitude data of each sample point and timing data representing a time interval between said each sample point as compression data, and on a decompression side, using amplitude data of each sample point included in said compression data and timing data representing a time interval between said each sample point to find interpolation data for interpolating amplitude data having a time interval indicated by said timing data and, thereafter, setting windows of the same size for said every plurality of sections based on said pitch data and sequentially performing processing for sorting said interpolation data alternately among the set windows of the same size, thereby obtaining decompression data.

### Claim 29

A peak detection method, characterized by detecting, with respect to data having periodicity in which peaks appear substantially periodically, a maximum value of data in a first section existing before a certain sampling point inclusive (pre-maximum value) and a maximum value of data in a second section existing after said certain sampling point inclusive (post-maximum value) and, if a data value of said certain sampling point, said pre-maximum value and said post-maximum value are coincide with each other, detecting said certain sampling point as said peak.

### Claim 30 (depends on 29)

The peak detection method according to claim 29, characterized in that said first section and said second section are the same size.

### Claim 31 (depends on 29)

The peak detection method according to claim 29, characterized in that said first section is larger than said second section or said second section is larger than said first section.

### Claim 32 (depends on 1)

A compression program for causing a computer to execute processing procedures of said compression method according to claim 1.

### Claim 33 (depends on 15)

A compression program for causing a computer to function as each means according to claim 15.

### Claim 34 (depends on 23)

A decompression program for causing a computer to execute processing procedures of said decompression method according to claim 23.

### Claim 35 (depends on 25)

A decompression program for causing a computer to function as each means according to claim 25.

### Claim 36 (depends on 29)

A peak detection program for causing a computer to execute processing procedures of said peak detection method according to claim 29.

### Claim 37 (depends on 1)

A computer readable recording medium, characterized by recording a program for causing a computer to execute processing procedures of said compression method according to claim 1.

### Claim 38 (depends on 23)

A computer readable recording medium, characterized by recording a program for causing a computer to execute processing procedures of said decompression method according to claim 23.

### Claim 39 (depends on 29)

A computer readable recording medium, characterized by recording a program for causing a computer to execute processing procedures of said peak detection method according to claim 29.

### Claim 40 (depends on 15)

A computer readable recording medium, characterized by recording a program for causing a computer to function as each means according to claim 15.

### Claim 41 (depends on 25)

A computer readable recording medium, characterized by recording a program for causing a computer to function as each means according to claim 25.
