Method and system to enable simultaneous reception of plurality of services in DVB systems
View Patent ↗A method comprises dividing a time frequency frame into a plurality of slots, the frame having one or more radio-frequency (RF) channels, determining a maximum slot length, and scheduling service data in symbols such that all service data symbols are within the maximum slot length of symbols corresponding to at least one common service part.
1. A method, comprising:
dividing, by a processor, a time frequency flame into a plurality of slots, the flame having one or more radio-frequency (RF) channels;
determining, by the processor, a maximum slot length; and
scheduling, by the processor, service data in symbols such that all service data symbols are within the maximum slot length of symbols corresponding to at least one common service part.
2. The method of claim 1 , wherein the plurality of slots comprises one slot for each radio-frequency channel in the time frequency frame.
3. The method of claim 1 , wherein a number of slots in one or more RF channels is allocated to a service so that the slots on the one or more RF channels do not overlap with each other in time but are shifted with regard to each other with an amount that depends on a time frequency frame length and the number of allocated RF channels.
4. The method of claim 3 , wherein the one or more RF channels are shifted in accordance with:
shift
=
TF_frame
_length
N
R
F
,
wherein N RF is the number of radio frequency channels in the frame.
5. The method of claim 3 , wherein the maximum slot length is dependant on an amount of shifting of the RF channels and on a maximum tuning time for a receiver when changing radio frequency channels.
6. The method of claim 5 , wherein the maximum slot length is defined by
max_slot_length=shif−T tuning ,
wherein T tuning is the maximum tuning time for a receiver when changing radio frequency channels, and
wherein
shift
=
TF_frame
_length
N
RF
,
wherein N RF is the number of radio frequency channels in the frame.
7. The method of claim 1 , wherein the scheduling makes available multiple common service parts through hopping between radio-frequency channels.
8. The method of claim 7 , wherein the common service parts comprise program-specific and service information data.
9. The method of claim 1 , further comprising:
transmitting the time frequency frame to a receiving device.
10. A computer program product, embodied in a non-transitory computer-readable medium, comprising computer code that, when executed by a processor, causes an apparatus to:
divide a time frequency frame into a plurality of slots, the frame having one or more radio-frequency (RF) channels;
determine a maximum slot length; and
schedule service data in symbols such that all service data symbols are within the maximum slot length of symbols corresponding to at least one common service part.
11. An apparatus, comprising:
a processor; and
a memory unit communicatively connected to the processor and including:
computer code for dividing a time frequency frame into a plurality of slots, the frame having one or more radio-frequency channels;
computer code for determining a maximum slot length; and
computer code for scheduling service data in symbols such that all service data symbols are within the maximum slot length of symbols corresponding to at least one common service part.
12. The apparatus of claim 11 , wherein the plurality of slots comprises one slot for each radio-frequency channel in the time frequency frame.
13. The apparatus of claim 11 , wherein a number of slots in one or more RF channels is allocated to a service so that the slots on the one or more RF channels do not overlap with each other in time but are shifted with regard to each other with an amount that depends on a time frequency frame length and the number of allocated RF channels.
14. The apparatus of claim 13 , wherein the one or more RF channels are shifted in accordance with:
shift
=
TF_frame
_length
N
R
F
,
wherein N RF is the number of radio frequency channels in the frame.
15. The apparatus of claim 11 , wherein the maximum slot length is dependant on an amount of shifting of the RF channels and on a maximum tuning time for a receiver when changing radio frequency channels.
16. The apparatus of claim 15 , wherein the maximum slot length is defined by
max_slot_length=shift−T tuning ,
wherein T tuning is the maximum tuning time for a receiver when changing radio frequency channels, and
wherein
shift
=
TF_frame
_length
N
R
F
,
wherein N RF is the number of radio frequency channels in the frame.
17. The apparatus of claim 11 , wherein the scheduling makes available multiple common service parts through hopping between radio-frequency channels.
18. The apparatus of claim 17 , wherein the common service parts comprise program-specific and service information data.
19. An apparatus, comprising:
means for dividing a time frequency frame into a plurality of slots, the frame having one or more radio-frequency channels;
means for determining a maximum slot length; and
means for scheduling service data in symbols such that all service data symbols are within the maximum slot length of symbols corresponding to at least one common service part.