EP0428156A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Adaptive transform coding by selecting optimum block lengths according to variations between successive blocks
Assignee: NEC Corp
•
Filing: 1990-11-14
•
Granted: —
•
Expires: 2010-11-14
Abstract
Abstract Subblocks of input digital samples are stored into a buffer at frame intervals and segmented into blocks having an integral multiple of the length of the subblock. Each block is encoded into transform coefficients and stored into a memory. Each coefficient is squared and those of the squared transform coefficients which correspond to high-frequency components of the input digital samples are summed and a minimum value is detected therefrom as corresponding to an optimum block length. Those transform coefficients which correspond to the optimum block length are selected from the memory and multiplexed with a signal representative of the optimum block length. In a modification, interblock differences are detected between successive transform coefficients of equal block length and squared. Those of the squared interblock differences which correspond to equal block length are summed, producing a set of squared sums for each block length. A variation is detected between a representative squared sum of a given set and a representative squared sum of a successive set to identify a block length which corresponds to the variation as an optimum block length.
Inventors
- 👤 Akihiko C/O Nec Corporation Sugiyama
- 👤 Masahiro C/O Nec Corporation Iwadare
- 👤 Takao C/O Nec Corporation Nishitani
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-27 09:51
CPC Classifications
G; G10; G10L; G10L19/00; G10L19/02; G10L19/022; H; H03; H03M; H03M7/00; H03M7/30; H03M7/3053; G10L19/0212
Claims Analysis
Total Claims: 32
Claim 1
Independent Claim
140 words
An adaptive trasform coding method comprising: a) storing subblocks of input digital samples representing an audio-frequency signal into a buffer at predetermined intervals and segmenting the stored samples into a plurality of blocks each having an integral multiple of length of said subblock; b) encoding each of said blocks into corresponding transform coefficients and storing said transform coefficients into a memory; c) squaring each of said transform coefficients; d) summing those of said squared transform coefficients which correspond to high-frequency components of said input digital samples to produce squared sums; e) detecting a minimum of said squared sums as corresponding to an optimum block length; g) selecting those of said transform coefficients which correspond to said optimum block length from said memory; and h) multiplexing the selected transform coefficients with a block length signal representative of said optimum block length.
Claim 2
Dependent Claim
140 words
An adaptive trasform coding method comprising: a) storing subblocks of input digital samples representing an audio-frequency signal into a buffer at predetermined intervals and segmenting the stored samples into a plurality of blocks each having an integral multiple of length of said subblock; b) encoding each of said blocks into corresponding transform coefficients and storing said transform coefficients into a memory; c) squaring each of said transform coefficients; d) summing those of said squared transform coefficients which correspond to high-frequency components of said input digital samples to produce squared sums; e) detecting a minimum of said squared sums as corresponding to an optimum block length; g) selecting those of said transform coefficients which correspond to said optimum block length from said memory; and h) multiplexing the selected transform coefficients with a block length signal representative of said optimum block length.
Claim 3
Dependent Claim
180 words
An adaptive transform coding method comprising: a) storing subblocks of input digital samples representing an audio-frequency signal into a buffer at frame intervals and segmenting the stored samples into a plurality of blocks each having an integral multiple of the length of said subblock; b) encoding each of said blocks into corresponding transform coefficients and storing said transform coefficients into a memory; c) detecting interblock differences between successive transform coefficients of equal block length; d) squaring each of said interblock differences; e) summing those of said squared interblock differences which correspond to equal block length to produce a set of squared sums of said interblock differences for each block length; f) detecting representative values of the squared sums from successive ones of said sets, detecting a variation between said representative values and identifying a block length corresponding to said variation as an optimum block length; g) selecting those of said transform coefficients which correspond to said optimum block length from said memory; and h) multiplexing the selected transform coefficients with a block length signal representative of said optimum block length.
Claim 4
Dependent Claim
180 words
An adaptive transform coding method comprising: a) storing subblocks of input digital samples representing an audio-frequency signal into a buffer at frame intervals and segmenting the stored samples into a plurality of blocks each having an integral multiple of the length of said subblock; b) encoding each of said blocks into corresponding transform coefficients and storing said transform coefficients into a memory; c) detecting interblock differences between successive transform coefficients of equal block length; d) squaring each of said interblock differences; e) summing those of said squared interblock differences which correspond to equal block length to produce a set of squared sums of said interblock differences for each block length; f) detecting representative values of the squared sums from successive ones of said sets, detecting a variation between said representative values and identifying a block length corresponding to said variation as an optimum block length; g) selecting those of said transform coefficients which correspond to said optimum block length from said memory; and h) multiplexing the selected transform coefficients with a block length signal representative of said optimum block length.
Claim 5
Dependent Claim
173 words
An adaptive transform coding method comprising: a) storing subblocks of input digital samples representing an audio-frequency signal into a buffer at frame intervals and segmenting the stored samples into a plurality of blocks each having an integral multiple of the length of said subblock; b) storing said blocks into a memory and detecting interblock differences between successive blocks of equal length; c) squaring each of said interblock differences; d) summing those of said squared interblock differences which correspond to equal block length to produce a set of squared sums of said interblock differences for each block length; e) detecting representative values of the squared sums from successive ones of said sets, detecting a variation between said representative values and identifying a block length corresponding to said variation as an optimum block length; f) selection those of said blocks having said optimum block length from said memory; g) linearly encoding the selected blocks into corresponding transform coefficients; and h) multiplexing said transform coefficients with a block length signal representative of said optimum block length.
Claim 6
Dependent Claim
173 words
An adaptive transform coding method comprising: a) storing subblocks of input digital samples representing an audio-frequency signal into a buffer at frame intervals and segmenting the stored samples into a plurality of blocks each having an integral multiple of the length of said subblock; b) storing said blocks into a memory and detecting interblock differences between successive blocks of equal length; c) squaring each of said interblock differences; d) summing those of said squared interblock differences which correspond to equal block length to produce a set of squared sums of said interblock differences for each block length; e) detecting representative values of the squared sums from successive ones of said sets, detecting a variation between said representative values and identifying a block length corresponding to said variation as an optimum block length; f) selection those of said blocks having said optimum block length from said memory; g) linearly encoding the selected blocks into corresponding transform coefficients; and h) multiplexing said transform coefficients with a block length signal representative of said optimum block length.
Claim 7
Dependent Claim
54 words
An adaptive transform coding method as claimed in claim 1, 2 or 3 further comprising the steps of determining a step size from the selected transform coefficients and quantizing said transform coefficients according to said step size, and the step (h) multiplexes the quantized transform coefficients with a signal representative of said step size.
Claim 8
Dependent Claim
64 words
An adaptive transform coding method as claimed in claim 4, wherein said step size is determined by squaring said transform coefficients, taking an average value of a group of the squared transform coefficients of neighboring occurrences as a representative value of said group, providing interpolations between successive ones of said squared transform coefficients, and deriving said step size from the interpolated squared transform coefficients.
Claim 9
Dependent Claim
104 words
An adaptive transform coding method as claimed in claim 1, 2 or 3, wherein the step (a) comprises reading samples stored in said buffer and organizing 2 a+b N samples read out of said buffer into (m+1) groups of 2 a blocks of 2 b N samples each, where a+b = m, and a is a variable in a range from m to 0 and b is a variable in as range from 0 to m, and where m is equal to or greater than 2, and N is an integer, each of said groups containing an equal number of samples of same arrivals.
Claim 10
Dependent Claim
67 words
An adaptive transform coding method as claimed in claim 1, 2 or 3, further comprising deriving respective variances of said blocks, scaling said blocks according to the respective variances, storing said variances into a second memory, and selecting those variances corresponding to said optimum block length from said second memory, wherein the step (h) multiplexes the selected transform coefficients with a signal representative of the selected variances.
Claim 11
Dependent Claim
76 words
An adaptive transform coding method as claimed in claim 1, 2 or 3, further comprising generating a signal specifying a predetermined block length, wherein the step (g) selects those of said transform coefficients which correspond to said predetermined block length and the step (h) multiplexes the transform coefficients selected as corresponding to said predetermined block length with a signal representative of said predetermined block length instead of with the signal representative of the optimum block length.
Claim 12
Dependent Claim
91 words
An adaptive transform coding method as claimed in claim 2, wherein the step (f) comprises the steps of: detecting a maximum value of the squared sums from each set; and comparing between said maximum values detected from a successive pair of said sets so that said compared values correspond respectively to longer and shorter block lengths and selecting one of the compared values as corresponding to said variation if the maximum value of the longer block length has a smaller maximum value than the maximum value of a shorter block length.
Claim 13
Dependent Claim
72 words
An adaptive transform coding method as claimed in claim 2, wherein the step (f) comprises the steps of: detecting a maximum value of the squared sums from each set; dividing one of the maximum values of a successive pair by the other maximum value of the pair and deriving a plurality of ratios from a plurality of said pairs; and detecting a minimum value from said ratios as corresponding to said variation.
Claim 14
Dependent Claim
82 words
An adaptive transform coding method as claimed in claim 9 or 10, wherein the step (f) further comprises the steps of: detecting those of said squared sums from each frame interval which correspond to a minimum block length; dividing each of the detected squared sums with the detected squared sum of an adjacent occurrence to produce a plurality of ratios from each frame interval; and detecting one of said ratios as corresponding to said variation if said ratio exceeds a prescribed value.
Claim 15
Dependent Claim
91 words
An adaptive transform coding method as claimed in claim 3, wherein the step (e) comprises the steps of: detecting a maximum value of the squared sums from each set; and comparing between said maximum values detected from a successive pair of said sets so that said compared values correspond respectively to longer and shorter block lengths and selecting one of the compared values as corresponding to said variation if the maximum value of the longer block length has a smaller maximum value than the maximum value of a shorter block length.
Claim 16
Dependent Claim
72 words
An adaptive transform coding method as claimed in claim 3, wherein the step (e) comprises the steps of: detecting a maximum value of the squared sums from each set; dividing one of the maximum values of a successive pair by the other maximum value of the pair and deriving a plurality of ratios from a plurality of said pairs; and detecting a minimum value from said ratios as corresponding to said variation.
Claim 17
Dependent Claim
82 words
An adaptive transform coding method as claimed in claim 12 or 13, wherein the step (e) further comprises the steps of: detecting those of said squared sums from each frame interval which correspond to a minimum block length; dividing each of the detected squared sums with the detected squared sum of an adjacent occurrence to produce a plurality of ratios from each frame interval; and detecting one of said ratios as corresponding to said variation if said ratio exceeds a prescribed value.
Claim 18
Dependent Claim
208 words
A data compression system comprising: a buffer; buffer control means for storing subblocks of input digital samples representing an audio-frequency signal into said buffer at predetermined intervals and segmenting the stored samples into a plurality of blocks each having an integral multiple of the length of said subblock; a transform encoder for encoding each of said blocks into corresponding transform coefficients; a memory for storing said transform coefficients therein; optimum block length determination means for squaring each of said transform coefficients, summing those of said squared transform coefficients which correspond to high frequency components of said input digital samples to produce squared sums, detecting a minimum of said squared sums as corresponding to an optimum block length, and selecting those of said transform coefficients which correspond to said optimum block length from said memory; multiplexer means for multiplexing the selected transform coefficients with a signal representative of said optimum block length into a multiplex signal; demultiplexer means for demultiplexing the multiplex signal into said transform coefficients and said block length signal; and a transform decoder coupled to said demultiplexer means for decoding said demultiplexed transform coefficients in a process inverse to said transform encoder at intervals corresponding to the block length indicated by said demultiplexed block length signal.
Claim 19
Dependent Claim
208 words
A data compression system comprising: a buffer; buffer control means for storing subblocks of input digital samples representing an audio-frequency signal into said buffer at predetermined intervals and segmenting the stored samples into a plurality of blocks each having an integral multiple of the length of said subblock; a transform encoder for encoding each of said blocks into corresponding transform coefficients; a memory for storing said transform coefficients therein; optimum block length determination means for squaring each of said transform coefficients, summing those of said squared transform coefficients which correspond to high frequency components of said input digital samples to produce squared sums, detecting a minimum of said squared sums as corresponding to an optimum block length, and selecting those of said transform coefficients which correspond to said optimum block length from said memory; multiplexer means for multiplexing the selected transform coefficients with a signal representative of said optimum block length into a multiplex signal; demultiplexer means for demultiplexing the multiplex signal into said transform coefficients and said block length signal; and a transform decoder coupled to said demultiplexer means for decoding said demultiplexed transform coefficients in a process inverse to said transform encoder at intervals corresponding to the block length indicated by said demultiplexed block length signal.
Claim 20
Dependent Claim
220 words
A data compression system comprising: a buffer; buffer control means for storing subblocks of input digital samples representing an audio-frequency signal into said buffer at frame intervals and segmenting the stored samples into a plurality of blocks each having an integral multiple of the length of said subblock; a transform encoder for encoding said blocks into respective transform coefficients; a memory for storing said transform coefficients therein; optimum block length determination means for detecting interblock differences between successive transform coefficients of equal block length, squaring each of said interblock differences, summing those squared interblock differences corresponding to equal block length to produce a set of said squared sums for each block length, detecting representative values of the squared sums from successive ones of said sets, detecting a variation between said representative values and identifying a block length corresponding to said variation as an optimum block length; multiplexer means for multiplexing the selected transform coefficients with a signal representative of said optimum block length into a multiplex signal; demultiplexer means for demultiplexing the multiplex signal into said transform coefficients and said block length signal; and a transform decoder coupled to said demultiplexer means for decoding said demultiplexed transform coefficients in a process inverse to said transform encoder at intervals corresponding to the block length indicated by said demultiplexed block length signal.
Claim 21
Dependent Claim
220 words
A data compression system comprising: a buffer; buffer control means for storing subblocks of input digital samples representing an audio-frequency signal into said buffer at frame intervals and segmenting the stored samples into a plurality of blocks each having an integral multiple of the length of said subblock; a transform encoder for encoding said blocks into respective transform coefficients; a memory for storing said transform coefficients therein; optimum block length determination means for detecting interblock differences between successive transform coefficients of equal block length, squaring each of said interblock differences, summing those squared interblock differences corresponding to equal block length to produce a set of said squared sums for each block length, detecting representative values of the squared sums from successive ones of said sets, detecting a variation between said representative values and identifying a block length corresponding to said variation as an optimum block length; multiplexer means for multiplexing the selected transform coefficients with a signal representative of said optimum block length into a multiplex signal; demultiplexer means for demultiplexing the multiplex signal into said transform coefficients and said block length signal; and a transform decoder coupled to said demultiplexer means for decoding said demultiplexed transform coefficients in a process inverse to said transform encoder at intervals corresponding to the block length indicated by said demultiplexed block length signal.
Claim 22
Dependent Claim
218 words
A data compression system comprising: a buffer; buffer control means for storing subblocks of input digital samples representing an audio-frequency signal into said buffer at predetermined intervals and segmenting the stored samples into a plurality of blocks each having an integral multiple of the length of said subblock; a memory for storing said blocks therein; optimum block length determination means for detecting interblock differences between successive blocks of equal block length, squaring each of said interblock differences, summing those squared interblock differences corresponding to equal block length to produce a set of said squared sums for each block length, detecting representative values of the squared sums from successive ones of said sets, detecting a variation between said representative values and identifying a block length corresponding to said variation as an optimum block length; a transform encoder for encoding said selected blocks into respective transform coefficients; multiplexer means for multiplexing the transform coefficients with a signal representative of said optimum block length into a multiplex signal; demultiplexer means for demultiplexing the multiplex signal into said transform coefficients and said block length signal; and a transform decoder coupled to said demultiplexer means for decoding said demultiplexed transform coefficients in a process inverse to said transform encoder at intervals corresponding to the block length indicated by said demultiplexed block length signal.
Claim 23
Dependent Claim
218 words
A data compression system comprising: a buffer; buffer control means for storing subblocks of input digital samples representing an audio-frequency signal into said buffer at predetermined intervals and segmenting the stored samples into a plurality of blocks each having an integral multiple of the length of said subblock; a memory for storing said blocks therein; optimum block length determination means for detecting interblock differences between successive blocks of equal block length, squaring each of said interblock differences, summing those squared interblock differences corresponding to equal block length to produce a set of said squared sums for each block length, detecting representative values of the squared sums from successive ones of said sets, detecting a variation between said representative values and identifying a block length corresponding to said variation as an optimum block length; a transform encoder for encoding said selected blocks into respective transform coefficients; multiplexer means for multiplexing the transform coefficients with a signal representative of said optimum block length into a multiplex signal; demultiplexer means for demultiplexing the multiplex signal into said transform coefficients and said block length signal; and a transform decoder coupled to said demultiplexer means for decoding said demultiplexed transform coefficients in a process inverse to said transform encoder at intervals corresponding to the block length indicated by said demultiplexed block length signal.
Claim 24
Dependent Claim
74 words
A data compression system as claimed in claim 15, 16 or 17, further comprising: means for deriving variances of said blocks respectively and scaling the blocks with the respective variances; and a second memory for storing said variances, wherein said optimum block length determination means selects those of said variances which correspond to said optimum block length, and said multiplexer means multiplexes a signal representative of the selected variance with said selected transform coefficients.
Claim 25
Dependent Claim
57 words
A data compression system as claimed in claim 15, 16 or 17, further comprising means for determining a step size from the selected transform coefficients and means for quantizing said selected transform coefficients according to said step size and causing said multiplexer means to multiplex a signal representative of said step size with the quantized transform coefficients.
Claim 26
Dependent Claim
107 words
A data compression system as claimed in claim 19, wherein said step size determination means comprises means for squaring said selected transform coefficients and taking an average value of a group of the squared transform coefficients of neighboring occurrences as a representative value of said group and causing said multiplexer means to multiplex the selected transform coefficients with a signal representative of said average value as said step size representative signal, means for providing interpolations between successive ones of said squared transform coefficients, deriving said step size from the interpolated squared transform coefficients and applying a signal representative of the derived step size to said quantizer means.
Claim 27
Dependent Claim
107 words
A data compression system as claimed in claim 15, 16 or 17, wherein said buffer control means reads out the samples stored in said buffer and organizes 2 a+b N samples read out of said buffer into (m+1) groups of 2 a blocks of 2 b N samples each, where a + b = m, and a is a variable in a range from m to 0 and b is a variable in a range from 0 to m, and where m is equal to or greater than 2, and N is an integer, each of said groups containing an equal number of samples of same arrivals.
Claim 28
Dependent Claim
78 words
A data compression system as claimed in claim 15, 16 or 17, further comprising a normalizer for deriving respective variances of said blocks, and scaling said blocks according to the respective variances, a second memory for storing said variances therein, wherein said optimum block length determination means selects those variances corresponding to said optimum block length from said second memory, and wherein said multiplexer means multiplexes the selected transform coefficients with a signal representative of the selected variances.
Claim 29
Dependent Claim
81 words
A data compression system as claimed in claim 15, 16 or 17, further comprising means for generating a signal specifying a predetermined block length and means for selecting those of said transform coefficients which correspond to said predetermined block length from said memory and causing said multiplexer means to multiplex the transform coefficients selected as corresponding to said predetermined block length with a signal representative of said predetermined block length instead of with the signal representative of the optimum block length.
Claim 30
Dependent Claim
101 words
A data compression system as claimed in claim 16 or 17, wherein the optimum block length determination means comprises: means for detecting a maximum value of the squared sums from the different sets of each frame interval; and means for comparing between said maximum values detected from a successive pair of said sets so that said compared values correspond respectively to longer and shorter block lengths and selecting one of the compared values as corresponding to said variation if the maximum value of the longer block length has a smaller maximum value than the maximum value of a shorter block length.
Claim 31
Dependent Claim
127 words
A data compression system as claimed in claim 16 or 17, wherein the optimum block length determination means comprises: means for detecting a maximum value of the squared sums from the different sets of each frame interval and deriving a plurality of said maximum values during each frame interval; and means for forming the maximum value derived from each set with the maximum value of an adjacent set into a pair and deriving a plurality of successive pairs from successive frame intervals; means for dividing one of the maximum values of each of said pairs by the other maximum value of the pair and deriving a plurality of ratios from said pairs; and means for detecting a minimum value from said ratios as corresponding to said variation.
Claim 32
Dependent Claim
87 words
A data compression system as claimed in claim 24 or 25, wherein the optimum block length determination means further comprises: means for detecting those of said squared sums from each frame interval which correspond to a minimum block length; means for dividing each of the detected squared sums with the detected squared sum of an adjacent occurrence to produce a plurality of ratios from each frame interval; and means for detecting one of said ratios as corresponding to said variation if said ratio exceeds a prescribed value.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.