Patents by Inventor Ralph Sperschneider

Ralph Sperschneider has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7788106
    Abstract: The present invention is based on the finding that an efficient code for encoding information values can be derived, when two or more information values are grouped in a tuple in a tuple order and when an encoding rule is used, that assigns the same code word to tuples having identical information values in different orders and that does derive an order information, indicating the tuple order, and when the code word is output in association with the order information.
    Type: Grant
    Filed: October 14, 2005
    Date of Patent: August 31, 2010
    Assignee: Fraunhofer-Gesellschaft zur Foerderung der Angewandten Forschung E.V.
    Inventors: Ralph Sperschneider, Jürgen Herre, Karsten Linzmeier, Johannes Hilpert
  • Publication number: 20100014692
    Abstract: An apparatus for generating at least one audio output signal representing a superposition of at least two different audio objects comprises a processor for processing an audio input signal to provide an object representation of the audio input signal, where this object representation can be generated by a parametrically guided approximation of original objects using an object downmix signal. An object manipulator individually manipulates objects using audio object based metadata referring to the individual audio objects to obtain manipulated audio objects. The manipulated audio objects are mixed using an object mixer for finally obtaining an audio output signal having one or several channel signals depending on a specific rendering setup.
    Type: Application
    Filed: October 9, 2008
    Publication date: January 21, 2010
    Applicant: Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V.
    Inventors: Stephan SCHREINER, Wolfgang FIESEL, Matthias NEUSINGER, Oliver HELLMUTH, Ralph SPERSCHNEIDER
  • Patent number: 7526432
    Abstract: An entropy encoder includes an apparatus for producing a data stream which comprises two reference points, of code words of variable lengths, the apparatus comprising a first device for writing at least a part of a code word into the data stream in a first direction of writing, starting from a first reference point, and a second device for writing at least a part of a code word into the data stream in a second direction of writing, which is opposite to the first direction of writing, starting from the other reference point. In particular, when a raster having a plurality of segments is used to write the code words of variable lengths into the data stream, the number of the code words which can be written starting at raster points is doubled, in the best case, such that the data stream of code words of variable lengths is robust toward a propagation of sequence errors.
    Type: Grant
    Filed: January 22, 2008
    Date of Patent: April 28, 2009
    Assignee: Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V.
    Inventors: Ralph Sperschneider, Martin Dietz, Daniel Homm, Reinhold Böhm
  • Patent number: 7516230
    Abstract: In a method for generating a scalable data stream, when a block of output data of a first encoder is present, this block of output data is written into the scalable data stream. If output data of a second encoder is present for a preceding period of time, this output data for the preceding section is written in transmission direction behind the block of output data of the first encoder into the data stream. When the output data of the scalable encoder for the current section is present, the output data of the second encoder is written into the bit stream subsequent to the output data of the first encoder. A determining data block is generated and written into the bit stream delayed by a period of time which corresponds to the size of the bit savings bank of the second encoder.
    Type: Grant
    Filed: January 14, 2002
    Date of Patent: April 7, 2009
    Assignee: Fraunhofer-Gesellschaft zur Foerderung der Angewandten Forschung e.v.
    Inventors: Ralph Sperschneider, Bodo Teichmann, Manfred Lutzky, Bernhard Grill
  • Patent number: 7496517
    Abstract: In a method for generating a scalable data stream from one or several blocks of output data of a first encoder and from one or several blocks of output data of a second encoder a determining data block for a current section of an input signal is written. In addition, output data of the second encoder representing a preceding section of the input signal are written in transmission direction from an encoder to a decoder after the determining data block. When the output data of the second encoder are written for a preceding section of the input signal, the output data of the second encoder are written representing the current section of the input signal. In order to signalize where the output data of the second encoder for the preceding section end and where the output data of the second encoder for the current section begin, buffer information is written into the scalable data stream.
    Type: Grant
    Filed: January 14, 2002
    Date of Patent: February 24, 2009
    Assignee: Fraunhofer-Gesellschaft zur Foerderung der Angewandten Forschung E.V.
    Inventors: Ralph Sperschneider, Bodo Teichmann, Manfred Lutzky, Bernhard Grill
  • Patent number: 7454353
    Abstract: In a method of producing a scalable data stream of at least two blocks of output data of a first coder and a block of output data of a second coder, wherein the at least two blocks of output data of the first coder together represent a current section of an input signal in the first coder, and wherein the block of output data of the second coder represents the same current section of the input signal, a determination data block for the current section of the input signal is written. In addition, the block of output data of the second coder, in the direction of transfer from a coding device to a decoding device, is written after the determination data block for the current section of the input signal.
    Type: Grant
    Filed: January 14, 2002
    Date of Patent: November 18, 2008
    Assignee: Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V.
    Inventors: Ralph Sperschneider, Bodo Teichmann, Manfred Lutzky, Bernhard Grill
  • Patent number: 7433825
    Abstract: An entropy encoder includes an apparatus for producing a data stream which comprises two reference points, of code words of variable lengths, the apparatus comprising a first device for writing at least a part of a code word into the data stream in a first direction of writing, starting from a first reference point, and a second device for writing at least a part of a code word into the data stream in a second direction of writing, which is opposite to the first direction of writing, starting from the other reference point. In particular, when a raster having a plurality of segments is used to write the code words of variable lengths into the data stream, the number of the code words which can be written starting at raster points is doubled, in the best case, such that the data stream of code words of variable lengths is robust toward a propagation of sequence errors.
    Type: Grant
    Filed: January 17, 2000
    Date of Patent: October 7, 2008
    Assignee: Fraunhofer-Gesellschaft zur Foerderling der Angewandten Forschung E.V.
    Inventors: Ralph Sperschneider, Martin Dietz, Daniel Homm, Reinhold Böhm
  • Patent number: 7428684
    Abstract: A device for concealing an error in an erroneous or potentially erroneous information unit generates output values of a forward decoder and a backward decoder which differ and thus indicate an error-concealment area. The different values for one and the same information unit are examined with regard to a predetermined criterion so as to select that value which meets the predetermined criterion, i.e. which is plausible. Thus, an elimination or reduction of the continuation errors introduced in the decoding of blocks of reversible code words of variable lengths is achieved without impacting the compression rate.
    Type: Grant
    Filed: October 29, 2004
    Date of Patent: September 23, 2008
    Assignee: Fraunhofer-Gesellschaft Zur Forderung der Angewandten Forschung E.V.
    Inventors: Daniel Homm, Ralph Sperschneider
  • Publication number: 20080219355
    Abstract: An entropy encoder includes an apparatus for producing a data stream which comprises two reference points, of code words of variable lengths, the apparatus comprising a first device for writing at least a part of a code word into the data stream in a first direction of writing, starting from a first reference point, and a second device for writing at least a part of a code word into the data stream in a second direction of writing, which is opposite to the first direction of writing, starting from the other reference point. In particular, when a raster having a plurality of segments is used to write the code words of variable lengths into the data stream, the number of the code words which can be written starting at raster points is doubled, in the best case, such that the data stream of code words of variable lengths is robust toward a propagation of sequence errors.
    Type: Application
    Filed: May 21, 2008
    Publication date: September 11, 2008
    Inventors: Ralph SPERSCHNEIDER, Martin Dietz, Daniel Homm, Reinhold Bohm
  • Publication number: 20080111719
    Abstract: An entropy encoder includes an apparatus for producing a data stream which comprises two reference points, of code words of variable lengths, the apparatus comprising a first device for writing at least a part of a code word into the data stream in a first direction of writing, starting from a first reference point, and a second device for writing at least a part of a code word into the data stream in a second direction of writing, which is opposite to the first direction of writing, starting from the other reference point. In particular, when a raster having a plurality of segments is used to write the code words of variable lengths into the data stream, the number of the code words which can be written starting at raster points is doubled, in the best case, such that the data stream of code words of variable lengths is robust toward a propagation of sequence errors.
    Type: Application
    Filed: January 22, 2008
    Publication date: May 15, 2008
    Inventors: Ralph SPERSCHNEIDER, Martin Dietz, Daniel Homm, Reinhold Bohm
  • Publication number: 20070219808
    Abstract: In a multi-channel encoder generating several different parameter sets for reconstructing a multi-channel output signal using at least one transmission channel, the data stream is written such that the two parameter sets are decodable independently of each other. Thus, a multi-channel decoder is enabled to skip a parameter set which is marked as optional and/or has a higher version number when reading the data stream and still to perform a valid multi-channel reconstruction using a data set marked as mandatory or a data set having a sufficiently low version number. This achieves a flexible encoder/decoder concept suitable for future updates characterized by backward compatibility and reliability.
    Type: Application
    Filed: March 2, 2007
    Publication date: September 20, 2007
    Inventors: Juergen Herre, Ralph Sperschneider, Johannes Hilpert, Karsten Linzmeier, Harald Popp
  • Publication number: 20070206690
    Abstract: For flexibly signaling a synchronous mode or an asynchronous mode in the multi-channel parameter reconstruction, a parameter configuration cue is inserted in the data stream, which is used by a configurator on the side of a multi-channel decoder to configure a multi-channel reconstructor. If the parameter configuration cue has a first meaning, the configurator will look for further configuration information in its input data, while, when the parameter configuration cue has another meaning, the configurator performs a configuration setting of the multi-channel reconstructor based on information on a coding algorithm with which transmission channel data have been coded, so that it is ensured efficiently on the one hand and flexibly on the other hand that there will always be obtained a correct association between parameter data and decoded transmission channel data.
    Type: Application
    Filed: March 8, 2007
    Publication date: September 6, 2007
    Inventors: Ralph Sperschneider, Juergen Herre, Johannes Hilpert, Christian Ertel, Stefan Geyersberger
  • Publication number: 20070055510
    Abstract: The purpose of the invention is to bridge the gap between parametric multi-channel audio coding and matrixed-surround multi-channel coding by gradually improving the sound of an up-mix signal while raising the bit-rate consumed by the side-information starting from 0 up to the bit-rates of the parametric methods. More specifically, it provides a method of flexibly choosing an “operating point” somewhere between matrixed-surround (no side-information, limited audio quality) and fully parametric reconstruction (full side-information rate required, good quality). This operating point can be chosen dynamically (i.e. varying over time) and in response to the permissible side-information rate, as it is dictated by the individual application.
    Type: Application
    Filed: December 29, 2005
    Publication date: March 8, 2007
    Inventors: Johannes Hilpert, Christof Faller, Karsten Linzmeier, Ralph Sperschneider
  • Publication number: 20070019813
    Abstract: The purpose of the invention is to bridge the gap between parametric multi-channel audio coding and matrixed-surround multi-channel coding by gradually improving the sound of an up-mix signal while raising the bit-rate consumed by the side-information starting from 0 up to the bit-rates of the parametric methods. More specifically, it provides a method of flexibly choosing an “operating point” somewhere between matrixed-surround (no side-information, limited audio quality) and fully parametric reconstruction (full side-information rate required, good quality). This operating point can be chosen dynamically (i.e. varying over time) and in response to the permissible side-information rate, as it is dictated by the individual application.
    Type: Application
    Filed: July 19, 2006
    Publication date: January 25, 2007
    Inventors: Johannes Hilpert, Christof Faller, Karsten Linzmeier, Ralph Sperschneider
  • Publication number: 20060235679
    Abstract: The present invention is based on the finding that parameters including a first set of parameters of a representation of a first portion of an original signal and including a second set of parameters of a representation of a second portion of the original signal can be efficiently encoded, when the parameters are arranged in a first sequence of tuples and in a second sequence of tuples, wherein the first sequence of tuples comprises tuples of parameters having two parameters from a single portion of the original signal and wherein the second sequence of tuples comprises tuples of parameters having one parameter from the first portion and one parameter from the second portion of the original signal. An efficient encoding can be achieved using a bit estimator to estimate the number of necessary bits to encode the first and the second sequence of tuples, wherein only the sequence of tuples is encoded, that results in the lower number of bits.
    Type: Application
    Filed: October 5, 2005
    Publication date: October 19, 2006
    Inventors: Ralph Sperschneider, Jurgen Herre, Karsten Linzmeier, Johannes Hilpert
  • Publication number: 20060235865
    Abstract: The present invention is based on the finding that an efficient code for encoding information values can be derived, when two or more information values are grouped in a tuple in a tuple order and when an encoding rule is used, that assigns the same code word to tuples having identical information values in different orders and that does derive an order information, indicating the tuple order, and when the code word is output in association with the order information.
    Type: Application
    Filed: October 14, 2005
    Publication date: October 19, 2006
    Inventors: Ralph Sperschneider, Jurgen Herre, Karsten Linzmeier, Johannes Hilpert
  • Publication number: 20060235683
    Abstract: A compact encoded representation of information values not exceeding a predefined size can be derived when a first encoding rule generating an encoded representation of the information values of variable length is compared to a second encoding rule generating an encoded representation of the information values of fixed length and when the encoding rule resulting in the encoded representation requiring the lower number of information units is chosen. Thus, the maximum bit rate can be guaranteed to be at least the maximum bit rate of the second encoding rule deriving the second encoded representation. Signaling the choice of the encoding rule by some rule information together with the encoded representation of the information values, the correct information values can later on be derived on a decoder side, using a decoding rule fitting the encoding rule used during the encoding.
    Type: Application
    Filed: September 22, 2005
    Publication date: October 19, 2006
    Inventors: Ralph Sperschneider, Jurgen Herre, Karsten Linzmeier, Johannes Hilpert
  • Patent number: 7103554
    Abstract: In a method for producing a data stream of code words of variable lengths which are divided up into a plurality of sets of code words, wherein a raster having segments is specified for the data stream, wherein two adjacent raster points define a segment, code words of the first sets are written into the data stream starting at raster points. Subsequently, code words of the second set are written into the data stream pursuant to a predetermined assignment rule, wherein each code word of the second set is assigned to a different segment. Entire code words or parts of code words which cannot be written according to their assignment, are stored and entered into the data stream in further attempts, wherein the assignment by a predetermined regulation is changed from attempt to attempt. This procedure is analogously repeated for any further set which may be present.
    Type: Grant
    Filed: January 17, 2000
    Date of Patent: September 5, 2006
    Assignee: Fraunhofer-Gesellschaft zue Foerderung der angewandten Forschung e.V.
    Inventors: Ralph Sperschneider, Martin Dietz, Pierre Lauber, Michael Schug
  • Patent number: 7003448
    Abstract: In a method for concealing an error in an encoded audio signal a set of spectral coefficients is subdivided into at least two sub-bands (14), whereupon the sub-bands are subjected to a re-verse transform (16). A specific prediction is performed (18) for each quasi time signal of a sub-band to obtain an estimated temporal representation for a sub-band of a set of spectral coefficients following the current set. A forward transform (20) of the time signal of each sub-band provides estimated spectral coefficients which can be used (28) instead of erroneous spectral coefficients of a following set of spectral coefficients, e.g. in order to conceal transmission errors. Transforming at the sub-band level provides independence from transform characteristics such as block length, window type and MDCT algorithm while at the same time preserving spectral processing for error concealment. Thus the spectral characteristics of audio signals can also be taken into account during error concealment.
    Type: Grant
    Filed: April 12, 2000
    Date of Patent: February 21, 2006
    Assignee: Fraunhofer-Gesellschaft zur Foerderung der Angewandten Forschung e.V.
    Inventors: Pierre Lauber, Martin Dietz, Juergen Herre, Reinhold Boehm, Ralph Sperschneider, Daniel Homm
  • Patent number: 6975254
    Abstract: In a method for coding an audio signal to obtain a coded bit stream, discrete-time samples of the audio signal are transformed into the frequency domain to obtain spectral values. The spectral values are coded with a code table having a limited number of code words of different lengths to obtain spectral values coded by code words, the length of a code word assigned to a spectral value being that much shorter the higher the probability of occurrence of the spectral value is. A raster is then specified for the coded bit stream, the raster having equidistant raster points and the distance between the raster points depending on the code table(s) used. In order to obtain error-tolerant Huffman coding, priority code words, which represent particular spectral values which are psychoacoustically more important than other spectral values, are so arranged in the raster that the start of each priority code word coincides with a raster point.
    Type: Grant
    Filed: December 28, 1998
    Date of Patent: December 13, 2005
    Assignee: Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung E.V.
    Inventors: Ralph Sperschneider, Martin Dietz, Andreas Ehret, Karlheinz Brandenburg, Heinz Gerhaeuser, Ali Nowbakht-Irani, Pierre Lauber, Roland Bitto