IP Library Granted Patent US 7,548,528
Granted Patent B2
US 7,548,528 · App. 11/349,269 · Granted Jun 16, 2009

Method for assigning and method for scheduling codes for data transmissions, between a radio station and at least one subscriber station, over an air interface of a radiocommunication system, together with network-side equipment and radio station

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 7,548,528
App. No.
11/349,269
Granted
Jun 16, 2009
Kind
B2
Abstract

Codes are assigned and scheduled for data transmissions, between a radio station and at least one subscriber station, over a wireless interface of a radio communication system, in such a way that both for transmissions in the upward direction (uplink), from subscriber stations to the radio station, and also for transmissions in the downward direction (downlink), from the radio station to subscriber stations, the lowest possible signal-to-average ratio can be achieved.

Claims (20)

1. A method for assigning codes for data transmissions between a radio station and at least one subscriber station over a wireless interface of a radio communication system, where M codes are available for assignment and each of the M codes corresponds to a branch at a same level in a code tree, so that a first half of M branches originates from a first parent branch and a second half of the M branches originates from a second parent branch, comprising:

assigning in network-side equipment in the radio station N codes taken from the M codes in such a way that N branches corresponding to the N codes in the representation at the same level lie contiguously adjacent to one another, where N is at least two and M is at least two multiplied by N and, of the N branches corresponding to the N codes in the representation at the same level, an equal number of the N branches originate from each of the first and second parent branches if N is an even number, while (N−1)/2 branches originate from the first parent branch and (N+1)/2 branches originate from the second parent branch if N is an odd number.

2. A method as recited in claim 1 , further comprising scheduling by the radio station K codes of the N codes for simultaneous data transmissions between the radio station and subscriber stations after said assigning, where K is at least two, each of the K codes is only scheduled once and, of K branches corresponding to the K codes in the representation at a level, half originate from each of the first and second parent branches if K is an even number, while (K−1)/2 branches originate from the first parent branch and (K+1)/2 branches originate from the second parent branch, if K is an odd number.

3. A method as recited in claim 2 , wherein the K branches corresponding to the K codes lie contiguously adjacent to one another for each subscriber station.

4. A method in accordance with claim 3 , further comprising

terminating said scheduling of the K codes for at least one subscriber station; and

amending any existing schedule of codes for remaining subscriber stations by repeating said scheduling.

5. A method for scheduling codes for data transmissions between a radio station and at least one subscriber station over a wireless interface of a radio communication system, where the radio station has available for scheduling N codes taken from M codes, where each of the M codes corresponds to a branch at a same level in a code tree, so that a first half of M branches originates from a first parent branch and a second half of the M branches originates from a second parent branch, and where N is greater at least two and M is at least two multiplied by N, comprising:

scheduling by the radio station K codes of the N codes for simultaneous data transmissions between the radio station and subscriber stations, where K is at least two, each of the K codes is only scheduled once and, of K branches corresponding to the K codes in the representation at a level, half originate from each of the first and second parent branches if K is an even number, while (K−1)/2 branches originate from the first parent branch and (K+1)/2 branches originate from the second parent branch if K is an odd number.

6. A method as recited in claim 5 , wherein the K branches corresponding to the K codes lie contiguously adjacent to one another for each subscriber station.

7. A method in accordance with claim 6 , further comprising

terminating said scheduling of the K codes for at least one subscriber station; and

amending any existing schedule of codes for remaining subscriber stations by repeating said scheduling.

8. Network-side equipment for a radio communication system, comprising:

a reservation unit reserving M codes, where each of the M codes corresponds to a branch at a same level in a code-tree, so that a first half of M branches originates from a first parent branch and the second half of the M branches originates from a second parent branch; and

an assignment unit assigning codes for data transmissions between a radio station and at least one subscriber station over a wireless interface, in such a way that N codes taken from the M codes are assigned to the radio station, so that N branches corresponding to the N codes in the representation at the same level lie contiguously adjacent to one another, where N is at least two and M is at least two multiplied by N and, of N branches corresponding to the N codes in the representation at the same level, half of the N branches originate from each of the first and second parent branches if N is an even number, while (N−1)/2 branches originate from the first parent branch and (N+1)/2 branches from the second parent branch if N is an odd number.

9. A radio station for a radio communication system, comprising:

at least one scheduling unit scheduling K codes, for data transmissions between the radio station and at least one subscriber station over a wireless interface, from N available codes taken from M codes, where each of the M codes corresponds to a branch at a same level in a code tree, so that a first half of M branches originates from a first parent branch and a second half of the M branches originates from a second parent branch, where N is at least two and M is at least two multiplied by N, where K is at least two of the N codes scheduled for simultaneous data transmissions between the radio station and subscriber stations, so that each of the K codes is only scheduled once and, of K branches corresponding to the K codes in the representation at a level, half originate from each of the first and second parent branches if K is an even number, while (K−1)/2 branches originate from the first parent branch and (K+1)/2 branches originate from the second parent branch if K is an odd number.

10. A radio station in accordance with claim 9 , wherein the K branches corresponding to the K codes lie contiguously adjacent to one another for each subscriber station.

11. A radio station in accordance with claim 10 , wherein said at least one scheduling unit, after the scheduling of the K codes for at least one subscriber station is terminated, amends an existing schedule of the K codes for remaining subscriber stations by repeating the scheduling.

Assignments (3)
CHANGE OF NAME Recorded Nov 19, 2014
From: NOKIA SIEMENS NETWORKS GMBH & CO. KG
To: NOKIA SOLUTIONS AND NETWORKS GMBH & CO. KG
Reel/Frame 034294/0675 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 15, 2008
From: SIEMENS AKTIENGESELLSCHAFT
To: NOKIA SIEMENS NETWORKS GMBH & CO. KG
Reel/Frame 020838/0205 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 8, 2006
From: BREUER, VOLKER; JUNGHANNS, STEFFEN; LAMPRECHT, FRANK; SPLETT, ARMIN; ULRICH, THOMAS; GUNTER, WOLFF
To: SIEMENS AKTIENGESELLSCHAFT
Reel/Frame 017865/0695 →