CN102238429B - Channel Scheduling Method for Mobile TV Network - Google Patents

Abstract

The invention provides a channel scheduling method of a mobile television network. The channel scheduling method includes the following steps. Bit rates are defined for a plurality of channels, wherein the channels correspond to different bit rates. The bit rate of the pulses is defined to calculate a plurality of key values, wherein the key values correspond to the channels. And constructing a binary tree through an algorithm according to the key values, wherein a plurality of leaf nodes of the binary tree correspond to the channels. The multiple pulse periods of the channels are arranged according to the path from each leaf node to the root node of the binary tree, wherein each pulse period is used for transmitting pulses. Therefore, the coding efficiency of the television channel and the use efficiency of the network bandwidth can be improved.

Description

Channel Scheduling Method for Mobile TV Network

technical field

The present invention relates to a scheduling method, and in particular to a channel scheduling method of a mobile TV network.

Background technique

Currently, the streaming service provided by the IP-Based mobile TV system is broadcast or multicast through the Real-time Transport Protocol (RTP) to transmit time-based ) video stream, interactive service (interactive service) or notification service (notification service) is transmitted to the mobile TV client device.

According to the Digital Video Broadcasting-Handheld (DVB-H) standard, it provides a TV channel transmission method, which mainly gives each network frame a burst. Wherein, each network frame transmits the image content transmitted by a TV channel, and each pulse indicates the transmission time when the next pulse appears. When the mobile device receives the pulse, it will receive the information transmitted by the network frame corresponding to the pulse, and turn off the radio frequency (radio frequency, RF) circuit after receiving, and will not start the radio frequency circuit again until the next pulse is received. , which can save power consumption.

Since the type of programs transmitted by each channel may be different, the bit rate required by each TV channel will be different according to the type of program. For example, the bit rate required by sports programs is higher than that of talk programs. high. Therefore, the above-mentioned pulse method does not predict the bit rate of the TV channel. Moreover, when encoding each TV channel, the same bit rate is used for encoding, wherein the bit rate will be the largest among all TV channels, so that each TV channel can be encoded. According to the above, since the required bit rate of each channel is different, if the encoded TV channel is not the TV channel with the highest bit rate, network bandwidth will be wasted to place the part without information. Furthermore, encoding the part without information will only waste time and reduce the efficiency of encoding.

Contents of the invention

The invention provides a channel scheduling method of a mobile TV network, which can improve the coding efficiency of the TV channel and improve the bandwidth utilization efficiency of the mobile TV network.

The present invention proposes a channel scheduling method for a mobile TV network, which includes: defining bit rates of multiple channels, wherein these channels correspond to different bit rates; defining burst bit rates to calculate multiple key values, wherein these The key values correspond to these channels; according to these key values, a binary tree (binary tree) is constructed through an algorithm, in which multiple leaf nodes of the binary tree correspond to these channels; arranged according to the path from each leaf node to the root node of the binary tree Multiple burst periods of these channels, each of which is used to transmit a burst.

In an embodiment of the present invention, the above algorithm includes: defining multiple nodes and storing them in the queue, wherein these nodes correspond to these channels; taking out two first nodes in the queue, wherein the key values corresponding to these first nodes are The smallest one in the queue; define internal nodes according to these first nodes, wherein at least one of the first nodes is a child node of the internal node, and the first node of the child node of the non-internal node is stored back in the queue; the internal node is stored in the queue; when When the number of nodes in the queue is one, the node in the queue is the root node of the binary tree.

In an embodiment of the present invention, the above-mentioned step of defining internal nodes based on these first nodes includes: when the key values corresponding to these first nodes are the same, these first nodes are child nodes of internal nodes, and the corresponding key values of internal nodes The key value of these first nodes is the sum of the key values; when the key values corresponding to these first nodes are different, the false node is defined according to the first node of the smaller key value, and the false node and the smaller key value The first node is a child node of the internal node, and the key value corresponding to the internal node is the sum of the key value of the dummy node and the key value of the first node whichever has the smaller key value.

In an embodiment of the present invention, the key value corresponding to the fake node is the same as the one with the smaller key value among the first nodes.

In an embodiment of the present invention, the bit rate corresponding to the root node is less than or equal to the bandwidth of the mobile TV network.

In an embodiment of the present invention, the bit rate of the above pulse is the smallest bit rate among these channels.

In an embodiment of the present invention, each key value is a ratio of the bit rate of the corresponding channel to the bit rate of the burst.

In an embodiment of the present invention, the aforementioned channels are arranged in descending order according to their bit rates.

In an embodiment of the present invention, the bit rate of each of the above channels is i-1 times the smallest bit rate of these channels, and i is the number of channels of each channel.

Based on the above, the channel scheduling method of the mobile TV network of the present invention performs coding according to the bit rate of each TV channel, so as to improve the efficiency of TV channel coding. Moreover, the decoding will be performed according to the bit rate of each TV channel, so that the waste of power consumption during decoding can be avoided. In addition, according to the key value of each channel, a binary tree is constructed through an algorithm, and the pulse period allocated to each TV channel is arranged according to the path from the leaf node corresponding to each TV channel to the root node, so as to avoid pulse conflicts .

In order to make the above-mentioned features and advantages of the present invention more comprehensible, the following specific embodiments are described in detail in conjunction with the accompanying drawings.

Description of drawings

FIG. 1 is a flowchart of an algorithm of an embodiment of the present invention.

2A to 2H are schematic diagrams of building a binary tree according to an embodiment of the present invention;

FIG. 3 is a schematic diagram of a pulse period configuration according to an embodiment of the present invention;

FIG. 4 is a flowchart of a channel scheduling method for a mobile TV network according to an embodiment of the present invention.

Explanation of reference signs

210, 220, 230, 250, 260, 270, 280: nodes;

240: queue;

BT0～BT7: Pulse;

S110, S120, S130, S140, 150, 160, S410, S420, S430, S440: steps.

Detailed ways

In this embodiment, it is assumed that each TV channel in the mobile TV network corresponds to a bit rate (bit rate), and the bit rate of the program transmitted by each TV channel will be less than or equal to the bit rate corresponding to each TV channel Rate. For example, if the bit rate corresponding to the TV channel is 200k, the bit rate of the TV programs transmitted by the TV channel will be less than or equal to 200k, such as 190k, 180k, . . . and so on. And, it is defined here that the bit rate corresponding to the i-th TV channel t _i is equal to 2 ^i-1 ×r ₁ , where i is a positive integer, and r ₁ is a definable minimum bit rate.

A regularity can be concluded from the above, that is, for all TV channels, they can be arranged according to their bit rates. In other words, in terms of bit rate, TV channel t ₁ ≤t ₂ ≤...≤t _T , where T is a positive integer and the maximum number of channels, and the bit rate of TV channel t ₁ ~t _T is less than that of mobile TV The bandwidth of the network. Since the bit rate of the TV channel t ₁ is the smallest among the bit rates of the TV channels t ₁ -t _T , the bit rate of the TV channel t ₁ is the minimum bit rate r ₁ .

但是为了电视频道的信息可以完全传送，可定义移动电视网络的频宽会大于或等于电视频道t₁～t_T的比特率的总和，亦即移动电视网络的频宽

并且，可用脉冲(burst)的数量来来作为判断电视频道比特率的依据，如以最小比特率r₁作为一个脉冲的比特率大小，则电视频道t_i的比特率/电视频道t₁的比特率＝电视频道t_i具有的脉冲数量，并且每个电视频道的键值(key)会等于每个频道的脉冲数量，以键值作为判断每个电视频道比特率的依据。In addition, in order to make full use of the bandwidth of the mobile TV network, the bandwidth of the mobile TV network can be defined as the sum of the bit rates of TV channels t ₁ ~ t _T , that is, the bandwidth of the wireless network

However, in order to completely transmit the information of the TV channel, it can be defined that the bandwidth of the mobile TV network will be greater than or equal to the sum of the bit rates of the TV channels t ₁ ~ t _T , that is, the bandwidth of the mobile TV network

And, the quantity of pulse (burst) can be used as the basis for judging the TV channel bit rate, as the bit rate size of a pulse with the minimum bit rate r ₁ , then the bit rate of the TV channel t _i /the bit of the TV channel t ₁ Rate=the number of pulses that TV channel t _i has, and the key value (key) of each TV channel will be equal to the number of pulses of each channel, and the key value is used as the basis for judging the bit rate of each TV channel.

Next, an algorithm is provided in the embodiment of the present invention, and a binary tree (binary tree) is established according to the above-mentioned key value of each channel, and the leaf nodes of the binary tree respectively represent a TV channel. FIG. 1 is a flowchart of an algorithm of an embodiment of the present invention. Please refer to Fig. 1, in this algorithm, multiple nodes will be defined first, and the above nodes will be put into a queue (queue) (step S110), wherein these nodes will respectively correspond to TV channels t ₁ -t _T , And the key value of each node corresponds to the key value of the TV channel.

Next, the algorithm will take out two nodes with the smallest key value (i.e. the first node) from the queue (step S120), and generate and define an internal node based on these two nodes (step S130), wherein the two taken out nodes are at least One is a child node of an internal node, that is, the internal node is a parent node, and the key value of the internal node is the sum of the key values of its child nodes. And, among the two nodes that are taken out, the nodes that are not the child nodes of this internal node will also be stored back in the queue.

After the definition of the internal nodes is completed, the internal nodes will be stored in the queue (step S140). If the nodes in the queue are more than two (including two) (step S150), then take out two nodes with the smallest key value (step S120) from the queue, and generate a parent node according to the above-mentioned steps S130 and S140 (i.e. another internal node) and store it in the queue. When there is one node remaining in the queue (step S150), then stop computing, and the last remaining node in the queue will be regarded as the root (root) node, that is, the last remaining node in the queue is the root of the binary tree node (step S160), so as to complete the establishment of the above-mentioned binary tree.

For example, assume that there are currently TV channels t ₁ , t ₂ and t ₃ , and the bit rates of the TV channels t ₁ , t ₂ and t ₃ are 200k, 400k and 800k bits per second (bps) respectively. Here, the bit rate of the TV channel _t1 is taken as the size of a pulse, that is, the bit rate of the pulse is 200 kdps. According to the above, the key value of TV channel t ₁ is 1 (ie 200k/200k), the key value of TV channel t ₂ is 2 (ie 400k/200k), and the key value of TV channel t ₃ is 4 (ie 800k/200k) .

2A to 2H are schematic diagrams of building a binary tree according to an embodiment of the present invention. Please refer to FIG. 2A to FIG. 2H in sequence, the algorithm of this embodiment will first define nodes 210, 220 and 230, and store nodes 210, 220 and 230 in the queue 240, wherein nodes 210, 220 and 230 correspond to TV channels respectively t ₁ , t ₂ and t ₃ , that is, the key values of the nodes 210, 220 and 230 are 1, 2 and 4, respectively. Next, the algorithm of this embodiment will first extract the node 210 with the key value 1 and the node 220 with the key value 2. Since the key values of the nodes 210 and 220 are different, the node 220 with the larger key value will be stored back in the queue 240 at this time, and a false node 250 is defined according to the node 210, wherein the key value of the false node 250 is 1.

Next, define the internal node 260 as the parent node of the node 210 and the dummy node 250, and store the internal node 260 in the queue 240, wherein the key value of the internal node 260 is 2 (ie 1+1). At this time, there are nodes 220 with a key value of 2, nodes 230 with a key value of 4, and internal nodes 260 with a key value of 2 in the queue 240 . Since the number of nodes in the queue 240 is greater than 2, the node 220 with a key value of 2 and the internal node 260 are taken out from the queue 240 again. Since the key value of the node 220 is the same as that of the internal node 260, the internal node 270 will be defined according to the node 220 and the internal node 260, and the internal node 270 will be stored in the queue 240, wherein the internal node 270 is the parent of the node 220 and the internal node 260 node, and the key value of the internal node 270 is 4 (ie 2+2).

At this time, there are node 230 and internal node 270 with a key value of 4 in the queue 240, so node 230 and internal node 270 will be taken out, and internal node 280 is defined accordingly and stored back in the queue 240, wherein internal node 280 is node 230 and the parent node of the internal node 270, and the key value of the internal node 280 is 8 (ie 4+4). At this time, there is only one node left in the queue 240 (namely, the internal node 280), so the internal node 280 with a key value of 8 is the root node of the binary tree. Moreover, a binary tree including nodes corresponding to TV channels t ₁ , t ₂ and t ₃ can be formed according to the relationship of the above nodes. This binary tree is shown in FIG. 2H and corresponds to TV channels t ₁ , t ₂ and t t The node of ₃ is the leaf node of this binary tree. In terms of bit rate, the bit rate of the internal node 280 (i.e. the root node) will be greater than the sum of the bit rates of TV channels _t1 , _t2 and _t3 , so the bit rate corresponding to the internal node 280 can be equal to that of the mobile TV network bandwidth. Alternatively, the bit rate corresponding to the internal node 280 may also be smaller than the bandwidth of the mobile TV network.

Then, in order to prevent pulse collision, we divide the bandwidth R of the mobile TV network by the pulse size to obtain the total number of pulses in a network frame, and the key value of the internal node 280 can be equal to or less than the total number of pulses in a network frame quantity. Moreover, the burst duration of each pulse can be determined by using the binary tree constructed by the above algorithm. Please refer to FIG. 2H , take the binary tree in FIG. 2H as an example, and assume that the binary number corresponding to the left branch of each node is 0, and the binary number corresponding to the right branch of each node is 1.

Taking TV channel _t1 as an example, the key value of TV channel _t1 is 1, that is, TV channel t1 is allocated to ₁ pulse in one network frame. And, the path from the node 210 corresponding to TV channel _t1 to the root node (i.e. internal node 280) is 011, so the pulse period allocated to TV channel _t1 is the 4th pulse period in the network frame (this is because the binary number is changed from 000 start), as shown in Figure 3, TV channel _t1 is allocated to the pulse period corresponding to pulse BT3. Taking TV channel _t2 as an example, the key value of TV channel _t2 is 2, that is, TV channel t2 is assigned ₂ bursts in one network frame. Also, the path from node 220 corresponding to TV channel _t2 to the root node 280 is 01. Because the depth of binary tree shown in Fig. 2H is 3, so TV channel t ₂ should obtain the binary number of 3 digits and just can correspond to the pulse period, fill X at the high position of deficiency here, wherein X can be 0 or 1. Accordingly, the binary number corresponding to TV channel _t2 should be X01, so the pulse period assigned to TV channel _t2 is the 2nd (ie 001) and 6th (ie 101) pulse periods in the network frame, as shown in Figure 3 , TV channel _t2 is assigned to the pulse periods corresponding to pulses BT1 and BT5.

Taking TV channel _t3 as an example, the key value of TV channel _t3 is 4, that is, TV channel _t3 is assigned 4 bursts in one network frame. Also, the path from the node 230 corresponding to the TV channel _t3 to the root node 280 is 0. Similarly, since the depth of the binary tree is 3, the binary number corresponding to TV channel t ₃ should be XX0, so the pulse period allocated to TV channel t ₂ is the first (ie 000), 3 (ie 010) in the network frame ), 5 (ie 100) and 7 (ie 110) pulse periods, as shown in Figure 3, TV channel _t2 is allocated to the pulse periods corresponding to pulses BT0, BT2, BT4 and BT6. According to the above, the pulse periods allocated to the TV channels t ₁ -t ₃ do not overlap, thereby preventing pulse collisions, and the pulses used by the TV channels t ₁ -t ₃ can be sorted to reduce the waste of network bandwidth. Furthermore, the TV channels t ₁ -t ₃ are coded according to their bit rates, so the coding efficiency can be improved and the decoding power consumption can be reduced.

It is worth mentioning that in the above embodiment, the binary number corresponding to the left branch of each node is 0, and the binary number corresponding to the right branch of each node is 1. However, in other embodiments, the binary number corresponding to the left branch of each node may be 1, and the binary number corresponding to the right branch of each node may be 0. Moreover, according to the above description, the pulse period of each channel can be determined according to the path from the node corresponding to each channel to the root node.

According to the above, a channel scheduling method for a mobile TV network can be summarized. FIG. 4 is a flowchart of a channel scheduling method for a mobile TV network according to an embodiment of the invention. Please refer to FIG. 4, first define the bit rates of multiple TV channels (step S410). And, define the bit rate of the pulse to calculate the key value of each TV channel (step S420). Next, construct a binary tree through an algorithm according to the key value of each channel (step S430). Finally, arrange the pulse periods allocated to each TV channel according to the path from the leaf node corresponding to each TV channel to the root node of the binary tree (step S440 ). Wherein, the details of each step may refer to the above description, which will not be repeated here.

To sum up, the channel scheduling method of the mobile TV network according to the embodiment of the present invention performs coding according to the bit rate of each TV channel, so as to improve the coding efficiency. Moreover, the decoding will be performed according to the bit rate of each TV channel, so that the waste of power consumption during decoding can be avoided. In addition, according to the key value of each channel, a binary tree is constructed through an algorithm, and the pulse periods allocated to each TV channel are arranged according to the path from the leaf node corresponding to each TV channel to the root node, so as to avoid the pulse period conflict.

Although the present invention has been described above with the embodiments, it is not intended to limit the present invention. Anyone with ordinary knowledge in the technical field can make some changes and modifications without departing from the spirit and scope of the present invention. Therefore, this The protection scope of the invention shall be determined by the claims.

Claims (6)

1. A channel scheduling method for a mobile television network, comprising: defining bit rates for a plurality of channels, wherein the channels correspond to different bit rates; defining a burst bit rate to calculate a plurality of key values, wherein the key values correspond to the channels; Constructing a binary tree through an algorithm according to the key value, wherein a plurality of leaf nodes of the binary tree correspond to the channels, the bit rate of the pulse is the smallest bit rate among the channels, and each The key value is the ratio of the bit rate of the corresponding channel to the bit rate of the burst; and, arranging a plurality of burst periods of the channel according to a path from each of the leaf nodes to a node of the binary tree, wherein each of the burst periods is used to transmit the burst; Among them, the algorithm includes: defining multiple nodes and storing them in a queue, wherein the nodes correspond to the channels; Taking out two first nodes in the queue, wherein the key value corresponding to the first node is the smallest in the queue; An internal node is defined according to the first node, wherein at least one of the first nodes is a child node of the internal node, and the first node that is not a child node of the internal node is stored back in the queue; deposit the internal node into the queue; and, When the number of nodes in the queue is one, the node in the queue is the root node of the binary tree. 2. The channel scheduling method of the mobile TV network according to claim 1, wherein the step of defining the internal node according to the first node comprises: When the key values corresponding to the first nodes are the same, the first node is a child node of the internal node, and the key value corresponding to the internal node is the sum of the key values of the first node; and, When the key values corresponding to the first nodes are different, a false node is defined according to the first node with the smaller key value, and the false node and the first node with the smaller key value are child nodes of the internal node, The key value corresponding to the internal node is the sum of the key value of the dummy node and the key value of the first node whose key value is smaller. 3. The channel scheduling method for a mobile TV network according to claim 2, wherein the key value corresponding to the false node is the same as the one with the smaller key value in the first node. 4. The channel scheduling method of the mobile TV network according to claim 1, wherein the bit rate corresponding to the root node is less than or equal to the bandwidth of the mobile TV network. 5. The channel scheduling method of the mobile TV network according to claim 1, wherein the channels are arranged in ascending order according to their bit rates. 6. The channel scheduling method of the mobile TV network according to claim 5, wherein the bit rate of each channel is the i-1 power times of two of the bit rate minimum in the channels, and i is each channel number of the channel mentioned above.

Images