CN102238429B - Channel scheduling method for mobile television network - Google Patents

Channel scheduling method for mobile television network Download PDF

Info

Publication number
CN102238429B
CN102238429B CN 201010167204 CN201010167204A CN102238429B CN 102238429 B CN102238429 B CN 102238429B CN 201010167204 CN201010167204 CN 201010167204 CN 201010167204 A CN201010167204 A CN 201010167204A CN 102238429 B CN102238429 B CN 102238429B
Authority
CN
Grant status
Grant
Patent type
Prior art keywords
channel
scheduling
network
method
mobile
Prior art date
Application number
CN 201010167204
Other languages
Chinese (zh)
Other versions
CN102238429A (en )
Inventor
锺兴龙
Original Assignee
宏碁股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Grant date

Links

Abstract

本发明提供一种移动电视网络的频道排程方法。 The present invention provides a mobile television network channel scheduling method. 此频道排程方法包括下列步骤。 This channel scheduling method comprises the following steps. 定义多个频道的比特率,其中这些频道对应不同比特率。 Define a plurality of bit rate channels, wherein the channels correspond to different bit rates. 定义脉冲的比特率以计算多个键值,其中这些键值对应这些频道。 Bit rate to calculate a plurality of pulses defined key, wherein the key corresponding to these channels. 依据这些键值并经由算法构建二元树,其中二元树的多个叶节点对应这些频道。 According to these keys via the dual-tree algorithm to construct, wherein the plurality of leaf nodes corresponding to these channels for binary trees. 依据每一叶节点至二元树的根节点的路径排列这些频道的多个脉冲期间,其中每一脉冲期间用以传送脉冲。 During these channels are arranged a plurality of pulses based on the path for each leaf node to the root node of the dual-tree, wherein during each transfer pulse to pulse. 据此,可提高电视频道的编码效率及网络频宽的使用效率。 Accordingly, more efficient use of network bandwidth and coding efficiency of television channels.

Description

移动电视网络的频道排程方法 Mobile TV network channel scheduling method

技术领域 FIELD

[0001] 本发明是有关于一种排程方法,且特别是有关于一种移动电视网络的频道排程方法。 [0001] The present invention relates to a scheduling method, and more particularly relates to a mobile television network channel scheduling method.

背景技术 Background technique

[0002]目前IP-Based移动电视系统所提供的串流服务,是以广播(broadcast)或群播(multicast)方式透过实时传输协议(Real-time Transport Protocol, RTP)来将具有时基(time-based)的影音串流、互动服务(interactiveservice)或提示服务(notificationservice)传送给移动电视客户端装置。 [0002] The stream's current IP-Based Mobile TV service provided by the system, is broadcast (broadcast) or multicast (multicast) way through the real-time transport protocol (Real-time Transport Protocol, RTP) will have to base ( time-based) video streams, interactive services (interactiveservice) or prompt service (NotificationService) to the mobile TV client device.

[0003]根据数字视讯手持广播(Digital Video Broadcasting-Handheld, DVB-H)的标准,其提供了一个电视频道的传送方法,其主要是给予每一个网络帧(frame) —个脉冲(burst)。 [0003] The digital video Broadcast-Handheld (Digital Video Broadcasting-Handheld, DVB-H) standard, which provides a transmission method for a television channel, which is mainly given to each network frame (frame) - pulses (burst). 其中,每一个网络帧传送一个电视频道所传递的影像内容,并且每一个脉冲会指出下一个脉冲出现的传送时间。 Wherein each network frame transmitting video contents delivered by a television channel, and each pulse will be noted that the transmission time of the next pulse occurs. 当行动装置接收到脉冲后,便会接收脉冲所对应的网络帧所传送的信息,并在接收完毕后关闭射频(radio frequency, RF)电路,直到接收到下一次脉冲出现才会再次启动射频电路,以此可节省电力消耗。 When the mobile device receives a pulse, the pulse will receive information corresponding to the transmitted network frames, and after receiving the finished off the RF (radio frequency, RF) circuit, a pulse will not occur until receiving the RF circuitry to start again in order to save power consumption.

[0004] 由于每一个频道所传递的节目类型可能会不同,因此每一个电视频道所需的比特率(bit rate)会对应其节目类型而不一样,例如体育性节目所需要的比特率较谈话性节目来得高。 [0004] Since the program type of each channel is transmitted may be different, and therefore each of a desired television channel bit rate (bit rate) which will correspond to the same type of program rather than, for example of sports program than the required bit rate talk of the program is more high. 因此,上述脉冲的方式并不能推测电视频道的比特率。 Thus, the pulse mode and not the estimated bit rate channels. 并且,在对每一电视频道编码时,则使用相同的比特率来进行编码,其中比特率会以所有电视频道中最大者为准,以使每一个电视频道都能被编码。 Further, when encoding each television channel, using the same bit rate to encode, wherein bitrate based on all television channels greatest, so that each TV channel can be encoded. 依据上述,由于每一频道所需的比特率不同,若被编码的电视频道不是比特率最大的电视频道,则会浪费网络频宽来放置无信息的部份。 Based on the above, due to the different bit rates required for each channel, if they are not encoded television channel bit rate of the largest television channel, will be a waste of network bandwidth to place part of the free information. 再者,对无信息的部份进行编码只会浪费时间,并且会降低编码的效率。 Furthermore, no part of the information is encoded only a waste of time, and will reduce the efficiency of coding.

发明内容 SUMMARY

[0005] 本发明提供一种移动电视网络的频道排程方法,可以提高电视频道的编码效率,并且提高移动电视网络的频宽使用效率。 [0005] The present invention provides a mobile television network channel scheduling method, the coding efficiency of the TV channel bandwidth and more efficient use of the mobile television network.

[0006] 本发明提出一种移动电视网络的频道排程方法,其包括:定义多个频道的比特率,其中这些频道对应不同比特率;定义脉冲(burst)的比特率以计算多个键值,其中这些键值对应这些频道;依据这些键值并经由算法构建二元树(binary tree),其中二元树的多个叶节点对应这些频道;依据每一叶节点至二元树的根节点的路径排列这些频道的多个脉冲期间(burst during),其中每一脉冲期间用以传送脉冲。 [0006] The present invention proposes a channel scheduling method for a mobile television network, comprising: defining a plurality of channels, bit rate, wherein these bit rates corresponding to different channels; defined pulses (Burst) bit rate to calculate a plurality of keys wherein these keys corresponding to these channels; according to these keys via the dual-tree algorithm constructs (binary tree), where the plurality of leaf nodes corresponding to these channels for binary trees; basis for each leaf node to the root node for binary trees during a plurality of pulses arranged in the path of these channels (burst during), wherein for transmitting pulses during each pulse.

[0007] 在本发明一实施例中,上述算法包括:定义多个节点并存放至队列中,其中这些节点对应这些频道;取出队列中的两个第一节点,其中这些第一节点所对应的键值为队列中最小者;依据这些第一节点定义内部节点,其中至少一个第一节点为内部节点的子节点,并且非内部节点的子节点的第一节点存放回队列;将内部节点存放至队列;当队列的节点数为一时,队列中的节点为二元树的根节点。 [0007] In an embodiment of the present invention, the above algorithm comprises: defining a plurality of nodes and stored to the queue, wherein the node corresponds to these channels; taken two node queue, wherein the node corresponding to these the smallest key in the queue; defined according to these internal nodes of the first node, wherein the at least one first node is a child node of the internal node, the first node and the non-child node of the node storing the interior back to the queue; will be stored to the internal node queue; when the number of nodes in the queue for the moment, the queue of the node as a root for binary trees. [0008] 在本发明一实施例中,上述依据这些第一节点定义内部节点的步骤包括:当这些第一节点所对应的键值相同时,这些第一节点为内部节点的子节点,且内部节点所对应的键值为这些第一节点的键值的总和;当这些第一节点所对应的键值不同时,依据键值较小者的第一节点定义假节点,假节点及键值较小者的第一节点为内部节点的子节点,内部节点所对应的键值为假节点的键值及键值较小者的第一节点的键值的总和。 [0008] In an embodiment of the present invention, the above-described steps in the first node based on the definition of the internal node comprising: when the same key value corresponding to the first node, the first node is a child node of the internal node and the internal the key for the node corresponding to the sum of the first node key; when the node corresponding to the key value is not the same, the definition of the virtual nodes, the virtual nodes according to a first node key and key value smaller than the first node of the small child node is an internal node, the internal node key corresponding to the sum of the first node key of the node key and the false key is smaller.

[0009] 在本发明一实施例中,上述假节点对应的键值相同于这些第一节点中键值较小者。 [0009] In an embodiment of the present invention, the dummy node keys corresponding to these same first node key is less.

[0010] 在本发明一实施例中,上述根节点对应的比特率小于或等于移动电视网络的频宽。 [0010] In an embodiment of the present invention, the above-described root node corresponding to a bit rate less than or equal the bandwidth of the mobile television network.

[0011] 在本发明一实施例中,上述脉冲的比特率大小为这些频道中比特率最小者。 [0011] In an embodiment of the present invention, the magnitude of the bit rate of these pulses is the minimum of the channel bit rate.

[0012] 在本发明一实施例中,上述每一键值为对应的频道的比特率与脉冲的比特率的比值。 [0012] In an embodiment of the present invention, each of the above key is the ratio of a bit rate corresponding to the bit rate of the pulse channel.

[0013] 在本发明一实施例中,上述这些频道依据其比特率由小至大依序排列。 [0013] In an embodiment of the present invention, according to which these channels arranged sequentially in ascending bit rate.

[0014] 在本发明一实施例中,上述每一频道的比特率为这些频道中比特率最小者的二的1-Ι次方倍,I为每一频道的频道数。 [0014] In an embodiment of the present invention, each of the above channel bit rate of the bit rate of the smallest power of two times the 1-Ι these channels, I is the channel number of each channel.

[0015] 基于上述,本发明的移动电视网络的频道排程方法,其依据每一电视频道的比特率进行编码,以此提高电视频道编码的效率。 [0015] Based on the above, the channel scheduling method of a mobile television network according to the present invention, according to a bit rate for encoding each television channel, in order to improve the efficiency of encoding channels. 并且,在译码时会依据每一电视频道的比特率进行,以此可避免译码时功耗的浪费。 And it will be based on the bit rate at the time of each television channel decoding in order to avoid wasting power when decoding. 此外,依据每一频道的键值并经由算法构建二元树,依据对应每一电视频道的叶节点至根节点的路径排列每一电视频道所分配到的脉冲期间,以此可避免脉冲的冲突。 Furthermore, according to the key value of each channel via the dual-tree algorithm to construct the arrangement of each pulse during the allocated channels according to the path corresponding to each leaf node to the root node of the television channel, in order to avoid conflicts pulse .

[0016] 为让本发明上述特征和优点能更明显易懂,下文特举实施例,并配合所附图作详细说明如下。 [0016] In order to make the above features and advantages of the present invention more comprehensible, several embodiments and accompanying figures are described in detail below.

附图说明 BRIEF DESCRIPTION

[0017] 图1为本发明一实施例的算法的流程图。 [0017] FIG. 1 is a flowchart of a method embodiment of the present invention.

[0018] 图2A至图2H为本发明一实施例的二元树建立示意图; For binary trees to establish a schematic view of an embodiment [0018] Figures 2A to 2H of the present invention;

[0019] 图3为本发明一实施例的脉冲期间配置示意图; [0019] Fig 3 a schematic configuration example of the pulse during a present embodiment of the invention;

[0020] 图4为本发明一实施例的移动电视网络的频道排程方法的流程图。 [0020] FIG 4 is a flowchart of the scheduling method of a mobile television network channels according to an embodiment of the present invention.

[0021] 附图标记说明 [0021] REFERENCE NUMERALS

[0022] 210、220、230、250、260、270、280:节点; [0022] 210,220,230,250,260,270,280: Node;

[0023] 240:队列; [0023] 240: queue;

[0024] BTO 〜BT7:脉冲; [0024] BTO ~BT7: pulse;

[0025] S110、S120、S130、S140、150、160、S410、S420、S430、S440:步骤。 [0025] S110, S120, S130, S140,150,160, S410, S420, S430, S440: step.

具体实施方式 detailed description

[0026] 在本实施例中,假设移动电视网络中的每个电视频道都对应一个比特率(bitrate),并且每一电视频道所传送的节目的比特率会小于或等于每一电视频道所对应的比特率。 [0026] In the present embodiment, it is assumed the mobile television network each TV channel corresponds to a bit rate (bitrate), and the bit rate for each television channel transmitted programs will be less than or equal to each television channel corresponding the bit rate. 举个例来说,若是电视频道对应的比特率为200k,则此电视频道所传送的电视节目的比特率会小于或等于200k,例如190k、180k...等。 For Example, the corresponding TV channel if the bit rate of 200K, the bit rate of this television channel of television programs transmitted will be less than or equal to 200K, for example 190k, 180k ... and so on. 并且,在此定义第i个电视频道t对应的比特率等于2ΗχΓι,其中i为一正整数,并且Γι为可定义的最小比特率。 Further, as defined herein t i-th channels corresponding to a bit rate equal 2ΗχΓι, wherein i is a positive integer, and Γι definable minimum bit rate.

[0027] 由上述可归纳出一个规律性,就是对于全部的电视频道而言,可依照其比特率的高低来排列顺位。 [0027] can be summarized by the a regularity, it is for all the TV channels, it may be arranged in accordance with the level of its overall bit rate. 换言之,以比特率而言,电视频道( tT,其中T为一正整数且为最大的频道数,并且电视频道&〜tT的比特率小于移动电视网络的频宽。由于电视频道h的比特率为电视频道h〜tT的比特率中最小者,因此电视频道h的比特率为最小比特率A。 In other words, in terms of bit rate, channels (tT, where T is a positive integer and the maximum number of channels, and the television channel & ~tT bit rate is less than the bandwidth of the mobile television network. Since the bit rate channels h. h~tT television channel bit rate of the smallest, so the bit rate channels h minimum bit rate A.

[0028] 此外,为了充分利用移动电视网络的频宽,可定义移动电视网络的频宽为电视频道^〜tT的比特率的总和,亦即无线网络的频宽R=Xil1I但是为了电视频道的信息可以完全传送,可定义移动电视网络的频宽会大于或等于电视频道h〜tT的比特率的总和,亦即移动电视网络的频宽RgsiIlti。 [0028] The sum Further, in order to fully utilize the bandwidth of a mobile television network, a mobile television network bandwidth may be defined as ^ ~tT television channel bit rate, i.e., a wireless network, but for R = Xil1I bandwidth television channel information can be transferred completely, define mobile television network bandwidth may be greater than or equal to the sum of the bit rates of h~tT television channel, i.e. bandwidth RgsiIlti mobile television network. 并且,可用脉冲(burst)的数量来来作为判断电视 Further, the number of available pulses (Burst) to be judged as TV

频道比特率的依据,如以最小比特率A作为一个脉冲的比特率大小,则电视频道\的比特率/电视频道h的比特率=电视频道\具有的脉冲数量,并且每个电视频道的键值(key)会等于每个频道的脉冲数量,以键值作为判断每个电视频道比特率的依据。 Based on the channel bit rate, minimum bit rate as a bit rate A as the size of a pulse, the television channel \ bitrate / h of television channels = \ has a number of pulses, each television channel and keys value (key) will equal the number of pulses of each channel, as a basis for determining the key value to each television channel bit rate.

[0029] 接着,在本发明的实施例会提供一算法,此算法会依据上述每个频道的键值建立一个二元树(binary tree),并且二元树的叶节点分别代表一个电视频道。 [0029] Next, the present invention provides in one embodiment Regular algorithm that creates a binary tree (binary tree) according to each of the key channel, and the dual-tree leaf node representing a television channel. 图1为本发明一实施例的算法的流程图。 FIG 1 is a flowchart of an algorithm of the embodiment of the present invention embodiment. 请参照图1,在此算法中,会先定义多个节点,并且将上述节点会被放入一队列(queue)中(步骤S110),其中这些节点会分别对应电视频道&〜tT,并且每个节点的键值即对应电视频道的键值。 Referring to FIG. 1, in this algorithm, will define a plurality of nodes, and the node above were placed in a queue (Queue) (step S110), wherein the node corresponding to each television channel & ~tT, and each key corresponding to the key node, i.e. television channels.

[0030] 接着,算法会从队列中取出两个键值最小的节点(即第一节点)(步骤S120),并依据此两个节点产生定义一个内部节点(步骤S130),其中被取出的两个节点至少其一为内部节点的子节点,亦即此内部节点为一父节点,并且此内部节点的键值为其子节点的键值的总和。 [0030] Next, the algorithm dequeues the smallest two key nodes (i.e., node) (step S120), and generates an internal node is defined (step S130) based on these two nodes, two of which were removed at least one node as a child node of internal nodes, i.e. this internal node is a parent node, this key value and the sum of the internal node keys of its children nodes. 并且,在被取出的两个节点中,非此内部节点的子节点的节点亦会存放回队列。 Further, two nodes are removed, the non-child nodes of this node will be stored back into the internal queue.

[0031] 当内部节点完义完成后`,则内部节点会被存放至队列中(步骤S140)。 [0031] When the internal sense node End `completed, the internal node is stored into the queue (step S140). 若队列中的节点为两个以上(包含两个)时(步骤S150),再从队列中取出两个键值最小的节点(步骤S120),并依据上述步骤S130及S140产生一个父节点(即另一内部节点)并存放至队列中。 If the queue node is two or more (including two) (step S150), and then remove the two lowest node key (step S120) from the queue, and a parent node is generated according to the above steps S130 and S140 (i.e. another internal node) and stored into the queue. 当队列中剩余一个节点时(步骤S150),则停止运算,且队列中最后剩余的一个节点则会被视为根(root)节点,即队列中的最后剩余的一个节点为二元树的根节点(步骤S160),以此完成上述二元树建立。 When a node remaining in the queue (step S150), the operation is stopped, and the last remaining in the queue will be considered a root node (root) node, i.e., the last remaining one root node queue for binary trees of node (step S160), thereby completing the establishment of the above divalent tree.

[0032] 举例来说,假设目前有电视频道t2及t3,并且电视频道t2及t3的比特率分别为200k、400k及800k位/秒(bits per second, bps)。 [0032] For example, if there are t2 and t3 television, and the television channel bit rate and t2 t3 respectively 200k, 400k and 800k bit / s (bits per second, bps). 在此以电视频道h的比特率作为一个脉冲的大小,亦即脉冲的比特率为200kdps。 The bit rate channels h as the size of a pulse, i.e. a pulse bit rate 200kdps. 依据上述,电视频道&的键值为1(即200k/200k),电视频道七2的键值为2(即400k/200k),电视频道t3的键值为4(即800k/200k)。 According to the above, key value & channels is 1 (i.e., 200k / 200k), TV channel 2 is seven keys 2 (i.e., 400k / 200k), television channels and t3 key 4 (i.e., 800k / 200k).

[0033] 图2A至图2H为本发明一实施例的二元树建立示意图。 [0033] Figures 2A to 2H establishing a schematic diagram for binary trees according to an embodiment of the present invention. 请依序参照图2A至图2H,本实施例的算法会先定义节点210、220及230,并将节点210、220及230存放至队列240中,其中节点210、220及230分别对应电视频道V t2及t3,亦即节点210、220及230的键值分别为1、2及4。 Please sequentially 2A to 2H, the algorithm of the present embodiment first define the nodes 210, 220, 230, 210, 220, and 230 and storage node to a queue 240, wherein the nodes 210, 220 and 230 respectively corresponding channels V t2 and t3, i.e. node keys 210, 220, 230 and 1, 2 and 4, respectively. 接着,本实施例的算法会先取出键值为I的节点210及键值为2的节点220。 Next, the algorithm of the present embodiment will first remove the key and the key I for the node 210 is the node 220 of FIG. 由于节点210及220的键值不同,此时键值较大的节点220会再存放回队列240中,并且依据节点210定义假节点250,其中假节点250的键值为I。 Due to the different keys of nodes 210 and 220, the node 220 at this time will be large key and then stored back to the queue 240, 250 and 210 define the virtual nodes according to the node, wherein the node 250 is false key I.

[0034] 接着,定义内部节点260作为节点210及假节点250的父节点,并且将内部节点260存放至队列240中,其中内部节点260的键值为2 (即1+1)。 [0034] Next, the internal node 260 is defined as a parent node of node 210 and node 250 is false, and the internal node 260 to be stored in the queue 240, internal node 260 where the key value is 2 (i.e., 1 + 1). 此时,队列240中有键值为2的节点220、键值为4的节点230及键值为2的内部节点260。 In this case, the queue 240 has node 220 as the key 2, key and key 4 for the node 230 to node 2 260 of the interior. 由于队列240中的节点数大于2,因此会再从队列240中取出键值为2的节点220及内部节点260。 Since the number of nodes in the queue 240 is greater than 2, therefore again taken out from the queue 240 and the internal key for the node 220 node 260 2. 由于节点220的键值相同于内部节点260,因此会依据节点220及内部节点260定义内部节点270,并且将内部节点270存放至队列240中,其中内部节点270为节点220及内部节点260的父节点,并且内部节点270的键值为4 (即2+2)。 Since the node 220 is identical to the key internal node 260, node 220 thus define internal node 260 and internal node 270 based on, internal node 270 and the store queue 240 to which the internal node 270 is a parent node 220 and internal node 260 key node and the internal node 270 is 4 (i.e., 2 + 2).

[0035] 此时,队列240中有键值为4的节点230及内部节点270,因此节点230及内部节点270会被取出,据此定义内部节点280并存放回队列240中,其中内部节点280为节点230及内部节点270的父节点,并且内部节点280的键值为8(即4+4)。 [0035] In this case, the queue 240 has key 230 to node 4 and the internal node 270, the node 230 and internal node 270 is taken out, whereby the definition of the internal node 280 back in the queue 240 exist in which the internal node 280 for the key internal node 230 and the parent node of node 270 and internal node 280 is 8 (i.e. 4 + 4). 此时,队列240中只剩一个节点(即内部节点280),因此键值为8的内部节点280即为二元树的根节点。 At this time, only one node in the queue 240 (i.e., internal node 280), thus the root node 280 is the key for binary trees internal node 8. 并且,依据上述各节点的关系可形成包含对应电视频道tpt2及t3的节点的二元树,此二元树如图2H所示,并且对应电视频道V t2及t3的节点为此二元树的叶(leaf)节点。 And, based on the relationship between each of the nodes may form a binary tree comprising nodes tpt2 and t3 corresponding to a television channel, the dual-tree shown in Figure 2H, and the corresponding channels V t2 and t3 for binary trees of this node leaf (leaf) node. 以比特率来看,内部节点280(即根节点)的比特率会大于电视频道V t2及t3的比特率的总和,因此内部节点280所对应的比特率可等于移动电视网络的频宽。 The total bit rate to the bit rate, the internal node 280 (i.e., the root) will be greater than the bit rate channels V t2 and time t3, the internal node 280 may be equal to a bit rate corresponding to the bandwidth of the mobile television network. 或者,内部节点280所对应的比特率亦可小于移动电视网络的频宽。 Alternatively, internal node 280 is also smaller than the bit rate corresponding to the bandwidth of the mobile television network.

[0036] 接着,为了防止脉冲冲突,我们经由移动电视网络的频宽R除以脉冲大小来取得一个网络帧中的脉冲的总数量,并且内部节点280的键值可等于或小于一个网络帧中脉冲的总数量。 [0036] Next, in order to prevent pulse collisions, we obtain the total number of pulses via a network frame pulse bandwidth divided by the size R of the mobile television network, and the key internal node 280 may be less than or equal to a frame network the total number of pulses. 并且,可利用上述算法所构建的二元树决定每个脉冲的脉冲期间(burstduring)。 Further, the algorithm may be constructed using the binary decision tree during each pulse of the pulse (burstduring). 请参照图2H,以图2H的二元树为例,并假设每一节点的左分支对应的二进制数为0,每一节点的右分支对应的二进制数为I。 Referring to FIG. 2H binary number, a binary tree 2H example, and assuming that the left branch of each node corresponds to 0, the binary number corresponding to the right branch of each node is I.

[0037] 以电视频道&而言,电视频道&的键值为I,亦即在一个网络帧中电视频道h分配到I个脉冲。 [0037] In & channels, the television channel for the I & keys, i.e. in a network television frame pulses allocated to the I h. 并且,对应电视频道h的节点210至根节点(即内部节点280)的路径为011,因此电视频道h分配到的脉冲期间为网络帧中第4个脉冲期间(此因二进制数由000开始),如图3所示,电视频道A分配到对应脉冲BT3的脉冲期间。 Further, the television channel corresponding to the path 210 h to the root node (i.e., internal node 280) is 011, so the pulse period assigned to the channels h for the first four pulses during the frame network (starting from this due to the binary number 000) , 3, a is assigned to the television channel corresponding to the pulse period of the pulse BT3. 以电视频道t2而言,电视频道t2的键值为2,亦即在一个网络帧中电视频道t2分配到2个脉冲。 T2 television channels, the television channel for the key value t2 2, t2 i.e. channels assigned to the two pulses in a network frame. 并且,对应电视频道t2的节点220至根节点280的路径为01。 Then, the corresponding node path 220 to the television channel t2 root node 280 is 01. 由于图2H所示二元树的深度为3,因此电视频道t2应取得3位数的二进制数才能对应至脉冲期间,在此于不足之处的高位处补X,其中X可以为O或I。 Since the depth for binary trees shown in FIG 2H is 3, the television channel t2 should obtain 3-digit binary number to correspond to the pulse period, the high level here to complement the deficiencies X, wherein X can be O or I . 据此,对应电视频道t2的二进制数应为X01,因此电视频道t2分配到的脉冲期间为网络帧中第2(即001)及6(即101)个脉冲期间,如图3所示,电视频道t2分配到对应脉冲BTl及BT5的脉冲期间。 Accordingly, the binary number corresponding to the television channel should X01 t2, so the pulse period t2 channels assigned to the network during the period in the second frame (i.e., 001), and 6 (i.e., 101) pulses, as shown in FIG. 3 TV t2 corresponding to the channel assigned to the pulse period of the pulse BTl and BT5.

[0038] 以电视频道t3而言,电视频道t3的键值为4,亦即在一个网络帧中电视频道t3分配到4个脉冲。 [0038] In television t3, the television channel for the key 4 is t3, t3 i.e. channels assigned to the 4 pulses in a network frame. 并且,对应电视频道t3的节点230至根节点280的路径为O。 Then, the corresponding node path 230 to the television channel t3, root node 280 is O. 同样地,由于二元树的深度为3,因此对应电视频道t3的二进制数应为ΧΧ0,因此电视频道t2分配到的脉冲期间为网络帧中第1(即000)、3(即010)、5(即100)及7(即110)个脉冲期间,如图3所示,电视频道t2分配到对应脉冲BTO、BT2、BT4及BT6的脉冲期间。 Similarly, since the depth is 3 for binary trees, a binary number corresponding to the television channel so t3 should ΧΧ0, so the pulse period t2 channels allocated to the network, in frame 1 (i.e., 000), 3 (i.e., 010), during 5 (i.e., 100) and 7 (i.e., 110) pulses, shown in Figure 3, channels assigned to t2, a period corresponding to the pulse BTO BT2 BT4, and BT6 pulse. 依据上述,电视频道h〜t3所分配到的脉冲期间不会重叠,以此可防止脉冲冲突,并且可排序电视频道h〜t3所使用的脉冲,可降低网络频宽的浪费。 During the pulses do not overlap the allocated according to the above, h~t3 channels, this conflict can be prevented pulse, and the pulse can be sorted channels h~t3 used, can reduce the waste of network bandwidth. 再者,电视频道h〜t3会对应其比特率进行编码,因此可提高编码的效率及降低译码的功耗。 Moreover, the corresponding TV channel which will h~t3 bit rate coding, coding efficiency can be improved and power consumption reduction decoding.

[0039] 值得一提的是,上述实施例中每一节点的左分支对应的二进制数为0,每一节点的右分支对应的二进制数为I。 [0039] It is worth mentioning that the binary number for each left branch nodes embodiment corresponding to the above-described embodiment is 0, the binary number corresponding to the right branch of each node is I. 但在其它实施例中,每一节点的左分支对应的二进制数可以为1,每一节点的右分支对应的二进制数可以为O。 However, in other embodiments, the binary number corresponding to the left branch of each node may be a binary number corresponding to the right branch of each node may be O. 并且,可依据上述说明,依据对应每一频道的节点至根节点的路径决定每一频道的脉冲期间。 Further, the above description can be based on, based on each channel path node corresponding to the root node determines each channel during a pulse.

[0040] 依据上述,可汇整为一移动电视网络的频道排程方法。 [0040] According to the above, it may be aggregated into a Mobile TV network channel scheduling method. 图4为依据本发明一实施例的移动电视网络的频道排程方法的流程图。 4 based on channel scheduling method in a mobile TV network according to an embodiment of the present invention, the flowchart of FIG. 请参照图4,首先定义多个电视频道的比特率(步骤S410)。 Referring to FIG 4, first define a plurality of channels bit rate (step S410). 并且,定义脉冲的比特率以计算每一电视频道的键值(步骤S420)。 Further, the bit rate is defined to calculate a key value for each pulse of the television channel (step S420). 接着,依据每一频道的键值并经由算法构建二元树(步骤S430)。 Next, based on the key value of each channel via the dual-tree algorithm constructs (step S430). 最后,依据对应每一电视频道的叶节点至二元树的根节点的路径排列每一电视频道所分配到的脉冲期间(步骤S440)。 Finally, the root node path of a binary tree in accordance with the corresponding leaf node to each television channel arrangement (step S440) pulse during each television channel allocated to. 其中,各步骤的细节可参照上述说明,在此则不再赘述。 Wherein the details of the step can be referred to the above description, it is not repeated here.

[0041] 综上所述,本发明实施例的移动电视网络的频道排程方法,其依据每一电视频道的比特率进行编码,以此提高编码的效率。 [0041] In summary, channel scheduling method in a mobile TV network according to an embodiment of the present invention, according to a bit rate for encoding each television channel, in order to improve efficiency of encoding. 并且,在译码时会依据每一电视频道的比特率进行,以此可避免译码时功耗的浪费。 And it will be based on the bit rate at the time of each television channel decoding in order to avoid wasting power when decoding. 此外,依据每一频道的键值并经由一算法构建二元树,依据对应每一电视频道的叶节点至根节点的路径排列每一电视频道所分配到的脉冲期间,以此可避免脉冲的冲突。 Furthermore, according to the key value of each channel and constructed by a dual-tree algorithm, each pulse is arranged during the allocated channels according to the path corresponding to each leaf node to the root node of the television channel, in order to avoid pulse conflict.

[0042] 虽然本发明已以实施例描述如上,然其并非用以限定本发明,任何所属技术领域中具有通常知识者,在不脱离本发明精神和范围内,都可作些许更动与润饰,故本发明保护范围当以权利要求书为准。 [0042] While the embodiments of the present invention has been described above, they are not intended to limit the present invention, any skilled in the art having ordinary knowledge, without departing from the spirit and scope of the present invention, substitutions and alterations can be made , so the scope of the invention the following claims and equivalents.

Claims (6)

  1. 1.一种移动电视网络的频道排程方法,包括: 定义多个频道的比特率,其中所述频道对应不同比特率; 定义一脉冲的比特率以计算多个键值,其中所述键值对应所述频道; 依据所述键值并经由一算法构建一二元树,其中该二元树的多个叶节点对应所述频道,该脉冲的比特率大小为所述频道中比特率最小者,并且每一所述键值为对应的频道的比特率与该脉冲的比特率的比值;以及, 依据每一所述叶节点至该二元树的一根节点的路径排列所述频道的多个脉冲期间,其中每一所述脉冲期间用以传送该脉冲; 其中,该算法包括: 定义多个节点并存放至一队列中,其中所述节点对应所述频道; 取出该队列中的两个第一节点,其中所述第一节点所对应的键值为该队列中最小者;依据所述第一节点定义一内部节点,其中所述第一节点至少其一为该内部节点的子节 A mobile TV network channel scheduling method, comprising: defining a plurality of channels, bit rates, wherein said different bit rates corresponding to the channel; bit rate defines a plurality of pulses to calculate a key, wherein the key value corresponding to the channel; and the key value based on a dual tree constructed by an algorithm, wherein a plurality of leaf nodes of this binary tree corresponding to the channel bit rate of the size of the pulses is the minimum of the channel bit rate and each of said key value is a ratio of a bit rate corresponding to the channel bit rate of the pulses; and a plurality, each of the leaf node according to the path of this binary tree arrangement of a root node of the channel during the pulses, wherein each pulse period for transmitting the said pulse; wherein the algorithm comprises: defining a plurality of nodes to and stored in a queue, wherein the node corresponding to said channel; two taken in the queue a first node, wherein the node corresponding to the smallest key value for the queue; define a node according to the internal node, wherein the node for the at least one sub-section is an internal node ,并且非该内部节点的子节点的第一节点存放回该队列; 将该内部节点存放至该队列;以及, 当该队列的节点数为一时,该队列中的节点为该二元树的该根节点。 And the non-child node of the first node is an internal node is stored back in the queue; the store queue to the internal node; and, when the number of nodes is the temporary queue, the queue node for binary trees for the root node.
  2. 2.根据权利要求1所述移动电视网络的频道排程方法,其中依据所述第一节点定义该内部节点的步骤包括: 当所述第一节点所对应的键值相同时,所述第一节点为该内部节点的子节点,且该内部节点所对应的键值为所述第一节点的键值的总和;以及, 当所述第一节点所对应的键值不同时,依据键值较小者的第一节点定义一假节点,该假节点及键值较小者的第一节点为该内部节点的子节点,该内部节点所对应的键值为该假节点的键值及键值较小者的第一节点的键值的总和。 The scheduling method of claim 1 channel mobile television network as claimed in claim, wherein the step of the first node is defined according to the internal node comprises: when the same key value corresponding to the first node, the first the sum of the child node for the node internal node and the internal node key corresponding to the first node key; and, when the corresponding node key is not the same, based on the key than the first node is defined by a small false node, the first node and the dummy node key for the smaller child node internal node, the internal node keys corresponding to the node key and the ghost key the sum of the first node key is smaller.
  3. 3.根据权利要求2所述移动电视网络的频道排程方法,其中该假节点对应的键值相同于所述第一节点中键值较小者。 Channel scheduling method according to claim 2 of the mobile TV network, wherein the dummy nodes corresponding to the same key value on the first node key is less.
  4. 4.根据权利要求1所述移动电视网络的频道排程方法,其中该根节点对应的比特率小于或等于该移动电视网络的频宽。 Channel scheduling method according to claim 1 to the mobile TV network, wherein the root node corresponding to a bit rate less than or equal to the bandwidth of the mobile television network.
  5. 5.根据权利要求1所述移动电视网络的频道排程方法,其中所述频道依据其比特率由小至大依序排列。 5. The mobile television network as claimed in claim 1 channel scheduling method, wherein the channel bit rate based on its ascending sequential order.
  6. 6.根据权利要求5所述移动电视网络的频道排程方法,其中每一所述频道的比特率为所述频道中比特率最小者的二的i_l次方倍,i为每一所述频道的频道数。 Channel scheduling method according to claim 5, wherein the mobile TV network, wherein each of said channel bit rate of the channel bit rate i_l times the smallest power of two, i is said each channel the number of channels.
CN 201010167204 2010-04-27 2010-04-27 Channel scheduling method for mobile television network CN102238429B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201010167204 CN102238429B (en) 2010-04-27 2010-04-27 Channel scheduling method for mobile television network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201010167204 CN102238429B (en) 2010-04-27 2010-04-27 Channel scheduling method for mobile television network

Publications (2)

Publication Number Publication Date
CN102238429A true CN102238429A (en) 2011-11-09
CN102238429B true CN102238429B (en) 2013-05-22

Family

ID=44888562

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201010167204 CN102238429B (en) 2010-04-27 2010-04-27 Channel scheduling method for mobile television network

Country Status (1)

Country Link
CN (1) CN102238429B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4991975A (en) 1988-11-22 1991-02-12 At&T Bell Laboratories Division multiplexing and demultiplexing means lightwave communication system comprising optical time
US6963545B1 (en) 1998-10-07 2005-11-08 At&T Corp. Voice-data integrated multiaccess by self-reservation and stabilized aloha contention
CN101262360A (en) 2008-04-11 2008-09-10 中国电信股份有限公司 A method and device for real time stream media multi-point transmission

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4991975A (en) 1988-11-22 1991-02-12 At&T Bell Laboratories Division multiplexing and demultiplexing means lightwave communication system comprising optical time
US6963545B1 (en) 1998-10-07 2005-11-08 At&T Corp. Voice-data integrated multiaccess by self-reservation and stabilized aloha contention
CN101262360A (en) 2008-04-11 2008-09-10 中国电信股份有限公司 A method and device for real time stream media multi-point transmission

Also Published As

Publication number Publication date Type
CN102238429A (en) 2011-11-09 application

Similar Documents

Publication Publication Date Title
US20060109805A1 (en) Packet stream arrangement in multimedia transmission
US20020191594A1 (en) Transmitting/receiving method and device therefor
US6842724B1 (en) Method and apparatus for reducing start-up delay in data packet-based network streaming applications
US20060077890A1 (en) Efficient source blocking algorithm for FEC for MBMS streaming
US7984179B1 (en) Adaptive media transport management for continuous media stream over LAN/WAN environment
US20070236599A1 (en) Accelerated media coding for robust low-delay video streaming over time-varying and bandwidth limited channels
US20070277210A1 (en) System and method for statistical multiplexing of video channels for DVB-H mobile TV applications
JP2003092564A (en) Negotiated/dynamic error correction for streamed media
US20060291468A1 (en) Selective re-transmission of lost multi-media data packets
CN101115196A (en) Method, system and terminal for adjusting video quality
JP2007089137A (en) Adaptive media play-out by server media processing for performing robust streaming
JP2008546361A (en) Forward error correction (fec) code and streaming
JP2000078573A (en) Hierarchical encoded data distribution device
US20140105273A1 (en) Adaptive power management within media delivery system
US20060005101A1 (en) System and method for providing error recovery for streaming fgs encoded video over an ip network
CN1812575A (en) Parallel transmission dispatching method for stream media data
US20100158102A1 (en) Apparatus and Method for Coding an Information Signal into a Data Stream, Converting the Data Stream and Decoding the Data Stream
CN101902296A (en) Coding/decoding method and device for fountain codes
Ahmad et al. Adaptive unicast video streaming with rateless codes and feedback
CN101296184A (en) Method, system and device for data transmission
CN101621353A (en) Method, device and system for random linear network encoding
Chakareski et al. Server diversity in rate-distortion optimized media streaming
CN101951556A (en) Wireless sensor network data distribution method based on network coding
CN101075957A (en) Method for controlling AVS fluid-medium transmission
CN1946079A (en) Selective frame losing method for network bandwidth self adaptive flow medium transmission

Legal Events

Date Code Title Description
C06 Publication
C10 Request of examination as to substance
C14 Granted