公开(公告)号：US5617541A

公开(公告)日：1997-04-01

申请号：US361802

申请日：1994-12-21

申请人： Andres Albanese ,  Michael G. Luby ,  Johannes F. Bloemer ,  Jeffrey A. Edmonds

发明人： Andres Albanese ,  Michael G. Luby ,  Johannes F. Bloemer ,  Jeffrey A. Edmonds

IPC分类号： H04L29/06 ,  G06F3/00

CPC分类号： H04L29/06

摘要： A data distribution system has a number of data processing devices interconnected by data transmission media. At least one of the data processing devices transmit data to other data processing devices in the system. The transmitting data processing system includes memory for storing the data to be transmitted, programmable data processing circuitry, and data transmission apparatus for transmitting an encoded representation of the stored message as a sequence of data packets. Priority data, stored in the memory, represents a plurality of assigned priority levels for specified portions of the stored message such that portions of the stored message have respective assigned priority levels. A data encoding program generates an encoded representation of the stored message that includes, for each portion of the stored message, a level of redundant data corresponding to the priority level assigned to that portion of the stored message. As a result, the encoded representation of the stored message includes different levels of redundant data for the different portions of the stored message. Each receiving data processing system includes memory for storing received data, programmable data processing circuitry, and data receiving apparatus for receiving at least a portion of the transmitted data packets. A data decoding program generates a decoded representation of the received data stream. The data decoding program decodes different portions of the received encoded data in accordance with the different levels of redundant data included in the received data stream.

摘要翻译： 数据分发系统具有通过数据传输介质互联的多个数据处理设备。 数据处理设备中的至少一个将数据发送到系统中的其他数据处理设备。 发送数据处理系统包括用于存储要发送的数据的存储器，可编程数据处理电路和用于发送所存储的消息的编码表示作为数据分组序列的数据发送装置。 存储在存储器中的优先级数据表示存储消息的指定部分的多个分配的优先级，使得存储的消息的部分具有相应的分配的优先级。 数据编码程序生成存储消息的编码表示，对于存储消息的每个部分，包括对应于分配给存储消息的该部分的优先级的冗余数据的级别。 结果，存储的消息的编码表示包括用于存储消息的不同部分的不同级别的冗余数据。 每个接收数据处理系统包括用于存储接收数据的存储器，可编程数据处理电路和用于接收所发送的数据分组的至少一部分的数据接收装置。 数据解码程序生成接收数据流的解码表示。 数据解码程序根据包含在接收数据流中的不同级别的冗余数据来解码接收到的编码数据的不同部分。

公开(公告)号：USRE43741E1

公开(公告)日：2012-10-16

申请号：US13374565

申请日：2011-11-17

申请人： M. Amin Shokrollahi ,  Michael G. Luby

发明人： M. Amin Shokrollahi ,  Michael G. Luby

IPC分类号： H03M7/00

CPC分类号： H03M13/1102 ,  H03M7/30 ,  H03M13/3761 ,  H04L1/00

摘要： A method of encoding data into a chain reaction code includes generating a set of input symbols from input data. Subsequently, one or more non-systematic output symbols is generated from the set of input symbols, each of the one or more non-systematic output symbols being selected from an alphabet of non-systematic output symbols, and each non-systematic output symbol generated as a function of one or more of the input symbols. As a result of this encoding process, any subset of the set of input symbols is recoverable from (i) a predetermined number of non-systematic output symbols, or (ii) a combination of (a) input symbols which are not included in the subset of input symbols that are to be recovered, and (b) one or more of the non-systematic output symbols.

摘要翻译： 将数据编码为链式反应代码的方法包括从输入数据生成一组输入符号。 随后，从该组输入符号生成一个或多个非系统输出符号，一个或多个非系统输出符号中的每一个从非系统输出符号的字母表中选择，并且生成每个非系统输出符号 作为一个或多个输入符号的函数。 作为该编码处理的结果，可从（i）预定数量的非系统输出符号中恢复该组输入符号的任何子集，或（ii）不包括在该系统输出符号中的（a）输入符号的组合 要恢复的输入符号的子集，以及（b）一个或多个非系统输出符号。

公开(公告)号：US20120099593A1

公开(公告)日：2012-04-26

申请号：US13041085

申请日：2011-03-04

申请人： Michael G. Luby

发明人： Michael G. Luby

IPC分类号： H04L12/56

CPC分类号： H04L1/0056 ,  H04L1/0083 ,  H04L1/0089 ,  H04L1/1607 ,  H04L1/1621 ,  H04L67/02 ,  H04L2001/0098

摘要： Methods and apparatus for delivering data objects from an electronic device or system over a packet-switched network are provided, wherein source data is represented by encoded symbols in packets such that the source data is recoverable, at least approximately, from the encoded symbols, by arranging the source data into a plurality of source symbols, generating a plurality of encoding packets, wherein an encoding packet comprises a universal object symbol identifier (“UOSI”) and a plurality of encoding symbols representing source data for a packet structure identified by the UOSI, and sending the plurality of encoding packets to the packet-switched network.

摘要翻译： 提供了用于通过分组交换网络从电子设备或系统传递数据对象的方法和装置，其中源数据由分组中的编码符号表示，使得源数据可以至少近似地从编码符号被 将源数据排列成多个源符号，生成多个编码分组，其中编码分组包括通用对象符号标识符（“UOSI”）和表示由UOSI标识的分组结构的源数据的多个编码符号 并将多个编码分组发送到分组交换网络。

公开(公告)号：US20120042227A1

公开(公告)日：2012-02-16

申请号：US13276532

申请日：2011-10-19

申请人： Mark Watson ,  Michael G. Luby

发明人： Mark Watson ,  Michael G. Luby

IPC分类号： H03M13/05 ,  G06F11/10

CPC分类号： H04L1/0041 ,  H03M13/373 ,  H03M13/3761 ,  H04B1/66 ,  H04L1/0057 ,  H04L1/0078 ,  H04N19/89

摘要： Transmitters and receivers deal with streams of data, wherein the receiver is expected to begin using received data before receiving all of the data. Concurrent streams are sent and FEC coding is used with the streams and done as an aggregate. The transmitter performs FEC operations over the plurality of streams, wherein source blocks from at least two streams logically associated into a jumbo source block and FEC processing is performed to generate one or more jumbo repair block from the jumbo source block. Each of the source blocks comprises one or more source symbols from their respective stream. The jumbo source symbols can be of constant size and are suitably aligned along size boundaries that make processing efficient. Each source symbol need not be the same size, and the number of source symbols from each stream in a jumbo source block need not be the same value across streams.

摘要翻译： 发射机和接收机处理数据流，其中接收机预期在接收所有数据之前开始使用接收的数据。 并发流被发送，FEC编码与流一起使用，并作为聚合完成。 发射机对多个流执行FEC操作，其中执行逻辑上关联到巨型源块和FEC处理中的至少两个流的源块，以从巨型源块生成一个或多个巨型维修块。 每个源块包括来自它们各自的流的一个或多个源符号。 巨型源符号可以具有恒定的大小，并且可以沿着使处理有效的大小边界适当地对齐。 每个源符号不需要相同的大小，并且来自巨型源块中的每个流的源符号的数量不必在每个流之间具有相同的值。

公开(公告)号：US08065582B2

公开(公告)日：2011-11-22

申请号：US11674628

申请日：2007-02-13

申请人： Mark Watson ,  Michael G. Luby

发明人： Mark Watson ,  Michael G. Luby

IPC分类号： H03M13/05

CPC分类号： H04L1/0041 ,  H03M13/373 ,  H03M13/3761 ,  H04B1/66 ,  H04L1/0057 ,  H04L1/0078 ,  H04N19/89

摘要： Transmitters and receivers deal with streams of data, wherein the receiver is expected to begin using received data before receiving all of the data. Concurrent streams are sent and FEC coding is used with the streams and done as an aggregate. The transmitter performs FEC operations over the plurality of streams, wherein source blocks from at least two streams logically associated into a jumbo source block and FEC processing is performed to generate one or more jumbo repair block from the jumbo source block. Each of the source blocks comprises one or more source symbols from their respective stream. The jumbo source symbols can be of constant size and are suitably aligned along size boundaries that make processing efficient. Each source symbol need not be the same size, and the number of source symbols from each stream in a jumbo source block need not be the same value across streams.

摘要翻译： 发射机和接收机处理数据流，其中接收机预期在接收所有数据之前开始使用接收的数据。 并发流被发送，FEC编码与流一起使用，并作为聚合完成。 发射机对多个流执行FEC操作，其中执行逻辑上关联到巨型源块和FEC处理中的至少两个流的源块，以从巨型源块生成一个或多个巨型维修块。 每个源块包括来自它们各自的流的一个或多个源符号。 巨型源符号可以具有恒定的大小，并且可以沿着使处理有效的大小边界适当地对齐。 每个源符号不需要相同的大小，并且来自巨型源块中的每个流的源符号的数量不必在每个流之间具有相同的值。

公开(公告)号：US20110239078A1

公开(公告)日：2011-09-29

申请号：US12887495

申请日：2010-09-21

申请人： Michael G. Luby ,  Bin Wang ,  Payam Pakzad ,  Mark Watson ,  Lorenzo Vicisano

发明人： Michael G. Luby ,  Bin Wang ,  Payam Pakzad ,  Mark Watson ,  Lorenzo Vicisano

IPC分类号： H03M13/05 ,  G06F11/10

CPC分类号： H04L65/607 ,  H03M13/05 ,  H04L1/004 ,  H04L65/4084 ,  H04L65/602 ,  H04L65/604 ,  H04L65/80 ,  H04N21/23106 ,  H04N21/23406 ,  H04N21/234327 ,  H04N21/2353 ,  H04N21/2393 ,  H04N21/25808 ,  H04N21/44004 ,  H04N21/44209 ,  H04N21/4621 ,  H04N21/84 ,  H04N21/8455 ,  H04N21/8456

摘要： A block-request streaming system provides for improvements in the user experience and bandwidth efficiency of such systems, typically using an ingestion system that generates data in a form to be served by a conventional file server (HTTP, FTP, or the like), wherein the ingestion system intakes content and prepares it as files or data elements to be served by the file server, which might or might not include a cache. A client device can be adapted to take advantage of the ingestion process as well as including improvements that make for a better presentation independent of the ingestion process. In the block-request streaming system, the an ingestion system generates data according to erasure codes and the client device, through various selection and timing of requests for media data and redundant data, can efficiently decode media to provide for presentations.

摘要翻译： 块请求流系统提供了这样的系统的用户体验和带宽效率的改进，通常使用以传统文件服务器（HTTP，FTP等）服务的形式生成数据的摄取系统，其中 摄取系统进入内容，并将其准备为要由文件服务器提供的文件或数据元素，文件服务器可能包含或可能不包含缓存。 客户端设备可以适应于摄取过程的优点，并且包括改进，使得独立于摄取过程的更好的呈现。 在块请求流系统中，摄取系统根据擦除码生成数据，客户端设备通过媒体数据和冗余数据请求的各种选择和定时，可有效地解码媒体以提供演示。

公开(公告)号：US08006160B2

公开(公告)日：2011-08-23

申请号：US11771750

申请日：2007-06-29

申请人： Steve Chen ,  Mark Watson ,  Michael G. Luby ,  Bill Seed ,  Thomas Kunz

发明人： Steve Chen ,  Mark Watson ,  Michael G. Luby ,  Bill Seed ,  Thomas Kunz

IPC分类号： H03M13/00

CPC分类号： G06F11/1008 ,  H03M13/3761

摘要： A sequence of symbol operations (a “schedule representation”) within a data storage device, wherein the operations are those used to process encoding or decoding operations of a forward error correction code (an “FEC code”) upon an arbitrary block of data of a given size (where size can be measured in numbers of symbols). The method is such that the schedule representation can be used to direct the processing of these operations upon a block of data in a way that is computationally efficient. Preferably, the same method can be applied to represent schedules derived from multiple different algorithms for the encoding or decoding of a code or for multiple different codes.

摘要翻译： 数据存储装置内的符号操作序列（“调度表示”），其中，所述操作是用于处理前向纠错码（“FEC码”）的编码或解码操作的操作， 给定的尺寸（其尺寸可以以符号数量来衡量）。 该方法使得调度表示可以用于以计算有效的方式将这些操作的处理指向数据块。 优选地，相同的方法可以用于表示从用于编码或解码代码或用于多个不同代码的多个不同算法导出的调度。

公开(公告)号：US20100211690A1

公开(公告)日：2010-08-19

申请号：US12705202

申请日：2010-02-12

申请人： Payam Pakzad ,  Michael G. Luby

发明人： Payam Pakzad ,  Michael G. Luby

IPC分类号： G06F15/16

CPC分类号： H04N21/8456 ,  H04L65/607 ,  H04L65/80 ,  H04N21/4384

摘要： A method for serving a data stream from a transmitter to a receiver includes: determining an underlying structure of the data stream; determining at least one objective, selected from a group of (1) reducing a start-up delay between when the receiver first starts receiving the data stream from the transmitter and when the receiver can start consumption of blocks of the data stream without interruption, according to the underlying structure, (2) reducing a transmission bandwidth needed to send the data stream, and (3) ensuring that the blocks of the data stream satisfy predetermined block constraints; and transmitting the blocks of the data stream consistent with the at least one objective and the underlying structure.

摘要翻译： 一种用于服务于从发射机到接收机的数据流的方法包括：确定数据流的基础结构; 确定至少一个目标，从（1）中减少接收机首次开始接收来自发射机的数据流之间的启动延迟以及当接收机可以开始消耗数据流的块而不中断时，根据 （2）降低发送数据流所需的传输带宽，（3）确保数据流的块满足预定的块约束; 以及传送与所述至少一个目标和所述基础结构一致的所述数据流的块。

公开(公告)号：US07644335B2

公开(公告)日：2010-01-05

申请号：US11423376

申请日：2006-06-09

申请人： Michael G. Luby ,  M. Amin Shokrollahi

发明人： Michael G. Luby ,  M. Amin Shokrollahi

IPC分类号： H03M13/05

CPC分类号： H03M13/3761 ,  G06F17/16 ,  H03M13/05 ,  H03M13/1197 ,  H03M13/1515 ,  H03M13/2785 ,  H03M13/37 ,  H03M13/373 ,  H03M13/47 ,  H03M13/611 ,  H03M13/616 ,  H03M13/6505 ,  H03M13/6569 ,  H04L1/0041 ,  H04L1/0045 ,  H04L1/0057

摘要： In an encoder for encoding symbols of data using a computing device having memory constraints, a method of performing a transformation comprising loading a source block into memory of the computing device, performing an intermediate transformation of less than all of the source block, then replacing a part of the source block with intermediate results in the memory and then completing the transformation such that output symbols stored in the memory form a set of encoded symbols. A decoder can perform decoding steps in an order that allows for use of substantially the same memory for storing the received data and the decoded source block, performing as in-place transformations. Using an in-place transformation, a large portion of memory set aside for received data can be overwritten as that received data is transformed into decoded source data without requiring a similar sized large portion of memory for the decoded source data.

摘要翻译： 在使用具有存储器限制的计算装置对数据符号进行编码的编码器中，执行变换的方法包括将源块加载到计算装置的存储器中，执行小于所有源块的中间变换， 具有中间的源块的一部分在存储器中产生，然后完成变换，使得存储在存储器中的输出符号形成一组编码符号。 解码器可以以允许使用基本上相同的存储器来存储接收的数据和解码的源块的顺序执行解码步骤，作为就地转换执行。 使用就地变换，可以覆盖用于接收数据的大部分存储器，因为接收的数据被转换为解码的源数据，而不需要用于解码的源数据的相似大小的大部分存储器。

公开(公告)号：US07512697B2

公开(公告)日：2009-03-31

申请号：US11236202

申请日：2005-09-26

申请人： Soren Lassen ,  Gavin Horn ,  Jeffrey J. Persch ,  Armin Haken ,  Michael G. Luby

发明人： Soren Lassen ,  Gavin Horn ,  Jeffrey J. Persch ,  Armin Haken ,  Michael G. Luby

IPC分类号： G06F15/16

CPC分类号： H04L67/32

摘要： Multiple files a served using a server coupled to a data network. A plurality of files is determined, wherein a file includes an integer number of blocks, and wherein each block includes at least one input symbol. For each file, an indication of at least one channel on which to serve the file is determined, and, for each file, a rate at which to serve the file is determined. Also, a schedule for processing the blocks is determined, and output symbols for the blocks are generated according to the schedule. The output symbols are transmitted on the corresponding at least one channel, wherein the files are concurrently served at their corresponding rates.