CN103546237A - Network coding method, network coding device and network coding system - Google Patents

Network coding method, network coding device and network coding system Download PDF

Info

Publication number
CN103546237A
CN103546237A CN201210247408.XA CN201210247408A CN103546237A CN 103546237 A CN103546237 A CN 103546237A CN 201210247408 A CN201210247408 A CN 201210247408A CN 103546237 A CN103546237 A CN 103546237A
Authority
CN
China
Prior art keywords
vector
matrix
candidate collection
point
network coding
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201210247408.XA
Other languages
Chinese (zh)
Other versions
CN103546237B (en
Inventor
陈文�
唐洪莹
魏岳军
金莹
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201210247408.XA priority Critical patent/CN103546237B/en
Publication of CN103546237A publication Critical patent/CN103546237A/en
Application granted granted Critical
Publication of CN103546237B publication Critical patent/CN103546237B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

An embodiment of the invention provides a network coding method, a network coding device and a network coding system, and relates to the field of communication. The network coding method is applied to the network coding system. The network coding system comprises two information source devices, a relay device and an information sink device. The network coding method includes acquiring integer vector candidate sets; selecting vectors with small corresponding index values in the integer vector candidate sets according to preset corresponding relations among vectors and index values and combining the vectors with the small corresponding index values to form complex vector candidate sets; selecting two vectors with small corresponding index values in each complex vector candidate set according to preset corresponding relations among vectors and index values to form a full-rank network coding matrix. The network coding method, the network coding device and the network coding system in the embodiment of the invention have the advantages that the average computational complexity can be reduced, and the network coding method, the network coding device and the network coding system are used for network coding.

Description

A kind of method of network code, Apparatus and system
Technical field
The present invention relates to the communications field, relate in particular to a kind of network coding method, Apparatus and system.
Background technology
The mode that traditional communication network transmits data is storage forwarding, except source device and the node sink device of data are only responsible for route, and data content is not done to any processing, and via node is being played the part of the role of transponder.Above-mentioned source device can be used for carrying out transmission and/or the coding of data, and above-mentioned sink device can be used for carrying out reception and/or the decoding of data, and at present, in some communication networks, via node also can carry out the amplification forwarding of data.
Network code is a kind of message-switching technique that has merged route and coding, and its core concept is, on each node in network, the information of receiving on each channel is carried out to linearity or nonlinear processing, is then transmitted to downstream node.
In current multi-source relay system, need to obtain the network code matrix that makes the maximized full rank of this system transmission rate, source device is encoded to sent data according to this network code matrix.When this multi-source relay system comprises: two source device, when a relay and a sink device, can adopt sphere decoding technology to obtain network code matrix, but the calculation times of sphere decoding technology is random, its average calculating operation complexity is higher.
Summary of the invention
Embodiments of the invention provide a kind of network coding method, Apparatus and system, can reduce average calculating operation complexity.
For achieving the above object, embodiments of the invention adopt following technical scheme:
On the one hand, provide a kind of network coding method, described network coding method is applied to a kind of network coding system, and described network coding system comprises: two source device, and a relay and a sink device, described method comprises:
Obtain integer vectors candidate collection;
According to default vector and index value corresponding relation, in described integer vectors candidate collection, select the synthetic complex vector located candidate collection of Vector Groups that manipulative indexing value is less;
According to described default vector and index value corresponding relation, in described complex vector located candidate collection, select the network code matrix of two vector composition full ranks that manipulative indexing value is less.
On the one hand, provide code device, described code device is applied to a kind of network coding system, and described network coding system comprises: two source device, and a relay and a sink device, described code device comprises:
Processor, for obtaining integer vectors candidate collection;
Assembled unit for the vector according to default and index value corresponding relation, is selected the synthetic complex vector located candidate collection of Vector Groups that manipulative indexing value is less in described integer vectors candidate collection;
The network code matrix of two vector composition full ranks that manipulative indexing value is less for according to described default vector and index value corresponding relation, is selected in screening unit in described complex vector located candidate collection.
On the one hand, provide a kind of network coding system, described network coding system comprises: two source device, a relay and a sink device;
Described network coding system comprises above-mentioned code device.
On the one hand, provide a kind of network coding system, described network coding system comprises two source device, a relay and a sink device; Wherein, the device of any one in described source device, described relay and described sink device is above-mentioned code device.
Embodiments of the invention provide a kind of network coding method, Apparatus and system, described network coding method is applied to a kind of network coding system, described network coding system comprises: two source device, a relay and a sink device, described method comprises: obtain integer vectors candidate collection; According to default vector and index value corresponding relation, in described integer vectors candidate collection, select the synthetic complex vector located candidate collection of Vector Groups that manipulative indexing value is less; According to default vector and index value corresponding relation, in described complex vector located candidate collection, select the network code matrix of two vector composition full ranks that manipulative indexing value is less.So, by obtaining complex vector located candidate collection and selecting the network code matrix step of vector composition full rank succinct in this complex vector located candidate collection, calculation times is less, compare with existing sphere decoding technology, its average calculating operation complexity is lower, therefore can reduce average calculating operation complexity.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, to the accompanying drawing of required use in embodiment or description of the Prior Art be briefly described below, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skills, do not paying under the prerequisite of creative work, can also obtain according to these accompanying drawings other accompanying drawing.
A kind of network coding method flow chart that Fig. 1 provides for the embodiment of the present invention;
The another kind of network coding method flow chart that Fig. 2 provides for the embodiment of the present invention;
Fig. 3 is the plane coordinate system schematic diagram that the embodiment of the present invention is set up according to steepest ascent direction;
A kind of ascending order index value table that Fig. 4 provides for the embodiment of the present invention;
The network coding method that Fig. 5 provides for the embodiment of the present invention and the average computation number of times comparative result schematic diagram of sphere decoding technology;
Calculation times comparative result schematic diagrames at most under the network coding method that Fig. 6 provides for the embodiment of the present invention and the worst condition of sphere decoding technology;
A kind of code device structural representation that Fig. 7 provides for the embodiment of the present invention;
A kind of processor structure schematic diagram that Fig. 8 provides for the embodiment of the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is only the present invention's part embodiment, rather than whole embodiment.Embodiment based in the present invention, those of ordinary skills, not making the every other embodiment obtaining under creative work prerequisite, belong to the scope of protection of the invention.
The embodiment of the present invention provides a kind of network coding method, and as shown in Figure 1, described network coding method is applied to a kind of network coding system, and described network coding system comprises: two source device, and a relay and a sink device, described method comprises:
S101, obtain integer vectors candidate collection.
S102, according to default vector and index value corresponding relation, in described integer vectors candidate collection, select the synthetic complex vector located candidate collection of Vector Groups that manipulative indexing value is less.
S103, according to default vector and index value corresponding relation, in described complex vector located candidate collection, select less two vectors of manipulative indexing value to form the network code matrixes of full ranks.
So, by obtaining complex vector located candidate collection and selecting vector to form the network code matrix of full rank in this complex vector located candidate collection, step is succinct, calculation times is less, compare with existing sphere decoding technology, its average calculating operation complexity is lower, therefore can reduce average calculating operation complexity.
It should be noted that, the final controlling element of this network coding method can be any one device in described source device, described relay or described sink device, can be also a code device independently.
Exemplary, the code device of usining is below described as possibility as executive agent, as shown in Figure 2.
S201, code device obtain integer vectors candidate collection.
First, code device need to obtain the channel parameter in network coding system, and this channel parameter can comprise: h r1, h r2, r d1, h r1, h d2and h dretc., h wherein r1for the channel vector of source device 1 to relay, h r2for the channel vector of source device 2 to relay, h d1for the channel vector of source device 1 to sink device, h d2for the channel vector of source device 2 to described sink device, h drfor the channel vector of described relay to sink device.
It should be noted that, obtaining of this channel parameter can be that in code device and this network coding system, each relevant apparatus carries out information interaction and obtains, and can be also that the mode that this network coding system issues by static state sends to code device in advance.
In network code matrix, the emission rate of sink device is maximum, is equivalent to and obtains network code complex integers matrix A=[b 1, b 2] t, make
Figure BDA00001899423300041
value minimum, wherein, M is one can calculate by channel parameter the complex matrix of acquisition.B tfor the transposition of vectorial b, " T " is transposition symbol.Especially, described matrix M can meet formula:
Figure BDA00001899423300042
Wherein, H = h d 1 h d 2 β h r 1 h dr β h r 2 h dr , β is the power amplification coefficient power amplification ratio of relay, h r1for the channel vector of source device 1 to relay, h r2for the channel vector of source device 2 to relay, h d1for the channel vector of source device 1 to sink device, h d2for the channel vector of source device 2 to sink device, h drfor the channel vector of relay to described sink device, represent pseudo-inverse operation, also referred to as conjugate transpose, operate.
Matrix V is
Figure BDA00001899423300051
right eigenmatrix, k is the correlation matrix of the noise received of two adjacent time-slots, and described K meets K = I 0 0 β 2 h dr h dr H + I , I is unit matrix.
Matrix D is diagonal matrix, the element D on described diagonal matrix D diagonal iimeet:
D ii = 1 1 + SNR λ i , i ≤ rank ( H ~ ) 1 , i > rank ( H ~ ) , Wherein, the order of rank (.) representing matrix.λ ifor
Figure BDA00001899423300055
the characteristic value of arranging from big to small in i characteristic value, SNR is transmission signal to noise ratio.
Therefore, code device can be carried out following steps: obtain the steepest ascent direction of matrix Re (M), the real part of described Re (M) representing matrix M.This steepest ascent direction is the direction of the eigenvalue of maximum characteristic of correspondence vector of matrix Re (M), therefore this steepest ascent direction can be by asking matrix M eigenvalue of maximum characteristic of correspondence vector to obtain, its concrete grammar can be with reference to prior art, and the present invention repeats no more this.
Then, code device can obtain point of proximity and extension point until the sum of described point of proximity and extension point is more than or equal to preset value along described steepest ascent direction, described point of proximity is included in the plane coordinate system of setting up according to the steepest ascent direction of described matrix Re (M), be positioned at the be separated by point of p coordinate unit of point on described steepest ascent direction and the point on abscissa or ordinate and described steepest ascent direction, described extension point is the be separated by point of q coordinate unit of abscissa or ordinate and described point of proximity.Example, suppose that described steepest ascent direction is parallel with straight line y=x, according to this steepest ascent direction, set up plane coordinate system as shown in Figure 3, work as p=1, during q=1, described point of proximity comprises the point (0,0) being positioned on described steepest ascent direction, (1,1), (2,2) the be separated by point of a coordinate unit of the point etc. and on abscissa or ordinate and described steepest ascent direction, as (0,1), (1,0), (2,1), (1,2).Example, (2,2) extension point is (2,1), (2,3), (1,2), (3,2).It should be noted that, in embodiments of the present invention, can adopt Plane Detecting Technique to obtain point of proximity until the sum of described point of proximity and extension point is more than or equal to preset value along steepest ascent direction, wherein p=1.Due to described point of proximity and extension point linear growth not necessarily, so it is larger to occur that the sum of point of proximity and extension point is greater than the probability of preset value.
Meanwhile, can adopt Plane Detecting Technique to obtain extension point along described steepest ascent direction, arrange
Figure BDA00001899423300061
described α 1with described α 2for two characteristic values of matrix Re (M), and α 2> α 1, when the sum of c>=20 or described point of proximity and extension point is more than or equal to preset value, no longer carry out obtaining of extension point; When c≤10, q=2; When 10 < c < 20, q=1.Therefore, in embodiments of the present invention, obtaining of code device point of proximity and extension point can be nonsynchronous.
It should be noted that, above-mentioned Plane Detecting Technique is identical with prior art essence, and the present invention repeats no more this.Especially, obtaining of described point of proximity and extension point can also adopt additive method, example, as artificial calculating is obtained, computer expert crosses specific program search and obtain or enumerate completely searching method and obtain etc., the present invention does not limit this.
Then, code device can obtain the integer vectors candidate collection to be selected of corresponding described steepest ascent direction, and the vector element of each integer vectors in described integer vectors candidate collection to be selected is identical with the coordinate element of described point of proximity and extension point.Example, suppose when described code device obtain for (0,0), (1,1), (2,2) etc., the vector in the integer vectors candidate collection to be selected of corresponding described steepest ascent direction is 0 0 , 1 1 , 2 2 Deng.Finally, code device can select integer vectors a to form integer vectors candidate collection in described integer vectors candidate collection to be selected, and described integer vectors a meets || a|| 2≤ 1+ (max λ i) SNR, wherein, max λ ifor
Figure BDA00001899423300063
eigenvalue of maximum,
Figure BDA00001899423300064
H = h d 1 h d 2 &beta; h r 1 h dr &beta; h r 2 h dr , K is the correlation matrix of the noise received of two adjacent time-slots, and described K meets K = I 0 0 &beta; 2 h dr h dr H + I , Described I is unit matrix, the power amplification coefficient power amplification ratio that β is described relay, h r1for the channel vector of source device 1 to described relay, h r2for the channel vector of source device 2 to described relay, h d1for the channel vector of source device 1 to described sink device, h d2for the channel vector of source device 2 to described sink device, h drfor the channel vector of described relay to described sink device, represent pseudo-inverse operation, || a|| represents the mould of vectorial a, and SNR is for sending signal to noise ratio.
S202, code device, according to default vector and index value corresponding relation, are selected the synthetic complex vector located candidate collection of Vector Groups that manipulative indexing value is less in described integer vectors candidate collection.
Example, code device can be according to default vector and index value corresponding relation, in described integer vectors candidate collection, selects vector that m manipulative indexing value is less as real part vector candidate collection; Then according to default vector and index value corresponding relation, in described integer vectors candidate collection, select vector that n manipulative indexing value is less as imaginary part vector candidate collection; M and n are empirical value.
In embodiments of the present invention, default vector and index value corresponding relation can be: when vectorial a is real number row vector, the index value C corresponding with described vectorial a meets a tre (M) a=C, a ttransposition for vectorial a; When vectorial a is plural row vector, the index value C corresponding with described vectorial a meets Re (a) tre (M) Re (a)+Im (a) tre (M) Im (a)-2Re (a) tim (M) Im (a)=C, a tfor the transposition of vectorial a, Re (a) represents the real part of vectorial a, and Im (a) represents the imaginary part of vectorial a.It should be noted that, the vector in the embodiment of the present invention and index value are one to one, and each vector can calculate its corresponding index value.Vector in vector in the embodiment of the present invention and index value corresponding relation can be row vector, also can be column vector, the present invention just illustrates, in the technical scope that any those of ordinary skill in the art disclose in the present invention, can expect easily the method that changes or replace, repeat no more here.Especially, the vector in the embodiment of the present invention and index value corresponding relation can also have other forms, and as the norm of compute vector obtains index value etc., the present invention does not limit this.
Suppose described integer vectors candidate collection S w integer vectors altogether, be respectively a 1, a 2, a 3a w, according to formula a tre (M) a=C can obtain call number C 1, C 2, C 3c w, then w call number arranged according to order from small to large, select the vector of corresponding front m index value as real part vector candidate collection
Figure BDA00001899423300081
select the vector of corresponding front n index value as imaginary part vector candidate collection
Figure BDA00001899423300082
finally, code device can be respectively using the vector in described real part vector candidate collection as real part, and the vector in described imaginary part vector candidate collection combines is combined into complex vector located as imaginary part, obtain the complex vector located candidate collection D of described complex vector located composition,
Figure BDA00001899423300083
S203, code device, according to default vector and index value corresponding relation, are selected the network code matrix of the synthetic full rank of Vector Groups that manipulative indexing value is less in described complex vector located candidate collection.
When code device obtains after the complex vector located candidate collection D of described complex vector located composition, can be according to default vector and index value corresponding relation:
a TMa+(Re(a)) TRe(M)(Re(a))-2(Im(a)) TIm(M)(Im(a))=C,
Obtain the index value of each complex vector located correspondence in complex vector located candidate collection D, the vector in described complex vector located candidate collection is arranged according to corresponding index value order from small to large; Then, from described complex vector located candidate collection, select successively two different complex vector located, form matrix until described matrix is non-singular matrix, the transposed matrix of described non-singular matrix is described network code matrix.Wherein, whether judgment matrix is non-singular matrix, can according to detecting, whether matrix to be reversible, whether the determinant of compute matrix be that the method such as zero is determined, and the present invention does not limit this.
It should be noted that, the sequencing of the network coding method step that the embodiment of the present invention provides can suitably be adjusted, the quantity of step also can according to circumstances be carried out corresponding increase and decrease, anyly be familiar with those skilled in the art in the technical scope that the present invention discloses, can expect easily the method changing, therefore repeat no more.
Exemplary, for a network coding system, this network coding system comprises: two source device, a relay and a sink device, suppose preset value Vmax=20, m=3, n=4, the signal power of each source device and relay is P=10dB, and the variance of fading channel and additive Gaussian channel is normalized to 1.The Metzler matrix being generated by respective channel parameter is:
M = 0.0311 - 0.0072 - 0.0171 j - 0.0072 + 0.0171 j 0.0454 .
It should be noted that, when obtaining integer vectors candidate collection S, due to preset value Vmax=20, example, first can adopt Plane Detecting Technique to obtain point of proximity and extension point until the sum of described point of proximity and extension point is more than or equal to 20 along described steepest ascent direction, in the integer vectors candidate collection to be selected of the corresponding steepest ascent direction that therefore code device obtains, integer vectors is greater than 20, then code device can further reduce the quantity of integer vectors in integer vectors candidate collection to be selected according to the searching method of enumerating completely of the prior art, to reduce the complexity of calculating, this integer vectors a enumerating completely in the integer vectors candidate collection S that searching method obtains need to meet || a|| 2≤ 1+ (max λ i) SNR, wherein, SNR is for sending signal to noise ratio, SNR=10dB in embodiments of the present invention, and the integer vectors candidate collection S finally obtaining is totally 12 integer vectors, and this integer vectors candidate collection S is:
Then, according to default vector and index value corresponding relation a tre (M) a=C, the call number set V that this integer vectors candidate collection S is corresponding sfor:
V S={0.0311,0.0311,0,0.1243,0.2797,0.2417,0.0909,0.0621,0.1840,0.1243,0.1818,0.0454,0.0454,0,1818}
This call number set V saccording to order from small to large, arrange, integer vectors candidate collection S according to call number set V scorresponding order arrange, 3 integer vectors D before integer vectors candidate collection S chooses respectively then 3with front 4 integer vectors D 4:
Figure BDA00001899423300101
Figure BDA00001899423300102
Then, by front 3 integer vectors D 3as real part and front 4 integer vectors D4, as imaginary part, be combined into the complex vector located candidate collection D of 12 complex vector located compositions:
Figure BDA00001899423300103
then can be according to default vector and index value corresponding relation: a tma+ (Re (a)) tre (M) (Re (a))-2 (Im (a)) tim (M) (Im (a))=C, the index value set V of each complex vector located correspondence in the complex vector located candidate collection D obtaining d:
V D={0,0.0311,0.0311,0.0454,0.0311,0.0622,0.0622,0.0424,0.03311,0.0622,0.0622,0.1106}
By V dmiddle index value is arranged the ascending order index value table obtaining as shown in Figure 4 according to order from small to large, the vector in complex vector located candidate collection D of while is corresponding adjustment order also.Then, in described complex vector located candidate collection, select the network code matrix of the synthetic full rank of Vector Groups that manipulative indexing value is less, due in this network coding system, there are two source device, therefore there are two respectively corresponding these two source device of network code vector, therefore need to select two complex vector located network consisting encoder matrixs in complex vector located candidate collection D.Example, for the index value 0 (γ in ascending order index value table as shown in Figure 4 1), in corresponding complex vector located candidate collection D, vector is [0,0] t, successively by correspondence 0.0311 (γ 2), 0.0311 (γ 3) ... 0.1106 (γ 12) vector with vector [0,0] tcombination obtains matrix, and whether detect matrix is the matrix of being completely lost, obviously, and with vector [0,0] tthere is not the matrix of being completely lost in the matrix that combination obtains, therefore moves to γ in ascending order index value table 2corresponding index value 0.0311, in its corresponding complex vector located candidate collection D of institute, vector is [j, 0] t, successively by correspondence 0.0311 (γ 2), 0.0311 (γ 3) ... 0.1106 (γ 12) vector with vector [j, 0] tcombination obtains matrix, and whether detect matrix is the matrix of being completely lost, and finds to exist 0.0454 (γ 8) vector [1 ,-j] in corresponding complex vector located candidate collection D twith [j, 0] tthe matrix forming is non-singular matrix, and the transposed matrix of described non-singular matrix is network code matrix, and the network code matrix obtaining is:
A = 1 - j j 0 , This result is identical with the result that sphere decoding technology is obtained.
It should be noted that, the network code vector in the network code matrix in the embodiment of the present invention can be row vector, can be also column vector.The embodiment of the present invention only illustrates with row vector, when this particular network coding vector is column vector, the coded system of information source and the decoding process of sink device carry out respective change, in the technical scope that any those of ordinary skill in the art disclose in the present invention, can expect easily the method that changes or replace, repeat no more here.
The network coding method that the embodiment of the present invention provides, by obtaining complex vector located candidate collection and selecting vector to form the network code matrix of full rank in this complex vector located candidate collection, step is succinct, calculation times is less, compare with existing sphere decoding technology, its average calculating operation complexity is lower, therefore can reduce average calculating operation complexity.Example, the transmitting power of suppose relay device and source device is all 10dB, relay adopts the amplification forwarding strategy of traditional Gauss's code, compresses forwarding strategy and cuts by maximum the speed upper bound that minimum stream is calculated.The network coding method that Fig. 5 provides for the embodiment of the present invention and the average computation number of times comparative result of sphere decoding technology, the average computation frequency curve of the network coding method that curve e provides for the embodiment of the present invention, curve f is the average computation frequency curve of sphere decoding technology, can find out, when signal to noise ratio is identical, the average computation number of times in the network coding method that the average computation number of times of sphere decoding technology provides higher than the embodiment of the present invention far away.
Calculation times comparative results at most under the network coding method that Fig. 6 provides for the embodiment of the present invention and the worst condition of sphere decoding technology, maximum calculation times curves of the network coding method that curve g provides for the embodiment of the present invention, curve h is maximum calculation times curves of sphere decoding technology, can find out, when signal to noise ratio is identical, under worst condition, the maximum calculation times in the network coding method that maximum calculation times of sphere decoding technology provide higher than the embodiment of the present invention far away.The unit that it should be noted that Fig. 6 ordinate is 1 * 10 4.Especially, with respect to the distance of normalization source device and sink device, be 1 o'clock, the network coding method that the embodiment of the present invention provides is when application, and interrupt rate also increases.
The embodiment of the present invention provides a kind of code device 70, and as shown in Figure 7, described code device 70 is applied to a kind of network coding system, and described network coding system comprises: two source device, and a relay and a sink device, described code device comprises:
Processor 701, for obtaining integer vectors candidate collection.
Assembled unit 702 for the vector according to default and index value corresponding relation, is selected the synthetic complex vector located candidate collection of Vector Groups that manipulative indexing value is less in described integer vectors candidate collection.
The network code matrix of two vector composition full ranks that manipulative indexing value is less for the vector according to default and index value corresponding relation, is selected in screening unit 703 in described complex vector located candidate collection.
So, assembled unit is selected the network code matrix of vector composition full rank in this complex vector located candidate collection by obtaining complex vector located candidate collection and screening unit, step is succinct, calculation times is less, compare with existing sphere decoding technology, its average calculating operation complexity is lower, therefore can reduce average calculating operation complexity.
Further, as shown in Figure 8, described processor 701 specifically comprises:
First obtains subelement 7011, for obtaining the steepest ascent direction of matrix Re (M), and the real part of described Re (M) representing matrix M.
Second obtains subelement 7012, for obtaining point of proximity and extension point along described steepest ascent direction until the sum of described point of proximity and extension point is more than or equal to preset value, described point of proximity is included in the plane coordinate system of setting up according to the steepest ascent direction of described matrix Re (M), be positioned at the be separated by point of p coordinate unit of point on described steepest ascent direction and the point on abscissa or ordinate and described steepest ascent direction, described extension point is the be separated by point of q coordinate unit of abscissa or ordinate and described point of proximity.This second obtain subelement 7012 specifically for: adopt Plane Detecting Technique to obtain point of proximity until the sum of described point of proximity and extension point is more than or equal to preset value, p=1 along described steepest ascent direction.Adopt Plane Detecting Technique to obtain extension point along described steepest ascent direction, arrange
Figure BDA00001899423300131
described α 1with described α 2for two characteristic values of matrix Re (M), and α 2> α 1, when the sum of c>=20 or described point of proximity and extension point is more than or equal to preset value, no longer carry out obtaining of extension point; When c≤10, described q=2; When 10 < c < 20, described q=1.
The 3rd obtains subelement 7013, and for obtaining the integer vectors candidate collection of corresponding described steepest ascent direction, the vector element of each integer vectors in described integer vectors candidate collection is identical with the coordinate element of described point of proximity and extension point.
Chooser unit 7014, for selecting integer vectors a to form integer vectors candidate collection in described integer vectors candidate collection to be selected, described integer vectors a meets || a|| 2≤ 1+ (max λ i) SNR, wherein, max λ ifor
Figure BDA00001899423300132
eigenvalue of maximum, H = h d 1 h d 2 &beta; h r 1 h dr &beta; h r 2 h dr , K is the correlation matrix of the noise received of two adjacent time-slots, and described K meets K = I 0 0 &beta; 2 h dr h dr H + I , Described I is unit matrix, the power amplification coefficient power amplification ratio that β is described relay, h r1for the channel vector of source device 1 to described relay, h r2for the channel vector of source device 2 to described relay, h d1for the channel vector of source device 1 to described sink device, h d2for the channel vector of source device 2 to described sink device, h drfor the channel vector of described relay to described sink device,
Figure BDA00001899423300141
represent pseudo-inverse operation, || a|| represents the mould of vectorial a, and SNR is for sending signal to noise ratio.
Especially, described matrix M can meet formula:
Figure BDA00001899423300142
Wherein, H = h d 1 h d 2 &beta; h r 1 h dr &beta; h r 2 h dr , β is the power amplification coefficient power amplification ratio of relay, h r1for the channel vector of source device 1 to described relay, h r2for the channel vector of source device 2 to described relay, h d1for the channel vector of source device 1 to described sink device, h d2for the channel vector of source device 2 to described sink device, h drfor the channel vector of described relay to described sink device,
Figure BDA00001899423300144
represent pseudo-inverse operation.
Matrix V is
Figure BDA00001899423300145
right eigenmatrix,
Figure BDA00001899423300146
k is the correlation matrix of the noise received of two adjacent time-slots, and described K meets K = I 0 0 &beta; 2 h dr h dr H + I , I is unit matrix.
Matrix D is diagonal matrix, the element D on described diagonal matrix D diagonal iimeet:
D ii = 1 1 + SNR &lambda; i , i &le; rank ( H ~ ) 1 , i > rank ( H ~ ) , Wherein, the order of rank (.) representing matrix.λ ifor
Figure BDA00001899423300149
the characteristic value of arranging from big to small in i characteristic value, SNR is transmission signal to noise ratio.
Described assembled unit 702 specifically for: according to default vector and index value corresponding relation, in described integer vectors candidate collection, select vector that m manipulative indexing value is less as real part vector candidate collection; According to default vector and index value corresponding relation, in described integer vectors candidate collection, select vector that n manipulative indexing value is less as imaginary part vector candidate collection; Using the vector in described real part vector candidate collection as real part, the vector in described imaginary part vector candidate collection combines is combined into complex vector located as imaginary part respectively, obtains the complex vector located candidate collection of described complex vector located composition.
Described screening unit 703 specifically for: the vector in described complex vector located candidate collection is arranged according to order from small to large of corresponding index value; From described complex vector located candidate collection, select successively two different complex vector located, form matrix until described matrix is non-singular matrix, the transposed matrix of described non-singular matrix is described network code matrix.
It should be noted that, described default vector and index value corresponding relation are:
When vectorial a is real number row vector, the index value C corresponding with described vectorial a meets a tre (M) a=C, at is the transposition of vectorial a; When vectorial a is plural row vector, the index value C corresponding with described vectorial a meets:
Re (a) tre (M) Re (a)+Im (a) tre (M) Im (a)-2Re (a) tim (M) Im (a)=C, a tfor the transposition of vectorial a, Re (a) represents the real part of vectorial a, and Im (a) represents the imaginary part of vectorial a.
The embodiment of the present invention provides a kind of network coding system, and described network coding system comprises: two source device, a relay and a sink device.Described source device, for generating according to the source node information after network code matrix coder, and is sent to relay by described source node information; Described relay amplifies described source node information and is forwarded to described information destination node; The source node information of described sink device after for the amplification that receives and resolve described relay and send.
This network coding system also comprises: any one code device that the embodiment of the present invention provides.
Especially, the embodiment of the present invention provides another kind of network coding system, and described network coding system comprises: two source device, a relay and a sink device.The code device that any one device in described source device, described relay and described sink device can provide for the embodiment of the present invention.
The embodiment of the present invention also provides a kind of processor, for the vector according to default and index value corresponding relation, selects the synthetic complex vector located candidate collection of Vector Groups that manipulative indexing value is less in described integer vectors candidate collection.The embodiment of the present invention also provides a kind of processor, for the vector according to default and index value corresponding relation, selects the network code matrix of two vector composition full ranks that manipulative indexing value is less in described complex vector located candidate collection.
The embodiment of the present invention also provides a kind of chip, and this chip is used for carrying out network code, and this chip can comprise above-mentioned processor.
Those skilled in the art can be well understood to, for convenience and simplicity of description, the system of foregoing description, the specific works process of device and unit, can, with reference to the corresponding process in preceding method embodiment, not repeat them here.
In the several embodiment that provide in the application, should be understood that, disclosed system, apparatus and method, can realize by another way.For example, device embodiment described above is only schematic, for example, the division of described unit, be only that a kind of logic function is divided, during actual realization, can have other dividing mode, for example a plurality of unit or assembly can in conjunction with or can be integrated into another system, or some features can ignore, or do not carry out.Another point, shown or discussed coupling each other or direct-coupling or communication connection can be by some interfaces, indirect coupling or the communication connection of device or unit can be electrically, machinery or other form.
The described unit as separating component explanation can or can not be also physically to separate, and the parts that show as unit can be or can not be also physical locations, can be positioned at a place, or also can be distributed in a plurality of network element.Can select according to the actual needs some or all of unit wherein to realize the object of the present embodiment scheme.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, can be also that the independent physics of unit comprises, also can be integrated in a unit two or more unit.Above-mentioned integrated unit both can adopt the form of hardware to realize, and the form that also can adopt hardware to add SFU software functional unit realizes.
The integrated unit that the above-mentioned form with SFU software functional unit realizes, can be stored in a computer read/write memory medium.Above-mentioned SFU software functional unit is stored in a storage medium, comprise some instructions with so that computer equipment (can be personal computer, server, or the network equipment etc.) carry out the part steps of method described in each embodiment of the present invention.And aforesaid storage medium comprises: USB flash disk, portable hard drive, read-only memory (Read-Only Memory, be called for short ROM), the various media that can be program code stored such as random access memory (Random Access Memory is called for short RAM), magnetic disc or CD.
The above; be only the specific embodiment of the present invention, but protection scope of the present invention is not limited to this, is anyly familiar with those skilled in the art in the technical scope that the present invention discloses; can expect easily changing or replacing, within all should being encompassed in protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of described claim.

Claims (16)

1. a network coding method, is characterized in that, described network coding method is applied to a kind of network coding system, and described network coding system comprises: two source device, and a relay and a sink device, described method comprises:
Obtain integer vectors candidate collection;
According to default vector and index value corresponding relation, in described integer vectors candidate collection, select the synthetic complex vector located candidate collection of Vector Groups that manipulative indexing value is less;
According to described default vector and index value corresponding relation, in described complex vector located candidate collection, select the network code matrix of two vector composition full ranks that manipulative indexing value is less.
2. method according to claim 1, is characterized in that, described in obtain integer vectors candidate collection and comprise:
Obtain the steepest ascent direction of matrix Re (M), the real part of described Re (M) representing matrix M;
Along described steepest ascent direction, obtain point of proximity and extension point until the sum of described point of proximity and extension point is more than or equal to preset value, described point of proximity is included in the plane coordinate system of setting up according to the steepest ascent direction of described matrix Re (M), be positioned at the be separated by point of p coordinate unit of point on described steepest ascent direction and the point on abscissa or ordinate and described steepest ascent direction, described extension point is the be separated by point of q coordinate unit of abscissa or ordinate and described point of proximity;
Obtain the integer vectors candidate collection to be selected of corresponding described steepest ascent direction, the vector element of each integer vectors in described integer vectors candidate collection is identical with the coordinate element of described point of proximity and extension point;
In described integer vectors candidate collection to be selected, select integer vectors a to form integer vectors candidate collection, described integer vectors a meets || a|| 2≤ 1+ (max λ i) SNR, wherein, max λ ifor
Figure FDA00001899423200011
eigenvalue of maximum,
Figure FDA00001899423200012
H = h d 1 h d 2 &beta; h r 1 h dr &beta; h r 2 h dr , K is the correlation matrix of the noise received of two adjacent time-slots, and described K meets K = I 0 0 &beta; 2 h dr h dr H + I , Described I is unit matrix, the power amplification coefficient power amplification ratio that β is described relay, h r1for the channel vector of source device 1 to described relay, h r2for the channel vector of source device 2 to described relay, h d1for the channel vector of source device 1 to described sink device, h d2for the channel vector of source device 2 to described sink device, h drfor the channel vector of described relay to described sink device, represent pseudo-inverse operation, || a|| represents the mould of vectorial a, and SNR is for sending signal to noise ratio.
3. method according to claim 2, is characterized in that,
Described matrix M meets formula:
Figure FDA00001899423200021
Described matrix V is
Figure FDA00001899423200022
right eigenmatrix;
Described matrix D is diagonal matrix, the element D on described diagonal matrix D diagonal iimeet:
D ii = 1 1 + SNR &lambda; i , i &le; rank ( H ~ ) 1 , i > rank ( H ~ ) , Wherein, the order of rank (.) representing matrix.λ ifor
Figure FDA00001899423200024
the characteristic value of arranging from big to small in i characteristic value, SNR is transmission signal to noise ratio.
4. method according to claim 3, is characterized in that, describedly along described steepest ascent direction, obtains point of proximity and extension point until the sum of described point of proximity and extension point is more than or equal to preset value comprises:
Adopt Plane Detecting Technique along described steepest ascent direction, to obtain point of proximity until the sum of described point of proximity and extension point is more than or equal to preset value, described p=1;
Adopt Plane Detecting Technique to obtain extension point along described steepest ascent direction, arrange
Figure FDA00001899423200025
described α 1with described α 2for two characteristic values of matrix Re (M), and α 2> α 1, when the sum of c>=20 or described point of proximity and extension point is more than or equal to preset value, no longer carry out obtaining of extension point; When c≤10, described q=2; When 10 < c < 20, described q=1.
5. method according to claim 1, is characterized in that, described according to default vector and index value corresponding relation, selects the synthetic complex vector located candidate collection of Vector Groups that manipulative indexing value is less to comprise in described integer vectors candidate collection:
According to described default vector and index value corresponding relation, in described integer vectors candidate collection, select vector that m manipulative indexing value is less as real part vector candidate collection;
According to described default vector and index value corresponding relation, in described integer vectors candidate collection, select vector that n manipulative indexing value is less as imaginary part vector candidate collection;
Using the vector in described real part vector candidate collection as real part, the vector in described imaginary part vector candidate collection combines is combined into complex vector located as imaginary part respectively, obtains the complex vector located candidate collection of described complex vector located composition.
6. method according to claim 1, is characterized in that, described according to described default vector and index value corresponding relation, selects the network code matrix of the synthetic full rank of Vector Groups that manipulative indexing value is less to comprise in described complex vector located candidate collection:
Vector in described complex vector located candidate collection is arranged according to corresponding index value order from small to large;
From described complex vector located candidate collection, select successively two different complex vector located, form matrix until described matrix is non-singular matrix, the transposed matrix of described non-singular matrix is described network code matrix.
7. according to the method described in claim 1 to 6 any one claim, it is characterized in that, described default vector and index value corresponding relation are:
When vectorial a is real number row vector, the index value C corresponding with described vectorial a meets a tre (M) a=C, a ttransposition for vectorial a;
When vectorial a is plural row vector, the index value C corresponding with described vectorial a meets Re (a) tre (M) Re (a)+Im (a) tre (M) Im (a)-2Re (a) tim (M) Im (a)=C, a tfor the transposition of vectorial a, Re (a) represents the real part of vectorial a, and Im (a) represents the imaginary part of vectorial a.
8. a code device, is characterized in that, described code device is applied to a kind of network coding system, and described network coding system comprises: two source device, and a relay and a sink device, described code device comprises:
Processor, for obtaining integer vectors candidate collection;
Assembled unit for the vector according to default and index value corresponding relation, is selected the synthetic complex vector located candidate collection of Vector Groups that manipulative indexing value is less in described integer vectors candidate collection;
The network code matrix of two vector composition full ranks that manipulative indexing value is less for according to described default vector and index value corresponding relation, is selected in screening unit in described complex vector located candidate collection.
9. code device according to claim 8, is characterized in that, described processor specifically comprises:
First obtains subelement, for obtaining the steepest ascent direction of matrix Re (M), and the real part of described Re (M) representing matrix M;
Second obtains subelement, for obtaining point of proximity and extension point along described steepest ascent direction until the sum of described point of proximity and extension point is more than or equal to preset value, described point of proximity is included in the plane coordinate system of setting up according to the steepest ascent direction of described matrix Re (M), be positioned at the be separated by point of p coordinate unit of point on described steepest ascent direction and the point on abscissa or ordinate and described steepest ascent direction, described extension point is the be separated by point of q coordinate unit of abscissa or ordinate and described point of proximity;
The 3rd obtains subelement, and for obtaining the integer vectors candidate collection of corresponding described steepest ascent direction, the vector element of each integer vectors in described integer vectors candidate collection is identical with the coordinate element of described point of proximity and extension point;
Chooser unit, for select integer vectors a to form integer vectors candidate collection in described integer vectors candidate collection to be selected, described integer vectors a meets || a|| 2≤ 1+ (max λ i) SNR, wherein, max λ ifor
Figure FDA00001899423200041
eigenvalue of maximum, H = h d 1 h d 2 &beta; h r 1 h dr &beta; h r 2 h dr , K is the correlation matrix of the noise received of two adjacent time-slots, and described K meets K = I 0 0 &beta; 2 h dr h dr H + I , Described I is unit matrix, the power amplification coefficient power amplification ratio that β is described relay, h r1for the channel vector of source device 1 to described relay, h r2for the channel vector of source device 2 to described relay, h d1for the channel vector of source device 1 to described sink device, h d2for the channel vector of source device 2 to described sink device, h drfor the channel vector of described relay to described sink device,
Figure FDA00001899423200045
represent pseudo-inverse operation, || a|| represents the mould of vectorial a, and SNR is for sending signal to noise ratio.
10. code device according to claim 8, is characterized in that,
Described matrix M meets formula:
Described matrix V is
Figure FDA00001899423200047
right eigenmatrix, k is the correlation matrix of the noise received of two adjacent time-slots, and described K meets K = I 0 0 &beta; 2 h dr h dr H + I , I is unit matrix;
Described matrix D is diagonal matrix, the element D on described diagonal matrix D diagonal iimeet:
D ii = 1 1 + SNR &lambda; i , i &le; rank ( H ~ ) 1 , i > rank ( H ~ ) , Wherein, the order of rank (.) representing matrix.λ ifor
Figure FDA000018994232000411
the characteristic value of arranging from big to small in i characteristic value, SNR is transmission signal to noise ratio.
11. code devices according to claim 10, is characterized in that,
Described second obtain subelement specifically for: adopt Plane Detecting Technique to obtain point of proximity until the sum of described point of proximity and extension point is more than or equal to preset value, p=1 along described steepest ascent direction; Adopt Plane Detecting Technique to obtain extension point along described steepest ascent direction, arrange
Figure FDA00001899423200051
described α 1with described α 2for two characteristic values of matrix Re (M), and α 2> α 1, when the sum of c>=20 or described point of proximity and extension point is more than or equal to preset value, no longer carry out obtaining of extension point; When c≤10, q=2; When 10 < c < 20, q=1.
12. code devices according to claim 8, is characterized in that, described assembled unit specifically for:
According to described default vector and index value corresponding relation, in described integer vectors candidate collection, select vector that m manipulative indexing value is less as real part vector candidate collection;
According to described default vector and index value corresponding relation, in described integer vectors candidate collection, select vector that n manipulative indexing value is less as imaginary part vector candidate collection;
Using the vector in described real part vector candidate collection as real part, the vector in described imaginary part vector candidate collection combines is combined into complex vector located as imaginary part respectively, obtains the complex vector located candidate collection of described complex vector located composition.
13. code devices according to claim 8, is characterized in that, described screening unit specifically for:
Vector in described complex vector located candidate collection is arranged according to corresponding index value order from small to large;
From described complex vector located candidate collection, select successively two different complex vector located, form matrix until described matrix is non-singular matrix, the transposed matrix of described non-singular matrix is described network code matrix.
Code device described in 14. according to Claim 8 to 13 any one claims, is characterized in that, described default vector and index value corresponding relation are:
When vectorial a is real number row vector, the index value C corresponding with described vectorial a meets a tre (M) a=C, a ttransposition for vectorial a;
When vectorial a is plural row vector, the index value C corresponding with described vectorial a meets Re (a) tre (M) Re (a)+Im (a) tre (M) Im (a)-2Re (a) tim (M) Im (a)=C, a tfor the transposition of vectorial a, Re (a) represents the real part of vectorial a, and Im (a) represents the imaginary part of vectorial a.
15. 1 kinds of network coding systems, is characterized in that, described network coding system comprises: two source device, a relay and a sink device;
Described network coding system also comprises code device described in claim 8 to 14 any one claim.
16. 1 kinds of network coding systems, is characterized in that, described network coding system comprises two source device, a relay and a sink device; Wherein, the device of any one in described source device, described relay and described sink device is code device described in claim 8 to 14 any one claim.
CN201210247408.XA 2012-07-17 2012-07-17 A kind of method of network code, apparatus and system Active CN103546237B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210247408.XA CN103546237B (en) 2012-07-17 2012-07-17 A kind of method of network code, apparatus and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210247408.XA CN103546237B (en) 2012-07-17 2012-07-17 A kind of method of network code, apparatus and system

Publications (2)

Publication Number Publication Date
CN103546237A true CN103546237A (en) 2014-01-29
CN103546237B CN103546237B (en) 2017-06-06

Family

ID=49969333

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210247408.XA Active CN103546237B (en) 2012-07-17 2012-07-17 A kind of method of network code, apparatus and system

Country Status (1)

Country Link
CN (1) CN103546237B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106647695A (en) * 2016-12-05 2017-05-10 航天恒星科技有限公司 Method and system for monitoring running state of on-orbit spacecraft
CN113497669A (en) * 2020-03-20 2021-10-12 华为技术有限公司 Method and device for transmitting coded data packet, electronic equipment and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080126908A1 (en) * 2006-07-25 2008-05-29 Communications Coding Corporation Universal error control coding system for digital communication and data storage systems
CN101409602A (en) * 2008-11-26 2009-04-15 北京邮电大学 Method for distributing ascent type encode vector in multicast network
CN101478814A (en) * 2009-01-08 2009-07-08 上海交通大学 Combined pre-coding and power distribution method in multicast network based on network coding
CN101697510A (en) * 2009-11-05 2010-04-21 华为技术有限公司 Method and device for transmitting uplink data
US20110007757A1 (en) * 2009-07-09 2011-01-13 Nec Laboratories America, Inc. Deterministic rotational coding

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080126908A1 (en) * 2006-07-25 2008-05-29 Communications Coding Corporation Universal error control coding system for digital communication and data storage systems
CN101409602A (en) * 2008-11-26 2009-04-15 北京邮电大学 Method for distributing ascent type encode vector in multicast network
CN101478814A (en) * 2009-01-08 2009-07-08 上海交通大学 Combined pre-coding and power distribution method in multicast network based on network coding
US20110007757A1 (en) * 2009-07-09 2011-01-13 Nec Laboratories America, Inc. Deterministic rotational coding
CN101697510A (en) * 2009-11-05 2010-04-21 华为技术有限公司 Method and device for transmitting uplink data

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106647695A (en) * 2016-12-05 2017-05-10 航天恒星科技有限公司 Method and system for monitoring running state of on-orbit spacecraft
CN113497669A (en) * 2020-03-20 2021-10-12 华为技术有限公司 Method and device for transmitting coded data packet, electronic equipment and storage medium
CN113497669B (en) * 2020-03-20 2023-07-11 华为技术有限公司 Method and device for transmitting coded data packet, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN103546237B (en) 2017-06-06

Similar Documents

Publication Publication Date Title
CN101039137B (en) Method and system for reducing codebook search-based precoding feedback bits of MIMO-OFDM system
CN109921882A (en) A kind of MIMO coding/decoding method, device and storage medium based on deep learning
CN103684700A (en) 3D (three-dimensional) MU-MIMO (multiple user-multiple input multiple output) precoding method based on orthogonal joint codebook set
CN102763345A (en) Apparatus and method for channel information feedback, base station receiving the channel information, and communication method of the base station
CN101036316A (en) Generalized m-rank beamformers for MIMO systems using successive quantization
EP2410707A1 (en) Space time coding method in orthogonal network and relay transmission system
CN101304300A (en) Method and device for quantizing multiuser MIMO system channel based on limiting feedback
JP5568373B2 (en) MIMO receiver signal detection method and apparatus
CN101783723B (en) Signal processing method, system and device of multi-antenna system
Che et al. Unsourced random massive access with beam-space tree decoding
CN111343730B (en) Large-scale MIMO passive random access method under space correlation channel
CN102208934A (en) Antenna selection method based on full cross weight genetic algorithm
CN102291810B (en) Open loop power control method and device
CN103546237A (en) Network coding method, network coding device and network coding system
CN104065462A (en) Signal transmitting and processing method for diversity gain in relay interference channel
CN106899530B (en) Antenna combination and modulation order joint optimization method based on threshold value
CN103607232A (en) Pre-coding optimization selection method based on interference alignment algorithm
CN107846464B (en) Multi-antenna Internet of things information transmission method
CN105027459A (en) Transmission method and device for transmitting channel state information
CN103248373B (en) Network coding method, relay device and screening plant
CN105376185A (en) Constant modulus blind equalization processing method based on optimization of DNA shuffled frog leaping algorithm in communication system
CN103825679A (en) 3D (3-Dimensional) MU-MIMO precoding method based on pseudo codebooks
CN110995330B (en) Antenna selection method based on grouping and EDAS algorithm
CN115065392A (en) Beam forming design method for realizing MISO downlink sum rate maximization under dirty paper coding condition
CN111342931B (en) Coding and decoding method and device for polarized multi-antenna generalized sequence number modulation system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant