Fast computation of the discrete Fourier transform of real data

@article{Sundararajan1997FastCO,
  title={Fast computation of the discrete Fourier transform of real data},
  author={Duraisamy Sundararajan and M. Omair Ahmad and M. N. Shanmukha Swamy},
  journal={IEEE Trans. Signal Processing},
  year={1997},
  volume={45},
  pages={2010-2022}
}
Fast algorithms for the computation of the discrete Fourier transform (DFT) of real signals are important since the signals in practical situations are mostly real. The more efficient algorithms for real data are those that are derived from the algorithms for complex data. So far, all such algorithms use real array to store the data. However, as the data values are real and their transform values are mostly complex, two possible data structures can be used for these algorithms: real or complex… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS
12 Citations
2 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Computational structures for fast Fourier transform analyzers

  • D. Sundararajan, M. O. Ahmad, M.N.S. Swamy
  • US Patent no. 5 371 696, Dec. 6, 1994.
  • 1994
1 Excerpt

Similar Papers

Loading similar papers…