CN103401657A - Non-differential distributed space-time coding method for cooperative communication partially-coherent network - Google Patents

Non-differential distributed space-time coding method for cooperative communication partially-coherent network Download PDF

Info

Publication number
CN103401657A
CN103401657A CN2013102883921A CN201310288392A CN103401657A CN 103401657 A CN103401657 A CN 103401657A CN 2013102883921 A CN2013102883921 A CN 2013102883921A CN 201310288392 A CN201310288392 A CN 201310288392A CN 103401657 A CN103401657 A CN 103401657A
Authority
CN
China
Prior art keywords
matrix
group
node
via node
signal
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.)
Pending
Application number
CN2013102883921A
Other languages
Chinese (zh)
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.)
China Jiliang University
Original Assignee
China Jiliang University
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 China Jiliang University filed Critical China Jiliang University
Priority to CN2013102883921A priority Critical patent/CN103401657A/en
Publication of CN103401657A publication Critical patent/CN103401657A/en
Pending legal-status Critical Current

Links

Images

Abstract

The invention relates to a cyclic unitary matrix group-based non-differential distributed space-time coding method applied to a cooperative communication partially-coherent network and belongs to the field of wireless communication. According to the method, a multi-hop communication system is derived based on a three-hop communication system model, can be mainly used for solving the problem that direct communication between two nodes cannot be realized caused by the fact that the channel status is not particularly excellent or due to communication distance, and can also be applied to adhoc networks. According to the method, a transmission codeword is constructed based on a cyclic diagonal unitary matrix group at a source node, and an optimal generated matrix is obtained by using a diversity sum method; a relay unitary matrix is constructed by using a generalized Hadamard matrix at a relay so as to lower the complexity of decoding calculation; and a decoding formula for partially-coherent distributed space-time codes in a three-hop communication model is finally obtained, and then, how to select the generated matrix to lower the complexity of decoding is obtained according to the formula. The method has the advantage that full diversity for a system can be realized due to the adoption of the cyclic group.

Description

The non-difference profile formula of a kind of collaboration communication partially coherent space-time coding method
Technical field
The invention belongs to the wireless mobile telecommunication technology field, relate generally to the non-difference profile formula space-time coding method based on circulation unitary matrice group in a kind of collaboration communication partially coherent network, it is not good especially can be used for channel status, perhaps, owing between communication distance two nodes, can not realizing the situation of direct communication, also can be applied to ad hoc network.
Background technology
With respect to wireline communication network, in cordless communication network, the movement of decline, multipath and node all will cause communication environment poor, and these have seriously affected communication quality and transmission rate.Studies have shown that, in wireless channel, adopt the MIMO technology can effectively improve data transmission rate and communication quality.But with regard to present technology, make mobile terminal be subject to the restriction of the aspects such as size own, power, realization, be difficult to many antennas of device on a mobile terminal, this has limited the practical application of MIMO technology to a certain extent.For this problem, (Yindi Jing and Babak Hassibi, Distributed space time coding in wireless relay networks, IEEE Trans Wireless commun., vol. 5, No 12, pp.3524-3536, Dec. 2006.) having proposed a kind of new mode collaboration communication (Cooperative Communication) technology obtains space diversity gain, for MIMO practical provides a new approach.Cooperative communication technology can be widely used in the multiple occasions such as cell mobile communication systems, Wireless Ad hoc network, WLAN (wireless local area network) and wireless sensor network.Adopting many coordination strategies at present is AF and DF.Wherein specifically propose a kind of distributed space time group coding technology, in literary composition, introduced the communication process of this technology.First stage, reflector sends to relaying by information, and the second stage relaying says that information sends to receiving terminal.The signal that relaying sends is to be obtained by the signal that receives and its conjugation linearity.This method is more general than AF, at the relaying place, does not need again as DF, to carry out decoding, and the relaying place does not need to know channel information, has saved time and power.The more important thing is, when high s/n ratio, can realize full diversity.Although distributed space-time code does not need to know channel information at the relaying place, at receiving terminal, need know that transmitting terminal is to relaying and all channel informations of being relayed to receiving terminal.So training sequence will send to relaying and transmitting terminal, sometimes because the cost on channel conditions more complicated or temporal power makes training sequence to realize.And that training sequence becomes when decline changes fast is very unactual.So (Y. Jing and H. Jafarkhani, Distributed Differential Space-Time Coding for Wireless Relay Networks, IEEE Trans. On Commun., vol. 56, No. 7, July 2008.) a kind of differential transmission scheme of wireless relay network has been proposed, this scheme does not need to know any channel information at relaying place and receiving terminal.The copy that can regard the sky time-code due to distributed space-time code as, so the copy that this distributed difference empty time-code is exactly the difference empty time-code.In literary composition, the author show that differential scheme is than relevant distributed space-time code poor 3dB on performance.
Above-mentioned technology all is based on receiving terminal and all knows that channel information or receiving terminal do not need to know any channel information.(T. Kiran and B. Sundar Rajan, Partially coherent distributed space time codes with differential encoder and decoder, IEEE JSAC., vol 25, no.2, pp. 426-433, Feb 2007.) a kind of partially coherent distributed space-time code proposed, destination node is not known the channel information of source node to relaying, but knows the channel information that is relayed to destination node.In literary composition, also proposed a kind of based on the circulation division algebra and can realize the differential coding and decoding scheme of full diversity.At the relaying place, adopt broad sense PSK code word to make the size of decoding complexity and code word irrelevant, and can realize full diversity.The Inspiration Sources of the method is in (Bertrand M. Hochwald and Wim Sweldens, " Differential Unitary Space-Time Modulation; " IEEE trans on communication., vol 48, no.12, pp.2041-2052, Dec 2000.), in literary composition, introduced a class difference diagonal signals at the tenth of the twelve Earthly Branches, this class diagonal signals has guaranteed to only have an antenna job at any one given time slot, and can realize diversity and reduce decoding complexity by the application transport antenna.As can be known according to document, unitary blank time code [12] [13]Be similar in form Space-Time Block Coding, that Hochwald and Marzetta derive out according to the channel capacity of rayleigh fading channel in information theory, it requires to send the code matrix is unitary matrice, and receiving terminal can carry out decoding in the situation that do not need to carry out channel estimating.But how the reasonable unitary blank time code of simple and effective structural behavior is a difficult point, and the unitary blank time code decoding complexity takes advantage of exponentially, therefore in actual environment, is difficult to application.Hochwald further promotes unitary blank time code, while having proposed a kind of differential west space, encodes, and is applied to continuous fading channel.Afterwards, Hughes is generalized to multi-antenna channel by the thought of unitary group code, provided Differential space-time modulation technology (the B. Hughes. Differential space-time modulation. IEEE Trans. on Ioform. Theory based on group code, 2000,46 (7): 2567-2578).Adopting the great advantage of differential space-time coding is that coding and decoding does not need channel condition information, but compares with non-differential coding the performance loss that 3dB is arranged, and this is also the cost without channel estimating.so, (Harshan J. and B. Sundar Rajan. A Non-differential Distributed Space-Time Coding for Partially-Coherent Cooperative Communication. IEEE Trans. on Wireless Commun, Vol. 7, No. 11, Nov. 2008) the empty time-code of a kind of non-difference profile formula with respect to differential coding has been proposed, the difficult point that has proposed structure partially coherent network design in literary composition is exactly the also column matrix full rank of getting two different matrixes from appointing the unitary matrice group of design, and drawn while only having the application cycle group and could realize full diversity, this makes the non-difference unitary matrice of any structure or a problem.
In the communication environment of reality, sometimes between two nodes, do not possess the condition of direct communication, communicating by letter of source node and destination node must rely on the forwarding repeatedly of a plurality of via nodes to realize, the multi-hop cooperation in Here it is collaboration communication.And the Ad hoc network that we know is a kind of multi-hop, acentric, ad hoc deployed wireless networks, and whole network does not have fixing infrastructure, and each node is mobile, and can dynamically keep in any way and the contacting of other node.
Summary of the invention
The present invention is directed to above-mentioned the deficiencies in the prior art, proposed the non-difference profile formula space-time coding method based on circulation unitary matrice group in a kind of collaboration communication partially coherent network, comprise the following steps:
(1) first stage, source node S is with transmitting power
Figure 331687DEST_PATH_IMAGE001
Transmit signals to via node
Figure 445136DEST_PATH_IMAGE002
, wherein the code word matrix of source node S consists of circulation unitary matrice group, via node Carry out to the received signal linear process at the tenth of the twelve Earthly Branches, and the model that receives is carried out to power normalization, be used for guaranteeing that the signal from via node sends can meet the Power Limitation condition;
(2) second stage is the space time collaboration stage, via node
Figure 656992DEST_PATH_IMAGE002
The signal message that will receive respectively sends to via node after linear process
(3) phase III, via node
Figure 330736DEST_PATH_IMAGE003
The signal message that receives is sent through linear transformation at the tenth of the twelve Earthly Branches again, use
Figure 477683DEST_PATH_IMAGE004
Represent this group via node
Figure 585577DEST_PATH_IMAGE005
The unitary transformation matrix at individual via node place, and, carry out to the received signal the normalization of power, be used for guaranteeing that the signal from via node sends can meet the Power Limitation condition, the signal message after processing is sent to destination node
Figure 767160DEST_PATH_IMAGE006
(4) fourth stage, destination node
Figure 284729DEST_PATH_IMAGE006
The signal message that receives is carried out to condition maximum likelihood decoding under the partially coherent network state, and decode results is carried out to demodulation.
Further, the code word matrix that consists of circulation unitary matrice group in the described source node S of step (1), namely meet Finite Abel ian group,
Figure 184552DEST_PATH_IMAGE007
Be
Figure 750662DEST_PATH_IMAGE008
The set of individual different unitary matrice, that is:
Figure 849068DEST_PATH_IMAGE009
, and
Figure 475222DEST_PATH_IMAGE010
, meeting this group is cyclic group, and each element of trooping in closing is diagonal unitary, and source node is according to formula
Figure 659078DEST_PATH_IMAGE011
Build the source node signal matrix, For column vector, can be expressed as
Figure 185055DEST_PATH_IMAGE013
, sending metrix can be expressed as
Figure 44426DEST_PATH_IMAGE014
.
Further, the parameter matrix in described sending metrix code word
Figure 653262DEST_PATH_IMAGE015
Can according to diversity and selection criterion select.
Further, the channel model described in step (1) is one easy three and jumps the collaboration communication model, comprises Individual node, one of them source node, a destination node,
Figure 634174DEST_PATH_IMAGE017
Individual via node, assist source node communication.Wherein Be the number of the first jumping via node,
Figure 760578DEST_PATH_IMAGE019
Be the number of the second jumping via node, in this model, source node lacks tie link between destination node.
Further, the linear process matrix at the tenth of the twelve Earthly Branches described in step (1) and step (2) is based on broad sense Butson-Hadamard matrix and builds this junction matrix and can realize full diversity, matrix It is one
Figure 665266DEST_PATH_IMAGE021
Broad sense Butson-Hadamard matrix, utilize matrix
Figure 804124DEST_PATH_IMAGE022
Build diagonal unitary
Figure 121973DEST_PATH_IMAGE023
, make
Figure 699584DEST_PATH_IMAGE024
, wherein each diagonal element
Figure 684858DEST_PATH_IMAGE025
It is matrix
Figure 56934DEST_PATH_IMAGE022
In
Figure 862078DEST_PATH_IMAGE026
Row
Figure 915485DEST_PATH_IMAGE005
The element of row.
Further, the destination node described in step (4) The signal message that receives is carried out to condition maximum likelihood decoding under the partially coherent network state, the signal that destination node will receive is delivered in demodulator and is carried out demodulation, namely according to constellation set, signal is carried out to inverse mapping, and demodulation result is merged into and receives information.
Advantage of the present invention comprises:
1) adopt cyclic group can realize full diversity;
2) adopt the diagonal unitary coding can under the high s/n ratio condition, obtain good performance;
3) adopt non-differential coding to improve 3dB than differential coding performance;
4) the collaboration communication model is jumped in research three has deep meaning for the further investigation multihop system;
5) in the invention, according to diversity and criterion, carry out the performance that choosing of optimal constellation is conducive to system.
The accompanying drawing explanation
Fig. 1 is the system model figure of simple and easy three jumping communication networks;
Fig. 2 is signal transmission block diagram of the present invention;
Fig. 3 is the performance simulation comparison diagram of two kinds of system models in identical modulation 16QAM and identical unitary matrice parameter matrix situation;
Fig. 4 is under identical modulation 16QAM, the performance simulation comparison diagram that different unitary matrice parameter matrixs are chosen.
Fig. 5 is under identical modulation 16QAM and in identical unitary matrice parameter matrix situation, and non-difference three is jumped the performance simulation comparison diagram of communication system and difference three jumping communication systems.
Embodiment
The invention will be further described below in conjunction with accompanying drawing.
As Figure 1-5, the non-difference profile formula of collaboration communication partially coherent of the present invention space-time coding method, comprise the steps:
Whole communication process can be divided into three phases.At first stage, source node is with transmitting power
Figure 298242DEST_PATH_IMAGE001
Transmit signals to via node .
Figure 510098DEST_PATH_IMAGE026
The signal indication that individual via node place receives is as follows:
Figure 469963DEST_PATH_IMAGE027
(1)
Wherein,
Figure 183841DEST_PATH_IMAGE028
Be one in the Power Limitation condition
Figure 963579DEST_PATH_IMAGE029
Under
Figure 421105DEST_PATH_IMAGE030
The transmission data vector of dimension, wherein ,
Figure 120256DEST_PATH_IMAGE032
Represent the Frobenius norm, without loss of generality, the channel of suppose relay node has symmetry, namely for
Figure 387290DEST_PATH_IMAGE033
, Represent source node and
Figure 317385DEST_PATH_IMAGE002
Channel gain between individual via node.
Second stage, via node
Figure 310749DEST_PATH_IMAGE002
The signal message that will receive respectively sends to via node after linear process
Figure 133255DEST_PATH_IMAGE003
.In this paper, so via node does not need information to the received signal to carry out decode operation, just it carried out to power amplification or replace to the received signal or the simple linear operation such as linear transformation at the tenth of the twelve Earthly Branches, we adopt linear transformation at the tenth of the twelve Earthly Branches to it herein.With
Figure 135846DEST_PATH_IMAGE035
Expression the
Figure 659231DEST_PATH_IMAGE026
The unitary transformation matrix at individual via node place.And we need to carry out the normalization of power to the received signal, are used for guaranteeing that the signal from via node sends can meet the Power Limitation condition.This is carried out to normalized and just can guarantee that the average transmit power of each symbol is later
Figure 885813DEST_PATH_IMAGE036
.The later signal of linear process at the tenth of the twelve Earthly Branches is
Figure 127439DEST_PATH_IMAGE037
, wherein
Figure 730458DEST_PATH_IMAGE038
For each relaying average transmit power, the signal message after processing is sent to
Figure 108350DEST_PATH_IMAGE003
.
So at via node
Figure 709096DEST_PATH_IMAGE003
The signal that place receives can be expressed as
Figure 234755DEST_PATH_IMAGE039
Figure 579149DEST_PATH_IMAGE040
(2)
In formula, equivalent channel is
Figure 873864DEST_PATH_IMAGE041
,
Figure 645511DEST_PATH_IMAGE042
,
Figure 596149DEST_PATH_IMAGE043
For via node
Figure 540971DEST_PATH_IMAGE003
The noise vector at place, and
Figure 893455DEST_PATH_IMAGE044
For the additive white Gaussian noise of this Nodes, it has comprised from via node
Figure 898320DEST_PATH_IMAGE002
The noise that place forwards and the noise of this Nodes itself.So we finally are chosen as linear transformation at the tenth of the twelve Earthly Branches to the linear transformation of relaying Nodes is in order to guarantee noise
Figure 336255DEST_PATH_IMAGE044
Between property independent of one another.Code word matrix in formula
Figure 22451DEST_PATH_IMAGE045
, at this, embodied the effect of distributed space-time code.The somewhat similar multiple-antenna MIMO system of delivery form in this stage.
Phase III, via node
Figure 291758DEST_PATH_IMAGE003
The signal message that receives is sent through linear transformation at the tenth of the twelve Earthly Branches again, use
Figure 405208DEST_PATH_IMAGE004
Represent this group via node
Figure 392756DEST_PATH_IMAGE005
The unitary transformation matrix at individual via node place.And we also need to carry out to the received signal the normalization of power at this, are used for guaranteeing that the signal from via node sends can meet the Power Limitation condition.Signal after linear transformation at the tenth of the twelve Earthly Branches can be expressed as , wherein
Figure 944140DEST_PATH_IMAGE047
Organize for this reason each relaying in via node average transmit power, the signal message after processing is sent to destination node
Figure 25228DEST_PATH_IMAGE006
.
We are in destination node so
Figure 437755DEST_PATH_IMAGE006
The signal that receives can be expressed as
(3)
Equivalence conversion according to matrix, can change into following formula
Figure 164905DEST_PATH_IMAGE050
Figure 427577DEST_PATH_IMAGE052
(4)
In formula,
Figure 791562DEST_PATH_IMAGE053
,
Figure 417715DEST_PATH_IMAGE054
,
，
Figure 971373DEST_PATH_IMAGE056
，
Figure 127548DEST_PATH_IMAGE057
，
Figure 168011DEST_PATH_IMAGE058
Junction matrix in above-mentioned (3) formula
Figure 839164DEST_PATH_IMAGE059
,
Figure 747077DEST_PATH_IMAGE060
For unitary matrice, and random vector
Figure 757758DEST_PATH_IMAGE061
,
Figure 788031DEST_PATH_IMAGE062
With
Figure 884163DEST_PATH_IMAGE063
All Gaussian distributed, and separate.Suppose that the first via node number is the same with the second relay point number, namely
Figure 658084DEST_PATH_IMAGE064
.
So it is as follows to obtain the covariance matrix of relevant additive noise:
Figure 523272DEST_PATH_IMAGE065
(5)
Because this paper is based on the partially coherent network, so the hypothesis goal node is only known With
Figure 307874DEST_PATH_IMAGE067
But do not know
Figure 823169DEST_PATH_IMAGE068
Relevant information.We can draw thus:
Figure 605180DEST_PATH_IMAGE069
Figure 914939DEST_PATH_IMAGE070
············································· (6)
Owing in literary composition, having supposed
Figure 47980DEST_PATH_IMAGE071
So, have,
Figure 101387DEST_PATH_IMAGE072
(7)
Order , (5) formula, (7) formula substitution (6) formula can be expressed as the covariance matrix that receives signal:
······················································ (8)
In formula , and meet
Figure 695999DEST_PATH_IMAGE076
.
Finally, can obtain the conditional probability density function under the partially coherent network, be expressed as follows:
Figure 390286DEST_PATH_IMAGE077
(9)
At receiving terminal, with maximum likelihood, carry out decoding, can show that the decoding of partially coherent distributed space-time code can be expressed as
Figure 307426DEST_PATH_IMAGE078
(10)
According to matrix inversion lemma, if matrix
Figure 149480DEST_PATH_IMAGE079
, be nonsingular matrix, matrix
Figure 544689DEST_PATH_IMAGE080
, matrix
Figure 421379DEST_PATH_IMAGE081
Have inverse matrix: .And equivalent formula
Figure 510874DEST_PATH_IMAGE083
, can obtain
Figure 772091DEST_PATH_IMAGE084
(11)
Formula (10) abbreviation is
Figure 440970DEST_PATH_IMAGE085
(12)
Wherein introduce the distributed space-time code based on circulation unitary matrice group
At the source node place, adopt circulation unitary matrice group to build the transmission code word matrix, this element in trooping and closing meets closure, associativity in matrix multiplication operation, and has identity element, and any element in matrix all has inverse element.Element in this set also meets law of communication on this basis, and namely code word matrix is Finite Abel ian group.
If Be
Figure 250980DEST_PATH_IMAGE008
The set of individual different unitary matrice, that is: .
Building one has
Figure 573694DEST_PATH_IMAGE008
The simplest method of commutative group of individual element builds cyclic group exactly, namely .
Figure 307481DEST_PATH_IMAGE088
For generator matrix, and be diagonal matrix, can be expressed as
(13)
In group, arbitrary element can be expressed as:
(14)
Source node will The information of bit is mapped to
Figure 358340DEST_PATH_IMAGE093
Certain matrix in set.Can application of formula when without loss of generality, we build circular matrix
Figure 499471DEST_PATH_IMAGE094
(15)
Herein
Figure 997448DEST_PATH_IMAGE095
, so
Figure 769095DEST_PATH_IMAGE096
.Because system only has a source node, so establish For column vector, can be expressed as .
Sending metrix can be expressed as
Figure 79357DEST_PATH_IMAGE099
(16)
In order to obtain better systematic function, we need to obtain best parameter
Figure 21905DEST_PATH_IMAGE100
, obtaining optimal constellation, the constellation parameter group is designated as vector .
Without loss of generality, order
Figure 942774DEST_PATH_IMAGE102
, according to following criterion, select herein
(17)
In formula,
Figure 591110DEST_PATH_IMAGE104
, in order to make
Figure 516340DEST_PATH_IMAGE105
With singular value
Figure 802965DEST_PATH_IMAGE106
Be associated, first define one Be designated as the average of these singular values square, namely
Figure 211130DEST_PATH_IMAGE108
, like this,
Figure 623657DEST_PATH_IMAGE109
.For given fixedly mean value
Figure 651655DEST_PATH_IMAGE107
, error probability equates in singular value, while namely unanimously distributing, reaches minimum.Therefore, when producing parameter, if two groups have identical
Figure 895555DEST_PATH_IMAGE105
, should select to have how conforming that group parameter.
Source node will Signal message send to each via node, to it, carry out after linear process, sending to the tenth of the twelve Earthly Branches the second via node after the first via node acknowledge(ment) signal information.
Now design the unitary matrice at the first via node place
Figure 47368DEST_PATH_IMAGE111
.
With broad sense Butson-Hadamard matrix, build this junction matrix and can realize full diversity.For broad sense Butson-Hadamard matrix, must meet
Figure 613478DEST_PATH_IMAGE112
, wherein
Figure 915147DEST_PATH_IMAGE113
Be
Figure 400355DEST_PATH_IMAGE114
Matrix, its element meets
Figure 787473DEST_PATH_IMAGE115
.
Establish herein
Figure 157275DEST_PATH_IMAGE022
It is one
Figure 110187DEST_PATH_IMAGE116
Broad sense Butson-Hadamard matrix, we utilize matrix
Figure 907242DEST_PATH_IMAGE022
Build diagonal unitary
Figure 578395DEST_PATH_IMAGE111
, make
Figure 751887DEST_PATH_IMAGE117
, wherein each diagonal element
Figure 762569DEST_PATH_IMAGE118
It is matrix In
Figure 888974DEST_PATH_IMAGE026
Row
Figure 662894DEST_PATH_IMAGE005
The element of row.
The first via node will
Figure 528082DEST_PATH_IMAGE119
Vector Send to the second via node, namely above said in formula (2) , be designated as here
Figure 627569DEST_PATH_IMAGE123
(18)
Here
Figure 937328DEST_PATH_IMAGE124
.
We are also with identical method design the second intermediate matrix simultaneously
Figure 70369DEST_PATH_IMAGE125
, order is established herein
Figure 123775DEST_PATH_IMAGE126
It is one
Figure 963555DEST_PATH_IMAGE116
Broad sense Butson-Hadamard matrix, we utilize matrix
Figure 506532DEST_PATH_IMAGE126
Build diagonal unitary
Figure 798973DEST_PATH_IMAGE125
, make
Figure 718388DEST_PATH_IMAGE127
, wherein each diagonal element
Figure 412674DEST_PATH_IMAGE128
It is matrix
Figure 126552DEST_PATH_IMAGE126
In
Figure 171869DEST_PATH_IMAGE026
Row
Figure 629395DEST_PATH_IMAGE005
The element of row., the second via node will
Figure 178188DEST_PATH_IMAGE129
Send to destination node, namely obtain in literary composition in (4) formula
Figure 328546DEST_PATH_IMAGE130
,
Figure 595580DEST_PATH_IMAGE131
Figure 856797DEST_PATH_IMAGE132
(19)
In formula
Figure 260096DEST_PATH_IMAGE133
.

Claims (6)

1. the non-difference profile formula space-time coding method based on circulation unitary matrice group in a collaboration communication partially coherent network comprises the following steps:
(1) first stage, source node S is with transmitting power
Figure 506576DEST_PATH_IMAGE001
Transmit signals to via node
Figure 346356DEST_PATH_IMAGE002
, wherein the code word matrix of source node S consists of circulation unitary matrice group, via node
Figure 889333DEST_PATH_IMAGE002
Carry out to the received signal linear process at the tenth of the twelve Earthly Branches, and the model that receives is carried out to power normalization, be used for guaranteeing that the signal from via node sends can meet the Power Limitation condition;
(2) second stage is the space time collaboration stage, via node
Figure 181774DEST_PATH_IMAGE002
The signal message that will receive respectively sends to via node after linear process
(3) phase III, via node
Figure 795475DEST_PATH_IMAGE003
The signal message that receives is sent through linear transformation at the tenth of the twelve Earthly Branches again, use
Figure 447036DEST_PATH_IMAGE004
Represent this group via node
Figure 554670DEST_PATH_IMAGE005
The unitary transformation matrix at individual via node place, and, carry out to the received signal the normalization of power, be used for guaranteeing that the signal from via node sends can meet the Power Limitation condition, the signal message after processing is sent to destination node
Figure 949879DEST_PATH_IMAGE006
(4) fourth stage, destination node The signal message that receives is carried out to condition maximum likelihood decoding under the partially coherent network state, and decode results is carried out to demodulation.
2. the non-difference profile formula space-time coding method based on circulation unitary matrice group in collaboration communication partially coherent network as claimed in claim 1, it is characterized in that: the code word matrix that is formed by circulation unitary matrice group in the described source node S of step (1), namely meet Finite Abel ian group
Figure 649031DEST_PATH_IMAGE007
Be
Figure 978381DEST_PATH_IMAGE008
The set of individual different unitary matrice, that is:
Figure 911702DEST_PATH_IMAGE009
, and
Figure 580580DEST_PATH_IMAGE010
, meeting this group is cyclic group, and each element of trooping in closing is diagonal unitary, and source node is according to formula
Figure 901840DEST_PATH_IMAGE011
Build the source node signal matrix, For column vector, can be expressed as
Figure 393182DEST_PATH_IMAGE013
, sending metrix can be expressed as
Figure 978884DEST_PATH_IMAGE014
.
3. the non-difference profile formula space-time coding method based on circulation unitary matrice group in collaboration communication partially coherent network as claimed in claim 2, is characterized in that: the parameter matrix in described sending metrix code word
Figure 143149DEST_PATH_IMAGE015
Can according to diversity and selection criterion select.
4. the non-difference profile formula space-time coding method based on circulation unitary matrice group in collaboration communication partially coherent network as claimed in claim 1 is characterized in that: the channel model described in step (1) is one easy three and jumps the collaboration communication models, comprises
Figure 447091DEST_PATH_IMAGE016
Individual node, one of them source node, a destination node,
Figure 987794DEST_PATH_IMAGE017
Individual via node, assist source node communication;
Wherein
Figure 365686DEST_PATH_IMAGE018
Be the number of the first jumping via node,
Figure 28748DEST_PATH_IMAGE019
Be the number of the second jumping via node, in this model, source node lacks tie link between destination node.
5. the non-difference profile formula space-time coding method based on circulation unitary matrice group in collaboration communication partially coherent network as claimed in claim 1, it is characterized in that: the linear process matrix at the tenth of the twelve Earthly Branches described in step (1) and step (2) is based on broad sense Butson-Hadamard matrix and builds this junction matrix and can realize full diversity, matrix
Figure 492091DEST_PATH_IMAGE020
It is one
Figure 836484DEST_PATH_IMAGE021
Broad sense Butson-Hadamard matrix, utilize matrix
Figure 396779DEST_PATH_IMAGE022
Build diagonal unitary
Figure 902846DEST_PATH_IMAGE023
, make
Figure 119064DEST_PATH_IMAGE024
, wherein each diagonal element
Figure 63886DEST_PATH_IMAGE025
It is matrix In
Figure 93339DEST_PATH_IMAGE026
Row
Figure 593591DEST_PATH_IMAGE005
The element of row.
6. the non-difference profile formula space-time coding method based on circulation unitary matrice group in collaboration communication partially coherent network as claimed in claim 1, is characterized in that: the destination node described in step (4) The signal message that receives is carried out to condition maximum likelihood decoding under the partially coherent network state, the signal that destination node will receive is delivered in demodulator and is carried out demodulation, namely according to constellation set, signal is carried out to inverse mapping, and demodulation result is merged into and receives information.
CN2013102883921A 2013-07-10 2013-07-10 Non-differential distributed space-time coding method for cooperative communication partially-coherent network Pending CN103401657A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2013102883921A CN103401657A (en) 2013-07-10 2013-07-10 Non-differential distributed space-time coding method for cooperative communication partially-coherent network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2013102883921A CN103401657A (en) 2013-07-10 2013-07-10 Non-differential distributed space-time coding method for cooperative communication partially-coherent network

Publications (1)

Publication Number Publication Date
CN103401657A true CN103401657A (en) 2013-11-20

Family

ID=49565197

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2013102883921A Pending CN103401657A (en) 2013-07-10 2013-07-10 Non-differential distributed space-time coding method for cooperative communication partially-coherent network

Country Status (1)

Country Link
CN (1) CN103401657A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103916219A (en) * 2014-04-14 2014-07-09 山东大学 Estimate-and-forward relay transmission method based on unitary space-time modulation
CN106454752A (en) * 2015-08-06 2017-02-22 北京信威通信技术股份有限公司 Broadcast information transmission method in 3GPP V2X communication
CN106686724A (en) * 2015-11-05 2017-05-17 北京信威通信技术股份有限公司 Cooperative diversity application method in 3GPP V2X
CN109493274A (en) * 2018-10-18 2019-03-19 华南农业大学 A kind of scalloping processing method based on coordinate conversion

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
BERTRAND M. HOCHWALD等: "Systematic Design of Unitary Space-Time Constellations", 《IEEE TRANSACTIONS ON INFORMATION THEORY》 *
HARSHAN J,RAJAN B S: "A Non-differential Distributed Space-Time Coding for Partially-Coherent Cooperative Communication", 《IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS》 *
邓卫华，高西奇: "三跳协同分集系统及空时编码的应用", 《东南大学学报》 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103916219A (en) * 2014-04-14 2014-07-09 山东大学 Estimate-and-forward relay transmission method based on unitary space-time modulation
CN106454752A (en) * 2015-08-06 2017-02-22 北京信威通信技术股份有限公司 Broadcast information transmission method in 3GPP V2X communication
CN106686724A (en) * 2015-11-05 2017-05-17 北京信威通信技术股份有限公司 Cooperative diversity application method in 3GPP V2X
CN106686724B (en) * 2015-11-05 2020-04-24 北京信威通信技术股份有限公司 Cooperative diversity application method in 3GPP V2X
CN109493274A (en) * 2018-10-18 2019-03-19 华南农业大学 A kind of scalloping processing method based on coordinate conversion
CN109493274B (en) * 2018-10-18 2020-12-11 华南农业大学 Image distortion processing method based on coordinate transformation

Similar Documents

Publication Publication Date Title
Serafimovski et al. Dual-hop spatial modulation (Dh-SM)
CN102694628B (en) Interference suppression method for multi-user MIMO collaborative relay system
Xu et al. On the performance of two‐way relay channels using space–time codes
Xie et al. Spatial modulation in two-way network coded channels: Performance and mapping optimization
Narayanan et al. Distributed space shift keying for the uplink of relay-aided cellular networks
Som et al. End-to-end BER analysis of space shift keying in decode-and-forward cooperative relaying
CN102739383A (en) Method for allocating union resource based on limited feedback OFDM-AF (Orthogonal Frequency Division Multiplexing-Audio Frequency) system
CN103401657A (en) Non-differential distributed space-time coding method for cooperative communication partially-coherent network
Yiu et al. Distributed space-time block coding for cooperative networks with multiple-antenna nodes
Wei et al. Design of generalized analog network coding for a multiple-access relay channel
CN103516484A (en) Orthogonality difference space-time network coding method of double-direction relay channel model
CN104066141B (en) A kind of collaborative communication method and system based on full space-time network code
Verde Performance analysis of randomised space–time block codes for amplify‐and‐forward cooperative relaying
Kumar et al. Physical-layer network coding with multiple antennas: An enabling technology for smart cities
Waqar et al. On the ergodic capacities of decode‐and‐forward MIMO relay network with simultaneous wireless information and power transfer
CN105337703B (en) A kind of frequency overturning transmission method of full diversity in cooperation communication system
Liu et al. Symbol error rate analysis and power allocation for adaptive relay selection schemes
Elazreg et al. Distributed one bit feedback extended orthogonal space time coding based on selection of cyclic rotation for cooperative relay networks
CN103051427B (en) Duplex wireless relay communication method based on network coding
Surendar et al. Symbol error rate of QO‐STBC based decode‐and‐forward cooperative communication system over generalised–and–fading channels
Ji et al. A new differential space-time modulation scheme based on weyl group
Chin et al. Sequential slotted amplify-decode-and-forward
Joung et al. Phase rotation and link selection methods for DSTTD-based two-path relay systems
Li et al. On the performance of multi-way relay communications via complex field network coding
Ge et al. Relay selection in distributed transmission based on the Golden code using ML and sphere decoding in wireless networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20131120

RJ01 Rejection of invention patent application after publication