Method and apparatus for time-multiplexed processing of multiple digital video programs

• US 7,046,677 B2
• Filed: 11/26/2003
• Issued: 05/16/2006
• Est. Priority Date: 11/27/2002
• Status: Active Grant

• Current Assignee: Imagine Communications Limited (Gores Broadcast Holdings LLC)
• Original Assignee: RGB Networks, Inc. (Gores Broadcast Holdings LLC)
• Inventors: Tom, Adam, Monta, Peter, Krause, Edward
• Primary Examiner(s): Nguyen, Hanh
• Assistant Examiner(s): HOANG, THAI D
• Application Number:
  US10/723,253
• Publication Number:
  US 20040160960A1
• Time in Patent Office: 902 Days
• Field of Search: 370230-236, 37039521-39531, 370412-418, 3703957-395
• US Class Current: 370/395.4
• CPC Class Codes: H04N 19/40 using video transcoding, i.e. partial or full decoding of a coded input stream followed by re-encoding of the decoded output stream
• CPC Class Codes: H04N 19/42 characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation H04N19/635 takes precedence
• CPC Class Codes: H04N 19/423 characterised by memory arrangements H04N19/433 takes precedence
• CPC Class Codes: H04N 19/436 using parallelised computational arrangements
• CPC Class Codes: H04N 19/61 in combination with predictive coding
• CPC Class Codes: H04N 21/23406 involving management of server-side video buffer
• CPC Class Codes: H04N 21/23424 involving splicing one content stream with another content stream, e.g. for inserting or substituting an advertisement
• CPC Class Codes: H04N 21/262 Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists scheduling strategies for dispatcher in multiprogramming arrangements G06F9/4881; arrangements for scheduling broadcast services or broadcast-related services H04H60/06; flow control in packet networks H04L47/10; establishing a time schedule or organising the servicing of application requests H04L67/62
• CPC Class Codes: H04N 21/26208 the scheduling operation being performed under constraints
• CPC Class Codes: H04N 21/42607 for processing the incoming bitstream
• CPC Class Codes: H04N 21/44016 involving splicing one content stream with another content stream, e.g. for substituting a video clip

Abstract

The present invention relates generally to the processing of multiple data streams with common resources. More particularly, this invention relates to a technique for time-multiplexed processing of, for example, multiple digital video programs. In one embodiment, an exemplary method provides for time-multiplexed processing of a set of digital streams includes storing each received packet in a random access memory. For each stream, the deadline for the arrival of the next packet at the receiver is determined and a priority based on the deadline is assigned. The stream with the highest assigned priority is identified as an identified stream. In some embodiments, the processing state of the identified stream is then restored. One or more packets of data corresponding to the identified stream are retrieved from random access memory to produce retrieved packets. The processing state is saved after the retrieved packets have been processed.

Claims

1. A method for processing a plurality of digital streams, wherein each digital stream includes packets sequenced for continuous presentation, said method comprising:

receiving packets for each of said plurality of digital streams and storing said packets in a buffer;

associating each of said packets with a respective stream of said plurality of digital streams;

assigning a priority to each packet, said priority being determined according to a delivery deadline for each of said packets;

assigning a tag to each to each packet identifying the assigned priority for the packet and an address of the packet in the buffer;

storing each tag in memory corresponding to the respective digital stream associated with each packet;

continuously monitoring the tags positioned at the memory output to identify the digital stream having the highest priority;

retrieving the packet identified by the tag at the output of the memory corresponding to the identified highest priority stream from the buffer according to said address;

determining when a new tag is present at the output of the memory after a gap in said tags for a particular one of the digital streams;

establishing the priority of the digital stream corresponding to said new tag with respect to the priority of the other digital streams; and

processing the packets from the plurality of data streams in order of priority.

2. The method of claim 1, further comprising:

selecting said packets for processing based on said priority; and

retrieving said selected packets from said buffer.

3. The method of claim 1, wherein:

said packets are retrieved in order of said priority.

4. The method of claim 1, further comprising:

assigning a priority to each of said plurality of digital streams.

5. The method of claim 4, wherein:

said assigning of said priority to each packet further comprises determining the priority of the stream associated with each packet.

6. The method of claim 1, wherein:

said priority is based on a current time interval before said deadline.

7. The method of claim 6, wherein:

said deadline is derived from a Decoding Time Stamp extracted from an associated packet header.

8. The method of claim 1, wherein:

said packets of each digital stream are arranged in sequences of packets.

9. The method of claim 8, wherein:

each sequence of packets is a representation of a video frame.

10. The method of claim 8, wherein:

each sequence of packets is a representation of an audio frame.

11. The method of claim 1, further comprising:

maintaining a state associated with each of said plurality of digital streams.

12. The method of claim 11, wherein:

said state includes parameters for said processing of said packets of each stream.

13. The method of claim 11, wherein:

said state includes pixel data representing at least one frame of video.

14. The method of claim 11, further comprising:

allocating memory for storing said state.

15. The method of claim 14, wherein:

said allocating memory includes recursively subdividing said memory into quadrants, where one of said quadrants cannot be further subdivided without at least one dimension becoming smaller than a corresponding dimension of a video or audio frame.

16. The method of claim 14, wherein:

said memory is allocated in pages, where each of said pages is a contiguous memory unit of a fixed size.

17. The method of claim 16, wherein:

unallocated pages are managed using a free list configured to manage unused pages of memory.

18. Apparatus for processing a plurality of digital streams, wherein each digital stream includes packets sequenced for continuous presentation, said apparatus comprising:

means for receiving packets for each of said plurality of digital streams and storing said packets in a buffer;

means for associating each of said packets with a respective stream of said plurality of digital streams;

means for assigning a priority to each packet, said priority being determined according to a delivery deadline for each of said packets;

means for assigning a tag to each to each packet identifying the assigned priority for the packet and an address of the packet in the buffer;

means for storing each tag in memory corresponding to the respective digital stream associated with each packet;

means for continuously monitoring the tags positioned at the memory output to identify the digital stream having the highest priority;

means for retrieving the packet identified by the tag at the output of the memory corresponding to the identified highest priority stream from the buffer according to said address;

means for determining when a new tag is present at the output of the memory after a gap in said tags for a particular one of the digital streams;

means for establishing the priority of the digital stream corresponding to said new tag with respect to the priority of the other digital streams; and

means for processing the packets from the plurality of digital streams in order of priority.

19. The apparatus of claim 18, further comprising:

means for selecting said packets for processing based on said priority; and

means for retrieving said selected packets from said buffer.

20. The apparatus of claim 18, further comprising:

means for assigning a priority to each of said plurality of digital streams.

21. The apparatus of claim 20, wherein:

said priority of each packet is further determined by the priority of the stream associated with each packet.

22. The apparatus of claim 21, further comprising:

a means for extracting a Decoding Time Stamp from an associated packet header, wherein said Decoding Time Stamp is used to derive said deadline.

23. The apparatus of claim 18, wherein:

said priority is based on a current time interval before said deadline.

24. The apparatus of claim 18, further comprising:

means for maintaining a state associated with each of said plurality of digital streams.

25. The apparatus of claim 24, wherein:

said means for maintaining a state includes a memory for storing processing parameters.

26. The apparatus of claim 24, wherein:

said means for maintaining said state includes memory for storing pixel data representing at least one frame of video.

27. The apparatus of claim 26, further comprising:

means for recursively subdividing said memory into quadrants.

28. The apparatus of claim 26, further comprising:

means for partitioning said memory into pages, where each of said pages is a contiguous memory unit of a fixed size.

29. The apparatus of claim 28, further comprising:

a free list for managing unused pages of memory.

30. The apparatus of claim 28, further comprising:

a translation look-aside buffer for mapping virtual addresses to physical page addresses.

31. The apparatus of claim 28, further comprising:

means for retrieving pages from memory and merging data into blocks of a requested size.

32. The apparatus of claim 31, further comprising:

a cache for storing one or more pages that have been retrieved from memory.