Nothing Special   »   [go: up one dir, main page]

CN104270235A - Data transmission method of transceiver under two-cell multi-user two-hop network - Google Patents

Data transmission method of transceiver under two-cell multi-user two-hop network Download PDF

Info

Publication number
CN104270235A
CN104270235A CN201410473162.7A CN201410473162A CN104270235A CN 104270235 A CN104270235 A CN 104270235A CN 201410473162 A CN201410473162 A CN 201410473162A CN 104270235 A CN104270235 A CN 104270235A
Authority
CN
China
Prior art keywords
time slot
node
data
via node
utilize
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
CN201410473162.7A
Other languages
Chinese (zh)
Other versions
CN104270235B (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.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
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 Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN201410473162.7A priority Critical patent/CN104270235B/en
Publication of CN104270235A publication Critical patent/CN104270235A/en
Application granted granted Critical
Publication of CN104270235B publication Critical patent/CN104270235B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0048—Allocation of pilot signals, i.e. of signals known to the receiver
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H04B7/0456—Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/0202—Channel estimation

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Power Engineering (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to the technical field of communications, and discloses a data transmission method of a transceiver under a two-cell multi-user two-hop network. The data transmission method comprises the steps that in different time slots, a server controls source node groups to conduct data transmitting alternately and adjusts the sequence according to which a half-duplex relay node transmits and receives the data sent by the source node groups according to the differences between the source node groups which transmit the data in different time slots, the relay node obtains local channel state information of itself through channel estimation, and pilot symbols which are subject to pre-coding processing are transmitted while data forwarding is conducted; a target node decodes expected data according to an equivalent channel matrix obtained through estimation. By the adoption of the method, the source node groups, the relay node and the target node do not need to know global channel information, the calculation complexity of the target node can be reduced when the specified degree of freedom is reached by using the local channel information, and better degree-of-freedom performance can be obtained by using more time slot resources.

Description

The data transmission method of transceiver under a kind of two community multi-user's Two-Hops
Technical field
The present invention relates to communication technical field, particularly the data transmission method of transceiver under a kind of two community multi-user's Two-Hops.
Background technology
Along with the development of the communication technology, the great significance for design of the relay transport protocol under two community multi-user's Two-Hops.
Current scheme comprises: for two community multi-user's Two-Hops, has M single-antenna subscriber and relaying and destination node all configure M root antenna in each source node group, and the degree of freedom number that current relay transport protocol can reach is when via node does not have any overall CSI, the decoding complex degree of destination node is higher; When via node only has the overall CSI of the first jumping, the decoding complex degree of destination node can be reduced.
But after existing relay transport protocol two via nodes need to obtain the channel condition information CSI of the first hop channel by channel estimating, CSI each other alternately, when two via nodes are provided with the overall CSI of the first jumping, could realize the individual normalization degree of freedom, and existing relay transport protocol only can realize the individual normalization degree of freedom, and the decoding complex degree of destination node is higher.
Summary of the invention
(1) technical problem solved
The technical problem that the present invention solves is: the decoding complex degree how reducing destination node obtaining and specify the degree of freedom while, improves the normalization degree of freedom in addition.
(2) technical scheme
The invention provides the data transmission method of transceiver under a kind of two community multi-user's Two-Hops, the method comprises the following steps:
At different time slots, server controls source node group hocket data send, and according to sending the difference of source node group of data at different time-gap, adjustment half-duplex via node sends the transmitting-receiving order of data to described source node group, multiple single-antenna subscriber composition in described source node Zu Youliangge community;
Described half-duplex via node obtains the local channel state information of oneself by channel estimating;
Described half-duplex via node generates the frequency pilot sign of described half-duplex via node according to described local channel state information, and is sent to destination node by the data of described frequency pilot sign insertion current transmission;
Destination node extracts the described frequency pilot sign received in data, and carry out equivalent channel matrix estimation according to described frequency pilot sign, the described equivalent channel matrix according to estimating decodes expected data.
Further, described method two destination nodes comprising two groups of source node groups, two half-duplex via nodes and be made up of base station; Wherein, S irepresent source node group i, i ∈ { 1,2}, R lrepresent the via node l of configuration M root antenna, l ∈ { 1,2}, D irepresent the destination node i with M root antenna, S iin have M single-antenna subscriber, in a kth time slot, S iby via node R lto the destination node D of its correspondence itransmission data s [k].
Further, described server controls source node group carries out data transmission, and according to sending the difference of source node group of data at different time-gap, adjustment half-duplex via node sends the transmitting-receiving order of data to described source node group, specifically comprise:
In the 1st time slot, two via node R 1and R 2all receive source node group S 1to the data s that two via nodes send [1], two via node R 1and R 2the signal received is respectively:
r [1][1]＝Η [1,1][1]s [1]+z [1]，
r [2][1]＝Η [2,1][1]s [1]+z [2]，
Wherein, r [l][k] represents via node R lthe signal received in a kth time slot, Η [l, i][k] is source node group S in a kth time slot ito via node R lchannel matrix, z [l]for via node R lnoise vector, because noise does not affect the calculating of the degree of freedom, in follow-up formula, all ignore noise item;
After the end of transmission of the 1st time slot, via node R 1and R 2utilize ZF decoding matrix Η respectively [1,1][1] -1with Η [2,1][1] -1calculate, obtain s [1].
Further, described server controls source node group carries out data transmission, and according to sending the difference of source node group of data at different time-gap, adjustment half-duplex via node sends the transmitting-receiving order of data to described source node group, also comprise:
In the 2nd time slot, R 1carry out sending and R 2receive, R 1transmit the 1st the data s that slot decoder goes out [1], source node group S simultaneously 2transmit data s [2], described via node R 2the data received, are expressed as follows:
r [2][2]＝F [2,1][2]s [1]+Η [2,2][2]s [2]，
Wherein, F [2,1][k] is R in a kth time slot 1to R 2channel matrix;
At via node R 2, be constructed as follows matrix equation:
Wherein, Η [2,1][1], F [2,1][2] and Η [2,2]the non-singular matrix of [2] to be all order be M, for its equivalent matrix, order is 2M;
Described via node R 2utilize ZF decoding matrix calculate, obtain s [1]and s [2].
Further, described method also comprises:
According to via node R 2at the 1st s that time slot has obtained [1], utilize r [2][2]-F [2,1][2] s [1]eliminate r [2][2] s in [1]the interference brought, concrete formula is:
r [2][2]-F [2,1][2]s [1]＝Η [2,2][2]s [2]；
Described via node R 2utilize ZF decoding matrix Η [2,2][2] -1calculate, obtain s [2].
Further, the described equivalent channel matrix that described basis estimates decodes expected data and specifically comprises:
In the 2nd time slot, destination node D 1and D 2receive the data that via node sends, the data received are respectively
y [1][2]＝G [1,1][2]s [1]，
y [2][2]＝G [2,1][2]s [1]，
Wherein, y [i][k] is destination node D in a kth time slot ithe data received, G [i, l][k] is via node R in a kth time slot lto destination node D ichannel matrix;
Destination node D 1and D 2utilize ZF decoding matrix G respectively [1,1][2] -1with G [2,1][2] -1calculate, obtain s [1].
Further, described server controls source node group carries out data transmission, and according to sending the difference of source node group of data at different time-gap, adjustment half-duplex via node sends the transmitting-receiving order of data to described source node group, also comprise:
In the 3rd time slot, via node R 2carry out sending and R 1receive, R 2transmission s [2], source node group S simultaneously 1transmit data s [3], in the 3rd time slot, via node R 1the signal received can be expressed as:
r [1][3]＝F [1,2][3]s [2]+Η [1,1][3]s [3]，
Wherein, F [1,2][k] is R in a kth time slot 2to R 1channel matrix;
In the 3rd time slot, R 2to destination node D 2send s [2];
In the 4th time slot, via node R 1carry out sending and R 2receive, R 1transmit the signal r that the 3rd time slot receives [1][3], source node group S while 2transmit data s [4], in the 4th time slot, via node R 2the signal received can be expressed as:
r [2][4]＝F [2,1][4]r [1][3]+Η [2,2][4]s [4]
＝F [2,1][4](F [1,2][3]s [2]+Η [1,1][3]s [3])+Η [2,2][4]s [4]；
In the 5th time slot, via node R 2carry out sending and R 1receive, R 2transmit the signal r that the 4th time slot receives [2][4], source node group S while 1transmit data s [5], in the 5th time slot, via node R 1the signal received can be expressed as:
r [1][5]＝F [1,2][5]r [2][4]+Η [1,1][5]s [5]
＝F [1,2][5]F [2,1][4]F [1,2][3]s [2]+F [1,2][5]F [2,1][4]Η [1,1][3]s [3]+Η [1,1][5]s [5]；
At the 6th time slot, via node R 1carry out sending and R 2receive, R 1transmit the signal r that the 5th time slot receives [1][5], source node group S while 2transmit data s [6];
Utilize nibbling method, at different time slots, via node carries out the transmitting-receiving of data successively.
Further, the described equivalent channel matrix that described basis estimates decodes expected data and also comprises:
At the 3rd time slot, two destination node D 1and D 2the signal received can be expressed as:
y [1][3]＝G [1,2][3]s [2]，
y [2][3]＝G [2,2][3]s [2]，
Destination node D 1and D 2utilize ZF decoding matrix G respectively [1,2][3] -1and G [2,2][3] -1s can be obtained [2];
At the 4th time slot, two destination node D 1and D 2the signal received can be expressed as:
y [1][4]＝G [1,1][4]r [1][3]＝G [1,1][4](F [1,2][3]s [2]+Η [1,1][3]s [3])，
y [2][4]＝G [2,1][4]r [1][3]＝G [2,1][4](F [1,2][3]s [2]+Η [1,1][3]s [3])，
Destination node D 1utilize y [1][3] and y [1][4] matrix equation is constructed as follows:
Wherein, equivalent channel matrix order be 2M;
Destination node D 1utilize ZF decoding matrix calculate, obtain s [3];
For destination node D 2, utilize destination node D 1coding/decoding method obtain s [3];
At the 5th time slot, two destination node D 1and D 2the signal received can be expressed as:
y [1][5]＝G [1,2][5]r [2][4]
＝G [1,2][5](F [2,1][4]F [1,2][3]s [2]+F [2,1][4]Η [1,1][3]s [3]+Η [2,2][4]s [4])：
y [2][5]＝G [2,2][5]r [2][4]
＝G [2,2][5](F [2,1][4]F [1,2][3]s [2]+F [2,1][4]Η [1,1][3]s [3]+Η [2,2][4]s [4])：
Destination node D 1utilize y [1][3], y [1][4] and y [1][5] matrix equation is constructed as follows:
Wherein, equivalent channel matrix order be 3M;
Destination node D 1utilize ZF decoding matrix calculate, obtain s [4];
For destination node D 2, utilize destination node D 1coding/decoding method obtain s [4];
At the 6th time slot, destination node D 1and D 2utilize corresponding ZF decoding matrix to carry out decoding and obtain s [5];
Utilize nibbling method, destination node D 1and D 2decode successively.
Further, destination node D in the 4th time slot 1decoding s [3]method also comprise:
According to D 1at the 3rd s that time slot has obtained [2], utilize y [1][4]-G [1,1][4] F [1,2][3] s [2]eliminate y [1][4] s in [2]the interference brought;
Use ZF decoding matrix (G [1,1][4] Η [1,1][3]) -1calculate, obtain s [3].
Further, destination node D in the 5th time slot 1decoding s [4]method also comprise:
According to D 1the s that time slot above has obtained [2]and s [3], utilize y [1][5]-G [1,2][5] F [2,1][4] F [1,2][3] s [2]-G [1,2][5] F [2,1][4] Η [1,1][3] s [3]eliminate y [1][5] s in [2]and s [3]the interference brought;
Use ZF decoding matrix (G [1,2][5] Η [2,2][4]) -1calculate, obtain s [4].
Under a kind of two community multi-user's Two-Hops provided by the invention, the data transmission method of transceiver, does not require that source node and relaying have global channel state information CSI, just can reach the individual normalization degree of freedom, and reaching the decoding complex degree of existing relay transport protocol in destination node significantly can be reduced during the individual normalization degree of freedom.In addition, under two community multi-user's Two-Hops provided by the invention, the asymptotic value of the normalization degree of freedom that the data transmission method of transceiver can reach when not needing relaying and source node to have overall CSI is 1.
Accompanying drawing explanation
Fig. 1 is the flow chart of the data transmission method of transceiver under a kind of two community multi-user's Two-Hops of proposing of the present invention;
Fig. 2 is the application scenarios schematic diagram of two community multi-user's Two-Hops based on half-duplex via node that the embodiment of the present invention one provides;
Fig. 3 is the system model figure that the embodiment of the present invention one provides;
Fig. 4 is reaching of providing of the embodiment of the present invention one the data transmission procedure schematic diagram of transceiver during the individual degree of freedom;
Fig. 5 be the embodiment of the present invention two provide reach 1 normalization degree of freedom time transceiver data transmission procedure schematic diagram.
Embodiment
Below in conjunction with drawings and Examples, the specific embodiment of the present invention is described in further detail.Following examples for illustration of the present invention, but are not used for limiting the scope of the invention.
The embodiment of the present invention one proposes the data transmission method of transceiver under a kind of two community multi-user's Two-Hops, as shown in Figure 1, said method comprising the steps of:
S101. at different time slots, server controls source node group hocket data send, and according to sending the difference of source node group of data at different time-gap, adjustment half-duplex via node sends the transmitting-receiving order of data to described source node group, multiple single-antenna subscriber composition in described source node Zu Youliangge community;
S102. described half-duplex via node obtains the local channel state information of oneself by channel estimating;
S103. described half-duplex via node generates the frequency pilot sign of described half-duplex via node according to described local channel state information, and is sent to destination node by the data of described frequency pilot sign insertion current transmission;
S104. destination node extracts the described frequency pilot sign received in data, and carry out equivalent channel matrix estimation according to described frequency pilot sign, the described equivalent channel matrix according to estimating decodes expected data.
Further, described method two destination nodes comprising two groups of source node groups, two half-duplex via nodes and be made up of base station; Wherein, S irepresent source node group i, i ∈ { 1,2}, R lrepresent the via node l of configuration M root antenna, l ∈ { 1,2}, D irepresent the destination node i with M root antenna, S iin have M single-antenna subscriber, in a kth time slot, S iby via node R lto the destination node D of its correspondence itransmission data s [k].
In order to solve existing techniques in realizing the problem that during the individual normalization degree of freedom, the decoding complex degree of destination node is higher, embodiments provide a kind of data transmission method that source node and relaying have transceiver under two community multi-user's Two-Hops of global channel state information CSI that do not require, the application scenarios schematic diagram of the method as shown in Figure 2, system model figure as shown in Figure 3, the present embodiment utilizes the relay transmission of 3 time slots, transmitting procedure schematic diagram as shown in Figure 4, specifically comprises:
Step 201: the transceiver design in the 1st time slot;
If have two source node groups, two semiduplex via nodes in system, and two destination nodes, make S irepresent source node group i, i ∈ { 1,2}, R lrepresent the via node l of configuration M root antenna, l ∈ { 1,2}, D irepresent the destination node i with M root antenna.S iin have M single-antenna subscriber, in a kth time slot, S iby the destination node D of via node to its correspondence itransmission data s [k].In the 1st time slot, two via node R 1and R 2all receive, source node group S 1data s is sent to two via nodes [1], two via node R 1and R 2the signal received is respectively:
r [1][1]＝Η [1,1][1]s [1]+z [1]，
r [2][1]＝Η [2,1][1]s [1]+z [2]，
Wherein, r [l][k] represents via node R lthe signal received in a kth time slot, Η [l, i][k] is source node group S in a kth time slot ito via node R lchannel matrix, z [l]for via node R lnoise vector.Because noise does not affect the calculating of the degree of freedom, in follow-up formula, all ignore noise item.After the end of transmission of the 1st time slot, via node R 1and R 2utilize ZF decoding matrix Η respectively [1,1][1] -1with Η [2,1][1] -1s can be obtained [1].
Step 202: the transceiver design in the 2nd time slot;
In 2nd time slot, R 1carry out sending and R 2receive, R 1transmit the 1st the data s that slot decoder goes out [1], source node group S simultaneously 2transmit data s [2].Therefore, in the 2nd time slot, via node R 2r can be received 1the data sent can receive S again 2the data of transmission, are expressed as follows
r [2][2]＝F [2,1][2]s [1]+Η [2,2][2]s [2]，
Wherein, F [2,1][k] is R in a kth time slot 1to R 2channel matrix.At via node R 2, be constructed as follows matrix equation:
Wherein, Η [2,1][1], F [2,1][2] and Η [2,2]the non-singular matrix of [2] to be all order be M, therefore equivalent matrix order be 2M.Via node R 2utilize ZF decoding matrix s can be obtained [1]and s [2].
In addition, in the 2nd time slot, destination node D 1and D 2the signal received is respectively:
y [1][2]＝G [1,1][2]s [1]，
y [2][2]＝G [2,1][2]s [1]，
Wherein, y [i][k] is destination node D in a kth time slot ithe signal received, G [i, l][k] is via node R in a kth time slot lto destination node D ichannel matrix, destination node D 1and D 2utilize ZF decoding matrix G respectively [1,1][2] -1with G [2,1][2] -1s can be obtained [1].
Step 203: the transceiver design in the 3rd time slot;
In 3rd time slot, R 2to destination node D 2send s [2], therefore, destination node D in the 3rd time slot 2the signal received can be expressed as:
y [2][3]＝G [2,2][3]s [2]，
Destination node D 2utilize ZF decoding matrix G [2,2][3] -1the expected data s of oneself can be obtained [2].
The glitch-free data number that the embodiment of the present invention utilizes 3 time slots to decode is 2M.Therefore relaying does not need the overall CSI with the first jumping and the second jumping to reach to a degree of freedom, and significantly can reduce the decoding complex degree of existing scheme in destination node.
On the basis of embodiment one, the embodiment of the present invention two additionally provides the data transmission method of transceiver under a kind of two community multi-user's Two-Hops, the asymptotic value of the normalization degree of freedom that the method utilizes the relay transmission of more multi-slot to reach is 1, concrete transmitting procedure schematic diagram as shown in Figure 5, comprising:
Step 301: the transceiver design in the 1st time slot and the 2nd time slot;
Transceiver design in front 2 time slots is consistent with the method for designing of 2 time slots front in embodiment 2.
Step 302: the transceiver design in the 3rd time slot;
At the 3rd time slot, via node R 2carry out sending and R 1receive, R 2transmission s [2], source node group S simultaneously 1transmit data s [3].Therefore, in the 3rd time slot, via node R 1the signal received can be expressed as:
r [1][3]＝F [1,2][3]s [2]+Η [1,1][3]s [3]，
Wherein, F [1,2][k] is R in a kth time slot 2to R 1channel matrix.At the 3rd time slot, the signal that two destination nodes receive can be expressed as:
y [1][3]＝G [1,2][3]s [2]，
y [2][3]＝G [2,2][3]s [2]，
Destination node D 1and D 2utilize ZF decoding matrix G respectively [1,2][3] -1and G [2,2][3] -1s can be obtained [2].
Step 303: the transceiver design in the 4th time slot;
At the 4th time slot, R 1carry out sending and R 2receive, R 1transmit the signal r that the 3rd time slot receives [1][3], source node group S while 2transmit data s [4].Therefore, in the 4th time slot, via node R 2the signal received can be expressed as:
r [2][4]＝F [2,1][4]r [1][3]+Η [2,2][4]s [4]
＝F [2,1][4](F [1,2][3]s [2]+Η [1,1][3]s [3])+Η [2,2][4]s [4]，
At the 4th time slot, the signal that two destination nodes receive can be expressed as:
y [1][4]＝G [1,1][4]r [1][3]＝G [1,1][4](F [1,2][3]s [2]+Η [1,1][3]s [3])，
y [2][4]＝G [2,1][4]r [1][3]＝G [2,1][4](F [1,2][3]s [2]+Η [1,1][3]s [3])，
Destination node D 1utilize y [1][3] and y [1][4] matrix equation is constructed as follows:
Matrix in above formula order be 2M, therefore destination node D 1utilize ZF decoding matrix can be decoded s [3].For destination node D 2, its s that decodes [3]method and D 1similar.
Step 304: the transceiver design in the 5th time slot;
At the 5th time slot, R 2carry out sending and R 1receive, R 2transmit the signal r that the 4th time slot receives [2][4], source node group S while 1transmit data s [5].Therefore, in the 5th time slot, via node R 1the signal received can be expressed as:
r [1][5]＝F [1,2][5]r [2][4]+Η [1,1][5]s [5]
＝F [1,2][5]F [2,1][4]F [1,2][3]s [2]+F [1,2][5]F [2,1][4]Η [1,1][3]s [3]+Η [1,1][5]s [5]，
At the 5th time slot, the signal that two destination nodes receive can be expressed as:
y [1][5]＝G [1,2][5]r [2][4]
＝G [1,2][5](F [2,1][4]F [1,2][3]s [2]+F [2,1][4]Η [1,1][3]s [3]+Η [2,2][4]s [4])，
y [2][5]＝G [2,2][5]r [2][4]
＝G [2,2][5](F [2,1][4]F [1,2][3]s [2]+F [2,1][4]Η [1,1][3]s [3]+Η [2,2][4]s [4])，
Destination node D 1utilize y [1][3], y [1][4] and y [1][5] matrix equation is constructed as follows:
Matrix in above formula order be 3M, therefore destination node D 1can be decoded s [4].For destination node D 2, its s that decodes [4]method and D 1similar.
Step 305: the transceiver design in the 6th time slot;
At the 6th time slot, R 1carry out sending and R 2receive, R 1transmit the signal r that the 5th time slot receives [1][5], source node group S while 2transmit data s [6].Gap at this moment, destination node D 1and D 2all s can be obtained [5].
Step 306: the transceiver design after the 6th time slot;
By that analogy, at the n-th time slot, D 1and D 2s can be correctly decoded out [n-1].
The glitch-free data number that the embodiment of the present invention utilizes n time slot to decode is (n-1) M.Therefore via node does not need the asymptotic value DoF of the normalization degree of freedom that can reach during the overall CSI with the first jumping and the second jumping sumfor:
DoF sum = lim n → ∞ ( n - 1 ) M n M = 1 .
The data transmission method that the embodiment of the present invention proposes, only needs via node to utilize channel condition information CSI (the i.e. Η of the first jumping [l, i]) and two via nodes between channel condition information CSI (the i.e. F of channel [1,2]and F [2,1]) precoding is carried out to pilot tone, thus destination node can estimate equivalent channel G [i, l]f [k, l], G [i, l]Η [l, i]and G [i, l]f [k, l]Η [l, i], and then obtain equivalent channel matrix.For these reasons, do not require when relay transport protocol of carrying reaches 1 normalization degree of freedom that source node and relaying have any overall CSI.
The data transmission method of transceiver under a kind of two community multi-user's Two-Hops adopting the present invention to propose, sent by the data controlling source node group in different time-gap, and the transmitting-receiving order of adjustment half-duplex via node, the frequency pilot sign of design via node, source node group, via node, destination node does not need the channel information knowing the overall situation, the channel information of local is utilized to reach the computation complexity that can reduce destination node under the condition of specifying the degree of freedom, in addition, under two community multi-user's Two-Hops provided by the invention, the asymptotic value of the normalization degree of freedom that the data transmission method of transceiver can reach when not needing relaying and source node to have overall CSI is 1.
Through the above description of the embodiments, those skilled in the art can be well understood to the present invention can by hardware implementing, and the mode that also can add necessary general hardware platform by software realizes.Based on such understanding, technical scheme of the present invention can embody with the form of software product, it (can be CD-ROM that this software product can be stored in a non-volatile memory medium, USB flash disk, portable hard drive etc.) in, comprise some instructions and perform method described in each embodiment of the present invention in order to make a computer equipment (can be personal computer, server, or the network equipment etc.).
It will be appreciated by those skilled in the art that accompanying drawing is the schematic diagram of a preferred embodiment, the module in accompanying drawing or flow process might not be that enforcement the present invention is necessary.
It will be appreciated by those skilled in the art that the module in the device in embodiment can carry out being distributed in the device of embodiment according to embodiment description, also can carry out respective change and be arranged in the one or more devices being different from the present embodiment.The module of above-described embodiment can merge into a module, also can split into multiple submodule further.
Be only several specific embodiment of the present invention above, but the present invention is not limited thereto, the changes that any person skilled in the art can think of all should fall into protection scope of the present invention.

Claims (10)

1. the data transmission method of transceiver under Zhong Liang community multi-user's Two-Hop, is characterized in that, said method comprising the steps of:
At different time slots, server controls source node group hocket data send, and according to sending the difference of source node group of data at different time-gap, adjustment half-duplex via node sends the transmitting-receiving order of data to described source node group, multiple single-antenna subscriber composition in described source node Zu Youliangge community;
Described half-duplex via node obtains the local channel state information of oneself by channel estimating;
Described half-duplex via node generates the frequency pilot sign of described half-duplex via node according to described local channel state information, and is sent to destination node by the data of described frequency pilot sign insertion current transmission;
Destination node extracts the described frequency pilot sign received in data, and carry out equivalent channel matrix estimation according to described frequency pilot sign, the described equivalent channel matrix according to estimating decodes expected data.
2. the method for claim 1, is characterized in that, two destination nodes that described method comprises two groups of source node groups, two half-duplex via nodes and is made up of base station; Wherein, S irepresent source node group i, i ∈ { 1,2}, R lrepresent the via node l of configuration M root antenna, l ∈ { 1,2}, D irepresent the destination node i with M root antenna, S iin have M single-antenna subscriber, in a kth time slot, S iby via node R lto the destination node D of its correspondence itransmission data s [k].
3. method as claimed in claim 2, it is characterized in that, described server controls source node group carries out data transmission, and according to sending the difference of source node group of data at different time-gap, adjustment half-duplex via node sends the transmitting-receiving order of data to described source node group, specifically comprise:
In the 1st time slot, two via node R 1and R 2all receive source node group S 1to the data s that two via nodes send [1], two via node R 1and R 2the signal received is respectively:
r [1][1]＝Η [1,1][1]s [1]+z [1]，
r [2][1]＝Η [2,1][1]s [1]+z [2]，
Wherein, r [l][k] represents via node R lthe signal received in a kth time slot, Η [l, i][k] is source node group S in a kth time slot ito via node R lchannel matrix, z [l]for via node R lnoise vector, because noise does not affect the calculating of the degree of freedom, in follow-up formula, all ignore noise item;
After the end of transmission of the 1st time slot, via node R 1and R 2utilize ZF decoding matrix Η respectively [1,1][1] -1with Η [2,1][1] -1calculate, obtain s [1].
4. method as claimed in claim 3, it is characterized in that, described server controls source node group carries out data transmission, and according to sending the difference of source node group of data at different time-gap, adjustment half-duplex via node sends the transmitting-receiving order of data to described source node group, also comprise:
In the 2nd time slot, R 1carry out sending and R 2receive, R 1transmit the 1st the data s that slot decoder goes out [1], source node group S simultaneously 2transmit data s [2], described via node R 2the data received, are expressed as follows:
r [2][2]＝F [2,1][2]s [1]+Η [2,2][2]s [2]，
Wherein, F [2,1][k] is R in a kth time slot 1to R 2channel matrix;
At via node R 2, be constructed as follows matrix equation:
Wherein, Η [2,1][1], F [2,1][2] and Η [2,2]the non-singular matrix of [2] to be all order be M, for its equivalent matrix, order is 2M;
Described via node R 2utilize ZF decoding matrix calculate, obtain s [1]and s [2].
5. method as claimed in claim 4, it is characterized in that, described method also comprises:
According to via node R 2at the 1st s that time slot has obtained [1], utilize r [2][2]-F [2,1][2] s [1]eliminate r [2][2] s in [1]the interference brought, concrete formula is:
r [2][2]-F [2,1][2]s [1]＝Η [2,2][2]s [2]；
Described via node R 2utilize ZF decoding matrix Η [2,2][2] -1calculate, obtain s [2].
6. method as claimed in claim 4, it is characterized in that, the described equivalent channel matrix that described basis estimates decodes expected data and specifically comprises:
In the 2nd time slot, destination node D 1and D 2receive the data that via node sends, the data received are respectively
y [1][2]＝G [1,1][2]s [1]，
y [2][2]＝G [2,1][2]s [1]，
Wherein, y [i][k] is destination node D in a kth time slot ithe data received, G [i, l][k] is via node R in a kth time slot lto destination node D ichannel matrix;
Destination node D 1and D 2utilize ZF decoding matrix G respectively [1,1][2] -1with G [2,1][2] -1calculate, obtain s [1].
7. method as claimed in claim 4, it is characterized in that, described server controls source node group carries out data transmission, and according to sending the difference of source node group of data at different time-gap, adjustment half-duplex via node sends the transmitting-receiving order of data to described source node group, also comprise:
In the 3rd time slot, via node R 2carry out sending and R 1receive, R 2transmission s [2], source node group S simultaneously 1transmit data s [3], in the 3rd time slot, via node R 1the signal received can be expressed as:
r [1][3]＝F [1,2][3]s [2]+Η [1,1][3]s [3]，
Wherein, F [1,2][k] is R in a kth time slot 2to R 1channel matrix;
In the 3rd time slot, R 2to destination node D 2send s [2];
In the 4th time slot, via node R 1carry out sending and R 2receive, R 1transmit the signal r that the 3rd time slot receives [1][3], source node group S while 2transmit data s [4], in the 4th time slot, via node R 2the signal received can be expressed as:
r [2][4]＝F [2,1][4]r [1][3]+Η [2,2][4]s [4]
＝F [2,1][4](F [1,2][3]s [2]+Η [1,1][3]s [3])+Η [2,2][4]s [4]；
In the 5th time slot, via node R 2carry out sending and R 1receive, R 2transmit the signal r that the 4th time slot receives [2][4], source node group S while 1transmit data s [5], in the 5th time slot, via node R 1the signal received can be expressed as:
r [1][5]＝F [1,2][5]r [2][4]+Η [1,1][5]s [5]
＝F [1,2][5]F [2,1][4]F [1,2][3]s [2]+F [1,2][5]F [2,1][4]Η [1,1][3]s [3]+Η [1,1][5]s [5]；
At the 6th time slot, via node R 1carry out sending and R 2receive, R 1transmit the signal r that the 5th time slot receives [1][5], source node group S while 2transmit data s [6];
Utilize nibbling method, at different time slots, via node carries out the transmitting-receiving of data successively.
8. method as claimed in claim 7, it is characterized in that, the described equivalent channel matrix that described basis estimates decodes expected data and also comprises:
At the 3rd time slot, two destination node D 1and D 2the signal received can be expressed as:
y [1][3]＝G [1,2][3]s [2]，
y [2][3]＝G [2,2][3]s [2]，
Destination node D 1and D 2utilize ZF decoding matrix G respectively [1,2][3] -1and G [2,2][3] -1s can be obtained [2];
At the 4th time slot, two destination node D 1and D 2the signal received can be expressed as:
y [1][4]＝G [1,1][4]r [1][3]＝G [1,1][4](F [1,2][3]s [2]+Η [1,1][3]s [3])，
y [2][4]＝G [2,1][4]r [1][3]＝G [2,1][4](F [1,2][3]s [2]+Η [1,1][3]s [3])，
Destination node D 1utilize y [1][3] and y [1][4] matrix equation is constructed as follows:
Wherein, equivalent channel matrix order be 2M;
Destination node D 1utilize ZF decoding matrix calculate, obtain s [3];
For destination node D 2, utilize destination node D 1coding/decoding method obtain s [3];
At the 5th time slot, two destination node D 1and D 2the signal received can be expressed as:
y [1][5]＝G [1,2][5]r [2][4]
＝G [1,2][5](F [2,1][4]F [1,2][3]s [2]+F [2,1][4]Η [1,1][3]s [3]+Η [2,2][4]s [4])：
y [2][5]＝G [2,2][5]r [2][4]
＝G [2,2][5](F [2,1][4]F [1,2][3]s [2]+F [2,1][4]Η [1,1][3]s [3]+Η [2,2][4]s [4])：
Destination node D 1utilize y [1][3], y [1][4] and y [1][5] matrix equation is constructed as follows:
Wherein, equivalent channel matrix order be 3M;
Destination node D 1utilize ZF decoding matrix calculate, obtain s [4];
For destination node D 2, utilize destination node D 1coding/decoding method obtain s [4];
At the 6th time slot, destination node D 1and D 2utilize corresponding ZF decoding matrix to carry out decoding and obtain s [5];
Utilize nibbling method, destination node D 1and D 2decode successively.
9. method as claimed in claim 8, is characterized in that, destination node D in the 4th time slot 1decoding s [3]method also comprise:
According to D 1at the 3rd s that time slot has obtained [2], utilize y [1][4]-G [1,1][4] F [1,2][3] s [2]eliminate y [1][4] s in [2]the interference brought;
Use ZF decoding matrix (G [1,1][4] Η [1,1][3]) -1calculate, obtain s [3].
10. method as claimed in claim 8, is characterized in that, destination node D in the 5th time slot 1decoding s [4]method also comprise:
According to D 1the s that time slot above has obtained [2]and s [3], utilize y [1][5]-G [1,2][5] F [2,1][4] F [1,2][3] s [2]-G [1,2][5] F [2,1][4] Η [1,1][3] s [3]eliminate y [1][5] s in [2]and s [3]the interference brought;
Use ZF decoding matrix (G [1,2][5] Η [2,2][4]) -1calculate, obtain s [4].
CN201410473162.7A 2014-09-17 2014-09-17 The data transmission method of transceiver under a kind of two cells multi-user's Two-Hop Expired - Fee Related CN104270235B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410473162.7A CN104270235B (en) 2014-09-17 2014-09-17 The data transmission method of transceiver under a kind of two cells multi-user's Two-Hop

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410473162.7A CN104270235B (en) 2014-09-17 2014-09-17 The data transmission method of transceiver under a kind of two cells multi-user's Two-Hop

Publications (2)

Publication Number Publication Date
CN104270235A true CN104270235A (en) 2015-01-07
CN104270235B CN104270235B (en) 2017-10-31

Family

ID=52161730

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410473162.7A Expired - Fee Related CN104270235B (en) 2014-09-17 2014-09-17 The data transmission method of transceiver under a kind of two cells multi-user's Two-Hop

Country Status (1)

Country Link
CN (1) CN104270235B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105656532A (en) * 2016-01-27 2016-06-08 北京邮电大学 Information transmitting and receiving method of non-ideal state channel
CN106877985A (en) * 2015-12-11 2017-06-20 华为技术有限公司 The processing method and node device of a kind of frequency pilot sign

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101588197A (en) * 2009-06-19 2009-11-25 东南大学 A kind of communication means based on the relaying cooperative transmission system
CN103248414A (en) * 2013-04-17 2013-08-14 重庆邮电大学 Method for multi-relay two-hop transmission based on interference alignment and beamforming

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101588197A (en) * 2009-06-19 2009-11-25 东南大学 A kind of communication means based on the relaying cooperative transmission system
CN103248414A (en) * 2013-04-17 2013-08-14 重庆邮电大学 Method for multi-relay two-hop transmission based on interference alignment and beamforming

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
JINJIN: "New Feedback Topology Designs with Reduced CSI Overhead for MIMO Interference Alignment", 《IEEE SIGNAL PROCESSING LETTERS》 *
SUJIE CHEN: "Achieve the Degrees of Freedom of K-User MIMO Interference Channel with a MIMO Relay", 《IEEE GLOBECOM 2010 PROCEEDINGS》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106877985A (en) * 2015-12-11 2017-06-20 华为技术有限公司 The processing method and node device of a kind of frequency pilot sign
CN106877985B (en) * 2015-12-11 2020-10-13 皓创科技(镇江)有限公司 Method for processing pilot symbols and node equipment
CN105656532A (en) * 2016-01-27 2016-06-08 北京邮电大学 Information transmitting and receiving method of non-ideal state channel
CN105656532B (en) * 2016-01-27 2019-06-07 北京邮电大学 A kind of information method of sending and receiving of nonideality channel

Also Published As

Publication number Publication date
CN104270235B (en) 2017-10-31

Similar Documents

Publication Publication Date Title
US11870551B2 (en) Multi-codeword transmission method and apparatus
US8462873B2 (en) Communication system performing interference alignment and interference alignment method
CN103580782B (en) The base band processing device and wireless communication system of wireless communication system
EP4301086A3 (en) Qos management for multi-user edca transmission mode in 802.11ax networks
US20110176633A1 (en) Method and system for orthogonalized beamforming in multiple user multiple input multiple output (mu-mimo) communication systems
RU2015144586A (en) RISER COMMUNICATION POWER MANAGEMENT IN ADAPTIVELY CONFIGURED TDD COMMUNICATION SYSTEMS
CN106559365A (en) Self-interference removing method and equipment
WO2011132988A3 (en) Method and apparatus for channel estimation for radio link between a base station and a relay station
KR101548555B1 (en) Method and device for data packet relaying and data packet decoding
CN106850154A8 (en) The method and apparatus for transmitting control information
JP2013251859A5 (en) Wireless base station, wireless communication system, and wireless communication method
US11496188B2 (en) Electronic device, communication method and medium
CN107078836B (en) A kind of generation method and device of pilot signal
EP3026967A1 (en) Synchronization signal transmitting device, receiving device, method, and system
US10056928B2 (en) Method and apparatus for controlling interference in mobile communication system
WO2011118996A3 (en) A method of performing a communication in a wireless communication system and an apparatus for the same
US20110164578A1 (en) Method and system for multiband user scheduling in a multiple user multiple input multiple output (mu-mimo) communication system
CN104270235A (en) Data transmission method of transceiver under two-cell multi-user two-hop network
US20140104999A1 (en) Communication apparatus and data transmission method thereof
WO2018171520A1 (en) Data transmission method, terminal device, and access network device
RU2014121497A (en) FRAME TRANSFER METHOD, RELATED STATIONS AND COMPUTER PROGRAM
CN110199487A (en) The method and terminal device of transmission of reference signals
CN103532602A (en) Antenna selection method and relay node
KR20140046540A (en) Method for relay selection and power setting
CN105099536A (en) Single-slot bi-directional message exchange in relay 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
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20171031