Frame mapping scheduler with compressed mapping table

1. A processing device for use in a communication system, the device comprising:

scheduling circuitry configured to schedule data blocks for transmission from a plurality of transmission elements in timeslots of a frame, utilizing at least a mapping table;

the mapping table comprising at least one entry specifying a mapping between a particular timeslot of the frame and a particular one of the transmission elements;

the scheduling circuitry being further configured to determine a particular transmission element to be scheduled in a given timeslot by accessing a corresponding mapping table entry to identify the particular transmission element; and

memory circuitry associated with the scheduling circuitry and configurable to store at least a portion of the mapping table in a compressed format;

the mapping table being stored as a compressed mapping table in which a particular entry identifies one of a plurality of stored values which is processed to determine a corresponding uncompressed mapping table entry.

2. The processing device of claim 1 wherein the particular entry of the compressed mapping table identifies one of a plurality of stored values which if added to an accumulator will result in the corresponding uncompressed mapping table entry.

3. The processing device of claim 1 wherein the compressed mapping table is generated by determining, for i=1 to F−1 where F denotes the number of schedulable timeslots in the frame, which particular one of a plurality of possible different values S i =M i −M i−1 is associated with an i-th entry M i of the uncompressed mapping table, and storing in the corresponding entry of the compressed mapping table an identifier of a memory location storing that particular one of the plurality of possible different values.

4. The processing device of claim 3 wherein the memory location comprises a register.

5. The processing device of claim 4 wherein each of the plurality of possible different values S i is stored in a different register, the compressed memory table comprising F−1 entries each identifying one of the registers.

6. The processing device of claim 1 wherein the particular entry of the compressed mapping table identifies one of three different stored values generated from the uncompressed mapping table entries.

7. The processing device of claim 6 wherein a difference between a first entry of the uncompressed mapping table and a last entry of the uncompressed mapping table results in one of the three different stored values.

8. The processing device of claim 1 wherein a given one of the values in the plurality of stored values is generated as a difference between values in adjacent entries of the uncompressed mapping table.

9. The processing device of claim 1 wherein an uncompressed mapping table entry is generated from a corresponding compressed mapping table entry by utilizing the compressed mapping table entry to identify a particular one of the plurality of stored values, and adding the identified value to a current value of an accumulator to obtain the uncompressed mapping table entry.

10. The processing device of claim 1 wherein the uncompressed mapping table has a first entry which is always zero, such that the compressed mapping table need not include an entry corresponding to the first entry of the uncompressed mapping table.

11. The processing device of claim 1 wherein an amount of memory capacity required to store the compressed mapping table is given approximately by 2·(F−1) bits, where F denotes the number of schedulable timeslots in the frame.

12. The processing device of claim 1 wherein the compressed mapping table comprises at least F−1 entries each comprising two bits, where F denotes the number of schedulable timeslots in the frame.

13. The processing device of claim 1 wherein an amount of memory capacity required to store the plurality of stored values is given approximately by:

3·┌log 2 F┐ bits,

where F denotes the number of schedulable timeslots in the frame.

14. The processing device of claim 1 wherein the scheduling circuitry utilizes a weight table in conjunction with the mapping table, the weight table comprising a plurality of entries, each of the entries identifying a particular one of the transmission elements, and wherein the scheduling circuitry is further configured to determine a particular transmission element to be scheduled in a given timeslot by accessing a corresponding mapping table entry and utilizing a resultant value to access the weight table, the weight table associating each of the transmission elements with one or more of the timeslots of the frame.

15. The processing device of claim 1 wherein entries of the mapping table are predetermined utilizing a designated ratio.

16. The processing device of claim 15 wherein the designated ratio comprises a golden ratio.

17. The processing device of claim 15 wherein the entries of the mapping table are determined by:

utilizing the designated ratio to compute a plurality of G i values;

sorting the computed values in a specified order; and

taking the entries as a sequence of subscript indices.

18. The processing device of claim 1 wherein the memory circuitry comprises at least one of internal memory and external memory of the processing device.

19. The processing device of claim 1 wherein the processing device comprises a network processor integrated circuit.

20. A method for use in a processing device of a communication system, the method comprising:

scheduling data blocks for transmission from a plurality of transmission elements, utilizing a mapping table;

the mapping table comprising at least one entry specifying a mapping between a particular timeslot of the frame and a particular one of the transmission elements;

a particular transmission element to be scheduled in a given timeslot being determined by accessing a corresponding mapping table entry to identify the particular transmission element;

the mapping table being stored in a compressed format, as a compressed mapping table in which a particular compressed mapping table entry identifies one of a plurality of stored values which is processed to determine a corresponding uncompressed mapping table entry.

21. An integrated circuit comprising:

a processing device having scheduling circuitry configured to schedule data blocks for transmission from a plurality of transmission elements in timeslots of a frame, utilizing at least a mapping table;

the mapping table comprising at least one entry specifying a mapping between a particular timeslot of the frame and a particular one of the transmission elements;

the scheduling circuitry being further configured to determine a particular transmission element to be scheduled in a given timeslot by accessing a corresponding mapping table entry to identify the particular transmission element;

wherein the mapping table is stored in a compressed format in memory circuitry associated with the scheduling circuitry;

the mapping table being stored as a compressed mapping table in which a particular entry identifies one of a plurality of stored values which is processed to determine a corresponding uncompressed mapping table entry.