# US 2003/0067907 A1 · Method and system for efficient and reliable data packet transmission

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2003/0067907 A1
- Document ID: US20030067907A1
- Status: Published application
- Kind: A1
- Application number: 09/972,530
- Filed: 2001-10-05
- Published: 2003-04-10
- Earliest claimed: 2001-10-05
- Assignees: QUALCOMM Incorporated
- Inventors: Ramin Rezaiifar; Yongbin Wei
- Web page: https://patentgrep.com/patent/US20030067907A1

## CPC

- H04L 1/1829: Arrangements specially adapted for the receiver end
- H04L 1/16: in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L 1/1845: {Combining techniques, e.g. code combining}
- H04L 2001/125: {Arrangements for preventing errors in the return channel}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method and system provides for efficient data throughput by avoiding unnecessary data sub-packets transmission while not missing new data packets. The method and system distinguishes between a sub-packet for a current data packet and a sub-packet for a new data packet by assigning different codes to them. When a currently received sub-packet and a previously received sub-packet for a previously decoded data packet have equivalent codes, the remote station sends an acknowledgement signal to the base station, preventing unnecessary sub-packets transmission. When the currently received sub-packet and the previously received sub-packet have different codes, the remote station sends an acknowledgement signal, if the remote station can decode the new packet from the current sub-packet. Otherwise, the remote station sends a negative acknowledgement signal to the base station, and requests more sub-packs for the current packet if the limit on number of transmission for currently received sub-packet has not reached.

## Claims

### Claim 1

A method for receiving data packets on an automatic repeat request (ARQ) channel, the method comprising:
receiving a current sub-packet, the current sub-packet having a current code; and
sending an acknowledgement signal if:
a current packet corresponding to the current sub-packet has been successfully decoded; and
the current code is equivalent to a code for a previous sub-packet.

### Claim 2

A method for receiving data packets on an automatic repeat request (ARQ) channel, the method comprising:
receiving a current sub-packet, the current sub-packet having a current code; and
sending an acknowledgement signal if:
a predetermined limit for sub-packet transmission for the current data packet has reached; and
the current code is equivalent to a code for a previous sub-packet.

### Claim 3

A method for receiving data packets on an automatic repeat request (ARQ) channel, the method comprising:
receiving a current sub-packet, the current sub-packet having a current code; and
sending an acknowledgement signal if:
the current code is not equivalent to a code for a previous sub-packet; and
a current data packet corresponding to the current sub-packet may be completely decoded from the current sub-packet.

### Claim 4 (depends on 3)

The method of claim 3 further including storing the current code.

### Claim 5 (depends on 3)

The method of claim 3 further including:
storing an indication that the current data packet corresponding to the current sub-packet has been completely decoded.

### Claim 6

A method for receiving data packets on an automatic repeat request (ARQ) channel, the method comprising:
receiving a current sub-packet, the current sub-packet having a current code; and
sending a negative acknowledgement signal if:
the current code is not equivalent to a code for a previous sub-packet; and
a predetermined limit for sub-packet transmission for the current data packet has reached.

### Claim 7 (depends on 4)

The method of claim 4 further including storing the current code.

### Claim 8 (depends on 4)

The method of claim 4 further including:
storing an indication that the predetermined limit for sub-packet transmission for the current data packet has reached.

### Claim 9

A method for receiving data packets on an automatic repeat request (ARQ) channel, the method comprising:
receiving a current sub-packet, the current sub-packet having a current code; and
sending a negative acknowledgement signal if:
a current data packet corresponding to the current sub-packet may not be completely decoded from the current sub-packet; and
a predetermined limit for sub-packet transmissions for the current data packet has reached.

### Claim 10 (depends on 9)

The method of claim 9 further including:
storing an indication that the current data packet corresponding to the current sub-packet has not been decoded; and
storing an indication that the predetermined limit for sub-packet transmission for the current data packet has reached.

### Claim 11

A method for sending data packets on an automatic repeat request (ARQ) channel, the method comprising:
sending a first sub-packet, the first sub-packet having a first code; and
sending a second sub-packet, the second sub-packet having a second code,
such that the first code is equivalent to the second code if they are for same data packet.

### Claim 12 (depends on 11)

The method of claim 11, wherein the first code and the second code are binary codes.

### Claim 13

A computer readable media embodying a method for receiving data packets on an automatic repeat request (ARQ) channel, the method comprising:
receiving a current sub-packet, the current sub-packet having a current code; and
sending an acknowledgement signal if:
a current data packet corresponding to the current sub-packet has been successfully decoded; and
the current code is equivalent to a code for a previous sub-packet.

### Claim 14

An apparatus for receiving data packets on an automatic repeat request (ARQ) channel, comprising:
means for receiving a current sub-packet, the current sub-packet having a current code; and
means for sending an acknowledgement signal if:
a current data packet corresponding to the current sub-packet has been successfully decoded; and
the current code is equivalent to a code for a previous sub-packet.

### Claim 15

An apparatus for receiving data packets, comprising:
a memory unit; and
a digital signal-processing (DSP) unit communicatively coupled to the memory unit, the DSP unit being capable of:
receiving a current sub-packet, the current sub-packet having a current code; and
sending an acknowledgement signal if:
a current data packet corresponding to the current sub-packet has been successfully decoded; and
the current code is equivalent to a code for a previous sub-packet.

### Claim 16

A computer readable media embodying a method for sending data packets on an automatic repeat request (ARQ) channel, the method comprising:
sending a first sub-packet, the first sub-packet having a first code; and
sending a second sub-packet, the second sub-packet having a second code,
such that the first code is equivalent to the second code if they are for same data packet.

### Claim 17

An apparatus for sending data packets on an automatic repeat request (ARQ) channel, comprising:
sending a first sub-packet, the first sub-packet having a first code; and
sending a second sub-packet, the second sub-packet having a second code,
such that the first code is equivalent to the second code if they are for same data packet.

### Claim 18

An apparatus for receiving data packets, comprising:
a memory unit; and
a digital signal-processing (DSP) unit communicatively coupled to the memory unit, the DSP unit being capable of:
sending a first sub-packet, the first sub-packet having a first code; and
sending a second sub-packet, the second sub-packet having a second code,
such that the first code is equivalent to the second code if they are for same data packet.
