CN105634613A - Power distribution method and device - Google Patents

Abstract

The invention provides a power distribution method and device. With a target of maximizing the minimum receiving code distance between a first signal vector and a second signal vector, a target function is constructed; intersection points of local minterms of the minimum receiving code distance are searched and used as candidate optimal solutions in a pre-constructed N-1-dimensional space; an optimal solution is determined from the candidate optimal solutions; the optimal solution is a power coefficient of various branches; and power is distributed to various branches according to the power coefficient, wherein the coordinate axis of the N-1-dimensional space is composed of the power coefficient of various branches, which is shown in the specification, and a channel coefficient through variable substitution. Visibly, by means of the power distribution method disclosed by the invention, the N-1-dimensional space is used as a carrier; the optimal solution of the target function is solved; therefore, the calculation dimensionality can be reduced; and thus, the power distribution complexity can be reduced.

Description

A kind of power distribution method and device

Technical field

The application relates to the communications field, particularly relates to a kind of power distribution method and device.

Background technology

Along with the upgrading of Lighting Industry, LED will be increasingly becoming the leading of illumination market by its low-carbon (LC), environmental protection, green advantage. Visible light communication is a kind of emerging light wireless communication technology grown up on White light LED technology. In future, it is seen that optic communication and the fusion of illumination, the interactive development of communications industry and Lighting Industry will be promoted. (size in room is unrestricted, and mark is not unique applied environment here for Fig. 1. ) for indoor visible light communication multiple input single output (Multi-inputsingleoutput, MISO) system model, including multiple signal input parts, i.e. N number of LED Tx1��TxN, and an outfan and photoelectric detector.

In order to reduce the hydraulic performance decline owing to channel relevancy causes, it is possible to increase the identification of channel. Specifically, it is possible to distribute different performance numbers for different channels, to increase the identification of channel, it is achieved transmit more data in limited bandwidth.

At present, the complexity of conventional power allocation scheme is higher, therefore how to lower the complexity of power distribution, becomes current problem demanding prompt solution.

Summary of the invention

This application provides a kind of power distribution method and device, it is therefore intended that the problem solving how to lower the complexity of power distribution.

To achieve these goals, this application provides techniques below scheme:

A kind of power distribution method, including:

Obtain reception code distance between the first signal phasor and secondary signal vector square, described first signal phasor is the signal phasor that transmitting terminal will send, described first signal phasor is made up of each tributary signal, each tributary signal described has different power partition coefficients, and described first signal phasor receiving end is judged to described secondary signal vector;

Build object function $\left\{\begin{array}{c}{d}_{opt}^2=\underset{a}{\max }\underset{e}{\min }{d}_{free}^2\\ s.t\underset{i=1}{\overset{N}{\Σ}}{a}_i=1,a_i>0\end{array}\right.$ Wherein,For described reception code distance square,For minimum reception code distance square,For the summation of the power partition coefficient of all tributary signals, power coefficient $a={\[a_1,a_2,...,a_N\]}_{N\×1}^T,e={\[e_1,e_2,...,e_N\]}_{N\×1}^T,$ E �� 0, e_i��(0,��1,����(2^q-1)), and i �� (1 ..., N), 2^qFor order of modulation, N is circuitry number;

In the N-1 dimension space built in advance, searchThe intersection point of Local Minimum item, described intersection point is candidate's optimal solution of described object function, the coordinate axes of described N-1 dimension space byAnd channel coefficients is constituted through variable replacement;

Determining optimal solution from described candidate's optimal solution, described optimal solution is for determining the power coefficient of each branch road described;

According to described power coefficient, distribute power for each branch road described.

Alternatively, square the including of described reception code distance:

The reception code distance determined with squared euclidean distance square $d_{free}^2=\left|\right|\mathrm{\Γ}(a,s,N)h-\mathrm{\Γ}(a,\hat{s},N)h|{|}_2^2=|\left|\mathrm{\Γ}(a,e,N)h\right|{|}_2^2=\underset{m=1}{\overset{N}{\Σ}}{\left(\underset{i=1}{\overset{m}{\Σ}}{e}_i{a}_i{h}_i\right)}^2+\underset{m=2}{\overset{N}{\Σ}}{\left(\underset{i=m}{\overset{N}{\Σ}}{e}_i{a}_i{h}_i\right)}^2,$ Wherein, h is described channel coefficients.

Alternatively, described in the N-1 dimension space built in advance, searchThe intersection point of Local Minimum item include:

Described in the N-1 dimension space built in advance, searchThe intersection point of the Local Minimum item under ON-OFF keying modulation mode.

Alternatively, described from described candidate's optimal solution, determine that optimal solution includes:

Utilizing apagoge to determine the non-optimal solution in described candidate's optimal solution, remaining candidate's optimal solution is described optimal solution:

According to all intersection points in described N-1 dimension space, simultaneous intersects with each intersection point respectively straight line or the expression formula of curve and constraints, it is thus achieved that possible optimum a is with accordingly

AllOne maximum of middle hypothesis, by described maximum and otherCompare, it is thus achieved that the scope of h, if this intersection point is correspondingBeing unlikely to be maximum value, then give up, being all unlikely to be maximum until giving upRemaining for described optimal solution.

Alternatively, when N=3, the transverse axis of described two-dimensional spaceThe longitudinal axis of described two-dimensional space $C=\frac{a_3{h}_3}{a_2{h}_2}.$

A kind of power distribution unit, including:

Acquisition module, for obtain reception code distance between the first signal phasor and secondary signal vector square, described first signal phasor is the signal phasor that transmitting terminal will send, described first signal phasor is made up of each tributary signal, each tributary signal described has different power partition coefficients, and described first signal phasor receiving end is judged to described secondary signal vector;

Computing module, is used for building object function $\left\{\begin{array}{c}{d}_{opt}^2=\underset{a}{\max }\underset{e}{\min }{d}_{free}^2\\ s.t\underset{i=1}{\overset{N}{\Σ}}{a}_i=1,a_i>0\end{array}\right.$ Wherein,For described reception code distance square,For minimum reception code distance square,For the summation of the power partition coefficient of all tributary signals, power coefficient $a={\[a_1,a_2,...,a_N\]}_{N\×1}^T,e={\[e_1,e_2,...,e_N\]}_{N\×1}^T,$ E �� 0, e_i��(0,��1,����(2^q-1)), and i �� (1 ..., N), 2^qFor order of modulation, N is circuitry number; And in the N-1 dimension space built in advance, searchThe intersection point of Local Minimum item, described intersection point is candidate's optimal solution of described object function, the coordinate axes of described N-1 dimension space byAnd channel coefficients is constituted through variable replacement;

Determining module, for determining optimal solution from described candidate's optimal solution, described optimal solution is for determining the power coefficient of each branch road described;

Distribution module, for according to described power coefficient, distributing power for each branch road described.

Alternatively,

Square including of described reception code distance: the reception code distance determined with squared euclidean distance square $d_{free}^2=\left|\right|\mathrm{\Γ}(a,s,N)h-\mathrm{\Γ}(a,\hat{s},N)h|{|}_2^2=|\left|\mathrm{\Γ}(a,e,N)h\right|{|}_2^2=\underset{m=1}{\overset{N}{\Σ}}{\left(\underset{i=1}{\overset{m}{\Σ}}{e}_i{a}_i{h}_i\right)}^2+\underset{m=2}{\overset{N}{\Σ}}{\left(\underset{i=m}{\overset{N}{\Σ}}{e}_i{a}_i{h}_i\right)}^2,$ Wherein, h is described channel coefficients.

Alternatively, described computing module is for, in the N-1 dimension space built in advance, searchingThe intersection point of Local Minimum item include:

Described computing module specifically for, in the N-1 dimension space built in advance, searchThe intersection point of the Local Minimum item under ON-OFF keying modulation mode.

Alternatively, described determine that module for determining that optimal solution includes from described candidate's optimal solution:

Described determine module specifically for, apagoge is utilized to determine the non-optimal solution in described candidate's optimal solution, remaining candidate's optimal solution is described optimal solution: according to all intersection points in described N-1 dimension space, straight line that respectively simultaneous intersects with each intersection point or the expression formula of curve and constraints, it is thus achieved that possible optimum a is with accordinglyAllOne maximum of middle hypothesis, by described maximum and otherCompare, it is thus achieved that the scope of h, if this intersection point is correspondingBeing unlikely to be maximum value, then give up, being all unlikely to be maximum until giving upRemaining for described optimal solution.

Alternatively, described computing module specifically for, when N=3, the transverse axis of described two-dimensional spaceThe longitudinal axis of described two-dimensional space

Power distribution method described herein and device, to maximize structure object function for the purpose of the minimum reception code distance between the first signal phasor and secondary signal vector, and in the N-1 dimension space built in advance, search the intersection point of Local Minimum item of minimum reception code distance as candidate's optimal solution of object function, optimal solution is determined from described candidate's optimal solution, described optimal solution is the power coefficient of each branch road described, according to described power coefficient, power is distributed for each branch road described, wherein, the coordinate axes of N-1 dimension space is by the power coefficient of each branch roadAnd channel coefficients is constituted through variable replacement. Visible, described herein power distribution method, using N-1 dimension space as carrier, solves the optimal solution of object function, calculates dimension therefore, it is possible to reduce, thus lowering the complexity of power distribution.

Accompanying drawing explanation

In order to be illustrated more clearly that the embodiment of the present application or technical scheme of the prior art, the accompanying drawing used required in embodiment or description of the prior art will be briefly described below, apparently, accompanying drawing in the following describes is only some embodiments of the application, for those of ordinary skill in the art, under the premise not paying creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.

Fig. 1 is the schematic diagram of optic communication MISO system model;

Fig. 2 is the schematic diagram of optical communication system;

Fig. 3 is the flow chart of a kind of power distribution method disclosed in the embodiment of the present application;

Fig. 4 is the schematic diagram of each subregion shared by Local Minimum item in two-dimensional space disclosed in the embodiment of the present application;

Fig. 5 is the structural representation of a kind of power distribution unit disclosed in the embodiment of the present application.

Detailed description of the invention

The embodiment of the present application discloses a kind of power distribution method, is applied in scene as shown in Figure 2, in Fig. 2, flow of information at a high speed is after serioparallel exchange, each tributary signal is then through after pulse amplitude modulation PAM, power distribution, and each branch data is before sending into LED, it is necessary to carry out T_sThe relative phase shift of/N, namely each branch road has (i-1) T relative to the first branch road transmission_sThe phase shift of/N, i=2,3 ..., N, each branch data after phase shift is respectively fed into the LED lamp of correspondence, and the signal that the LED lamp of each branch road sends is demodulated by receiving terminal after being transmitted by optical channel. Wherein, the symbol period of each branch data is T_s, a_i> 0 is the power partition coefficient of i-th branch road, and

Method described in the embodiment of the present application and device, it is therefore intended that be calculated as the power of each branch road distribution. It is emphasized that in the embodiment of the present application, transmitting terminal and receiving terminal have desirable channel condition information.

Below in conjunction with the accompanying drawing in the embodiment of the present application, the technical scheme in the embodiment of the present application is clearly and completely described, it is clear that described embodiment is only some embodiments of the present application, rather than whole embodiments. Based on the embodiment in the application, the every other embodiment that those of ordinary skill in the art obtain under not making creative work premise, broadly fall into the scope of the application protection.

The disclosed a kind of power distribution method of the embodiment of the present application, as it is shown on figure 3, comprise the following steps:

S301: obtain reception code distance between the first signal phasor and secondary signal vector square.

Specifically, receive code distance square for the reception code distance determined with squared euclidean distance square: $d_{free}^2=\left|\right|\mathrm{\Γ}(a,s,N)h-\mathrm{\Γ}(a,\hat{s},N)h|{|}_2^2=|\left|\mathrm{\Γ}(a,e,N)h\right|{|}_2^2=\underset{m=1}{\overset{N}{\Σ}}{\left(\underset{i=1}{\overset{m}{\Σ}}{e}_i{a}_i{h}_i\right)}^2+\underset{m=2}{\overset{N}{\Σ}}{\left(\underset{i=m}{\overset{N}{\Σ}}{e}_i{a}_i{h}_i\right)}^2$ Wherein, h is channel coefficients, power coefficientFor the summation of the power partition coefficient of all tributary signals,E �� 0, e_i��(0,��1,����(2^q-1)),i_��(1 ..., N),₂ ^qFor order of modulation, N is circuitry number.

S302: build object function $\left\{\begin{array}{c}{d}_{opt}^2=\underset{a}{\max }\underset{e}{\min }{d}_{free}^2\\ s.t\underset{i=1}{\overset{N}{\Σ}}{a}_i=1,a_i>0\end{array}\right..$

The theoretical foundation building above-mentioned object function is: utilize the computing formula of the paired bit error rateTransmission vector s will be judged to receiving terminal under given channelError probability can be expressed as:

$P(s\→\hat{s})=\frac{1}{\mathrm{\π}}{\∫}_0^{\frac{\mathrm{\π}}{2}}\exp (-\frac{{\mathrm{\ρd}}_{free}^2}{8{\sin }^2\mathrm{\θ}})d\mathrm{\θ}$

Wherein,For estimated signal vector and secondary signal vector, also it is in the signal phasor likely transmitted,For OSNR.

Applicant finds in the process of research, the upper bound of the paired bit error rate of system under given channel be by all transmission symbolic vectors to s andIn minimum reception code distance determined, in order to obtain optimum error performance, it is necessary to maximize minimum reception code distance. Therefore the least euclidean distance criteria Optimality Criteria as optimal power allocation conceptual design, namely maximum likelihood algorithm will be maximized.

Therefore, the problem maximizing least square Euclidean distance under luminous power retrains becomes the optimization problem of a nonlinear restriction, and main target seeks to find optimization power sharing ratio aClosed solutions form, problem is converted into the object function form of standard:

$\left\{\begin{array}{c}{d}_{opt}^2=\underset{a}{\max }\underset{e}{\min }{d}_{free}^2\\ s.t\underset{i=1}{\overset{N}{\Σ}}{a}_i=1,a_i>0\end{array}\right..$

It can be seen that above-mentioned object function is the non-convex optimization problem of a continuous variable a and discrete variable e mixing, being a discontinuous piecewise function containing multiple variablees, due to the difference of the combination of e, majorized function has many forms. Additionally when N and order of modulation 2^qTime bigger, the optimization item of object function is that exponentially increases, namely (2^q+1-1)^N, difficulty is added for solving of problem, in the present embodiment, constraint space is divided, to reduce solving complexity, comprise the following steps that.

S303: under given channel status, the N-1 dimension space of structure, search in N-1 dimension spaceThe intersection point of Local Minimum item.

S304: utilizing apagoge to determine the non-optimal solution in described candidate's optimal solution, remaining candidate's optimal solution is optimal solution.

Specifically, apagoge is supplemented as follows:

(1), when being any for N, its composition is (N-1) dimension space, according to all intersection points in space, and simultaneous intersects with each intersection point respectively straight line or the expression formula of curve and constraints, it is thus achieved that possible optimum a is with accordingly

(2) through sequence, and relatively all ofSize, it is assumed that one of them is maximum, compared with all the other, it is thus achieved that a scope being related to h, if this intersection point is correspondingIt is unlikely to be maximum value, then gives up;

(3) for the scope H about h of all acquisitions_k(N-1) the division scope G of dimension space_l, it is assumed that there are an a makesBy deriving and calculate and can obtain Or $h\∉H_k,$ Contradiction.

(4) therefore at h �� H_kUnder haveAnd in such a situa-tion, for different h �� H_k, we can findNamelyThe e that equal sign is set up can be got. ThenIn like manner can also obtain such result for other situations.

Therefore there is different h region and divide, by the division of all of h spatial integrity constituted, and corresponding different a andThe optimum closed solutions of acquisition problem.

Such as, by $A=\frac{3}{5},C=\frac{3}{5}$ This point, it is possible to simultaneous $A=\frac{a_1{h}_1}{a_2{h}_2},C=\frac{a_3{h}_3}{a_2{h}_2}$ With $s.t\underset{i=1}{\overset{N}{\Σ}}{a}_i=1,a_i>0,$ Draw $a=\frac{1}{1+\frac{3h_2}{5h_1}+\frac{3h_2}{5h_3}}\[\frac{3h_2}{5h_1},1,\frac{3h_2}{5h_3}\].$ And this intersection point is the intersection point of 3 lines, i.e. A=C, 3C²+ 2AC-4A-4C+3=0 and 3A²The intersection point that+2AC-4A-4C+3=0 straight line or curve are constituted, is namely equivalent to 3a₁ ²h₁ ², 3a₃ ²h₃ ², 3a₁ ²h₁ ²+3a₂ ²h₂ ²+3a₃ ²h₃ ²-4a₁h₁a₂h₂+2a₁h₁a₃h₃-4a₂h₂a₃h₃The intersection point of three, then basisBring above three into and can calculate at intersection point corresponding $d_{opt}^2=\frac{27h_2^2}{25{(1+\frac{3h_2}{5h_1}+\frac{3h_2}{5h_3})}^2}.$

In like manner can according to other 4 intersection points with constitute the straight line of intersection point or curve, it is thus achieved that corresponding optimum a andAll of value can be expressed as

$\left(1\right)---a=\frac{1}{1+\frac{4h_2}{3h_1}+\frac{4h_2}{3h_3}}\[\frac{4h_2}{3h_1},1,\frac{4h_2}{3h_3}\],d_{opt,1}^2=\frac{3h_2^2}{{(1+\frac{4h_2}{3h_1}+\frac{4h_2}{3h_3})}^2}$

$\left(2\right)---a=\frac{1}{1+\frac{5h_2}{6h_1}+\frac{3h_2}{4h_3}}\[\frac{5h_2}{6h_1},1,\frac{3h_2}{4h_3}\],d_{opt,2}^2=\frac{27h_2^2}{16{(1+\frac{5h_2}{6h_1}+\frac{3h_2}{4h_3})}^2}$

$\left(3\right)---a=\frac{1}{1+\frac{4h_2}{5h_1}+\frac{4h_2}{5h_3}}\[\frac{4h_2}{5h_1},1,\frac{4h_2}{5h_3}\],d_{opt,3}^2=\frac{43h_2^2}{25{(1+\frac{4h_2}{5h_1}+\frac{4h_2}{5h_3})}^2}$

$\left(4\right)---a=\frac{1}{1+\frac{3h_2}{5h_1}+\frac{3h_2}{5h_3}}\[\frac{3h_2}{5h_1},1,\frac{3h_2}{5h_3}\],d_{opt,4}^2=\frac{27h_2^2}{25{(1+\frac{3h_2}{5h_1}+\frac{3h_2}{5h_3})}^2}$

$\left(5\right)---a=\frac{1}{1+\frac{3h_2}{4h_1}+\frac{5h_2}{6h_3}}\[\frac{3h_2}{4h_1},1,\frac{5h_2}{6h_3}\],d_{opt,5}^2=\frac{27h_2^2}{16{(1+\frac{3h_2}{4h_1}+\frac{5h_2}{6h_3})}^2}$

Assume that (1) is for the optimum solution maximization minimum Eustachian distance corresponding with optimal solution, then $d_{opt,1}^2>d_{opt,3}^2,d_{opt,1}^2>d_{opt,4}^2,d_{opt,1}^2>d_{opt,5}^2,$ A scope being related to h can be obtained, namely $h\&Element;\{h:\frac{2h_2}{3h_1}+\frac{h_2}{h_3}<1,\frac{h_2}{h_1}+\frac{2h_2}{3h_3}<1,\frac{h_2}{h_1}+\frac{h_2}{h_3}<\frac{5\sqrt{27}-3\sqrt{43}}{4\sqrt{43}-4\sqrt{27}},h_1,h_2,h_3>0\}$ (it is defined as H₁) time optimum solution be $a=\frac{1}{1+\frac{4h_2}{3h_1}+\frac{4h_2}{3h_3}}\&lsqb;\frac{4h_2}{3h_1},1,\frac{4h_2}{3h_3}\&rsqb;,$ And $d_{opt}^2=\frac{3h_2^2}{{(1+\frac{4h_2}{3h_1}+\frac{4h_2}{3h_3})}^2}.$ In like manner can draw the scope H of h during other optimal solutions₂,H₃,H₄,H₅��

Now utilize apagoge: as h �� H_k, (k=1,2 ..., 5), for all of [A, C] �� G_l, (1��l��6) assume that there is an a makes $\min d_{free}^2>d_{opt,k}^2,$ Then $\&lsqb;A,C\&rsqb;\&NotElement;G_l$ Or $h\&NotElement;H_k,$ Contradiction.

Illustrate, if [A, C] �� G₁, it is assumed thatNow we assume thatCan get(because above having been described above these six is possible minterm, therefore take any one of these 6) then $3a_2^2{h}_2^2>d_{opt,1}^2=\frac{3h_2^2}{{(1+\frac{4h_2}{3h_1}+\frac{4h_2}{3h_3})}^2},$ So $(\frac{4}{3A}-1)a_1+(\frac{4}{3C}-1)a_3>0,$ ThenOrWithContradiction. In like manner, [A, C] �� G_l, (1��l��6), h �� H_k, (k=1,2 ..., 5) all can find contradiction under the hypothesis of any one combination.

Therefore at h �� H_k, (k=1,2 ..., 5) under haveAnd in such a situa-tion, for different h �� H_k, (k=1,2 ..., 5), we can findNamelyThe e that equal sign is set up can be got. Such as at h �� H₁Time, whenTime,Then equal sign is set up $\min d_{free}^2\&le;d_{opt,1}^2,$ Then $\max \min d_{free}^2=d_{opt,1}^2.$ In like manner can also obtain such result for other situations.

Therefore also exist 5 kinds different h region divide correspond to different a and

S305: obtain the power coefficient of each branch road according to optimal solution and border and minterm, according to described power coefficient, distributes power for each branch road described.

It is to say, in S304, remaining candidate has solution namely those intersection points to be in fact mostValue, the possible minterm so also determining which region is minterm, then according to the minterm in these remaining candidate's intersection points and boundary line (those lines between points) and region calculate optimum power coefficient.

Applicant finds in the process of research, and when order of modulation is extended to any, the ratio of all of item number and order of modulation exponentially increases, therefore itsIf there is the above power method of salary distribution to set up when OOK modulates, when order of modulation is extended to any, under optimal power allocation mode, all of e meetsAnd equation is set up in some cases, it is thus achieved that the e satisfied condition is unrelated with order of modulation, and the closed solutions of optimal power allocation scheme is relevant from the space that different channel status divides.

It is to say, above power distribution method is unrelated with order of modulation, therefore, in S303, it is possible to search in N-1 dimension spaceThe intersection point of the Local Minimum item under ON-OFF keying modulation mode, it may be assumed that since power distribution is unrelated with order of modulation, then in order to reduce the complexity of calculating further, it is possible to search under the ON-OFF keying modulation mode that exponent number is minimumThe intersection point of Local Minimum item.

Below for N=3, said process is illustrated.

Under ON-OFF keying modulation mode, it is thus achieved that the Xiang Shiwei of Local Minimum Euclidean distance:

a)3a₁ ²h₁ ²,

b)3a₂ ²h₂ ²,

c)3a₃ ²h₃ ²,

d)3a₂ ²h₂ ²+3a₃ ²h₃ ²-4a₂h₂a₃h₃,

e)3a₁ ²h₁ ²+3a₂ ²h₂ ²-4a₁h₁a₂h₂,

f)3a₁ ²h₁ ²+3a₂ ²h₂ ²+3a₃ ²h₃ ²-4a₁h₁a₂h₂+2a₁h₁a₃h₃-4a₂h₂a₃h₃��

Two-dimensional space as shown in Figure 4, wherein, makes

Every subregion shared in two-dimensional space (each Local Minimum item uses G to represent) as shown in Figure 4 above. These subregions should be made up of these equivalents and A and C, these equivalences the straight line that constitutes of expression formula or curve, this two-dimensional space may be constructed region, and form intersection point. The intersection point of each sub regions is candidate's optimal solution, and utilizing apagoge to remove from candidate's optimal solution is not the item of optimal solution, the remaining optimal solution being object function.

Power distribution method described in the present embodiment, when solving optimization problem, for the optimization of non-convex function, combines method of geometry and parametric variable is divided into multiple space, utilize the intersection point in space to determine optimal solution, thus reducing the complexity solved. Further, modulation system of the present invention is not limited to channel parameter and modulation system, can obtain the power allocation scheme of optimum for arbitrary channel and modulation system.

With said method embodiment accordingly, the embodiment of the present application also discloses a kind of power distribution unit, as it is shown in figure 5, include acquisition module 501, computing module 502, determine module 503 and distribution module 504.

Wherein, acquisition module 501 for obtain reception code distance between the first signal phasor and secondary signal vector square, described first signal phasor is the signal phasor that transmitting terminal will send, described first signal phasor is made up of each tributary signal, each tributary signal described has different power partition coefficients, and described first signal phasor receiving end is judged to described secondary signal vector.

Computing module 502 is used for building object function $\left\{\begin{array}{c}{d}_{opt}^2=\underset{a}{\max }\underset{e}{\min }{d}_{free}^2\\ s.t\underset{i=1}{\overset{N}{\&Sigma;}}{a}_i=1,a_i>0\end{array}\right.$ Wherein,For described reception code distance square,For minimum reception code distance square,For the summation of the power partition coefficient of all tributary signals, power coefficient $a={\&lsqb;a_1,a_2,...,a_N\&rsqb;}_{N\&times;1}^T,e={\&lsqb;e_1,e_2,...,e_N\&rsqb;}_{N\&times;1}^T,$ E �� 0, e_i��(0,��1,����(2^q-1)), and i �� (1 ..., N), 2^qFor order of modulation, N is circuitry number; And in the N-1 dimension space built in advance, searchThe intersection point of Local Minimum item, described intersection point is candidate's optimal solution of described object function, the coordinate axes of described N-1 dimension space byAnd channel coefficients is constituted through variable replacement;

Determining that module 503 for determining optimal solution from described candidate's optimal solution, described optimal solution is for determining the power coefficient of each branch road described.

Distribution module 504 is for according to described power coefficient, distributing power for each branch road described.

Specifically, acquisition module obtain the reception code distance between the first signal phasor and secondary signal vector square specific implementation be: obtain reception code distance between the first signal phasor and secondary signal vector square, square including of described reception code distance: the reception code distance determined with squared euclidean distance square $d_{free}^2=\left|\right|\mathrm{\&Gamma;}(a,s,N)h-\mathrm{\&Gamma;}(a,\hat{s},N)h|{|}_2^2=|\left|\mathrm{\&Gamma;}(a,e,N)h\right|{|}_2^2=\underset{m=1}{\overset{N}{\&Sigma;}}{\left(\underset{i=1}{\overset{m}{\&Sigma;}}{e}_i{a}_i{h}_i\right)}^2+\underset{m=2}{\overset{N}{\&Sigma;}}{\left(\underset{i=m}{\overset{N}{\&Sigma;}}{e}_i{a}_i{h}_i\right)}^2,$ Wherein, h is described channel coefficients.

Computing module, in the N-1 dimension space built in advance, is searchedThe specific implementation of intersection point of Local Minimum item be: in the N-1 dimension space built in advance, searchThe intersection point of the Local Minimum item under ON-OFF keying modulation mode.

Determine that module determines that from described candidate's optimal solution the specific implementation of optimal solution is: utilize apagoge to determine the non-optimal solution in described candidate's optimal solution, remaining candidate's optimal solution is described optimal solution: according to all intersection points in described N-1 dimension space, straight line that respectively simultaneous intersects with each intersection point or the expression formula of curve and constraints, it is thus achieved that possible optimum a is with accordinglyAllOne maximum of middle hypothesis, by described maximum and otherCompare, it is thus achieved that the scope of h, if this intersection point is correspondingBeing unlikely to be maximum value, then give up, being all unlikely to be maximum until giving upRemaining for described optimal solution.

When N=3, computing module determines the transverse axis of described two-dimensional spaceThe longitudinal axis of described two-dimensional space

Device described in the present embodiment, when solving optimization problem, for the optimization of non-convex function, combines method of geometry and parametric variable is divided into multiple space, utilize the intersection point in space to determine optimal solution, thus reducing the complexity solved. Further, it is not limited to channel parameter and modulation system, the power allocation scheme of optimum can be obtained for arbitrary channel and modulation system.

Device described in the present embodiment, it is possible to be arranged on the transmitting terminal of optic communication, the data to be embodied as each branch road carry out the distribution of power.

If the function described in the embodiment of the present application method is using the form realization of SFU software functional unit and as independent production marketing or use, it is possible to be stored in a computing equipment read/write memory medium. Based on such understanding, part or the part of this technical scheme that prior art is contributed by the embodiment of the present application can embody with the form of software product, this software product is stored in a storage medium, including some instructions with so that a computing equipment (can be personal computer, server, mobile computing device or the network equipment etc.) perform all or part of step of method described in each embodiment of the application. And aforesaid storage medium includes: USB flash disk, portable hard drive, read only memory (ROM, Read-OnlyMemory), the various media that can store program code such as random access memory (RAM, RandomAccessMemory), magnetic disc or CD.

In this specification, each embodiment adopts the mode gone forward one by one to describe, and what each embodiment stressed is the difference with other embodiments, between each embodiment same or similar part mutually referring to.

Described above to the disclosed embodiments, makes professional and technical personnel in the field be capable of or uses the application. The multiple amendment of these embodiments be will be apparent from for those skilled in the art, and generic principles defined herein when without departing from spirit herein or scope, can realize in other embodiments. Therefore, the application is not intended to be limited to the embodiments shown herein, and is to fit to the widest scope consistent with principles disclosed herein and features of novelty.

Claims (10)

1. a power distribution method, it is characterised in that including:

Obtain reception code distance between the first signal phasor and secondary signal vector square, described first signal phasor is the signal phasor that transmitting terminal will send, described first signal phasor is made up of each tributary signal, each tributary signal described has different power partition coefficients, and described first signal phasor receiving end is judged to described secondary signal vector;

Build object function $\left\{\begin{array}{c}{d}_{opt}^2=\underset{a}{max}\underset{e}{\min }{d}_{free}^2\\ s.t\underset{i=1}{\overset{N}{\&Sigma;}}{a}_i=1,a_i>0\end{array}\right.$ Wherein,For described reception code distance square,For minimum reception code distance square,For the summation of the power partition coefficient of all tributary signals, power coefficient $a={\&lsqb;a_1,a_2,...,a_N\&rsqb;}_{N\&times;1}^T,$ $e={\&lsqb;e_1,e_2,...,e_N\&rsqb;}_{N\&times;1}^T,$ E �� 0, e_i��(0,��1,����(2^q-1)), and i �� (1 ..., N), 2^qFor order of modulation, N is circuitry number;

In the N-1 dimension space built in advance, searchThe intersection point of Local Minimum item, described intersection point is candidate's optimal solution of described object function, the coordinate axes of described N-1 dimension space byAnd channel coefficients is constituted through variable replacement;

Determining optimal solution from described candidate's optimal solution, described optimal solution is for determining the power coefficient of each branch road described;

According to described power coefficient, distribute power for each branch road described.

2. method according to claim 1, it is characterised in that square including of described reception code distance:

The reception code distance determined with squared euclidean distance square $d_{free}^2=\left|\right|\mathrm{\&Gamma;}\left(a,s,N\right)h-\mathrm{\&Gamma;}\left(a,\hat{s},N\right)h|{|}_2^2=|\left|\mathrm{\&Gamma;}\left(a,e,N\right)h\right|{|}_2^2=\underset{m=1}{\overset{N}{\&Sigma;}}{\left(\underset{i=1}{\overset{m}{\&Sigma;}}{e}_i{a}_i{h}_i\right)}^2+\underset{m=2}{\overset{N}{\&Sigma;}}{\left(\underset{i=m}{\overset{N}{\&Sigma;}}{e}_i{a}_i{h}_i\right)}^2,$ Wherein, h is described channel coefficients.

3. method according to claim 1, it is characterised in that described in the N-1 dimension space built in advance, searchesThe intersection point of Local Minimum item include:

Described in the N-1 dimension space built in advance, searchThe intersection point of the Local Minimum item under ON-OFF keying modulation mode.

4. method according to claim 1, it is characterised in that described determine that optimal solution includes from described candidate's optimal solution:

Utilizing apagoge to determine the non-optimal solution in described candidate's optimal solution, remaining candidate's optimal solution is described optimal solution:

According to all intersection points in described N-1 dimension space, simultaneous intersects with each intersection point respectively straight line or the expression formula of curve and constraints, it is thus achieved that possible optimum a is with accordingly

AllOne maximum of middle hypothesis, by described maximum and otherCompare, it is thus achieved that the scope of h, if this intersection point is correspondingBeing unlikely to be maximum value, then give up, being all unlikely to be maximum until giving upRemaining for described optimal solution.

5. the method according to any one of Claims 1-4, it is characterised in that when N=3, the transverse axis of described two-dimensional spaceThe longitudinal axis of described two-dimensional space

6. a power distribution unit, it is characterised in that including:

Acquisition module, for obtain reception code distance between the first signal phasor and secondary signal vector square, described first signal phasor is the signal phasor that transmitting terminal will send, described first signal phasor is made up of each tributary signal, each tributary signal described has different power partition coefficients, and described first signal phasor receiving end is judged to described secondary signal vector;

Computing module, is used for building object function $\left\{\begin{array}{c}{d}_{opt}^2=\underset{a}{max}\underset{e}{\min }{d}_{free}^2\\ s.t\underset{i=1}{\overset{N}{\&Sigma;}}{a}_i=1,a_i>0\end{array}\right.$ Wherein,For described reception code distance square,For minimum reception code distance square,For the summation of the power partition coefficient of all tributary signals, power coefficient $a={\&lsqb;a_1,a_2,...,a_N\&rsqb;}_{N\&times;1}^T,$ $e={\&lsqb;e_1,e_2,...,e_N\&rsqb;}_{N\&times;1}^T,$ E �� 0, e_i��(0,��1,����(2^q-1)), and i �� (1 ..., N), 2^qFor order of modulation, N is circuitry number; And in the N-1 dimension space built in advance, searchThe intersection point of Local Minimum item, described intersection point is candidate's optimal solution of described object function, the coordinate axes of described N-1 dimension space byAnd channel coefficients is constituted through variable replacement;

Determining module, for determining optimal solution from described candidate's optimal solution, described optimal solution is for determining the power coefficient of each branch road described;

Distribution module, for according to described power coefficient, distributing power for each branch road described.

7. device according to claim 6, it is characterised in that square including of described reception code distance:

The reception code distance determined with squared euclidean distance square $d_{free}^2=\left|\right|\mathrm{\&Gamma;}\left(a,s,N\right)h-\mathrm{\&Gamma;}\left(a,\hat{s},N\right)h|{|}_2^2=|\left|\mathrm{\&Gamma;}\left(a,e,N\right)h\right|{|}_2^2=\underset{m=1}{\overset{N}{\&Sigma;}}{\left(\underset{i=1}{\overset{m}{\&Sigma;}}{e}_i{a}_i{h}_i\right)}^2+\underset{m=2}{\overset{N}{\&Sigma;}}{\left(\underset{i=m}{\overset{N}{\&Sigma;}}{e}_i{a}_i{h}_i\right)}^2,$ Wherein, h is described channel coefficients.

8. device according to claim 6, it is characterised in that described computing module is for, in the N-1 dimension space built in advance, searchingThe intersection point of Local Minimum item include:

Described computing module specifically for, in the N-1 dimension space built in advance, searchThe intersection point of the Local Minimum item under ON-OFF keying modulation mode.

9. device according to claim 6, it is characterised in that described determine that module for determining that optimal solution includes from described candidate's optimal solution:

Described determine module specifically for, apagoge is utilized to determine the non-optimal solution in described candidate's optimal solution, remaining candidate's optimal solution is described optimal solution: according to all intersection points in described N-1 dimension space, straight line that respectively simultaneous intersects with each intersection point or the expression formula of curve and constraints, it is thus achieved that possible optimum a is with accordinglyAllOne maximum of middle hypothesis, by described maximum and otherCompare, it is thus achieved that the scope of h, if this intersection point is correspondingBeing unlikely to be maximum value, then give up, being all unlikely to be maximum until giving upRemaining for described optimal solution.

10. device according to claim 6, it is characterised in that described computing module specifically for, when N=3, the transverse axis of described two-dimensional spaceThe longitudinal axis of described two-dimensional space