A Radix-4 FFT using Complex RNS Arithmetic

F. J. Taylor; G. Papadourakis; A. Skavantzos; A. Stouraitis

doi:10.1109/TC.1985.5009414

A Radix-4 FFT using Complex RNS Arithmetic

F. J. Taylor, G. Papadourakis, A. Skavantzos, A. Stouraitis

Electrical Engineering

University of Florida

Research output: Contribution to journal › Article › peer-review

27 Scopus citations

Abstract

Recent advancements in residue arithmetic have given rise to a complex number system variant which better than halves RNS multi-plication complexity. This advantage is applied to the problem of implementing a high-speed radix-4 RNS FFT. It is shown that a significant improvement in both complexity and speed can be achieved.

Original language	British English
Pages (from-to)	573-576
Number of pages	4
Journal	IEEE Transactions on Computers
Volume	C-34
Issue number	6
DOIs	https://doi.org/10.1109/TC.1985.5009414
State	Published - Jun 1985

Keywords

complexity theory
fast Fourier transform
nonquadratic roots
quadratic roots
residue arithmetic

Access to Document

10.1109/TC.1985.5009414

Cite this

@article{e2e2d741ee7741599f29847c479c4a96,

title = "A Radix-4 FFT using Complex RNS Arithmetic",

abstract = "Recent advancements in residue arithmetic have given rise to a complex number system variant which better than halves RNS multi-plication complexity. This advantage is applied to the problem of implementing a high-speed radix-4 RNS FFT. It is shown that a significant improvement in both complexity and speed can be achieved.",

keywords = "complexity theory, fast Fourier transform, nonquadratic roots, quadratic roots, residue arithmetic",

author = "Taylor, {F. J.} and G. Papadourakis and A. Skavantzos and A. Stouraitis",

year = "1985",

month = jun,

doi = "10.1109/TC.1985.5009414",

language = "British English",

volume = "C-34",

pages = "573--576",

journal = "IEEE Transactions on Computers",

issn = "0018-9340",

publisher = "IEEE Computer Society",

number = "6",

}

TY - JOUR

T1 - A Radix-4 FFT using Complex RNS Arithmetic

AU - Taylor, F. J.

AU - Papadourakis, G.

AU - Skavantzos, A.

AU - Stouraitis, A.

PY - 1985/6

Y1 - 1985/6

N2 - Recent advancements in residue arithmetic have given rise to a complex number system variant which better than halves RNS multi-plication complexity. This advantage is applied to the problem of implementing a high-speed radix-4 RNS FFT. It is shown that a significant improvement in both complexity and speed can be achieved.

AB - Recent advancements in residue arithmetic have given rise to a complex number system variant which better than halves RNS multi-plication complexity. This advantage is applied to the problem of implementing a high-speed radix-4 RNS FFT. It is shown that a significant improvement in both complexity and speed can be achieved.

KW - complexity theory

KW - fast Fourier transform

KW - nonquadratic roots

KW - quadratic roots

KW - residue arithmetic

UR - http://www.scopus.com/inward/record.url?scp=0022080113&partnerID=8YFLogxK

U2 - 10.1109/TC.1985.5009414

DO - 10.1109/TC.1985.5009414

M3 - Article

AN - SCOPUS:0022080113

SN - 0018-9340

VL - C-34

SP - 573

EP - 576

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

IS - 6

ER -

A Radix-4 FFT using Complex RNS Arithmetic

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this