公开(公告)号：WO2012054893A3

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

申请号：PCT/US2011/057382

申请日：2011-10-21

Applicant: QUALCOMM Incorporated ,  LUBY, Michael G.

Inventor： LUBY, Michael G.

IPC: H04L29/06 ,  H04L1/00 ,  H04L1/16

Abstract: 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.

公开(公告)号：WO2011109653A1

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

申请号：PCT/US2011/027078

申请日：2011-03-03

Applicant: QUALCOMM INCORPORATED ,  LUBY, Michael G. ,  WATSON, Mark

Inventor： LUBY, Michael G. ,  WATSON, Mark

IPC: H04L1/00 ,  H03M13/27

CPC classification number: H04L1/0057 ,  H03M13/27 ,  H03M13/373 ,  H03M13/3761 ,  H03M13/611 ,  H03M13/6356 ,  H03M13/6502 ,  H04L1/0071

Abstract: A method of mapping m individual objects to source symbols for delivering data from a transmitter to a receiver in a communication system, the m individual objects ordered from object 1 to object m , wherein m > 1, includes: aggregating the m individual objects into an aggregate object, including for each individual object j , calculating a number of source symbols S(j) for containing data of the individual object j ; and partitioning the aggregate object into Z source blocks, including for each source block k and each individual object j , calculating a number of source symbols NSS(j, k) of individual object j in source block k , wherein the S(j) source symbols for each individual object j are arranged consecutively within consecutive source blocks, starting from a first source block for which NSS(j, k) > 0 to a last source block for which NSS(j, k) > 0.

Abstract translation: 将单个对象映射到源符号以将数据从通信系统中的发射机传送到接收机的方法，从对象1到对象m排序的m个单独对象，其中m> 1包括：将m个单独对象聚合成 聚合对象，包括对于每个单独的对象j，计算用于包含单个对象j的数据的源符号S（j）的数量; 并且将所述聚合对象划分为Z个源块，包括针对每个源块k和每个单个对象j，计算源块k中各个对象j的源符号NSS（j，k）的数目，其中S（j）源 从NSS（j，k）> 0的NSS（j，k）> 0的最后一个源块的第一源块开始，每个独立对象j的符号被连续排列在连续的源块内。

公开(公告)号：WO2011038028A9

公开(公告)日：2011-05-19

申请号：PCT/US2010049862

申请日：2010-09-22

Applicant: QUALCOMM INC ,  LUBY MICHAEL G ,  WATSON MARK ,  VICISANO LORENZO ,  PAKZAD PAYAM ,  WANG BIN

Inventor： LUBY MICHAEL G ,  WATSON MARK ,  VICISANO LORENZO ,  PAKZAD PAYAM ,  WANG BIN

IPC: H04L29/06

CPC classification number: H04L65/604 ,  H04L65/4084 ,  H04L65/602 ,  H04L65/607 ,  H04L65/80 ,  H04N21/23106 ,  H04N21/23406 ,  H04N21/234327 ,  H04N21/235 ,  H04N21/2401 ,  H04N21/25808 ,  H04N21/2662 ,  H04N21/435 ,  H04N21/44004 ,  H04N21/440227 ,  H04N21/44209 ,  H04N21/84 ,  H04N21/8456

Abstract: 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. A client device can be adapted to take advantage of the ingestion process. The client device might be configured to optimize use of resources, given the information available to it from the ingestion system. This may include configurations to determine the sequence, timing and construction of block requests based on monitoring buffer size and rate of change of buffer size, use of variable sized requests, mapping of block requests to underlying transport connections, flexible pipelining of requests, and/or use of whole file requests based on statistical considerations.

公开(公告)号：WO2007134196A2

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

申请号：PCT/US2007/068713

申请日：2007-05-10

Applicant: DIGITAL FOUNTAIN, INC. ,  WATSON, Mark ,  LUBY, Michael, G.

Inventor： WATSON, Mark ,  LUBY, Michael, G.

IPC: A61F2/48

CPC classification number: H03M13/03 ,  H04L1/0052 ,  H04L1/0064

Abstract: A method of encoding data for transmissions from a source to a destination over a communications channel is provided. The method operates on an ordered set of source symbols and may generate zero or more redundant symbols from the source symbols, wherein data is encoded in a first step according to a simple FEC code and in a second step, data is encoded according to a second FEC code, more complex than the first FEC code. The first FEC code and/or the second FEC code might comprise coding known in the art. These steps result in two groups of encoded data in such a way that a low complexity receiver may make use of one of the groups of encoded data while higher complexity receivers may make use of both groups of encoded data.

Abstract translation: 提供了一种通过通信信道对从源到目的地的传输的数据进行编码的方法。 该方法对有序的一组源符号进行操作，并且可以从源符号生成零个或多个冗余符号，其中根据简单FEC码在第一步骤中对数据进行编码，并且在第二步骤中，根据第二步对数据进行编码 FEC码，比第一个FEC码更复杂。 第一FEC码和/或第二FEC码可以包括本领域已知的编码。 这些步骤产生两组编码数据，使得低复杂度的接收机可以利用编码数据组之一，而较高复杂度的接收机可以利用两组编码数据。

公开(公告)号：WO2007098397A3

公开(公告)日：2007-08-30

申请号：PCT/US2007/062302

申请日：2007-02-16

Applicant: DIGITAL FOUNTAIN, INC. ,  SHOKROLLAHI, M. Amin ,  LUBY, Michael, G. ,  WATSON, Mark ,  MINDER, Lorenz

Inventor： SHOKROLLAHI, M. Amin ,  LUBY, Michael, G. ,  WATSON, Mark ,  MINDER, Lorenz

IPC: H04B14/04

Abstract: A method of encoding data for transmission from a source to a destination over a communications channel is provided. The method operates on an ordered set of input symbols and includes generating a plurality of redundant symbols from the input symbols based on linear constraints. The method also includes generating a plurality of output symbols from a combined set of symbols including the input symbols and the redundant symbols based on linear combinations, wherein at least one of the linear constraints or combinations is over a first finite field and at least one other of the linear constraints or combinations is over a different second finite field, and such that the ordered set of input symbols can be regenerated to a desired degree of accuracy from any predetermined number of the output symbols.

公开(公告)号：WO2005112250A2

公开(公告)日：2005-11-24

申请号：PCT/US2005016334

申请日：2005-05-09

Applicant: DIGITAL FOUNTAIN INC ,  LUBY MICHAEL G ,  SHOKROLLAHI M AMIN ,  WATSON MARK

Inventor： LUBY MICHAEL G ,  SHOKROLLAHI M AMIN ,  WATSON MARK

IPC: G11C29/00 ,  H03D1/00 ,  H03M13/29 ,  H03M13/37 ,  H04L1/00 ,  H04L27/06

CPC classification number: H03M13/29 ,  H03M13/1102 ,  H03M13/19 ,  H03M13/3761 ,  H04L1/0041 ,  H04L1/0045 ,  H04L1/0057 ,  H04L1/0065

Abstract: A method of encoding data for transmission from a source to a destination over a communications channel is provided. The method operates on an ordered set of input symbols and includes generating a plurality of redundant symbols from the input symbols. The method also includes generating a plurality of output symbols from a combined set of symbols including the input symbols and the redundant symbols, wherein the number of possible output symbols is much larger than the number of symbols in the combined set of symbols, wherein at least one output symbol is generated from more than one symbol in the combined set of symbols and from less than all of the symbols in the combined set of symbols, and such that the ordered set of input symbols can be regenerated to a desired degree of accuracy from any predetermined number of the output symbols. The plurality of redundant symbols is generated from an ordered set of input symbols to be transmitted in a deterministic process such that a first set of static symbols calculated using a first input symbol has a low common membership with a second set of static symbols calculated using a second input symbol distinct from the first input symbol.

Abstract translation: 提供了一种用于通过通信信道从源传送到目的地的数据编码方法。 该方法对有序输入符号组进行操作，并且包括从输入符号生成多个冗余符号。 该方法还包括从包括输入符号和冗余符号的组合组合生成多个输出符号，其中可能的输出符号的数量远大于组合符号集合中的符号数，其中至少 一个输出符号是从组合符号集合中的多于一个符号和小于组合符号集合中的所有符号生成的，并且使得有序输入符号集可以从 任何预定数量的输出符号。 多个冗余符号从要在确定性过程中发送的有序输入符号集合生成，使得使用第一输入符号计算的第一组静态符号具有与使用第一输入符号计算的第二组静态符号的较低公共隶属关系 第二输入符号与第一输入符号不同。

公开(公告)号：WO2012109602A1

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

申请号：PCT/US2012/024743

申请日：2012-02-10

Applicant: QUALCOMM INCORPORATED ,  LUBY, Michael G. ,  WATSON, Mark ,  REZAIIFAR, Ramin ,  VICISANO, Lorenzo

Inventor： LUBY, Michael G. ,  WATSON, Mark ,  REZAIIFAR, Ramin ,  VICISANO, Lorenzo

IPC: H04L1/00 ,  H04L1/18

CPC classification number: H04L1/0057 ,  H04L1/0009 ,  H04L1/18

Abstract: Forward error correction scheduling techniques for an improved radio link protocol used in a wireless communication system, such as EV-DO. In one embodiment scheduling of the generation of repair symbols encoded to be transmitted along with source data is described. In another embodiment acknowledgment messages from a receiver are used to control the trailing edge of the protection window offered by the repair symbols. In another embodiment, non-acknowledgment messages from a receiver are used to control the generation of extra repair symbols. In another embodiment, a length field is used to avoid transmission of padding bytes over the air. In yet another embodiment, a symbol auxiliary field is appended to source symbols to indicate the padding bytes needed for symbol aligning thus avoiding the transmission of padding bytes over the air.

Abstract translation: 用于诸如EV-DO的无线通信系统中使用的改进的无线电链路协议的前向纠错调度技术。 在一个实施例中，描述了编码为与源数据一起发送的修复符号的生成的调度。 在另一个实施例中，来自接收机的确认消息用于控制由修复符号提供的保护窗口的后沿。 在另一实施例中，来自接收机的非确认消息用于控制额外修复符号的生成。 在另一个实施例中，使用长度字段来避免在空中传输填充字节。 在另一个实施例中，符号辅助字段被附加到源符号以指示符号对齐所需的填充字节，从而避免空中的填充字节的传输。

公开(公告)号：WO2011038028A3

公开(公告)日：2011-10-06

申请号：PCT/US2010049862

申请日：2010-09-22

Applicant: QUALCOMM INC ,  LUBY MICHAEL G ,  WATSON MARK ,  VICISANO LORENZO ,  PAKZAD PAYAM ,  WANG BIN

Inventor： LUBY MICHAEL G ,  WATSON MARK ,  VICISANO LORENZO ,  PAKZAD PAYAM ,  WANG BIN

IPC: H04L29/06 ,  H04N7/24

CPC classification number: H04L65/604 ,  H04L65/4084 ,  H04L65/602 ,  H04L65/607 ,  H04L65/80 ,  H04N21/23106 ,  H04N21/23406 ,  H04N21/234327 ,  H04N21/235 ,  H04N21/2401 ,  H04N21/25808 ,  H04N21/2662 ,  H04N21/435 ,  H04N21/44004 ,  H04N21/440227 ,  H04N21/44209 ,  H04N21/84 ,  H04N21/8456

Abstract: 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. A client device can be adapted to take advantage of the ingestion process. The client device might be configured to optimize use of resources, given the information available to it from the ingestion system. This may include configurations to determine the sequence, timing and construction of block requests based on monitoring buffer size and rate of change of buffer size, use of variable sized requests, mapping of block requests to underlying transport connections, flexible pipelining of requests, and/or use of whole file requests based on statistical considerations.

Abstract translation: 块请求流式传输系统通常使用产生由常规文件服务器（HTTP，FTP等）提供的形式的数据的摄取系统来改善这种系统的用户体验和带宽效率，其中， 摄取系统摄取内容并将其准备为文件服务器要提供的文件或数据元素。 可以调整客户端设备以利用摄取过程。 考虑到从摄取系统可获得的信息，客户端设备可能被配置为优化资源的使用。 这可以包括用于基于监视缓冲区大小和缓冲区大小的改变速率，可变大小的请求的使用，阻止请求到底层传输连接的映射，灵活流水线化请求和/或请求来确定阻止请求的顺序，时间和构造的配置， 或基于统计考虑使用整个文件请求。

公开(公告)号：WO2011038032A2

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

申请号：PCT/US2010/049869

申请日：2010-09-22

Applicant: QUALCOMM INCORPORATED ,  LUBY, Michael G. ,  WATSON, Mark ,  VICISANO, Lorenzo ,  PAKZAD, Payam ,  WANG, Bin ,  STOCKHAMMER, Thomas

Inventor： LUBY, Michael G. ,  WATSON, Mark ,  VICISANO, Lorenzo ,  PAKZAD, Payam ,  WANG, Bin ,  STOCKHAMMER, Thomas

IPC: H04L29/06

CPC classification number: H04L65/604 ,  H04L65/4084 ,  H04L65/602 ,  H04L65/607 ,  H04L65/80 ,  H04N21/23106 ,  H04N21/23406 ,  H04N21/234327 ,  H04N21/235 ,  H04N21/2401 ,  H04N21/25808 ,  H04N21/2662 ,  H04N21/435 ,  H04N21/44004 ,  H04N21/440227 ,  H04N21/44209 ,  H04N21/84 ,  H04N21/8456

Abstract: 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 include a cache. A client device can be adapted to take advantage of the ingestion process as well as improvements that make for a better presentation independent of the ingestion process. The client devices and ingestion system can be coordinated to have a predefined mapping and template for making block requests to HTTP file names that a conventional file server can accept through the use of URL construction rules. Segment size might be specified in an approximate manner for more efficient organization.

Abstract translation: 块请求流系统提供了这样的系统的用户体验和带宽效率的改进，通常使用以传统文件服务器（HTTP，FTP等）服务的形式生成数据的摄取系统，其中 摄取系统进入内容并将其准备为要由文件服务器（可能包括缓存）提供的文件或数据元素。 客户端设备可以适应于摄取过程的优点以及独立于摄取过程的改进。 可以协调客户端设备和摄取系统以具有预定义的映射和模板，以便通过使用URL构造规则对常规文件服务器可以接受的HTTP文件名进行块请求。 可以以近似的方式指定细分大小以提高组织效率。

公开(公告)号：WO2008003094A2

公开(公告)日：2008-01-03

申请号：PCT/US2007072576

申请日：2007-06-29

Applicant: DIGITAL FOUNTAIN INC ,  CHEN STEVE ,  WATSON MARK ,  LUBY MICHAEL G ,  SEED BILL ,  KUNZ THOMAS

Inventor： CHEN STEVE ,  WATSON MARK ,  LUBY MICHAEL G ,  SEED BILL ,  KUNZ THOMAS

IPC: G06F11/08

CPC classification number: G06F11/1008 ,  H03M13/3761

Abstract: 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.

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