IP Library › Granted Patent US 9,479,292
Granted Patent B2
US 9,479,292 · App. 14/881,651 · Granted Oct 25, 2016

System and method for terminal-group based HARQ for cellular integrated D2D communications

Inventors: Amine Maaref (Kanata, CA); Mohammadhadi Baligh (Ottawa, CA); Jianglei Ma (Ottawa, CA)
Assignee: Huawei Technologies Co., Ltd.
H04L1/08H04L1/188H04L1/1816H04L1/1829H04L12/189H04L1/0076H04L2001/0093H04L2001/0097
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,479,292
App. No.
14/881,651
Granted
Oct 25, 2016
Kind
B2
Abstract

System and method embodiments are provided to support network communications with groups of UEs. The embodiments include a two-level group-based hybrid-automatic repeat request (HARQ) mechanism and acknowledgement (ACK)/negative ACK (NACK) feedback. An embodiment method includes receiving, at a UE within a virtual multi-point (ViMP) comprising UEs, a data packet for a target UE (TUE) that is broadcasted from a base station (BS) to the ViMP node, decode the data packet, and upon successfully decoding the data packet, broadcasting the data packet to the UEs within the ViMP node until a timer pre-established by the BS expires or an ACK message is received from the TUE or the ViMP node. In an embodiment, broadcasted data received in the ViMP node is re-broadcasted upon receiving a negative acknowledgment (NACK) message from the TUE, a beacon UE, or any of the UEs within the ViMP node.

Claims (36)

1. A method for supporting two-level terminal-group based hybrid-automatic repeat request (HARQ) signaling, the method comprising:

receiving, at a cooperating user equipment (CUE) within a virtual multi-point (ViMP) node comprising a plurality of UEs, a data packet for a target UE (TUE), within the ViMP node, that is broadcasted from a base station (BS) to the ViMP node;

successfully decoding the data packet;

in an absence of an acknowledgement (ACK) message or a negative ACK (NACK) message from the TUE, broadcasting, by the CUE, the data packet within the ViMP node; and

subsequent to the broadcasting, and in an absence of the NACK message from the TUE, rebroadcasting, by the CUE, the data packet within the ViMP node until either the CUE receives a subsequent broadcast of the data packet from the BS, or the CUE receives the ACK message from the TUE or the ViMP node.

2. The method of claim 1 further comprising:

receiving the broadcasted data packet from one or more UEs in the ViMP node.

3. The method of claim 2 , wherein the data packet is rebroadcasted within the ViMP node until the CUE receives the subsequent broadcast of the data packet from the BS.

4. The method of claim 2 , wherein the data packet is re-broadcasted until the ACK message is received from the TUE, a beacon UE, or any of the UEs in the ViMP node.

5. The method of claim 1 further comprising receiving the subsequent broadcast of the data packet from the BS in response to a timer pre-established by the BS expiring.

6. The method of claim 1 , wherein the data packet is rebroadcasted within the ViMP node without using scheduling within the ViMP node and without synchronization with the BS.

7. The method of claim 1 , wherein the data packet rebroadcasted to the UEs in the ViMP node comprises a network coded version of the same received and decoded data packet, additional coded symbols in case of a concatenated low-density parity check (LDPC) coding, or a given redundancy version in case of turbo coding.

8. The method of claim 7 , wherein the network coded version comprises a linear combination of successfully decoded packets, and wherein the decoded packets are combined using coefficients that are sent to the TUE with information on which packets were network coded.

9. The method of claim 7 , wherein the network coded version comprises a linear combination of successfully decoded packets, and wherein the decoded packets are combined using coefficients that are known beforehand by the TUE.

10. The method of claim 1 further comprising:

receiving, from the BS, data packets with different HARQ redundancy versions, low-density parity check (LDPC) codewords, or both for different TUEs, wherein the different HARQ redundancy versions and LDPC codewords are mapped to orthogonal signatures; and

rebroadcasting the data packets to the UEs in the ViMP node.

11. A method for supporting two-level terminal-group based hybrid-automatic repeat request (HARQ) signaling, the method comprising:

receiving, at a cooperating user equipment (CUE) within a virtual multi-point (ViMP) node comprising a plurality of UEs, a data packet for a target UE (TUE), within the ViMP node, that is broadcasted from a base station (BS) to the ViMP node;

successfully decoding the data packet;

in an absence of an acknowledgement (ACK) message or a negative ACK (NACK) message from the TUE, broadcasting, by the CUE, the data packet within the ViMP node;

subsequent to the broadcasting, receiving, by the CUE, the NACK message from the TUE;

rebroadcasting, by the CUE, the data packet within the ViMP node in response to receiving the NACK message; and

subsequent to the rebroadcasting, receiving either a subsequent broadcast of the data packet from the BS or the ACK message from the TUE.

12. The method of claim 11 further comprising:

receiving the broadcasted data packet from one or more UEs in the ViMP node.

13. The method of claim 12 , wherein the data packet is rebroadcasted within the ViMP node until the CUE receives the subsequent broadcast of the data packet from the BS.

14. The method of claim 12 , wherein the data packet is rebroadcasted until the ACK message is received from the TUE.

15. The method of claim 11 further comprising receiving the subsequent broadcast of the data packet from the BS in response to a timer pre-established by the BS expiring.

16. The method of claim 11 , wherein the data packet is rebroadcasted within the ViMP node without using scheduling within the ViMP node and without synchronization with the BS.

17. The method of claim 11 , wherein the data packet rebroadcasted within the ViMP node comprises a network coded version of the same received and decoded data packet, additional coded symbols in case of a concatenated low-density parity check (LDPC) coding, or a given redundancy version in case of turbo coding.

18. The method of claim 17 , wherein the network coded version comprises a linear combination of successfully decoded packets, and wherein the decoded packets are combined using coefficients that are sent to the TUE with information on which packets were network coded.

19. The method of claim 17 , wherein the network coded version comprises a linear combination of successfully decoded packets, and wherein the decoded packets are combined using coefficients that are known beforehand by the TUE.

20. The method of claim 11 further comprising:

receiving, from the BS, data packets with different HARQ redundancy versions, low-density parity check (LDPC) codewords, or both for different TUEs, wherein the different HARQ redundancy versions and LDPC codewords are mapped to orthogonal signatures; and

rebroadcasting the data packets to the UEs in the ViMP node.

Continuity (3)
Continuation 13829188 · Mar 14, 2013
Provisional Application 61738907 · Dec 18, 2012
Related Publication 20160036565A1 · Feb 4, 2016