# US 2008/0304588 A1 · Methods and apparatus for mapping control channels to resources in OFDM systems

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

- Number: US 2008/0304588 A1
- Document ID: US20080304588A1
- Status: Published application
- Kind: A1
- Application number: 11/979,829
- Filed: 2007-11-08
- Published: 2008-12-11
- Earliest claimed: 2007-06-08
- Assignees: Samsung Electronics Co., Ltd.
- Inventors: Zhouyue Pi
- Web page: https://patentgrep.com/patent/US20080304588A1

## CPC

- H04W 72/00: Local resource management
- H04B 7/0417: Feedback systems
- H04B 7/0452: Multi-user MIMO systems
- H04B 7/0632: {Channel quality parameters, e.g. channel quality indicator [CQI]}
- H04B 7/0634: {Antenna weights or vector/matrix coefficients}
- H04L 5/0032: {Distributed allocation, i.e. involving a plurality of allocating devices, each making partial allocation}
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04B: TRANSMISSION
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method for data transmission. The method including the steps of generating at least one resource tree, mapping a plurality of resource elements into respective leaf nodes in the at least one resource tree according to a certain mapping scheme, with each node in the at least one resource tree representing a resource allocation scheme for data transmission, and transmitting data using a resource allocation scheme selected from among the plurality of resource allocation schemes represented by respective nodes in the at least one resource tree. In response to reception of the data, a receiver decodes the data by recursively applying the plurality of resource allocation schemes represented by respective nodes in the at least one resource tree until the data is decoded.

## Claims

### Claim 1

A method for data transmission, the method comprising the steps of:
generating at least one resource tree, each resource tree comprising a plurality of nodes comprising a root node and at least one leaf node, linked by zero, and one or more inner nodes;
mapping a plurality of resource elements into respective leaf nodes in the at least one resource tree according to a certain mapping scheme, with each node in the at least one resource tree representing a resource allocation scheme for data transmission; and
transmitting data using a resource allocation scheme selected from among the plurality of resource allocation schemes represented by respective nodes in the at least one resource tree.

### Claim 2 (depends on 1)

The method of claim 1, comprised of:
each of the leaf nodes that are mapped with resource elements corresponding to one resource element, and representing a resource allocation scheme where the corresponding resource element is allocated for data transmission,
each of the root nodes corresponding to a combination of resource elements represented by the descendant leaf nodes of said root node, and representing a resource allocation scheme where the corresponding combination of resource elements are allocated for data transmission.

### Claim 3 (depends on 2)

The method of claim 2, comprised of:
each of the inner nodes corresponding to a combination of resource elements represented by the descendant leaf nodes of said inner node, and representing a resource allocation scheme where the corresponding combination of resource elements are allocated for data transmission.

### Claim 4 (depends on 1)

The method of claim 1, comprised of at least one leaf node not corresponding to any resource element, and not representing any resource allocation scheme.

### Claim 5 (depends on 1)

The method of claim 1, further comprising,
responding to reception of the data at a receiver by decoding the data by recursively applying the plurality of resource allocation schemes represented by respective nodes in the at least one resource tree until the data is decoded.

### Claim 6 (depends on 1)

The method of claim 1, comprised of the mapping scheme for mapping the plurality of resource element into respective leaf nodes being specific for different cells covered by corresponding base stations.

### Claim 7 (depends on 1)

The method of claim 1, comprised of the mapping scheme for mapping the plurality of resource element into respective leaf nodes changing over time.

### Claim 8 (depends on 1)

The method of claim 1, comprised of the mapping scheme for mapping the plurality of resource element into respective leaf nodes being specific for different receivers.

### Claim 9 (depends on 1)

The method of claim 1, comprised of the generation of the at least one resource trees being dependent upon the number of resource elements that are available for data transmission.

### Claim 10 (depends on 1)

The method of claim 1, comprised of the mapping scheme for mapping the plurality of resource element into respective leaf nodes being dependent upon the number of resource elements that are available for data transmission.

### Claim 11 (depends on 1)

The method of claim 1, comprised of assigning different subtrees of the at least one resource trees for different transmitters that are using different number of resource elements for data transmission.

### Claim 12 (depends on 11)

The method of claim 11, comprised of the receiver decoding the received data by recursively applying a set of resource allocation schemes that are represented by respective nodes in the assigned subtree according to the number of resource elements that are used for data transmission until the data is decoded.

### Claim 13 (depends on 1)

The method of claim 1, comprised of assigning different subtrees of the at least one resource trees for different number of resource elements that are available for the data transmission, with at least one subtree consisting of selected levels of inner nodes.

### Claim 14 (depends on 13)

The method of claim 13, comprised of the receiver decoding the received data by recursively applying a set of resource allocation schemes that are represented by respective nodes in the assigned subtree according to the number of available resource elements until the data is decoded.

### Claim 15 (depends on 1)

The method of claim 1, comprised of assigning a set of transmission formats to each node of the at least one resource tree, with the transmission format comprising information of the number of information bits, a coding scheme, a coding rate, and a modulation scheme.

### Claim 16 (depends on 15)

The method of claim 15, comprised of the receiver decoding the received data by recursively applying a set of resource allocation schemes that are represented by respective nodes in the at least one resource tree, and recursively applying the set of transmission formats in each node, until the data is decoded.

### Claim 17 (depends on 1)

The method of claim 1, comprised of assigning a set of control channel messages to each node of the at least one resource tree, with the control channel message comprising down link single input single output grant, downlink multiple input multiple output grant, uplink single input single output grant, and uplink input multiple output grant.

### Claim 18

A transmitter for transmitting data, comprising:
a modulator modulating data to be transmitted into a plurality of modulated symbols;
a memory storing resource elements in at least one resource tree configurations, with each resource tree comprising a plurality of nodes comprising a root node and at least one leaf node, linked by zero, and one or more inner nodes, a plurality of resource elements being mapped into respective leaf nodes in the at least one resource tree according to a certain mapping scheme, and each node in the at least one resource tree representing a resource allocation scheme for data transmission;
a resource selection unit selecting a resource allocation scheme from among the plurality of resource allocation schemes represented by the nodes of the at least one resource tree; and
a front end processing unit processing the plurality of modulated symbols according to the selected resource allocation scheme and transmitting the plurality of processed modulated symbols.

### Claim 19 (depends on 18)

The transmitter of claim 18, comprised of:
each of the leaf nodes that are mapped with resource elements corresponding to one resource element, and representing a resource allocation scheme where the corresponding resource element is allocated for data transmission,
each of the root nodes corresponding to a combination of resource elements represented by the descendant leaf nodes of said root node, and representing a resource allocation scheme where the corresponding combination of resource elements are allocated for data transmission.

### Claim 20 (depends on 19)

The transmitter of claim 19, comprised of:
each of the inner nodes corresponding to a combination of resource elements represented by the descendant leaf nodes of said inner node, and representing a resource allocation scheme where the corresponding combination of resource elements are allocated for data transmission.

### Claim 21

A receiver for receiving data, comprising:
a front end processing unit for receiving data symbols;
a storing unit for storing resource elements in at least one resource tree configurations, with each resource tree comprising a plurality of nodes comprising a root node and at least one leaf nodes, linked by zero, one or more inner nodes, a plurality of resource elements being mapped into respective leaf nodes in the at least one resource tree according to a certain mapping scheme, and each node in the at least one resource tree representing a resource allocation scheme for data transmission; and
a decoder for decoding the received data by recursively applying a resource allocation scheme represented by the nodes in the resource trees stored in the storing unit until the data is decoded.

### Claim 22 (depends on 21)

The transmitted of claim 21, comprised of:
each of the leaf nodes that are mapped with resource elements corresponding to one resource element, and representing a resource allocation scheme where the corresponding resource element is allocated for data transmission,
each of the root nodes corresponding to a combination of resource elements represented by the descendant leaf nodes of said root node, and representing a resource allocation scheme where the corresponding combination of resource elements are allocated for data transmission.

### Claim 23 (depends on 22)

The transmitted of claim 22, comprised of:
each of the inner nodes corresponding to a combination of resource elements represented by the descendant leaf nodes of said inner node, and representing a resource allocation scheme where the corresponding combination of resource elements are allocated for data transmission.
