Scheme for Packet Allocation in a Radiocommunication System

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.

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.

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.

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.