Patents by Inventor Ralf Koetter
Ralf Koetter 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: 10965538Abstract: Systems and methods for characterizing networks are disclosed. In several embodiments, a network analyzer applies a network analysis to a network that replaces components of the network in a model of the network with equivalent or bounding models. The network analyzer can then characterize the simplified model of the network and an assessment can be made concerning the accuracy of the characterization of the network.Type: GrantFiled: March 7, 2016Date of Patent: March 30, 2021Assignee: California Institute of TechnologyInventors: Michelle Effros, Tracey C. Ho, Ralf Koetter, Shirin Jalali
-
Patent number: 9680928Abstract: A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.Type: GrantFiled: July 1, 2015Date of Patent: June 13, 2017Assignee: NATIONAL SCIENCE FOUNDATIONInventors: Muriel Medard, Supratim Deb, Ralf Koetter
-
Publication number: 20160191335Abstract: Systems and methods for characterizing networks are disclosed. In several embodiments, a network analyzer applies a network analysis to a network that replaces components of the network in a model of the network with equivalent or bounding models. The network analyzer can then characterize the simplified model of the network and an assessment can be made concerning the accuracy of the characterization of the network.Type: ApplicationFiled: March 7, 2016Publication date: June 30, 2016Applicant: California Institute of TechnologyInventors: Michelle Effros, Tracey C. Ho, Ralf Koetter, Shirin Jalall
-
Patent number: 9282007Abstract: Systems and methods for characterizing networks are disclosed. In several embodiments, a network analyzer applies a network analysis to a network that replaces components of the network in a model of the network with equivalent or bounding models. The network analyzer can then characterize the simplified model of the network and an assessment can be made concerning the accuracy of the characterization of the network.Type: GrantFiled: February 1, 2012Date of Patent: March 8, 2016Assignee: California Institute of TechnologyInventors: Michelle Effros, Tracey C. Ho, Ralf Koetter, Nuala Koetter, Shirin Jalali
-
Publication number: 20150304419Abstract: A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.Type: ApplicationFiled: July 1, 2015Publication date: October 22, 2015Inventors: Muriel Medard, Supratim Deb, Ralf Koetter
-
Patent number: 9165013Abstract: A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.Type: GrantFiled: November 16, 2012Date of Patent: October 20, 2015Assignee: MASSACHUSETTS INSTITUTE OF TECHNOLOGYInventors: Muriel Medard, Supratim Deb, Ralf Koetter
-
Patent number: 8375102Abstract: A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.Type: GrantFiled: October 6, 2011Date of Patent: February 12, 2013Assignee: Massachusetts Institute of TechnologyInventors: Muriel Medard, Supratim Deb, Ralf Koetter
-
Patent number: 8358679Abstract: A relay station for being operative in a mobile communication system, comprising a receiver for receiving a radio signal from a source, the radio signal comprising symbols representing an encoded information, the encoded information being based on an encoding rule and comprising payload information and redundancy information. The relay station comprising a soft detector for detecting a symbol from the radio signal to obtain soft information, the soft information comprising information on the symbol and reliability information on the information on the symbol. The relay station further comprising a quantizer for quantizing the soft information to obtain quantized soft information and a transmitter for transmitting an information on the quantized soft information to a destination.Type: GrantFiled: December 21, 2009Date of Patent: January 22, 2013Assignee: NTT DoCoMo, Inc.Inventors: Georg Zeitler, Ralf Koetter, Gerhard Bauch, Joerg Widmer
-
Publication number: 20130007264Abstract: Systems and methods for characterizing networks are disclosed. In several embodiments, a network analyzer applies a network analysis to a network that replaces components of the network in a model of the network with equivalent or bounding models. The network analyzer can then characterize the simplified model of the network and an assessment can be made concerning the accuracy of the characterization of the network.Type: ApplicationFiled: February 1, 2012Publication date: January 3, 2013Applicant: California Institute of TechnologyInventors: Michelle Effros, Tracey Ho, Ralf Koetter, Shirin Jalali, Nuala Koetter
-
Patent number: 8347190Abstract: An encoder structure for an error correcting code with arbitrary parity positions is presented. The invention is effective for all error correcting codes whose parity check matrix is of the Vandermonde type. In contrast to conventional encoder circuits, the parity symbols produced by this encoder are not restricted to form a block of consecutive parity symbols at the beginning or at the end of a codeword, but may be spread arbitrarily within the codeword. A general structure of the parity check matrix for such a code is found by exploiting the special Vandermonde structure of matrices. From this general parity check matrix, an expression for the evaluation of the parity symbols in terms of a polynomial with limited degree is derived. An efficient hardware implementation of the proposed encoder is suggested.Type: GrantFiled: December 10, 2009Date of Patent: January 1, 2013Assignee: Rohde & Schwarz GmbH & Co. KGInventors: Joschi Tobias Brauchle, Ralf Koetter, Nuala Koetter, legal representative
-
Publication number: 20120096124Abstract: A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.Type: ApplicationFiled: October 6, 2011Publication date: April 19, 2012Inventors: Muriel Medard, Supratim Deb, Ralf Koetter
-
Patent number: 8126235Abstract: In some aspects, a method of automated base-calling using at least one image obtained from a chemical sequencing process performed simultaneously on a plurality of DNA strands, the at least one image including intensity information corresponding to locations of at least one base in the plurality of DNA strands is provided.Type: GrantFiled: April 6, 2009Date of Patent: February 28, 2012Assignee: Massachusetts Institute of TechnologyInventors: Xiaomeng Shi, Muriel Medard, Ralf Koetter, Nuala Ann Koetter, legal representative, Desmond S. Lun
-
Patent number: 8046426Abstract: A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.Type: GrantFiled: December 30, 2004Date of Patent: October 25, 2011Assignee: Massachusetts Institute of TechnologyInventors: Muriel Medard, Supratim Deb, Ralf Koetter
-
Publication number: 20110072334Abstract: An encoder structure for an error correcting code with arbitrary parity positions is presented. The invention is effective for all error correcting codes whose parity check matrix is of the Vandermonde type. In contrast to conventional encoder circuits, the parity symbols produced by this encoder are not restricted to form a block of consecutive parity symbols at the beginning or at the end of a codeword, but may be spread arbitrarily within the codeword. A general structure of the parity check matrix for such a code is found by exploiting the special Vandermonde structure of matrices. From this general parity check matrix, an expression for the evaluation of the parity symbols in terms of a polynomial with limited degree is derived. An efficient hardware implementation of the proposed encoder is suggested.Type: ApplicationFiled: December 10, 2009Publication date: March 24, 2011Inventors: Joschi Tobias BRAUCHLE, Ralf KOETTER, Nuala KOETTER
-
Publication number: 20100157878Abstract: A relay station for being operative in a mobile communication system, comprising a receiver for receiving a radio signal from a source, the radio signal comprising symbols representing an encoded information, the encoded information being based on an encoding rule and comprising payload information and redundancy information. The relay station comprising a soft detector for detecting a symbol from the radio signal to obtain soft information, the soft information comprising information on the symbol and reliability information on the information on the symbol. The relay station further comprising a quantizer for quantizing the soft information to obtain quantized soft information and a transmitter for transmitting an information on the quantized soft information to a destination.Type: ApplicationFiled: December 21, 2009Publication date: June 24, 2010Applicant: NTT DOCOMO, INC.Inventors: Georg Zeitler, Ralf Koetter, Gerhard Bauch, Joerg Widmer
-
Patent number: 7706365Abstract: A network and a method for transmitting processes in a network are disclosed, where a randomized coding approach is provided. Network nodes transmit on each outgoing link a linear combination of incoming signals, specified by independently and randomly chosen code coefficients from a finite field. The approach allows robust, distributed transmission and compression of information in networks and is advantageous over routing-based approaches.Type: GrantFiled: November 17, 2004Date of Patent: April 27, 2010Assignees: California Institute of Technology, Massachusetts Institute of Technology, Board of Trustees of the University of IllinoisInventors: Michelle Effros, Tracey Ho, David Karger, Ralf Koetter, Muriel Medard
-
Publication number: 20100074492Abstract: In some aspects, a method of automated base-calling using at least one image obtained from a chemical sequencing process performed simultaneously on a plurality of DNA strands, the at least one image including intensity information corresponding to locations of at least one base in the plurality of DNA strands is provided.Type: ApplicationFiled: April 6, 2009Publication date: March 25, 2010Applicant: Massachusetts Institute of TechnologyInventors: Xiaomeng Shi, Muriel Medard, Ralf Koetter, Nuala Ann Koetter, Desmond S. Lun
-
Patent number: 7414978Abstract: A method and computer program product for performing minimum cost routing with network coding is presented. The method and system model a network as a directed graph. A cost per unit flow is associated with each link of the directed graph. A link capacity is associated with each link of the directed graph. A network code is then computed that sets up a routing connection that achieves an optimal cost using the cost per unit flow for each link of the directed graph and using the link capacity for each link of the directed graph.Type: GrantFiled: December 30, 2004Date of Patent: August 19, 2008Assignee: Massachusetts Institute of TechnologyInventors: Desmond S. Lun, Muriel Medard, Tracey Ho, Ralf Koetter, Niranjan Ratnakar
-
Publication number: 20060146716Abstract: A method and computer program product for performing minimum cost routing with network coding is presented. The method and system model a network as a directed graph. A cost per unit flow is associated with each link of the directed graph. A link capacity is associated with each link of the directed graph. A network code is then computed that sets up a routing connection that achieves an optimal cost using the cost per unit flow for each link of the directed graph and using the link capacity for each link of the directed graph.Type: ApplicationFiled: December 30, 2004Publication date: July 6, 2006Inventors: Desmond Lun, Muriel Medard, Tracy Ho, Ralf Koetter, Niranjan Ratnakar
-
Publication number: 20060149753Abstract: A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is detrmined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.Type: ApplicationFiled: December 30, 2004Publication date: July 6, 2006Inventors: Muriel Medard, Supratim Deb, Ralf Koetter