Abstract: This application relates to systems and methods for recovering data in multimedia file segments. A communication device may receive a multimedia file segment that includes damaged data. The communication device may replace the damaged data with dummy data to reconstruct the multimedia file segment. The communication device may then play the reconstructed multimedia file segment. Thus, by replacing the damaged data with dummy data, the communication device may play a multimedia file segment even when part of the segment may be damaged.

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

Abstract: A method of encoding data operates on an ordered set of input symbols and includes generating redundant symbols from the input symbols, and includes generating 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 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. The redundant symbols are generated from an ordered set of input symbols 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: A block-request streaming system provides for low-latency streaming of a media presentation. A plurality of media segments are generated according to an encoding protocol. Each media segment includes a random access point. A plurality of media fragments are encoded according to the same protocol. The media segments are aggregated from a plurality of media fragments.

Abstract: In one example, a device includes one or more processing units configured to send, via a network, a request to retrieve at least a portion of media content, wherein the media content conforms to dynamic adaptive streaming over HTTP (DASH), and wherein the request comprises a request that the at least portion be delivered according to a file delivery service, and, in response to the request, to receive streaming data for the at least portion of the media content in accordance with the file delivery service over the network. The device may prepopulate a browser cache with the received data, such that a browser can, in effect, stream data using the file delivery service. The device may initially retrieve data of the media content using unicast, until a switch point of the data received via the file delivery service is reached.

Abstract: In one example, a device for receiving information for multimedia data includes one or more processors configured to determine a byte range of a file of a representation of multimedia content to request from a source device, form a uniform resource locator (URL) that specifies, in a file path portion of the URL, according to a template, the file and the byte range in accordance with requirements of the source device, and issue a GET request that specifies the formed URL to the source device.

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: Data can be encoded by assigning source symbols to base blocks, assigning base blocks to source blocks and encoding each source block into encoding symbols, where at least one pair of source blocks is such they have at least one base block in common with both source blocks of the pair and at least one base block not in common with the other source block of the pair. The encoding of a source block can be independent of content of other source blocks. Decoding to recover all of a desired set of the original source symbols can be done from a set of encoding symbols from a plurality of source blocks wherein the amount of encoding symbols from the first source block is less than the amount of source data in the first source block and likewise for the second source block.

Abstract: A receiving device for storing and accessing data transmitted from a source, the data generated from transport objects comprises multimedia content that uses a forward error correction code, is subject to network losses, and/or is transported interleaved. The device includes a receiving module configured to store the data in first access memory according to a page format, write the data formatted as pages to physical storage media, and generate a page structure map describing a relationship between the data written and a data structure of the multimedia content. An access module receives a request for a portion of the multimedia content, determines pages of data from the physical storage medium as including data corresponding to the requested portion according to the page structure map, stores the determined pages, and decodes the data corresponding to the requested portion from a requesting module. A media player receives the requested portion for consumption.

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

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.

Abstract: A multicasting system provides congestion control for multicasting using a dynamic layer scheme, where the aggregate sending rates of layers decline over time. Multicast packets are transmitted to layers that are joined by at least one host. A host maintains a reception rate by joining additional layers as the sending rates decline, a host reduces the reception rate by not joining additional layers as fast as the sending rates decline, thus allowing rate reduction even if the sender does not receive leave messages sent from a host.

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

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

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: Encoding of a plurality of encoded symbols is provided wherein an encoded symbol is generated from a combination of a first symbol generated from a first set of intermediate symbols and a second symbol generated from a second set of intermediate symbols, each set having at least one different coding parameter, wherein the intermediate symbols are generated based on the set of source symbols. A method of decoding data is also provided, wherein a set of intermediate symbols is decoded from a set of received encoded symbols, the intermediate symbols organized into a first and second sets of symbols for decoding, wherein intermediate symbols in the second set are permanently inactivated for the purpose of scheduling the decoding process to recover the intermediate symbols from the encoded symbols, wherein at least some of the source symbols are recovered from the decoded set of intermediate symbols.

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

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