1. Field
Example aspects of the present invention generally relate to data coding and decoding and, more particularly, to systems and methods for forward error correction (FEC) coding and decoding in multi-link and/or multi-networks.
2. Related Art
U.S. Pat. Nos. 6,012,159, 6,272,658, 6,336,200, 6,570,843, 6,609,223, and 7,024,609 and U.S. patent application Ser. No. 11/276,225, filed on Feb. 17, 2006, and Ser. No. 11/516,197, filed Sep. 6, 2006, each patent and application of which is incorporated herein by reference, describe methods for applying forward error correction (FEC) to protect streams of data from outages. These methods also allow a receiver to recover data which is lost in outages.
FEC encoding sometimes may introduce latency. For example, if FEC is applied to a time window of x seconds, then the receiver component may be required to buffer at least x seconds of data to perform error correction decoding on the data before it can be output to a player process.
In many applications, such as for the transmission of video, it is desirable to begin outputting data with as little delay as possible. For example, if the user is switching channels between different video streams, it is undesirable to require the user to wait for several seconds before viewing the new video stream.
The usefulness of the forward error correction methods described in, for example, U.S. Pat. No. 6,609,223 increases as the time window increases (that is, the FEC methods are able to recover from larger outages when the time window is larger). Therefore, it is also desirable to allow the time windows used to be large, for example, 30 seconds or more.
In an example embodiment described herein, systems, methods, apparatus and computer program products for performing forward error correction are provided including outputting source data at a rate less than the rate of a source stream, building a buffer, FEC decoding the source data, and outputting the packets at a rate equal to the rate of the source stream.
In another example embodiment described herein, systems, methods, apparatus and computer program products for performing forward error correction are provided including outputting source data at a rate less than the rate of the source stream, building a buffer, correcting packet losses while the buffer is being built, and outputting reconstructed source packets at a rate equal to the rate of the source stream.
In a further example embodiment described herein, systems, methods, apparatus and computer program products for performing forward error correction are provided including transmitting an FEC encoded stream using a time window of t seconds, transmitting an unencoded stream consisting of source packets shifted t seconds with respect to the data in the source stream, receiving the FEC encoded stream and the unencoded stream, outputting the unencoded stream for the first t seconds, collecting data from the encoded stream, after t seconds, FEC decoding the FEC encoded stream, and outputting the decoded stream.
In yet another example embodiment described herein, systems, methods, apparatus and computer program products for performing forward error correction are provided including transmitting an FEC stream using a time window of t seconds, transmitting a second stream consisting of source packets shifted t seconds with respect to the data in the FEC stream, receiving the FEC stream and the second stream, outputting the second stream for the first t seconds, collecting data from the FEC stream, after t seconds, FEC decoding the FEC stream, and outputting the decoded FEC stream.
In another example embodiment described herein, systems, methods, apparatus and computer program products for performing forward error correction are provided including receiving information about when one or more receivers are operational, transmitting an FEC encoded stream using a time window of t seconds, transmitting an unencoded stream of source packets shifted t seconds with respect to the data in the source stream, where the unencoded stream is transmitted when a receiver is within the first t seconds of receiving it, receiving the FEC encoded stream and the second stream, outputting the unencoded stream for the first t seconds, collecting data from the encoded stream, after t seconds, FEC decoding the FEC encoded stream, and outputting the decoded stream.
In yet another embodiment described herein, a receiver for providing forward error correction is described. The receiver includes an output unit configured to output source data at a rate less than the rate of a source stream, a buffer, an FEC decoder configured to FEC decode the source data. The output unit is further configured to output the packets at a rate equal to the rate of the source stream.
In another embodiment, a receiver for providing forward error correction is described. The receiver includes an output unit configured to output source data at a rate less than the rate of the source stream, a buffer, a correction unit configured to correct packet losses while the buffer is being built. The output unit further configured to output reconstructed source packets at a rate equal to the rate of the source stream.
In yet another embodiment a system for providing forward error correction is provided. The system includes a transmitter to transmit an FEC encoded stream using a time window of t seconds and an unencoded stream consisting of source packets shifted t seconds with respect to the data in the source stream, and a receiver to receive the FEC encoded stream and the unencoded stream, to output the unencoded stream for the first t seconds, collect data from the encoded stream, FEC decode the FEC encoded stream after t seconds, and output the decoded stream.
In yet another embodiment, a system for providing forward error correction, is described. The system includes at least one transmitter to transmit an FEC stream using a time window of t seconds and a second stream consisting of source packets shifted t seconds with respect to the data in the FEC stream, and a receiver to receive the FEC stream and the second stream, output the second stream for the first t seconds, collect data from the FEC stream, FEC decoding the FEC stream after t seconds, and output the decoded FEC stream.
In an example embodiment described herein, a system for providing forward error correction is provided. The system includes at least one transmitter operable to receive information about when one or more receivers are operational, transmit an FEC encoded stream using a time window of t seconds and an unencoded stream of source packets shifted t seconds with respect to the data in the source stream, where the unencoded stream is transmitted when a receiver is within the first t seconds of receiving it, and a receiver operable to receive the FEC encoded stream and the second stream, output the unencoded stream for the first t seconds, collect data from the encoded stream, FEC decode the FEC encoded stream after t seconds, and output the decoded stream.
Further features and advantages, as well as the structure and operation, of various example embodiments of the present invention are described in detail below with reference to the accompanying drawings.
The features and advantages of the example embodiments of the invention presented herein will become more apparent from the detailed description set forth below when taken in conjunction with the drawings in which like reference numbers indicate identical or functionally similar elements.
The present invention is now described in more detail herein in terms of exemplary systems, methods, apparatus and computer program products for providing forward error correction with low latency to live streams in networks.
This is for convenience only and is not intended to limit the application of the present invention. In fact, after reading the following description, it will be apparent to one skilled in the relevant art(s) how to implement the following invention in alternative embodiments (e.g., in systems that transmit and receive content in the form of files, in systems which perform transmission over more than two networks, etc.).
Generally, the example embodiments described below describe methods and systems for applying FEC to a live stream of data while maintaining both the ability to start output quickly, and the ability to provide FEC protection across a large window of data. These methods provide quick output from the receiver at the expense of providing partial or no error correcting capability during the initial portion of the output.
The above system operates in accordance with what is referred to for convenience as case 1. In case 1, the output rate of the received packets is modified by FEC decoder and output rate controller 114. As described in the aforementioned patents and patent applications, the source data is included in the output stream. This source data can be accessed without applying FEC decoding and with little or no delay. In case 1, a transmitter 102 sends an FEC encoded data stream to one or more receivers, where the encoded data stream has the properties that (1) each receiver can begin decoding and outputting data after it has received the FEC encoded data stream for t seconds, and (2) the source data is included within the FEC encoded data stream, so that the packets of the source data which are received can be accessed without applying FEC decoding with little or no delay.
When each receiver 110 starts, it begins outputting the source data, without applying FEC decoding, at a rate less than the rate of the source stream, e.g., at 95% of the rate of the source stream. Because the output rate of the receiver is less than the input rate, receiver 110 can build up a buffer (not shown). When it has collected information in its buffer equal to the latency required to perform FEC decoding, receiver system 110 begins to perform FEC decoding and to output the packets at the normal rate (e.g., a rate equal to the rate of the source stream) using FEC decoder and output rate controller 114.
The packets can be processed at a lower than normal rate as well. For example, for a stream consisting of video and audio, it is possible to play the stream at a slightly slower rate than real-time without impacting the user experience. Changing video frame rate is straightforward, while changing audio rates often involves correcting for a shift in pitch.
In another example embodiment, referred to herein as case 2, the initial output rate is modified with partial decoding. As described above with respect to case 1, when receiver starts, it begins outputting the source data, without applying FEC decoding, at a rate less than the rate of the source stream. As the receiver system 110 begins to build up a buffer, it may be possible to correct for some packet losses, even before enough buffer is available to implement the complete FEC decoding process.
For example, when the FEC encoding consists of several shares which are interleaved as described in U.S. Pat. No. 6,609,223, and which may be shifted with respect to each other as described in U.S. application Ser. No. 11/516,197, it is possible to do the FEC decoding for a given share containing N source packets and K FEC packets when at least N packets have been received in total. In the decoding techniques described in aforementioned patents and patent applications the decoding process normally occurs after any of the packets from the given share are received, and before any of the corresponding source packets are output. The packets of the given share are sent evenly distributed within the time window of t seconds.
Partial decoding can take place whenever at least N packets of the share have been received (this may take place in less than t seconds, or in exactly t seconds if exactly N packets of the share are received at all, including the last packet), even if the output has not been delayed by t seconds. At the time decoding takes place, all of the source packets of the share can be recovered, but only the source packets whose output time has not yet come are useful—it is in this sense that the decoding is partial. For example, when the delay has built up to the point that the output packets are output t/2 seconds after their reception, recoverable source packets which lie in the second half of the share containing them can be recovered prior to the need to output them.
In this way, the ability to recover missing source packets builds up gradually and linearly as the buffer builds up, beginning with no ability to recover missing source packets, and ending with the properties described in the aforementioned patents and patent applications when the buffer has built up to include t seconds worth of data.
In an example embodiment, transmitter system 200 sends one data stream which is FEC encoded such that each receiver can begin outputting decoded data after it has received the FEC encoded data stream for t seconds. U.S. Pat. No. 6,609,223 and U.S. application Ser. No. 11/516,197, provide examples of transmitter/receiver encoding mechanisms having these properties. Transmitter system 200 sends a second stream consisting of source packets only, which are shifted t seconds by buffer 206 with respect to the data in the source stream. That is, the data in the unencoded stream corresponds to the data of the encoded stream t seconds in the past.
Referring to
Receiver system 400 processes a transmission received in accordance with case 3 as described above with respect to
Referring to
For a given receiver, the unencoded source stream used in case 3 described above is only used for t seconds. In an interactive application, where the transmitter receives information about when receivers are receiving the stream (i.e., case 4), the transmitter can send the unencoded source stream only when a receiver is within the first t seconds of receiving it. This saves the additional bandwidth, whenever a period of t seconds occurs without a receiver starting to receive the stream.
For many applications, such as television, it may be that most receivers start receiving the stream at close to the same time, and a significant bandwidth savings may occur.
In an alternative embodiment, the unencoded source stream for the first t seconds can be delivered to each receiver individually. The delivery can take place on an alternative means (i.e., channel or other mechanism). In addition, the unencoded source stream for the first t seconds may be delivered at a faster rate so as to arrive in less than t seconds.
The example embodiments of the invention (i.e., systems 100-600, and the processes described above, or any part(s) or function(s) thereof) may be implemented using hardware, software or a combination thereof and may be implemented in one or more computer systems or other processing systems. Useful machines for performing the operation of the example embodiments presented herein include general purpose digital computers or similar devices.
From a hardware standpoint, the transmitter and receiver systems described above typically include one or more components, such as one or more microprocessors, for performing the arithmetic and/or logical operations required for program execution, and storage media, such as one or more disk drives or memory cards (e.g., flash memory) for program and data storage, and a random access memory, for temporary data and program instruction storage. From a software standpoint, a processor typically includes software resident on a storage media (e.g., a disk drive or memory card), which, when executed, directs the processor in performing transmission and reception functions. The processor software may run on an operating system stored on the storage media, such as, for example, UNIX or Windows (e.g., NT, XP, Vista), Linux, and the like, and can adhere to various protocols. As is well known in the art, processors can run different operating systems, and can contain different types of software, each type devoted to a different function, such as handling and managing data/information from a particular source, or transforming data/information from one format into another format. It should thus be clear that the embodiments described herein are not to be construed as being limited for use with any particular type of server computer, and that any other suitable type of device for facilitating the exchange and storage of information may be employed instead.
The transmitter and receiver systems described above may include plural separate processors, where each is dedicated to a separate application, such as, for example, a data application, a voice application, and a video application.
Software embodiments of the example embodiments presented herein may be provided as a computer program product, or software, that may include an article of manufacture on a machine-accessible or machine-readable medium having instructions. The instructions on the machine-accessible or machine-readable medium may be used to program a computer system or other electronic device. The machine-readable medium may include, but is not limited to, floppy diskettes, optical disks, CD-ROMs, and magneto-optical disks or other type of media/machine-readable medium suitable for storing or transmitting electronic instructions. The techniques described herein are not limited to any particular software configuration. They may find applicability in any computing or processing environment. The terms “machine-accessible medium” or “machine-readable medium” used herein shall include any medium that is capable of storing, encoding, or transmitting a sequence of instructions for execution by the machine and that cause the machine to perform any one of the methods described herein. Furthermore, it is common in the art to speak of software, in one form or another (e.g., program, procedure, process, application, module, unit, logic, and so on) as taking an action or causing a result. Such expressions are merely a shorthand way of stating that the execution of the software by a processing system causes the processor to perform an action to produce a result.
While various example embodiments of the present invention have been described above, it should be understood that they have been presented by way of example, and not limitation. It will be apparent to persons skilled in the relevant art(s) that various changes in form and detail can be made therein. Thus, the present invention should not be limited by any of the above described example embodiments, but should be defined only in accordance with the following claims and their equivalents.
In addition, it should be understood that the
Further, the purpose of the foregoing Abstract is to enable the U.S. Patent and Trademark Office and the public generally, and especially the scientists, engineers and practitioners in the art who are not familiar with patent or legal terms or phraseology, to determine quickly from a cursory inspection the nature and essence of the technical disclosure of the application. The Abstract is not intended to be limiting as to the scope of the example embodiments presented herein in any way. It is also to be understood that the processes recited in the claims need not be performed in the order presented.
This application claims benefit of U.S. Provisional Application No. 60/829,910 filed on Oct. 18, 2006, the entire disclosure of which is incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
4009347 | Flemming et al. | Feb 1977 | A |
4222102 | Jansen et al. | Sep 1980 | A |
4525833 | Cau et al. | Jun 1985 | A |
4616338 | Helen et al. | Oct 1986 | A |
4718066 | Rogard | Jan 1988 | A |
4907277 | Callens et al. | Mar 1990 | A |
5122988 | Graeve | Jun 1992 | A |
5272675 | Kobayashi | Dec 1993 | A |
5388074 | Buckenmaier | Feb 1995 | A |
5485474 | Rabin | Jan 1996 | A |
5594490 | Dawson et al. | Jan 1997 | A |
5600663 | Ayanoglu et al. | Feb 1997 | A |
5617541 | Albanese et al. | Apr 1997 | A |
5631907 | Guarneri et al. | May 1997 | A |
5768533 | Ran | Jun 1998 | A |
5790524 | Bennett et al. | Aug 1998 | A |
5815514 | Gray | Sep 1998 | A |
5903574 | Lyons | May 1999 | A |
5959974 | Badt et al. | Sep 1999 | A |
6012159 | Fischer et al. | Jan 2000 | A |
6031818 | Lo | Feb 2000 | A |
6052819 | Barker et al. | Apr 2000 | A |
6104757 | Rhee | Aug 2000 | A |
6141788 | Rosenberg et al. | Oct 2000 | A |
6151696 | Miller et al. | Nov 2000 | A |
6189039 | Harvey et al. | Feb 2001 | B1 |
6249810 | Kiraly | Jun 2001 | B1 |
6272658 | Steele et al. | Aug 2001 | B1 |
6289054 | Rhee | Sep 2001 | B1 |
6307487 | Luby | Oct 2001 | B1 |
6317462 | Boyce | Nov 2001 | B1 |
6320520 | Luby | Nov 2001 | B1 |
6336200 | Wolfgang | Jan 2002 | B1 |
6370666 | Lou et al. | Apr 2002 | B1 |
6373406 | Luby | Apr 2002 | B2 |
6411223 | Haken et al. | Jun 2002 | B1 |
6434191 | Agrawal et al. | Aug 2002 | B1 |
6445717 | Gibson et al. | Sep 2002 | B1 |
6463080 | Wildey | Oct 2002 | B1 |
6486803 | Luby et al. | Nov 2002 | B1 |
6496477 | Perkins et al. | Dec 2002 | B1 |
6498821 | Jonas et al. | Dec 2002 | B2 |
6526022 | Chiu et al. | Feb 2003 | B1 |
6567929 | Bhagavath et al. | May 2003 | B1 |
6567948 | Steele et al. | May 2003 | B2 |
6570843 | Wolfgang | May 2003 | B1 |
6574213 | Anandakumar et al. | Jun 2003 | B1 |
6574795 | Carr | Jun 2003 | B1 |
6594798 | Chou et al. | Jul 2003 | B1 |
6606723 | Wolfgang | Aug 2003 | B2 |
6609223 | Wolfgang | Aug 2003 | B1 |
6614366 | Luby | Sep 2003 | B2 |
6671807 | Jaisimha et al. | Dec 2003 | B1 |
6693907 | Wesley et al. | Feb 2004 | B1 |
6701373 | Sakazawa et al. | Mar 2004 | B1 |
6735634 | Geagan, III et al. | May 2004 | B1 |
6765889 | Ludwig | Jul 2004 | B1 |
6782490 | Maxemchuk et al. | Aug 2004 | B2 |
6804244 | Anandakumar et al. | Oct 2004 | B1 |
6868083 | Apostolopoulos et al. | Mar 2005 | B2 |
6937582 | Kronestedt | Aug 2005 | B1 |
7024609 | Wolfgang et al. | Apr 2006 | B2 |
7068601 | Abdelilah et al. | Jun 2006 | B2 |
7139243 | Okumura | Nov 2006 | B2 |
7315967 | Azenko et al. | Jan 2008 | B2 |
7324578 | Kwon et al. | Jan 2008 | B2 |
7418651 | Luby et al. | Aug 2008 | B2 |
7425905 | Oberg | Sep 2008 | B1 |
7516387 | Arnold et al. | Apr 2009 | B2 |
7796517 | Chen et al. | Sep 2010 | B2 |
20010033611 | Grimwood et al. | Oct 2001 | A1 |
20010046271 | Jonas et al. | Nov 2001 | A1 |
20010047439 | Daniel et al. | Nov 2001 | A1 |
20020035730 | Ollikainen et al. | Mar 2002 | A1 |
20020097678 | Bisher, Jr. et al. | Jul 2002 | A1 |
20030009718 | Wolfgang et al. | Jan 2003 | A1 |
20030229839 | Wang et al. | Dec 2003 | A1 |
20040025186 | Jennings et al. | Feb 2004 | A1 |
20040170201 | Kubo et al. | Sep 2004 | A1 |
20050071602 | Niell et al. | Mar 2005 | A1 |
20060059409 | Lee | Mar 2006 | A1 |
20060064626 | Fischer et al. | Mar 2006 | A1 |
20060253763 | Oliva et al. | Nov 2006 | A1 |
20070022361 | Bauer et al. | Jan 2007 | A1 |
20070150791 | Gross et al. | Jun 2007 | A1 |
20070220405 | Arnold et al. | Sep 2007 | A1 |
20070266274 | Lin | Nov 2007 | A1 |
20080002580 | Kawada et al. | Jan 2008 | A1 |
20080117819 | Flott et al. | May 2008 | A1 |
20080244001 | Fang | Oct 2008 | A1 |
20080285476 | Rajakarunanayake | Nov 2008 | A1 |
20080298271 | Morinaga et al. | Dec 2008 | A1 |
20090177948 | Fischer et al. | Jul 2009 | A1 |
20090193314 | Melliar-Smith et al. | Jul 2009 | A1 |
20090210773 | Fang | Aug 2009 | A1 |
20100005178 | Sindelaru et al. | Jan 2010 | A1 |
20100218074 | Fang et al. | Aug 2010 | A1 |
Entry |
---|
Asmuth et al., “Proceedings of the 1982 Symposium on Security and Privacy,” IEEE Computer Society, Apr. 25-26, 1982, p. 156-169, Oakland CA. |
Karnin et al., “On Secret Sharing Systems,” IEEE Transactions on Information Theory, Jan. 1983, vol. IT-29, No. 1. |
MacKay, David J.C., “Information Theory, Inference, and Learning Algorithms,” Cambridge University Press, 2003. |
McAuley, Anthony J, “Reliable Broadband Communication Using a Burst Erasure Correcting Code,” SIGCOMM '90 Symposium, Sep. 1990, p. 297-306. |
McEliece et al., “On Sharing Secrets and Reed-Solomon Codes,” Communications of the ACM, Sep. 1981, vol. 24. |
Miller, C Kenneth, “Reliable Multicast Protocols: A Practical View”, Local Computer Networks Conference Proceedings, Nov. 1997, p. 369-378. |
Rabin, Michael O, “Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance,” Journal of the Assoc. For Computing Machinery, Apr. 1998, p. 335-348, vol. 36, No. 2. |
Rabin, Michael O, “Probabilistic Algorithms in Finite Fields,” SIAM J. Comput., May 1980, p. 273-280, vol. 9, No. 2. |
Shamir, Adi, “How to Share a Secret,” Communications of the ACM, Nov. 1979, p. 612-613, vol. 22, No. 11. |
Number | Date | Country | |
---|---|---|---|
20080098284 A1 | Apr 2008 | US |
Number | Date | Country | |
---|---|---|---|
60829910 | Oct 2006 | US |