Multi-dimensional fast fourier transform

Details Multi-dimensional fast fourier transform Multi-dimensional fast fourier transform

2005-08-11

2010-02-02

Malzahn, David H (Department: 2193)

Electrical computers: arithmetic processing and calculating

Electrical digital calculating computer

Particular function performed

Reexamination Certificate

active

07657587

ABSTRACT:
A multi-dimensional FFT is calculated upon 2nrows of 2mdata values set out end-to-end in memory by traversing the data set as a whole using stride values and block sizes which halve upon each pass through the data. As the data values represent multi-dimensional data, there are one or more dimensional boundaries within the data and as these are crossed the coefficient values being applied by the complex butterfly calculation are adjusted to take account of the manipulation being performed. The linearity of the matrix calculations underlying the butterfly calculation means that the order in which these calculations are performed is not significant and accordingly multiple passes with appropriate coefficient changes can perform a multi-dimensional calculation even if the different components of the calculation in respect of each dimension arise upon different passes through the data set.

REFERENCES:
patent: 4450525 (1984-05-01), Demuth et al.
patent: 5093801 (1992-03-01), White et al.
patent: 6157938 (2000-12-01), Wu et al.
patent: 6675185 (2004-01-01), Mitchell et al.
patent: 2002/0065862 (2002-05-01), Nakanishi
patent: 2004/0078405 (2004-04-01), Bhanot et al.
patent: 1 271 338 (2003-01-01), None
patent: 6-110917 (1994-04-01), None
UK Search Report for GB 0509217.6 dated Jun. 30, 2005.

Affiliated with

Also associated with

Rating

Multi-dimensional fast fourier transform does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Multi-dimensional fast fourier transform, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-dimensional fast fourier transform will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4209500