Methods and apparatus for job scheduling in a programmable mixed-radix DFT/IDFT processor

1. A method of processing discrete Fourier transform (“DFT”) for a wireless communication network, the method comprising:

receiving a plurality of DFT jobs via a wireless network and identifying a DFT of point size associated with each of the plurality of DFT jobs;

separating first DFT jobs from the plurality of DFT jobs in accordance with a first point size and second DFT jobs from the plurality of DFT jobs in accordance with a second point size;

bundling the first DFT jobs with the first point size to form a first mega-job; and

loading the first mega-job into an iterative vector pipeline upon determining a radix factorization in response to the first point size.

2. The method of claim 1 , further comprising computing radix computations for the first DFT jobs in the first mega-job.

3. The method of claim 2 , wherein computing radix computation further includes configuring a mixed radix engine to perform a selected one of radix3, radix4, radix5, and radix6 computations for each stage.

4. The method of claim 1 , further comprising outputting DFT results for the first DFT jobs.

5. The method of claim 1 , further comprising generating a second mega-job bundling at least a portion of the second DFT jobs with the second point size in a predefined second sequence within the second mega-job.

6. The method of claim 1 , further comprising storing the first mega-job at a first half-side of a ping-pong memory bank.

7. The method of claim 1 , further comprising storing the second mega-job at a second half-side of the ping-pong memory bank.

8. The method of claim 1 , further comprising performing an iteration to determine a radix computation in accordance with the first point size.

9. The method of claim 8 , wherein performing an iteration includes performing a radix computation relating to the first mega-job in a vector data path pipeline.

10. The method of claim 9 , wherein performing an iteration includes storing a radix result of the radix computation back into the source location in one side of the ping-pong memory buffer if a current iteration is not a last iteration.

11. The method of claim 10 , wherein performing an iteration includes outputting the radix result if the current iteration is the last iteration.

12. The method of claim 1 , further comprising generating one or more radix engine control signals to program a mixed radix engine for providing DFT calculations based on the radix factorization.

13. A method of processing wireless data formatted in discrete Fourier transform (“DFT”) or inverse DFT (“IDFT”) comprising:

receiving a plurality of IDFT jobs via a wireless data transmission;

grouping first IDFT jobs based on a first point size and group second IDFT jobs based on a second point size;

generating a first mega-job bundling the first IDFT jobs and a second mega-job bundling the second IDFT jobs;

loading the first mega-job into an iterative vector pipeline upon determining a radix factorization in response to the first point size; and

computing radix computations for the first IDFT jobs in the first mega-job.

14. The method of claim 13 , wherein computing radix computation further includes configuring a mixed radix engine to perform a selected one of radix3, radix4, radix5, and radix6 computations for each stage.

15. The method of claim 13 , further comprising outputting IDFT results for the first IDFT jobs.

16. The method of claim 13 , further comprising storing the first mega-job at a first portion of a memory bank and storing the second mega-job at second portion of the memory bank.

17. The method of claim 13 , further comprising performing a programmed radix computation in response to the first mega-job and the first point size.

18. An apparatus of processing discrete Fourier transform (“DFT”) for a wireless communication network, comprising:

means for receiving a plurality of DFT jobs via a wireless network and means for identifying a DFT of point size associated with each of the plurality of DFT jobs;

means for separating first DFT jobs from the plurality of DFT jobs in accordance with a first point size and second DFT jobs from the plurality of DFT jobs in accordance with a second point size;

means for bundling the first DFT jobs with the first point size to form a first mega-job; and

means for loading the first mega-job into an iterative vector pipeline upon determining a radix factorization in response to the first point size.

19. The apparatus of claim 18 , further comprising means for computing radix computations for the first DFT jobs in the first mega-job.

20. The apparatus of claim 19 , wherein computing radix computation further includes configuring a mixed radix engine to perform a selected one of radix3, radix4, radix5, and radix6 computations for each stage.

21. The apparatus of claim 18 , further comprising means for outputting DFT results for the first DFT jobs.

22. The apparatus of claim 18 , further comprising means for generating a second mega-job bundling at least a portion of the second DFT jobs with the second point size in a predefined second sequence within the second mega-job.

23. The apparatus of claim 18 , further comprising means for storing the first mega-job at a first half-side of a ping-pong memory bank.

24. The apparatus of claim 18 , further comprising means for storing the second mega-job at a second half-side of the ping-pong memory bank.