# US 2010/0166103 A1 · Method and apparatus of transmiting encoded message

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

- Number: US 2010/0166103 A1
- Document ID: US20100166103A1
- Status: Published application
- Kind: A1
- Application number: 12/344,904
- Filed: 2008-12-29
- Published: 2010-07-01
- Earliest claimed: 2008-12-29
- Inventors: Tom HAREL; Assi JAKOBY
- Web page: https://patentgrep.com/patent/US20100166103A1

## CPC

- H04L 27/3405: {Modifications of the signal space to increase the efficiency of transmission, e.g. reduction of the bit error rate, bandwidth, or average power}
- H04L 1/0068: {by puncturing}
- H04L 1/1816: {with retransmission of the same, encoded, message}
- H04L 1/1819: {with retransmission of additional or different redundancy}
- H04L 1/1893: {Physical mapping arrangements (physical resource mapping in general H04L5/00)}
- H04L 27/345: {Modifications of the signal space to allow the transmission of additional information}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method and apparatus to encode a data message and to transmit the encoded data message is provided. The method may include encoding a data packed with convolution turbo codes that include code polynomials and adding to the code polynomials a desired polynomial, padding the data message with zero bits, diminishing bits that known to the receiver and transmitting the encoded padded data message according to a combined HARQ transmission scheme.

## Claims

### Claim 1

A method of lowering a data rate comprising:
encoding a data message with convolution turbo codes that include code polynomials; and
adding to the code polynomials a desired polynomial.

### Claim 2 (depends on 1)

The method of claim 1, wherein adding comprises adding a 1+D polynomial.

### Claim 3 (depends on 1)

The method of claim 1, wherein adding comprises adding a 1+D̂2 polynomial.

### Claim 4 (depends on 1)

The method of claim 1, comprising:
interleaving bits of added code polynomials; and
transmitting the encoded data message according to Hybrid Automatic repeat-request (HARQ) transmission scheme.

### Claim 5 (depends on 1)

The method of claim 1, comprising:
padding said data message with pre-defined bits;
encoding said padded data message;
puncturing said padded data message of systematic padding bits which are known at a receiver;
puncturing said padded data message of at least a portion of parity bits that are at the same position of parity bits of a trails of the encoded padded data message; and
transmitting remaining bits, after the puncturing, of the encoded padded data message.

### Claim 6 (depends on 4)

The method of claim 4 wherein transmitting comprises:
transmitting bits of said data message according to a Hybrid Automatic Repeat-request (HARQ) transmission scheme, wherein the bits for transmission are selected according to an Incremental Redundancy (IR) scheme and are modulated with a Constellation-Rearrangement (CoRe) version that is adapted according to the number of times that the bits were transmitted in previous transmissions.

### Claim 7 (depends on 6)

The method of claim 6, comprising;
varying a mother code rate according to capability of a receiver and a transmission throughput wherein, the mother code rate is the ratio between the number of information bits to a sum of a number of information bits and an number parity bits.

### Claim 8

An apparatus comprising:
a convolution turbo codes encoder to add a desired polynomial to code polynomials, encode a data message with turbo code polynomials and to interleave a plurality of bits generated with the desired added polynomial.

### Claim 9 (depends on 8)

The apparatus of claim 8, wherein the desired polynomial comprises a 1+D polynomial.

### Claim 10 (depends on 8)

The apparatus of claim 8, wherein the desired polynomial comprises a 1+D polynomial.

### Claim 11 (depends on 8)

The apparatus of claim 8, comprising:
a transmitter to transmit the encoded data message according to the Hybrid Automatic repeat-request (HARQ) transmission scheme.

### Claim 12 (depends on 8)

The apparatus of claim 8, comprising:
a bit padding module to pad said data message with zero bits; and
a bit remover module to diminished from an encoded padded data message systematic padding bits which known at a receive.

### Claim 13 (depends on 12)

The apparatus of claim 12, wherein the bit remover module is able to diminish at least a portion parity bits that are at the same position of parity bits of a trails of the encoded padded data message and to provide to the transmitter remaining bits of the encoded padded data message to be transmitted.

### Claim 14 (depends on 8)

The apparatus of claim 8, comprising:
a Hybrid Automatic Repeat-request module to transmit bits of the data message according to Incremental Redundancy (HARQ-IR) transmission scheme; and
a modulator and constellation re-arrangement module to count number of times that each bit of the encoded padded data packet has been transmitted and to change the mapping of re-transmitted bits to constellation according to Constellation-Rearrangement (CoRe) transmission scheme.

### Claim 15 (depends on 8)

The apparatus of claim 8, comprising;
a mother code rate adapter operably coupled to the turbo encoder to vary a mother code rate of an encoded data message according to number of users.

### Claim 16 (depends on 8)

The apparatus of claim 8, comprising:
a receiver to receive the data message
a turbo code decoder to decode the data message and to announce on decoding error if said decoder does not converge in a predetermined number of iterations.

### Claim 17

A wireless communication system comprising:
a wireless communication device a including a convolution turbo codes encoder to add a desired polynomial to code polynomials, encode a data message with turbo code polynomials and to interleave a plurality of bits generated with the desired added polynomial.

### Claim 18 (depends on 17)

The wireless communication system of claim 17, wherein the desired polynomial comprises 1+D polynomial.

### Claim 19 (depends on 17)

The wireless communication system of claim 17, wherein the desired polynomial comprises 1+D polynomial.

### Claim 20 (depends on 17)

The wireless communication system of claim 17, wherein the wireless communication device comprises:
a transmitter to transmit the encoded data message according to Hybrid Automatic repeat-request (HARQ) transmission scheme.

### Claim 21 (depends on 17)

The wireless communication system of claim 17, wherein the wireless communication device comprises:
a bit padding module to pad said data message with zero bits; and
a bit remover module to diminished from an encoded padded data message systematic padding bits which known at a receiver.

### Claim 22 (depends on 21)

The wireless communication system of claim 21, wherein the bit remover module is able to diminish at least a portion parity bits that are at the same position of parity bits of a trails of the encoded padded data message and to provide to the transmitter remaining bits of the encoded padded data message to be transmitted.

### Claim 23 (depends on 17)

The wireless communication system of claim 17, wherein the wireless communication device comprises:
a Hybrid Automatic Repeat-request module to transmit bits of the data message according to Incremental Redundancy (HARQ-IR) transmission scheme;
a modulator and constellation re-arrangement module to count number of times that each bit of the encoded padded data packet has been transmitted and to change the mapping of re-transmitted bits to constellation according to Constellation-Rearrangement (CoRe) transmission scheme.

### Claim 24 (depends on 17)

The wireless communication system of claim 17, wherein the wireless communication device comprises;
a mother code rate adapter operably coupled to the turbo encoder to vary a mother code rate of an encoded data message according to number of users.

### Claim 25 (depends on 17)

The wireless communication system of claim 17, wherein the wireless communication device comprises:
a receiver to receive the data message
a turbo code decoder to decode the data message and to announce on decoding error if said decoder does not converge in a predetermined number of iterations.