CN102761884A - Co-channel user configuration method - Google Patents

Abstract

The invention discloses a co-channel user configuration method, relating to the technical field of wireless mobile communication. The co-channel user configuration method comprises the following steps of: A, configuring M relay stations and numbering; B, determining a space distance between adjacent users of the relay stations according to position information of a global position system GPS, which is fed back by a mobile station; and constructing M initial logic distance matrixes: L1.2, L2.3,..., Li.i+1,..., LM-1, LM, and LM.1 according to the space distance; C, searching a group of co-channel users; D, updating M logic distance matrixes; and E, repeating the step C and the step D until K groups of the co-channel users can be obtained. With the adoption of the co-channel user configuration method provided by the invention, the co-channel users are configured to different relay coverage ranges, so that a minimum space distance between the co-channel users is maximum; a physical foundation is laid for restraining co-channel interference; and the frequency spectrum efficiency is beneficial to being further improved. Compared with the utilization of an exhaustion method, the computation complexity of configuring the co-channel users by using the co-channel user configuration method provided by the invention is obviously lower, so that the co-channel user configuration method is applicable to engineering.

Description

Be total to the road user configuration method

Technical field

The present invention relates to the wireless mobile telecommunication technology field, particularly common road user's configuring technical of junction waves division multiple access system.

Background technology

The junction waves division multiple access technology has big, the spectrum efficiency advantages of higher of cell coverage area, is the technology of a kind of potentialization of mobile communication air interface.To be total to the user with the relaying space multiplexing system and be configured in the same relay station coverage differently, the junction waves division multiple access system will be total to the user and be configured in the different relay station coverages.Therefore, the junction waves division multiple access system need solve and between a plurality of relay stations, dispose road customer problem altogether, and this is a kind of combinatorial optimization problem; Though the method for exhaustion can obtain optimal solution; But when number of users was big, its amount of calculation was very big, to such an extent as to can't adopt on the engineering.

Summary of the invention

The technical problem that (one) will solve

The technical problem that the present invention will solve is: to the junction waves division multiple access system; Provide a kind of common road user's configuring technical of low complex degree; Be configured in the different relay station coverages being total to the road user; And make minimum space between common road user apart from maximum, and its computation complexity significantly is lower than the computation complexity of the method for exhaustion.

(2) technical scheme

For solving the problems of the technologies described above, a kind of road user configuration method altogether is provided, may further comprise the steps:

A: dispose M relay station and numbering;

B: according to the global position system GPS positional information of travelling carriage feedback, confirm the space length between the neighboring relay stations user, according to M initial logic distance matrix: L of this space length structure _1,2, L _2,3...,

L _{M-1, M}, L _{M, 1}, wherein,

I=1,2 ..., M is i relay station and

Logical reach matrix between the relay station user, $\stackrel{\&OverBar;}{i+1}=\left\{\begin{array}{cc}i+1,& i+1\&le;M\\ i+1-M,& M<i+1\&le;2M\end{array}\right.;$

C: search for one group of road user altogether;

D: upgrade M logical reach matrix;

E: repeating step C, D are until obtaining K group road user altogether.

Wherein, said steps A specifically comprises:

Each relay station coverage is all used the positive M of a geometry limit shape equivalence, and M relay station distributes around the base station ringwise.Optional relay station is numbered it No. 1, in the direction of the clock or counterclockwise, successively with adjacent relay station be numbered No. 2, No. 3 ..., M number, with i (m); I=1,2 ...; M, m=1,2; ..., N representes m user of i relay station, N representes the number of users of each relay station.

Wherein, said step B specifically comprises:

According to the global position system GPS positional information of travelling carriage feedback, confirm that the space length between the neighboring relay stations user is set up distance matrix D _1,2, D _2,3...,

D _{M-1, M}, D _{M, 1}, wherein,

M neighboring relay stations is total to the distance matrix D between the road user _1,2, D _2,3...,

D _{M-1, M}, D _{M, 1}Middle all elements carries out ascending sort, replaces actual range with the positive integer sequence number value, just obtains neighboring relay stations logical reach matrix L between the road user altogether _1,2, L _2,3...,

L _{M-1, M}, L _{M, 1}, wherein,

Wherein, said step C specifically may further comprise the steps:

C1: confirm with reference to logical reach Z and position thereof;

C2: be the shortest logical reach with Z, attempt one group of road user combination altogether of configuration;

C3: if step C2 failure is upgraded with reference to logical reach Z, repeating step C2 is until searching one group of road user altogether.

Wherein, said step C1 specifically comprises:

According to current L _1,2, L _2,3..., L _{M-1, M}, L _{M, 1}Value is got the initial reference logical reach $Z={\left(l_{m,n}\right)}_{i,\stackrel{\&OverBar;}{i+1}}=\mathrm{Min}\{\mathrm{Max}\left({\mathrm{<figure-callout\; id="1"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">L</figure-callout>}}_{\mathrm{1,2}}\right),\mathrm{Max}\left({\mathrm{<figure-callout\; id="2"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">L</figure-callout>}}_{\mathrm{2,3}}\right),...,\mathrm{Max}\left(L_{M,1}\right)\},$ Wherein Min{} representes to get minimum operation, Expression is got

The computing of maximum element,

Show with reference to logical reach Z and be positioned at the logical reach matrix

The capable n of m row.

Wherein, said step C2 specifically may further comprise the steps:

C21: the n line search at the following adjacent matrix

that belongs to matrix

with reference to logical reach

matees element

wherein greater than the first order of Z; Claim that

and

is adjacency matrix; Wherein is the last adjacent matrix of

,

be the following adjacent matrix of ;

C22: if search is mated element less than the first order, C3 is returned in determination step C2 failure;

C23: get each k value successively if search one or more first order coupling elements

, its down the k of adjacent logical reach matrix capable in search mate element greater than the next stage of Z;

C24: if for all coupling elements, all search for less than the next stage coupling element greater than Z in the adjacent logical reach matrix down at it, C3 is returned in determination step C2 failure;

C25: if for certain coupling element, search a next stage coupling element in the adjacent logical reach matrix down, then continue the next stage coupling element of this coupling element of search greater than Z at it;

C26: repeating step C24, C25, until searching matrix;

C27: if in

, search the coupling element, whether the logical reach of judging

relevant position is greater than Z;

C28: if the logical reach of

relevant position is less than Z; C3 is returned in determination step C2 failure;

C29: if the logical reach of

relevant position is greater than Z; Then successfully search one group of road user altogether; Recording configuration result returns step D.

Wherein, said step C3 specifically comprises:

After the step C2 failure, with reference to the update method of logical reach Z be: from current L _1,2, L _2,3..., L _{M-1, M}, L _{M, 1}In all elements of matrix, choose one less than and near last element with reference to logical reach, the value of this element writes down its position as new reference logical reach, to m, n, i upgrade, and obtain new reference logical reach After logical reach Z renewal, repeating step C2 is until searching one group of road user altogether.

Wherein, said step D specifically comprises:

After obtaining one group of common road user, confirm that each user is at L _1,2, L _2,3..., L _{M-1, M}, L _{M, 1}In correspondence position, with L _1,2, L _2,3..., L _{M-1, M}, L _{M, 1}The all elements zero setting of correspondence position place row and column.

(3) beneficial effect

The invention provides a kind of common road user's configuring technical of low complex degree; Can be configured in the different relay station coverages being total to the user; And make minimum space between common road user apart from maximum, and its computation complexity significantly is lower than the computation complexity of the method for exhaustion.Technology provided by the invention is established physical basis for suppressing road interference altogether, helps further improving spectrum efficiency.

Description of drawings

Fig. 1 is altogether relay station allocation plan and the relay station method for numbering serial sketch map in the road user configuration method of the present invention, among the figure with the relay station quantity M=6 of a base station configuration, be numbered example in the direction of the clock.

Fig. 2 is a road user configuration method flow chart altogether of the present invention.

Embodiment

Road user configuration method altogether of the present invention may further comprise the steps:

A: dispose M relay station and numbering, as shown in Figure 1, each relay station coverage is all used the positive M of a geometry limit shape equivalence, and M relay station distributes around the base station ringwise.Optional relay station is numbered it No. 1, in the direction of the clock or counterclockwise, successively with adjacent relay station be numbered No. 2, No. 3 ..., M number, with i (m); I=1,2 ...; M, m=1,2; ..., N representes m user of i relay station, N representes the number of users of each relay station.

B:, confirm that the space length between the neighboring relay stations user is set up distance matrix D according to the global position system GPS positional information of travelling carriage feedback _1,2, D _2,3...,

D _{M-1, M}, D _{M, 1}, wherein, $\stackrel{\&OverBar;}{i+1}=\left\{\begin{array}{cc}i+1,& i+1\&le;M\\ i+1-M,& M<i+1\&le;2M\end{array}\right.,$

M neighboring relay stations is total to the distance matrix D between the road user _1,2, D _2,3...,

D _{M-1, M}, D _{M, 1}Middle all elements carries out ascending sort, replaces actual range with the positive integer sequence number value, just obtains neighboring relay stations logical reach matrix L between the road user altogether _1,2, L _2,3...,

L _{M-1, M}, L _{M, 1}, wherein,

C: search for one group of road user altogether.Specifically may further comprise the steps:

C1: confirm with reference to logical reach Z and position thereof, according to current L _1,2, L _2,3..., L _{M-1, M}, L _{M, 1}Value, get the initial reference logical reach:

$Z={\left(l_{m,n}\right)}_{i,\stackrel{\&OverBar;}{i+1}}=\mathrm{Min}\{\mathrm{Max}\left({\mathrm{<figure-callout\; id="1"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">L</figure-callout>}}_{\mathrm{1,2}}\right),\mathrm{Max}\left({\mathrm{<figure-callout\; id="2"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">L</figure-callout>}}_{\mathrm{2,3}}\right),...,\mathrm{Max}\left(L_{M,1}\right)\},$ Wherein Min{} representes to get minimum operation,

Expression is got

The computing of maximum element,

Show with reference to logical reach Z and be positioned at the logical reach matrix

The capable n of m row.

C2: be the shortest logical reach with Z, attempt one group of road user combination altogether of configuration.Specifically comprise:

C21: the n line search at the following adjacent matrix

that belongs to matrix

with reference to logical reach

matees element

wherein greater than the first order of Z; Claim that

and

is adjacency matrix; Wherein

is the last adjacent matrix of

,

be the following adjacent matrix of

;

C22: if search is mated element less than the first order, C3 is returned in determination step C2 failure;

C23: get each k value successively if search one or more first order coupling elements

, under it, search for next stage coupling element among the k of adjacent logical reach matrix greater than Z;

C24: if for all coupling elements, all search for less than the next stage coupling element greater than Z in the adjacent logical reach matrix down at it, C3 is returned in determination step C2 failure;

C25: if for certain coupling element, search a next stage coupling element in the adjacent logical reach matrix down, then continue the next stage coupling element of this coupling element of search greater than Z at it;

C26: repeating step C24, C25, until searching

matrix;

C27: if in

, search the coupling element, whether the logical reach of judging

relevant position is greater than Z;

C28: if the logical reach of

relevant position is less than Z; C3 is returned in determination step C2 failure;

C29: if the logical reach of

relevant position is greater than Z; Then successfully search one group of road user altogether; Recording configuration result returns step D.

After C3: the step C2 failure, with reference to the update method of logical reach Z be: from current L _1,2, L _2,3..., L _{M-1, M}, L _{M, 1}In all elements of matrix, choose one less than and near last element with reference to logical reach, the value of this element writes down its position as new reference logical reach, to m, n, i upgrade, and obtain new reference logical reach

After logical reach Z renewal, repeating step C2 is until searching one group of road user altogether.

D: upgrade M logical reach matrix, after obtaining one group of common road user, confirm that each user is at L _1,2, L _2,3..., L _{M-1, M}, L _{M, 1}In correspondence position, with L _1,2, L _2,3..., L _{M-1, M}, L _{M, 1}The all elements zero setting of correspondence position place row and column.

E: repeating step C, D are until obtaining K group road user altogether.

Below in conjunction with accompanying drawing 2, the embodiment of the present invention's technology is done to describe for example.Below be used to explain the present invention for example, but be not used for limiting scope of the present invention.In this example, the relay station quantity of establishing a base station configuration is M=4, and number of users is N=3 in each relay station coverage, and it is K=3 that the common road user of requirement configuration organizes number.Respective figure 2, implementation step is following:

Step S201 according to the global position system GPS positional information of travelling carriage feedback, confirms the space length between the neighboring relay stations user, and 4 logical reach matrixes of structure are following:

${\mathrm{<figure-callout\; id="1"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">L</figure-callout>\; </figure-callout>}}_{\mathrm{1,2}}=\left[\begin{array}{ccc}33& 22& 13\\ 18& 26& 3\\ 21& 19& 27\end{array}\right],$ ${\mathrm{<figure-callout\; id="2"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">L</figure-callout>}}_{\mathrm{2,3}}=\left[\begin{array}{ccc}24& 20& 30\\ 23& 29& 34\\ 9& 28& 32\end{array}\right],$ $L_{\mathrm{3,4}}=\left[\begin{array}{ccc}16& 5& 12\\ 8& 7& 31\\ 14& 11& 4\end{array}\right],$ ${\mathrm{<figure-callout\; id="1"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">L</figure-callout>}}_{\mathrm{4,1}}=\left[\begin{array}{ccc}17& 15& 25\\ 2& 35& 6\\ 10& 1& 36\end{array}\right]$

Step S202 confirms initial reference logical reach Z=Min{33,34,31, and 36}=31;

Step S203, the position of confirming Z is Z=(l _2,3) _3,4

Step S204 is at L _4,1The 3rd line search to first order coupling element (l _3,3) _4,1=36;

Step S205 is at L _1,2The 3rd line search mate element less than the second level, forward step S210 to, upgrade back Z=30;

Repeating step S203, the reposition of confirming Z is Z=(l _1,3) _2,3

Repeating step S204 is at L _3,4The 3rd line search mate element less than the first order, forward step S210 to, upgrade back Z=29;

Repeating step S203, the reposition of confirming Z is Z=(l _2,2) _2,3

Repeating step S204 is at L _3,4The 2nd line search to first order coupling element (l _2,3) _3,4=31;

Repeating step S205 is at L _4,1The 3rd line search mate element (l to the second level _3,3) _4,1=36;

Step S206; There is the coupling element in

, forwards step S207 to;

Step S207, check result is (l _3,2) _1,2=19<z forwards step S210 to, upgrades Z=28;

Repeating step S203, the reposition of confirming Z is Z=(l _3,2) _2,3

Repeating step S204 is at L _3,4The 2nd line search to first order coupling element (l _2,3) _3,4=31;

Repeating step S205 is at L _4,1The 3rd line search mate element (l to the second level _3,3) _4,1=36;

Repeating step S206; There is the coupling element in , forwards step S207 to;

Step S207, check result is (l _3,3) _1,2=27<z forwards step S210 to, upgrades Z=27;

Repeating step S203, the reposition of confirming Z is Z=(l _3,3) _1,2

Repeating step S204 is at L _2,3The 3rd line search to first order coupling element (l _3,2) _2,3=28;

Repeating step S205 is at L _3,4The 2nd line search mate element (l to the second level _2,3) _3,4=31;

Repeating step S206; There is the coupling element in

, forwards step S207 to;

Repeating step S207, check result is (l _3,3) _4,1=36>Z.It is { 1 (3), 2 (3), 3 (2), 4 (3) } that the coupling that obtains is total to the road user for first group, and its shortest logical reach is 27.

Step S208, judged result is not for also matching 3 groups of road users altogether;

Step S209, upgrade M logical reach matrix:

${\mathrm{<figure-callout\; id="1"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">L</figure-callout>\; </figure-callout>}}_{\mathrm{1,2}}=\left[\begin{array}{ccc}33& 22& 0\\ 18& 26& 0\\ 0& 0& 0\end{array}\right],$ ${\mathrm{<figure-callout\; id="2"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">L</figure-callout>}}_{\mathrm{2,3}}=\left[\begin{array}{ccc}24& 0& 30\\ 23& 0& 34\\ 0& 0& 0\end{array}\right],$ $L_{\mathrm{3,4}}=\left[\begin{array}{ccc}16& 5& 0\\ 0& 0& 0\\ 14& 11& 0\end{array}\right],$ ${\mathrm{<figure-callout\; id="1"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">L</figure-callout>}}_{\mathrm{4,1}}=\left[\begin{array}{ccc}17& 15& 0\\ 2& 35& 0\\ 0& 0& 0\end{array}\right]$

Repeating step S202 confirms that the initial reference logical reach is Z=Min{33,34,16, and 35}=16;

Repeating step S203, the position of confirming Z is Z=(l _1,1) _3,4

Repeating step S204 is at L _4,1The 1st line search to first order coupling element (l _1,1) _4,1=17;

Repeating step S205 is at L _1,2The 1st line search mate element (l to the second level _1,1) _1,2=33;

Repeating step S206; There is the coupling element in

, forwards step S207 to;

Repeating step S207, check result is (l _1,1) _2,3=24>Z.It is { 3 (1), 1 (1), 2 (1), 4 (1) } that the coupling that obtains is total to the road user for second group, its shortest logical reach 16.

Repeating step S208, judged result is not for also matching 3 groups of road users altogether;

Repeating step S209, upgrade M logical reach matrix:

${\mathrm{<figure-callout\; id="1"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">L</figure-callout>\; </figure-callout>}}_{\mathrm{1,2}}=\left[\begin{array}{ccc}0& 0& 0\\ 0& 26& 0\\ 0& 0& 0\end{array}\right],$ ${\mathrm{<figure-callout\; id="2"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">L</figure-callout>}}_{\mathrm{2,3}}=\left[\begin{array}{ccc}0& 0& 0\\ 0& 0& 34\\ 0& 0& 0\end{array}\right],$ $L_{\mathrm{3,4}}=\left[\begin{array}{ccc}0& 0& 0\\ 0& 0& 0\\ 0& 11& 0\end{array}\right],$ ${\mathrm{<figure-callout\; id="1"\; label="L"\; filenames="HDA00001824941700021.png"\; state="\{\{state\}\}">L</figure-callout>}}_{\mathrm{4,1}}=\left[\begin{array}{ccc}0& 0& 0\\ 0& 35& 0\\ 0& 0& 0\end{array}\right]$

Repeating step S202 confirms that the initial reference logical reach is Z=min{26,34,11, and 35}=11;

Repeating step S203, the position of confirming Z is Z=(l _3,2) _3,4

Repeating step S204 is at L _4,1The 2nd line search to first order coupling element (l _2,2) _4,1=35;

Repeating step S205 is at L _1,2The 2nd line search mate element (l to the second level _2,2) _1,2=26;

Repeating step S206; There is the coupling element in

, forwards step S207 to;

Repeating step S207, check result is (l _2,3) _2,3=34>Z.It is { 1 (2), 2 (2), 3 (3), 4 (2) } that the coupling that obtains is total to the road user for the 3rd group, its shortest logical reach 11;

Repeating step S208, judged result finishes for disposing 3 groups of road users altogether.

Below from the angle of computing time, the computation complexity of the present invention's technology and the method for exhaustion relatively.For a base station configuration M relay station, the number of users in each relay station coverage is N, requires configuration K group road user's junction waves subsystem altogether, adopts all possible allocation plan quantity of the method for exhaustion:

Suppose that calculating and more every kind of possibility scheme needed for 1 time nanosecond, table 1 provides the computing time that the method for exhaustion needs.Table 2 provides the average computation time of the present invention's technology, and simulated environment is following, and processor is Intel (R) Core (TM) i3-2120CPU3.30GHz, and simulation software is MATLAB.

The computing time that table 1 method of exhaustion needs

M

N＝K＝5

N＝K＝10

N＝K＝20

N＝K＝30

N＝K＝40

N＝K＝50

3

0.014 millisecond

13168 seconds

1.87×10 20Year

2.23×10 48Year

2.11×10 79Year

2.9×10 112Year

4

1.728 millisecond

1515

4.56×10 38Year

5.91×10 80Year

1.72×10 127Year

8.92×10 176Year

5

207.4 millisecond

5.49×10 9Year

1.11×10 57Year

1.56×10 113Year

1.4×10 175Year

2.71×10 241Year

6

24.88 second

1.99×10 16Year

2.7×10 75Year

4.16×10 145Year

1.14×10 223Year

8.25×10 305Year

The average computation time of table 2 the present invention technology

More than only be used to explain the present invention for example; And be not limitation of the present invention; The those of ordinary skill in relevant technologies field under the situation that does not break away from the spirit and scope of the present invention, can also be made various variations and modification; Therefore all technical schemes that are equal to also belong to category of the present invention, and scope of patent protection of the present invention should be defined by the claims.

Claims (8)

1. be total to the road user configuration method, it is characterized in that, may further comprise the steps:

A: dispose M relay station and numbering;

B: according to the global position system GPS positional information of travelling carriage feedback, confirm the space length between the neighboring relay stations user, according to M initial logic distance matrix: L of this space length structure _1,2, L _2,3...,

L _{M-1, M}, L _{M, 1}, wherein, I=1,2 ..., M is i relay station and

Logical reach matrix between the relay station user, $\stackrel{\&OverBar;}{i+1}=\left\{\begin{array}{cc}i+1,& i+1\&le;M\\ i+1-M,& M<i+1\&le;2M\end{array}\right.;$

C: search for one group of road user altogether;

D: upgrade M logical reach matrix;

E: repeating step C, D are until obtaining K group road user altogether.

2. road user configuration method altogether as claimed in claim 1 is characterized in that said steps A specifically comprises:

Each relay station coverage is all used the positive M of a geometry limit shape equivalence, and M relay station distributes around the base station ringwise, and optional relay station is numbered it No. 1, in the direction of the clock or counter clockwise direction; Successively with adjacent relay station be numbered No. 2, No. 3 ..., M number, with i (m), i=1,2;, M, m=1,2;, N representes m user of i relay station, N representes the number of users of each relay station.

3. road user configuration method altogether as claimed in claim 1 is characterized in that said step B specifically comprises:

According to the global position system GPS positional information of travelling carriage feedback, confirm that the space length between the neighboring relay stations user is set up distance matrix D _1,2, D _2,3..., D _{M-1, M}, D _{M, 1}, wherein,

M neighboring relay stations is total to the distance matrix D between the road user _1,2, D _2,3...,

D _{M-1, M}, D _{M, 1}Middle all elements carries out ascending sort, replaces actual range with the positive integer sequence number value, just obtains neighboring relay stations logical reach matrix L between the road user altogether _1,2, L _2,3..., L _{M-1, M}, L _{M, 1}, wherein,

4. road user configuration method altogether as claimed in claim 1 is characterized in that said step C specifically may further comprise the steps:

C1: confirm with reference to logical reach Z and position thereof;

C2: be the shortest logical reach with Z, attempt one group of road user combination altogether of configuration;

C3: if step C2 failure is upgraded with reference to logical reach Z, repeating step C2 is until searching one group of road user altogether.

5. road user configuration method altogether as claimed in claim 4 is characterized in that said step C1 specifically comprises:

According to current L _1,2, L _2,3..., L _{M-1, M}, L _{M, 1}Value is got the initial reference logical reach $Z={\left(l_{m,n}\right)}_{i,\stackrel{\&OverBar;}{i+1}}=\mathrm{Min}\{\mathrm{Max}\left(L_{\mathrm{1,2}}\right),\mathrm{Max}\left(L_{\mathrm{2,3}}\right),...,\mathrm{Max}\left(L_{M,1}\right)\},$ Wherein Min{} representes to get minimum operation,

Expression is got

The computing of maximum element,

Show with reference to logical reach Z and be positioned at the logical reach matrix Capable, the n of m row.

6. road user configuration method altogether as claimed in claim 4 is characterized in that said step C2 specifically may further comprise the steps:

C21: the n line search at the following adjacent matrix that belongs to matrix with reference to logical reach

matees element

wherein greater than the first order of Z; Claim that and

is adjacency matrix; Wherein

is the last adjacent matrix of

, be the following adjacent matrix of ;

C22: if search is mated element less than the first order, C3 is returned in determination step C2 failure;

C23: get each k value successively if search one or more first order coupling elements

, under it, search for next stage coupling element among the k of adjacent logical reach matrix greater than Z;

C24: if for all coupling elements, all search for less than the next stage coupling element greater than Z in the adjacent logical reach matrix down at it, C3 is returned in determination step C2 failure;

C25: if for certain coupling element, search a next stage coupling element in the adjacent logical reach matrix down, then continue the next stage coupling element of this coupling element of search greater than Z at it;

C26: repeating step C24, C25, until searching

matrix;

C27: if in , search the coupling element, whether the logical reach of judging

relevant position is greater than Z;

C28: if the logical reach of

relevant position is less than Z; C3 is returned in determination step C2 failure;

C29: if the logical reach of

relevant position is greater than Z; Then successfully search one group of road user altogether; Recording configuration result returns step D.

7. road user configuration method altogether as claimed in claim 4 is characterized in that said step C3 specifically comprises:

After the step C2 failure, with reference to the update method of logical reach Z be: from current L _1,2, L _2,3..., L _{M-1, M}, L _{M, 1}In all elements of matrix, choose one less than and near last element with reference to logical reach, the value of this element writes down its position as new reference logical reach, to m, n, i upgrade, and obtain new reference logical reach

After logical reach Z renewal, repeating step C2 is until searching one group of road user altogether.

8. road user configuration method altogether as claimed in claim 1 is characterized in that said step D specifically comprises:

After obtaining one group of common road user, confirm that each user is at L _1,2, L _2,3..., L _{M-1, M}, L _{M, 1}In correspondence position, with L _1,2, L _2,3..., L _{M-1, M}, L _{M, 1}The all elements zero setting of correspondence position place row and column.

Images