Variable length block coding with changing characteristics of input samples

Claim 2

A coding method comprising: a) continuously storing a sequence of input samples representing an audio-frequency signal into a buffer; b) successively detecting a change in characteristics of the input samples of successive groups and forming the input samples of each successive group into one or more blocks of optimum length which is variable in accordance with said detected characteristics change; c) encoding the samples of each successive block into coded symbols at intervals corresponding to the length of each successive block; and d) multiplexing the coded symbols with a signal representative of the length of each successive block into a channel.

Claim 3

A coding method as claimed in claim 1, wherein said coded symbols are linear transform coefficients.

Claim 4

A coding method as claimed in claim 1, further comprising the steps of demultiplexing said coded symbols and said length-indicative signal, and decoding the demultiplexed coded symbols at intervals corresponding to said demultiplexed length-representative signal.

Claim 5

A coding method as claimed in claim 1, further comprising the steps of deriving a variance of the samples of each successive block and scaling said samples with said variance, and multiplexing the variance with said coded symbols into said channel.

Claim 6

A coding method as claimed in claim 2, further comprising the steps of determining a step size from said linear transform coefficients and quantizing said linear transform coefficients according to said step size prior to the step (c), and multiplexing said step size with the quantized linear transform coefficients into said channel.

Claim 7

A coding method as claimed in claim 5, wherein said step size is determined by the steps of squaring said linear transform coefficients and taking an average value of a group of the squared linear transform coefficients of neighboring occurrences as a representative value of said group, multiplexing the linear transform coefficients with said average value, providing interpolations between successive ones of said squared linear transform coefficients, and deriving said step size from the interpolated squared linear transform coefficients.

Claim 8

A coding method as claimed in claim 1, wherein the step (b) comprises the steps of organizing the samples of each successive group into successive blocks of different lengths, and detecting one of said blocks of different lengths corresponding to the detected characteristics change as a block of said optimum length.

Claim 9

A coding method as claimed in claim 7, wherein each of said blocks of different lengths comprises one or more subblocks of N samples each, and wherein each of said blocks of different block lengths contain 2 k N samples, where k is an integer variable in a range from 0 to a predetermined maximum value.

Claim 10

A coding method as claimed in claim 1, wherein the step (c) comprises reading samples stored in said buffer and organizing 2 i+j N samples read out of said buffer into (m+1) groups of 2 i blocks of 2 j N samples each, where i+j=m, and i is a variable in a range from m to 0 and j 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 amount of samples of equal arrivals, and detecting one or more blocks from said (m+1) groups according to the detected characteristics change as a block of said optimum length.

Claim 11

A coding method comprising: a) continuously storing a sequence of input samples representing an audio-frequency signal into a buffer and successively dividing the stored samples into a group of blocks of different lengths; b) encoding the samples of each of said blocks into coded symbols at intervals corresponding to the length of each block; c) decoding each block of said coded symbols into a block of samples in a process inverse to the step (b); d) detecting an error between each block of samples decoded by the step (c) and a corresponding block of samples divided by the step (a); e) repeating the steps (a) to (d) to derive a plurality of errors from each group of blocks of input samples; f) detecting a minimum value of said errors and identifying one of the blocks of the coded symbols encoded by the step (b) which corresponds to said minimum value as having an optimum block length; and g) multiplexing the coded symbols of the optimum block length with a signal indicating the optimum block length into a channel.

Claim 12

A coding method comprising: a) continuously storing a sequence of input samples representing an audio-frequency signal into a buffer and successively dividing the stored samples into a group of blocks of different lengths; b) encoding the samples of each of said blocks into coded symbols at intervals corresponding to the length of each block; c) decoding each block of said coded symbols into a block of samples in a process inverse to the step (b); d) detecting an error between each block of samples decoded by the step (c) and a corresponding block of samples divided by the step (a); e) repeating the steps (a) to (d) to derive a plurality of errors from each group of blocks of input samples; f) detecting a minimum value of said errors and identifying one of the blocks of the coded symbols encoded by the step (b) which corresponds to said minimum value as having an optimum block length; and g) multiplexing the coded symbols of the optimum block length with a signal indicating the optimum block length into a channel.

Claim 13

A coding method as claimed in claim 10, wherein said coded symbols are linear transform coefficients.

Claim 14

A coding method as claimed in claim 10, further comprising the steps of deriving a variance of said samples from said buffer and scaling said samples with said variance prior to the step (b), and multiplexing the variance which is derived from samples of said optimum block length with said coded symbols.

Claim 15

A coding method as claimed in claim 12, further comprising the steps of determining a step size from said linear transform coefficients and quantizing said linear transform coefficients according to said step size prior to the step (b), and multiplexing said step size with the quantized linear transform coefficients.

Claim 16

A coding method as claimed in claim 13, wherein said step size is determined by the steps of squaring said linear transform coefficients and taking an average value of a group of the squared linear transform coefficients of neighboring occurrences as a representative value of said group, multiplexing the linear transform coefficients of the optimum block length with the average value which is derived from the linear transform coefficients of said optimum block length, providing interpolations between successive ones of said squared linear transform coefficients, and deriving said step size from the interpolated squared linear transform coefficients.

Claim 17

A coding method as claimed in claim 13, further comprising the step of dequantizing the quantized linear transform coefficients according to said step size prior to the step (c).

Claim 18

A coding method as claimed in claim 10, wherein the step (a) comprises the steps of: a1) detecting when samples of a maximum of said different block lengths are stored in said buffer; a2) organizing the samples of the maximum block length detected by the step (a1) into a sequence of samples of different block lengths, wherein the length of each successive block being a multiple of the block of a minimum block length; a3) discarding samples of earlier arrivals from said buffer by an amount equal to the number of samples contained in said optimum block length; and a4) repeating the steps (a1) to (a3).

Claim 19

A coding method as claimed in claim 10, wherein the step (a) comprises the steps of: a1) detecting when the samples stored in said buffer successively reach thresholds of increasing values corresponding respectively to said different block lengths; a2) retrieving samples corresponding in number to the detected threshold from said buffer; a3) discarding samples of earlier arrivals from said buffer by an amount equal to the number of samples contained in said optimum block length; a4) detecting whether the number of samples remaining in said buffer is greater than a lowest of said thresholds or equal to the lowest threshold; a5) if said remaining samples are detected as being greater than said lowest threshold, successively retrieving different block lengths of the remaining samples from said buffer; a6) if said remaining samples are detected as being equal to said lowest threshold, retrieving said remaining samples from said buffer; and a7) repeating the steps (a1) to (a6).

Claim 20

A coding method as claimed in claim 10, wherein the step (a) comprises reading samples stored in said buffer and organizing 2 i+j N samples read out of said buffer into (m+1) groups of 2 i blocks of 2 j N samples each, where i+j=m, and i is a variable in a range from m to 0 and j 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 amount of samples of equal arrivals.

Claim 21

A coding method as claimed in claim 18, wherein the step (a) comprises the steps of: a1) detecting when samples in said buffer successively reach thresholds of increasing values corresponding respectively to an integral multiple of a subblock which equally divides each block; a2) dividing the samples in said buffer upon detection by the step (a1) into 2 j N samples and retrieving each of the divided N samples from said buffer; a3) repeating the steps (a1) and (a2) until 2 i+j N samples are stored in said buffer to produce a sequence of output samples so that said output samples contains (m+1) groups of 2 i blocks of 2 j N samples; a4) clearing the contents of said buffer when said sequence of output samples is retrieved from said buffer; and a5) repeating the steps (a1) to (a4).

Claim 22

A coding method as claimed in claim 18, wherein the step (d) comprises: d1) detecting an error from each block of m of said (m+1) groups by excluding a group which contains one block of 2 m N samples to produce m average errors; and d2) detecting a minimum of errors from said m average errors and the error derived from said excluded group.

Claim 23

A coding method as claimed in claim 10, further comprising the steps of receiving a multiplexed signal through said channel, demultiplexing the multiplexed signal into said coded symbols and said optimum length signal, and decoding said demultiplexed coded symbols at intervals corresponding to said optimum length signal.

Claim 24

A communications system comprising: a buffer; buffer control means for continuously storing a sequence of input samples representing an audio-frequency signal into said buffer; optimum length determination means for successively detecting a change in characteristics of the stored input samples of successive groups and forming the input samples of each successive group into one or more blocks of optimum length which is variable in accordance with said detected characteristics change; encoder means for encoding the samples of each successive block into coded symbols at intervals corresponding to the length of each successive block; multiplexer means for multiplexing the coded symbols with a signal representative of the length of each successive block into a channel; demultiplexer means for receiving a multiplexed signal through said channel and decomposing the multiplexed signal into said coded symbols and said length-representative signal; and decoder means coupled to said demultiplexer means for decoding said demultiplexed coded symbols at intervals corresponding to the length indicated by the demultiplexed length-representative signal.

Claim 25

A communications system comprising: a buffer; buffer control means for continuously storing a sequence of input samples representing an audio-frequency signal into said buffer; optimum length determination means for successively detecting a change in characteristics of the stored input samples of successive groups and forming the input samples of each successive group into one or more blocks of optimum length which is variable in accordance with said detected characteristics change; encoder means for encoding the samples of each successive block into coded symbols at intervals corresponding to the length of each successive block; multiplexer means for multiplexing the coded symbols with a signal representative of the length of each successive block into a channel; demultiplexer means for receiving a multiplexed signal through said channel and decomposing the multiplexed signal into said coded symbols and said length-representative signal; and decoder means coupled to said demultiplexer means for decoding said demultiplexed coded symbols at intervals corresponding to the length indicated by the demultiplexed length-representative signal.

Claim 26

A communications system as claimed in claim 22, wherein said coded symbols are linear transform coefficients.

Claim 27

A communications system as claimed in claim 22, further comprising means for deriving a variance of the samples of each successive block and scaling said samples with said variance, and causing said multiplexer means to multiplex the variance with said coded symbols into said channel.

Claim 28

A communications system as claimed in claim 23, further comprising means for determining a step size from said linear transform coefficients and means quantizing said linear transform coefficients according to said step size and causing said multiplexer means to multiplex said step size with the quantized linear transform coefficients into said channel.

Claim 29

A communications system as claimed in claim 25, further comprising means for squaring said linear transform coefficients and taking an average value of a group of the squared linear transform coefficients of neighboring occurrences as a representative value of said group, causing said multiplexer means to multiplex the linear transform coefficients with said average value, providing interpolations between successive ones of said squared linear transform coefficients, and deriving said step size from the interpolated squared linear transform coefficients.

Claim 30

A communications system as claimed in claim 1, wherein said optimum length determination means comprises means for organizing the samples of each successive groups into successive blocks of different lengths, and detecting one of said blocks of different lengths corresponding to the detected characteristics change as a block of said optimum length.

Claim 31

A communications system as claimed in claim 27, wherein each of said blocks of different lengths comprises one or more subblocks, and wherein said blocks of different block lengths contain 2 k N samples, where k is an integer variable in a range from 0 to a predetermined maximum value and N is an integer representing the number of samples contained in each of said subblocks.

Claim 32

A communications system as claimed in claim 1, wherein optimum length determination means comprises means for reading samples stored in said buffer and organizing 2 i+j N samples read out of said buffer into (m+1) groups of 2 i blocks of 2 j N samples each, where i+j=m, and i is a variable in a range from m to 0 and j 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 amount of samples of equal arrivals, and detecting one or more blocks from said (m+1) groups according to the detected characteristics change as a block of said optimum length.

Claim 33

A communications system comprising: a buffer; buffer control means for storing audio-frequency digital samples into said buffer and reading the stored samples from said buffer to produce a sequence of blocks of samples, said blocks having different block lengths; encoder means for encoding the samples of each of said blocks into coded symbols at intervals corresponding to the length of each block; first decoder means coupled to said encoder means for decoding said coded symbols into decoded samples in a process inverse to said encoder means; error detector means for detecting an error between each block of the decoded samples from said decoder means and a corresponding block of samples from said buffer; a memory for storing errors detected by said error detector means from said sequence of blocks of samples; minimum detector means for detecting a minimum value of errors in said memory and generating a signal identifying one of the blocks of the coded symbols which corresponds to said minimum value as having an optimum block length; multiplexer means for multiplexing the coded symbols of the optimum block length with said optimum length signal into a channel; demultiplexer means for receiving a multiplexed signal through said channel and decomposing the multiplexed signal into said coded symbols and said optimum length signal; and second decoder means coupled to said demultiplexer means for decoding said demultiplexed coded symbols at intervals corresponding to the optimum length indicated by the demultiplexed optimum length signal.

Claim 34

A communications system comprising: a buffer; buffer control means for storing audio-frequency digital samples into said buffer and reading the stored samples from said buffer to produce a sequence of blocks of samples, said blocks having different block lengths; encoder means for encoding the samples of each of said blocks into coded symbols at intervals corresponding to the length of each block; first decoder means coupled to said encoder means for decoding said coded symbols into decoded samples in a process inverse to said encoder means; error detector means for detecting an error between each block of the decoded samples from said decoder means and a corresponding block of samples from said buffer; a memory for storing errors detected by said error detector means from said sequence of blocks of samples; minimum detector means for detecting a minimum value of errors in said memory and generating a signal identifying one of the blocks of the coded symbols which corresponds to said minimum value as having an optimum block length; multiplexer means for multiplexing the coded symbols of the optimum block length with said optimum length signal into a channel; demultiplexer means for receiving a multiplexed signal through said channel and decomposing the multiplexed signal into said coded symbols and said optimum length signal; and second decoder means coupled to said demultiplexer means for decoding said demultiplexed coded symbols at intervals corresponding to the optimum length indicated by the demultiplexed optimum length signal.

Claim 35

A communications system as claimed in claim 30, wherein said encoder means comprises a linear transform coder and each of said first and second decoder means comprises an inverse linear transform coder.

Claim 36

A communications system as claimed in claim 30, wherein the buffer control means comprises: detector means for detecting when samples of a maximum of said different block lengths are stored in said buffer; and means for organizing the samples of the maximum block length detected by the detector means into a sequence of samples of different block lengths such that the length of each successive is a multiple of the block of a minimum block length, and discarding samples of earlier arrivals from said buffer by an amount equal to the number of samples contained in said optimum block length.

Claim 37

A communications system as claimed in claim 30, wherein the buffer control means comprises: detector means for detecting when the samples stored in said buffer successively reach thresholds of increasing values corresponding respectively to said different block lengths; means for retrieving samples from said buffer in number corresponding to the detected threshold and discarding samples from said buffer by an amount equal to the number of samples contained in said optimum block length; control means for detecting whether the number of samples remaining in said buffer is greater than a lowest of said thresholds or equal to the lowest threshold; and means for successively retrieving the remaining samples of different block lengths from said buffer if said remaining samples are detected as being greater than said lowest threshold, and retrieving the remaining samples from said buffer if said remaining samples are detected as being equal to said lowest threshold.

Claim 38

A communication system as claimed in claim 30, wherein the buffer control means comprises means for reading samples stored in said buffer so that 2 i+j N samples read out of the buffer are organized into (m+1) groups of 2 i blocks of 2 j N samples each, where i+j=m, and i is a variable in a range from m to 0 and j 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 amount of samples of equal arrivals.

Claim 39

A communications system as claimed in claim 34, wherein the buffer control means comprises: means for detecting when samples in said buffer successively reach thresholds of increasing values corresponding respectively to an integral multiple of a subblock which equally divides each block; means for dividing samples in said buffer upon detection by the step (a1) into 2 j N samples and retrieving each of the divided N samples from said buffer until 2 i+j N samples are stored in said buffer to form a sequence of samples comprising (m+1) groups of 2 i blocks of 2 j N samples each.

Claim 40

A communications as claimed in claim 34, wherein said error detector means generates an error from each of said blocks of said (m+1) groups, further comprising means for deriving an average value of the errors derived from m of said (m+1) groups to produce m average errors by excluding a group which contains one block of 2 m N samples, wherein said minimum detector means detects a minimum of errors from said m average errors and the error derived from said excluded group.

Claim 41

A communications system as claimed in claim 30, further comprising means for generating a signal representative of a variance of samples supplied from said buffer and scaling said samples with said variance signal and applying the scaled samples to said encoder means and to said error detector means.

Claim 42

A communications system as claimed in claim 30, further comprising: means for deriving a quantization step size from said linear transform coefficients and generating a signal representative of the step size; quantizer means for quantizing said linear transform coefficients according to said quantization step size and dequantizer means; and dequantizer means for dequantizing said quantized linear transform coefficients according to said quantization step size and applying the dequantized linear transform coefficients to said first decoder means, wherein said multiplexer means multiplexes said step-size representative signal with the quantized linear transform coefficients.

Claim 43

A communications system as claimed in claim 37, wherein said step size is determined by a bit assignment circuit which squares said linear transform coefficients, takes an average value of a group of the squared linear transform coefficients of neighboring occurrences as a representative value of said group, and provides interpolations between successive ones of said squared linear transform coefficients, and derives said step size from the interpolated squared linear transform coefficients, wherein said multiplexer means multiplexes the linear transform coefficients of the optimum block length with a signal representative of the average value which is derived from the linear transform coefficients of said optimum block length.

Claim 44

A communications system as claimed in claim 37, further comprising quantizer means for dequantizing the quantized linear transform coefficients according to said step size and applying the dequantized transform coefficients to said first decoder means.

Claim 45

A communications system as claimed in claim 36, wherein said demultiplexer means derives said variance signal from said channel, further comprising means for scaling samples decoded by said second decoder means inversely as a function of said variance signal derived by the demultiplexer means.

Claim 46

A communications system as claimed in claim 37, wherein said demultiplexer means derives said average signal from said channel, further comprising: interpolator means for providing interpolations between successive ones of said average signal derived by said demultiplexer means; means for deriving an optimum step size from an output signal of said interpolator means; and second dequantizer means coupled to said demultiplexer means for dequantizing said demultiplexed quantized linear transform coefficients according to said optimum step size.