Method and apparatus for efficient computation of discrete fouri

Details Method and apparatus for efficient computation of discrete fouri Method and apparatus for efficient computation of discrete fouri

1997-07-02

1999-11-16

Kizou, Hassan

Multiplex communications

Generalized orthogonal or special mathematical techniques

Fourier transform

370203, 370208, 342 7621, 382280, G03H 112

Patent

active

059870052

ABSTRACT:
The present invention significantly reduces the number of complex computations that must be performed in computing the discrete Fourier transform (DFT) and inverse DFT (IDFT) operations. In particular, the DFT and IDFT operations are computed using the same computing device. The computation operations are substantially identical for both operations with the exception that for the IDFT operation, the data are complex conjugated before and after processing. Using the same computing device/operations, both DFT and IDFT computations are optimized for maximum efficiency. A common transform process is selectively connected to first and second data processing paths. A DFT operation is performed on an N-point sequence on the first data processing path, and an IDFT operation is performed on an N-point sequence on the second data processing path using the same N-point fast Fourier transform (FFT).

REFERENCES:
patent: 3803391 (1974-04-01), Vernet
patent: 4051357 (1977-09-01), Bonnerot
patent: 4164021 (1979-08-01), Nishitani et al.
patent: 4435774 (1984-03-01), Classan et al.
patent: 5673290 (1997-09-01), Cioffi
IEEE Transactions on Signal Processing, vol. 43, No. 9, Sep. 1995, p. 2193/2194, K.M. Lam et al., "Computing the Inverse DFT with the In-Place, In-Order Prime Factor FFT Algorithm".
IEEE Transactions on Signal Processing, vol. 41, No. 3, Mar. 1993, pp. 1184-1200, Sorensen et al., "Efficient Computation of the DFT with Only a Subset of Input or Output Points".
IEEE 1992, pp. V-13-V16, Chao Lu, "New Algorithms for the FFT Computation of Symmetric and Translational Complex Conjugate Sequences".
"Digital Communications," J. Proakis, pp. 680, 686-693, Chapter 12, "Multichannel and Multicarrier Systems," McGraw-Hill Series in Electical and Computer Engineering, McGraw-Hill, Inc, 1995, ISBN 0-07-051726-6.
"Digital Signal Processing Algorithms and Applications," J.D. Proakis and D.G. Manolakis, 2.sup.nd Ed., Macmillan, 1992, pp. 733-734.
Sharp Application Notes, Digial Signal Processing, LH9124, pp. 1A-3-1A-21, 1993.
Communications of the ACM, vol. 11, No. 10, Oct. 1968, pp. 703-710, J.F. Traub, "Numerical Analysis".
IEEE Transactions On Acoustics, Speech, and Signal Processing, vol. ASSP-30, No. 4, Aug. 1982, pp. 595-607, Robert D. Preuss, "Very Fast Computation of the Radix-2 Discrete Fourier Transform".
G.V. Zaitsev and N.E. Nagulin, "Class of Fast Fourier Transform Algorithms for a Real Sequence," 1983 Plenum Publishing Corporation, pp. 40-49.
IEEE Journal Of Solid-State Circuits, vol. 30, No. 3, Mar. 1995, pp. 300-305, E. Bidet et al., "A Fast Single-Chip Implementation of 8192 Complex Point FFT".
Motorola, Inc., Digital Signal Processor Division, Austin Texas, Wei Chen & Scott King, "Implementation of Real-Valued Input FFT on Motorola DSPs," pp. 806-811.
IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. ASSP-35, No. 6, Jun. 1987, pp. 849-863, Henrik V. Sorensen et al., "Real-Valued Fast Fourier Transform Algorithms".

Affiliated with

Also associated with

Rating

Method and apparatus for efficient computation of discrete fouri does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for efficient computation of discrete fouri, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for efficient computation of discrete fouri will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1333125