201136311 PNAI-CO-0101-TWXX 33371twf.doc/n 六、發明說明： 【發明所屬之技術領域】 本發明是有關於一種排程方法，且特別是有關於一種 行動電視網路的頻道排程方法。 【先前技術】201136311 PNAI-CO-0101-TWXX 33371twf.doc/n VI. Description of the Invention: [Technical Field] The present invention relates to a scheduling method, and in particular to a channel scheduling method for a mobile television network . [Prior Art]
目前IP-Based行動電視系統所提供的串流服務’是以 廣播(broadcast)或群播(multicast)方式透過即時傳輸協定 (Real-time Transport Protocol, RTP)來將具有時基 (time-based)的影音串流、互動服務（interactive service) 或k示服務（notification service)傳送給行動電視用戶端 裝置。 根據數位視訊手持廣播 一< .J 、 i^ignai v iucuCurrently, the streaming service provided by the IP-Based mobile TV system is based on a broadcast or a multicast method through a Real-time Transport Protocol (RTP) to have a time-based The video stream, interactive service or notification service is transmitted to the mobile TV client device. According to digital video handheld broadcast a < .J, i^ignai v iucu
Broadcasting-Handheld，DVB-Η)的標準，其提供了 一個電 視頻道的傳送方法，其主要是給予每一個網路訊框（frame) —個訊叢（burst)。其中，每一個網路訊框傳送一個電視 頻道所傳遞的影像内容，並且每—個訊叢會指出下一個訊 叢出現的傳送時間。當行動裝置接收到訊叢後，便會接收 網路訊框所傳送的資訊，並在接收完畢後關 出現次啟動射頻電路，以此可節省電力^耗 每-個電:頻： = 能會不同，因此 型而不一樣’例如體育性節目“ 201136311 ^υ-υ10ΐ-τ\νχχ 33371twf.doc/n :=:因此’上述訊叢的方式並不能推測電視頻道的 位4來Ξ;編見頻道編碼時，則使用相同的 去、’八中位凡率會以所有電視頻道中最大 =準’以使母—個電視頻道都能被編碼 的位元率不同、，若被編码的電視頻道不是 的部 <八取μ—視頻道“，則會浪費網路戦來放置無資訊 if ，對無資訊的部份進行編碼只會浪費時間， 並且會降低編碼的效率。 、 【發明内容】 妈古ίίΓ提供—種行動電視網路_道排程方法，可以 紐的編碼料，並且提高行動電_路的頻寬 使用效率。 本lx月提出_重行動電視網路的 立 t: 頻道的位元率’其中這些頻道對應不同;立元 算多個鍵值，其中這 一 —、<，依據廷些鍵值並經由演算法建構二 i . ^n，yt[eei，其中二70樹的多個葉節點對應這些頻 L 、母冑節點至二元樹的根節點的路徑排列這些頻 ^i^FBUburstdurin^ 個之I實施例中，上述之演算法包括：定義多 :.......丁列中’其中這些節點對應這些頻道；取 出知歹j中的兩個第—_ ’其中這些第—節點所對應的鍵 4 201136311 ^JNA1-C〇-01〇1-TWXX 33371twf.doc/n 值為仔列中最小者；依據這些第—節點定勒部節點，其 中至少一個第一節點為内部節點的子節點，並且非内部節 點的子節點的第-節點存放回仔列；將内部節點存放至仔 列；當仔列的節點數為-時，仔列中的節點為二元樹的根 節點。 在，本發明之-實施例中，上述之依據這些第一節點定 ^部即點的步驟包括：#這些第—節點所對應的鍵值相 ^ I這些第一節點為内部節點的子節點，且内部節點所 子應的鍵值為這些第一節點的鍵值的總和；當這些第 鍵值不同時，依據鍵值較小者的第-;點定義 2點’“點及鍵值較小者的第—節點為内部節點的子 :的占第内：節點所對應的鍵值為假節點的鍵值及、 者的第一郎點的鍵值的總和。 同Γ施例中’上述之假節點對應的鍵值相 叫於廷些弟一節點中鍵值較小者。 π 小於ΐΐ二明ί:實施例中’上述之根節點對應的位元率 J於或寻於仃動電視網路的頻寬。 這些’上述之訊叢的位元率大小為 道的的：每，為對應的頻 率由===施例中，上述之這些頻道依據其位元 在本發明之-實施例中，上述之每―頻道的位元率為 5 201136311 FN Al-CU-01 〇 1 -TWXX 33371 twf.doc/n 這些頻道中位元率最小者的二 的頻道數。 〜的…1)次方倍，i為每/頻道 基於上述’本發明的行動 其依據每一電視頻道的位元率1網路的頻道排程方法， 道編碼的效率。並且，在解石馬日±:、’扁螞，以此提高電視頻 元率進行’以此可避免解碼時：:依據每-電視頻道的位 -頻道的鍵值並經由演算法建的浪f °此外’依據每 視頻道的葉節點至根節點的路心依據對應每一電 到的訊叢期間，以此可避免視頻道所分配 為讓本發明之上述特徵和優 = 舉實施例，並配合所附圖式作二易懂’下文特 【實施方式】 在本實施例中，假設行動電視 都對應-個位元率（bitme)，的母们包視頻逞 的節目的位元率會小於或等於每 t電視頻道所傳送 率。舉個例來說，料電^頻、㈣f視頻道所對應的位元 此電視頻道所傳送的電視節位::為200k ’則 2〇〇k，例如職、180k...等。並且，，率^小斤於或等於 .- 並且’在此定義第i個雷滿 於〜，其中‘正整數，並 丑ll為叮足義的最小位元率。 由上述可歸_—倾雜，就是對於全部的 道而吕，可依照其位元率的高低來排列順位。換言之」 位兀率而言，電視頻道ti斗，其中了為一正整數 201136311 PNAI-CO-0101-TWXX 3337ltwf.d〇c/n 且為最大的頻道數，並且電 、 電視網路的頻寬。由於電^頻道hMT的位元率小於行動 t^tr的位元率中最小者，’員道t!的位元率為電視頻道 位元率ri。 因此電視頻道的位元率為最小 此外，為了充分利用行 動電視網路的頻寬為電视 峪的頻I，可定義行 無線網路的頻寬'、^丨1 4的位元率的總和，亦即 頻道t广“的位元率的總和， 仏見曰大於或等於電視 心並且，可用訊叢（bu^=^=頻寬u 頻道位元率的依據，如以爭里耒來作為判斷電視 元率大小，則電視頻道位、立 作為一個訊叢的位 視頻道ti具有的訊叢數4= 見頻道h的位元率1 會等於每個頻道的訊叢^且3值道的鍵值（key) 道位元率的依據。歎里以鍵值作為判斷每個電_ 接著，在本發明的實施例會提 管 會依據上述每個頻道的鍵值建立、—個、r谢/t算法 :ee)，並且二元樹的葉節點分別代表-個電:頻道、 ^據本發明-實施例的演算法的流；圖！ 在此演算法中，會先定義 、，口明參照圖1， 放入-仵列U_) t (步驟。s:且被 =電一，並且每個節點的鍵值即以 接者’演算法會從仵列中取出兩個鍵值最小的節點 201136311 PNAI-CO-0101 -TWXX 33371 twf doc/n (步驟S120) ’並依據此兩個節點產生定義一個 (步驟S130)，其中被取出的兩個節點 —:P‘^ 點的子節點，亦即此内部節點為一父節點，；且此内 點的鍵值為其子節點的鍵值的總和。並且，在被取出的: 個節點中，非此内部節點的子節點的節點亦會存放回佇列λ。 當内部節點完義完成後，則内部節點會被存放至疒 中（步驟S140)。若仔列中的節點為兩個以上（包含兩^ 時（步驟S150)’再從佇列中取出兩個鍵值最小的節點（步 驟S120)，並依據上述步驟si3〇及S140產生一個父節二 (即另一内部節點）並存放至佇列中。當佇列中剩餘二個 節點時（步驟S150)，則停止運算，且佇列中最後一個節 點則會被視為根（foot)節點（步驟S160)，以此完成2 述'一*元樹建立。 舉例來說’假設目前有電視頻道t] ' k及b，並且電 視頻道Uh及h的位元率分別為200k、400k及800k位 元/秒（bits per second，bps )。在此以電視頻道tl的位元率 作為一個訊叢的大小，亦即訊叢的位元率為2〇〇k dps。依 據上述’電視頻道ti的键值為1 (即200k/20.0k)，電視頻 道h的鍵值為2 (即400k/200k)，電視頻道ts的鍵值為4 (即 80〇k/200k)。 圖2A至圖2H為依據本發明一實施例的二元樹建立 示意圖。請依序參照圖2A至圖2H ’本實施例的演算法會 先定義節點210、220及230，並將節點210、220及23〇 存放至佇列240中，其中節點210、220及230分別對應電 201136311 FNAl-cC-0101-TWXX 33371twf.doc/n 視頻道t!、t2及t3，亦即節點210、220及230的鍵值分別 為1、2及4。接著，本貫施例的演算法會先取出鍵值為1 的卽點210及鍵值為2的節點220。由於節點21 〇及220 的鍵值不同，此時鍵值較大的節點220會再存放回符列24〇 中，並且依據節點210定義假節點250，其中假節點25〇 的鍵值為1。 接著’定義内部節點260作為節點210及假節點250 籲 的父節點，並且將内部節點260存放至佇列240中，其中 内部節點260的鍵值為2 (即1 + 1)。此時，仵列240中 有鍵值為2的節點220、鍵值為4的節點230及鍵值為2 的内部節點260。由於佇列240中的節點數大於2，因此會 再從=列240中取出鍵值為2的節點22〇及内部節點26〇。 由於節點220的鍵值相同於内部節點26〇，因此會依據節 『220及内部節點260定義内部節點270，並且將内部節 點270存放至符列24〇中’其中内部節點27〇為節點22〇 及内部節點260的父節點’並且内部節點27〇的鍵值為4 ’ （即 2+2 )。 此8守’仔列240中有鍵值為4的節點230及内部節點 因此即點230及内部節點27〇會被取出，據此定義内 ^郎點280並存放回件列140中，其中内部節點280為節 信=30及内部節點27〇的父節點’並且内部節點的鍵 內二(即4+4)。此時’佇列240中只剩一個節點（即 接28〇)，因此鍵值為8的内部節點280即為二元 、根即點。亚且’依據上述各節關關係可形成包含對 201136311 PNAl-CU-UlOl-TWXX 3337ltwf.doc/n 應電視頻道tl、12及t3的節點的二元樹，The Broadcasting-Handheld (DVB-Η) standard provides a method of transmitting video channels, which is mainly to give each network frame a burst. Each of the network frames transmits the video content transmitted by one television channel, and each of the video clusters indicates the transmission time of the next video bundle. When the mobile device receives the bundle, it will receive the information transmitted by the network frame, and after the reception is completed, the secondary RF circuit will be turned off, thereby saving power and consumption. Each frequency: Frequency: = Yes Different, so the type is different - for example, sports program "201136311 ^υ-υ10ΐ-τ\νχχ 33371twf.doc/n :=: Therefore, the above-mentioned way of the bundle can not be speculated on the TV channel bit 4; When channel coding, the same goes, 'eight median rate will be the largest = standard in all TV channels to make the mother-to-one TV channel can be encoded with different bit rates, if the TV is encoded The channel is not the part of the "eight-μ-video channel", it will waste the network to place no information if, encoding the non-information part will only waste time, and will reduce the efficiency of coding. [Inventive content] Mako ίίΓ provides a kind of mobile TV network _ road scheduling method, which can be used to encode materials and improve the efficiency of mobile _ road bandwidth. This lx month proposed _ heavy mobile TV network's vertical t: the bit rate of the channel 'where these channels correspond to each other; the epoch counts multiple key values, of which -, <, according to the key values and through the calculation The method constructs two i. ^n, yt[eei, in which the multiple leaf nodes of the two 70 trees correspond to the paths of the frequency L, the parent node to the root node of the binary tree, and the frequency is implemented by Ii^FBUburstdurin^ In the example, the algorithm described above includes: defining a plurality of: .... in the column, wherein the nodes correspond to the channels; and extracting the two firsts in the knowledge j - _ 'where the first nodes correspond to Key 4 201136311 ^JNA1-C〇-01〇1-TWXX 33371twf.doc/n The value is the smallest of the children; according to these first-nodes, at least one of the first nodes is a child of the internal node, And the node of the non-internal node's child node is stored back to the child column; the internal node is stored in the child column; when the number of nodes in the child column is -, the node in the child column is the root node of the binary tree. In the embodiment of the present invention, the step of determining the point according to the first node is: the key values corresponding to the first nodes are the child nodes of the internal node, And the key value of the internal node is the sum of the key values of the first nodes; when the first key values are different, the first point of the key value is defined as 2 points 'the point and the key value are smaller The first node of the user is the child of the internal node: the inner number: the key value corresponding to the node is the sum of the key value of the fake node and the key value of the first lang point of the same. The key value corresponding to the fake node is called the smaller of the keys in the node of the brothers. π is smaller than ΐΐ2: In the embodiment, the bit rate corresponding to the root node mentioned above is or is found on the telecommunication network. The bandwidth of the roads. The bit rate of the above-mentioned clusters is the size of the track: each is the corresponding frequency by === in the example, the above-mentioned channels are in accordance with the bits thereof in the present invention - the embodiment In the above, the bit rate per channel is 5 201136311 FN Al-CU-01 〇1 -TWXX 33371 twf.doc/n These frequencies The number of channels with the lowest median rate of the second. The number of channels is equal to 1). The i is the channel schedule based on the above-mentioned 'invention' based on the bit rate of each TV channel. Method, the efficiency of the channel coding. Moreover, in the solution of the stone horse day ±:, 'flat grass, in order to improve the electric video element rate 'to avoid decoding when:: according to the bit-channel key value of each TV channel And the wave built by the algorithm f ° in addition, according to the path of the leaf node to the root node of each video channel, according to the period of each of the received signals, thereby avoiding the allocation of the video track to the above characteristics of the present invention.实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施 实施The bit rate of the program will be less than or equal to the transmission rate per t TV channel. For example, the bit corresponding to the video frequency and (4) f video channel is transmitted by the TV channel: 200k 'The 2〇〇k, for example, the job, 180k...etc.,,, rate ^ small jin or Equivalent to .- and 'here defined i-th thunder to ~, where 'positive integer, and ugly ll is the minimum bit rate of 叮 义. From the above _ _ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ ─ According to the bit rate, the order can be ranked. In other words, the TV channel ti fighting, which is a positive integer 201136311 PNAI-CO-0101-TWXX 3337ltwf.d〇c/n and is the largest The number of channels, and the bandwidth of the electricity and television networks. Since the bit rate of the electric channel hMT is smaller than the lowest bit rate of the action t^tr, the bit rate of the 'personal channel t!' is the television channel bit rate ri. Therefore, the bit rate of the TV channel is the smallest. In addition, in order to make full use of the bandwidth of the mobile TV network as the frequency I of the television, the sum of the bit rates of the line wireless network, the bit rate of the line, can be defined. , that is, the sum of the bit rates of the channel t wide, the 仏 see 曰 is greater than or equal to the TV heart and, the available bundles (bu^=^=bandwidth u channel bit rate basis, as in the case of competition Judging the size of the TV element rate, the TV channel bit, the bit video channel ti as a bundle, has the number of bundles 4 = see the bit rate of channel h is equal to the channel of each channel and the value of 3 channels Key (key) The basis of the bit rate. The sigh is judged by the key value. Next, in the embodiment of the present invention, the pipe will be established according to the key value of each channel mentioned above, t algorithm: ee), and the leaf nodes of the binary tree respectively represent - a power: channel, according to the flow of the algorithm of the present invention - the embodiment; in this algorithm, the definition is first, and the reference is Figure 1, put - 仵 column U_) t (step s: and = electric one, and each node's key value is the receiver' algorithm The node with the smallest key value of 201136311 PNAI-CO-0101 -TWXX 33371 twf doc/n is extracted from the queue (step S120) 'and one of the two nodes is generated to define one (step S130), wherein the two nodes are taken out —: The child of the P′^ point, that is, the internal node is a parent node; and the key value of this inner point is the sum of the key values of its child nodes. And, among the nodes that are taken out, The node of the child node of the internal node is also stored back to the column λ. When the internal node is completely completed, the internal node is stored in the ( (step S140). If the node in the child column is more than two (including At the same time (step S150), the two nodes with the smallest key value are taken out from the queue (step S120), and a parent node 2 (ie, another internal node) is generated according to the above steps si3 and S140 and stored in the file. In the column, when there are two nodes remaining in the queue (step S150), the operation is stopped, and the last node in the queue is regarded as a foot node (step S160), thereby completing 2 *The meta tree is established. For example, 'assuming there is currently a TV channel t] 'k and b, And the bit rates of the TV channels Uh and h are 200k, 400k and 800k bits/second (bits per second, bps) respectively. Here, the bit rate of the television channel tl is used as the size of a bundle, that is, the bundle The bit rate is 2〇〇k dps. According to the above-mentioned 'TV channel ti's key value is 1 (ie 200k/20.0k), the TV channel h has a key value of 2 (ie 400k/200k), the TV channel ts key The value is 4 (i.e., 80 〇 k / 200 k). Figures 2A through 2H are schematic diagrams showing the establishment of a binary tree according to an embodiment of the present invention. Referring to FIG. 2A to FIG. 2H in sequence, the algorithm of the present embodiment first defines nodes 210, 220, and 230, and stores nodes 210, 220, and 23〇 into the queue 240, wherein nodes 210, 220, and 230 respectively Corresponding to electric 201136311 FNAl-cC-0101-TWXX 33371twf.doc/n Video tracks t!, t2 and t3, that is, the keys of nodes 210, 220 and 230 are 1, 2 and 4 respectively. Next, the algorithm of the present embodiment first takes out a defect 210 with a key value of 1 and a node 220 with a key value of 2. Since the key values of the nodes 21 220 and 220 are different, the node 220 having a larger key value is again stored in the character string 24 ,, and the dummy node 250 is defined according to the node 210, wherein the key value of the fake node 25 。 is 1. Next, the internal node 260 is defined as the parent node of the node 210 and the fake node 250, and the internal node 260 is stored in the queue 240, wherein the internal node 260 has a key value of 2 (i.e., 1 + 1). At this time, the queue 240 has a node 220 having a key value of 2, a node 230 having a key value of 4, and an internal node 260 having a key value of 2. Since the number of nodes in the queue 240 is greater than 2, the node 22 and the internal node 26 of the key value 2 are retrieved from the = column 240. Since the key value of the node 220 is the same as the internal node 26, the internal node 270 is defined according to the section "220 and the internal node 260, and the internal node 270 is stored in the register 24" where the internal node 27 is the node 22 And the parent node ' of the internal node 260' and the key value of the internal node 27〇 is 4 ' (ie 2+2). The node 230 having the key value of 4 and the internal node, that is, the point 230 and the internal node 27, are extracted, and the inner point 280 is defined and stored in the return column 140, wherein the internal Node 280 is the parent node of the node letter = 30 and the internal node 27 and the key of the internal node is two (ie 4 + 4). At this time, only one node remains in the queue 240 (i.e., 28 〇), so the internal node 280 having a key value of 8 is a binary, root, or point. According to the above-mentioned various relations, the binary tree containing the nodes of 201136311 PNAl-CU-UlOl-TWXX 3337ltwf.doc/n should be TV channels tl, 12 and t3,
所示，並且對應雷葙4§，音 —凡財如圖2H 瑩η… 1、。及t3的節點為此二二 葉（leaf)卽點。以位元率來看，内部節點二叫的 的位元率會大於電损艇指 ’”、 （即根節點） 此内部節點所對應的位位的總和，因 寬。或者，内部節點，所對;::=以頻 視網路的頻寬。 j於仃動電 頻寬t以為叢衝突，我們經由行動電視網路的 訊框中的訊叢的‘ 中m叢的㈣可等於或小於一個網路訊框 °並且’可·上述演算法所建構的二元 =ΓΓ叢Γ叢期間(bum during)。請參照_， 二=位數dr，並假設每—節點的左分支對應的 ’、 母蛴點的右分支對應的二進位數為1。 以電視頻道而言，電視頻道t】的鍵值為卜亦即在一 個網路訊2巾電視頻道tl分配到i她叢。肚，對應電視 頻道^的節點210至根節點（即内部節點28〇 )的路徑為〇1 i， 因此電視頻道^分配到的訊叢期間為網路訊框中第4個訊叢 /月間（此因一進位數由〇〇〇開始），如圖3所示，電視頻道心 分配到對應訊叢BT3的訊叢期間。以電視頻道^而言，電視 頻道t2的鍵值為2，亦即在-個網路訊框中電視頻道t2分配 到2個成叢。並且’對應電視頻道t2的節點220至根節點280 的路徑為0卜由於圖2H所示二元樹的深度為3，IS此電視 頻道t2應取得3位數的二進位數才能對應至訊叢期間，在此 201136311 PNAI-CO-0101-TWXX 33371twf.doc/n 於不足之處的高位元處補X，盆中Y -p 應電視頻道㈣二進位_為篇y為G或卜據此’對 ==:;第2 (即。01)及6 (即)個訊叢 期間如圖3所不，電視頻道t2分配 的訊叢期間。 δίι叢BT1及BT5 以電視頻道t3而言，電視頻道 侧路訊框中電視親t3分_ 4個3值為4 ’:在一 頻道t3的節點23n根節點280的路後為〇° 電視 • 元樹的深度為3，因此對應電視頻道t3的、_、隹f匕夫於一 囡吐雪浦相、音+八疋， < 3的一進位數應為ΧΧ0, 因此私視頻逼0配到的訊叢朗 (^。（即叫”即廳⑷路疏：弟“即 如圖3所干，带讳相、蓄+ 乂 Ho)個祝叢期間’ 如α所7F g視頻道t2分配到對應訊 及BT6的訊叢期間。依據上述，電叢BT0肪、BT4 叢期間不會重疊，以此可防止訊叢、，、,l t3所刀配到的訊 ，職用的訊叢，可降低網路頻寬==電:： 頻迢tH：3會對應其位元率進行編碼， 包視 _ 及降低解碼的功耗。 可棱尚編碼的效率 值得一提的是，上述實施例中每—節 =立數為〇,每-節點的右分支對應的二進;立S 在其他實施射，每-節點的左分 ·数為卜但 為1，每一節點的右分支對魚的-谁:、一進位數可以 n , 的—進位數可以為0。並曰 可依據上述說明，依據對應每—頻道的節且， 徑決定每一頻道的訊叢期間。 ”·、根即點的路 依據上述，可彙整為一行動電視網路的頻道排程方 201136311 PNAI-CO-0101-tWXX 33371iwf.doc/n 沄。圖4為依據本發明一實施例的行 程方法的流程圖。請參照圖4，首先』少:的頻道排 位元率（步驟剛）。並且，定==多個電視頻道的 -電視頻道的鍵值(步驟S42〇)。接J的:口以計算每 鍵值並經由演算法建構二元樹(步驟 對應每一電視頻道的葉節點至__ 取後，依據 各步照上述說明，在此則不再“。 方法，其依據每一電視頻道的位元的頻道:程 編碼的效率。並且’在解碼時會:以此提同 率進仃’以此可避免解碼時功耗 、 頻道的鍵值並經由H去賴一 f❹卜’依據每一 點至根節點的路徑排列每—電視頻道所分配 期間’以此可避免訊叢的衝突。 雖然本發明已以實施例揭露如上，然 本::之技術領域中具有通常知識者，在不脫Ϊ 發明之伴圍内’當可作些許之更動與潤飾，故本 保4_當視後附之申請專利範圍所界定者為準。 【圖式簡單說明】 1為依據本發明—實施例的演算法的流程圖。 示意圖。至圖2Η為依據本發明—實施例的二元樹建立 12 201136311 PNAI-CO-0101-TWXX 33371twf.doc/n 圖3為依據本發明一實施例的訊叢期間配置示音圖。 圖4為依據本發明一實施例的行動電視網路的頻道排 程方法的流程圖。 【主要元件符號說明】 210、220、230、250、260、270、280 :節點 240 :佇列 ΒΤ0〜BT7 :訊叢 S110、S120、S130、S140、150、160、S410、S420、 S430、S440 :步驟 13As shown, and corresponding to the Thunder 4 §, the sound - the wealth as shown in Figure 2H Ying η ... 1 . And the node of t3 is the two-leaf point. In terms of bit rate, the bit rate of the internal node 2 is greater than the sum of the bit points corresponding to the internal node of the electric loss, ie, the root node, because of the width, or the internal node. For ;::= to see the bandwidth of the network. j is the power bandwidth t is considered to be a clash, and we can't be equal to or less than the 'm" of the cluster in the frame of the mobile TV network. A network frame ° and 'can be constructed by the above algorithm = binary period (bum during). Please refer to _, two = number of bits dr, and assume that each node's left branch corresponds to ' The right branch of the parent point corresponds to a binary digit of 1. In terms of TV channel, the key value of the TV channel t] is assigned to i her bundle in a network communication 2 towel TV channel. The path from the node 210 to the root node (ie, the internal node 28〇) corresponding to the TV channel ^ is 〇1 i, so the period of the TV channel allocated to the TV channel is the fourth cluster/month in the network frame (this factor) The number of digits starts from 〇〇〇, as shown in Fig. 3, the TV channel heart is allocated to the period of the bundle corresponding to the bundle BT3. In the case of the television channel ^, the key value of the television channel t2 is 2, that is, the television channel t2 is assigned to 2 clusters in the -network frame, and the node 220 corresponding to the television channel t2 is connected to the root node 280. The path is 0. Since the depth of the binary tree shown in Figure 2H is 3, IS TV channel t2 should obtain a 3-digit binary digit to correspond to the signal period, here 201136311 PNAI-CO-0101-TWXX 33371twf. Doc/n fills X at the high level of the deficiency, and Y-p in the basin should be TV channel (4) binary _ for the article y for G or according to this 'pair==:; 2 (ie. 01) and 6 (ie) during the period of the cluster, as shown in Figure 3, the TV channel t2 is allocated during the period of the cluster. δίι丛 BT1 and BT5 In terms of TV channel t3, the TV channel side frame is TV pro t3 _ 4 3 values 4 ': after the path of the node 23n root node 280 of the channel t3 is 〇° TV • The depth of the meta tree is 3, so the corresponding TV channel t3, _, 隹f匕夫 in a 囡 雪 浦 浦 、 + gossip, < 3 the number of digits should be ΧΧ0, so the private video is forced to 0 to the signal cluster (^. (that is, called "the hall (4) road sparse: brother" is as shown in Figure 3, with 讳phase, Storing + 乂Ho) during the period of the wish period, as the 7F g video channel t2 is assigned to the corresponding signal and the BT6 period. According to the above, the plexus BT0 fat and BT4 clusters do not overlap during the period, thus preventing the cluster ,,,, l t3 knife matching, the use of the news bundle, can reduce the network bandwidth == electricity:: frequency tH: 3 will be corresponding to its bit rate encoding, packet _ and reduce decoding The power consumption of the edge coding is worth mentioning. In the above embodiment, each node is a 〇, and the right branch of each node corresponds to the binary; the vertical S is in other implementations, each-node The left sub-number is b, but the right branch of each node is fish-- who:, the number of digits can be n, and the number of digits can be 0.曰 According to the above description, the channel period of each channel is determined according to the section corresponding to each channel. According to the above, the root point can be aggregated into a channel schedule of the mobile TV network 201136311 PNAI-CO-0101-tWXX 33371iwf.doc/n. Figure 4 is a travel according to an embodiment of the present invention. A flow chart of the method. Please refer to FIG. 4, firstly, the channel rate of the channel is less (step just), and === the key value of the TV channel of the plurality of TV channels (step S42〇). : Port to calculate the value of each key and construct a binary tree via an algorithm (the step corresponds to the leaf node of each TV channel to __, and according to the above description according to each step, it is no longer here.) The channel of a TV channel bit: the efficiency of the process code, and 'when decoding: will use the same rate to enter' to avoid power consumption during decoding, the key value of the channel and go through H According to the path from each point to the root node, the period of each TV channel is allocated 'this can avoid the conflict of the bundle. Although the invention has been disclosed in the above embodiments, the general knowledge in the technical field of the present invention is Not dislocated, in the neighborhood of the invention, when you can make some changes Retouching, therefore, this warranty is subject to the definition of the patent application scope. [Simplified Schematic] 1 is a flow chart of the algorithm according to the present invention-embodiment. Invention - Binary Tree Establishment of an Embodiment 12 201136311 PNAI-CO-0101-TWXX 33371 twf.doc/n FIG. 3 is a diagram showing a configuration of a signal during a bundle according to an embodiment of the present invention. FIG. 4 is a diagram of an embodiment of the present invention. Flowchart of the channel scheduling method of the mobile TV network. [Main component symbol description] 210, 220, 230, 250, 260, 270, 280: Node 240: 伫 ΒΤ 0 to BT7: Cluster S110, S120, S130 , S140, 150, 160, S410, S420, S430, S440: Step 13