IP Library Granted Patent US 9,819,454
Granted Patent B2
US 9,819,454 · App. 14/568,087 · Granted Nov 14, 2017

Wireless communication apparatus and method for HARQ buffer management

Inventors: Nitin Jain (New Delhi, IN); Maneesh Gupta (Faridabad, IN)
Assignee: NXP USA, INC.
H04L1/1812H04L1/1809H04L1/1822H04L1/1835H04L1/1819
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,819,454
App. No.
14/568,087
Granted
Nov 14, 2017
Kind
B2
Abstract

A transmission node in a wireless communication network includes a receiving unit for receiving a set of data packets transmitted from a set of nodes in the network scheduled in one TTI, a memory unit having a number of memory blocks, each for storing a set of data packets transmitted in a separate TTI of a HARQ process. Each memory block includes sub-memory blocks, each of which is for storing a data packet transmitted from a separate UE. The transmission node further includes a processor for allocating the set of data packets to the sub-memory blocks and releasing the sub-memory blocks after one HARQ process upon receipt of the set of data packets.

Claims (50)

1. A transmission node in a wireless communication network, comprising:

a receiving unit for receiving a plurality of data packets transmitted from nodes in the wireless communication network, wherein in each transmission time interval (TTI), a set of the nodes are scheduled to transmit a set of data packets to the transmission node, wherein each node of the set of nodes transmits one data packet to the transmission node in one TTI;

a memory unit connected to the receiving unit, wherein the memory unit includes a first buffer and a second buffer, wherein each of the first buffer and the second buffer includes a first number of memory blocks for storing the plurality of data packets, wherein the set of data packets transmitted in a particular TTI are stored in one memory block corresponding to the particular TTI in the first buffer, wherein each of the first number of memory blocks comprises a plurality of sub-memory blocks, wherein each of the plurality of sub-memory blocks stores one data packet;

a processor connected to the memory unit, comprising:

a buffer control unit for allocating the set of data packets into the plurality of sub-memory blocks and releasing the plurality of sub-memory blocks after a first number of TTIs upon receipt of the set of data packets; and

a data processing unit for decoding the plurality of data packets; and

a transmitting unit for transmitting acknowledgment information based on a result of the decoded plurality of data packets, wherein the transmitting unit transmits a negative acknowledgement and the buffer control unit retains a sub-memory block when the data processing unit fails to decode a data packet.

2. The transmission node of claim 1 , wherein the first number is determined by a duration of a Hybrid Automatic Repeat Request process.

3. The transmission node of claim 1 , wherein when the data processing unit succeeds in decoding a data packet transmitted from a node, the transmitting unit transmits an acknowledgement of the data packet to the node, and the buffer control unit releases a sub-memory block used for storing the data packet.

4. The transmission node of claim 1 , wherein if-when the data processing unit fails to decode a data packet transmitted from a node, the transmitting unit transmits a negative-acknowledgement of the data packet to the node, and the buffer control unit retains a sub-memory block that stores the data packet for re-transmission.

5. The transmission node of claim 4 , wherein the node re-transmits the data packet upon receipt of the negative-acknowledgement.

6. The transmission node of claim 5 , wherein the data packet corresponds to a set of unique identification information available in the transmission node that indicates a node from which the data packet was transmitted and a TTI in which the data packet was transmitted.

7. The transmission node of claim 5 , wherein the buffer control unit allocates the data packet re-transmitted from the node to the sub-memory block retained for re-transmission based on unique identification information.

8. The transmission node of claim 5 , wherein the data processing unit combines the data packet re-transmitted from the node with the data packet to form a combined data packet, and the buffer control unit allocates the combined data packet to a sub-memory block corresponding to a TTI in the second buffer.

9. The transmission node of claim 1 , wherein each memory block comprises a second number of sub-memory blocks, wherein the second number is fixed and is determined by a maximum number of the set of the plurality of nodes scheduled in one TTI, and wherein a size of each of the second number of sub-memory blocks is fixed and is determined by a maximum size of a data packet transmitted by one node.

10. The transmission node of claim 9 , wherein a size of a sub-memory block is dynamically allocated according to a size of the data packet.

11. The transmission node of claim 10 , wherein the buffer control unit allocates the data packet re-transmitted from the node to the sub-memory block retained for re-transmission based on unique identification information, and the size of the data packet.

12. A method of operating a transmission node in a wireless communication network, comprising:

receiving a first set of data packets transmitted from a set of nodes in the network in a first transmission time interval (TTI), wherein each of the set of nodes transmits one data packet to the transmission node in the first TTI;

storing the first set of data packets to a memory block corresponding to the first TTI in a first buffer, wherein each of the first set of data packets is stored in a separate sub-memory block of the memory block;

decoding a first particular data packet of the first set of data packets;

transmitting a positive acknowledgement information based on a positive result of the decoding;

based on a negative result of the decoding:

transmitting a negative acknowledgement information;

retaining a sub-memory block in the first buffer in which a particular data packet is stored;

in response to a first number of transmission time intervals not having elapsed, receiving a second set of data packets in a second TTI, wherein the second set of data packets includes a second particular data packet, wherein the second particular data packet is a retransmisssion of the first particular data packet;

decoding the second particular data packet;

producing a combined data packet by combining the first particular data packet and the second particular data packet using Hybrid Automatic Repeat Request (HARQ) combining; and

storing the combined data packet in a memory block corresponding to the second TTI in a second buffer; and

releasing sub-memory blocks after the first number of TTIs upon receipt of the set data packets stored in the sub-memory blocks.

13. The method of claim 12 , wherein the first number of TTIs is determined by duration of a Hybrid Automatic Repeat Request process.

14. The method of claim 12 , wherein the step of transmitting a positive acknowledgement information includes transmitting an acknowledgement of a data packet to a node from which the data packet was transmitted and releasing a sub-memory block that stores the data packet, when the data packet is successfully decoded.

15. The method of claim 12 , wherein the step of transmitting a negative acknowledgement information includes transmitting a negative-acknowledgement of a data packet to a node from which the data packet was transmitted and retaining a sub-memory block that stores the data packet for re-transmission, when the data packet is not successfully decoded.

16. The method of claim 15 , wherein each of the first set of data packets and the second set of data packets corresponds to a set of unique identification information available in the transmission node that indicates the node from which the data packet was transmitted and a TTI in which the data packet was transmitted.

17. The method of claim 16 , further comprising receiving and allocating the second particular data packet re-transmitted from the node to the sub-memory block retained for re-transmission of the first particular data packet based on unique identification information.

18. The method of claim 12 , further comprising dynamically allocating a sub-memory block of the memory block based on a size of the first data packet.

19. The method of claim 18 , further comprising receiving and allocating the second particular data packet re-transmitted from the node to the sub-memory block retained for re-transmission of the first particular data packet based on the size of the first particular data packet.

20. A transmission node in a wireless communication network, comprising:

a memory unit including a first buffer and a second buffer, wherein:

each buffer includes a first number of memory blocks;

each memory block is configured to store data packets received from a plurality of communication nodes during a single transmission time interval and includes a second number of memory sub-blocks;

each memory sub-block is configured to hold one data packet; and

circuitry configured to:

receive a first set of data packets during a first transmission time interval;

store the first set of data packets at a third number of memory sub-blocks at a first memory block at the first buffer;

receive a second set of data packets during a second transmission time interval;

store the second set of data packets at a fourth number memory sub-blocks at a second memory block at the first buffer;

receive a third set of data packets during a third transmission interval;

perform Hybrid Automatic Repeat Request (HARQ) combining to combine a first particular data packet stored at the second memory block with a second particular data packet from the third set of data packets to create a combined data packet, wherein the second particular data packet is a retransmitted copy of the first particular data packet; and

store the combined data packet into a memory sub-block at a third memory block at the second buffer.

Assignments (11)
RELEASE OF SECURITY INTEREST Recorded Sep 10, 2019
From: MORGAN STANLEY SENIOR FUNDING, INC.
To: NXP B.V.
Reel/Frame 050744/0097 →
CORRECTIVE ASSIGNMENT TO CORRECT THE NATURE OF CONVEYANCE PREVIOUSLY RECORDED AT REEL: 040626 FRAME: 0683. ASSIGNOR(S) HEREBY CONFIRMS THE MERGER AND CHANGE OF NAME EFFECTIVE NOVEMBER 7, 2016. Recorded Jan 12, 2017
From: NXP SEMICONDUCTORS USA, INC. (MERGED INTO); FREESCALE SEMICONDUCTOR, INC. (UNDER)
To: NXP USA, INC.
Reel/Frame 041414/0883 →
CHANGE OF NAME Recorded Nov 16, 2016
From: FREESCALE SEMICONDUCTOR INC.
To: NXP USA, INC.
Reel/Frame 040626/0683 →
SUPPLEMENT TO THE SECURITY AGREEMENT Recorded Jun 16, 2016
From: FREESCALE SEMICONDUCTOR, INC.
To: MORGAN STANLEY SENIOR FUNDING, INC.
Reel/Frame 039138/0001 →
ASSIGNMENT AND ASSUMPTION OF SECURITY INTEREST IN PATENTS Recorded Jan 5, 2016
From: CITIBANK, N.A.
To: MORGAN STANLEY SENIOR FUNDING, INC.
Reel/Frame 037444/0444 →
ASSIGNMENT AND ASSUMPTION OF SECURITY INTEREST IN PATENTS Recorded Jan 5, 2016
From: CITIBANK, N.A.
To: MORGAN STANLEY SENIOR FUNDING, INC.
Reel/Frame 037444/0535 →
PATENT RELEASE Recorded Dec 21, 2015
From: CITIBANK, N.A., AS COLLATERAL AGENT
To: FREESCALE SEMICONDUCTOR, INC.
Reel/Frame 037358/0001 →
SUPPLEMENT TO IP SECURITY AGREEMENT Recorded Feb 18, 2015
From: FREESCALE SEMICONDUCTOR, INC.
To: CITIBANK, N.A., AS NOTES COLLATERAL AGENT
Reel/Frame 035034/0019 →
SUPPLEMENT TO IP SECURITY AGREEMENT Recorded Feb 18, 2015
From: FREESCALE SEMICONDUCTOR, INC.
To: CITIBANK, N.A., AS NOTES COLLATERAL AGENT
Reel/Frame 035033/0923 →
SUPPLEMENT TO IP SECURITY AGREEMENT Recorded Feb 18, 2015
From: FREESCALE SEMICONDUCTOR, INC.
To: CITIBANK, N.A., AS NOTES COLLATERAL AGENT
Reel/Frame 035033/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 11, 2014
From: JAIN, NITIN; GUPTA, MANEESH
To: FREESCALE SEMICONDUCTOR, INC.
Reel/Frame 034484/0227 →
Continuity (1)
Related Publication 20160174216A1 · Jun 16, 2016