Efficient Systolic Implementation of DFT Using a Low-Complexity Convolution-Like Formulation

@article{Meher2006EfficientSI,
  title={Efficient Systolic Implementation of DFT Using a Low-Complexity Convolution-Like Formulation},
  author={Pramod Kumar Meher},
  journal={IEEE Transactions on Circuits and Systems II: Express Briefs},
  year={2006},
  volume={53},
  pages={702-706}
}
A reduced-complexity algorithm is presented for computation of the discrete Fourier transform, where N-point transform is computed from eight number of nearly (N/8)-point circular-convolution-like operations. A systolic architecture is also derived for very large-scale integration circuit implementation of the proposed algorithm. The proposed architecture is fully pipelined and contains regular and simple locally connected processing elements. It is devoid of complex control structure and is… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Hardware efficient base-4 systolic architecture for computing the discrete Fourier transform

  • J. G. Nash
  • Proc. IEEE Workshop Signal Process. Syst. (SIPS…
  • 2002
1 Excerpt

The Fourier Transform and Its Applications, 3rd ed

  • R. N. Bracewell
  • New York: McGraw-Hill,
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…