Scheme for packet allocation in a radiocommunication system

• US 7,457,268 B2
• Filed: 11/10/2004
• Issued: 11/25/2008
• Est. Priority Date: 07/06/1999
• Status: Expired due to Fees

• Current Assignee: WSOU Investments, LLC (WSOU Holdings, LLC)
• Original Assignee: Alcatel SA (Nokia Corporation)
• Inventors: Lapaille, Cedric, Calot, Guillaume, Bousquet, Jacques, Baudoin, Cedric
• Primary Examiner(s): Backer, Firmin
• Assistant Examiner(s): Juntima, Nittaya
• Application Number:
  US10/985,060
• Publication Number:
  US 20050135414A1
• Time in Patent Office: 1,476 Days
• Field of Search: 370/320, 370/335, 370/342, 370/336, 370/337, 370/345, 370/347, 370/441, 370/442
• US Class Current: 370/335
• CPC Class Codes: H04L 1/0071 Use of interleaving interleaving per se H03M13/27
• CPC Class Codes: H04L 2012/5607 Radio
• CPC Class Codes: H04L 2012/5632 Bandwidth allocation
• CPC Class Codes: H04L 2012/5675 Timeslot assignment, e.g. TDMA
• CPC Class Codes: H04L 2012/5676 Code Division Multiple Access [CDMA]
• CPC Class Codes: H04L 5/0044 allocation of payload
• CPC Class Codes: H04L 5/0075 Allocation using proportional fairness
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections
• CPC Class Codes: H04W 28/14 using intermediate storage
• CPC Class Codes: H04W 52/286 during data packet transmission, e.g. high speed packet access [HSPA]
• CPC Class Codes: H04W 52/346 distributing total power among users or channels
• CPC Class Codes: H04W 72/0446 Resources in time domain, e.g. slots or frames

Abstract

The invention relates to a method for the allocation of packets on a carrier containing timeslots, comprising the step of defining an interleaving length and an allocation window characterized in that packets are allocated within groups defined by the power needed for the transmission and that the size of groups is at most equal to the interleaving length.

Claims

1. A method for the allocation of packets on a carrier containing a plurality of timeslots, comprising:

defining an allocation window for the determination of a subpart of said plurality of the timeslots to be considered during one allocation cycle,

grouping packets from said subpart within respective groups, each group being defined by a respective transmission power,

wherein said defining the allocation window includes defining an interleaving length corresponding to the number of packets that are interleaved using interleaving coding which is destined to process each group, the interleaving coding comprising applying a specific code to a respective group and wherein the size of said groups is at most equal to the interleaving length, each group being updated at each allocation cycle as a function of a power needed for transmission of the packets which the group currently contains.

2. The method for allocation of packets on a carrier containing timeslots as claimed in claim 1, wherein the packets originate from different terminals.

3. The method for allocation of packets on a carrier containing timeslots as claimed in claim 1, wherein the packets are sorted as a function of power of a packet during the allocation, and

the packets are spread in groups following the sorting order of the packets in order to minimize power loss in a group.

4. The method for allocation of packets on a carrier containing timeslots as claimed in claim 3, wherein the sorting minimizes global power loss during the allocation.

5. The method for allocation of packets on a carrier containing timeslots as claimed in claim 1, wherein the packets are interleaved in at least one group.

6. The method for allocation of packets on a carrier containing timeslots according to claim 1, wherein said method is implemented in a TDMA system.

7. The method for allocation of packets on a carrier containing timeslots according to claim 1, wherein said method is implemented in a CDMA system.

8. The method for allocation of packets on a carrier containing timeslots according to claim 1, wherein said method is implemented in a FDMA system.

10. The method for allocation of packets on a carrier containing timeslots as claimed in claim 2, wherein the packets are sorted as a function of power of a packet during the allocation, and

the packets are spread in groups following the sorting order of the packets in order to minimize power loss in a group.

9. An Asynchronous Transfer Mode (ATM) receiver for receiving packets, said receiver comprising:

storage means for storing an algorithm comprising;

defining an allocation window for the determination of a subpart of said plurality of the timeslots to be considered during one allocation cycle,

grouping packets from said subpart within respective groups, each group being defined by a respective transmission power,

wherein said defining the allocation window includes defining an interleaving length corresponding to the number of packets that are interleaved using interleaving coding which is destined to process each group, the interleaving coding comprising applying a specific code to a respective group and wherein the size of said groups is at most equal to the interleaving length, each group being updated at each allocation cycle as a function of a power needed for transmission of the packets which the group currently contains; and

computing means for executing said algorithm.

11. An Asynchronous Transfer Mode (ATM) receiver for receiving packets, said receiver comprising:

means for defining an allocation window for the determination of a subpart of said plurality of the timeslots to be considered during one allocation cycle, and

means for grouping packets from said subpart within respective groups, each group being defined by a respective transmission power,

wherein said defining the allocation window includes defining an interleaving length corresponding to the number of packets that are interleaved using interleaving coding which is destined to process each group, the interleaving coding comprising applying a specific code to a respective group and wherein the size of said groups is at most equal to the interleaving length, each group being updated at each allocation cycle as a function of a power needed for transmission of the packets which the group currently contains.