Method for improving computation precision in fast Fourier transform

Abstract

A method for improving precision in FFT calculations. For each iteration in an FFT implementation, a constant normalization multiplier is inserted such that the dynamic ranges of the input and output are the same. The final FFT output is multiplied by a constant normalization factor given by the number of iterations and the constant normalization multiplier.

Description

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The invention will be more fully understood by reference to the following detailed description of the invention in conjunction with FIG. 1, which illustrates a method for improving computation precision in fast Fourier transformations, according to the presently disclosed invention.

DETAILED DESCRIPTION OF THE INVENTION

In N-bit fixed-point computing, every integer value is in the range of [−2^N−1, 2^N−1]. If a value exceeds 2^N−1−1, an overflow occurs; if a value is below −2^N−1, an underflow occurs. Both overflow and underflow could be handled by requiring that the input data be sufficiently small so that the possibility of overflow/underflow is avoided. However, if the input data is small, computation precision can be sacrificed. Thus, balancing the tradeoff between overflow/underflow prevention and computation precision is an important goal in fixed-point computing. If not properly addressed, computation precision will be inferior.

As each number is represented by a finite-length sequence of binary digits, rounding (or truncation) brings in a computation error which can often be treated in terms of an additive noise. Such error is referred as a rounding error.

As shown above, the inverse discrete Fourier transform is

$x\left(n\right)=\frac{1}{N}\sum _{k=0}^{N-1}X\left(k\right)W_N^{-\mathrm{kn}},$

where

n=0,1, . . . , N−1.

It is well known to those skilled in signal processing that the discrete Fourier transform and its inverse transform can be efficiently implemented by fast Fourier transform algorithms. The presently disclosed technique is illustrated in the context of an inverse discrete Fourier transform, though the forward discrete Fourier transform is processed in an analogous fashion.

For the inverse discrete Fourier transform, when N=2^l for some integer l, a decimation-in-frequency fast Fourier transform algorithm is commonly employed. The decimation-in-frequency fast Fourier transform algorithm is an iteration of a butterfly operation

$x_{m+1}\left(p\right)=\frac{x_m\left(p\right)+x_m\left(q\right)}{2},x_{m+1}\left(q\right)=\frac{\left(x_m\left(p\right)-x_m\left(q\right)\right)W_N^r}{2}.$

where r is an exponential power, whose value depends on the locations of p and q.

In a fixed-point implementation, the dynamic range of {x_m+1(p),x_m+1(q)} is half of {x_m(p),x_m(q)}, which is undesirable for an implementation of iterative computation, as it would require different scaling factors for {x_m(p),x_m(q)} and for Fourier transform twiddle factors at each iteration. To keep the dynamic range of the input and output unchanged at each iteration, the following butterfly operation is applied instead

x _m+1(p)=x_m(p)+x_m(q),

x _m+1(q)=(x_m(p)−x_m(q))W_N^r.

After the l-th iteration, the output results are scaled down by a factor of N=2^l, which normalizes the inverse Fourier transform coefficients back to their original ranges, with the precision of value of inverse Fourier transform coefficients improved.

The foregoing method for improving the computation precision in fast Fourier transform calculations can be implemented by a wide variety of computing hardware and software, including specially programmed general purpose computing systems, custom-designed computing hardware including application specific integrated circuits (ASICs), etc.

These and other embodiments of the invention illustrated above are intended by way of example and should not be viewed as limiting the scope of the disclosure or of the claims. The actual scope of the invention is to be limited solely by the scope and spirit of the following claims.

Claims

1. A method for improving the precision of fast Fourier transforms, comprising: providing input samples {x0(1), x0(2), x0(3), . . . x0(k*2l)}, where k=0,1,2, . . . N−1;for each iteration of m from 1 to l, performing a modified butterfly operation on the input samples, the modified butterfly operation taking the form xm+1(p)=xm(p)+xm(q),xm+1(q)=(xm(p)−xm(q))WNr.