CN106452699B - Multi-carrier frequency digital multimedia radio broadcasting frequency-hopping transmissions mapping logical channels method - Google Patents
Multi-carrier frequency digital multimedia radio broadcasting frequency-hopping transmissions mapping logical channels method Download PDFInfo
- Publication number
- CN106452699B CN106452699B CN201510477350.1A CN201510477350A CN106452699B CN 106452699 B CN106452699 B CN 106452699B CN 201510477350 A CN201510477350 A CN 201510477350A CN 106452699 B CN106452699 B CN 106452699B
- Authority
- CN
- China
- Prior art keywords
- vertex
- color
- subgraph
- coloring
- broadcast
- 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.)
- Active
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
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Multimedia (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The present invention provides a kind of digital multimedia radio broadcasting using logical channel assignment method when frequency-hopping transmissions, logical channel assignment problem when frequency-hopping transmissions will be used to be modeled as coloring problem in digital multimedia radio broadcasting；Building coloring subgraph；Current coloration subgraph is coloured, and judges whether coloring succeeds；If it is not, adjusting the parameter of current coloration subgraph when the parameter of current coloration subgraph can adjust, then construct coloring subgraph；If so, being coloured to remaining coloring subgraph, if the coloring success of all coloring subgraphs, logical channel assignment success；If having a coloring subgraph coloring failure, logical channel assignment failure.Logical channel assignment method makes time interval of the frame of the same logic channel from same type of broadcast on each carrier frequency at least more than frequency hopping guard time when digital multimedia radio broadcasting of the invention uses frequency-hopping transmissions, and the broadcast frame in the same logic channel group is made also to meet the requirement of frequency hopping guard time on multiple carrier frequency.
Description
Technical field
The present invention relates to the technical fields of broadcast television communications, use more particularly to a kind of digital multimedia radio broadcasting
Logical channel assignment method when frequency-hopping transmissions.
Background technique
The development advanced by leaps and bounds with information technology, TV has had begun by first generation DTV in the world
(DVB-C, DVB-S, DVB-T, ATSC, ISDB-T, CMMB and DTMB) to second generation DTV (DVB-C2, DVB-S2,
DVB-T2 and ATSC3.0) rapid development.At home, it was just proposed early in 2010 and " determines to accelerate to promote telecommunications network, broadcast
Television network and the internet integration of three networks ", also indicates that, " promotes telecommunications network, broadcasting and television network and the Internet converged development, realizes three
Net interconnects, resource-sharing, provides a variety of services such as speech, data and radio and television for user, for promoting information and text
Change industry development, improve national economy and social IT application level, meets the increasingly various production of the people, service for life need
It asks, pulls domestic consumption, form new growth engines, be of great significance ".In order to cooperate the information of the national integration of three networks to produce
Industry development strategic objective, State Administration of Radio Film and Television start Next generation broadcasting network (Next comprehensively
Generation Broadcasting, NGB) strategic plan, " China's national situation, the integration of three networks, wire and wireless will be suitble to mutually to tie
Close, full process and full network " it is determined as the strategic objective of China's Next generation broadcasting network.NGB-W(Next Generation
Broadcasting-Wireless) be China's Next generation broadcasting network wireless portion, it need within a very long time
Meet country, society and the people to have required and novel need the various of all kinds of public information services such as radiated television
It asks, to realize that the complete upgrading to existing television network broadcast system is regenerated.
In order to improve the transmission speed and efficiency of transmission of NGB-W system, multi-carrier frequency frequency-hopping transmissions mechanism is generally used.It wants
The frame that a variety of different type broadcast can be transmitted on each carrier frequency of multi-carrier frequency digital multimedia wireless broadcast system is sought, with
Time-multiplexed mode is transmitted on each carrier frequency, and the flexible transmission requirement of frame is met with this.In order to support flexible resource
Mapping and instruction receiving end receive the data of its needs, and have introduced the concept of logic channel.Logic channel is by identical or phase
The business datum of pass forms.It is received in receiving end using single tuning receiver, and requires radio broadcasting signal in multi-carrier frequency frequency hopping
When transmission, the same logic channel of same type of broadcast or the logic channel for belonging to same logic channel group are mapping to difference
The frame of carrier frequency keeps certain Hopping time (not less than 5ms) in time, to guarantee that single tuning receiver having time is completed to jump
Frequency is handled.
The problem of distributing logic channel to the frame of each broadcast is similar with the Vertex Coloring Problem in graph theory, therefore by overloading
Frequency word multi-media radio broadcast frequency-hopping transmissions mapping logical channels problem is modeled as the Vertex Coloring Problem in graph theory.Frame is built
Logic channel is modeled as color by mould Cheng Dingdian, if two frames belong to the same of the same logic channel group or same broadcast
One logic channel, and they are on different carrier frequency, but their time interval is less than frequency hopping guard time, then by the two
Frame is connected between corresponding vertex with a line.After coloring is completed all vertex a kind of upper color, and have side
Connected vertex color is different.In the prior art, obtain frame structure distribution pattern on the basis of, using classics backtracking algorithm come
Coloring problem is solved, advantage is that algorithm is simple, the disadvantage is that support logic channel group frequency-hopping transmissions, calculating time is not longer.
Summary of the invention
In view of the foregoing deficiencies of prior art, the purpose of the present invention is to provide a kind of digital multimedia radio broadcastings
Using logical channel assignment method when frequency-hopping transmissions, pattern, design branch are distributed for multi-carrier frequency frame structure under frequency-hopping transmissions mode
Hold the Logic Channel Identifier mapping method comprising logic channel group, propose more effective color rendering intent so that digital multimedia without
Line broadcasts the frame that can neatly transmit different types of broadcast, and the same logic channel from same type of broadcast
Time interval of the frame on each carrier frequency at least more than frequency hopping guard time, while making the broadcast in the same logic channel group
Frame will also meet the requirement of frequency hopping guard time on multiple carrier frequency, finally enable single tuning receiver to be properly received various
Broadcast the frame from each logic channel.
In order to achieve the above objects and other related objects, the present invention provides a kind of digital multimedia radio broadcasting using frequency hopping
Logical channel assignment method when transmission, comprising the following steps: frequency-hopping transmissions step S1, will be used in digital multimedia radio broadcasting
When logical channel assignment problem be modeled as coloring problem；Step S2, building coloring subgraph；Step S3, to current coloration subgraph
It is coloured, and judges whether coloring succeeds；If it is not, being transferred to step S4；If so, being transferred to step S5；Step S4, judgement is current
Whether the parameter of dice figure can adjust, if so, the parameter of adjustment current coloration subgraph, then it is transferred to step S2；If it is not, then patrolling
Collect channel distribution failure；Step S5, remaining coloring subgraph is coloured, if the coloring success of all coloring subgraphs, is patrolled
Collect channel distribution success；If having a coloring subgraph coloring failure, logical channel assignment failure.
Logical channel assignment method when using frequency-hopping transmissions according to above-mentioned digital multimedia radio broadcasting, in which: described
In step S1, the frame of broadcast each in digital multimedia radio broadcasting is modeled as vertex, the logic channel of each broadcast is built
Mould Cheng Yanse.
Logical channel assignment method when using frequency-hopping transmissions according to above-mentioned digital multimedia radio broadcasting, in which: described
In step S2, when building colours subgraph, it then follows following rule:
21) frame by all broadcast on carrier frequency is divided into different subsets according to broadcast type, includes in each subset
And all frames only comprising this kind broadcast；
22) if certain broadcast constitutes logic channel group with other broadcast, frame of the broadcast of logic channel group will be constituted
Collection merges, and constitutes joint subgraph；Otherwise, the frame subset of the broadcast constitutes alone a subgraph；Each subgraph or joint subgraph
Constitute a coloring subgraph；
If 23) it is each coloring subgraph in two vertex correspondences frame is on different carrier frequency and their time interval is small
In frequency hopping guard time, then the two vertex are connected with a line, and the vertex for having side connected is known as mutual neighbour
Point；
24) color set is distributed to all vertex in each coloring subgraph, the number of color in the color set on each vertex
It is identical as the current logic channel number broadcasted where it；The color set on all vertex of the same broadcast is all the same, different wide
If the vertex broadcast does not constitute logic channel group each other, without identical color, if there is logic channel group, their colors
Concentrate the number of same color identical as the broadcast composition number of logic channel group where them.
Logical channel assignment method when using frequency-hopping transmissions according to above-mentioned digital multimedia radio broadcasting, in which: described
Step S3 the following steps are included:
31) color set can be used for each apex configuration in coloring subgraph；
32) judge whether all vertex in current coloration subgraph colour success, if so, current coloration subgraph is coloured to
Function, if it is not, being then transferred to step 33)；
33) selection coloring vertex；
34) if the number of the uncolored adjoint point on the vertex currently selected is greater than 1, using the vertex of current coloration as one
A branch point；
35) color is selected；
36) after to current vertex coloring, the available color set of the vertex and its adjoint point is updated；Wherein, current coloration vertex
Available color set update when, the currently used color in the vertex can be used in color set from it and delete；Current coloration vertex
When the available color set of adjoint point updates, the face that the adjoint point and its all colored adjoint point use is subtracted with the color set of the adjoint point
Color；
37) judge whether current vertex coloring succeeds；If so, it is transferred to step 32), until the success of all vertex colorings,
I.e. the subgraph colours successfully；If it is not, being then transferred to step 38)；
Wherein, judge whether successful standard is as follows for current vertex coloring: if all uncolored neighbours on current coloration vertex
The available color set of point is not empty set, then vertex coloring success；Otherwise, which fails；
38) color on colored vertex is adjusted, the vertex for enabling coloring to fail is successfully colored, if adjusting successfully, is transferred to
Step 33)；If adjustment failure, all vertex colors in the subgraph are reset to 0, are transferred to step by subgraph coloring failure
S4。
Logical channel assignment method when using frequency-hopping transmissions according to above-mentioned digital multimedia radio broadcasting, in which: described
In step 31), there are a color set and available color set in each vertex coloured in subgraph, and the color set on each vertex exists
It is allocated in coloring subgraph according to the logic channel group parameter of the logic channel number and system broadcasted where it, initialization is each
The available color set on vertex is identical as its color set；Include in color set is the color that initially can be used, and can use color set
Inside include is the color that current each vertex can be used.
Further, logical channel assignment method when using frequency-hopping transmissions according to above-mentioned digital multimedia radio broadcasting,
Wherein: in the step 33),
A, first coloring vertex is the maximum point of degree in current coloration subgraph, if such vertex has multiple, is selected
Selecting wherein can be one the smallest with color set；Wherein, degree refers to the number on the vertex for having side to be connected with current vertex；
B, if not first coloring vertex of selection, the then vertex selected are uncolored to be connected with upper one coloring vertex
In vertex can use the smallest vertex of color set, if such vertex have it is multiple, select effective degree it is maximum one top
Point；Wherein, effective degree refers to the number on the uncolored vertex for having side to be connected with current vertex；
If the uncoloured vertex that upper coloring vertex is not connected c, since the last one branch point, according to
Whether the sequential search of branch point from back to front has the branch point of uncolored adjoint point, there is the branch point of uncolored adjoint point if it exists,
Then selection can use the smallest uncolored adjoint point of color set to select if having multiple in the uncoloured connected adjoint point of the branch point
Select effective degree maximum one；If all branch points are without uncoloured connected adjoint point, from all uncoloured vertex
Middle selection can use the smallest vertex of color set, if there is multiple the smallest vertex of available color set, select wherein that effective degree is most
A big vertex.
Further, logical channel assignment method when using frequency-hopping transmissions according to above-mentioned digital multimedia radio broadcasting,
Wherein: in the step 35), color selection strategy an are as follows: color is selected from the available color set on coloring vertex, and should
Color occurs from the least color of frequency of occurrence in the available color set of its uncoloured adjacent vertex.
Further, logical channel assignment method when using frequency-hopping transmissions according to above-mentioned digital multimedia radio broadcasting,
Wherein: in the step 38), the color on colored vertex is adjusted, when the vertex for enabling coloring to fail is successfully colored, including with
Lower step:
A) the available color set that recalculates all vertex in current coloration subgraph, to current coloration subgraph it is all
A priority is distributed on color vertex, sets five-star 1 for the priority on the vertex of current coloration failure, remaining colored
The adjustment priority on vertex sorts according to the sequence of preferential degree from big to small, and preferential degree is bigger, and adjustment priority is higher；?
Colour the calculation formula of the preferential degree on vertex are as follows:
priority_count(Vi)=flagconnected(Vi)*α+size(ACS(Vi))-degree(Vi)
Wherein: priority_count (Vi) indicate colored vertex ViPreferential degree；flagconnected(Vi) indicate with
The adjacent mark in the vertex of current coloration failure, if ViIt is adjacent with the vertex 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 ViDegree；
B) color adjusts the colored vertex that priority is 2 since coloring subgraph, and the method for adjustment is as follows:
B1) if the available color set on the colored vertex currently adjusted is not empty set, from the available of current adjustment vertex
A color is reselected in color set to colour for it, and modified color can be used in color set from it and delete, and update it
The available color set of uncolored adjoint point；If currently the available color set on adjustment vertex is empty set, the color value on the vertex is set
It is 0, recalculates the available color set of the vertex and its uncolored adjoint point, and determines that the color adjustment on the vertex currently adjusted is lost
It loses；
B2) whether color adjustment fails on judgement current adjustment vertex, if failure, is transferred to step b3)；If the top currently adjusted
The color of point adjusts successfully, and it is the vertex for adjusting highest priority that current color, which adjusts successful vertex not, then continues to adjust
The higher vertex of priority, is transferred to step b1), if currently adjusting successful vertex is the vertex for adjusting highest priority,
It is transferred to step 33), it is not empty set that wherein vertex color, which adjusts the ACS that successful standard is its all uncoloured adjoint point,；
B3) if the vertex color adjustment currently adjusted fails and its available color set is not empty set, it is transferred to step b1),
Continue to adjust the vertex currently adjusted；If the vertex color adjustment currently adjusted fails and its available color set is empty set, will
The color value on the vertex is set to 0, recalculates the available color set of the vertex and its uncolored adjoint point, finds next priority
Vertex, the vertex of next priority is adjusted according to above-mentioned steps b1)；If the vertex of next priority also adjusts failure,
Then continue to find to the lower vertex of adjustment priority, if the vertex for finding the last one adjustment priority still adjusts failure,
Then entire vertex coloring adjustment failure, current coloration subgraph coloring failure, by vertex color value weights all in current coloration subgraph
It newly is set to 0, is transferred to step S4, otherwise, continues to adjust the higher vertex of priority, until the vertex color of highest priority adjusts
Success or entire vertex coloring adjustment failure.
Logical channel assignment method when using frequency-hopping transmissions according to above-mentioned digital multimedia radio broadcasting, in which: described
Step S4 carries out the adjustment of the parameter of current coloration subgraph using one or more of mode:
41) frame length and/or frame number of the corresponding broadcast of adjustment current coloration subgraph on each carrier frequency, current coloration is lost
All vertex color value set 0 in the subgraph lost；Wherein, the method for adjustment includes merging frame or splitting frame, and merging frame is
Refer to and merge some several frames adjacent on the same carrier frequency and on the time, fractionation frame, which refers to, splits into several frames for a frame；
It either splits frame and still merges frame and be required to modified frame length and meet system requirements；
If 42) current coloration failure subgraph where some carrier frequency can integral translation, translate the coloring subgraph
Then the color on the vertex in all subgraphs is reset to 0 by all resources on one assistant carrier frequency, the frame number of all subgraphs is also set
For initial value；
43) if the logic channel number of the broadcast where current coloration subgraph is not up to maximum value, increase logic channel number,
Increase the number of colours of subgraph namely to be adjusted；Then by the color value on all vertex in the subgraph of current coloration failure
Again it is set to 0；
If 44) make all frame pressures on the carrier frequency there are a carrier frequency in the carrier frequency where the subgraph of current coloration failure
The frame length of each frame still meets system requirements after contracting, then the frame length of the frame of all broadcast on the carrier frequency is compressed, after compression
The frame of each broadcast successively discharged according to the sequence before compression, the vertex color of all subgraphs is then reset to 0.
As described above, logical channel assignment method when digital multimedia radio broadcasting of the invention uses frequency-hopping transmissions, tool
Have it is following the utility model has the advantages that
(1) it is asked by the logical channel assignment that colouring algorithm successfully solves the NGB-W system with logic channel group
Topic realizes flexible Physical Frame Structure configuration in digital multimedia wireless broadcast system；
(2) a plurality of types of wireless broadcast system common transports, effectively realization nothing can be supported on radio broadcasting frame structure
Backward compatibility, the forward compatibility of line broadcast system, with being conducive to wireless broadcast system further evolution and smooth transition；
(3) it can be realized the setting that different frame lengths, bandwidth, frequency point, transmission mode are carried out to the frame of different type system, with
Taking into account reduces signaling overheads while, effectively meet the data flow of different type wireless system to transmission capacity, real-time
Different demands；
(4) all broadcast frames in logic channel group are realized and all meet single tuning reception.
Detailed description of the invention
Fig. 1 is shown as the stream of logical channel assignment method when digital multimedia radio broadcasting of the invention uses frequency-hopping transmissions
Cheng Tu；
Fig. 2 is shown as the frame structure distribution diagram in a preferred embodiment of the present invention.
Specific embodiment
Illustrate embodiments of the present invention below by way of specific specific example, those skilled in the art can be by this specification
Other advantages and efficacy of the present invention can be easily understood for disclosed content.The present invention can also pass through in addition different specific realities
The mode of applying is embodied or practiced, the various details in this specification can also based on different viewpoints and application, without departing from
Various modifications or alterations are carried out under spirit of the invention.
It should be noted that the basic conception that only the invention is illustrated in a schematic way is illustrated provided in the present embodiment,
Then only shown in schema with it is of the invention in related component rather than component count, shape and size when according to actual implementation draw
System, when actual implementation kenel, quantity and the ratio of each component can arbitrarily change for one kind, and its assembly layout kenel can also
It can be increasingly complex.
The parameter of frame structure distribution pattern of the physical frame on carrier frequency includes carrier frequency number, broadcast type, on carrier frequency
Initial time and termination time.It should be noted that the present invention is main it is confirmed that the broadcast logical in an assignment period is believed
The mapping method in road, so only considering the situation of the various broadcast in an assignment period time.
Referring to Fig.1, logical channel assignment method includes when digital multimedia radio broadcasting of the invention uses frequency-hopping transmissions
Following steps:
Step S1, logical channel assignment problem when frequency-hopping transmissions will be used to be modeled as in digital multimedia radio broadcasting
Color problem.
Wherein, the frame by broadcast each in digital multimedia radio broadcasting is modeled as vertex, and the logic of each broadcast is believed
Road is modeled as color.Specifically, the face on the vertex by broadcast all in digital multimedia wireless broadcast system on all carrier frequency
Color value is set to 0；The translation number of all carrier frequency is set to 0.
Step S2, building coloring subgraph, is arranged the color set of each broadcast.
Specifically, when building coloring subgraph, it then follows following rule:
21) all frames on carrier frequency are divided into different subsets according to broadcast type, include in each subset and only wrapped
All frames of the broadcast containing this kind；
22) if certain broadcast constitutes logic channel group with other broadcast, frame of the broadcast of logic channel group will be constituted
Collection merges, and constitutes joint subgraph；Otherwise, the frame subset of the broadcast constitutes alone a subgraph；Each subgraph or joint subgraph
Constitute a coloring subgraph；
If 23) it is each coloring subgraph in two vertex correspondences frame is on different carrier frequency and their time interval is small
In frequency hopping guard time, then the two vertex are connected with a line, and the vertex for having side connected is known as mutual adjoint point；
24) color set is distributed to all vertex in each coloring subgraph, the number of color in the color set on each vertex
It is identical as the current logic channel number broadcasted where it；The color set on all vertex of the same broadcast is all the same, different wide
If the vertex broadcast does not constitute logic channel group each other, without identical color, if there is logic channel group, their colors
Concentrate the number of same color identical as the broadcast composition number of logic channel group where them.
Specifically, when the color set of each broadcast is arranged, according to the logic channel number of the broadcast of each type to each wide
The number of colours that distribution is equal with logic channel number is broadcast, constitutes and shares a part of color between the broadcast of logic channel group, share face
The number of the logic channel group constituted between the number of color and broadcast is identical.Not constituting does not have between the frame of the broadcast of logic channel group
Common color.
Step S3, current coloration subgraph is coloured, and judges whether coloring succeeds；If it is not, being transferred to step S4；If
It is to be transferred to step S5.
The logical channel assignment of the broadcast frame of entire NGB-W system is carried out as unit of colouring subgraph.Each coloring
Subgraph individually colours.When all coloring subgraphs colour successfully, multi-carrier frequency digital multimedia wireless broadcast system is patrolled
Collect channel distribution success；Otherwise, system logic channel distribution fails.
Specifically, step S3 the following steps are included:
31) color set (ACS) can be used for each apex configuration in coloring subgraph.
Wherein, the color set on each vertex is in the coloring subgraph logic channel number broadcasted where according to it and system are patrolled
It collects channel group parameter to be allocated, the available color set for initializing each vertex is identical as its color set；Include in color set
It is the color that initially can be used, can is color that current each vertex can be used in color set with include.
32) judge whether all vertex in current coloration subgraph colour success, if so, current coloration subgraph is coloured to
Function, if it is not, being then transferred to step 33).
33) selection coloring vertex.
The present invention is in a certain order successively to the vertex coloring in coloring subgraph, and coloring will be selected according to vertex every time
It selects strategy and finds coloring vertex, if all vertex colour completion, subgraph coloring terminates, and otherwise, continuation is selected according to vertex
The next coloring vertex of policy selection.
Specifically, vertex selection is carried out according to following rule:
A, first coloring vertex is the maximum point of degree in current coloration subgraph, if such vertex has multiple, is selected
It is one the smallest to select wherein ACS；Wherein, degree refers to the number on the vertex for having side to be connected with current vertex.
If b, selection is not first coloring vertex, the vertex selected for be connected with upper one coloring vertex not
The smallest vertex ACS in color vertex selects the maximum vertex of effective degree if such vertex has multiple；Have
Validity number refers to the number on the uncolored vertex for having side to be connected with current vertex.
If the uncoloured vertex that upper coloring vertex is not connected c, since the last one branch point, according to
The sequential search of branch point from back to front has the branch point of uncolored adjoint point, if finding the branch point for having uncolored adjoint point,
The smallest uncolored adjoint point of ACS is selected in the uncoloured connected adjoint point of the branch point, if having multiple, selects effective degree most
Big one；If all branch points without uncoloured connected adjoint point, select ACS minimum from all uncoloured vertex
Vertex select wherein maximum one of effective degree if there is the smallest vertex multiple ACS.
34) if the number of the uncolored adjoint point on the vertex currently selected is greater than 1, using the vertex of current coloration as one
A branch point.
35) color is selected.
Specifically, color selection strategy are as follows: selection appears in its uncoloured connected adjoint point from the ACS on coloring vertex
The least color of frequency of occurrence in ACS.
36) after to current vertex coloring, the ACS of the vertex and its adjoint point is updated.
Wherein, when the ACS on current coloration vertex updates, the currently used color in the vertex is deleted from its ACS；Currently
When colouring the ACS update of the adjoint point on vertex, the face that the adjoint point and its all colored adjoint point use is subtracted with the CS of the adjoint point
Color.
The vertex for enabling current coloration is Vp, VpCurrent color value is Cp, VnIt is VpAn adjoint point, CnIt is VnAnd it institute
The color set for thering is colored adjoint point to use, then:
ACS(Vp)=ACS (Vp)-Cp
ACS(Vn)=CS (Vn)-Cn
37) judge whether current vertex coloring succeeds；If so, it is transferred to step 32), until the success of all vertex colorings,
I.e. the subgraph colours successfully；If it is not, being then transferred to step 38).
Judge whether successful standard is as follows for current vertex coloring: if all uncolored adjoint points on current coloration vertex
ACS is not empty set, then it is assumed that the color is suitable, vertex coloring success；Otherwise, which fails.
If vertex coloring success checks whether that there are also uncoloured vertex, if so, then continuing to seek according to step 33)
Next coloring vertex is looked for, when all vertex colour completion, then the subgraph or joint subgraph colour successfully；If the vertex coloring
Failure is then adjusted coloring failure vertex, i.e. step 38).
38) vertex of adjustment coloring failure is transferred to step 33) if adjusting successfully；If adjustment failure, subgraph coloring
Failure.
When the vertex of adjustment coloring failure, specifically includes the following steps:
A) distribution adjustment priority
The ACS for recalculating all vertex in current coloration subgraph, to all colored vertex point of current coloration subgraph
With a priority, by the vertex V of current coloration failurefailurePriority be set as highest, i.e. VfailurePriority be 1,
The adjustment priority on remaining colored vertex sorts according to the sequence of preferential degree from big to small, and preferential degree is bigger, adjustment
Priority is higher.Wherein, the calculation formula of the preferential degree on colored vertex are as follows:
priority_count(Vi)=flagconnected(Vi)*α+size(ACS(Vi))-degree(Vi)
Wherein: priority_count (Vi) indicate colored vertex ViPreferential degree；flagconnected(Vi) indicate with
VfailureAdjacent mark, if ViWith VfailureIt is adjacent, 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 ViDegree.
B) adjust dice figure.
Colored vertex (i.e. adjust_priority (the V that priority is 2 from coloring subgraphcolored(j)) top=2
Point) start color adjustment, the method for adjustment is as follows:
B1) if the available color set on the colored vertex currently adjusted is not empty set, from the available of current adjustment vertex
A color is reselected in color set to colour for it, and modified color can be used in color set from it and delete, and update it
The available color set of uncolored adjoint point；If currently the available color set on adjustment vertex is empty set, the color value on the vertex is set
It is 0, recalculates the available color set of the vertex and its uncolored adjoint point, and determines that the color adjustment on the vertex currently adjusted is lost
It loses；
B2) whether color adjustment fails on judgement current adjustment vertex, if failure, is transferred to step b3)；If the top currently adjusted
The color of point adjusts successfully, and it is the vertex for adjusting highest priority that current color, which adjusts successful vertex not, then continues to adjust
The higher vertex of priority, is transferred to step b1), if currently adjusting successful vertex is the vertex for adjusting highest priority,
It is transferred to step 33), it is not empty set that wherein vertex color, which adjusts the ACS that successful standard is its all uncoloured adjoint point,；
B3) if the vertex color adjustment currently adjusted fails and its available color set is not empty set, it is transferred to step b1),
Continue to adjust the vertex currently adjusted；If the vertex color adjustment currently adjusted fails and its available color set is empty set, will
The color value on the vertex is set to 0, recalculates the available color set of the vertex and its uncolored adjoint point, finds next priority
Vertex, the vertex of next priority is adjusted according to above-mentioned steps b1)；If the vertex of next priority also adjusts failure,
Then continue to find to the lower vertex of adjustment priority, if the vertex for finding the last one adjustment priority still adjusts failure,
Then entire vertex coloring adjustment failure, current coloration subgraph coloring failure, by vertex color value weights all in current coloration subgraph
It newly is set to 0, is transferred to step S4, otherwise, continues to adjust the higher vertex of priority, until the vertex color tune of highest priority
It is made into function or the adjustment failure of entire vertex coloring.
Step S4, judge whether the parameter of current coloration subgraph can adjust, if so, the ginseng of adjustment current coloration subgraph
Number, then it is transferred to step S2；If it is not, then logical channel assignment fails.
Specifically, step S4 carries out the adjustment of the parameter of current coloration subgraph using one or more of mode:
41) frame length and/or frame number of the corresponding broadcast of adjustment current coloration subgraph on each carrier frequency, current coloration is lost
All vertex color value set 0 in the subgraph lost；Wherein, the method for adjustment includes merging frame or splitting frame, and merging frame is
Refer to and merge some several frames adjacent on the same carrier frequency and on the time, fractionation frame, which refers to, splits into several frames for a frame；
It either splits frame and still merges frame and be required to modified frame length and meet system requirements.
When colouring failure, it may be considered that change frame distribution pattern by changing frame length, then further according to new
Frame distribution pattern is coloured, and the coloring probability of success is increased.But change frame length and be also required for certain limitation, cannot it is artificial with
Meaning changes, and at this moment needs one frame length range of systemic presupposition, is then changed according to this frame length range.Wherein, change frame length
Frame number can change frame structure distribution pattern, and then modify positional relationship of the frame of its broadcast on each carrier frequency.
If 42) current coloration failure subgraph where some carrier frequency can integral translation, translate the coloring subgraph
Then the color on the vertex in all subgraphs is reset to 0 by all resources on one assistant carrier frequency, the frame number of all subgraphs is also set
For initial value.Wherein, the distance of translation will be far smaller than assignment period.
43) if the logic channel number of the broadcast where current coloration subgraph is not up to maximum value, increase logic channel number,
Increase the number of colours of subgraph namely to be adjusted；Then by the color value on all vertex in the subgraph of current coloration failure
Again it is set to 0.
Increasing number of colours to be most directly is also most efficient method, but increases number of colours and also just will increase logic channel number,
And the number of logic channel is that have certain limitation.Therefore can be according to the attribute and system requirements of each broadcast, backstage
The largest logical channel number of each broadcast is configured, so that it will not unlimitedly increase, this also more tallies with the actual situation.For example,
The largest logical channel number of various types of broadcast can be arranged to the carrier frequency number etc. of each occupancy.
If 44) make all frame pressures on the carrier frequency there are a carrier frequency in the carrier frequency where the subgraph of current coloration failure
The frame length of each frame still meets system requirements after contracting, then the frame length of the frame of all broadcast on the carrier frequency is compressed, after compression
The frame of each broadcast successively discharged according to the sequence before compression, the vertex color of all subgraphs is then reset to 0.
Even colour the frame length for making all frames on the carrier frequency in the carrier frequency where the subgraph of failure there are a carrier frequency
The frame length requirement that system is still met after compression can compress the resource frame length on the carrier frequency, make all frames on some carrier frequency
Frame length is the half (or 1/3,1/4 etc.) of its former frame length, is then discharged on the compressed carrier frequency by the sequence before compression
Resource keeps the time total resources of each broadcast of the carrier frequency constant, but the repetition period become 2 times before compression (or 3 times, 4 times etc.,
Multiple is the inverse of compression multiple).
Step S5, remaining coloring subgraph is coloured, if the coloring success of all coloring subgraphs, logic channel point
With success；If having a coloring subgraph coloring failure, logical channel assignment failure.
Frequency hopping is used with the attached drawing digital multimedia radio broadcasting that the present invention is further explained combined with specific embodiments below
Logical channel assignment method when transmission.
In this embodiment, initial distribution pattern of the broadcast frame of each broadcast on each carrier frequency is as shown in table 1.
Table 1, each broadcast initial distribution pattern of the broadcast frame on each carrier frequency
| 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 at this time has the broadcast there are three types of type, three carrier frequency altogether as can be seen from Table 1.It is assumed that
The assignment period of system is 1000ms, and the logic channel 1 of broadcast type 1 and the logic channel 2 of broadcast type 3 constitute one group of logic
Channel group, carrier frequency maximal translation number are 3 times, and the unit of translation is 6ms.The largest logical number of channel of each broadcast is equal to respective
The carrier frequency quantity of occupancy.The carrier frequency quantity that 3 kinds of broadcast occupy as can be seen from Table 1 is 3,2,1 respectively.
The frame length range of various broadcast is respectively as follows:
Broadcast 1 50~200 (ms)
Broadcast 2 50~200 (ms)
Broadcast 3 30~80 (ms)
Then the logical channel assignment situation that entire NGB-W system is sought according to these known conditions, according to above-mentioned processing
Step is that system distributes logic channel, it is desirable that the broadcast frame of the same logic channel of same kind broadcast meets frequency hopping on carrier frequency
Protection demand, meanwhile, the broadcast frame of same logic channel group also meets frequency hopping protection demand on each carrier frequency.
The results are shown in Table 2 for logical channel assignment, and allocation result is as shown in Figure 2.
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 and the logic channel 2 of broadcast 3 form one group of logic channel group, in coloring
It is assigned with an identical color, i.e. color 1 to them in the process, from figure 2 it can be seen that on different carrier frequency in the same time
There is no identical colors, and system is allocated successfully at this time, and the logic channel number of each broadcast is respectively 3,3,2.Color value is reflected
Penetrating into logic channel can be with are as follows:
Broadcast 1 color 1: 1 logic channel 1 of broadcast
Broadcast 1 color 2: 1 logic channel 2 of broadcast
Broadcast 1 color 3: 1 logic channel 3 of broadcast
Broadcast 2 colors 4: 2 logic channels 1 of broadcast
Broadcast 2 colors 5: 2 logic channels 2 of broadcast
Broadcast 2 colors 6: 2 logic channels 3 of broadcast
Broadcast 3 colors 1: 3 logic channels 2 of broadcast
Broadcast 3 colors 7: 3 logic Xindas 1 of broadcast
In conclusion logical channel assignment method passes through when digital multimedia radio broadcasting of the invention uses frequency-hopping transmissions
Colouring algorithm successfully solves the logical channel assignment problem of the NGB-W system with logic channel group, realizes the more matchmakers of number
Flexible Physical Frame Structure configuration in body wireless broadcast system；It can be supported on radio broadcasting frame structure a plurality of types of wireless wide
Broadcast system common transport, effectively realize wireless broadcast system backward compatibility, forward compatibility, with being conducive to wireless broadcast system into
One step evolution and smooth transition；It can be realized and different frame lengths, bandwidth, frequency point, transmission mode are carried out to the frame of different type system
Setting, with while taking into account reduces signaling overheads, effectively meet the data flow of different type wireless system to transmission capacity,
The different demands of real-time；It realizes all broadcast frames in logic channel group and all meets single tuning reception.So the present invention has
Effect overcomes various shortcoming in the prior art and has high industrial utilization value.
The above-described embodiments merely illustrate the principles and effects of the present invention, and is not intended to limit the present invention.It is any ripe
The personage for knowing this technology all without departing from the spirit and scope of the present invention, carries out modifications and changes to above-described embodiment.Cause
This, institute is complete without departing from the spirit and technical ideas disclosed in the present invention by those of ordinary skill in the art such as
At all equivalent modifications or change, should be covered by the claims of the present invention.
Claims (9)
1. a kind of digital multimedia radio broadcasting use frequency-hopping transmissions when logical channel assignment method, it is characterised in that: including with
Lower step:
Step S1, logical channel assignment problem when frequency-hopping transmissions will be used to be modeled as coloring in digital multimedia radio broadcasting to ask
Topic；
Step S2, building coloring subgraph；
Step S3, current coloration subgraph is coloured, and judges whether coloring succeeds；If it is not, being transferred to step S4；If so, turning
Enter step S5；
Step S4, judge whether the parameter of current coloration subgraph can adjust, if so, the parameter of adjustment current coloration subgraph,
It is transferred to step S2 again；If it is not, then logical channel assignment fails；
Step S5, remaining coloring subgraph is coloured, if it is all coloring subgraph coloring success, logical channel assignment at
Function；If having a coloring subgraph coloring failure, logical channel assignment failure；
In the step S2, when building colours subgraph, it then follows following rule:
21) frame by all broadcast on carrier frequency is divided into different subsets according to broadcast type, includes in each subset and only
All frames comprising this kind 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 the broadcast constitutes alone a subgraph；Each subgraph or joint subgraph are constituted
One coloring subgraph.
Logical channel assignment method when 2. digital multimedia radio broadcasting according to claim 1 uses frequency-hopping transmissions,
It is characterized in that: in the step S1, the frame of broadcast each in digital multimedia radio broadcasting being modeled as vertex, by each broadcast
Logic channel be modeled as color.
Logical channel assignment method when 3. digital multimedia radio broadcasting according to claim 1 uses frequency-hopping transmissions,
It is characterized in that: in the step S2, when building colours subgraph, further includes:
23) if the frame of two vertex correspondences is on different carrier frequency in each coloring subgraph and their time interval is less than jump
Frequency guard time is then connected the two vertex with a line, and the vertex for having side connected is known as mutual adjoint point；
24) distribute color set to all vertex in each coloring subgraph, number of color in the color set on each vertex and its
The current logic channel number of place broadcast is identical；The color set on all vertex of the same broadcast is all the same, difference broadcast
If vertex does not constitute logic channel group each other, without identical color, if there is logic channel group, in their color sets
The number of same color is identical as the broadcast composition number of logic channel group where them.
Logical channel assignment method when 4. digital multimedia radio broadcasting according to claim 1 uses frequency-hopping transmissions,
Be characterized in that: the step S3 the following steps are included:
31) color set can be used for each apex configuration in coloring subgraph；
32) judge whether all vertex in current coloration subgraph colour success, if so, current coloration subgraph colours successfully,
If it is not, being then transferred to step 33)；
33) selection coloring vertex；
34) if the number of the uncolored adjoint point on the vertex currently selected is greater than 1, using the vertex of current coloration as one point
Fulcrum；
35) color is selected；
36) after to current vertex coloring, the available color set of the vertex and its adjoint point is updated；Wherein, current coloration vertex can
When being updated with color set, the currently used color in the vertex can be used in color set from it and delete；The adjoint point on current coloration vertex
Available color set update when, subtract the color that the adjoint point and its all colored adjoint point use with the color set of the adjoint point；
37) judge whether current vertex coloring succeeds；If so, step 32) is transferred to, until the success of all vertex colorings, i.e., should
Subgraph colours successfully；If it is not, being then transferred to step 38)；
Wherein, judge whether successful standard is as follows for current vertex coloring: if all uncolored adjoint points on current coloration vertex
It can not be empty set with color set, then vertex coloring success；Otherwise, which fails；
38) color on colored vertex is adjusted, the vertex for enabling coloring to fail is successfully colored, if adjusting successfully, is transferred to step
33)；If adjustment failure, all vertex colors in the subgraph are reset to 0, are transferred to step S4 by subgraph coloring failure.
Logical channel assignment method when 5. digital multimedia radio broadcasting according to claim 4 uses frequency-hopping transmissions,
Be characterized in that: in the step 31), there are a color set and available color set in each vertex coloured in subgraph, each
The color set on vertex coloring subgraph according to it where the logic channel group parameter of the logic channel number broadcasted and system carry out
Distribution, the available color set for initializing each vertex are identical as its color set；Include in color set initially can be used
Color can be color that current each vertex can be used in color set with include.
Logical channel assignment method when 6. digital multimedia radio broadcasting according to claim 4 uses frequency-hopping transmissions,
It is characterized in that: in the step 33),
A, first coloring vertex is the maximum point of degree in current coloration subgraph, if such vertex has multiple, selects it
In can with color set it is one the smallest；Wherein, degree refers to the number on the vertex for having side to be connected with current vertex；
B, if not first coloring vertex of selection, then the vertex selected for the uncolored vertex that is connected of upper one coloring vertex
In the smallest vertex of color set can be used to select the maximum vertex of effective degree if such vertex has multiple；Its
In, effective degree refers to the number on the uncolored vertex for having side to be connected with current vertex；
If the uncoloured vertex that upper coloring vertex is not connected c, since the last one branch point, according to branch
Whether the sequential search of point from back to front has the branch point of uncolored adjoint point, has the branch point of uncolored adjoint point if it exists, then exists
In the uncoloured connected adjoint point of the branch point selection can use the smallest uncolored adjoint point of color set, if having it is multiple, selection have
Validity number maximum one；If all branch points without uncoloured connected adjoint point, are selected from all uncoloured vertex
Select the smallest vertex of available color set, if there is multiple the smallest vertex of available color set, select wherein effective degree it is maximum
One vertex.
Logical channel assignment method when 7. digital multimedia radio broadcasting according to claim 4 uses frequency-hopping transmissions,
It is characterized in that: in the step 35), color selection strategy are as follows: a color is selected from the available color set on coloring vertex, and
And the color occurs from the least color of frequency of occurrence in the available color set of its uncoloured adjacent vertex.
Logical channel assignment method when 8. digital multimedia radio broadcasting according to claim 4 uses frequency-hopping transmissions,
It is characterized in that: in the step 38), adjusting the color on colored vertex, when the vertex for enabling coloring to fail is successfully colored, packet
Include following steps:
A) the available color set for recalculating all vertex in current coloration subgraph, to all colored tops of current coloration subgraph
Point one priority of distribution sets five-star 1 for the priority on the vertex of current coloration failure, remaining colored vertex
Adjustment priority sort according to preferential degree sequence from big to small, preferential degree is bigger, and adjustment priority is higher；It is colored
The calculation formula of the preferential degree on vertex are as follows:
priority_count(Vi)=flagconnected(Vi)*α+size(ACS(Vi))-degree(Vi)
Wherein: priority_count (Vi) indicate colored vertex ViPreferential degree；flagconnected(Vi) indicate with it is current
The adjacent mark in the vertex of failure is coloured, if ViIt is adjacent with the vertex of current coloration failure, then flagconnected(Vi) it is 1, it is no
Then, flagconnected(Vi) value be 0；α is a constant；size(ACS(Vi)) it is ViACS in number of color；degree
(Vi) it is ViDegree；
B) color adjusts the colored vertex that priority is 2 since coloring subgraph, and the method for adjustment is as follows:
B1 the available color) if the available color set on the colored vertex currently adjusted is not empty set, from current adjustment vertex
Concentration reselects a color and colours for it, modified color can be used in color set from it and delete, and updates it not
The available color set of color adjoint point；If currently the available color set on adjustment vertex is empty set, the color value on the vertex is set to 0,
The available color set of the vertex and its uncolored adjoint point is recalculated, and determines the color adjustment failure on the vertex currently adjusted；
B2) whether color adjustment fails on judgement current adjustment vertex, if failure, is transferred to step b3)；If the vertex currently adjusted
Color adjusts successfully, and it is the vertex for adjusting highest priority that current color, which adjusts successful vertex not, then it is preferential to continue adjustment
The higher vertex of grade, is transferred to step b1), if currently adjusting successful vertex is the vertex for adjusting highest priority, it is transferred to
Step 33), it is not empty set that wherein vertex color, which adjusts the ACS that successful standard is its all uncoloured adjoint point,；
B3) if the vertex color adjustment currently adjusted fails and its available color set is not empty set, it is transferred to step b1), continue
Adjust the vertex currently adjusted；If the vertex color adjustment currently adjusted fails and its available color set is empty set, by the top
The color value of point is set to 0, recalculates the available color set of the vertex and its uncolored adjoint point, finds the top of next priority
Point adjusts the vertex of next priority according to above-mentioned steps b1)；If the vertex of next priority also adjusts failure, after
Continue and is found to the lower vertex of adjustment priority, it is whole if the vertex for finding the last one adjustment priority still adjusts failure
A vertex coloring adjustment failure, current coloration subgraph coloring failure, vertex color values all in current coloration subgraph are set again
It is 0, is transferred to step S4, otherwise, continues to adjust the higher vertex of priority, until the vertex color of highest priority adjusts successfully
Or entire vertex coloring adjustment failure.
Logical channel assignment method when 9. digital multimedia radio broadcasting according to claim 1 uses frequency-hopping transmissions,
Be characterized in that: the step S4 carries out the adjustment of the parameter of current coloration subgraph using one or more of mode:
41) frame length and/or frame number of the corresponding broadcast of adjustment current coloration subgraph on each carrier frequency, by current coloration failure
All vertex color value set 0 in subgraph；Wherein, the method for adjustment includes merging frame or splitting frame, merges frame and refers to conjunction
And some several frames adjacent on the same carrier frequency and on the time, fractionation frame, which refers to, splits into several frames for a frame；No matter
It is that fractionation frame or merging frame are required to modified frame length and meet system requirements；
If 42) current coloration failure subgraph where some carrier frequency can integral translation, translate one of the coloring subgraph
Then the color on the vertex in all subgraphs is reset to 0 by all resources on assistant carrier frequency, the frame number of all subgraphs is also set to just
Initial value；
43) if the logic channel number of the broadcast where current coloration subgraph is not up to maximum value, increase logic channel number, also
It is the number of colours of increase subgraph to be adjusted；Then again by the color value on all vertex in the subgraph of current coloration failure
It is set to 0；
If 44) in the carrier frequency where the subgraph of current coloration failure, after compressing all frames on the carrier frequency there are a carrier frequency
The frame length of each frame still meets system requirements, then compresses the frame length of the frame of all broadcast on the carrier frequency, will be compressed each
The frame of a broadcast is successively discharged according to the sequence before compression, and the vertex color of all subgraphs is then 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 CN106452699A (en) | 2017-02-22 |
| CN106452699B true 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 (5)
| 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 |
| 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 |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8027290B2 (en) * | 2007-06-15 | 2011-09-27 | Alcatel Lucent | Methods of jointly assigning resources in a multi-carrier, multi-hop wireless communication system |
| CN101626585B (en) * | 2008-07-10 | 2013-04-24 | 日电（中国）有限公司 | Network interference evaluation method, dynamic channel distribution method and equipment in wireless network |
-
2015
- 2015-08-06 CN CN201510477350.1A patent/CN106452699B/en active Active
Patent Citations (5)
| 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 |
| 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 |
|---|---|
| CN106452699A (en) | 2017-02-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103260244B (en) | D2D uplink resource multiplexing mode switching method in a kind of cellular system | |
| CN101053208B (en) | Wideband protocol | |
| CN102752844B (en) | Multistage distribution method of channel resources of wireless sensor network | |
| CN105119828B (en) | A kind of quickly wireless network route implementation method | |
| CN101141697A (en) | Video sharing method of mobile stream media | |
| CN103987047A (en) | Cluster AP channel allocation and power adjustment method for dense user area | |
| CN101132596A (en) | Assignment method for long occupied resource, base station, subscriber terminal and wireless system | |
| CN105704821A (en) | Channel mapping based MAC protocol of multi-channel distribution method | |
| CN102412951B (en) | Method and device for mapping distributed virtual resource blocks to physical resource blocks in LTE (Long Term Evolution) | |
| CN108737011A (en) | The Wavelength allocation method of reduction crosstalk based on ant group algorithm | |
| CN103428580A (en) | Digital television heterogeneous network structure | |
| CN106792995A (en) | The user access method of content low time delay transmission is ensured in a kind of following 5G networks | |
| CN106954269B (en) | Sub-clustering method for channel allocation of one of the D2D communication system based on QoS | |
| CN106452699B (en) | Multi-carrier frequency digital multimedia radio broadcasting frequency-hopping transmissions mapping logical channels method | |
| CN103595516B (en) | A kind of resource allocation methods and base station | |
| CN104219542B (en) | A kind of collocation method of the frame structure of digital multimedia wireless broadcast system | |
| CN101754100A (en) | Method and device for providing MBMS services in integrated E-MBMS system | |
| CN106162753A (en) | A kind of resource allocation methods and device | |
| CN106332153A (en) | Method and device for controlling bandwidth in WLAN (wireless local area network) | |
| CN102333348A (en) | Network switching side control method for terminal group access network based on cognitive radio | |
| CN111385744B (en) | Dynamic channel access method based on polling | |
| CN102104836B (en) | Multimedia broadcast multicast service (MBMS) receiving sate reporting method and equipment | |
| CN103985935B (en) | A kind of integrated multi-frequency and multi-system combiner | |
| CN201985865U (en) | Ultrahigh-frequency wide band network system | |
| CN101877858B (en) | Wireless distributed system-based networking method |
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 |