WO2012106842A1 - 一种数据传输方法、无线通信系统、目的节点和中继节点 - Google Patents

一种数据传输方法、无线通信系统、目的节点和中继节点 Download PDF

Info

Publication number
WO2012106842A1
WO2012106842A1 PCT/CN2011/070925 CN2011070925W WO2012106842A1 WO 2012106842 A1 WO2012106842 A1 WO 2012106842A1 CN 2011070925 W CN2011070925 W CN 2011070925W WO 2012106842 A1 WO2012106842 A1 WO 2012106842A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
data
source
time slot
relay
Prior art date
Application number
PCT/CN2011/070925
Other languages
English (en)
French (fr)
Inventor
张元涛
周华
吴建明
Original Assignee
富士通株式会社
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 富士通株式会社 filed Critical 富士通株式会社
Priority to KR1020137024106A priority Critical patent/KR20130124969A/ko
Priority to PCT/CN2011/070925 priority patent/WO2012106842A1/zh
Priority to EP11858266.7A priority patent/EP2675097A1/en
Priority to CN201180067141XA priority patent/CN103348619A/zh
Priority to JP2013552814A priority patent/JP2014509488A/ja
Publication of WO2012106842A1 publication Critical patent/WO2012106842A1/zh
Priority to US13/962,781 priority patent/US20130322321A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867Arrangements specially adapted for the transmitter end
    • H04L1/1896ARQ related signaling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18Automatic repetition systems, e.g. Van Duuren systems
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0076Distributed coding, e.g. network coding, involving channel coding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L2001/0092Error control systems characterised by the topology of the transmission link
    • H04L2001/0097Relays

Definitions

  • the present invention relates to the field of communications, and in particular, to a data transmission method, a wireless communication system, a destination node, and a relay node.
  • a cooperative communication system includes a source node S, a relay node R, and a destination node D.
  • a cooperative communication system is different from a multi-hop system.
  • a system if there is no direct link between the source node S and the destination node D, that is, the received signal level is lower than the minimum required value, so that the source node S to the destination node D cannot directly communicate, generally speaking, such a system is Multi-hop system; if there is a direct communication link between the source node S and the destination node D, such a system is generally referred to as a cooperative system.
  • the difference between the above two systems is that in the multi-hop system, if there is no forwarding of the relay node R, the communication from the source node S to the destination node D cannot be realized.
  • the source node S can communicate directly with the destination node D, but with the help of the relay node R, the communication performance of the source node S to the destination node D can be improved, which is reflected in the improvement or success of the data rate.
  • the rate is improved.
  • the forwarding methods may include: non-regenerative relay (amplification and forwarding, AF: Amplify-and-Forward) and regenerative relay (DF: Decode-and-Forward) [2].
  • AF Amplify-and-Forward
  • DF Decode-and-Forward
  • the signal transmitted by the relay node R is a direct amplification of the received signal.
  • the advantage of the amplifying and forwarding AF method is that the processing is simple, and the disadvantage is that the forwarded signal also amplifies the received noise.
  • the relay node R first decodes the received signal, and the transmitted signal is a signal that the data is re-encoded and modulated.
  • the advantage of the relay forwarding DF mode is that the noise in the received signal can be eliminated, and the disadvantage is that the receiver needs more processing power than the amplified and forwarded AF mode.
  • Hybrid Automatic Repeat Request (HARQ: Hybrid Automatic Repeat Request)
  • FEC Forward Error Correction
  • ARQ Automatic Repeat Request
  • the source node S first encodes the information to be transmitted into a codeword by error control coding, and then transmits it to the destination node D after being modulated; the destination node D performs corresponding demodulation decoding, and according to the loop Redundancy check (CRC: Cyclical Redundancy Check) or the characteristics of the code itself to determine whether the decoding output is correct; if the decoding is not correct, the source node S is required to retransmit.
  • the most basic retransmission request information is a reception acknowledgement (ACK: ACKnowledgment) and a non-acknowledgement (NACK, Not ACKnowledgment), respectively indicating that the decoding succeeds or fails.
  • ACK reception acknowledgement
  • NACK non-acknowledgement
  • Figure 1 is a schematic diagram of a channel with a number of slots of four.
  • a typical processing method is to divide the channel into frames according to time, and each frame is divided into N time slots, numbered from 1 to N. In all frames, the same numbered time slots form a subchannel, which is also called an ARQ substream or an ARQ subroutine.
  • the source node S transmits the codeword in slot 1 of frame 1, and after receiving and decoding, the destination node D sends back ACK/ in the next slot, ie, slot 1 of frame 2. NACK instruction. Then, the source node S receives and decodes the instruction, and then prepares the transmission content of the slot 1 of the frame 3 according to the content of the instruction, which may be new data or may be retransmission of the previous data.
  • This hybrid automatic request retransmission HARQ technology can be used for a cooperative communication system with relay nodes.
  • the erroneous codeword can only be retransmitted by the source node S.
  • the relay node R can also assist in retransmission.
  • the existing relay-assisted HARQ method is based on the decoding and forwarding (DF: Decode-and-Rorward) [2] method, during retransmission
  • DF Decode-and-Rorward
  • the source node S like the system without the relay node, cannot send a new codeword. Therefore, the retransmission time and the space-time dimension brought by the relay node R cannot be fully utilized, which causes a certain amount of channel resource waste.
  • An object of the embodiments of the present invention is to provide a data transmission method, a wireless communication system, a destination node, and a relay node.
  • the destination node decodes the data according to the data from the source node in the current time slot.
  • the decoding result of decoding the data from the source node in the current time slot sent by the node determines the behavior of the source node S and the relay node R in the next time slot, so that the source node S is transmitting data in any time slot. , avoid waste of channel resources, and the method is compatible.
  • a data transmission method comprising: Receiving, by the destination node, the data sent by the at least one source node, demodulating and decoding the data sent by the at least one source node, to obtain a decoding result, and receiving the first relay node sent by the first relay node. Demodulating and decoding the data sent by the at least one source node received in the current time slot;
  • the destination node notifies the source node to retransmit the data or transmit new data in the next time slot according to the decoding result of demodulating and decoding the data of the source node and the decoding result of the first relay node.
  • a destination node is provided, where the destination node includes:
  • a first receiving unit configured to receive data sent by at least one source node in a current time slot
  • a first processing unit configured to perform demodulation and decoding on the data sent by the at least one source node received by the first receiving unit, to obtain a decoding result
  • a second receiving unit configured to receive, by the first relay node, decoding, by the first relay node, after demodulating and decoding the data sent by the at least one source node received in the current time slot Result
  • a first message notification unit configured to notify the one source node to retransmit the data in a next time slot according to a decoding result of the first processing unit and a decoding result received by the second receiving unit Transfer new data.
  • a wireless communication system includes: a source node, where the source node is configured to send data;
  • a relay node configured to receive data sent by the source node, and demodulate and decode the data to obtain a decoding result and send the decoding result;
  • the destination node is configured to receive data sent by the source node, demodulate and decode the data to obtain a decoding result, and receive a decoding result sent by the relay node, and according to the source node
  • the decoding result of the data demodulation decoding and the decoding result of the first relay node notify the one source node to retransmit the data or transmit new data in the next time slot.
  • a data transmission method comprising: Receiving, by the destination node, the data sent by the at least one source node, demodulating and decoding the data sent by the at least one source node, to obtain a decoding result, and notifying the at least one source node of the decoding result, so that the node
  • the at least one source node decides to retransmit the data or transmit new data in the next time slot according to the decoding result sent by the destination node and the decoding result sent by the third relay node.
  • a data transmission method comprising:
  • a data transmission method comprising:
  • the source node is determined to retransmit the data or transmit new data in the next time slot according to the decoding result returned by the destination node and the third relay node.
  • a destination node is provided, where the destination node includes:
  • a fourth receiving unit configured to receive data sent by the at least one source node in a current time slot;
  • a third processing unit configured to perform demodulation and decoding on the data sent by the at least one source node, to obtain a decoding result;
  • a fourth message notification unit configured to notify the at least one source node of the decoding result of the third processing unit, so that the at least one source node determines, according to the decoding result sent by the destination node and the decoding result sent by the relay node The data is retransmitted or new data is transmitted in the next time slot.
  • a relay node where the relay node includes:
  • a sixth receiving unit configured to receive data sent by the at least one source node in a current time slot; and a fourth processing unit, configured to perform demodulation and decoding on the data received by the sixth receiving unit, Obtain a decoding result;
  • a sixth message notification unit configured to notify the at least one source node and the destination node of the decoding result of the fourth processing unit, so that the source node performs decoding result according to the notification unit and the decoding result sent by the destination node Deciding to retransmit the data or transmit new data in the next time slot; causing the destination node to notify the relay node to transmit the data of the source node in the next time slot according to the decoding result of the notification unit and the decoding result of the destination node. Or in the listening state.
  • a source node configured to send data to a destination node and a third relay node in a current time slot source node;
  • a seventh receiving unit configured to receive a decoding result of demodulating and decoding the data by the destination node and the third relay node;
  • a fifth processing unit configured to determine, according to the decoding result received by the seventh receiving unit, that the source node retransmits the data or transmits new data in a next time slot.
  • a wireless communication system comprising the source node, the relay node, and the destination node.
  • a computer readable program wherein when the program is executed in a destination node, the program causes a computer to execute the data transmission method in the destination node.
  • a storage medium storing a computer readable program, wherein the computer readable program causes a computer to execute the above data transmission method in a destination node.
  • a computer readable program wherein when the program is executed in a relay node, the program causes a computer to execute the above data transmission method in the relay node.
  • a storage medium storing a computer readable program, wherein the computer readable program causes a computer to execute the above data transmission method in a relay node.
  • a computer readable program wherein when the program is executed in a source node, the program causes the computer to execute the above in the source node Data transmission method.
  • a storage medium storing a computer readable program, wherein the computer readable program causes a computer to execute the above data transmission method in a source node.
  • the beneficial effects of the embodiments of the present invention are: the decoding result of the destination node decoding according to the data from the source node in the current time slot and the decoding result of decoding the data from the source node in the current time slot sent by the relay node. To determine the behavior of the next time slot source node S and relay node R, so that the source node S is transmitting data in any time slot, avoiding waste of channel resources.
  • 1 is a schematic diagram of a channel with a number of slots of 4;
  • FIG. 2 is a schematic structural diagram of a wireless communication system with relay cooperation according to an embodiment of the present invention
  • FIG. 3 is a flowchart of a data transmission method according to Embodiment 1 of the present invention
  • FIG. 4 is a flowchart of decoding a jointly encoded data by a destination node according to an embodiment of the present invention
  • FIG. 5 is a schematic diagram showing a configuration of a destination node according to Embodiment 2 of the present invention.
  • FIG. 6 is a schematic diagram showing the structure of a destination node according to Embodiment 3 of the present invention.
  • FIG. 7 is a schematic diagram showing the structure of a second message notification unit according to Embodiment 3 of the present invention
  • 8 is a timing diagram of a HARQ system without relay cooperation in the prior art
  • FIG. 9 is a timing diagram of a HARQ system with relay cooperation according to Embodiment 4 of the present invention
  • FIG. 10 is a relay in Embodiment 4 of the present invention
  • FIG. 11 is a flowchart of a data transmission method according to Embodiment 5 of the present invention.
  • Figure 12 is a block diagram showing the configuration of a destination node in Embodiment 6 of the present invention.
  • FIG. 13 is a flowchart of a data transmission method according to Embodiment 7 of the present invention.
  • Figure 14 is a block diagram showing the structure of a relay node according to Embodiment 8 of the present invention.
  • Figure 15 is a flowchart of a data transmission method according to Embodiment 9 of the present invention.
  • Figure 16 is a block diagram showing the structure of a source node according to Embodiment 10 of the present invention.
  • FIG. 17 is a timing chart of a HARQ system with relay cooperation according to Embodiment 11 of the present invention
  • FIG. 18 is a second timing chart of a HARQ system with relay cooperation according to Embodiment 11 of the present invention
  • embodiments of the present invention are highly compatible with the prior art.
  • a HARQ (DF-HARQ) and Space-Time Block Code-based HARQ (STBC-HARQ) system that has implemented DF-based HARQ (STBC-HARQ) system
  • embodiments of the present invention are not required for the source node S and the system.
  • the source node S may be a user equipment UE; the destination node D may be a base station; the relay node R may be a dedicated station specially established, or may be another user equipment temporarily requisitioned.
  • the relay node is a dedicated station, and there is no data to be transmitted or needs to be a data destination of other users, and it has sufficient signal processing capability and a relatively reasonable geographical position. This assumption does not exclude the temporary expropriation of the system.
  • Other user equipments act as relay stations, provided that the requisitioned equipment has implemented the technical functions specified by the present invention.
  • the "time slot" refers to a time unit for transmitting one codeword (data), that is, a transmission time interval in some technical standards ( ⁇ : Transmission Time Interval unless there is no data to be transmitted or
  • Transmission Time Interval unless there is no data to be transmitted or
  • the source node S is transmitting codewords in any time slot, so that channel resources can be effectively utilized.
  • some of the relay nodes R are transmitting, and some are receiving.
  • the relay node in the receiving state is the monitoring relay node, and the relay node in the transmitting state is called the retransmission relay node.
  • the system includes a source node, a relay node, and a destination node.
  • the number of nodes in the system may be multiple.
  • the following takes a destination node, one or more source nodes, and one or more relay nodes as an example for description.
  • the system includes n source nodes Sl, ..., Sn, k relay nodes R1, ..., Rk, and a destination node D.
  • the relay nodes R1, ..., Rk one part is a retransmission relay node in a transmitting state; the other part is a listening relay node in a receiving state.
  • a straight line with an arrow indicates the presence of a wireless link.
  • the radio signal transmitted by any one of the nodes is actually spread in the air by broadcasting. Therefore, any signal sent by one node can reach any other node.
  • the nodes in this embodiment all have a wireless transceiving function, and these nodes have at least one antenna.
  • the relay node R or the destination node D may have multiple antennas to generate the function of space division multiple access. However, this is not essential to the practice of the invention.
  • such a scenario may correspond to uplink communication of a cellular system, but the application of the present invention is not limited to a cellular system.
  • FIG 3 is a flow chart showing the data transmission method of Embodiment 1 of the present invention. As shown in Figure 3, the method includes:
  • Step 301 In the current time slot, the destination node D receives data sent by at least one source node S.
  • Step 303 The destination node D receives, by the first relay node R, the decoding result of the first relay node R demodulating and decoding the data sent by the at least one source node S received in the current slot.
  • Step 304 the destination node D notifies the behavior of the at least one source node S in the next time slot according to the decoding result of demodulating and decoding the data of the source node S and the decoding result of the first relay node R. That is, the data is retransmitted or new data is transmitted in the next time slot.
  • the destination node D notifies the at least one source node in the next time slot, that is, the next transmission time interval, according to the decoding result of the data transmitted by the source node S and the decoding result sent by the first relay node.
  • the behavior in these causes the source nodes S to transmit data in any time slot, so that channel resources can be effectively utilized.
  • the first relay node R receives the data sent by the at least one source node S in the current time slot, and demodulates and decodes the data to obtain a decoding result, and the decoding result is obtained.
  • the first relay node R is a listening relay node.
  • the destination node D may further notify the first decoding result of the demodulation and decoding of the data of the source node S and the decoding result of the first relay node R.
  • the behavior of the relay node R in the next time slot that is, the data is transmitted or is being monitored in the next time slot. If the first relay node R is in the listening state in the next time slot, the first relay node R is the listening relay node; if the first relay node R sends the data in the next time slot, The first relay node is a retransmission relay node.
  • the destination node D correctly decodes the data sent by the current time slot of all the source nodes, all the first relay nodes of the current time slot are still in the listening state in the next time slot; if a certain first relay node does not have Translating the data sent by the current time slot of any one of the source nodes, the first relay node is still in the listening state for one day in the next time slot.
  • the first relay node becomes the next time slot.
  • An alternate retransmission relay node For example, if a certain first relay node correctly decodes the data sent by the current time slot of a source node, and the destination node D fails to correctly decode the data, the first relay node becomes the next time slot.
  • An alternate retransmission relay node For example, if a certain first relay node correctly decodes the data sent by the current time slot of a source node, and the destination node D fails to correctly decode the data, the first relay node becomes the next time slot.
  • An alternate retransmission relay node For example, if a certain first relay node correctly decodes the data sent by the current time slot of a source node, and the destination node D fails to correctly decode the data, the first relay node becomes the next time slot.
  • An alternate retransmission relay node For example, if a certain first relay node correctly decodes the data sent by the current time slot of a source node,
  • the destination node D For each destination node D failed to correctly decode the data, the destination node D according to each A decoding result sent by a relay node, such as an ACK/NACK command, establishes an alternate relay set for the data. A relay node is then selected to transmit the data in the next time slot. If the alternate relay set of the data is empty, the corresponding source node is notified to retransmit the data in the next time slot.
  • a relay node such as an ACK/NACK command
  • only the destination node D notifies the at least the decoding result of the data transmitted by the source node S and the decoding result transmitted by the first relay node.
  • a source node of a source node such as the behavior of the source node S1 in the next time slot, that is, the next transmission time interval ⁇ , is taken as an example. Similar to other source node methods.
  • step 304 if the destination node D determines the translation of the data sent by the destination node D or at least one of the first relay nodes to the current time slot of the one source node S1. If the code result is correct, the destination node D notifies the one source node S1 to transmit new data in the next time slot.
  • the source node S1 may be notified by means of ACK signaling indicating correct reception, but is not limited thereto, and other signaling may be used depending on the specific protocol. Thus, when the source node S1 receives the ACK message sent by the destination node, it can determine that new data is transmitted in the next time slot.
  • step 304 if the decoding result of the data sent by the destination node D to the current time slot of the one source node S1 is correct, and the first relay node is the current time slot of the one source node S1. If the decoding result of the transmitted data is incorrect, the destination node D still informs the one source node S1 to transmit new data in the next slot.
  • the source node S1 may be notified by the ACK signaling indicating that the ACK signaling is correctly received, and the source node S1 determines that the data sent in the current time slot is correctly decoded. Therefore, the source node S1 determines that the next node is Gap sends new data.
  • step 304 if the decoding result of the data sent by the destination node D to the current slot of the source node S1 is incorrect, and at least one of the first relay nodes is If the decoding result of the data sent by the current slot of the source node S is correct, the destination node D notifies the one source node to transmit new data in the next slot.
  • the source node S1 can be notified by means of ACK signaling indicating correct reception.
  • the first relay that the destination node D correctly decodes the data sent to the source node S1 The node sends the NACK signaling, so that after receiving the NACK signaling, the first relay node determines to send the data sent by the source node S1 in the current time slot in the next time slot. Thus, in the next time slot, the first relay node is turned into a retransmission relay node.
  • step 304 if the decoding result of the data sent by the destination node D and the at least one relay node of the first relay node to the current time slot of the one source node S1 is incorrect, The destination node notifies the one source node to retransmit the data transmitted in the current time slot in the next time slot.
  • the source node Sl can be notified by NACK signaling indicating erroneous reception. In this way, after receiving the NACK signaling, the source node S1 can learn that the data sent by the current time slot is not correctly received, and then determine to retransmit the data in the next time slot.
  • the destination node D notifies that the first relay node that correctly decodes the data of one source node S1 retransmits the data of the one source node in the next time slot, and may adopt the following manner: Determining, according to a decoding result of the first relay node, a set of first relay nodes that correctly decode data of the one source node S1; selecting a first relay node from the set of the first relay nodes, And notifying the selected first relay node to send the data of the one source node in the next time slot.
  • the first relay node is turned into a retransmission relay node in the next time slot.
  • the selecting a first relay node from the set of the first relay nodes includes: selecting a first relay node with a good channel quality in the set of the first relay node; or selecting the first relay A first relay node in a set of nodes that correctly decodes data transmitted by a large number of source nodes.
  • the method may further include:
  • the destination node D can receive data sent by the second relay node in the current time slot, and the data sent by the second relay node is according to the time slot of the destination node D before the current time slot, for example, the previous time slot. And notifying the data sent by the second relay node; wherein the data is sent by the at least one source node to the second relay node in the previous time slot, and the second relay node corrects the data in the previous time slot.
  • the destination node D decodes the data sent by the second relay node; Notifying the source node to which the data sent by the second relay node belongs according to the decoding result to send new data in the next time slot; or notifying the source node to which the data sent by the second relay node belongs to retransmit the data in the next time slot Or notifying that some of the source nodes in the source node to which the data transmitted by the second relay node belongs send new data in the next time slot, and notifying another part of the source node to retransmit the data in the next time slot.
  • the destination node notifies the source node to which the data sent by the second relay node belongs to send a new one in the next time slot. If the data is not correct, the source node to which the data sent by the second relay node belongs is notified to retransmit the data in the next time slot; if a part of the decoding is correct, and a decoding error occurs, the correctly decoded data is notified.
  • the associated source node transmits new data in the next time slot; the source node to which the erroneously decoded data belongs is notified to retransmit the data in the next time slot.
  • the destination node may also store soft information of the source bits sent by the at least one source node.
  • the second relay node may jointly encode the source bits of the one or more source nodes. And then the jointly encoded data is sent to the destination node D.
  • the joint coding mode may be the same as the coding mode of the data packet sent by the source node corresponding to the previous time slot.
  • the method may be a Turbo coding mode or a convolutional code, and may be implemented by any existing method. I won't go into details here.
  • the destination node D decodes the data transmitted by the second relay node, the following manner can be employed.
  • FIG. 4 is a flow chart of processing a jointly encoded data by a destination node according to an embodiment of the present invention.
  • the soft information of the source bit of the source node stored in the time slot corresponding to the current time slot is needed. If the current time slot is the nth time slot, the previous time slot is an n-k time slot, and k is a natural number.
  • the previous time slot adjacent to the current time slot is taken as an example for description.
  • the process includes the following steps:
  • Step 401 The destination node D combines the soft information of the source bits of the one or more source nodes stored in the previous time slot with the corresponding source nodes sent by the second relay node to the destination node D in the current time slot.
  • the encoded source bit soft information is subjected to alignment combining;
  • the combining mode may adopt a simple addition or a weighted addition manner, because the source bits are merged here, because the joint coded check bits and the separately coded check bits are different, and the source is The bits are the same.
  • Step 402 the destination node D decodes the received joint coded data; Step 403, it is determined whether the decoding is successful; if the determination result is yes, step 404 is performed; otherwise, step 405 is performed;
  • Step 404 in step 403, if the decoding is successful, the destination node determines that the decoding is correct, and the decoding process ends. In this way, the destination node D sends ACK signaling to the at least one source node, so that the at least one source node sends new data in the next time slot;
  • Step 405 in step 403, if the decoding is unsuccessful, the destination node D stores the soft information of the jointly encoded source bits of the one or more source nodes sent by the second relay node and the previous time slot respectively. Soft information registration of the source bits of the corresponding source node is merged;
  • the combining manner may adopt a simple addition or a weighted addition manner.
  • Step 406 The destination node D separately decodes data corresponding to the one or more source nodes.
  • Step 407 it is determined whether all the data originating from the at least one source node is successfully decoded; if the determination result is yes, step 404 is performed; otherwise, step 408 is performed;
  • Step 408 further determining whether the data decoding of one of the source nodes is successful, if the result of the determination is yes, proceed to step 409; otherwise, perform step 412;
  • Step 409 Replace the soft information of the source bit of the source node to which the correctly decoded data belongs in the received joint coded data into the decoded source bit of the corresponding source node, to obtain new data.
  • Step 410 Decode the obtained new data; if the decoding is successful, perform step 404; otherwise, perform step 411;
  • Step 411 If the decoding is successful, the decoding of the destination node ends, and the destination node notifies, according to the decoding result, that the source node corresponding to the correct decoding sends new data in the next time slot; and notifies the source of the corresponding decoding error.
  • the node retransmits the corresponding data in the next time slot;
  • Step 412 in step 408, if the decoding is unsuccessful, the decoding of the destination node D ends, and the destination node notifies at least one source node to retransmit the phase in the next time slot according to the decoding result.
  • the data should be.
  • the destination node D can decode the decoded data from the source node S according to the current slot and the decoding of the data from the source node S sent by the relay node.
  • the behavior of the source node S and the relay node R in the next time slot is determined, so that the source node S is transmitting data in any time slot, thereby avoiding waste of channel resources; in addition, the method has good compatibility.
  • the embodiment of the invention further provides a destination node, as described in the following embodiments. Since the principle of solving the problem by the destination node is similar to the above-mentioned data transmission method, the implementation of the destination node can refer to the implementation of the method, and the repeated description is not repeated.
  • Fig. 5 is a block diagram showing the configuration of a destination node in the second embodiment of the present invention.
  • the destination node includes: a first receiving unit 501, a first processing unit 502, a second receiving unit 503, and a first message notifying unit 504;
  • the first receiving unit 501 is configured to receive data sent by the at least one source node in the current time slot.
  • the first processing unit 502 is configured to perform demodulation and decoding on data sent by the at least one source node that is received by the first receiving unit 501. And obtaining a decoding result;
  • the second receiving unit 503 is configured to receive, by the first relay node, the demodulation and decoding of the data sent by the at least one source node received by the first time slot in the current time slot.
  • the first result notification unit 504 is configured to notify the source node to retransmit the data or transmit a new one in the next time slot according to the decoding result of the first processing unit 502 and the decoding result received by the second receiving unit 503. data.
  • the working manner of the first message notification unit 504 is as described in Embodiment 1, and details are not described herein again.
  • the destination node D can decode the decoded data from the source node S according to the current slot and the decoding of the data from the source node S sent by the relay node. As a result, the behavior of the source node S of the next time slot is determined, so that the source node S is transmitting data in any time slot, thereby avoiding waste of channel resources; in addition, the method has good compatibility.
  • Fig. 6 is a block diagram showing the configuration of a destination node according to a third embodiment of the present invention.
  • the destination node may include a first receiving unit 601, a first processing unit 602, a second receiving unit 603, and a first message notifying unit 604, and the functions thereof are consistent with the parts shown in FIG. No longer Narration.
  • the destination node further includes a second message notification unit 605, configured to notify the first processing unit 601 according to the decoding result of the first processing unit 601 and the decoding result received by the second receiving unit 603.
  • the first relay node transmits the data or is in a listening state in the next time slot.
  • the destination node not only determines the behavior of the source node of the next slot, but also determines the behavior of the first relay node.
  • the specific determination manner is as in Embodiment 1, and details are not described herein again.
  • only the destination node D notifies the at least one according to the decoding result of the data transmitted by the source node S and the decoding result transmitted by the first relay node.
  • the behavior of one source node in the source node in the next time slot, that is, the next transmission time interval, is taken as an example. Similar to other source node methods.
  • the first message notification unit 604 notifies that the first relay node that correctly decodes the data of one source node S1 retransmits the data of the one source node in the next time slot, and may adopt the following manner: Decoding result of the first relay node determines a set of first relay nodes that correctly decode data of the one source node S1; selects a first relay node from the set of the first relay nodes, and notifies The selected first relay node transmits data of the one source node in the next time slot.
  • FIG. 7 is a block diagram showing the structure of a second message notifying unit in Embodiment 3 of the present invention. For the sake of clarity, as described in Embodiment 1, the behavior of one source node in the next slot will be described as an example.
  • the second message notification unit includes: a set determining unit 701, a node selecting unit 702, and a message notifying unit 703;
  • a set determining unit 701 configured to determine, according to a decoding result of the first relay node, a set of first relay nodes that correctly decode data of the one source node;
  • the node selection unit 702 is configured to select one of the first relay nodes from the set of the first relay nodes determined by the set determining unit 701;
  • the message notification unit 703 is configured to notify the selected first relay node to send data of the one source node in the next time slot.
  • each destination node D fails to translate the data, the purpose
  • the node D establishes an alternate relay set for the data according to the decoding result sent by each listening relay node, such as ACK/NACK signaling.
  • a relay node is then selected from which to forward the data in the next time slot. If the alternate forwarding relay set of the data is empty, the corresponding source node is notified to retransmit in the next time slot.
  • a listening relay node when there are multiple source nodes, as long as a listening relay node can translate the codewords of at least one source node, it can be used as an alternative retransmission node. If the listening relay node translates the codewords of multiple source nodes, when the node is selected as the retransmission relay, it will simultaneously forward the codewords of all successfully translated pairs in an overlapping manner. If the relay node has multiple antennas, multiple codewords can be distributed across multiple antennas (like multiple relays).
  • the destination node D can flexibly select a relay for forwarding.
  • the selection strategy may include (i) prioritizing the relay with good channel quality; (ii) preferentially selecting the relay node that correctly decodes the data of the most abundant source node to free up more relay nodes for monitoring.
  • the destination node further includes: a third receiving unit 606, a second processing unit 607, and a third message notifying unit 608;
  • the third receiving unit 606 is configured to receive data sent by the second relay node, where the data sent by the second relay node is sent to notify the second relay node according to the time slot of the destination node before the current time slot.
  • the second processing unit 607 is configured to decode the data sent by the second relay node
  • the third message notification unit 608 is configured to notify the source to which the data sent by the second relay node belongs when the decoding is correct.
  • the node transmits new data in the next time slot; and is used to notify the source node to which the data transmitted by the second relay node belongs to retransmit the data in the next time slot in the decoding error.
  • the retransmission relay node transits to the listening state in the next time slot; otherwise The retransmission relay node continues to retransmit the data in the next time slot.
  • the listening relay node (the aforementioned first relay node) to translate the data of the multiple source nodes. Therefore, in the current time slot, the retransmission relay node may forward multiple sources at the same time. The data of the node. At this time, if the destination node D only translates the retransmission relay node If a part of the data is forwarded, the relay node continues to retransmit other data that has not been translated by the destination node D at the next moment.
  • the destination node D can decode the decoded data from the source node S according to the current slot and the decoding of the data from the source node S sent by the relay node.
  • the behavior of the source node S and the relay node R in the next time slot is determined, so that the source node S is transmitting data in any time slot, thereby avoiding waste of channel resources; in addition, the method has good compatibility.
  • Embodiment 4 of the present invention further provides a wireless communication system.
  • the wireless communication system includes: a source node, a relay node, and a destination node;
  • Source node used to send data
  • a first relay node configured to receive data sent by the source node, and perform demodulation decoding on the data to obtain a decoding result and send the decoding result;
  • a destination node configured to receive data sent by the source node, demodulate and decode the data to obtain a decoding result, and receive a decoding result sent by the relay node, and perform solution according to the data of the source node.
  • the decoding result of the modulation decoding and the decoding result of the first relay node notify the at least one source node to retransmit the data or transmit new data in the next time slot.
  • the first relay node may be a monitoring relay node.
  • the relay node further includes a second relay node, configured to send, to the destination node, the destination node notifying the data sent by the second relay node in the last time slot.
  • the second relay node is a retransmission relay node in the current time slot.
  • the first relay node receives data sent by at least one source node in the current time slot, and modulates and decodes the data to obtain a decoding result; and sends the decoding result to the destination node.
  • the first relay node may include: a data receiving unit, configured to receive data sent by the at least one source node in a current time slot; and a data processing unit, configured to perform modulation and decoding on the data, to obtain a decoding result. And a message sending unit, configured to send the obtained decoding result to the destination node.
  • the second relay node sends, to the destination node, the time slot of the at least one source node before the current time slot in the current time slot, and the data sent in the previous time slot, the number According to this, the second relay node correctly decodes the data.
  • the number of source nodes, relay nodes, and destination nodes is not limited and may be one or more.
  • FIG. 8 is a timing chart of a HARQ system without relay cooperation in the prior art
  • FIG. 9 is a timing chart of a HARQ system with relay cooperation according to Embodiment 4 of the present invention.
  • the source node S first transmits data, and the destination node D receives the data at the same time.
  • the destination node D starts demodulation decoding and other processing after receiving the last sample of the signal sent by the source node S, and then obtains the decoding result. If the decoding is correct, the ACK signaling is sent to the source node S. If the decoding is wrong, NACK signaling is sent to the source node. After the signaling signal has completely arrived at the source node S, the source node S begins decoding and prepares the transmission signal for the next slot.
  • the signal sent by the source node S in the next time slot may be new data or a retransmission of the original data.
  • the time spent on "S processing" in Figure 8 is generally much less than the "D processing" time. Because destination node D takes a lot of time in demodulation and decoding, especially for modern coding and high-order modulation, as well as with multiple antennas.
  • S and R transmission means that one or more source nodes and possibly one or more retransmission relay nodes are concurrent on the traffic channel in the time slot. Way to send a signal.
  • D and R processing means that the destination node and the listening relay node demodulate and decode the received signal, respectively. After the decoding is completed, all the listening relay nodes send ACK/NACK signaling to the destination node D through the control channel. Subsequent "D processing” indicates that the destination node D decodes the signaling and prepares the process of feedback signaling "D feedback". In general, signaling decoding and processing takes much less time than decoding user data.
  • the destination node D After receiving the feedback signaling of each relay node, the destination node D determines the actions of the next time slot, each source node, and each relay node according to the description of the foregoing protocol. "S and R processing" means that the source node and the relay node decode the ACK/NACK command of the destination node D and prepare for the next slot.
  • multiple listening relay nodes may send in parallel ACK/NACK signaling.
  • each node must adopt a certain multiple access method (for example, direct sequence spread spectrum, or time division, frequency division multiple access method), so that the destination node D can identify the source of the signaling.
  • the retransmission command sent by the destination node D to each node must also be transmitted in a multiplexed or multiple-access manner.
  • FIG. 10 is a schematic view showing the working principle of Embodiment 4 of the present invention. If the timing shown in FIG. 9 is adopted, FIG. 10 includes three source nodes S1, S2, and S3. In the first time slot, the three source nodes respectively transmit data xl(l), x2(l), and x3. (l) o There are three relay nodes R1, R2, R3, which are all listening relay nodes in the first time slot. Also includes a destination node D.
  • the three source nodes Sl, S2, S3 send data xl(l), x2(l), x3(l);
  • the relay nodes R1, R2, R3, and the destination node D receive the data xl(l), x2(l), x3(D;
  • the relay node R1, R2, R3 and the destination node D demodulate and decode the received data xl(l), x2(l), x3(l), and obtain a decoding result;
  • the destination node D does not correctly decode the received data xl(l), x2(l), and x3(l), the translation of the corresponding data xl(l), x2(l), x3(l)
  • the code result is NACK;
  • the decoding result of the received data by the relay node R1 is in turn It is: ACK NACK ACK; the relay node R2 is NACK NACK NACK; the relay node R3 is NACK NACK NACK.
  • the relay nodes R1, R2, and R3 transmit the decoded result to the destination node D.
  • the destination node D receives the ACK/NACK transmitted by the relay node and combines its own decoding result NACK to determine the action of the source node Sl, S2, S3 and the relay nodes R1, R2, R3 in the next slot.
  • the decoding result of the destination node is NACK
  • the decoding result of the data x1(1) of the relay node R1 to S1 is ACK
  • the destination node D sends an ACK to the source node S1 to enable the The source node S1 transmits new data in the next slot
  • the decoding result of the destination node is NACK, and all relay nodes are paired with S2.
  • the decoding result of the data x2(1) is all NACK, then the destination node D sends a NACK to the source node S2, so that the source node S2 retransmits the data x2(l) in the next time slot ;
  • the decoding result of the destination node is NACK
  • the decoding result of the data x3(l) of the relay node R1 to S, 3 is ACK
  • the destination node D sends an ACK to the source node S3 to make the ACK
  • the source node S3 transmits new data in the next slot
  • the relay nodes R2 and R3 decode the data xl(l), x2(l), and x3(l) of all the source nodes S1, S2, and S3, and the destination node D is in the middle. Following the transmission of ACKs by nodes R2 and R3, the relay nodes R2 and R3 are still in the listening state in the next time slot.
  • the destination node D Since the destination node D decodes all the data incorrectly, and the decoding of the x1(1) and x3(l) by the relay node R1 is correct, the destination node D sends a NACK to the relay node R1, so that the relay node R1 sends xl(l), x3(l) in the next slot.
  • Source node S2 retransmits data x2(l);
  • Source node S1 and source node S3 send new data xl(2), x3(2) ;
  • Relay node R1 forwards xl(l)+x3(l);
  • Relay node R2 and relay node R3 continue to listen.
  • the relay node R1 forwards the data from the source nodes S1 and S3, the data from the source nodes S1 and S3 is jointly encoded, and the encoded data is sent to the destination node D.
  • Destination node D the corresponding processing steps are:
  • destination node D In slot n (as in the previous slot of the current slot), destination node D does not correctly decode the data from source nodes S1 and S3, and relay node R1 correctly decodes the data from both.
  • the destination node stores soft information for each bit (bit) of the data packet corresponding to the source nodes S1 and S3.
  • the relay node R1 jointly encodes the source bits of the corresponding source nodes S1 and S3,
  • the coding mode is the same as that of the data packets sent by the source nodes S1 and S3 in the slot n, and may be Turbo coding, convolutional code, etc.; and the encoded data is sent to the destination node D.
  • D of the destination node After receiving the jointly encoded data xl(l)+ X3 (l) from the relay node R1, D of the destination node firstly stores the source bit soft information of the corresponding source nodes S1 and S3.
  • the combining mode may adopt a simple addition or a weighted addition manner; and decoding the jointly encoded data, if the decoding is correct, the decoding process ends, to the source Nodes S1 and S3 send an ACK such that source nodes S1 and S3 transmit new data in the next slot.
  • the destination node D combines the soft information of the source bits of the corresponding source nodes S1 and S3 in the joint coding with the soft information of the source bits corresponding to the previously stored S1 and S3, and the merge mode may be simply added or weighted. In the addition manner, the data packets corresponding to S1 and S3 are respectively decoded. If all decoding is correct, the decoding process is ended, and ACKs are sent to the source nodes S1 and S3, so that the source nodes S1 and S3 send new ones in the next time slot. data.
  • the source bit soft information in the corresponding joint node S1 (or S2) in the obtained joint coded data may be replaced with the obtained source node S1 (or S2). Decoding the corresponding source bit, and decoding the newly obtained data packet. If the decoding is successful, the decoding process is ended, and the ACK is sent to the source nodes S1 and S3, so that the source node
  • the decoding fails, and the destination node D sends an ACK to the source node S1 corresponding to the successful decoding (or
  • the destination node D sends a NACK to the source node S2 (or Sl) corresponding to the decoding failure.
  • the source node S1 is notified by means of ACK/NACK signaling indicating correct reception, but is not limited thereto.
  • the retransmission control information may also contain other information, such as a codeword requesting retransmission, depending on the specific protocol. Numbering.
  • the destination node D can decode the decoded data from the source node S according to the current slot and the decoding of the data from the source node S sent by the relay node.
  • the behavior of the source node S and the relay node R in the next time slot is determined, so that the source node s is transmitting data in any time slot, thereby avoiding waste of channel resources; in addition, the method has good compatibility.
  • Figure 11 is a flow chart showing the data transmission method of the fifth embodiment of the present invention. As shown in FIG. 11, the method includes: Step 1101: Receive, by the destination node, the data sent by the at least one source node in the current time slot. Step 1102: Demodulate and decode the data sent by the at least one source node to obtain a decoding result.
  • Step 1103 Notify the at least one source node of the decoding result, so that the at least one source node determines to retransmit the data in the next time slot according to the decoding result sent by the destination node and the decoding result sent by the third relay node. Or transfer new data.
  • the destination node D returns a decoding result to the source node S, and the decoding result may be ACK/NACK signaling, indicating whether the data of the source node is correctly decoded.
  • the third relay node in the current slot also receives the data sent by the at least one source node, and demodulates and decodes the data to obtain a decoding result, and the decoding result is directed to The source node sends.
  • the destination node D after completing the decoding, the destination node D sends a decoding result to the source node, and feeds back an ACK/NACK command through the downlink signaling channel to indicate whether it has translated the data of the original node S, so that the source node according to the source node
  • the decoding result fed back by the destination node D and the decoding result fed back by the relay node determine its action in the next slot.
  • the method further includes: the destination node D receiving, by the third relay node, decoding, demodulating and decoding data sent by at least one source node received in the current time slot.
  • the third relay node is in a listening state in the current time slot.
  • the destination node D notifies the relay node to retransmit the data of the source node or the listening state in the next time slot according to the decoding result of decoding the data sent by the source node and the decoding result of the third relay node. .
  • the destination node D translates the data currently sent by all the source nodes, all the current listening relay nodes are still in the listening state in the next time slot; if a listening relay node is not translated to any one source The data sent by the current time slot of the node is still in the listening state in the next time slot.
  • a listening relay node If a listening relay node translates a codeword currently sent by a source node and D fails to translate the codeword, the listening relay node becomes an alternate retransmission relay node. among them, How to select an alternate retransmission relay node is as described in Embodiment 1, and details are not described herein again.
  • the destination node D after receiving the decoding result sent by the third relay node, the destination node D can only determine the next time according to the decoding result processed by itself and the decoding result sent by the third relay node.
  • the behavior of the third relay node simplifies the processing of the destination node D.
  • one source node S1 of the at least one source node is taken as an example for description.
  • the destination node D notifies the third relay node to retransmit the data of the source node or the listening state in the next time slot according to the decoding result of the source node S1 and the decoding result of the third relay node, including:
  • the destination node D If the decoding result of the destination node D for the one source node S1 is correct, the destination node D notifies that the third relay node that decodes the data of one source node S1 is in the listening state in the next time slot, and may The third relay node sends an ACK signaling to notify the third relay node that it is in a listening state; if the destination node D decodes the result of the one source node S1 incorrectly, and the third relay node is to the one source node If the decoding result of S1 is correct, the destination node D notifies the third relay node that correctly decodes the data of one source node S1 to resend the data in the next time slot, where the data may be sent to the third relay node. NACK signaling notifies the third relay node to resend the data.
  • the third relay node R can send ACK/NACK signaling to notify the source node S and the destination node D whether to decode correctly.
  • both the source node S and the destination node D can learn the decoding result of each listening relay node.
  • the destination node controls the actions of the third relay nodes based on the decoding result of itself and the decoding result from the third relay node.
  • the embodiment of the invention further provides a destination node, as described in the following embodiments. Since the principle of solving the problem by the destination node is similar to the data transmission method based on the foregoing embodiment 5, the implementation of the destination node can be referred to the implementation of the method, and the repeated description is not repeated.
  • Figure 12 is a block diagram showing the configuration of a destination node in the sixth embodiment of the present invention. As shown in Figure 12, the destination node includes:
  • the fourth receiving unit 1201 is configured to receive data sent by the at least one source node in the current time slot.
  • the third processing unit 1202 is configured to demodulate data sent by the at least one source node. Decoding to obtain a decoding result;
  • the fourth message notification unit 1203 is configured to notify the at least one source node of the decoding result of the third processing unit 1202, so that the at least one source node sends the decoding result sent by the destination node and the third relay node.
  • the decoding result determines that the data of the source node is retransmitted or new data is transmitted in the next time slot.
  • the destination node further includes:
  • the fifth receiving unit 1204 is configured to receive, by using the third relay node, a decoding result after demodulating and decoding the data sent by the at least one source node received in the current time slot;
  • the fifth message notification unit 1205 is configured to notify the third relay node to retransmit the data of the source node in the next time slot according to the decoding result of the third processing unit 1202 and the decoding result received by the fifth receiving unit 1204. Or in the listening state.
  • the project that determines the behavior of the third relay node in the next time slot according to the decoding result of the third relay node and the decoding result of the third node is as described in Embodiment 5, and is no longer Narration.
  • the third relay node R can send ACK/NACK signaling to notify the source node S and the destination node D whether to decode correctly.
  • both the source node S and the destination node D can learn the decoding result of each listening relay node.
  • the destination node controls the actions of the third relay nodes based on the decoding result of itself and the decoding result from the third relay node.
  • Figure 13 is a flow chart showing the data transmission method of Embodiment 7 of the present invention. As shown in Figure 7, the method includes:
  • Step 1301 The third relay node receives data sent by at least one source node in a current time slot.
  • Step 1302 Demodulate and decode data sent by at least one source node to obtain a decoding result.
  • the three relay node transmits the data of the source node or the feedback signaling in the listening state in the next time slot.
  • the third relay node may simultaneously notify the destination node and the at least one source node. Decoding the result; or the third relay node notifies the at least one source node and the destination node in order from time to time.
  • the third relay node is a listening relay node.
  • the embodiment of the invention further provides a relay node, as described in the following embodiments.
  • the principle of the problem solved by the destination node is similar to the data transmission method of the foregoing embodiment 7. Therefore, the implementation of the relay node can refer to the implementation of the method, and the repeated description is not repeated.
  • FIG 14 is a block diagram showing the structure of a relay node according to Embodiment 8 of the present invention.
  • the relay node includes: a sixth receiving unit 1401, configured to receive data sent by at least one source node in a current time slot;
  • the fourth processing unit 1402 is configured to perform demodulation decoding on the data received by the sixth receiving unit 1401 to obtain a decoding result.
  • the sixth message notification unit 1403 is configured to notify the at least one source node and the destination node of the decoding result of the fourth processing unit 1402, so that the source node performs the translation according to the decoding unit of the notification unit 1403 and the destination node.
  • the code result determines to retransmit the data or transmit new data in the next time slot; causing the destination node to notify the relay node to transmit the source node in the next time slot according to the decoding result of the notification unit and the decoding result of the destination node.
  • the data is either in the listening state.
  • the relay node is a listening relay node.
  • the retransmission relay node may include: a data sending unit, configured to send data transmitted by the last time slot source node to the destination node in the current time slot; and a message processing unit, configured to:
  • the behavior of the next time slot is determined according to the signaling (ACK/NACK) returned by the destination node D. For example, if the destination node D translates the data sent by the current time slot of a retransmission relay node, the retransmission relay node transits to the listening state in the next time slot; otherwise, the retransmission relay node is in the next time.
  • the slot continues to retransmit the codeword.
  • FIG. 15 is a flow chart showing the data transmission method of the ninth embodiment of the present invention. As shown in FIG. 15, the method includes:
  • Step 1501 The current slot source node sends data to the destination node and the third relay node.
  • Step 1502 Receive a decoding result after the destination node and the third relay node demodulate and decode the data.
  • Step 1503 Determine, according to the decoding result returned by the destination node and the third relay node, that the source node retransmits the data or transmits new data in the next time slot.
  • step 1503 if at least one of the destination node or the third relay node decodes the data sent by the source node in the current slot, the source node determines the next slot. Transfer new data;
  • the source node determines to retransmit the current time slot in the next time slot. The data sent.
  • An embodiment of the present invention further provides a source node, as described in the following embodiments.
  • the principle of solving the problem is similar to the data transmission method based on the foregoing embodiment 9. Therefore, the implementation of the source node can refer to the implementation of the method, and the repeated description is not repeated.
  • FIG 16 is a diagram showing the structure of a source node in Embodiment 10 of the present invention. As shown in Figure 10, the source node includes:
  • the sending unit 1601 is configured to send data to the destination node and the third relay node in the current slot source node.
  • the seventh receiving unit 1602 is configured to receive a decoding result that is demodulated and decoded by the destination node and the third relay node.
  • the fifth processing unit 1603 is configured to determine, according to the decoding result received by the seventh receiving unit 1602, that the source node retransmits the data or transmits new data in the next time slot.
  • the destination node D can decode the decoded data from the source node S according to the current slot and the decoding of the data from the source node S sent by the relay node.
  • the behavior of the next time slot relay node R is determined; in addition, the source node S can determine the behavior of the next time slot according to the decoding result of the destination node D and the decoding result sent by the relay node, thereby making the source Node S is transmitting data in any time slot. Avoid waste of channel resources; in addition, the method is compatible.
  • the embodiment 11 of the present invention further provides a wireless communication system.
  • the wireless communication system includes: a source node, a relay node, and a destination node; wherein the relay node may include a monitoring relay node and retransmission Relay node.
  • the source node, the relay node, and the destination node are as shown in Embodiments 6, 8, and 10, and the respective working processes are as described in Embodiments 5, 7, and 9, and are not described herein again.
  • the control channel is separated by uplink (S to D) and downlink (D to S) duplex, it can work according to the timing shown in Figure 17.
  • the destination node D After completing the decoding, the destination node D immediately feeds back the ACK/NACK command through the downlink signaling channel to indicate whether the codeword of the S is translated.
  • R sends an ACK/NACK command on both the uplink and downlink control channels to notify S and D whether they are correctly decoded.
  • D while transmitting signaling on the downlink control channel, also monitors signaling on the uplink control channel. In this way, both S and D can know the decoding result of each listening relay node.
  • the "D feedback 2" in this sequence is only for the relay node and is used to control the actions of each relay node.
  • the source node S needs to have the ability to receive ACK/NACK commands from different nodes. This ability already exists in many systems. For example, in a cellular system that supports soft handoff, the user can simultaneously receive control commands from different base stations.
  • S and R transmission the three source nodes S1, S2, S3 transmit data xl(l), x2(l), x3(l) ; in addition, the retransmission relay of the current slot
  • the node sends the data of the last time slot source node to the destination node D; wherein, the data destination node is decoded incorrectly, and the relay node decodes correctly;
  • D and R processing the relay nodes R1, R2, R3, and the destination node D receive the data xl(l), x2(l), x3(l) ;
  • the relay node R1, R2, R3 and the destination node D demodulate and decode the received data xl(l), x2(l), x3(l), and obtain a decoding result;
  • the decoding results of the corresponding data xl(l), x2(l), x3(l) are all NACK;
  • the decoding result of the received data by the relay node R1 is in turn It is: ACK NACK ACK; the relay node R2 is NACK NACK NACK; the relay node R3 is NACK NACK NACK.
  • D feedback 1, R feedback 1, R feedback 2 D feeds the decoding result NACK NACK NACK to the source nodes S1, S2, S3; the relay nodes R1, R2, R3 will simultaneously aim the decoding result Node D and the corresponding source nodes S1, S2, S3 are sent.
  • the destination node D receives the ACK/NACK of the corresponding source node S1, S2, S3 sent by the relay node, and combines its own decoding result NACK to determine the source relay node R1, R2 in the next slot. , R3 action.
  • the destination node D notifies each relay node of the processing result of "D processing", for example, if the relay nodes R2 and R3 transmit data xl(l), x2 to all source nodes S1, S2, S3 ( l) If x3(l) is decoded incorrectly, the destination node D sends an ACK to the relay nodes R2 and R3, so that the relay nodes R2 and R3 are still in the listening state in the next time slot.
  • the destination node D Since the destination node D decodes all the data incorrectly, and the decoding of the x1(1) and x3(l) by the relay node R1 is correct, the destination node D sends a NACK to the relay node R1, so that the relay node R1 sends xl(l), x3(l) in the next slot.
  • the source node S1 determines to transmit new data in the next slot;
  • the source node S2 For the source node S2, the decoding result of the destination node is NACK, and the decoding result of the data x2(1) of all relay nodes to S2 is NACK, then the source node S2 sends a NACK to determine to retransmit the data in the next time slot.
  • X2(l) For the source node S2, the decoding result of the destination node is NACK, and the decoding result of the data x2(1) of all relay nodes to S2 is NACK, then the source node S2 sends a NACK to determine to retransmit the data in the next time slot.
  • the source node S3 determines to transmit new data in the next slot. As shown in Figure 10, in the second time slot:
  • Source node S2 retransmits data x2(l);
  • Source node S1 and source node S3 send new data xl(2), x3(2) ;
  • Relay node R1 forwards xl(l)+x3(l);
  • Relay node R2 and relay node R3 continue to listen.
  • the listening relay node cannot simultaneously send two different directions of signaling, and the destination node D cannot simultaneously monitor while transmitting signaling. Following the signaling sent by the node. In this case, you can use the working mode shown in Figure 18.
  • the relay node repeats the ACK/NACK instruction.
  • the destination node D immediately transfers to the receiving signaling state after transmitting the signaling to learn the decoding state of each listening relay node.
  • the timing chart shown in Fig. 18 can be further simplified to the timing shown in Fig. 19.
  • the destination node D If the destination node D fails to decode, it transits to the signaling reception state, and if the source node S receives any ACK, the neighboring relay node transmits new data in the next time slot. Otherwise, if there is no ACK command, it is understood by NACK, and the data is automatically retransmitted at the next moment.
  • the destination node D If the destination node D is transmitting an ACK command, although it cannot listen to the relayed command, in the case where the destination node D is translated, D does not need to know whether the relay is also translated, and therefore does not need to be monitored.
  • the destination node D can decode the decoded data from the source node S according to the current slot and the decoding of the data from the source node S sent by the relay node.
  • the behavior of the next time slot relay node R is determined;
  • the source node S can determine the behavior of the next time slot according to the decoding result of the destination node D and the decoding result sent by the relay node, thereby making the source Node S is transmitting data in any time slot to avoid waste of channel resources; in addition, the method is compatible.
  • An embodiment of the present invention further provides a computer readable program, wherein when the program is executed in a destination node, the program causes a computer to execute in the destination node as in Embodiment 1.
  • the embodiment of the present invention further provides a storage medium storing a computer readable program, wherein the computer readable program causes a computer to execute the data transmission method as described in Embodiments 1 and 5 in a destination node.
  • the embodiment of the present invention further provides a computer readable program, wherein when the program is executed in a relay node, the program causes a computer to execute the data transmission method as described in Embodiment 7 in the relay node.
  • An embodiment of the present invention further provides a storage medium storing a computer readable program, wherein the computer readable program causes a computer to execute the data transmission method as described in Embodiment 7 in a relay node.
  • the embodiment of the present invention further provides a computer readable program, wherein when the program is executed in a source node, the program causes a computer to execute the data transmission method as described in Embodiment 9 in the source node.
  • An embodiment of the present invention is a storage medium storing a computer readable program, wherein the computer readable program causes a computer to execute the data transmission method as described in Embodiment 9 in a source node.
  • the above apparatus and method of the present invention may be implemented by hardware or by hardware in combination with software.
  • the present invention relates to a computer readable program that, when executed by a logic component, enables the logic component to implement the apparatus or components described above, or to cause the logic component to implement the various methods described above Or steps.
  • the present invention also relates to a storage medium for storing the above program, such as a hard disk, a magnetic disk, an optical disk, a DVD, a flash memory, or the like.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Description

一种数据传输方法、 无线通信系统、 目的节点和中继节点 技术领域
本发明涉及一种通信领域, 特别涉及一种数据传输方法、 无线通信 系统、 目的节点和中继节点。
背景技术
协作通信技术与传统的点到点通信不同,在协作通信系统中引入"中 继节点 "协助源节点到目的节点的信息传输。 因此, 一个协作通信系统 包含源节点 S、 中继节点 R和目的节点 D。
协作通信系统与多跳系统不同。 其中, 如果源节点 S到目的节点 D 之间不存在直接的链路, 即接收信号电平低于最小要求的数值, 以至于 源节点 S到目的节点 D不能直接通信, 一般称这样的系统为多跳系统; 如果源节点 S到目的节点 D之间存在直接的通信链路, 一般称这样的系 统为协作系统。 上述两种系统的差别在于, 在多跳系统中, 如果没有中 继节点 R的转发, 源节点 S到目的节点 D的通信不能实现。 而在协作系 统中, 源节点 S到目的节点 D之间能够直接通信, 只是在中继节点 R的 帮助下, 源节点 S到目的节点 D的通信性能可以提高, 体现为数据速率 的提高或者成功率的提高。
目前,在各种协作通信技术中, 中继节点的作用是转发来自源节点 S 的信号。 其转发方式可包括: 非再生式中继 (放大转发, AF : Amplify-and-Forward) 和 再 生 式 中 继 ( 解 码 转 发 , DF : Decode-and-Forward)[2]。 其中, 在放大转发 AF中, 中继节点 R发送的 信号是接收信号的直接放大。该放大转发 AF方式的优点是处理简单, 缺 点是所转发的信号同时也放大了接收的噪声。在解码转发 DF中, 中继节 点 R先对接收到的信号进行译码, 其发射的信号是数据重新进行了编码 调制后的信号。 该中继转发 DF 方式的优点是可以消除接收信号中的噪 声, 缺点是其接收机相比放大转发 AF方式而言需要更多的处理能力。
混合自动请求重传 (HARQ: Hybrid Automatic Repeat Request) 综 合了前向纠错控制 (FEC: Forward Error Correction) 技术和自动请求重 传(ARQ: Automatic Repeat Request)技术, 是一种应用极其普遍的技术, 它可以提高系统的吞吐量和传输可靠性 [6]。 在 HARQ技术中, 源节点 S 先将拟发送的信息通过差错控制编码编为一个码字, 然后经过调制之后, 发往目的节点 D; 该目的节点 D执行相应的解调译码, 并根据循环冗余 检测 (CRC: Cyclical Redundancy Check) 或者编码自身的特性判断译码 输出是否正确; 如果译码不正确, 则要求源节点 S进行重传。 目前最基 本的重传请求信息是接收确认 (ACK : ACKnowledgment ) 和非确认 (NACK, Not ACKnowledgment) , 分别表示译码成功或失败。
图 1是时隙数为 4的信道示意图。 其中典型的处理方式是将信道按 时间划分成帧, 每帧分成 N个时隙, 编号为 1到N。 所有帧中, 相同编 号的时隙构成一个子信道, 这些子信道也称为 ARQ子流或者 ARQ子过 程。 如图 1所示, N=4, 即有 4个 ARQ子流, 以时分复用的方式工作。 以第 1个子流来说, 源节点 S在帧 1的 1号时隙发送码字, 目的节点 D 进行接收译码之后, 在下一个时隙, 即帧 2 的 1 号时隙之前发回 ACK/NACK指令。 然后源节点 S对指令进行接收译码, 再根据指令内容 准备帧 3的 1号时隙的发送内容, 它可能是新数据, 也可能是前一数据 的重传。
该混合自动请求重传 HARQ 技术可用于有中继节点的协作通信系 统。 在现有的无中继 HARQ系统中, 错误的码字只能由源节点 S执行重 传。 在有中继协助的 HARQ系统中, 中继节点 R也可以协助进行重传。
但是在实现本发明的过程中发明人发现现有技术的缺陷在于: 现有 的中继协助的 HARQ方法都是基于解码转发(DF: Decode- and-Rorward) [2]方式, 在重传时隙, 源节点 S和无中继节点的系统一样, 不能发送新 的码字。 因此, 不能充分地利用重传时间和中继节点 R所带来的空时维 度, 会造成一定程度的信道资源浪费。
下面列出了对于理解本发明和常规技术有益的文献, 通过引用将它 们并入本文中, 如同在本文中完全阐明了一样。
[1] T.M.Cover, A. El. Gamal, " Capacity theorems for the relay channel,,, IEEE Transaction on Information Theory , vol IT- 25, pp. 572-584. Sept.1979.
[2] J. N. Laneman, D.N.C. Tse and G. W. Wornell, " Cooperative Diversity in wireless Networks: Efficient protocols and outage behavior, " IEEE Transaction on Information Theory, vol 50, pp. 3062-3080, Dec.2004.
[3] Yinan Qi, Reza Hoshyar, Rahim Tafazolli. "A New ARQ Protocol for Hybrid DF/CF Relay Scheme,,, IEEE Vehicular Technology Conference, Spring 2009. pp. 1-5
[4] I. Byun, D. Rhee, Y. J. Sang, M. Y. Kang, K. S. Kim, Performance analysis of a decode- and-forward based hybrid- ARQ protocol," IEEE Military Communications Conference (MILCOM'08), 16-19 Nov. 2008, pp. 1-5.
[5] I. Stanojev, O. Simeone, Y. Bar-Ness and C. You, Performance of Multi-Relay Collaborative Hybrid- ARQ Protocols over Fading Channels," IEEE Communications Letters, vol. 10, no. 7, pp. 522-524, Jul. 2006.
[6] Shu Lin Costello, D. Miller, M, " Automatic-repeat-request error- control schemes, " IEEE Communications Magazine, vol. 22, no. 12, Dec. 1984
[7] D. Chase, Code combining - A maximum-likelihood decoding approach for combining an arbitrary number of noisy packets," IEEE Transaction Communication, vol. 33, no. 5, pp. 385-393, May. 1985.
[8] A Sendonaris, E Erkip, B Aazhang, "User cooperation diversity. Parti.
System description," Communications, IEEE Transactions on Volume 51, Issue 11, Nov. 2003. 发明内容
本发明实施例的目的在于提供一种数据传输方法、 无线通信系统、 目的节点和中继节点, 通过该方法, 目的节点根据对当前时隙来自源节 点的数据进行译码的译码结果和中继节点发送的对当前时隙来自源节点 的数据进行译码的译码结果来决定下一个时隙源节点 S和中继节点 R的 行为, 从而使源节点 S在任何时隙都在发送数据, 避免信道资源的浪费, 并且该方法兼容性好。
根据本发明实施例的一个方面提供了一种数据传输方法, 该方法包括: 在当前时隙目的节点接收至少一个源节点发送的数据; 对该至少一个源节点发送的数据进行解调译码, 以获得译码结果; 接收第一中继节点发送的该第一中继节点对在该当前时隙接收的至 少一个源节点发送的数据进行解调译码后的译码结果;
该目的节点根据对该源节点的数据进行解调译码的译码结果和该第 一中继节点的译码结果通知该源节点在下一个时隙重传该数据或传送新 的数据。
根据本发明实施例的另一个方面提供了一种目的节点, 该目的节点 包括:
第一接收单元, 该第一接收单元用于在当前时隙接收至少一个源节 点发送的数据;
第一处理单元, 该第一处理单元用于对该第一接收单元接收到的该 至少一个源节点发送的数据进行解调译码, 以获得译码结果;
第二接收单元, 该第二接收单元用于接收第一中继节点发送的该第 一中继节点对在该当前时隙接收的至少一个源节点发送的数据进行解调 译码后的译码结果;
第一消息通知单元, 该第一消息通知单元用于根据对该第一处理单 元的译码结果和该第二接收单元接收的译码结果通知该一个源节点在下 一个时隙重传该数据或传送新的数据。
根据本发明实施例的另一个方面提供了一种无线通信系统, 包括: 源节点, 该源节点用于发送数据;
中继节点, 该中继节点用于接收该源节点发送的数据, 并对该数据 进行解调译码, 以获得译码结果并将译码结果进行发送;
目的节点, 该目的节点用于接收该源节点发送的数据, 对该数据进 行解调译码, 以获得译码结果; 并接收该中继节点发送的译码结果, 并 根据对该源节点的数据进行解调译码的译码结果和该第一中继节点的译 码结果通知该一个源节点在下一个时隙重传该数据或传送新的数据。
根据本发明实施例的另一个方面提供了一种数据传输方法, 该方法 包括: 在当前时隙目的节点接收至少一个源节点发送的数据; 对该至少一个源节点发送的数据进行解调译码, 以获得译码结果; 将该译码结果通知该至少一个源节点, 使得该至少一个源节点根据 该目的节点发送的译码结果和第三中继节点发送的译码结果决定在下一 个时隙重传该数据或传送新的数据。
根据本发明实施例的另一个方面提供了一种数据传输方法, 该方法 包括:
在当前时隙第三中继节点接收至少一个源节点发送的数据; 对该至少一个源节点发送的数据进行解调译码, 以获得译码结果; 将该译码结果通知该至少一个源节点和该目的节点。
根据本发明实施例的另一个方面提供了一种数据传输方法, 该方法 包括:
在当前时隙源节点向目的节点和第三中继节点发送数据;
接收该目的节点和该第三中继节点对该数据进行解调译码后的译码 结果;
根据该目的节点和该第三中继节点返回的译码结果确定该源节点在 下一个时隙重传该数据或传送新的数据。
根据本发明实施例的另一个方面提供了一种目的节点, 该目的节点 包括:
第四接收单元, 用于在当前时隙接收至少一个源节点发送的数据; 第三处理单元, 用于对该至少一个源节点发送的数据进行解调译码, 以获得译码结果;
第四消息通知单元, 用于将该第三处理单元的译码结果通知该至少 一个源节点, 使得该至少一个源节点根据该目的节点发送的译码结果和 中继节点发送的译码结果决定在下一个时隙重传该数据或传送新的数据。
根据本发明实施例的另一个方面提供了一种中继节点, 该中继节点 包括:
第六接收单元, 用于在当前时隙接收至少一个源节点发送的数据; 第四处理单元, 用于对该第六接收单元接收的数据进行解调译码, 以获得译码结果;
第六消息通知单元, 用于将该第四处理单元的译码结果通知该至少 一个源节点和该目的节点, 使得该源节点根据该通知单元的译码结果和 该目的节点发送的译码结果决定在下一个时隙重传该数据或传送新的数 据; 使得该目的节点根据该通知单元的译码结果和该目的节点的译码结 果通知该中继节点在下一个时隙传送该源节点的数据或者处于监听状态。
根据本发明实施例的另一个方面提供了一种源节点, 该源节点包括: 发送单元, 用于在当前时隙源节点向目的节点和第三中继节点发送 数据;
第七接收单元, 用于接收该目的节点和该第三中继节点对该数据进 行解调译码后的译码结果;
第五处理单元, 用于根据该第七接收单元接收的译码结果确定该源 节点在下一个时隙重传该数据或传送新的数据。
根据本发明实施例的另一个方面提供了一种无线通信系统, 该系统 包括上述源节点、 中继节点和目的节点。
根据本发明实施例的另一个方面提供了一种计算机可读程序, 其中 当在目的节点中执行该程序时, 该程序使得计算机在该目的节点中执行 上述数据传输方法。
根据本发明实施例的另一个方面提供了一种存储有计算机可读程序 的存储介质, 其中该计算机可读程序使得计算机在目的节点中执行上述 数据传输方法。
根据本发明实施例的另一个方面提供了一种计算机可读程序, 其中 当在中继节点中执行该程序时, 该程序使得计算机在该中继节点中执行 上述数据传输方法。
根据本发明实施例的另一个方面提供了一种存储有计算机可读程序 的存储介质, 其中该计算机可读程序使得计算机在中继节点中执行上述 数据传输方法。
根据本发明实施例的另一个方面提供了一种计算机可读程序, 其中 当在源节点中执行该程序时, 该程序使得计算机在该源节点中执行上述 数据传输方法。
根据本发明实施例的另一个方面提供了一种存储有计算机可读程序 的存储介质, 其中该计算机可读程序使得计算机在源节点中执行上述数 据传输方法。
本发明实施例的有益效果在于: 目的节点根据对当前时隙来自源节 点的数据进行译码的译码结果和中继节点发送的对当前时隙来自源节点 的数据进行译码的译码结果来决定下一个时隙源节点 S和中继节点 R的 行为, 从而使源节点 S在任何时隙都在发送数据, 避免信道资源的浪费。
参照后文的说明和附图, 详细公开了本发明的特定实施方式, 指明 了本发明的原理可以被采用的方式。 应该理解, 本发明的实施方式在范 围上并不因而受到限制。 在所附权利要求的精神和条款的范围内, 本发 明的实施方式包括许多改变、 修改和等同。
针对一种实施方式描述和 /或示出的特征可以以相同或类似的方式在 一个或更多个其它实施方式中使用, 与其它实施方式中的特征相组合, 或替代其它实施方式中的特征。
应该强调, 术语 "包括 /包含"在本文使用时指特征、 整件、 步骤或 组件的存在, 但并不排除一个或更多个其它特征、 整件、 步骤或组件的 存在或附加。 附图说明
从以下结合附图的详细描述中,本发明实施例的上述以及其他目的、 特征和优点将变得更加显而易见, 在附图中:
图 1是时隙数为 4的信道示意图;
图 2是本发明实施例的有中继协作的无线通信系统结构示意图; 图 3是本发明实施例 1的数据传输方法流程图;
图 4是本发明实施例目的节点对联合编码的数据进行译码的流程图; 图 5是本发明实施例 2的目的节点构成示意图;
图 6是本发明实施例 3的目的节点构成示意图;
图 7是本发明实施例 3的第二消息通知单元的构成示意图; 图 8是现有技术中无中继协作的 HARQ系统的时序图; 图 9是本发明实施例 4的有中继协作的 HARQ系统的时序图; 图 10是本发明实施例 4中有中继协作的 HARQ系统的工作原理示 意图;
图 11是本发明实施例 5的数据传输方法流程图;
图 12是是本发明实施例 6的目的节点构成示意图;
图 13是本发明实施例 7的数据传输方法流程图;
图 14是本发明实施例 8的中继节点的构成示意图;
图 15是本发明实施例 9的数据传输方法流程图;
图 16是本发明实施例 10的源节点的构成示意图;
图 17是本发明实施例 11的有中继协作的 HARQ系统的时序图之一; 图 18是本发明实施例 11的有中继协作的 HARQ系统的时序图之二; 图 19是本发明实施例 11的有中继协作的 HARQ系统的时序图之三。
具体实施方式
下面结合附图对本发明的各种实施方式进行说明。 这些实施方式只 是示例性的, 不是对本发明的限制。 为了使本领域的技术人员能够容易 地理解本发明的原理和实施方式, 本发明的实施方式以有中继协助的 HARQ 系统为例进行介绍, 但是应该理解, 本发明不限于该系统, 可用 于任何涉及任何涉及中继协助的无限通信系统。
此外, 本发明实施例高度兼容已有技术。 对于已经实施了基于 DF 的 HARQ (DF-HARQ)和基于时空分组码(STBC: Space-time Block Code) 的 HARQ (STBC-HARQ)系统, 实施本发明实施例无需对源节点 S和系 统中的控制协议有任何变动, 只需升级中继节点 R和目的节点 D中的检 测算法和控制单元。
在本发明实施例中, 源节点 S可为用户设备 UE; 目的节点 D可为 基站; 中继节点 R可以是专门建立的专用台站, 也可以是临时征用的其 它用户设备。 为了便于说明, 本文中假设中继节点是专用台站, 没有自 身的数据需要发送或者需要作为其它用户的数据目的地, 其自身有足够 的信号处理能力、 地理位置相对合理。 这个假设并不排斥系统临时征用 其它用户设备作为中继站, 前提是这些被征用的设备已经实施了本发明 所规定的技术功能。
在本发明实施例中, 所述 "时隙"是指发送一个码字 (数据) 的时 间单位,也就是某些技术标准中的传送时间间隔(ΤΉ: Transmission Time Interval 除非无数据可发送或者被系统被禁止的情形以外, 源节点 S在 任何时隙都在发送码字, 从而可有效地利用信道资源。 在任何时隙, 所 有中继节点 R当中, 有一部分在发送, 另有一部分在接收。 在本发明实 施例中, 称处于接收状态的中继节点为监听中继节点, 称处于发送状态 的中继节点为重传中继节点。
图 2是本发明实施例的有中继协作的无线通信系统结构示意图。 如 图 2所示, 该系统包括源节点、 中继节点和目的节点。 其中, 该系统中 的节点个数可以是多个。 以下以一个目的节点、 一个或多个源节点、 一 个或多个中继节点为例进行说明。 如图 2所示, 该系统包括 n个源节点 Sl、 …、 Sn, k个中继节点 Rl、 …、 Rk, 以及目的节点 D。 在中继节点 Rl、 …、 Rk中, 一部分为处于发送状态的重传中继节点; 另一部分为处 于接收状态的监听中继节点。
如图 2所示, 带箭头的直线表示所存在的无线链路。 其中任何一个 节点所发送的无线电信号实际是以广播方式在空中扩散的。 因此, 任何 一个节点所发送的信号都能到达任何另外一个节点。 本实施例中的节点 均具有无线收发信功能, 这些节点至少具有一个天线。 当同时通信的源 节点个数多于 1个时, 中继节点 R或目的节点 D可以具有多个天线, 以 产生空分多址的功能。 但这一点对本发明的实施而言, 并不是必须的。
在本发明实施例中, 这种场景可对应蜂窝系统的上行通信, 但本发 明的应用并不限定于蜂窝系统。
以下以图 2所示的系统为例, 对本发明实施例的数据传输方法进行 说明。
图 3是本发明实施例 1的数据传输方法流程图。 如图 3所示, 该方 法包括:
步骤 301, 在当前时隙, 目的节点 D接收至少一个源节点 S发送的 数据; 步骤 302, 该目的节点 D对该至少一个源节点 S发送的数据进行解 调译码, 以获得译码结果;
步骤 303, 该目的节点 D接收第一中继节点 R发送的该第一中继节 点 R对在该当前时隙接收的至少一个源节点 S发送的数据进行解调译码 后的译码结果;
步骤 304, 该目的节点 D根据对该源节点 S的数据进行解调译码的 译码结果和该第一中继节点 R的译码结果通知该至少一个源节点 S在下 一个时隙的行为, 即在下一个时隙重传该数据或传送新的数据。
由上述实施例可知, 目的节点 D根据其对源节点 S发送数据的译码 结果以及第一中继节点发送的译码结果来通知该至少一个源节点在下一 时隙, 即下一个传送时间间隔 ΤΉ中的行为, 使得这些源节点 S在任何 时隙都在发送数据, 从而可有效地利用信道资源。
在本实施例中, 该第一中继节点 R在该当前时隙接收该至少一个源 节点 S发送的数据, 并对该数据进行解调译码后获得译码结果, 并将该 译码结果向目的节点 D发送。 在该当前时隙, 该第一中继节点 R为监听 中继节点。
在本实施例中, 在执行步骤 304时, 该目的节点 D还可对该源节点 S 的数据进行解调译码的译码结果和该第一中继节点 R的译码结果通知 该第一中继节点 R在下一个时隙的行为, 即在下一个时隙发送该数据或 处于监听状态。 其中, 若在下一个时隙该第一中继节点 R处于监听状态, 则该第一中继节点 R为监听中继节点; 若在下一个时隙该第一中继节点 R发送该数据, 则该第一中继节点为重传中继节点。
例如,若目的节点 D对所有源节点当前时隙发送的数据均正确译码, 则当前时隙的所有第一中继节点在下一个时隙仍处于监听状态; 若某个 第一中继节点没有译对任何一个源节点当前时隙发送的数据, 则该第一 中继节点在下一个时隙仍 1日处于监听状态。
例如, 若某个第一中继节点对某个源节点当前时隙发送的数据正确 译码, 同时目的节点 D未能对该数据正确译码, 则该第一中继节点在下 一个时隙成为备选的重传中继节点。
对于每个目的节点 D未能正确译码的数据, 目的节点 D根据各个第 一中继节点发来的译码结果, 如 ACK/NACK指令, 为该数据建立一个备 选中继集合。 然后从中选出一个中继节点在下一个时隙发送该数据。 如 果该数据的备选中继集合为空, 则通知相应的源节点在下一时隙重传该 数据。
在本实施例中, 为了清楚地说明本发明的数据传输方法, 下面仅以 目的节点 D根据其对源节点 S发送数据的译码结果以及第一中继节点发 送的译码结果来通知该至少一个源节点中的一个源节点, 如源节点 S1在 下一个时隙, 即下一个传送时间间隔 ΤΉ 中的行为为例进行说明。 对于 其他源节点方法类似。
在本实施例中, 在步骤 304中, 若该目的节点 D确定该目的节点 D 或者该第一中继节点中的至少一个中继节点 R对该一个源节点 S1当前时 隙发送的数据的译码结果正确,则该目的节点 D通知该一个源节点 S1在 下一个时隙传送新的数据。
其中,可通过表示正确接收的 ACK信令通知源节点 S1,但不限于此, 视具体协议之不同, 还可采用其他信令传送。 这样, 当源节点 S1接收到 该目的节点发送的 ACK消息后, 可确定在下一个时隙发送新的数据。
在本实施例中, 在步骤 304中, 若该目的节点 D对该一个源节点 S1 当前时隙发送的数据的译码结果正确, 且该第一中继节点对该一个源节 点 S1当前时隙发送的数据的译码结果错误,则该目的节点 D仍然通知该 一个源节点 S1在下一个时隙传送新的数据。
其中, 可通过表示正确接收的 ACK信令通知源节点 S1 , 该源节点 S1接收到该 ACK信令获知其在当前时隙发送的数据被正确译码, 因此, 该源节点 S1确定在下一个时隙发送新的数据。
在本实施例中, 在步骤 304中, 若该目的节点 D对该一个源节点 S1 当前时隙发送的数据的译码结果错误, 且该第一中继节点中的至少一个 中继节点对该一个源节点 S 当前时隙发送的数据的译码结果正确, 则该 目的节点 D通知该一个源节点在下一个时隙传送新的数据。
其中, 可通过表示正确接收的 ACK信令通知源节点 S1。
此外,该目的节点 D向对源节点 S1发送的数据正确译码的第一中继 节点发送 NACK信令, 使得该第一中继节点接收到该 NACK信令后, 确 定在下一个时隙发送该源节点 S1在当前时隙发送的数据。 这样, 在下一 个时隙, 该第一中继节点转为重传中继节点。
在本实施例中, 在步骤 304中, 若该目的节点 D和该第一中继节点 中的至少一个中继节点对该一个源节点 S1当前时隙发送的数据的译码结 果均错误, 则该目的节点通知该一个源节点在下一个时隙重新传送该当 前时隙发送的数据。
其中, 可通过表示错误接收的 NACK信令通知源节点 Sl。 这样, 该 源节点 S1接收到 NACK信令后可获知当前时隙发送的数据未被正确接 收, 则确定下一个时隙重传该数据。
在本实施例中,该目的节点 D通知对该一个源节点 S1的数据正确译 码的第一中继节点在下一个时隙重传该一个源节点的数据, 可采用如下 方式: 该目的节点 D根据该第一中继节点的译码结果确定对该一个源节 点 S1的数据正确译码的第一中继节点的集合; 从该第一中继节点的集合 中选择一个第一中继节点, 并通知选择的第一中继节点在下一个时隙发 送该一个源节点的数据。 这样, 在下一个时隙该第一中继节点转为重传 中继节点。
其中, 从该第一中继节点的集合中选择一个第一中继节点, 具体包 括: 选择该第一中继节点的集合中信道质量好的第一中继节点; 或者选 择该第一中继节点的集合中对数量多的源节点发送的数据正确译码的第 一中继节点。
在本实施例中,该目的节点 D在接收至少一个源节点发送的数据时, 该方法还可包括:
该目的节点 D可接收第二中继节点在该当前时隙发送的数据, 该第 二中继节点发送的数据是根据该目的节点 D在该当前时隙之前的时隙, 例如上一个时隙时通知该第二中继节点发送的数据; 其中, 该数据是上 一个时隙至少一个源节点发送给该第二中继节点, 且该第二中继节点在 上一个时隙对该数据正确译码;
该目的节点 D对该第二中继节点发送的数据进行译码; 根据译码结果通知该第二中继节点发送的数据所属的源节点在下一 个时隙发送新的数据; 或者通知该第二中继节点发送的数据所属的源节 点在下一个时隙重传该数据; 或者通知该第二中继节点发送的数据所属 的源节点中的部分源节点在下一个时隙发送新的数据, 通知另一部分源 节点在下一个时隙重传所述数据。
其中, 若目的节点 D对第二中继节点发送的数据进行译码的译码结 果均正确, 则该目的节点通知该第二中继节点发送的数据所属的源节点 在下一个时隙发送新的数据; 若均不正确, 则通知该第二中继节点发送 的数据所属的源节点在下一个时隙重传该数据; 若一部分译码正确, 一 部译码错误, 则通知正确译码的数据所属的源节点在下一个时隙发送新 的数据; 通知错误译码的数据所属的源节点在下一个时隙重传所述数据。
在上述实施例中, 目的节点还可储存该至少一个源节点发送的源比 特的软信息。
在本实施例中, 在该第二中继节点向目的节点 D发送的数据来源于 一个以上的源节点 S 时, 该第二中继节点可对该一个以上的源节点的源 比特进行联合编码, 然后将联合编码后的数据向目的节点 D发送。其中, 该联合编码方式可与在上一个时隙相应的源节点发送的数据包的编码方 式一样, 例如, 可以为 Turbo编码方式或卷积码等方式, 可采用现有的任 何方式实现, 此处不再赘述。
这样, 当目的节点 D对该第二中继节点发送的数据进行译码可采用 如下方式。
图 4是本发明实施例目的节点对联合编码的数据进行处理的流程图。 其中, 需要利用对应当前时隙之前的时隙储存的源节点的源比特的软信 息, 若当前时隙为第 n时隙, 之前的时隙为 n-k时隙, k为自然数。 此处 以与当前时隙相邻的上一个时隙为例进行说明,
如图 4所示, 该过程包括以下步骤:
步骤 401, 目的节点 D将在上一个时隙存储的该一个以上的源节点 的源比特的软信息与在当前时隙该第二中继节点向该目的节点 D发送的 相应的源节点的联合编码的源比特软信息进行对位合并; 其中, 该合并方式可以采用简单相加或者加权相加的方式, 由于此 处将源比特进行合并, 其原因是: 联合编码后的校验比特和分别编码的 校验比特是不同的, 而源比特相同。
步骤 402, 该目的节点 D对接收到的联合编码的数据进行译码; 步骤 403, 判断译码是否成功; 若判断结果为是, 则执行步骤 404; 否则执行步骤 405;
步骤 404,在步骤 403中,若译码成功,则该目的节点确定译码正确, 译码过程结束。这样,该目的节点 D向该至少一个源节点发送 ACK信令, 使得该至少一个源节点在下一个时隙发送新的数据;
步骤 405, 在步骤 403中, 若译码不成功, 则该目的节点 D将该第 二中继节点发送的该一个以上源节点的联合编码的源比特的软信息分别 与在上一个时隙存储的相应源节点的源比特的软信息对位合并;
其中, 该合并方式可以采用简单相加或者加权相加的方式。
步骤 406, 该目的节点 D对该一个以上源节点对应的数据分别进行 译码;
步骤 407, 判断是否对来源于至少一个源节点的数据全部译码成功; 若判断结果为是, 则执行步骤 404; 否则执行步骤 408;
步骤 408, 进一步判断是否对其中的一个源节点的数据译码成功, 若 判断结果为是, 则执行步骤 409; 否则执行步骤 412;
步骤 409,将接收到的联合编码的数据中正确译码的数据所属的源节 点的源比特的软信息替换为相应源节点的译码后的源比特, 以获得新的数 据;
步骤 410, 对获得的新的数据进行译码; 若译码成功, 则执行步骤 404; 否则执行步骤 411 ;
步骤 411, 若译码成功, 则所述目的节点译码结束, 并且所述目的节 点根据译码结果通知对应译码正确的源节点在下一个时隙发送新的数 据; 通知对应译码错误的源节点在下一个时隙重传相应的数据;
步骤 412, 在步骤 408中, 若译码不成功, 则目的节点 D译码结束, 并且该目的节点根据译码结果通知至少一个源节点在下一个时隙重传相 应的数据。
由上述实施例可知, 目的节点 D可根据对当前时隙来自源节点 S的 数据进行译码的译码结果和中继节点发送的对当前时隙来自源节点 S 的 数据进行译码的译码结果来决定下一个时隙源节点 S和中继节点 R的行 为, 从而使源节点 S在任何时隙都在发送数据, 避免信道资源的浪费; 此外, 该方法兼容性较好。
本发明实施例还提供了一种目的节点, 如下面的实施例所述。 由于 该目的节点解决问题的原理与上述基于数据传输方法相似, 因此该目的 节点的实施可以参见方法的实施, 重复之处不再赘述。
图 5是本发明实施例 2的目的节点构成示意图。 如图 5所示, 该目 的节点包括: 第一接收单元 501、 第一处理单元 502、 第二接收单元 503 和第一消息通知单元 504; 其中,
第一接收单元 501, 用于在当前时隙接收至少一个源节点发送的数 据; 第一处理单元 502, 用于对第一接收单元 501接收到的至少一个源节 点发送的数据进行解调译码, 以获得译码结果; 第二接收单元 503, 用于 接收第一中继节点发送的第一中继节点对在当前时隙接收的至少一个源 节点发送的数据进行解调译码后的译码结果; 第一消息通知单元 504, 用 于根据对第一处理单元 502的译码结果和第二接收单元 503接收的译码 结果通知该源节点在下一个时隙重传该数据或传送新的数据。
在本实施例中, 第一消息通知单元 504的工作方式如实施例 1 中所 述, 此处不再赘述。
由上述实施例可知, 目的节点 D可根据对当前时隙来自源节点 S的 数据进行译码的译码结果和中继节点发送的对当前时隙来自源节点 S 的 数据进行译码的译码结果来决定下一个时隙源节点 S 的行为, 从而使源 节点 S在任何时隙都在发送数据, 避免信道资源的浪费; 此外, 该方法 兼容性较好。
图 6是本发明实施例 3的目的节点构成示意图。 如图 6所示, 该目 的节点可包括第一接收单元 601、 第一处理单元 602、 第二接收单元 603 和第一消息通知单元 604, 其作用与图 5所示的各个部分一致, 此处不再 赘述。
如图 6所示, 该目的节点还包括第二消息通知单元 605, 第二消息通 知单元 605, 用于根据第一处理单元 601的译码结果和第二接收单元 603 接收的译码结果通知该第一中继节点在下一个时隙发送所述数据或处于 监听状态。
如上述实施例可知, 目的节点不仅决定下一个时隙源节点的行为, 而且还决定第一中继节点的行为。具体决定方式如实施例 1,此处不再赘述。
在本实施例中, 为了清楚地说明本发明的数据传输方法, 仅以目的 节点 D根据其对源节点 S发送数据的译码结果以及第一中继节点发送的 译码结果来通知该至少一个源节点中的一个源节点在下一个时隙, 即下 一个传送时间间隔 ΤΉ中的行为为例进行说明。对于其他源节点方法类似。
在本实施例中, 第一消息通知单元 604通知对该一个源节点 S1的数 据正确译码的第一中继节点在下一个时隙重传该一个源节点的数据, 可 采用如下方式: 根据该第一中继节点的译码结果确定对该一个源节点 S1 的数据正确译码的第一中继节点的集合; 从该第一中继节点的集合中选 择一个第一中继节点, 并通知选择的第一中继节点在下一个时隙发送该 一个源节点的数据。
图 7是本发明实施例 3的第二消息通知单元的构成示意图。 为了清 楚说明, 如实施例 1 所述, 此处以对一个源节点在下一时隙的行为为例 进行说明。
如图 7所示, 第二消息通知单元包括: 集合确定单元 701、 节点选择 单元 702和消息通知单元 703; 其中,
集合确定单元 701,用于根据该第一中继节点的译码结果确定对该一 个源节点的数据正确译码的第一中继节点的集合;
节点选择单元 702,用于从集合确定单元 701确定的第一中继节点的 集合中选择一个第一中继节点;
消息通知单元 703,用于通知选择的第一中继节点在下一个时隙发送 该一个源节点的数据。
由上述实施例可知, 对于每个目的节点 D未能译对的数据, 该目的 节点 D根据各个监听中继节点发来的译码结果,如 ACK/NACK信令,为 该数据建立一个备选中继集合。 然后从中选出一个中继节点在下一时隙 转发该数据。 如果该数据的备选转发中继集合为空, 则通知相应的源节 点在下一时隙重传。
其中, 当存在多个源节点时, 只要某监听中继节点能译对至少一个 源节点的码字时, 即可作为备选的重传节点。 如果监听中继节点译对了 多个源节点的码字, 则当该节点被选中为重传中继时, 它将以叠加的方 式同时转发所有成功译对的码字。 如果该中继节点有多个天线, 可将多 个码字分布在多个天线上发送 (如同多个中继)。
另外, 当某个数据的备选中继节点集合包含多个中继节点时, 目的 节点 D可以灵活选择用于转发的中继。 选择策略可包括 (i)优先选择信道 质量好的中继; (ii)优先选择对数量最多的源节点的数据正确译码的中继 节点, 以腾出更多的中继节点用于监听。
如图 6所示, 该目的节点还包括: 第三接收单元 606、 第二处理单元 607和第三消息通知单元 608; 其中,
第三接收单元 606, 用于接收第二中继节点发送的数据, 该第二中继 节点发送的数据是根据该目的节点在当前时隙之前的时隙时通知该第二 中继节点发送的数据;
第二处理单元 607, 用于对该第二中继节点发送的数据进行译码; 第三消息通知单元 608, 用于在译码正确时, 通知该第二中继节点发 送的数据所属的源节点在下一个时隙发送新的数据; 并且用于在译码错 误, 通知该第二中继节点发送的数据所属的源节点在下一个时隙重传所 述数据。
由上述实施例可知, 如果目的节点 D译对了该第二中继节点, 即某 个重传中继节点当前所发送的数据, 则该重传中继节点在下一时隙转入 监听状态; 否则该重传中继节点在下一时隙继续重传该数据。
当存在多个源节点时, 监听中继节点 (前述第一中继节点) 有可能 译对多个源节点的数据, 因此, 在当前时隙该重传中继节点有可能同时 转发多个源节点的数据。 此时, 若目的节点 D只译对了该重传中继节点 所转发数据中的一部分, 则该中继节点在下一时刻继续重传其他尚未被 目的节点 D译对的数据。
由上述实施例可知, 目的节点 D可根据对当前时隙来自源节点 S的 数据进行译码的译码结果和中继节点发送的对当前时隙来自源节点 S 的 数据进行译码的译码结果来决定下一个时隙源节点 S和中继节点 R的行 为, 从而使源节点 S在任何时隙都在发送数据, 避免信道资源的浪费; 此外, 该方法兼容性较好。
本发明实施例 4还提供一种无线通信系统, 如图 2所述, 该无线通 信系统包括: 源节点、 中继节点和目的节点; 其中,
源节点, 用于发送数据;
第一中继节点, 用于接收该源节点发送的数据, 并对该数据进行解 调译码, 以获得译码结果并将译码结果进行发送;
目的节点, 用于接收该源节点发送的数据, 对该数据进行解调译码, 以获得译码结果; 并接收该中继节点发送的译码结果, 并根据对该源节 点的数据进行解调译码的译码结果和该第一中继节点的译码结果通知该 至少一个源节点在下一个时隙重传所述数据或传送新的数据。
在本实施例中, 该第一中继节点可为监听中继节点。
此外, 该中继节点还包括第二中继节点, 用于向目的节点发送在上 一个时隙该目的节点通知所述第二中继节点发送的数据。 该第二中继节 点在当前时隙为重发中继节点。
其中, 目的节点的构成如实施例 2和实施例 3所述, 此处不再赘述。 对于第一中继节点, 该第一中继节点在当前时隙接收至少一个源节 点发送的数据, 并对该数据进行调制译码, 获得译码结果; 并将该译码 结果向目的节点发送; 这样, 该第一中继节点可包括: 数据接收单元, 用于接收在当前时隙接收至少一个源节点发送的数据; 数据处理单元, 用于对该数据进行调制译码, 获得译码结果; 消息发送单元, 用于将获 得的译码结果向目的节点发送。
对于第二中继节点, 该第二中继节点在当前时隙向目的节点发送至 少一个源节点在当前时隙之前的时隙, 如上一个时隙发送的数据, 该数 据是指该第二中继节点对该数据正确译码。
在本实施例中, 源节点、 中继节点和目的节点的数量不受限制, 可 为一个或一个以上。
以下与现有技术相对比, 并结合具体的实例对本发明实施例的无线 通信系统的功能过程进行说明。 图 8是现有技术中无中继协作的 HARQ 系统的时序图; 图 9是本发明实施例 4的有中继协作的 HARQ系统的时 序图之一。
如图 8所示, 在现有技术中, 源节点 S首先发送数据, 目的节点 D 同时接收该数据。 目的节点 D在收到该源节点 S发送的信号的最后一个 样值后开始进行解调译码及其他处理工作, 然后获得译码结果, 若译码 正确则向源节点 S发送 ACK信令,若译码错误则向该源节点发送 NACK 信令。 在该信令信号完整到达该源节点 S后, 该源节点 S开始译码并准 备下一个时隙的发送信号。 该源节点 S在下一个时隙发送的信号可以是 新的数据, 或者是原数据的重传。 一般来说, 图 8中的 " S处理"所花费 的时间一般要远远小于 "D处理" 的时间。 因为目的节点 D需要花许多 时间在解调和译码方面, 特别对于现代的编码和高阶调制, 以及配备多 天线的情形。
如图 9所示, 在本发明实施例中, "S及 R发送"表示在该时隙, 一 个或多个源节点以及可能存在的一个或多个重传中继节点在业务信道上 以并发的方式发送信号。 "D及 R处理"表示目的节点和监听中继节点分 别对接收到的信号进行解调译码。 译码结束后, 所有监听中继节点通过 控制信道向目的节点 D发送 ACK/NACK信令。之后的 "D处理"表示目 的节点 D对信令进行译码,并准备反馈信令的过程" D反馈"。一般来说, 信令译码和处理需要的时间远小于对用户数据进行译码的时间。 在收到 各个中继节点的反馈信令后, 目的节点 D按照前述协议的描述, 决定下 一时隙, 各个源节点及各个中继节点的动作。 "S及 R处理"表示源节点 及中继节点对目的节点 D的 ACK/NACK指令进行译码,并为下一时隙做 准备。
当存在多个中继节点时, 多个监听中继节点可能会并行发送 ACK/NACK信令。 此时, 各节点必须采用某种多址方式 (例如直接序列 扩频, 或时分、 频分多址方式), 以使目的节点 D可以辨识信令的来源。 类似地, 目的节点 D向各个节点发送的重传指令也必须采用复用或者多 址的方式进行发送。
图 10是本发明实施例 4的工作原理示意图。若采用图 9所示的时序, 图, 图 10中包括三个源节点 Sl、 S2、 S3, 在第 1时隙, 该三个源节点分 别发送数据 xl(l)、 x2(l)、 x3(l) o 有三个中继节点 Rl、 R2、 R3, 该三个 中继节点在第 1时隙都是监听中继节点。 还包括一个目的节点 D。
根据图 9所示的时序图。
在第 1时隙:
该三个源节点 Sl、 S2、 S3发送数据 xl(l)、 x2(l)、 x3(l);
中继节点 Rl、 R2、 R3, 以及目的节点 D接收该数据 xl(l)、 x2(l)、 x3(D;
该中继节点 R1、R2、R3和该目的节点 D对接收到的数据 xl(l)、x2(l)、 x3(l)进行解调译码, 并获得译码结果;
例如, 若目的节点 D对接收到的数据 xl(l)、 x2(l)、 x3(l)均未正确 译码, 则对应数据 xl(l)、 x2(l)、 x3(l)的译码结果均为 NACK;
若数据 xl(l)和 x3(l)被中继节点 R1译对,数据 x2(l)未被任何一个中 继节点译对, 则该中继节点 R1对接收到的数据的译码结果依次为: ACK NACK ACK; 该中继节点 R2为 NACK NACK NACK; 该中继节点 R3为 NACK NACK NACK。
该中继节点 Rl、 R2、 R3将该译码结果向目的节点 D发送。
目的节点 D接收到该中继节点发送的 ACK/NACK、 以及结合自身的 译码结果 NACK来确定在下一个时隙源节点 Sl、 S2、 S3和中继节点 Rl、 R2、 R3动作。
例如, 对于源节点 S1 , 目的节点的译码结果为 NACK, 中继节点 R1 对 S1的数据 xl(l)的译码结果为 ACK, 则该目的节点 D向源节点 S1发 送 ACK, 以使该源节点 S1在下一个时隙发送新的数据;
对于源节点 S2, 目的节点的译码结果为 NACK, 所有中继节点对 S2 的数据 x2(l)的译码结果均为 NACK, 则该目的节点 D向源节点 S2发送 NACK, 以使该源节点 S2在下一个时隙重传该数据 x2(l);
对于源节点 S3 , 目的节点的译码结果为 NACK, 中继节点 R1对 S,3 的数据 x3(l)的译码结果为 ACK,则该目的节点 D向源节点 S3发送 ACK, 以使该源节点 S3在下一个时隙发送新的数据;
此外, 在第 1时隙, 中继节点 R2和 R3对所有源节点 Sl、 S2、 S3 发送数据 xl(l)、 x2(l)、 x3(l)均译码错误, 则目的节点 D向中继节点 R2 和 R3发送 ACK, 使得该中继节点 R2和 R3在下一个时隙仍然处于监听 状态。
由于目的节点 D对所有数据的译码错误, 而中继节点 R1对 xl(l)和 x3(l)的译码正确, 则该目的节点 D向中继节点 R1发送 NACK, 使得该 中继节点 R1在下一个时隙发送 xl(l)、 x3(l)。
如图 10所示, 在第 2时隙:
源节点 S2重传数据 x2(l);
源节点 S1和源节点 S3发送新数据 xl(2)、 x3(2);
中继节点 R1转发 xl(l)+x3(l);
中继节点 R2和中继节点 R3继续监听。
在本实施例中, 中继节点 R1转发来自源节点 S1和 S3的数据时, 采 用将来自源节点 S1和 S3的数据进行联合编码的方式, 并将编码后的数 据发送给目的节点 D, 在目的节点 D, 对应的处理步骤为:
1 ) 在时隙 n (如当前时隙的上一个时隙), 目的节点 D没有正确解 码来自源节点 S1和 S3的数据, 中继节点 R1正确解码来自两者的数据。 目的节点存储对应源节点 S1和 S3的数据包每个比特 (bit) 的软信息。
2) 在时隙 n+k (如当前的 n+1时隙, 由于存在最大重传次数, k可 以大于 1 ), 中继节点 R1将对应源节点 S1和 S3的源比特进行联合编码, 此处的编码方式与时隙 n中源节点 S1和 S3发送的数据包地编码方式相 同, 可以为 Turbo编码, 卷积码等; 将编码后的数据发送给目的节点 D。
3 ) 目的节点的 D 收到来自中继节点 R1 的联合编码后的数据 xl(l)+X3(l)后, 首先将以存储的对应源节点 S1和 S3的源比特软的信息 与联合编码后的源比特软信息进行对位合并, 合并方式可以采用简单相 加或者加权相加的方式; 并对联合编码的数据进行解码, 如果译码正确, 则译码过程结束, 向源节点 S1和 S3发送 ACK, 使得源节点 S1和 S3在 下一个时隙发送新的数据。
如果译码不正确, 转到下一个步骤。
4)目的节点 D将联合编码中对应源节点 S1和 S3的源比特的软信息 与之前已经存储的 S1和 S3对应的源比特的软信息进行对位合并, 合并 方式可以采用简单相加或者加权相加的方式, 并对 S1和 S3对应的数据 包分别进行解码, 如果全部解码正确, 则结束解码过程, 向源节点 S1和 S3发送 ACK, 使得源节点 S1和 S3在下一个时隙发送新的数据。
如果只有对应的其中一个源节点的数据包解码正确, 则转到下一个 步骤。
5 )如果对应 S1 (或 S2)的数据包解码正确, 则可以将得到的联合编码 后的数据中对应源节点 S1 (或 S2)中的源比特软信息替换为得到的源节点 S1 (或 S2)的解码后对应的源比特, 并对新得到的数据包进行解码, 如果 解码成功, 则结束解码过程, 向源节点 S1和 S3发送 ACK, 使得源节点
S1和 S3在下一个时隙发送新的数据。
否则解码失败,目的节点 D发送 ACK给对应译码成功的源节点 S1 (或
S2), 目的节点 D发送 NACK给对应译码失败的源节点 S2 (或 Sl )。
在上述实施例中,均通过表示正确接收的 ACK/NACK信令通知源节 点 S1 , 但不限于此, 视具体协议之不同, 重传控制信息也可能包含其他 信息, 例如请求重传的码字编号。
由上述实施例可知, 目的节点 D可根据对当前时隙来自源节点 S的 数据进行译码的译码结果和中继节点发送的对当前时隙来自源节点 S 的 数据进行译码的译码结果来决定下一个时隙源节点 S和中继节点 R的行 为, 从而使源节点 s在任何时隙都在发送数据, 避免信道资源的浪费; 此外, 该方法兼容性较好。
图 11是本发明实施例 5的数据传输方法流程图。如图 11所示,该方 法包括: 步骤 1101, 在当前时隙目的节点接收至少一个源节点发送的数据; 步骤 1102, 对该至少一个源节点发送的数据进行解调译码, 以获得 译码结果;
步骤 1103, 将该译码结果通知该至少一个源节点, 使得该至少一个 源节点根据该目的节点发送的译码结果和第三中继节点发送的译码结果 决定在下一个时隙重传该数据或传送新的数据。
在本实施例中, 步骤 1102中, 该目的节点 D向源节点 S返回译码结 果, 该译码结果可为 ACK/NACK信令, 表明是否对源节点的数据正确译 码。
此外, 在本实施例中, 在当前时隙第三中继节点也接收该至少一个 源节点发送的数据, 并对该数据进行解调译码以获得译码结果, 并将该 译码结果向源节点发送。
由上述实施例可知, 目的节点 D在完成译码后, 向源节点发送译码 结果, 通过下行信令信道反馈 ACK/NACK指令, 表明自己是否译对了原 节点 S的数据, 使得源节点根据该目的节点 D反馈的译码结果和中继节 点反馈的译码结果决定其在下一个时隙的动作。
此外, 在本实施例中, 该方法还包括: 该目的节点 D接收该第三中 继节点发送的对在该当前时隙接收的至少一个源节点发送的数据进行解 调译码后的译码结果;
其中, 在当前时隙, 该第三中继节点处于监听状态。 该目的节点 D 根据对该源节点发送的数据进行译码的译码结果和该第三中继节点的译 码结果通知该中继节点在下一个时隙重传该源节点的数据或者处于监听 状态。
如上述实施例可知, 如果目的节点 D译对了所有源节点当前发送的 数据, 则当前的所有监听中继节点在下一时隙仍处于监听状态; 如果某 个监听中继节点没有译对任何一个源节点当前时隙发送的数据, 则该监 听中继在下一时隙仍旧处于监听状态。
如果某个监听中继节点译对了某个源节点当前发送的码字, 同时 D 未能译对该码字, 则该监听中继节点成为备选的重传中继节点。 其中, 如何选择备选的重传中继节点如实施例 1中所述, 此处不再赘述。
由上述实施例可知, 目的节点 D在接收到第三中继节点发送的译码 结果后, 仅可根据其自身处理的译码结果和该第三中继节点发送的译码 结果决定下一个时隙该第三中继节点的行为, 简化了该目的节点 D的处 理过程。
为便于说明, 以对该至少一个源节点中的一个源节点 S1为例说明。 该目的节点 D根据对一个源节点 S1的译码结果和该第三中继节点的译码 结果通知该第三中继节点在下一个时隙重传该源节点的数据或者处于监 听状态, 包括:
若该目的节点 D对该一个源节点 S1的译码结果正确,则该目的节点 D通知对该一个源节点 S1的数据进行译码的第三中继节点在下一个时隙 处于监听状态, 可向该第三中继节点发送 ACK信令通知该第三中继节点 处于监听状态; 若该目的节点 D对该一个源节点 S1的译码结果错误、且 该第三中继节点对该一个源节点 S1的译码结果正确,则该目的节点 D通 知对该一个源节点 S1的数据正确译码的第三中继节点在下一个时隙重新 发送该数据, 其中, 可向该第三中继节点发送 NACK信令来通知该第三 中继节点重新发送数据。
由上述实施例可知,第三中继节点 R可发送 ACK/NACK信令, 以分 别通知源节点 S和目的节点 D自己是否译码正确。 这样, 源节点 S和目 的节点 D都可以获知各个监听中继节点的译码结果。 在这情况下, 该目 的节点根据自身的译码结果和来自于第三中继节点的译码结果控制各第 三中继节点的动作。
本发明实施例还提供了一种目的节点, 如下面的实施例所述。 由于 该目的节点解决问题的原理与上述基于实施例 5 数据传输方法相似, 因 此该目的节点的实施可以参见方法的实施, 重复之处不再赘述。
图 12是是本发明实施例 6的目的节点构成示意图。 如图 12所示, 该目的节点包括:
第四接收单元 1201,用于在当前时隙接收至少一个源节点发送的数据; 第三处理单元 1202, 用于对该至少一个源节点发送的数据进行解调 译码, 以获得译码结果;
第四消息通知单元 1203,用于将该第三处理单元 1202的译码结果通 知该至少一个源节点, 使得该至少一个源节点根据该目的节点发送的译 码结果和第三中继节点发送的译码结果决定在下一个时隙重传该源节点 的数据或传输新的数据。
此外, 该目的节点还包括:
第五接收单元 1204, 用于接收该第三中继节点发送的对在该当前时 隙接收的至少一个源节点发送的数据进行解调译码后的译码结果;
第五消息通知单元 1205,用于根据该第三处理单元 1202的译码结果 和该第五接收单元 1204接收的译码结果通知该第三中继节点在下一个时 隙重传该源节点的数据或者处于监听状态。
在本实施例中, 该目的节点根据第三中继节点的译码结果和自身的 译码结果决定第三中继节点在下一个时隙的行为的工程如实施例 5所述, 此处不再赘述。
由上述实施例可知,第三中继节点 R可发送 ACK/NACK信令, 以分 别通知源节点 S和目的节点 D自己是否译码正确。 这样, 源节点 S和目 的节点 D都可以获知各个监听中继节点的译码结果。 在这情况下, 该目 的节点根据自身的译码结果和来自于第三中继节点的译码结果控制各第 三中继节点的动作。
图 13是本发明实施例 7的数据传输方法流程图。 如图 7所示, 该方 法包括:
步骤 1301,在当前时隙第三中继节点接收至少一个源节点发送的数据; 步骤 1302, 对至少一个源节点发送的数据进行解调译码, 以获得译 码结果;
步骤 1303, 将该译码结果通知该至少一个源节点和该目的节点; 步骤 1304, 接收该目的节点根据该第三中继节点的译码结果和该目 的节点的译码结果发送的指示该第三中继节点在下一个时隙发送该源节 点的数据或处于监听状态的反馈信令。
其中, 该第三中继节点可同时通知该目的节点和该至少一个源节点 译码结果; 或者该第三中继节点按照时间从前到后的顺序通知该至少一 个源节点和该目的节点。
在上述实施例中, 该第三中继节点为监听中继节点。
对于重传中继节点, 与实施例 4类似, 此处不再赘述。
本发明实施例还提供了一种中继节点, 如下面的实施例所述。 由于 该目的节点解决问题的原理与上述实施例 7 的基于数据传输方法相似, 因此该中继节点的实施可以参见方法的实施, 重复之处不再赘述。
图 14是本发明实施例 8的中继节点的构成示意图。该中继节点包括: 第六接收单元 1401, 用于在当前时隙接收至少一个源节点发送的数 据;
第四处理单元 1402,用于对该第六接收单元 1401接收的数据进行解 调译码, 以获得译码结果;
第六消息通知单元 1403,用于将第四处理单元 1402的译码结果通知 该至少一个源节点和该目的节点, 使得该源节点根据该通知单元 1403的 译码结果和该目的节点发送的译码结果决定在下一个时隙重传该数据或 传送新的数据; 使得该目的节点根据该通知单元的译码结果和该目的节 点的译码结果通知该中继节点在下一个时隙传送该源节点的数据或者处 于监听状态。
在本实施例中, 该中继节点为监听中继节点。
对于在当前时隙的重传中继节点, 该重传中继节点可包括: 数据发 送单元, 用于在当前时隙向目的节点发送上一时隙源节点传输的数据; 消息处理单元, 用于根据目的节点 D返回的信令 (ACK/NACK) 来决定 其在下一个时隙的行为。 例如, 若目的节点 D译对了某个重传中继节点 当前时隙所发送的数据, 则该重传中继节点在下一个时隙转入监听状态; 否则该重传中继节点在下一个时隙继续重传该码字。 当存在多个源节点 时, 监听中继节点有可能译对多个源节点的码字, 因此重传节点有可能 同时转发多个数据。 此时, 若目的节点 D只译对了重传中继节点所转发 数据中的一部分, 则该重传中继节点在下一时刻继续重传其他尚未被目 的节点 D译对的数据。 图 15是本发明实施例 9的数据传输方法流程图。 如图 15所示, 该 方法包括:
步骤 1501,在当前时隙源节点向目的节点和第三中继节点发送数据; 步骤 1502, 接收该目的节点和该第三中继节点对该数据进行解调译 码后的译码结果;
步骤 1503, 根据该目的节点和该第三中继节点返回的译码结果确定 该源节点在下一个时隙重传该数据或传送新的数据。
其中, 在步骤 1503中, 若该目的节点或者该第三中继节点中的至少 一个中继节点对该源节点当前时隙发送的数据的译码结果正确, 则该源 节点确定在下一个时隙传送新的数据;
若该目的节点和该第三中继节点中的至少一个中继节点对该源节点 当前时隙发送的数据的译码结果均错误, 则该源节点确定在下一个时隙 重新传送该当前时隙发送的数据。
本发明实施例还提供了一种源节点, 如下面的实施例所述。 由于该 目的节点解决问题的原理与上述基于实施例 9 的数据传输方法相似, 因 此, 该源节点的实施可以参见方法的实施, 重复之处不再赘述。
图 16是本发明实施例 10的源节点构成示意图。 如图 10所示, 该源 节点包括:
发送单元 1601, 用于在当前时隙源节点向目的节点和第三中继节点 发送数据;
第七接收单元 1602, 用于接收该目的节点和该第三中继节点对该数 据进行解调译码后的译码结果;
第五处理单元 1603,用于根据该第七接收单元 1602接收的译码结果 确定该源节点在下一个时隙重传该数据或传送新的数据。
由上述实施例可知, 目的节点 D可根据对当前时隙来自源节点 S的 数据进行译码的译码结果和中继节点发送的对当前时隙来自源节点 S 的 数据进行译码的译码结果来决定下一个时隙中继节点 R的行为; 此外源 节点 S可根据目的节点 D的译码结果和中继节点发送的译码结果来决定 下一个时隙其自身的行为, 从而使源节点 S在任何时隙都在发送数据, 避免信道资源的浪费; 此外, 该方法兼容性较好。
本发明实施例 11还提供一种无线通信系统, 如图 2所述, 该无线通 信系统包括: 源节点、 中继节点和目的节点; 其中, 该中继节点可包括 监听中继节点和重传中继节点。
该源节点、 中继节点和目的节点如实施例 6、 8、 10所示, 且各自的 工作过程如实施例 5、 7、 9所述, 此处不再赘述。
以下结合附图 10、 以及 17-19的时序图来说明本发明实施例的数据 传输方法。
根据图 17所示的时序图。 其中, 如果控制信道是按上行 (S到 D) 和下行 (D到 S) 双工分隔, 则可按图 17所示的时序来工作。 目的节点 D在完成译码后, 立即通过下行信令信道反馈 ACK/NACK指令, 表明自 己是否译对了 S 的码字。 与此同时, R同时在上下行两个控制信道上发 送 ACK/NACK指令, 以分别通知 S和 D 自己是否译码正确。 D在下行 控制信道发送信令的同时, 也在上行控制信道监测信令。 这样, S 和 D 都可以获知各个监听中继节点的译码结果。 该时序中的 "D反馈 2"只针 对中继节点, 用于控制各中继节点的动作。
源节点 S需要具备从不同节点接收 ACK/NACK指令的能力。这种能 力在许多系统中是已经存在的。 例如在支持软切换的蜂窝系统中, 用户 可以同时接收来自不同基站的控制指令。
在第 1时隙:
如图 10所示, "S及 R发送": 该三个源节点 Sl、 S2、 S3发送数据 xl(l)、 x2(l)、 x3(l); 此外, 当前时隙的重传中继节点向目的节点 D发送 上一个时隙源节点的数据; 其中, 对该数据目的节点译码错误, 而中继 节点译码正确;
"D及 R处理": 中继节点 Rl、 R2、 R3, 以及目的节点 D接收该数 据 xl(l)、 x2(l)、 x3(l);
该中继节点 Rl、R2、R3和该目的节点 D对接收到的数据 xl(l)、x2(l)、 x3(l)进行解调译码, 并获得译码结果;
例如, 若目的节点 D对接收到的数据 xl(l)、 x2(l)、 x3(l)均未正确 译码, 则对应数据 xl(l)、 x2(l)、 x3(l)的译码结果均为 NACK;
若数据 xl(l)和 x3(l)被中继节点 R1译对,数据 x2(l)未被任何一个中 继节点译对, 则该中继节点 R1对接收到的数据的译码结果依次为: ACK NACK ACK; 该中继节点 R2为 NACK NACK NACK; 该中继节点 R3为 NACK NACK NACK。
"D反馈 1、 R反馈 1、 R反馈 2 ": D将译码结果 NACK NACK NACK 反馈给源节点 Sl、 S2、 S3; 该中继节点 Rl、 R2、 R3同时将对该译码结 果向目的节点 D和相应的源节点 Sl、 S2、 S3发送。
"D处理": 目的节点 D接收到该中继节点发送的对应源节点 Sl、 S2、 S3的 ACK/NACK、 以及结合自身的译码结果 NACK来确定在下一 个时隙源中继节点 Rl、 R2、 R3动作。
"D反馈 2": 目的节点 D将 "D处理" 的处理结果通知各个中继节 点,例如,若中继节点 R2和 R3对所有源节点 Sl、 S2、 S3发送数据 xl(l)、 x2(l)、 x3(l)均译码错误, 则目的节点 D向中继节点 R2和 R3发送 ACK, 使得该中继节点 R2和 R3在下一个时隙仍然处于监听状态。
由于目的节点 D对所有数据的译码错误, 而中继节点 R1对 xl(l)和 x3(l)的译码正确, 则该目的节点 D向中继节点 R1发送 NACK, 使得该 中继节点 R1在下一个时隙发送 xl(l)、 x3(l)。
"S处理":在源节点 Sl、 S2、 S3接收到目的节点 D和中继节点 Rl、 R2、R3的译码结果时,源节点可根据译码结果决定其在下一个时隙的行为。
对于源节点 S1 , 目的节点的译码结果为 NACK, 中继节点 R1对 SI 的数据 xl(l)的译码结果为 ACK, 则该源节点 S1确定在下一个时隙发送 新的数据;
对于源节点 S2, 目的节点的译码结果为 NACK, 所有中继节点对 S2 的数据 x2(l)的译码结果均为 NACK, 则该源节点 S2发送 NACK确定在 下一个时隙重传该数据 x2(l);
对于源节点 S3 , 目的节点的译码结果为 NACK, 中继节点 R1对 S,3 的数据 x3(l)的译码结果为 ACK, 则该源节点 S3确定在下一个时隙发送 新的数据。 如图 10所示, 在第 2时隙:
源节点 S2重传数据 x2(l);
源节点 S1和源节点 S3发送新数据 xl(2)、 x3(2);
中继节点 R1转发 xl(l)+x3(l);
中继节点 R2和中继节点 R3继续监听。
如图 18所示, 如果控制信道是共享的, 没有上下行双工分隔, 则监 听中继节点不能同时发出两个不同方向的信令, 目的节点 D在发送信令 的同时也不能同时监测中继节点发送的信令。 此时可以采用如图 18所示 的工作方式。中继节点将 ACK/NACK指令重复一遍。 目的节点 D在发送 信令之后立即转入接收信令状态, 以获悉各个监听中继节点的译码状态。
如图 19所示, 如果只有单个源节点, 则图 18所示的时序图可以进 一步简化为图 19所示的时序。
其中, 若目的 D或者监听中继节点正确译对源节点 S的数据, 则发 送 ACK指令给该源节点 S, 如果译码失败, 则不发送信令。
若该目的节点 D译码失败, 则转入信令接收状态, 监听中继节点的 若该源节点 S收到任何一个 ACK时, 下一时隙发送新数据。 否则, 若无任何 ACK指令, 则按 NACK理解, 下一时刻自动重传数据。
若目的节点 D在发送 ACK指令时, 虽然无法监听中继的指令,但在 目的节点 D译对的情况下, D不需要知道中继是否也译对, 因此也不需 要监听。
由上述实施例可知, 目的节点 D可根据对当前时隙来自源节点 S的 数据进行译码的译码结果和中继节点发送的对当前时隙来自源节点 S 的 数据进行译码的译码结果来决定下一个时隙中继节点 R的行为; 此外源 节点 S可根据目的节点 D的译码结果和中继节点发送的译码结果来决定 下一个时隙其自身的行为, 从而使源节点 S在任何时隙都在发送数据, 避免信道资源的浪费; 此外, 该方法兼容性较好。
本发明实施例还提供一种计算机可读程序, 其中当在目的节点中执 行所述程序时, 所述程序使得计算机在所述目的节点中执行如实施例 1、 5所述的数据传输方法。
本发明实施例还提供一种存储有计算机可读程序的存储介质, 其中 所述计算机可读程序使得计算机在目的节点中执行如实施例 1、 5所述的 所述的数据传输方法。
本发明实施例还提供一种计算机可读程序, 其中当在中继节点中执 行所述程序时, 所述程序使得计算机在所述中继节点中执行如实施例 7 所述的数据传输方法。
本发明实施例还提供一种存储有计算机可读程序的存储介质, 其中 所述计算机可读程序使得计算机在中继节点中执行如实施例 7所述的数 据传输方法。
本发明实施例还提供一种计算机可读程序, 其中当在源节点中执行 所述程序时, 所述程序使得计算机在所述源节点中执行如实施例 9所述 的数据传输方法。
本发明实施例一种存储有计算机可读程序的存储介质, 其中所述计 算机可读程序使得计算机在源节点中执行如实施例 9所述的数据传输方 法。
本发明以上的装置和方法可以由硬件实现, 也可以由硬件结合软件 实现。 本发明涉及这样的计算机可读程序, 当该程序被逻辑部件所执行 时, 能够使该逻辑部件实现上文所述的装置或构成部件, 或使该逻辑部 件实现上文所述的各种方法或步骤。 本发明还涉及用于存储以上程序的 存储介质, 如硬盘、 磁盘、 光盘、 DVD、 flash存储器等。
以上结合具体的实施方式对本发明进行了描述, 但本领域技术人员 应该清楚, 这些描述都是示例性的, 并不是对本发明保护范围的限制。 本领域技术人员可以根据本发明的精神和原理对本发明做出各种变型和 修改, 这些变型和修改也在本发明的范围内。

Claims

权 利 要 求 书
1、 一种数据传输方法, 所述方法包括:
在当前时隙目的节点接收至少一个源节点发送的数据;
对所述至少一个源节点发送的数据进行解调译码, 以获得译码结果; 接收第一中继节点发送的所述第一中继节点对在所述当前时隙接收 的至少一个源节点发送的数据进行解调译码后的译码结果; 所述目的节点根据对所述源节点的数据进行解调译码的译码结果和 所述第一中继节点的译码结果通知所述源节点在下一个时隙重传所述数 据或传送新的数据。
2、 根据权利要求 1所述的方法, 其中, 对于所述至少一个源节点中 的一个源节点, 所述目的节点根据对所述源节点的数据进行解调译码的 译码结果和所述第一中继节点的译码结果通知所述一个源节点在下一个 时隙重传所述数据或传送新的数据, 包括:
若所述目的节点或者所述第一中继节点中的至少一个中继节点对所 述一个源节点当前时隙发送的数据的译码结果正确, 则所述目的节点通 知所述一个源节点在下一个时隙传送新的数据。
3、 根据权利要求 1所述的方法, 其中, 对于所述至少一个源节点中 的一个源节点, 所述目的节点根据对所述源节点的数据进行解调译码的 译码结果和所述第一中继节点的译码结果通知所述一个源节点在下一个 时隙重传所述数据或传送新的数据, 包括:
若所述目的节点对所述一个源节点当前时隙发送的数据的译码结果 正确, 且所述第一中继节点对所述一个源节点当前时隙发送的数据的译 码结果错误, 则所述目的节点通知所述一个源节点在下一个时隙传送新 的数据。
4、 根据权利要求 1所述的方法, 其中, 对于所述至少一个源节点中 的一个源节点, 所述目的节点根据对所述源节点的数据进行解调译码的 译码结果和所述第一中继节点的译码结果通知所述一个源节点在下一个 时隙重传所述数据或传送新的数据, 包括:
若所述目的节点对所述一个源节点当前时隙发送的数据的译码结果 错误, 且所述第一中继节点中的至少一个中继节点对所述一个源节点当 前时隙发送的数据的译码结果正确, 则所述目的节点通知所述一个源节 点在下一个时隙传送新的数据。
5、 根据权利要求 4所述的方法, 其中, 所述方法还包括: 所述目的节点通知对所述一个源节点的数据正确译码的第一中继节 点在下一个时隙重传所述一个源节点的数据。
6、 根据权利要求 1所述的方法, 其中, 对于所述至少一个源节点中 的一个源节点, 所述目的节点根据对所述源节点的数据进行解调译码的 译码结果和所述第一中继节点的译码结果通知所述一个源节点在下一个 时隙重传所述数据或传送新的数据, 包括:
若所述目的节点和所述第一中继节点对所述一个源节点当前时隙发 送的数据的译码结果均错误, 则所述目的节点通知所述一个源节点在下 一个时隙重新传送所述当前时隙发送的数据。
7、 根据权利要求 5所述的方法, 其中, 所述目的节点通知对所述一 个源节点的数据正确译码的第一中继节点在下一个时隙重传所述一个源 节点的数据, 包括:
所述目的节点根据所述第一中继节点的译码结果确定对所述一个源 节点的数据正确译码的第一中继节点的集合;
从所述第一中继节点的集合中选择一个第一中继节点, 并通知选择 的第一中继节点在下一个时隙发送所述一个源节点的数据。
8、 根据权利要求 7所述的方法, 其中, 从所述第一中继节点的集合 中选择一个第一中继节点, 具体包括:
选择所述第一中继节点的集合中信道质量好的第一中继节点; 或者 选择所述第一中继节点的集合中对数量多的源节点发送的数据正确译码 的第一中继节点。
9、 根据权利要求 1所述的方法, 其中, 所述目的节点在接收至少一 个源节点发送的数据时, 所述方法还包括:
所述目的节点接收第二中继节点发送的数据, 所述第二中继节点发 送的数据是根据所述目的节点在当前时隙之前的时隙时通知所述第二中 继节点发送的数据;
对所述第二中继节点发送的数据进行译码;
根据译码结果通知所述第二中继节点发送的数据所属的源节点在下 一个时隙发送新的数据; 或通知所述第二中继节点发送的数据所属的源 节点在下一个时隙重传所述数据; 或者通知所述第二中继节点发送的数 据所属的源节点中的部分源节点在下一个时隙发送新的数据, 通知另一 部分源节点在下一个时隙重传所述数据。
10、 根据权利要求 9所述的方法, 其中, 在所述第二中继节点向所 述目的节点发送的数据为一个以上的源节点的数据且所述第二中继节点 对所述一个以上的源节点的源比特进行联合编码, 则所述对第二中继节 点发送的数据进行译码, 包括:
将在当前时隙之前的时隙存储的所述一个以上的源节点的源比特的 软信息与在当前时隙所述第二中继节点向所述目的节点发送的所述一个 以上的源节点的联合编码的源比特软信息进行对位合并;
对接收到的联合编码的数据进行译码;
若译码成功, 则所述目的节点译码结束, 并且所述目的节点根据所 述译码结果通知所述一个以上源节点在下一个时隙发送新的数据。
11、 根据权利要求 10所述的方法, 其中, 若译码不成功, 则所述方 法还包括:
所述目的节点将所述第二中继节点发送的所述一个以上源节点的联 合编码的源比特的软信息分别与在上一个时隙存储的所述一个以上的源 节点的源比特的软信息对位合并;
对所述一个以上源节点对应的数据分别进行译码;
若全部译码成功, 则所述目的节点译码结束, 并且所述目的节点根 据所述译码结果通知所述一个以上源节点在下一个时隙发送新的数据。
12、 根据权利要求 11所述的方法, 其中, 若对所述一个以上源节点 对应的数据分别进行译码的译码结果为对所述一个以上源节点中的一个 源节点的数据译码成功, 则所述方法还包括:
将接收到的联合编码的数据中正确译码的数据所属的源节点的源比 特的软信息替换为相应源节点的译码后的源比特, 以获得新的数据; 对所述新的数据进行译码;
若译码成功, 则所述目的节点译码结束, 并且所述目的节点根据译 码结果通知对应译码正确的源节点在下一个时隙发送新的数据; 通知对 应译码错误的源节点在下一个时隙重传相应的数据;
若译码不成功, 则所述目的节点译码结束, 并且所述目的节点根据 译码结果通知所述至少一个源节点在下一个时隙重传相应的数据。
13、 一种目的节点, 所述目的节点包括:
第一接收单元, 所述第一接收单元用于在当前时隙接收至少一个源 节点发送的数据;
第一处理单元, 所述第一处理单元用于对所述第一接收单元接收到 的所述至少一个源节点发送的数据进行解调译码, 以获得译码结果; 第二接收单元, 所述第二接收单元用于接收第一中继节点发送的所 述第一中继节点对在所述当前时隙接收的至少一个源节点发送的数据进 行解调译码后的译码结果;
第一消息通知单元, 所述第一消息通知单元用于根据对所述第一处 理单元的译码结果和所述第二接收单元接收的译码结果通知所述至少一 个源节点在下一个时隙重传所述数据或传送新的数据。
14、 一种无线通信系统, 包括:
源节点, 所述源节点用于发送数据;
第一中继节点, 所述第一中继节点用于接收所述源节点发送的数据, 并对所述数据进行解调译码, 以获得译码结果并将译码结果进行发送; 目的节点, 所述目的节点用于接收所述源节点发送的数据, 对所述 数据进行解调译码, 以获得译码结果; 并接收所述中继节点发送的译码 结果, 并根据对所述源节点的数据进行解调译码的译码结果和所述第一 中继节点的译码结果通知所述一个源节点在下一个时隙重传所述数据或 传送新的数据。
15、 根据权利要求 14所述的无线通信系统, 所述目的节点还包括第 二中继节点, 所述第二中继节点用于向所述目的节点发送在上一个时隙 所述目的节点通知所述第二中继节点发送的数据。
16、 一种数据传输方法, 所述方法包括:
在当前时隙目的节点接收至少一个源节点发送的数据;
对所述至少一个源节点发送的数据进行解调译码, 以获得译码结果; 将所述译码结果通知所述至少一个源节点, 使得所述至少一个源节 点根据所述目的节点发送的译码结果和第三中继节点发送的译码结果决 定在下一个时隙重传所述数据或传送新的数据。
17、 根据权利要求 16所述的方法, 其中, 所述方法还包括: 所述目的节点接收所述第三中继节点发送的对在所述当前时隙接收 的至少一个源节点发送的数据进行解调译码后的译码结果; 所述目的节点根据对所述源节点发送的数据进行译码的译码结果和 所述第三中继节点的译码结果通知所述第三中继节点在下一个时隙重传 所述源节点的数据或者处于监听状态。
18、 根据权利要求 19所述的方法, 其中, 对于所述至少一个源节点 中的一个源节点, 所述目的节点根据所述一个源节点的译码结果和所述 第三中继节点的译码结果通知所述第三中继节点在下一个时隙重传所述 源节点的数据或者处于监听状态, 包括:
若所述目的节点对所述一个源节点的译码结果正确, 则所述目的节 点通知对所述一个源节点的数据进行译码的第三中继节点在下一个时隙 处于监听状态; 若所述目的节点对所述一个源节点的译码结果错误、 且 所述第三中继节点对所述一个源节点的译码结果正确, 则所述目的节点 通知对所述一个源节点的数据正确译码的第三中继节点在下一个时隙重 新发送所述数据。
19、 一种数据传输方法, 所述方法包括:
在当前时隙第三中继节点接收至少一个源节点发送的数据; 对所述至少一个源节点发送的数据进行解调译码, 以获得译码结果; 将所述译码结果通知所述至少一个源节点和所述目的节点; 接收该目的节点根据该第三中继节点的译码结果和该目的节点的译 码结果发送的指示该第三中继节点在下一个时隙发送该源节点的数据或 处于监听状态的反馈信令。
20、 根据权利要求 19所述的方法, 其中, 所述第三中继节点同时通 知所述目的节点和所述至少一个源节点; 或者所述第三中继节点按照时 间从前到后的顺序通知所述至少一个源节点和所述目的节点。
21、 一种数据传输方法, 所述方法包括:
在当前时隙源节点向目的节点和第三中继节点发送数据;
接收所述目的节点和所述第三中继节点对所述数据进行解调译码后 的译码结果;
根据所述目的节点和所述第三中继节点返回的译码结果确定所述源 节点在下一个时隙重传所述数据或传送新的数据。
22、 根据权利要求 21所述的方法, 其中, 所述根据所述目的节点和 所述第三中继节点返回的译码结果确定所述源节点在下一个时隙重传所 述数据或传送新的数据, 包括: 若所述目的节点或者所述第三中继节点 中的至少一个中继节点对所述源节点当前时隙发送的数据的译码结果正 确, 则所述源节点确定在下一个时隙传送新的数据;
若所述目的节点和所述第三中继节点中的至少一个中继节点对所述 源节点当前时隙发送的数据的译码结果均错误, 则所述源节点确定在下 一个时隙重新传送所述当前时隙发送的数据。
23、 一种目的节点, 所述目的节点包括:
第四接收单元, 用于在当前时隙接收至少一个源节点发送的数据; 第三处理单元, 用于对所述至少一个源节点发送的数据进行解调译 码, 以获得译码结果;
第四消息通知单元, 用于将所述第三处理单元的译码结果通知所述 至少一个源节点, 使得所述至少一个源节点根据所述目的节点发送的译 码结果和第三中继节点发送的译码结果决定在下一个时隙重传所述数据 或传送新的数据。
24、 一种中继节点, 所述中继节点包括:
第六接收单元, 用于在当前时隙接收至少一个源节点发送的数据; 第四处理单元, 用于对所述第六接收单元接收的数据进行解调译码, 以获得译码结果;
第六消息通知单元, 用于将所述第四处理单元的译码结果通知所述 至少一个源节点和所述目的节点, 使得所述源节点根据所述通知单元的 译码结果和所述目的节点发送的译码结果决定在下一个时隙重传所述数 据或传送新的数据; 使得所述目的节点根据所述通知单元的译码结果和 所述目的节点的译码结果通知所述中继节点在下一个时隙传送所述源节 点的数据或者处于监听状态。
25、 一种源节点, 所述源节点包括:
发送单元, 用于在当前时隙源节点向目的节点和第三中继节点发送 数据;
第七接收单元, 用于接收所述目的节点和所述第三中继节点对所述 数据进行解调译码后的译码结果;
第五处理单元, 用于根据所述第七接收单元接收的译码结果确定所 述源节点在下一个时隙重传所述数据或传送新的数据。
26、 一种计算机可读程序, 其中当在目的节点中执行所述程序时, 所述程序使得计算机在所述目的节点中执行如权利要求 1-12、 16-18的任 一项权利要求所述的数据传输方法。
27、 一种存储有计算机可读程序的存储介质, 其中所述计算机可读 程序使得计算机在目的节点中执行如权利要求 1-12、 16-18的任一项权利 要求所述的数据传输方法。
28、 一种计算机可读程序, 其中当在中继节点中执行所述程序时, 所述程序使得计算机在所述中继节点中执行如权利要求 19或 20所述的 数据传输方法。
29、 一种存储有计算机可读程序的存储介质, 其中所述计算机可读 程序使得计算机在中继节点中执行如权利要求 19或 20所述的数据传输 方法。
30、 一种计算机可读程序, 其中当在源节点中执行所述程序时, 所 述程序使得计算机在所述源节点中执行如权利要求 21或 22所述的数据 传输方法。
31、 一种存储有计算机可读程序的存储介质, 其中所述计算机可读 程序使得计算机在源节点中执行如权利要求 21或 22所述的数据传输方法。
PCT/CN2011/070925 2011-02-11 2011-02-11 一种数据传输方法、无线通信系统、目的节点和中继节点 WO2012106842A1 (zh)

Priority Applications (6)

Application Number Priority Date Filing Date Title
KR1020137024106A KR20130124969A (ko) 2011-02-11 2011-02-11 데이터 전송 방법, 무선 통신 시스템, 목적지 노드 및 중계 노드
PCT/CN2011/070925 WO2012106842A1 (zh) 2011-02-11 2011-02-11 一种数据传输方法、无线通信系统、目的节点和中继节点
EP11858266.7A EP2675097A1 (en) 2011-02-11 2011-02-11 Data transmission method, wireless communication system, destination node and relay node
CN201180067141XA CN103348619A (zh) 2011-02-11 2011-02-11 一种数据传输方法、无线通信系统、目的节点和中继节点
JP2013552814A JP2014509488A (ja) 2011-02-11 2011-02-11 データ伝送方法、無線通信システム、目的ノード及び中継ノード
US13/962,781 US20130322321A1 (en) 2011-02-11 2013-08-08 Data transmission method, wireless communication system, destination node and relay node

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2011/070925 WO2012106842A1 (zh) 2011-02-11 2011-02-11 一种数据传输方法、无线通信系统、目的节点和中继节点

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US13/962,781 Continuation US20130322321A1 (en) 2011-02-11 2013-08-08 Data transmission method, wireless communication system, destination node and relay node

Publications (1)

Publication Number Publication Date
WO2012106842A1 true WO2012106842A1 (zh) 2012-08-16

Family

ID=46638119

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/070925 WO2012106842A1 (zh) 2011-02-11 2011-02-11 一种数据传输方法、无线通信系统、目的节点和中继节点

Country Status (6)

Country Link
US (1) US20130322321A1 (zh)
EP (1) EP2675097A1 (zh)
JP (1) JP2014509488A (zh)
KR (1) KR20130124969A (zh)
CN (1) CN103348619A (zh)
WO (1) WO2012106842A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111434062A (zh) * 2017-10-19 2020-07-17 诺基亚技术有限公司 用于蜂窝通信的改进的辅助重传技术

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9859970B2 (en) * 2015-03-09 2018-01-02 Cisco Technology, Inc. Parent device allocation of retransmit slot to child network device on behalf of peer child device in a deterministic network
FR3045249A1 (fr) * 2015-12-11 2017-06-16 Orange Procede, dispositif de relayage et destinataire avec retour dans un systeme omamrc
CN111835856B (zh) * 2020-07-17 2022-09-16 北京百度网讯科技有限公司 文件下载的方法、装置、设备以及存储介质
US20220039145A1 (en) * 2020-07-28 2022-02-03 Qualcomm Incorporated User equipment (ue) assisted uplink (ul) transmission

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101316155A (zh) * 2008-07-14 2008-12-03 浙江大学 采用分布式mimo和网络编码技术的无线传输方法
EP2057775A1 (en) * 2006-08-24 2009-05-13 Nokia Siemens Networks Gmbh & Co. Kg Relay-assisted harq transmission system
CN101471756A (zh) * 2007-12-27 2009-07-01 上海无线通信研究中心 集中式调度的多跳中继下行系统中的harq方法

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE50302345D1 (de) * 2002-06-21 2006-04-13 Siemens Ag Verfahren und kommunikationsstation zum bertragen von daten
GB0316692D0 (en) * 2003-07-17 2003-08-20 Koninkl Philips Electronics Nv Enhanced multi-path for mimo devices
US7970344B2 (en) * 2004-12-27 2011-06-28 Panasonic Corporation Wireless communication apparatus, wireless communication method and wireless communication system
US7975199B2 (en) * 2006-04-03 2011-07-05 Nokia Siemens Networks Gmbh & Co. Kg Relay-assisted HARQ transmission system
JP4775902B2 (ja) * 2006-05-08 2011-09-21 Kddi株式会社 無線マルチホップネットワークの中継通信方法、宛先無線局、中継通信システム及びプログラム
GB0619455D0 (en) * 2006-10-02 2006-11-08 Fujitsu Ltd Communication system
US7984356B2 (en) * 2006-12-07 2011-07-19 Nokia Siemens Networks Oy Acknowledgments or negative acknowledgments by relay stations and subscriber stations
JP5154582B2 (ja) * 2007-03-09 2013-02-27 ゼットティーイー(ユーエスエー)インコーポレーテッド マルチホップ中継局を有するワイヤレスセルラネットワークにおける無線リソース管理
US20090116422A1 (en) * 2007-11-02 2009-05-07 Chia-Chin Chong Method and system for opportunistic hybrid relay selection scheme for downlink transmission
US8953467B2 (en) * 2008-09-08 2015-02-10 Nokia Corporation Adaptive transmission modes for transparent relay
JPWO2010029763A1 (ja) * 2008-09-12 2012-02-02 パナソニック株式会社 中継装置及び中継方法
US8358608B2 (en) * 2008-11-14 2013-01-22 Samsung Electronics Co., Ltd. Method and apparatus for HARQ operation with network coding

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2057775A1 (en) * 2006-08-24 2009-05-13 Nokia Siemens Networks Gmbh & Co. Kg Relay-assisted harq transmission system
CN101471756A (zh) * 2007-12-27 2009-07-01 上海无线通信研究中心 集中式调度的多跳中继下行系统中的harq方法
CN101316155A (zh) * 2008-07-14 2008-12-03 浙江大学 采用分布式mimo和网络编码技术的无线传输方法

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111434062A (zh) * 2017-10-19 2020-07-17 诺基亚技术有限公司 用于蜂窝通信的改进的辅助重传技术

Also Published As

Publication number Publication date
KR20130124969A (ko) 2013-11-15
EP2675097A1 (en) 2013-12-18
JP2014509488A (ja) 2014-04-17
US20130322321A1 (en) 2013-12-05
CN103348619A (zh) 2013-10-09

Similar Documents

Publication Publication Date Title
US10911183B2 (en) System and method for HARQ for cellular integrated D2D communications
KR101003196B1 (ko) 중계방식을 사용하는 무선통신시스템에서 재전송 장치 및방법
US11411637B2 (en) System for non-terrestrial communications
US8358608B2 (en) Method and apparatus for HARQ operation with network coding
CN102428669B (zh) 协作基站上行链路的混合arq机制
JP5345159B2 (ja) 中継チャンネルにおける通信を改善するための方法及び装備
US8332704B2 (en) Apparatus and method for supporting automatic retransmission request (ARQ) in a wireless relay communication system
EP1982455A2 (en) A bandwidth efficient harq scheme in relay network
WO2009006092A1 (en) Method and system for a reliable relay-associated and opportunistic cooperative transmission schemes
KR20120099691A (ko) 물리층 네트워크 부호화를 이용한 쌍방향 중계 방식의 방법 및 장치
US10630430B2 (en) System and method for dual-coding for dual-hops channels
WO2012122802A1 (zh) 数据重传方法、中继站、基站和通信系统
CN108370293B (zh) 中继方法、中继器、目的地设备及其通信系统
WO2012106842A1 (zh) 一种数据传输方法、无线通信系统、目的节点和中继节点
WO2009127144A1 (zh) 数据传输方法
WO2008148293A1 (fr) Procédé et dispositif permettant d'effectuer une requête de répétition automatique de paquets de données dans un réseau de communication sans fil
CN103546245A (zh) 一种基于网络编码的数据包重传方法
WO2009127141A1 (zh) 数据传输方法
Chen et al. ARQ protocols for two-way relay systems
Sun et al. Cooperative hybrid-ARQ protocol with network coding
WO2012094881A1 (zh) 一种无线网络及无线通信中的编码协作方法
Arpitha et al. Cooperative Hybrid Automatic Repeat Request Based on the Number of Retransmissions
Nan Reliability Strategies for Data Transmission in Wireless Mesh Network
WO2016184074A1 (zh) 一种基于协作网络编码场景的传输方法及系统

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11858266

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2013552814

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2011858266

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 20137024106

Country of ref document: KR

Kind code of ref document: A