IP Library Granted Patent US 8,396,082
Granted Patent B2
US 8,396,082 · App. 11/758,613 · Granted Mar 12, 2013

Time-interleaved simulcast for tune-in reduction

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,396,082
App. No.
11/758,613
Filed
Jun 5, 2007
Granted
Mar 12, 2013
Kind
B2
Art Unit
2464
USPC
370/473
Abstract

A system and method for providing faster tuning into a chosen program in a time-sliced multicast and/or broadcast transmission environment. Multimedia data of the same source material but of different transmission and presentation characteristics are coded and compressed. According to various embodiments, simulcast streams of a program are time-sliced, placed maximally apart from each other in terms of transmission time, and sent over the channel.

Claims (97)

1. A method, comprising:

generating a first coded data stream and a second coded data stream both representing the same content, the first coded data stream and the second coded data stream being independently decodable from each other;

transmitting portions of the first coded data stream in first and second time-sliced bursts; and

transmitting a portion of the second coded data stream in a third time-sliced burst,

wherein the transmission of the portions of the first and second coded data streams do not overlap with each other, and occur subsequently to each other in transmission order and substantially without delay between transmission of data.

2. The method of claim 1 , wherein a content rendering duration of each of the first, second and third time-sliced bursts is substantially equal.

3. The method of claim 2 , wherein a transmission time of the third time-sliced burst is placed substantially in the middle of an interval between transmission times of the first time-sliced burst and the second time-sliced burst.

4. The method of claim 3 , wherein a content rendering range of the third time-sliced burst starts substantially from the middle of content rendering start times of the first and the second time-sliced bursts.

5. The method of claim 3 , wherein a content rendering range of the third time-sliced burst starts substantially from the same position as a content rendering start time of the first time-sliced burst.

6. The method of claim 1 , further comprising generating and transmitting an indication of the similarity of a reference picture management of the first coded data stream and the second coded data stream.

7. A computer program product, embodied in a non-transitory computer-readable medium, comprising computer code configured to:

generate a first coded data stream and a second coded data stream both representing the same content, the first coded data stream and the second coded data stream being independently decodable from each other;

transmit portions of the first coded data stream in first and second time-sliced bursts; and

transmit a portion of the second coded data stream in a third time-sliced burst,

wherein the transmission of the portions of the first and second coded data streams do not overlap with each other, and occur subsequently to each other in transmission order and substantially without delay between transmission of data.

8. An apparatus, comprising:

a processor; and

a memory unit communicatively connected to the processor and including:

computer code for generating a first coded data stream and a second coded data stream both representing the same content, the first coded data stream and the second coded data stream being independently decodable from each other;

computer code for transmitting portions of the first coded data stream in first and second time-sliced bursts; and

computer code for transmitting a portion of the second coded data stream in a third time-sliced burst,

wherein the transmission of the portions of the first and second coded data streams do not overlap with each other, and occur subsequently to each other in transmission order and substantially without delay between transmission of data.

9. The apparatus of claim 8 , wherein a content rendering duration of each of the first, second and third time-sliced bursts is substantially equal.

10. The apparatus of claim 9 , wherein a transmission time of the third time-sliced burst is placed substantially in the middle of an interval between transmission times of the first time-sliced burst and the second time-sliced burst.

11. The apparatus of claim 10 , wherein a content rendering range of the third time-sliced burst starts substantially from the middle of content rendering start times of the first and the second time-sliced bursts.

12. The apparatus of claim 10 , wherein a content rendering range of the third time-sliced burst starts substantially from the same position as a content rendering start time of the first time-sliced burst.

13. A data transmission system, comprising:

means for generating a first coded data stream and a second coded data stream both representing the same, the first coded data stream and the second coded data stream being independently decodable from each other;

means for transmitting portions of the first coded data stream in first and second time-sliced bursts; and

means for transmitting a portion of the second coded data stream in a third time-sliced burst,

wherein the transmission of the portions of the first and second coded data streams do not overlap with each other, and occur subsequently to each other in transmission order and substantially without delay between transmission of data.

14. The system of claim 13 , wherein a content rendering duration of each of the first, second and third time-sliced bursts is substantially equal.

15. The system of claim 14 , wherein a transmission time of the third time-sliced burst is placed substantially in the middle of an interval between transmission times of the first time-sliced burst and the second time-sliced burst.

16. A method, comprising:

receiving a time-sliced burst of a first coded data stream and, subsequently, time-sliced bursts of a second coded data stream, both the first coded data stream and the second coded data stream representing the same content, the first coded data stream and the second coded data stream being independently decodable from each other, the first coded data stream and the second coded data stream being conveyed in non-overlapping time-slices, and subsequently to each other in transmission order and substantially without delay between transmission of data;

decoding a subset of the time-sliced burst of the received first coded data stream; and

decoding a subset of the time-sliced bursts of the received second coded data stream.

17. The method of claim 16 , wherein the decoding of the subset of the time-sliced burst of the received first coded data stream and the decoding of the subset of the time-sliced bursts of the received second coded data stream result in time-wise non-overlapping decoded samples of the content.

18. The method of claim 17 , wherein the time-wise non-overlapping decoded samples of the content represent a continuous signal.

19. The method of claim 16 , wherein the time-sliced burst of the first coded data stream is received before any of the time-sliced bursts of the second coded data stream.

20. A computer program product, embodied in a non-transitory computer-readable medium, comprising computer code configured to:

receive a time-sliced burst of a first coded data stream and, subsequently, time-sliced bursts of a second coded data stream, both the first coded data stream and the second coded data stream representing the same content, the first coded data stream and the second coded data stream being independently decodable from each other, the first coded data stream and the second coded data stream being conveyed in non-overlapping time-slices, and subsequently to each other in transmission order and substantially without delay between transmission of data;

decode a subset of the time-sliced burst of the received first coded data stream; and

decode a subset of the time-sliced bursts of the received second coded data stream.

21. An apparatus, comprising:

a processor; and

a memory unit communicatively connected to the processor and including:

computer code for processing a received time-sliced burst of a first coded data stream and, subsequently, time-sliced bursts of a second coded data stream, both the first coded data stream and the second coded data stream representing the same content, the first coded data stream and the second coded data stream being independently decodable from each other, the first coded data stream and the second coded data stream being conveyed in non-overlapping time-slices, and subsequently to each other in transmission order and substantially without delay between transmission of data;

computer code for decoding a subset of the time-sliced burst of the received first coded data stream; and

computer code for decoding a subset of the time-sliced bursts of the received second coded data stream.

22. The apparatus of claim 21 , wherein decoding the subset of the time-sliced burst of the received first coded data stream and decoding the subset of the time-sliced bursts of the received second coded data stream results into time-wise non-overlapping decoded samples of the content.

23. The apparatus of claim 22 , wherein the time-wise non-overlapping decoded samples of the content represent a continuous signal.

24. The apparatus of claim 21 , wherein the time-sliced burst of the first coded data stream is received before any of the time-sliced bursts of the second coded data stream.

25. An apparatus, comprising:

means for receiving a time-sliced burst of a first coded data stream and, subsequently, time-sliced bursts of a second coded data stream, both the first coded data stream and the second coded data stream representing the same content, the first coded data stream and the second coded data stream being independently decodable from each other, the first coded data stream and the second coded data stream being conveyed in non-overlapping time-slices, and subsequently to each other in transmission order and substantially without delay between transmission of data;

means for decoding a subset of the time-sliced burst of the received first coded data stream; and

means for decoding a subset of the time-sliced bursts of the received second coded data stream.

26. The apparatus of claim 25 , wherein the decoding of the subset of the time-sliced burst of the received first coded data stream and the decoding of the subset of the time-sliced bursts of the received second coded data stream result in time-wise non-overlapping decoded samples of the content.

27. The apparatus of claim 26 , wherein the time-wise non-overlapping decoded samples of the content represent a continuous signal.

28. The apparatus of claim 25 , wherein the time-sliced burst of the first coded data stream is received before any of the time-sliced bursts of the second coded data stream.

29. The apparatus of claim 28 , wherein the apparatus is configured to decode and render the second coded stream.

30. A method, comprising:

receiving a first time-sliced burst of a first coded data stream;

identifying an unrecoverable error in the first time-sliced burst;

receiving a second time-sliced burst of a second coded stream, wherein the second time-sliced bust is subsequent to the first time-sliced burst in transmission order; and

in response to the identification of the unrecoverable error, decoding a subset of the content of the second time-sliced burst to conceal the unrecoverable error in the first time-sliced burst,

wherein the first coded data stream and the second coded data stream are both representing the same content, the first coded data stream and the second coded data stream are independently decodable from each other, and wherein the first coded data stream and the second coded data stream are conveyed in non-overlapping time-sliced bursts and substantially without delay between transmission of data.

31. The method of claim 30 , wherein portions of the first coded stream are provided in the first and second time-sliced bursts, a portion of the second coded data stream is provided in a third time-sliced burst, and wherein the portions of the first and second coded data streams do not overlap with each other.

32. A computer program product, embodied in a non-transitory computer-readable medium, comprising computer code configured to perform:

receive a first time-sliced burst of a first coded data stream;

identify an unrecoverable error in the first time-sliced burst;

receive a second time-sliced burst of a second coded stream, wherein the second time-sliced bust is subsequent to the first time-sliced burst in transmission order; and

in response to the identification of the unrecoverable error, decode a subset of the content of the second time-sliced burst to conceal the unrecoverable error in the first time-sliced burst,

wherein the first coded data stream and the second coded data stream are both representing the same content, the first coded data stream and the second coded data stream are independently decodable from each other, and wherein the first coded data stream and the second coded data stream are conveyed in non-overlapping time-sliced bursts and substantially without delay between transmission of data.

33. An apparatus, comprising:

a processor; and

a memory unit communicatively connected to the processor and including:

computer code for processing a received first time-sliced burst of a first coded data stream;

computer code for identifying an unrecoverable error in the first time-sliced burst;

computer code for processing a received second time-sliced burst of a second coded stream, wherein the second time-sliced bust is subsequent to the first time-sliced burst in transmission order; and

computer code for, in response to the identification of the unrecoverable error, decoding a subset of the content of the second time-sliced burst to conceal the unrecoverable error in the first time-sliced burst,

wherein the first coded data stream and the second coded data stream are both representing the same content, the first coded data stream and the second coded data stream are independently decodable from each other, and wherein the first coded data stream and the second coded data stream are conveyed in non-overlapping time-sliced bursts and substantially without delay between transmission of data.

34. The apparatus of claim 33 , wherein portions of the first coded stream are provided in the first and second time-sliced bursts, a portion of the second coded data stream is provided in a third time-sliced burst, and wherein the portions of the first and second coded data streams do not overlap with each other.

35. An apparatus, comprising:

means for receiving a first time-sliced burst of a first coded data stream;

means for identifying an unrecoverable error in the first time-sliced burst;

means for receiving a second time-sliced burst of a second coded stream, wherein the second time-sliced bust is subsequent to the first time-sliced burst in transmission order; and

means for, in response to the identification of the unrecoverable error, decoding a subset of the content of the second time-sliced burst to conceal the unrecoverable error in the first time-sliced burst,

wherein the first coded data stream and the second coded data stream are both representing the same content, the first coded data stream and the second coded data stream are independently decodable from each other, and wherein the first coded data stream and the second coded data stream are conveyed in non-overlapping time-sliced bursts and substantially without delay between transmission of data.

36. The apparatus of claim 35 , wherein portions of the first coded stream are provided in the first and second time-sliced bursts, a portion of the second coded data stream is provided in a third time-sliced burst, and wherein the portions of the first and second coded data streams do not overlap with each other.

37. The method of claim 30 , further comprising:

receiving an indication of the similarity of a reference picture management of the first coded data stream and the second coded data stream; and

in response to an indication of identical reference picture management, utilizing a reference picture resulting from decoding of the second coded data stream.

38. The method of claim 30 , wherein the decoding of the subset of the content of the second time-sliced burst is initiated from a random-access point.

39. The method of claim 38 , further comprising:

receiving an indication of the similarity of a reference picture management of the first coded data stream and the second coded data stream; and

in response to an indication of different reference picture management, initiating the decoding of the subset of the content of the second time-sliced burst from the random-access point.

Assignments (5)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 2, 2023
From: CONVERSANT WIRELESS LICENSING S.A R.L.
To: CONVERSANT WIRELESS LICENSING LTD.
Reel/Frame 063507/0900 →
RELEASE OF SECURITY INTEREST Recorded Apr 13, 2021
From: CPPIB CREDIT INVESTMENTS INC.
To: CONVERSANT WIRELESS LICENSING S.A R.L.
Reel/Frame 055910/0698 →
AMENDED AND RESTATED U.S. PATENT SECURITY AGREEMENT (FOR NON-U.S. GRANTORS) Recorded Aug 22, 2018
From: CONVERSANT WIRELESS LICENSING S.A R.L.
To: CPPIB CREDIT INVESTMENTS, INC.
Reel/Frame 046897/0001 →
CHANGE OF NAME Recorded Oct 20, 2017
From: CORE WIRELESS LICENSING S.A.R.L.
To: CONVERSANT WIRELESS LICENSING S.A R.L.
Reel/Frame 044242/0401 →
UCC FINANCING STATEMENT AMENDMENT - DELETION OF SECURED PARTY Recorded Aug 30, 2016
From: NOKIA CORPORATION
To: MICROSOFT CORPORATION
Reel/Frame 039872/0112 →