← Back to Patent Explorer
US5579430A Expired / Lapsed US ⏱️ 0.0 years remaining

Digital encoding process

Assignee: Fraunhofer-Gesellschaft zur Förderung der Angewandten Forschung eV
•
Filing: 1995-01-26
•
Granted: 1996-11-26
•
Expires: 2015-01-26
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A digital encoding process for transmitting and/or storing acoustical signals and, in particular, music signals, in which scanned values of the acoustical signal are transformed by means of a transformation or a filter bank into a sequence of second scanned values, which reproduce the spectral composition of the acoustical signal, and the sequence of second scanned values is quantized in accordance with the requirements with varying precision and is partially or entirely encoded by an optimum encoder, and in which a corresponding decoding and inverse transformation takes place during the reproduction. An encoder is utilized in a manner in which the occurrence probability of the quantized spectral coefficient is correlated to the length of the code in such a way that the more frequently the spectral coefficient occurs, the shorter the code word. A code word and, if needed, a supplementary code is allocated to several elements of the sequence or to a value range in order to reduce the size of the table of the encoder. A portion of the code words of variable length are arranged in a raster, and the remaining code words are distributed in the gaps still left so that the beginning of a code word can be more easily found without completely decoding or in the event of faulty transmission.

Inventors

  • 👤 Bernhard Grill
  • 👤 Karl-Heinz Brandenburg
  • 👤 Thomas Sporer
  • 👤 Bernd Kurten
  • 👤 Ernst Eberlein

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 01:00
CPC Classifications
H; H03; H03M; H03M7/00; H03M7/30; H03M7/3053; H03M7/40; H03M7/42

Claims Analysis

Total Claims: 36
Claim 1
Independent Claim 204 words
A digital coding process for at least one of transmitting and storing acoustical signals, the process comprising the steps of: sampling an acoustical signal to obtain samples; transforming the samples of said acoustical signal using a transform/filter bank into a sequence of second samples to thereby reproduce a spectral composition of said acoustical signal; quantizing said sequence of second samples in accordance with the requirements with varying precision; at least partially coding said sequence of second samples using an optimum encoder, and in which a corresponding decoding and inverse transformation takes place during reproduction of the acoustical signal; correlating the occurrence probability of the quantized spectral coefficient to the length of the code utilizing a code in such a way that the more frequently said spectral coefficient occurs, the shorter the code word; and allocating a code word to several elements of said sequence or to a value range to thereby reduce the size of the table of said encoder; wherein the allocating step further comprising the steps of: directly assigning a code word to only one part of the value range of an element of said sequence; and assigning all values lying outside said partial range a common identifier and a special code.
Claim 2
Dependent Claim 204 words
A digital coding process for at least one of transmitting and storing acoustical signals, the process comprising the steps of: sampling an acoustical signal to obtain samples; transforming the samples of said acoustical signal using a transform/filter bank into a sequence of second samples to thereby reproduce a spectral composition of said acoustical signal; quantizing said sequence of second samples in accordance with the requirements with varying precision; at least partially coding said sequence of second samples using an optimum encoder, and in which a corresponding decoding and inverse transformation takes place during reproduction of the acoustical signal; correlating the occurrence probability of the quantized spectral coefficient to the length of the code utilizing a code in such a way that the more frequently said spectral coefficient occurs, the shorter the code word; and allocating a code word to several elements of said sequence or to a value range to thereby reduce the size of the table of said encoder; wherein the allocating step further comprising the steps of: directly assigning a code word to only one part of the value range of an element of said sequence; and assigning all values lying outside said partial range a common identifier and a special code.
Claim 3
Dependent Claim 16 words
A coding process according to claim 1, wherein a Huffman code is utilized as said encoder.
Claim 4
Dependent Claim 18 words
A coding process according to claim 2, wherein said special code is carried out using a PCM code.
Claim 5
Dependent Claim 41 words
A coding process according to claim 1, further comprising the step of: combining n spectral coefficients with n being greater than or equal to 2 up to a n-tupel; and encoding together the n spectral coefficients by assigning a code word.
Claim 6
Dependent Claim 41 words
A coding process according to claim 4, wherein the spectral coefficients of successive blocks, in particular, having the same number are combined from successive blocks to form a pair, respectively an n-tupel, and are encoded together by assigning a code word.
Claim 7
Dependent Claim 68 words
A coding process operating in accordance with an optimum coding in a frequency domain (OCF) process according to claim 1, wherein an overall amplification factor which forms side information that is transmitted to a receiver is calculated from the values of the number of iterations for an initial quantization step level, from a value for the non-uniformity of the spectrum, and from other level information from the calculation.
Claim 8
Dependent Claim 37 words
A coding process according to claim 6, further comprising the steps of: gathering and transmitting together side information on changes in the quantization step in order to stay within a permissible disturbance for more than one block.
Claim 9
Dependent Claim 20 words
A coding process according to claim 7, wherein the encoding of said side information occurs with a variable length code.
Claim 10
Dependent Claim 39 words
A coding process according to claim 1, further comprising the steps of: utilizing different code tables depending on the sequence; transmitting the number of the utilized code tables; and storing or transmitting the number together with the encoded values.
Claim 11
Dependent Claim 32 words
A coding process according to claim 9, further comprising the steps of: utilizing different code tables for different spectral ranges; and setting borders between the different spectral ranges dependent upon the signal.
Claim 12
Dependent Claim 80 words
A coding process according to claim 10, wherein a table is utilized for decoding, in which pairs of values are stored, of which the first value of the pair contains an address which is the next pointer into the table in case a "0" has been decoded, the second value of said pair contains the next pointer into the table in case a "1" has been decoded and entries flagged not to contain an address contain the target codeword itself.
Claim 13
Dependent Claim 43 words
A coding process according to claim 1, further comprising the steps of: transmitting, in order to determine the beginning of a next block of information in the event of a transmission error, a block commencement mark and a length of an entropy code.
Claim 14
Dependent Claim 30 words
A coding process according to claim 1, further comprising the step of adapting quantization and reconstruction to each other in such a manner that the mean quantization error is minimized.
Claim 15
Dependent Claim 37 words
A coding process according to claim 13, wherein the calculation of the reconstruction values takes place in a receiver using a table, which was compiled by determining expectancy value of the input values of a quantization interval.
Claim 16
Dependent Claim 33 words
A coding process according to claim 13, wherein said quantization takes place via a table, which was calculated from the characteristic curve of the reconstruction and the probability distribution of the input data.
Claim 17
Dependent Claim 50 words
A coding process according to claim 13, wherein, for reconstructing by means of the characteristics curve of a quantization and a probability distribution of the input data, a reconstruction value is calculated in a decoder for each individual quantized value in such a manner that the quantization error is minimized.
Claim 18
Dependent Claim 28 words
A process according to claim 1 further comprising the step of reproducing the stored signal using a corresponding decoding and a reverse transformation or a reverse filter bank.
Claim 19
Dependent Claim 209 words
A digital coding process for at least one of transmitting and storing acoustical signals, the process comprising the steps of: sampling an acoustical signal to obtain samples; transforming the samples of said acoustical signal using a transform/filter bank into a sequence of second samples to thereby reproduce a spectral composition of said acoustical signal; quantizing said sequence of second samples in accordance with the requirements with varying precision; at least partially encoding said sequence of second samples using an optimum encoder, and in which a corresponding decoding and inverse transformation takes place during reproduction of the acoustical signal; arranging one part of the variable length code words in a raster, and distributing the remaining code words in the remaining gaps so that the beginning of a code word is more easily found; wherein the process further comprises the steps of: utilizing an equidistant raster in order to improve reliability of a transmission of continuously successive information of varying degrees of importance, a raster length of which corresponds to a mean length of the information to be transmitted; arranging most important portions of said information in the raster; and transmitting a position of less important information in said raster in addition to said most important portions of information if necessary.
Claim 20
Dependent Claim 209 words
A digital coding process for at least one of transmitting and storing acoustical signals, the process comprising the steps of: sampling an acoustical signal to obtain samples; transforming the samples of said acoustical signal using a transform/filter bank into a sequence of second samples to thereby reproduce a spectral composition of said acoustical signal; quantizing said sequence of second samples in accordance with the requirements with varying precision; at least partially encoding said sequence of second samples using an optimum encoder, and in which a corresponding decoding and inverse transformation takes place during reproduction of the acoustical signal; arranging one part of the variable length code words in a raster, and distributing the remaining code words in the remaining gaps so that the beginning of a code word is more easily found; wherein the process further comprises the steps of: utilizing an equidistant raster in order to improve reliability of a transmission of continuously successive information of varying degrees of importance, a raster length of which corresponds to a mean length of the information to be transmitted; arranging most important portions of said information in the raster; and transmitting a position of less important information in said raster in addition to said most important portions of information if necessary.
Claim 21
Dependent Claim 207 words
A digital coding process for at least one transmitting and storing acoustical signals, the process comprising the steps of: sampling an acoustical signal to obtain scanned values; transforming the samples of said acoustical signal using a transform/filter bank into a sequence of second samples to thereby reproduce a spectral composition of said acoustical signal; quantizing said sequence of second samples in accordance with the requirements with varying precision; at least partially encoding said sequence of second samples using an optimum encoder, and in which a corresponding decoding and inverse transformation takes place during reproduction of the acoustical signal; and wherein the sequence of second samples are divided into data blocks corresponding to time periods of a given length, and further comprising calculating a permissible disturbance of the data blocks by using a time period which is one of: 1) longer than the given length; and 2) a function of results of previous time periods; and wherein, in order to calculate said permissible disturbance for a block, an analysis of the signal is conducted in different frequency groups, and respective values of a preceding block, which have been corrected by an omission factor, and values of the current block, are both drawn upon for calculating said permissible disturbance.
Claim 22
Dependent Claim 207 words
A digital coding process for at least one transmitting and storing acoustical signals, the process comprising the steps of: sampling an acoustical signal to obtain scanned values; transforming the samples of said acoustical signal using a transform/filter bank into a sequence of second samples to thereby reproduce a spectral composition of said acoustical signal; quantizing said sequence of second samples in accordance with the requirements with varying precision; at least partially encoding said sequence of second samples using an optimum encoder, and in which a corresponding decoding and inverse transformation takes place during reproduction of the acoustical signal; and wherein the sequence of second samples are divided into data blocks corresponding to time periods of a given length, and further comprising calculating a permissible disturbance of the data blocks by using a time period which is one of: 1) longer than the given length; and 2) a function of results of previous time periods; and wherein, in order to calculate said permissible disturbance for a block, an analysis of the signal is conducted in different frequency groups, and respective values of a preceding block, which have been corrected by an omission factor, and values of the current block, are both drawn upon for calculating said permissible disturbance.
Claim 23
Dependent Claim 44 words
A coding process according to claim 19, wherein, in order to calculate said permissible disturbance for a block, energy values of the last block are utilized in such a manner that values of lower amplitude following values of higher amplitude require less precise quantization.
Claim 24
Dependent Claim 32 words
A coding process according to claim 19, wherein if a sharp rise in energy toward high frequencies is detected, the calculated permissible disturbance is reduced for a frequency group below the rise.
Claim 25
Dependent Claim 202 words
A digital coding process for at least one of transmitting and storing acoustical signals, the process comprising the steps of: sampling an acoustical signal to obtain samples; transforming the samples of said acoustical signal using a transform/filter bank into a sequence of second samples to thereby reproduce a spectral composition of said acoustical signal; quantizing said sequence of second samples in accordance with the requirements with varying precision; at least partially encoding said sequence of second samples using an optimum encoder, and in which a corresponding decoding and inverse transformation takes place during reproduction of the acoustical signal; and wherein, although a constant data rate is maintained, the number of bits for use by a block may deviate from an average data rate depending on the signal characteristics, on the capacity of the transmission channel, or in order to simplify the encoding; and wherein a number of bits at disposal for encoding a data block is altered contingent on the signal characteristics in such a manner, that on the average a constant data rate is maintained, and the deviation of sums from this mean value is not higher than a specific previously fixed value and not less than another previously fixed value.
Claim 26
Dependent Claim 202 words
A digital coding process for at least one of transmitting and storing acoustical signals, the process comprising the steps of: sampling an acoustical signal to obtain samples; transforming the samples of said acoustical signal using a transform/filter bank into a sequence of second samples to thereby reproduce a spectral composition of said acoustical signal; quantizing said sequence of second samples in accordance with the requirements with varying precision; at least partially encoding said sequence of second samples using an optimum encoder, and in which a corresponding decoding and inverse transformation takes place during reproduction of the acoustical signal; and wherein, although a constant data rate is maintained, the number of bits for use by a block may deviate from an average data rate depending on the signal characteristics, on the capacity of the transmission channel, or in order to simplify the encoding; and wherein a number of bits at disposal for encoding a data block is altered contingent on the signal characteristics in such a manner, that on the average a constant data rate is maintained, and the deviation of sums from this mean value is not higher than a specific previously fixed value and not less than another previously fixed value.
Claim 27
Dependent Claim 28 words
A process according to claim 19 further comprising the step of reproducing the stored signal using a corresponding decoding and a reverse transformation or a reverse filter bank.
Claim 28
Dependent Claim 48 words
A coding process according to claim 22, wherein in order to synchronize coding processes having a random ratio of input to output bit timing, a load level of a buffer read out with an output bit timing is used to determine the number of bits to be allocated.
Claim 29
Dependent Claim 70 words
A coding process according to claim 24, wherein a number of bits at disposal for encoding a data block is altered contingent on the signal characteristics in such a manner that signal blocks having a greater distance between the signal energy in the individual frequency groups and the respective permissible disturbance are given a greater number of bits (current data rate) at disposal than signal blocks having a smaller distance.
Claim 30
Dependent Claim 32 words
A coding process according to claim 25, wherein the number of bits transmitted on the same channel required by the side information is subtracted from the bits at disposal for a block.
Claim 31
Dependent Claim 49 words
A coding process according to claim 26, wherein, if a special bit combination is employed for a synchronizing word for block synchronization, said synchronizing word and all bit combinations, which by chance are identical to the synchronizing word, are distinguished from one another with an intentionally added supplementary bit.
Claim 32
Dependent Claim 23 words
A coding process according to claim 25, wherein any ranges, in which said permissible disturbance is greater than said signal energy, are deleted.
Claim 33
Dependent Claim 23 words
A coding process according to claim 28, wherein a resulting sequence of deleted values is encoded with a bit in the side information.
Claim 34
Dependent Claim 35 words
A coding process according to claim 29, wherein said resulting sequence of deleted values is encoded in said side information with a value in the table of possible quantization step levels for each frequency group.
Claim 35
Dependent Claim 31 words
A coding process according to claim 22, wherein an outer iteration loop is interrupted in the event an inner loop cannot be ended with certainty within the maximum number of iterations.
Claim 36
Dependent Claim 28 words
A process according to claim 22 further comprising the step of reproducing the stored signal using a corresponding decoding and a reverse transformation or a reverse filter bank.

References Cited (Backward Citations)

US4270025A Cited
US4972484A Cited
US4815134A Cited
US4813056A Cited
US4942467A Cited
US5341457A Cited
US5222189A Cited
US5031038A Cited
US5136613A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-11-26 2000-05-27 2000-11-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-11-26 2004-05-27 2004-11-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-11-26 2008-05-27 2008-11-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag