A residue arithmetic implementation of the FFT

https://doi.org/10.1016/0743-7315(87)90004-9Get rights and content

Abstract

Recently, a new method of performing complex arithmetic in a residue arithmetic number system was reported. This paper extends these techniques into several application areas including the design of an FFT system. In addition, a new single-modulus complex residue number system (RNS) and sign management system is developed for use as a basic computational engine. Various RNS and conventional design options are developed and compared in the context of speed and complexity. The result of this analysis suggests that the new single-modulus complex RNS may be significantly superior to the alternative FFT design choices.

References (26)

  • A.M. Despain

    Fast Fourier transform processors using Gaussian residue arithmetic

    J. Parallel Distrib. Comput.

    (Aug. 1985)
  • D.P. Agarwal

    Modulo 2∗∗n + 1 arithmetic logic

    IEEE J. Electron. Circuits and Systems

    (Nov. 1978)
  • E.P. Armendariz et al.

    Elementary Number Theory

    (1980)
  • D.K. Banerji et al.

    On translation algorithms in residue number systems

    IEEE Trans. Comput.

    (Dec. 1972)
  • A. Baraniecka et al.

    Hardware implementation of convolution using number theoretic transforms

  • H.L. Garner

    The residue number system

    IRE Trans. Electron. Comput.

    (June 1959)
  • I.N. Herstein

    Topics in Algebra

    (1975)
  • W.K. Jenkins et al.

    The use of residue number systems in the design of finite impulse response digital filters

    IEEE Trans. Circuits and Systems

    (Apr. 1977)
  • G.A. Jullien

    Residue number scaling and other operations using ROM arrays

    IEEE Trans. Comput.

    (Apr. 1978)
  • J.J. Krosmeier et al.

    Error detection and correction in the quadratic number system

  • S.H. Leung

    Application of residue number system to complex digital filters

  • J.H. McClellan et al.

    Number Theory in Digital Signal Processing

    (1979)
  • R.A. Ramnarayan

    Practical realization of mod p, p prime multiplier

    Electron. Lett.

    (June 1980)
  • Cited by (4)

    • RESIDUE NUMBER SYSTEMS: Theory and Implementation: Vol. 2

      2007, Residue Number Systems: Theory and Implementation: Vol. 2
    • Residue number system implementations of complex heterodyne tunable filters

      2005, Proceedings - IEEE International Symposium on Circuits and Systems
    • Realizing peak performance from high speed digital gallium arsenide circuits using the residue number system

      1990, Proceedings of SPIE - The International Society for Optical Engineering

    This work was supported by the Army Research Office. Portions of this paper were presented at ARITH 7.

    View full text