CN106452699A - Multi-carrier frequency digital multimedia wireless radio frequency hopping transmission logic channel mapping method - Google Patents
Multi-carrier frequency digital multimedia wireless radio frequency hopping transmission logic channel mapping method Download PDFInfo
- Publication number
- CN106452699A CN106452699A CN201510477350.1A CN201510477350A CN106452699A CN 106452699 A CN106452699 A CN 106452699A CN 201510477350 A CN201510477350 A CN 201510477350A CN 106452699 A CN106452699 A CN 106452699A
- Authority
- CN
- China
- Prior art keywords
- summit
- color
- subgraph
- coloring
- current
- Prior art date
- Legal status (The legal status 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 status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/0001—Arrangements for dividing the transmission path
- H04L5/0003—Two-dimensional division
- H04L5/0005—Time-frequency
- H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
- H04L5/001—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT the frequencies being arranged in component carriers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/40—Analysis of texture
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
- H04B1/69—Spread spectrum techniques
- H04B1/713—Spread spectrum techniques using frequency hopping
- H04B1/7136—Arrangements for generation of hop frequencies, e.g. using a bank of frequency sources, using continuous tuning or using a transform
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/60—Network streaming of media packets
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/565—Conversion or adaptation of application format or content
- H04L67/5651—Reducing the amount or size of exchanged application data
Abstract
The present invention provides a logic channel distribution method when a digital multimedia wireless radio employs the frequency hopping transmission. The logic channel distribution problem when the digital multimedia wireless radio employs the frequency hopping transmission is modeled to be a coloring problem; a coloring subgraph is constructed; the current coloring subgraph is colored, and it is determined whether the coloring is successful or not; if the coloring is not successful, when the parameters of the current coloring subgraph can be regulated, the parameters of the current coloring subgraph is regulated, and the coloring subgraph is reconstructed; if the coloring is successful, the logic channel distribution is successful; and if one coloring subgraph is failed, the logic channel distribution is failed. The logic channel distribution method when a digital multimedia wireless radio employs the frequency hopping transmission allows the time interval of the frames of the same logic channel from the same type of the radio on each carrier frequency to be larger than the frequency hopping protection time so as to allow the radio frames in the same logic channel set to satisfy the requirement of the frequency hopping protection time on multiple carrier frequencies.
Description
Technical field
The present invention relates to the technical field of broadcast television communications, logical channel assignment method when more particularly to a kind of digital multimedia radio broadcasting adopts frequency-hopping transmissions.
Background technology
The development advanced by leaps and bounds with information technology, in the world TV had begun to from first generation DTV (DVB-C, DVB-S, DVB-T, ATSC, ISDB-T, CMMB and DTMB) developing rapidly to second filial generation DTV (DVB-C2, DVB-S2, DVB-T2 and ATSC3.0).At home, just propose " determining to accelerate propulsion telecommunications network, broadcasting and television network and the Internet integration of three networks " early in 2010, also indicate that, " propulsion telecommunications network, broadcasting and television network and the Internet converged development; realize three bending moment intercommunication, resource-sharing; provide the user multiple service such as speech, data and radio and television; for the information of promotion and Development of Cultural Industry; improve national economy and social IT application level; meet the increasingly various production of the people, service for life demand, pull domestic consumption, form new growth engines, significant ".In order to coordinate the information industry development strategic objective of the national integration of three networks, State Administration of Radio Film and Television has started Next generation broadcasting network (Next Generation Broadcasting comprehensively, NGB strategic plan), " suitable China's national situation, the integration of three networks, wire and wireless combine, full process and full network " is defined as the strategic objective of China's Next generation broadcasting network.NGB-W (Next Generation Broadcasting-Wireless) is the wireless portion of China's Next generation broadcasting network, it needs to meet national, society within a very long time and the people has required and New Type of Demand to the various of all kinds of public information service such as radiated television, thus realize the complete upgrading to existing television network broadcast system regenerating.
In order to improve transmission speed and the efficiency of transmission of NGB-W system, typically adopt multi-carrier frequency frequency-hopping transmissions mechanism.Require the frame of number of different types broadcast can be transmitted on each carrier frequency of multi-carrier frequency digital multimedia wireless broadcast system, transmitted on each carrier frequency with time-multiplexed pattern, required with the flexible transmission that this to meet frame.In order to support flexible esource impact and instruction receiving terminal to receive the data of its needs, introduced the concept of logic channel again.Logic channel is made up of identical or related business datum.Single tuning receiver is adopted to receive in receiving terminal, and require radio broadcasting signal in multi-carrier frequency frequency-hopping transmissions, the same logic channel of same type of broadcast or belong to the logic channel of same logic channel group and keep certain Hopping time (not less than 5ms) in time in the frame mapping to different carrier frequency, is processed with ensureing that single tuning receiver has the time to complete frequency hopping.
The problem distributing logic channel to the frame that each is broadcasted is similar with the Vertex Coloring Problem in graph theory, therefore multi-carrier frequency digital multimedia radio broadcasting frequency-hopping transmissions mapping logical channels problem is modeled as the Vertex Coloring Problem in graph theory.Frame is modeled as summit; logic channel is modeled as color; if two frames belong to the same logic channel of same logic channel group or same broadcast; and they are on different carrier frequency; but their time interval is less than frequency hopping guard time, then coupled together between this corresponding summit of two frames with a line.Coloring complete after all of summit all a kind of upper color, and have the vertex color difference that side is connected.In prior art, on the basis of obtaining frame structure distribution pattern, solve coloring problem using classical backtracking algorithm, advantage is that algorithm is simple, and shortcoming is not support that logic channel group frequency-hopping transmissions, calculating time are longer.
Content of the invention
The shortcoming of prior art in view of the above, it is an object of the invention to provide a kind of logical channel assignment method when digital multimedia radio broadcasting adopts frequency-hopping transmissions, for multi-carrier frequency frame structure distribution pattern under frequency-hopping transmissions pattern, the Logic Channel Identifier mapping method comprising logic channel group is supported in design, more effective color rendering intent is proposed, digital multimedia radio broadcasting is enable neatly to transmit the frame of different types of broadcast, and from same type of broadcast same logic channel time interval on each carrier frequency for the frame at least above frequency hopping guard time, make the broadcast frame in same logic channel group that the requirement of frequency hopping guard time also will be met on multiple carrier frequency simultaneously, single tuning receiver is finally enable to be properly received the frame from each logic channel for the various broadcast.
For achieving the above object and other related purposes, a kind of logical channel assignment method when the present invention provides digital multimedia radio broadcasting to adopt frequency-hopping transmissions, comprises the following steps：Step S1, in digital multimedia radio broadcasting, coloring problem will be modeled as using logical channel assignment problem during frequency-hopping transmissions；Step S2, structure coloring subgraph；Step S3, current coloration subgraph is coloured, and judge coloring whether success；If it is not, proceeding to step S4；If so, proceed to step S5；Step S4, judge whether the parameter of current coloration subgraph can adjust, if so, then adjust the parameter of current coloration subgraph, then proceed to step S2；If it is not, then logical channel assignment failure；Step S5, to remaining coloring subgraph colour, if all coloring subgraph coloring success, logical channel assignment success；If having a coloring subgraph to colour unsuccessfully, logical channel assignment failure.
Logical channel assignment method when frequency-hopping transmissions are adopted according to above-mentioned digital multimedia radio broadcasting, wherein：In described step S1, the frame of each broadcast in digital multimedia radio broadcasting is modeled as summit, each logic channel broadcasted is modeled as color.
Logical channel assignment method when frequency-hopping transmissions are adopted according to above-mentioned digital multimedia radio broadcasting, wherein：In described step S2, when building coloring subgraph, it then follows rule below：
21) frame of all broadcast on carrier frequency is divided into different subsets according to broadcast type, in each subset, comprises and only comprise all frames of this kind of broadcast；
22) if certain broadcast constitutes logic channel group with other broadcast, the frame subset constituting the broadcast of logic channel group is merged, constitutes joint subgraph；Otherwise, the frame subset of this broadcast constitutes alone a subgraph；Each subgraph or joint subgraph constitute a coloring subgraph；
23) if in each coloring subgraph the frame of two vertex correspondence on different carrier frequency and their time interval is less than frequency hopping guard time, with a line, this two summits are coupled together, and have the summit adjoint point referred to as each other that side is connected；
24) to all summit distribution color sets in each coloring subgraph, the number of color in the color set on each summit is identical with the current logic channel number of broadcast that it is located；The color set all same on all summits of same broadcast, if the summit of different broadcast does not constitute logic channel group each other, then there is no identical color, if there being logic channel group, in their color sets, the number of same color is identical with the number that the broadcast that they are located constitutes logic channel group.
Logical channel assignment method when frequency-hopping transmissions are adopted according to above-mentioned digital multimedia radio broadcasting, wherein：Described step S3 comprises the following steps：
31) it is that each apex configuration colouring in subgraph can use color set；
32) judge whether all summits in current coloration subgraph colour successfully, if so, then current coloration subgraph colours successfully, if it is not, then proceeding to step 33)；
33) select coloring summit；
34) if the number not colouring adjoint point on the current summit selecting is more than 1, using the summit of current coloration as a branch point；
35) select color；
36), after to current vertex coloring, update the available color set of this summit and its adjoint point；Wherein, when the available color set on current coloration summit updates, color currently used for this summit is deleted from its available color set；When the available color set of the adjoint point on current coloration summit updates, deduct, with the color set of this adjoint point, the color that this adjoint point and its all colored adjoint point use；
37) judge whether current vertex coloring is successful；If so, then proceed to step 32), until the success of all vertex colorings, that is, this subgraph colours successfully；If it is not, then proceeding to step 38)；
Wherein, successfully whether standard is as follows to judge current vertex coloring：If all available color sets not colouring adjoint point on current coloration summit are not all empty set, this vertex coloring success；Otherwise, this vertex coloring failure；
38) color on the colored summit of adjustment, enabling the summit of coloring failure to be successfully colored, if adjusting successfully, proceeding to step 33)；If adjusting unsuccessfully, this subgraph colours unsuccessfully, all vertex color in this subgraph is reset to 0, proceeds to step S4.
Logical channel assignment method when frequency-hopping transmissions are adopted according to above-mentioned digital multimedia radio broadcasting, wherein：Described step 31) in, there are a color set and available color set in each summit in coloring subgraph, the color set on each summit is allocated according to the logic channel number of broadcast that it is located and the logic channel group parameter of system in coloring subgraph, and the available color set initializing each summit is identical with its color set；Comprise in color set is the color that initially can use, and comprise in available color set is the color that each summit current can use.
Further, logical channel assignment method when frequency-hopping transmissions being adopted according to above-mentioned digital multimedia radio broadcasting, wherein：Described step 33) in,
A, first coloring summit are the maximum points of the number of degrees in current coloration subgraph, if such summit has multiple, selecting wherein can be with minimum one of color set；Wherein, the number of degrees refer to the number having the summit that side is connected with current vertex；
B if not selecting first coloring summit, then the summit selecting be connected with upper one coloring summit do not colour in summit a minimum summit of available color set, if such summit has multiple, select a summit of effective number of degrees maximum；Wherein, effective number of degrees refer to there is, with current vertex, the number not colouring summit that side is connected；
If the uncoloured summit that the upper coloring summit of c is not connected, then from the beginning of last branch point, whether there is the branch point not colouring adjoint point according to branch point sequential search from back to front, if there are the branch point not colouring adjoint point, then select available color set minimum in the uncoloured connected adjoint point of this branch point does not colour adjoint point, if having multiple, select one of effective number of degrees maximum；If all branch points all do not have uncoloured connected adjoint point, selecting the minimum summit of available color set from all uncoloured summits, if there being the minimum summit of multiple available color sets, selecting a maximum summit of wherein effective number of degrees.
Further, logical channel assignment method when frequency-hopping transmissions being adopted according to above-mentioned digital multimedia radio broadcasting, wherein：Described step 35) in, color selection strategy is：Select a color from the available color set on coloring summit, and this color occurs from the minimum color of occurrence number in the available color set of its uncoloured adjacent vertex.
Further, logical channel assignment method when frequency-hopping transmissions being adopted according to above-mentioned digital multimedia radio broadcasting, wherein：Described step 38) in, adjust the color on colored summit, when so that the summit of coloring failure is successfully colored, comprise the following steps：
A) recalculate the available color set on all summits in current coloration subgraph, distribute a priority to all colored summit of current coloration subgraph, the priority on the summit of current coloration failure is set to five-star 1, the order sequence from big to small according to the preferential number of degrees of the adjustment priority on remaining colored summit, the preferential number of degrees are bigger, and adjustment priority is higher；The computing formula of the preferential number of degrees on colored summit is：
priority_count(Vi)=flagconnected(Vi)*α+size(ACS(Vi))-degree(Vi)
Wherein：priority_count(Vi) represent colored summit ViThe preferential number of degrees；flagconnected(Vi) represent the mark adjacent with the summit of current coloration failure, if ViAdjacent with the summit of current coloration failure, then flagconnected(Vi) it is 1, otherwise, flagconnected(Vi) value be 0；α is a constant；size(ACS(Vi)) it is ViACS in number of color；degree(Vi) it is ViThe number of degrees；
B) start color adjustment from the colored summit that coloring subgraph medium priority is 2, the method for adjustment is as follows：
B1) if the available color set on the colored summit of current adjustment is not empty set, then from the available color set on current adjustment summit, reselect a color to colour for it, amended color is deleted from its available color set, and updates it and do not colour the available color set of adjoint point；If currently the available color set on adjustment summit is empty set, the color value on this summit is set to 0, recalculates this summit and its available color set not colouring adjoint point, and judge that the color on the summit currently adjusting adjusts unsuccessfully；
B2) judge that whether color adjusts unsuccessfully on current adjustment summit, if failure, proceeds to step b3)；If the color on the summit of current adjustment adjusts successfully, and current color adjusts the summit that successful summit is not adjustment highest priority, then continue the higher summit of adjustment priority, proceed to step b1), if currently adjusting the summit that successful summit is adjustment highest priority, then proceed to step 33), wherein vertex color adjust successful standard be the ACS of its all uncoloured adjoint point be not all empty set；
B3) if the vertex color of current adjustment adjusts unsuccessfully and its available color set is not empty set, proceed to step b1), continue the summit of the current adjustment of adjustment；If the vertex color of current adjustment adjusts unsuccessfully and its available color set is empty set, then the color value on this summit is set to 0, recalculate this summit and its available color set not colouring adjoint point, find the summit of next priority, according to above-mentioned steps b1) summit of the next priority of adjustment；If the summit of next priority also adjusts failure, then continue to find to the lower summit of adjustment priority, if the summit finding last adjustment priority still adjusts failure, then whole vertex coloring adjusts unsuccessfully, and current coloration subgraph colours unsuccessfully, and vertex color values all in current coloration subgraph are set to 0 again, proceed to step S4, otherwise, continue the higher summit of adjustment priority, adjust unsuccessfully until the vertex color of highest priority adjust successfully or entirely vertex coloring.
Logical channel assignment method when frequency-hopping transmissions are adopted according to above-mentioned digital multimedia radio broadcasting, wherein：Described step S4 carries out the adjustment of the parameter of current coloration subgraph using one or more of mode：
41) the corresponding frame length broadcasted on each carrier frequency of adjustment current coloration subgraph and/or frame number, by all vertex color value set 0 in the subgraph of current coloration failure；Wherein, the method for adjustment includes merging frame or splits frame, merges frame and refers to merge some adjacent several frames on same carrier frequency and on the time, splits frame and refers to for a frame to split into several frames；Either split frame and still merge frame and be required to amended frame length and meet system requirements；
42) if current coloration failure subgraph be located certain carrier frequency can integral translation, translate all resources on an assistant carrier frequency of this coloring subgraph, then the color on the summit in all subgraphs reset to 0, the frame number of all subgraphs is also set to initial value；
43) if the logic channel number of the broadcast at current coloration subgraph place is not up to maximum, increase logic channel number, that is, the number of colours of increase subgraph to be adjusted；Then the color value on all summits in the subgraph of current coloration failure is set to 0 again；
44) if in the carrier frequency at subgraph place of current coloration failure, the frame length that there is each frame after a carrier frequency makes all frames on this carrier frequency compress still meets system requirements, then compress the frame length of the frame of all broadcast on this carrier frequency, the frame of each broadcast after compression is discharged successively according to the order before compression, then the vertex color of all subgraphs is reset to 0.
As described above, logical channel assignment method when the digital multimedia radio broadcasting of the present invention adopts frequency-hopping transmissions, have the advantages that：
(1) successfully solve the logical channel assignment problem of the NGB-W system with logic channel group by colouring algorithm, realize flexible Physical Frame Structure configuration in digital multimedia wireless broadcast system；
(2) polytype wireless broadcast system common transport can be supported on radio broadcasting frame structure, effectively realize backward compatibility, the forward compatibility of wireless broadcast system, be conducive to the further evolution in wireless broadcast system ground and seamlessly transit；
(3) it is capable of the frame of dissimilar system is carried out with the setting of different frame lengths, bandwidth, frequency, transmission mode, with take into account reduce signaling consumption while, effectively meet the data flow of the dissimilar wireless system different demands to transmission capacity, real-time；
(4) achieve all broadcast frames in logic channel group and all meet single tuning reception.
Brief description
Fig. 1 is shown as the flow chart using logical channel assignment method during frequency-hopping transmissions for the digital multimedia radio broadcasting of the present invention；
Fig. 2 is shown as the frame structure distribution diagram in a preferred embodiment of the present invention.
Specific embodiment
Below by way of specific instantiation, embodiments of the present invention are described, those skilled in the art the content disclosed by this specification can understand other advantages and effect of the present invention easily.The present invention can also be carried out by addition different specific embodiments or apply, and the every details in this specification can also be based on different viewpoints and application, without departing from the spirit of the present invention carries out various modifications and changes.
It should be noted that, diagram provided in the present embodiment only illustrates the basic conception of the present invention in a schematic way, then only show the assembly relevant with the present invention in schema rather than draw according to component count during actual enforcement, shape and size, it is actual when implementing, and the kenel of each assembly, quantity and ratio can be a kind of random change, and its assembly layout kenel be likely to increasingly complex.
The parameter that physical frame distributes pattern in the frame structure on carrier frequency includes carrier frequency numbering, broadcast type, the initial time on carrier frequency and termination time.It should be noted that the present invention main it is confirmed that the mapping method of broadcast logical channel in an assignment period, so only considering the situation of the various broadcast in the assignment period time.
With reference to Fig. 1, the digital multimedia radio broadcasting of the present invention is comprised the following steps using logical channel assignment method during frequency-hopping transmissions：
Step S1, in digital multimedia radio broadcasting, coloring problem will be modeled as using logical channel assignment problem during frequency-hopping transmissions.
Wherein, the frame of each broadcast in digital multimedia radio broadcasting is modeled as summit, each logic channel broadcasted is modeled as color.Specifically, by broadcast all in digital multimedia wireless broadcast system, the color value on the summit on all carrier frequency is set to 0；The translation number of times of all carrier frequency is set to 0.
Step S2, structure coloring subgraph, arrange the color set of each broadcast.
Specifically, when building coloring subgraph, it then follows rule below：
21) all frames on carrier frequency are divided into different subsets according to broadcast type, in each subset, comprise and only comprise all frames of this kind of broadcast；
22) if certain broadcast constitutes logic channel group with other broadcast, the frame subset constituting the broadcast of logic channel group is merged, constitutes joint subgraph；Otherwise, the frame subset of this broadcast constitutes alone a subgraph；Each subgraph or joint subgraph constitute a coloring subgraph；
23) if in each coloring subgraph the frame of two vertex correspondence on different carrier frequency and their time interval is less than frequency hopping guard time, with a line, this two summits are coupled together, and have the summit adjoint point referred to as each other that side is connected；
24) to all summit distribution color sets in each coloring subgraph, the number of color in the color set on each summit is identical with the current logic channel number of broadcast that it is located；The color set all same on all summits of same broadcast, if the summit of different broadcast does not constitute logic channel group each other, then there is no identical color, if there being logic channel group, in their color sets, the number of same color is identical with the number that the broadcast that they are located constitutes logic channel group.
Specifically, when the color set that each is broadcasted is set, the number of colours that the logic channel number of the broadcast according to each type is equal to logic channel number to each broadcast allocation, constitute and between the broadcast of logic channel group, share a part of color, the number of the logic channel group constituting between the number of shared-color and broadcast is identical.There is no common color between the frame of the broadcast not constituting logic channel group.
Step S3, current coloration subgraph is coloured, and judge coloring whether success；If it is not, proceeding to step S4；If so, proceed to step S5.
The logical channel assignment of the broadcast frame of whole NGB-W system is carried out in units of colouring subgraph.Each coloring subgraph individually colours.And if only if all coloring subgraphs are when all colouring successful, the success of multi-carrier frequency digital multimedia wireless broadcast system logical channel assignment；Otherwise, system logic channel distribution failure.
Specifically, step S3 comprises the following steps：
31) it is that each apex configuration colouring in subgraph can use color set (ACS).
Wherein, the color set on each summit is allocated according to the logic channel number of broadcast that it is located and the logic channel group parameter of system in coloring subgraph, and the available color set initializing each summit is identical with its color set；Comprise in color set is the color that initially can use, and comprise in available color set is the color that each summit current can use.
32) judge whether all summits in current coloration subgraph colour successfully, if so, then current coloration subgraph colours successfully, if it is not, then proceeding to step 33).
33) select coloring summit.
The present invention gives the vertex coloring in coloring subgraph in a certain order successively, coloring will find coloring summit according to summit selection strategy every time, if all summits all colour completing, subgraph coloring terminates, otherwise, continue to select next coloring summit according to summit selection strategy.
Specifically, carry out summit selection according to following rule：
A, first coloring summit are the maximum points of the number of degrees in current coloration subgraph, if such summit has multiple, selecting that wherein ACS is minimum one；Wherein, the number of degrees refer to the number having the summit that side is connected with current vertex.
If what b selected is not first coloring summit, the summit selecting is not colour a minimum summit of ACS in summit with upper one coloring summit is connected, if such summit has multiple, selects a summit of effective number of degrees maximum；Effective number of degrees refer to the number not colouring summit having side to be connected with current vertex.
If the uncoloured summit that the upper coloring summit of c is not connected, then from the beginning of last branch point, there is the branch point not colouring adjoint point according to branch point sequential search from back to front, if finding the branch point not colouring adjoint point, then select ACS minimum in the uncoloured connected adjoint point of this branch point does not colour adjoint point, if having multiple, select one of effective number of degrees maximum；If all branch points all do not have uncoloured connected adjoint point, selecting the minimum summit of ACS from all uncoloured summits, if there being the minimum summit of multiple ACS, selecting of wherein effective number of degrees maximum.
34) if the number not colouring adjoint point on the current summit selecting is more than 1, using the summit of current coloration as a branch point.
35) select color.
Specifically, color selection strategy is：The minimum color of occurrence number in the ACS occur in its uncoloured connected adjoint point is selected from the ACS on coloring summit.
36), after to current vertex coloring, update the ACS of this summit and its adjoint point.
Wherein, when the ACS on current coloration summit updates, color currently used for this summit is deleted from its ACS；When the ACS of the adjoint point on current coloration summit updates, deduct, with the CS of this adjoint point, the color that this adjoint point and its all colored adjoint point use.
The summit making current coloration is Vp, VpCurrent color value is Cp, VnIt is VpAn adjoint point, CnIt is VnAnd the color set that its all colored adjoint point uses, then：
ACS(Vp)=ACS (Vp)-Cp
ACS(Vn)=CS (Vn)-Cn
37) judge whether current vertex coloring is successful；If so, then proceed to step 32), until the success of all vertex colorings, that is, this subgraph colours successfully；If it is not, then proceeding to step 38).
Successfully whether standard is as follows to judge current vertex coloring：If all ACS not colouring adjoint point on current coloration summit are not all empty set then it is assumed that this color is suitable, this vertex coloring success；Otherwise, this vertex coloring failure.
If this vertex coloring success, check whether also uncoloured summit, if having, according to step 33) continually look for next coloring summit, complete when all summits all colour, then this subgraph or joint subgraph colour successfully；If the failure of this vertex coloring, it is adjusted to colouring unsuccessfully summit, i.e. step 38).
38) summit of adjustment coloring failure, if adjusting successfully, proceeds to step 33)；If adjusting unsuccessfully, this subgraph colours unsuccessfully.
During the summit of adjustment coloring failure, specifically include following steps：
A) distribution adjustment priority
Recalculate the ACS on all summits in current coloration subgraph, distribute a priority to all colored summit of current coloration subgraph, by the summit V of current coloration failurefailurePriority be set to highest, i.e. VfailurePriority be 1, the order sequence from big to small according to the preferential number of degrees of the adjustment priority on remaining colored summit, the preferential number of degrees are bigger, adjust priority higher.Wherein, the computing formula of the preferential number of degrees on colored summit is：
priority_count(Vi)=flagconnected(Vi)*α+size(ACS(Vi))-degree(Vi)
Wherein：priority_count(Vi) represent colored summit ViThe preferential number of degrees；flagconnected(Vi) represent and VfailureAdjacent mark, if ViWith VfailureAdjacent, then flagconnected(Vi) it is 1, otherwise, flagconnected(Vi) value be 0；α is a very big constant；size(ACS(Vi)) it is ViACS in number of color；degree(Vi) it is ViThe number of degrees.
B) adjust dice figure.
Colored summit (i.e. adjust_priority (the V being 2 from coloring subgraph medium prioritycolored(j))=2 summit) start color adjustment, the method for adjustment is as follows：
B1) if the available color set on the colored summit of current adjustment is not empty set, then from the available color set on current adjustment summit, reselect a color to colour for it, amended color is deleted from its available color set, and updates it and do not colour the available color set of adjoint point；If currently the available color set on adjustment summit is empty set, the color value on this summit is set to 0, recalculates this summit and its available color set not colouring adjoint point, and judge that the color on the summit currently adjusting adjusts unsuccessfully；
B2) judge that whether color adjusts unsuccessfully on current adjustment summit, if failure, proceeds to step b3)；If the color on the summit of current adjustment adjusts successfully, and current color adjusts the summit that successful summit is not adjustment highest priority, then continue the higher summit of adjustment priority, proceed to step b1), if currently adjusting the summit that successful summit is adjustment highest priority, then proceed to step 33), wherein vertex color adjust successful standard be the ACS of its all uncoloured adjoint point be not all empty set；
B3) if the vertex color of current adjustment adjusts unsuccessfully and its available color set is not empty set, proceed to step b1), continue the summit of the current adjustment of adjustment；If the vertex color of current adjustment adjusts unsuccessfully and its available color set is empty set, then the color value on this summit is set to 0, recalculate this summit and its available color set not colouring adjoint point, find the summit of next priority, according to above-mentioned steps b1) summit of the next priority of adjustment；If the summit of next priority also adjusts failure, then continue to find to the lower summit of adjustment priority, if the summit finding last adjustment priority still adjusts failure, then whole vertex coloring adjusts unsuccessfully, and current coloration subgraph colours unsuccessfully, and vertex color values all in current coloration subgraph are set to 0 again, proceed to step S4, otherwise, continue the higher summit of adjustment priority, adjust unsuccessfully until the vertex color of highest priority adjust successfully or entirely vertex coloring.
Step S4, judge whether the parameter of current coloration subgraph can adjust, if so, then adjust the parameter of current coloration subgraph, then proceed to step S2；If it is not, then logical channel assignment failure.
Specifically, step S4 carries out the adjustment of the parameter of current coloration subgraph using one or more of mode：
41) the corresponding frame length broadcasted on each carrier frequency of adjustment current coloration subgraph and/or frame number, by all vertex color value set 0 in the subgraph of current coloration failure；Wherein, the method for adjustment includes merging frame or splits frame, merges frame and refers to merge some adjacent several frames on same carrier frequency and on the time, splits frame and refers to for a frame to split into several frames；Either split frame and still merge frame and be required to amended frame length and meet system requirements.
It may be considered that changing frame distribution pattern by changing frame length when colouring unsuccessfully, then being coloured further according to new frame distribution pattern, being increased the coloring probability of success.But change frame length and be also required for certain restriction it is impossible to artificial obtaining arbitrarily changes, at this moment need one frame length scope of systemic presupposition, then changed according to this frame length scope.Wherein, change frame length frame number and can change frame structure distribution pattern, and then change the position relationship on each carrier frequency for the frame of its broadcast.
42) if current coloration failure subgraph be located certain carrier frequency can integral translation, translate all resources on an assistant carrier frequency of this coloring subgraph, then the color on the summit in all subgraphs reset to 0, the frame number of all subgraphs is also set to initial value.Wherein, the distance of translation will be far smaller than assignment period.
43) if the logic channel number of the broadcast at current coloration subgraph place is not up to maximum, increase logic channel number, that is, the number of colours of increase subgraph to be adjusted；Then the color value on all summits in the subgraph of current coloration failure is set to 0 again.
Increasing number of colours is to be also the most directly most efficient method, but increases number of colours and also will increase logic channel number, and the number of logic channel is intended to certain restriction.The attribute that therefore can be broadcasted according to each and system requirements, backstage configures the largest logical channel number of each broadcast so as to will not unrestrictedly increase, this also more tallies with the actual situation.For example, it is possible to the largest logical channel number of various types of broadcast is arranged to the carrier frequency number of each of which occupancy etc..
44) if in the carrier frequency at subgraph place of current coloration failure, the frame length that there is each frame after a carrier frequency makes all frames on this carrier frequency compress still meets system requirements, then compress the frame length of the frame of all broadcast on this carrier frequency, the frame of each broadcast after compression is discharged successively according to the order before compression, then the vertex color of all subgraphs is reset to 0.
Even colour in the carrier frequency that the subgraph of failure is located and there is a carrier frequency so that the frame length still meeting system after the frame length compression of all frames on this carrier frequency requires, the resource frame length on this carrier frequency can be compressed, the frame length of all frames on certain carrier frequency is made to be the half (or 1/3 of its former frame length, 1/4 etc.), then press the resource on this carrier frequency after the order discharge compression before compression, make the time total resources of each broadcast of this carrier frequency constant, but the repetition period becomes 2 times before compression (or 3 times, 4 times etc., multiple is the inverse of compression multiple).
Step S5, to remaining coloring subgraph colour, if all coloring subgraph coloring success, logical channel assignment success；If having a coloring subgraph to colour unsuccessfully, logical channel assignment failure.
Logical channel assignment method when adopting frequency-hopping transmissions with reference to the digital multimedia radio broadcasting that specific embodiments and the drawings are expanded on further the present invention.
In this embodiment, initial distribution pattern on each carrier frequency for the broadcast frame of each broadcast is as shown in table 1.
Table 1, the initial distribution pattern on each carrier frequency for the broadcast frame of each broadcast
| Carrier frequency number | Broadcast number | Initial time | Deadline |
| 1 | 1 | 0 | 102.50000000 |
| 1 | 1 | 102.50000000 | 205 |
| 1 | 1 | 205 | 307.50000000 |
| 1 | 1 | 307.50000000 | 410 |
| 1 | 1 | 410 | 512.50000000 |
| 1 | 1 | 512.50000000 | 615 |
| 1 | 1 | 615 | 717.50000000 |
| 1 | 1 | 717.50000000 | 820 |
| 1 | 2 | 820 | 910 |
| 1 | 2 | 910 | 1000 |
| 2 | 1 | 825 | 918.33333333 |
| 2 | 1 | -81.666666667 | 11.666666667 |
| 2 | 1 | 11.666666667 | 105.00000000 |
| 2 | 1 | 105.00000000 | 198.33333333 |
| 2 | 1 | 198.33333333 | 291.66666667 |
| 2 | 1 | 291.66666667 | 385 |
| 2 | 3 | 385 | 433.88888889 |
| 2 | 3 | 433.88888889 | 482.77777778 |
| 2 | 3 | 482.77777778 | 531.66666667 |
| 2 | 3 | 531.66666667 | 580.55555556 |
| 2 | 3 | 580.55555556 | 629.44444445 |
| 2 | 3 | 629.44444445 | 678.33333334 |
| 2 | 3 | 678.33333334 | 727.22222222 |
| 2 | 3 | 727.22222222 | 776.11111111 |
| 2 | 3 | 776.11111111 | 825.00000000 |
| 3 | 2 | 0 | 100 |
| 3 | 2 | 100 | 200 |
| 3 | 2 | 200 | 300 |
| 3 | 2 | 300 | 400 |
| 3 | 2 | 400 | 500 |
| 3 | 2 | 500 | 600 |
| 3 | 2 | 600 | 700 |
| 3 | 2 | 700 | 800 |
| 3 | 2 | 800 | 900 |
| 3 | 2 | 900 | 1000 |
NGB-W internal system one now has the broadcast of three types, three carrier frequency as can be seen from Table 1.It is assumed that the assignment period of system is 1000ms, the logic channel 1 of broadcast type 1 constitutes one group of logic channel group with the logic channel 2 of broadcast type 3, and carrier frequency maximal translation number of times is 3 times, and the unit of translation is 6ms.The largest logical number of channel of each broadcast is equal to the carrier frequency quantity each accounting for.The carrier frequency quantity of 3 kinds of broadcast occupancy is 3,2,1 respectively as can be seen from Table 1.
The frame length scope of various broadcast is respectively：
Broadcast 1 50～200 (ms)
Broadcast 2 50～200 (ms)
Broadcast 3 30～80 (ms)
Then the logical channel assignment situation of whole NGB-W system is asked for according to these known conditions; distribute logic channel according to above-mentioned process step for system; the broadcast frame requiring the same logic channel of same kind broadcast meets frequency hopping protection demand on carrier frequency; meanwhile, the broadcast frame of same logic channel group also meets frequency hopping protection demand on each carrier frequency.
As shown in table 2, its allocation result is as shown in Figure 2 for logical channel assignment result.
Table 2, logical channel assignment result table
| Carrier frequency number | Broadcast number | Initial time | Deadline | Color value |
| 1 | 1 | 0 | 102.50000000 | 2 |
| 1 | 1 | 102.50000000 | 205 | 2 |
| 2 | 1 | 205 | 307.50000000 | 2 |
| 1 | 1 | 307.50000000 | 410 | 1 |
| 1 | 1 | 410 | 512.50000000 | 3 |
| 1 | 1 | 512.50000000 | 615 | 3 |
| 1 | 1 | 615 | 717.50000000 | 2 |
| 1 | 1 | 717.50000000 | 820 | 2 |
| 1 | 2 | 820 | 910 | 5 |
| 1 | 2 | 910 | 1000 | 6 |
| 2 | 1 | 825 | 918.33333333 | 1 |
| 2 | 1 | -81.666666667 | 11.666666667 | 1 |
| 2 | 1 | 11.666666667 | 105.00000000 | 1 |
| 2 | 1 | 105.00000000 | 198.33333333 | 3 |
| 2 | 1 | 198.33333333 | 291.66666667 | 3 |
| 2 | 1 | 291.66666667 | 385 | 3 |
| 2 | 3 | 385 | 433.88888889 | 7 |
| 2 | 3 | 433.88888889 | 482.77777778 | 1 |
| 2 | 3 | 482.77777778 | 531.66666667 | 1 |
| 2 | 3 | 531.66666667 | 580.55555556 | 1 |
| 2 | 3 | 580.55555556 | 629.44444445 | 7 |
| 2 | 3 | 629.44444445 | 678.33333334 | 1 |
| 2 | 3 | 678.33333334 | 727.22222222 | 1 |
| 2 | 3 | 727.22222222 | 776.11111111 | 1 |
| 2 | 3 | 776.11111111 | 825.00000000 | 1 |
| 3 | 2 | 0 | 100 | 4 |
| 3 | 2 | 100 | 200 | 4 |
| 3 | 2 | 200 | 300 | 5 |
| 3 | 2 | 300 | 400 | 5 |
| 3 | 2 | 400 | 500 | 5 |
| 3 | 2 | 500 | 600 | 5 |
| 3 | 2 | 600 | 700 | 5 |
| 3 | 2 | 700 | 800 | 5 |
| 3 | 2 | 800 | 900 | 6 |
| 3 | 2 | 900 | 1000 | 4 |
Because the logic channel 1 of broadcast 1 forms one group of logic channel group with the logic channel 2 of broadcast 3, so being assigned with an identical color to them during coloring, i.e. color 1, as can be seen from Figure 2, there is not identical color, now system is allocated successfully, the logic channel number of each broadcast is respectively 3 in the same time on different carrier frequency, 3,2.Color value is mapped to logic channel can be：
Broadcast 1 color 1：Broadcast 1 logic channel 1
Broadcast 1 color 2：Broadcast 1 logic channel 2
Broadcast 1 color 3：Broadcast 1 logic channel 3
Broadcast 2 colors 4：Broadcast 2 logic channels 1
Broadcast 2 colors 5：Broadcast 2 logic channels 2
Broadcast 2 colors 6：Broadcast 2 logic channels 3
Broadcast 3 colors 1：Broadcast 3 logic channels 2
Broadcast 3 colors 7：Broadcast 3 logic Xindas 1
In sum, the digital multimedia radio broadcasting of the present invention successfully solves the logical channel assignment problem of the NGB-W system with logic channel group using logical channel assignment method during frequency-hopping transmissions by colouring algorithm, realizes flexible Physical Frame Structure configuration in digital multimedia wireless broadcast system；Polytype wireless broadcast system common transport can be supported on radio broadcasting frame structure, effectively realize backward compatibility, the forward compatibility of wireless broadcast system, be conducive to the further evolution in wireless broadcast system ground and seamlessly transit；Be capable of the frame of dissimilar system is carried out with the setting of different frame lengths, bandwidth, frequency, transmission mode, with take into account reduce signaling consumption while, effectively meet the data flow of the dissimilar wireless system different demands to transmission capacity, real-time；Achieve all broadcast frames in logic channel group and all meet single tuning reception.So, the present invention effectively overcomes various shortcoming of the prior art and has high industrial utilization.
Above-described embodiment only principle of the illustrative present invention and its effect, not for the restriction present invention.Any person skilled in the art all can carry out modifications and changes without prejudice under the spirit and the scope of the present invention to above-described embodiment.Therefore, those of ordinary skill in the art is completed under without departing from disclosed spirit and technological thought such as all equivalent modifications or change, must be covered by the claim of the present invention.
Claims (9)
1. a kind of digital multimedia radio broadcasting adopt frequency-hopping transmissions when logical channel assignment method it is characterised in that：Comprise the following steps：
Step S1, will in digital multimedia radio broadcasting using logical channel assignment problem during frequency-hopping transmissions be modeled as colour
Problem；
Step S2, structure coloring subgraph；
Step S3, current coloration subgraph is coloured, and judge coloring whether success；If it is not, proceeding to step S4；If
It is to proceed to step S5；
Step S4, judge whether the parameter of current coloration subgraph can adjust, if so, then adjust the ginseng of current coloration subgraph
Number, then proceed to step S2；If it is not, then logical channel assignment failure；
Step S5, remaining coloring subgraph is coloured, if the coloring success of all coloring subgraphs, logic channel divides
It is made into work(；If having a coloring subgraph to colour unsuccessfully, logical channel assignment failure.
2. logical channel assignment method when digital multimedia radio broadcasting according to claim 1 adopts frequency-hopping transmissions, its feature exists
In：In described step S1, the frame of each broadcast in digital multimedia radio broadcasting is modeled as summit, each is broadcasted
Logic channel is modeled as color.
3. logical channel assignment method when digital multimedia radio broadcasting according to claim 1 adopts frequency-hopping transmissions, its feature exists
In：In described step S2, when building coloring subgraph, it then follows rule below：
21) frame of all broadcast on carrier frequency is divided into different subsets according to broadcast type, comprises in each subset and only
Comprise all frames of this kind of broadcast；
22) if certain broadcast constitutes logic channel group with other broadcast, the frame subclass of the broadcast of logic channel group will be constituted
And, constitute joint subgraph；Otherwise, the frame subset of this broadcast constitutes alone a subgraph；Each subgraph or joint subgraph structure
Become a coloring subgraph；
23) if each coloring subgraph in two vertex correspondence frame on different carrier frequency and their time interval be less than jump
Frequency guard time, then coupled together this two summits with a line, and has the connected summit in side adjoint point referred to as each other；
24) to all summits distribution color sets in each coloring subgraph, the number of color in the color set on each summit and its
The current logic channel number broadcasted that is located is identical；The color set all same on all summits of same broadcast, different broadcast
If summit does not constitute logic channel group each other, there is no identical color, if there being logic channel group, their color sets
The number that the number of middle same color constitutes logic channel group with the broadcast that they are located is identical.
4. logical channel assignment method when digital multimedia radio broadcasting according to claim 1 adopts frequency-hopping transmissions, its feature exists
In：Described step S3 comprises the following steps：
31) it is that each apex configuration colouring in subgraph can use color set；
32) judge whether all summits in current coloration subgraph colour successfully, if so, then current coloration subgraph colours successfully,
If it is not, then proceeding to step 33)；
33) select coloring summit；
34) if the number not colouring adjoint point on the current summit selecting is more than 1, using the summit of current coloration as one
Branch point；
35) select color；
36), after to current vertex coloring, update the available color set of this summit and its adjoint point；Wherein, current coloration summit
When available color set updates, color currently used for this summit is deleted from its available color set；The neighbour on current coloration summit
When the available color set of point updates, deduct, with the color set of this adjoint point, the face that this adjoint point and its all colored adjoint point use
Color；
37) judge whether current vertex coloring is successful；If so, then proceed to step 32), until the success of all vertex colorings,
I.e. this subgraph colours successfully；If it is not, then proceeding to step 38)；
Wherein, successfully whether standard is as follows to judge current vertex coloring：If all adjoint points that do not colour on current coloration summit
Available color set is not all empty set, then this vertex coloring success；Otherwise, this vertex coloring failure；
38) color on the colored summit of adjustment, enabling the summit of coloring failure to be successfully colored, if adjusting successfully, proceeding to step
Rapid 33)；If adjusting unsuccessfully, this subgraph colours unsuccessfully, all vertex color in this subgraph is reset to 0, proceeds to step
Rapid S4.
5. logical channel assignment method when digital multimedia radio broadcasting according to claim 5 adopts frequency-hopping transmissions, its feature exists
In：Described step 31) in, there are a color set and available color set in each summit in coloring subgraph, each top
The color set of point is carried out minute according to the logic channel number of broadcast that it is located and the logic channel group parameter of system in coloring subgraph
Join, the available color set initializing each summit is identical with its color set；Comprise in color set is the face that initially can use
Color, comprise in available color set is the color that each summit current can use.
6. logical channel assignment method when digital multimedia radio broadcasting according to claim 5 adopts frequency-hopping transmissions, its feature exists
In：Described step 33) in,
A, first coloring summit are the maximum points of the number of degrees in current coloration subgraph, if such summit has multiple, select
Wherein can be with one of color set minimum；Wherein, the number of degrees refer to the number having the summit that side is connected with current vertex；
B if not select first coloring summit, then the summit selecting be with upper one coloring summit be connected do not colour top
A minimum summit of available color set in point, if such summit has multiple, selects a maximum summit of effective number of degrees；
Wherein, effective number of degrees refer to there is, with current vertex, the number not colouring summit that side is connected；
If c upper one coloring summit not be connected uncoloured summit, from the beginning of last branch point, according to point
Whether fulcrum sequential search from back to front has the branch point not colouring adjoint point, if there are the branch point not colouring adjoint point,
Select available color set minimum in the uncoloured connected adjoint point of this branch point does not colour adjoint point, if having multiple, selects
One of effective number of degrees maximum；If all branch points all do not have uncoloured connected adjoint point, from all uncoloured summits
Selecting the minimum summit of available color set, if there being the minimum summit of multiple available color sets, selecting the wherein effectively number of degrees maximum
A summit.
7. logical channel assignment method when digital multimedia radio broadcasting according to claim 5 adopts frequency-hopping transmissions, its feature exists
In：Described step 35) in, color selection strategy is：Select a color from the available color set on coloring summit, and
And this color occurs from the minimum color of occurrence number in the available color set of its uncoloured adjacent vertex.
8. logical channel assignment method when digital multimedia radio broadcasting according to claim 5 adopts frequency-hopping transmissions, its feature exists
In：Described step 38) in, adjust the color on colored summit, when so that the summit of coloring failure is successfully colored, bag
Include following steps：
A) recalculate the available color set on all summits in current coloration subgraph, all colored to current coloration subgraph
A priority is distributed on summit, and the priority on the summit of current coloration failure is set to five-star 1, remaining colored
The order sequence from big to small according to the preferential number of degrees of the adjustment priority on summit, the preferential number of degrees are bigger, and adjustment priority is higher；
The computing formula of the preferential number of degrees on colored summit is：
priority_count(Vi)=flagconnected(Vi)*α+size(ACS(Vi))-degree(Vi)
Wherein：priority_count(Vi) represent colored summit ViThe preferential number of degrees；flagconnected(Vi) represent and lose with current coloration
The adjacent mark in the summit lost, if ViAdjacent with the summit of current coloration failure, then flagconnected(Vi) it is 1, otherwise,
flagconnected(Vi) value be 0；α is a constant；size(ACS(Vi)) it is ViACS in number of color；degree(Vi) be
ViThe number of degrees；
B) start color adjustment from the colored summit that coloring subgraph medium priority is 2, the method for adjustment is as follows：
B1) if the available color set on the colored summit of current adjustment is not empty set, from the current available color adjusting summit
Concentration reselects a color and colours for it, and amended color deleted from its available color set, and updates it not
The available color set of color adjoint point；If currently the available color set on adjustment summit is empty set, the color value on this summit is set to 0,
Recalculate this summit and its available color set not colouring adjoint point, and judge that the color on the summit currently adjusting adjusts unsuccessfully；
B2) judge that whether color adjusts unsuccessfully on current adjustment summit, if failure, proceeds to step b3)；If the top of current adjustment
The color of point adjusts successfully, and current color adjusts the summit that successful summit is not adjustment highest priority, then continue adjustment
The higher summit of priority, proceeds to step b1), if currently adjusting the summit that successful summit is adjustment highest priority,
Then proceed to step 33), the ACS that wherein vertex color adjusts that successful standard is its all uncoloured adjoint point is not all empty
Collection；
B3) if the vertex color of current adjustment adjusts unsuccessfully and its available color set is not empty set, proceed to step b1), continue
The summit that continuous adjustment currently adjusts；If the vertex color of current adjustment adjusts unsuccessfully and its available color set is empty set, should
The color value on summit is set to 0, recalculates this summit and its available color set not colouring adjoint point, finds next priority
Summit, according to above-mentioned steps b1) summit of the next priority of adjustment；If the summit of next priority also adjusts mistake
Lose, then continue to find to the lower summit of adjustment priority, if the summit finding last adjustment priority still adjusts mistake
Lose, then whole vertex coloring adjusts unsuccessfully, and current coloration subgraph colours unsuccessfully, by all vertex color in current coloration subgraph
Value is set to 0 again, proceeds to step S4, otherwise, continues the higher summit of adjustment priority, until the summit of highest priority
Color adjusts successfully or whole vertex coloring adjusts unsuccessfully.
9. logical channel assignment method when digital multimedia radio broadcasting according to claim 1 adopts frequency-hopping transmissions, its feature exists
In：Described step S4 carries out the adjustment of the parameter of current coloration subgraph using one or more of mode：
41) the corresponding frame length broadcasted on each carrier frequency of adjustment current coloration subgraph and/or frame number, by current coloration failure
Subgraph in all vertex color value set 0；Wherein, the method for adjustment includes merging frame or splits frame, merges frame and is
Refer to merge some adjacent several frames on same carrier frequency and on the time, split frame and refer to for a frame to split into several frames；
Either split frame and still merge frame and be required to amended frame length and meet system requirements；
42) if current coloration failure subgraph be located certain carrier frequency can integral translation, translate one of this coloring subgraph
Then the color on the summit in all subgraphs is reset to 0, the frame number of all subgraphs is also set to by all resources on assistant carrier frequency
Initial value；
43) if the logic channel number of the broadcast at current coloration subgraph place is not up to maximum, increase logic channel number,
Just it is to increase the number of colours of subgraph to be adjusted；Then by the color value weight on all summits in the subgraph of current coloration failure
Newly it is set to 0；
44) if in the carrier frequency at subgraph place of current coloration failure, after there are all frames compressions that a carrier frequency makes on this carrier frequency
The frame length of each frame still meets system requirements, then compress the frame length of the frame of all broadcast on this carrier frequency, will be each after compression
The frame of individual broadcast discharges successively according to the order before compression, then the vertex color of all subgraphs is reset to 0.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510477350.1A CN106452699B (en) | 2015-08-06 | 2015-08-06 | Multi-carrier frequency digital multimedia radio broadcasting frequency-hopping transmissions mapping logical channels method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510477350.1A CN106452699B (en) | 2015-08-06 | 2015-08-06 | Multi-carrier frequency digital multimedia radio broadcasting frequency-hopping transmissions mapping logical channels method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106452699A true CN106452699A (en) | 2017-02-22 |
| CN106452699B CN106452699B (en) | 2019-05-14 |
Family
ID=58092126
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510477350.1A Active CN106452699B (en) | 2015-08-06 | 2015-08-06 | Multi-carrier frequency digital multimedia radio broadcasting frequency-hopping transmissions mapping logical channels method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106452699B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1625256A (en) * | 2003-12-03 | 2005-06-08 | 北京泰美世纪科技有限公司 | Transmission method for raio multimedic broadcast system and its system |
| CN101005338A (en) * | 2006-01-16 | 2007-07-25 | 华为技术有限公司 | Multiplexing method for broadcast multicast service data and de-multiplexing method |
| US20080310343A1 (en) * | 2007-06-15 | 2008-12-18 | Krishna Balachandran | Methods of jointly assigning resources in a multi-carrier, multi-hop wireless communication system |
| US20100008316A1 (en) * | 2008-07-10 | 2010-01-14 | Nec (China) Co., Ltd. | Network interference evaluating method, dynamic channel assignment method and apparatus used in wireless networks |
| CN102119514A (en) * | 2008-08-20 | 2011-07-06 | 高通股份有限公司 | A method and apparatus for sharing signals on a single channel |
| CN104184548A (en) * | 2014-04-17 | 2014-12-03 | 中兴通讯股份有限公司 | Random access sequence transmission method and device |
| CN104219542A (en) * | 2014-09-23 | 2014-12-17 | 中国科学院上海高等研究院 | Configuration method of frame structure of digital multimedia wireless broadcasting system |
-
2015
- 2015-08-06 CN CN201510477350.1A patent/CN106452699B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1625256A (en) * | 2003-12-03 | 2005-06-08 | 北京泰美世纪科技有限公司 | Transmission method for raio multimedic broadcast system and its system |
| CN101005338A (en) * | 2006-01-16 | 2007-07-25 | 华为技术有限公司 | Multiplexing method for broadcast multicast service data and de-multiplexing method |
| US20080310343A1 (en) * | 2007-06-15 | 2008-12-18 | Krishna Balachandran | Methods of jointly assigning resources in a multi-carrier, multi-hop wireless communication system |
| US20100008316A1 (en) * | 2008-07-10 | 2010-01-14 | Nec (China) Co., Ltd. | Network interference evaluating method, dynamic channel assignment method and apparatus used in wireless networks |
| CN102119514A (en) * | 2008-08-20 | 2011-07-06 | 高通股份有限公司 | A method and apparatus for sharing signals on a single channel |
| CN104184548A (en) * | 2014-04-17 | 2014-12-03 | 中兴通讯股份有限公司 | Random access sequence transmission method and device |
| CN104219542A (en) * | 2014-09-23 | 2014-12-17 | 中国科学院上海高等研究院 | Configuration method of frame structure of digital multimedia wireless broadcasting system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106452699B (en) | 2019-05-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6640085B2 (en) | Broadcast / broadband congestion network | |
| CN105960807A (en) | System and method for WLAN OFDMA design of subcarrier groups and frame format | |
| CN101156485A (en) | Method and network appliance for adjusting communication resource in community | |
| CN101754242B (en) | Access method of opportunistic cognitive multi-carrier link layer protocol | |
| KR20120023795A (en) | Method, apparatus and system for configuring multimedia broadcast multicast service(mbms) control information | |
| CN107534923B (en) | Hierarchical access information table for controlling access to a cellular network | |
| CN105830516A (en) | System and method for OFDMA resource management in WLAN | |
| CN103595461B (en) | A kind of resource allocation methods of ultra-large VSAT system frame structure | |
| CN101184318A (en) | Wireless resource allocation method and device of OFDMA system | |
| CN108811118A (en) | Scheduling of resource, transmission method and the device of long PUCCH, equipment and storage medium | |
| CN105704821A (en) | Channel mapping based MAC protocol of multi-channel distribution method | |
| CN109152037A (en) | Bandwidth resources configuration method, device and system | |
| CN109245872B (en) | A kind of WLAN upgoing O FDMAPPDU transmission method and device | |
| KR20100132852A (en) | Wireless broadcasting communication system and method for broadcasting service therein | |
| CN105208661A (en) | Wireless network channel distribution method and system | |
| WO2021238585A1 (en) | Data transmission method and related device | |
| CN104219542B (en) | A kind of collocation method of the frame structure of digital multimedia wireless broadcast system | |
| CN106452699A (en) | Multi-carrier frequency digital multimedia wireless radio frequency hopping transmission logic channel mapping method | |
| CN106130705A (en) | A kind of band resource distribution indicating means under frequency division multiple access transmission mode | |
| CN101588631B (en) | Method for controlling channel resource allocation | |
| KR20130045323A (en) | Data transmission method, base station and terminal | |
| CN104159309B (en) | A kind of resource allocation optimization method and device | |
| CN102547727B (en) | Frequency band distribution method and device | |
| CN113453164B (en) | Method, device and equipment for broadcasting MBMS in NR cell | |
| CN104158751B (en) | A kind of flow control methods and terminal |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |