Applications of DFT/FFT

1. Spectral estimation. P. T. Gough, A fast spectral estimation algorithm based on FFT, I Trans. SP, !ol. "#, pp. 1$1%&1$##, 'une 1((". #. )as*ing threshold for the ps+choacoustic model is deri!ed from an estimate of the po,er densit+ spectrum obtained from a -1#&point FFT. .sed in )P G Audio /oding. /0 111%#&$. See the papers. a. 0. Pan, An o!er!ie, of the )P G1Audio /ompression algorithm, IS2T1SPI S+mp., on lectronic Imaging3 Science and Technolog+, !ol. #14%, pp. #56&#%$, San 'ose, /A, Feb. 1((". b. 7. 8randengurg et al, The IS91)P G audio codec3 A generic standard for coding of high :ualit+ digital audio, (# A S con!ention, preprint $$$5, ;ienna, Austria, 1((#. <,,,.aes.org= $. Interpolation using FFT. S.0. Stearn and >.A. 0a!id, Signal processing algorithms, /hapter 16&0ecimation and Interpolation >outines. ngle,ood /liffs, ?', Prentice&@all, 1(44. /on!olution and correlation using FFT. /hapter (&FFT con!olution and correlation. ". Filtering APF, 8PF, @PF. GeneraliBed cepstrum and homomorphic filtering. A.7. 'ain, Fundamentals of digital image processing, ngle,ood /liffs, ?', Prentice& @all, 1(4(. </hapters - and %= -. )ultichannel carrier modulation <)/)= such as orthogonal fre:uenc+ di!ision multipleCing <9F0)= for digital tele!ision terrestrial broadcasting, I /ommun. )agaBine, !ol. $#, pp. "5&-#, )a+ 1((". 5. Se!eral applications in spectral anal+sis, filtering, con!olution, correlation etc. >efer to follo,ing boo*s among others. a= S.0. Stearns and >.A. 0a!id, Signal Processing Algorithms, ngle,ood /liffs, ?', Prentice @all 1(($. b= S.0. Stearns and >.A. 0a!id, Signal Processing Algorithms in Fortran and /, ngle,ood /liffs, ?', Prentice @all 1(($. %. Pulse compression <>adar s+stems&sur!eillance, trac*ing, target classification=& )atched filter ,ith a long impulse response&con!olution !ia FFT. >. /oC FFT& based filter design boosts radar s+stemDs process, lectronic 0esign, pp. 41&4", )arch $1, 1(44. 4. Spectrum anal+sis. G. 0o!el, FFT anal+Bers ma*e spectrum anal+sis a snap, 0?, pp. 1"(&1--, 'an. 1(4(. (. Interpolation. 1. >.E. Schafer and A.>. >abiner, A digital signal processing approach to Interpolation, Proc. I , !ol. 51, pp. 5(#&%6#, 'une 1(%$.

#. ). Feh, '.A. )elsa, and 0.A. /ohn, A direct FFT scheme for interpolation decimation, and amplitude modulation, in Proc. 15th Asilomar /onf. /ircuits, S+st., /omput., pp. "$%&""1, ?o!. 1(4#. $. 7.P. Prasad and P. Sath+anara+ana, Fast interpolation algorithm using FFT, lectron. Aett., !ol. ##, pp. 14-&14%, 'an. 1(45. ". '.E. Adams, A subse:uence approach to interpolation using the FFT, I Trans. /AS, !ol. $%, pp. 5#$&5#-, )a+ 1(4%. -. P. Sath+anara+ana, P.S. >edd+, and ).?.S. S,am+, Interpolation of #&0 Signals, I Trans. /AS, !ol. $%, pp. 5#$&5#-, )a+ 1((6. 5. T. Smith, ).>. Smith, and S.T. ?ichols, fficient sinc function interpolation techni:ues for center padded data, I Trans. ASSP, !ol. $4, pp.1-1#&1-1%, Sept. 1((6. %. 0. Fraser, Interpolation b+ the FFT re!isited&An eCperimental in!estigation, I Trans. ASSP, !ol. $%, pp.55-&5%-, )a+, 1(4(. 4. S./. /han, 7.A. @o and /.E. 7o*, Interpolation of #&0 signal b+ subse:uence FFT, I Trans. /AS&II3 Analog and digital signal processing, !ol. "6, pp. 11-& 114, Feb. 1(($. 16. Ghost cancellation. ).0. 7ouam and '. Palicot, Fre:uenc+ domain ghost cancellation using small FFTs, I// , pp. 1$4&1$(, /hicago, IA, 'une 1(($. 11. 0.T.). Sloc* and 7. )aouche, The fast subsampled updating recursi!e least s:uares <FS.>AS= algorithm for adapti!e filtering based on displacement structure and the FFT, SP, !ol. "6, pp. -&#6, 9ct. 1((". 1#. 8. Farhang&8orouGen+ and S. GaBor, GeneraliBed sliding FFT and its applications to implementation of bloc* A)S adapti!e filters, I Trans. SP, !ol. "#, pp.-$#&-$4, )arch 1((". 1$. ). Aodman et al, A single chip stereo A/&$ audio decoder, I// , pp. #$"&#$-, /hicago, IA, 'une 1((". <FFT is used in time domain aliasing cancellation&T0A/= 1". ). Perr+, .sing #&0 FFTs for obGect recognition, I/SPAT, pp. 16"$&16"4, 0SP Eorld Cpo., 0allas, TH, 9ct. 1((". 1-. '. d,ards, Automatic bubble siBe detection using the Boom FFT, I/SPAT, pp. 1-11& 1-15, 0SP Eorld Cpo., 0allas, TH, 9ct. 1((". 15. >.>. @oldrich, Fre:uenc+ anal+sis of non&stationar+ signals using time fre:uenc+

mapping of the 0FT magnitudes, I/SPAT, 0SP Eorld Cpo, 0allas, TH, 9ct. 1((". <,,,.icspat.com= 1%. 8.A. Schnaufer and E.7. 'en*ins, A fault tolerant FI> adapti!e filter based on the FFT, I/ASSP&(", ;ol. $, pp. $($&$(5, Adelaide, Australia, April 1((". 14. S... Iaman and E. Fates, .se of the 0FT for s+chroniBation in pac*etiBed data communications, I/ASSP&(", ;ol. $, pp. #51&#5", Adelaide, Australia, April 1((". 1(. S. Sridharan, . 0a,son and 8. Goldburg, Fast Fourier transform based speech encr+ption s+stem, I Proc., Part I /ommunication, Speech and ;ision, ;ol. 1$4, pp. #1-&##$, Aug. 1(($. #6. 8. Goldburg, S. Sridharan and , 0a,son, /r+ptanal+sis of fre:uenc+ domain analog speech scramblers, I Proc., Part I /ommunication, Speech and ;ision, ;ol. 1"6, pp. #$-&#$(, Aug. 1(($. #1. S. Sridharan, . 0a,son and 8. Goldgurg, Speech encr+ption using discrete orthogonal transforms, I/ASSP&(6, pp. 15"%&15-6, Albu:uer:ue. ?), April 1((6. ##. Se!eral applications of FFT in digital signal processing are illustrated in soft,are1 hard,are, boo*s on using the soft,are <)athcad, )ATAA8 etc.= #$. ;. )urino and A. Trucco, .nder,ater $0 imaging b+ FFT d+namic focusing beamforming, I/IP&(", pp. 4(6&4(", Austin, TH, ?o!. 1((". #". F.P. Ain and P.P ;aid+anathan, Application of 0FT filter ban*s and cosine modulated filter ban*s in filtering, I AP//AS, pp. #-"&#-(, Taipei, Tai,an, 0ec. 1((". #-. ).F. /atedra et al, The /G&FFT )ethod3 Application of signal processing techni:ues to electromagnetics, </G J /onGugate Gradient=, ?or,ood, )A3 Artech @ouse, 1((". #5. FFT&based > AP !ocoder, cited in A.S. Spanias, Speech coding3 A tutorial re!ie,, Proc. I , ;ol. 4#, pp. 1-"#&1-4#, 9ct. 1((". #%. 0. Petrino!ic and @. 8abic, Eindo, spectrum fitting for high accurac+ harmonic anal+sis, //T0D(-, Istanbul, Tur*e+, Aug. 1((-. #4. ;.7. 'ain, E.A. /ollins and 0./. 0a!is, @igh accurac+ analog measurements !ia interpolated FFT, I Trans. IA), ;ol. I)&#4, pp. 11$&1##, 'une 1(%(. #(. T. Grand*e, Interpolation algorithms for discrete Fourier transforms of ,eighted signals, I Trans. IA), ;ol. $#, pp. $-6&$--, 'une 1(4$.

$6. G. Sperr+, Forensic applications utiliBing FFT filters, IS2TDs "4th Annual /onf., pp. , Eashington, 0./., )a+ 1((-. $1. E. Smith and '. Smith, The handboo* of real&time Fourier transforms, I 1((-. Press,

$#. @. 9chi and ?. 8ershad, A ne, fre:uenc+&domain A)S adapti!e filter ,ith reduced siBed FFTs, I IS/AS, pp. , Seattle, EA, April1)a+ 1(($$. P. stermann and A. 7aelin, 9n the comparison of optimum least&s:uares and computationall+ efficient 0FT&based adapti!e bloc* filters, IS/AS, pp. , Seattle, EA, April1)a+ 1((-. $". 0etection of a fe, sinusoids in noise. 0ual Tone )ulti&Fre:uenc+ signalling <0T)F=. .se pruned FFT. $-. A. ?iederlins*i and '. Fig,er, .sing the 0FT to s+nthesiBe bi!ariate orthogonal ,hite noise series, I Trans. SP, ;ol. "$, pp. %"(&%-4, )arch 1((-. $5. <4C4= #0 FFT spatiall+ on !ideo frame1field follo,ed b+ temporal 0P/) for a 0S&$ ?TS/ T; codec built b+ Grass ;alle+, P. 9. 8oC 111", Grass ;alle+, /A (-("-. $%. 0.I. Aaurenson and G.'.>. Po!e+, The application of a generaliBed sliding FFT algorithm to prediction for a >A7 recei!er s+stem operating o!er the mobile channels, I//&(-, pp. , Seattle, EA, 'une 1((-. $4. >.?. )c0onough and A.0. Ehalen, 0etection of signals in noise, 9rlando, Fl3 Academic Press, 1((-. <0etection processing based on the FFT= $(. 0olb+ A/&# and A/&$ audio coders. Time 0omain Aliasing /ancellation <T0A/= transform in!ol!es )0/T <modified 0/T= and )0ST <modified 0ST=. 8oth )0/T and )0ST and their in!erses can be implemented !ia FFT. Se!eral papers from 0olb+ Aabs. A.G. lder and S.G. Turner, A real&time P/ based implementation of A/&# digital audio compression, (-th A S con!ention, paper K$%%$, ?e, For*, ?F, 9ct. 1((-. G. 0a!ison, A. Fielder and ). Antill, Ao,&compleCit+ transform coder for satellite lin* applications, 4(th A S con!ention, Aos Angeles, /A, Sept, 1((6. <,,,.aes.org= 0olb+ A/&$ multi&channel digital audio compression s+stem, Algorithm 0escription, >e!ision 1.1#, 0olb+ Aabs. ##, Feb. 1((". "6. '.E. Eoods and S.0. 9D?eil, Subband coding of images, I ASSP&$", pp. 1#%4&1#44, 9ct. 1(45. <Implementation of the FI> filters ,ith the L)F ban*s b+ FFT= Trans. ASSP, !ol.

"1. T. L. ?gu+en, Partial reconstruction filter ban*s&theor+, design and implementation, Technical >eport ((1, Aincoln Aab, )IT, AeCington, )A, ## 'une,

"

1((-. <0FT filter ban*s= "#. S. @olm, FFT pruning applied to time domain interpolation and pea* localiBation, I Trans. ASSP, !ol. ASSP&$-, pp. 1%%5&1%%4, 0ec. 1(4%. "$. G. 8runn, I&Transform 0FT filters and FFTs, I pp. -5&5$. Feb. 1(%4. Trans. ASSP, !ol. ASSP&#5,

"". F.'. @arris, 9n the use of ,indo,s for harmonic anal+sis ,ith the discrete Fourier transform, Proc. I , !ol. 55, pp. -1&4$, 'an. 1(%4. "-. @. )ura*ami, Sampling rate con!ersion s+stems using a ne, generaliBed form of the discrete Fourier transform, I Trans. SP, !ol. "$, pp. #6(-&#16#, Sept. 1((-. "5. >. Gluth, >egular FFT&related transform *ernels for 0/T10ST based pol+phase filter ban*s, I/ASSP&(1, pp. ##6-&##64, Toronto, /anada, )a+ 1((1. "%. >.). Gra+ and '.E. Goodman, Fourier transforms3 An introduction for engineers, ?or,ell, )A3 7lu,er Academic Publishers, 1((-. "4. ?. 8ean and ). Ste,art, A note on the use of fast Fourier transforms in 8uBenDs algorithm, Australian Telecom., ?et,or* 2 Applns., S+dne+, Australia, 0ec. 1((-. "(. P./. Sapino and '.0. )artin, )aCimum li*elihood PS7 classification using the 0FT of phase histogram, I 1((- GA98 /9), Singapore, ?o!. 1((-. -6. A.G. Cposito, '.A.>. )acias and '.A.>. )acias 0iscrete Fourier transform computation for digital rela+ing, lectric Po,er and nerg+ S+stems, !ol. 15, pp. ##(&#$$, 1((". -1. '. Smith and E. Smith, @andboo* of real&time fast Fourier transforms, I boo*, 0ial&A&8oo*Ds Eeb address, http311dab.psi.net10ial A 8oo*1indeC.html Press

-#. A.0. Poulari*as, < d.= The transforms and applications handboo*, 8oca >aton, FA3 />/ Press, 1((5. -$. A. Eannasarnmatha, S @ara and ?. )orinaga, A no!el FS7 demodulation method using short time 0FT anal+sis for A 9 satellite communication s+stems, I 1((GA98 /9), pp. -"(&--$, Singapore, ?o!. 1((-. -". 8.G. @as*ell, Frame&to&frame coding of tele!ision pictures using t,o&dimensional Fourier transforms, I Trans. IT, !ol. IT&#6, pp. 11(&1#6, 'an. 1(%". --. /.0. 7uglin and 0./. @ines, The phase correlation image alignment method, In Proc. I Int. /onf. /+bern. Soc., San Francisco, /A, pp. 15$&15-, Sept. 1(%-. -5. ). Iiegler, @ierarchical motion estimation using the phase correlation method in

1"6 )bit1s @0T; coding, In Signal Processing of @0T;, ed. A. /hiariglione. Amsterdam, The ?etherland3 lse!ier, pp. 1$1&1$%, 1((6. -%. @.). @ang, F.&). /hou, and T.&@.S. /hao, )otion estimation using fre:uenc+ components, In Proc. SPI ;/IP, 8oston, )A, !ol.1414, pp. %"&4-, ?o!. 1((#. -4. 7.9. giaBarian et al, ?onlinear filters based on ordering b+ FFT structure, Photonics Eest, IS2T1SPI S+mp. on lectronic Imaging3 Science 2 Technolog+, ;ol. #55#, pp. , San 'ose, /A, Feb. 1((5. -(. ?. 7uro+anagi, A. Guo and ?. Suehiro, Proposal of a no!el signal separation principle based on 0FT ,ith eCtended frame buffer anal+sis, I GA98 /9), pp. , Singapore, ?o!.1((-. 56. >.). Piedra, fficient FFT implementation on reduced&memor+ 0SPs, I/SPAT, 8oston, )A, 9ct. 1((-. 51. 7. @ue, A #-5 fast Fourier transform processor, I/SPAT, 8oston, )A, 9ct. 1((-. <,,,.icspat.com= 5#. S. ?a*amura and A. Sasou, A pitch eCtraction algorithm using combined ,a!elet and Fourier transforms, I/SPAT, 8oston, )A, 9ct. 1((-. 5$. '.' Sh+n*, Fre:uenc+ domain and multirate adapti!e filtering, I !ol.(, pp. 1"&$%, 'an. 1((#. SP )agaBine,

5". A.7. 'ain and '&'asiule*, A class of FFT based algorithms for linear estimation and boundar+ !alue problems, I Trans. ASSP, !ol. ASSP&$1, pp.1"$-&1""5, 0ec. 1(4$. 5-. Pacific /+ber 1 )etriC, Inc., 55($ Sierra Aane, 0ublin, /A ("-54, Ph3 -16&4#(&4%66, FaC3 -16&4#(&(%(5 <;SP&(1 ;ector processor, I7 compleC FFT in 4 sec, 5"7 compleC FFT in 4.# msec=. 55. ;iper&-, FFT <I) /FFT in #1 msec=,TeCas )emor+ S+stems, Inc. 11#66 Eestheimer , K1666, @ouston, TH %%6"#, Ph3%1$&#55&$#66, FaC3 %1$&#55&6$$#, Eebsite3 http311,,,.teCmems+s.com 5%. 7./. Ao and A. Pur!is, >econstructing randoml+ sampled signals b+ the FFT, IS/AS&(5, !ol. #, pp.1#"&1#%, Atlanta, GA, )a+ 1((5. 54. './. SchatBman, IndeC mappings for the fast Fourier transform, I "", pp.%1%&%1(, )arch 1((5. Trans. SP, !ol.

5(. 0. SundararaGan and ).9. Ahmad, ;ector split&radiC algorithm for 0FT computation, IS/AS&(5, !ol.#, pp. -$#&-$-, Atlanta, GA, )a+ 1((5.

%6. 8.S. >edd+ and 8.?. /hatterGi, An FFT based techni:ue for translation, rotation and scale&in!ariant image registration, I Trans. IP, !ol. -, pp. 1#55&1#%1, Aug.1((5. %1. ). Eebster and >. >oberts, Adapti!e channel truncation for FFT detection in 0)T s+stems&error component partitioning, $6th Asilomar /onf. on Signals, S+stems and /omputers, Pacific Gro!e, /A, ?o!. 1((5. %#. F. 0eBhong, Fast interpolation of n&dimensional signal b+ subse:uence FFT, I Trans. /AS II, Analog and digital signal processing, !ol."$, pp. 5%-&5%5, Sept. 1((5. %$. @. )ura*ami, Perfect reconstruction condition on the 0FT domain for the bloc* maCimall+ decimated filter ban*, I I//S1ISPA/S (5, pp. 5.$.1&5.$.$, Singapore, ?o!. 1((5. %". 7./. Teh, 7.@. Ai and /. 7ot, >eGection of partial baud interference in FFT spread spectrum s+stems using FFT based self normaliBing recei!ers, I I//S1ISPA/S (5, pp. 1.".1&1.".", Singapore, ?o!. 1((5. %-. 7.9. glaBarian et al, Adapti!e A)S FFT&ordered A&filters, IS 2 T1SPI Ds (th Annual S+mp., lectronic Imaging, !ol. $6#5, San 'ose, /A, Feb. 1((%. %5. A. /elentano and F. 0i Aecce, FFT&based techni:ue for image signature generation, IS 2 T1SPI Ds (th Annual S+mp., lectronic Imaging, !ol. $6##, San 'ose, /A, Feb. 1((%. %%. S. Famasa*i, A reconstruction method of damaged t,o&dimensional signal bloc*s using error correction coding based on 0FT, I AP//AS, pp. #1-&#1(, Seoul, 7orea, ?o!. 1((5. %4. G.). 0illard, >ecursi!e computation of the discrete Fourier transform ,ith applications to an FS7 communication recei!er, I ?T/ >ecord, pp.#5$&#5-, 1(%". %(. G.). 0illard, >ecursi!e computation of the discrete Fourier transform ,ith applications to a pulse radar s+stem, /omput. and lec. ngrg., !ol.1, pp. 1"$&1-#, 1(%$. 46. P. . Pang and 0. @atBina*os, An efficient implementation of affine transformation using one&dimensional FFTs, I/ASSP&(%, !ol.", pp. #44-&#444, )unich, German+, April 1((%. 41. F. /la!ean, ). Poirier and 0. Gingras, FFT&based cross&co!ariance processing of optical signals for speed and length measurement, I/ASSP&(%, !ol. -, pp."6(%&"166, )unich, German+, April 1((%.

4#. A. 8uttar el al, FFT and 9F0) recei!er I/s for 0;8&T decoders, I /hicago, IA, 'une 1((%.

I//

4$. F. 'hung and S. Par*, Architecture of dual mode audio filter for A/&$ and )P G, <>econstruction filter based on FFT structure=, I I// , /hicago, IA, 'une 1((%. 4". G. Ihou and H&G. Hia, )ultiple fre:uenc+ detection in under sampled compleCed& !alued ,a!eforms ,ith close multiple fre:uencies, lectron. Aett., <Accepted= <multiple fre:uenc+ detection b+ multiple 0FTs=. 4-. 7. 8randenburg et al, Transform coding of high :ualit+ digital audio at lo, bit rates&algorithms and implementations, I I// 1((6, pp.$$#.#.1 thru&$$#.#.-, 1((6.
45.

G. 0a!idson, A. Fielder and ). Antill, Ao,&compleCit+ transform coder for satellite lin* applications, 4(th A S /on!ention, Preprint #(55, Aos Angeles, /A, Sept. 1((6. <,,,.aes.org= 0igital audio compression <A/&$= ATS/ standard, #6 0ec. 1((-.<,,,.atsc.org=

4%.

44. A.0. Fielder and G.A. 0a!idson, A/&#3 A famil+ of lo, compleCit+ transform&based music coders, A S 16th Int. /onf., Aondon, ngland, Sept. 1((1. 4(. 0olb+ A/&$, )ulti&channel digital audio compression s+stem algorithm description, 0olb+ Aabs. Inc., >e!ision 1.1#, ## Feb. 1((". (6. /./. Todd et al, A/&$3 FleCible perceptual coding for audio transmission and storage, (5th con!ention of A S, Preprint $%(5, Amsterdam, Feb.1)arch 1((". <,,,.aes.org= (1. F. 7im, ). Shin and @. /ho, The performance anal+sis and the simulation of )/& /0)A s+stem using IFFT1FFT, I/SPAT (%, San 0iego, /A, Sept. 1((%. (#. /. Pateros, /oarse fre:uenc+ ac:uisition using multiple FFT ,indo,s, I/SPAT (%, San 0iego, /A, Sept. 1((%. ($. ). Ihao, /hannel separation and combination using fast Fourier transform, I/SPAT (%, San 0iego, /A, Sept. 1((%. (". 0. >idge, F. @u and T.'. 0ing, PA0 based FFTs, I/SPAT (%, San 0iego, /A, Sept. 1((%. (-. P+schoacoustic model for ?8/ <nonbac*,ard compatible=&AA/ <Ad!anced audio coder= audio coder, IS for )P G&#, Also adopted b+ )P G&" in T1F coder, IS1$414&%, April 1((%.

(5. FFT in M/ APD coder )P G&", IS91I / 1""(5&$, 1((%. (%. A harmonic method for acti!e po,er filters using recursi!e 0FT, 8ang*o*, Thailand, ?o!. 1((%. /9? #6,

(4. 8. Eidro, et al, Fundamental relations bet,een the A)S algorithm and the 0FT, I Trans. /AS, !ol. /AS&$", pp. 41"&4#6, 'ul+ 1(4%. ((. A. /. 7ot, S. Ai and 7./.Teh, FFT&based clipper recei!er for fast fre:uenc+ hopping spread spectrum s+stem, I IS/ASD(4, )ontere+, /A, 'une 1((4. 166. 161. 16#. 16$. 16". 16-. 165. 16%. 164. S.7. Ste!ens and 8. Suter, Ao, po,er, high performance FFT design, I IS/ASD(4, )ontere+, /A, 'une 1((4. A. Salsano et al, 15&point high speed <I= FFT for 9F0) modulation, I IS/ASD(4, )ontere+, /A, 'une 1((4. A. . /etin, 9.?. Gere*, and F.Fardimci, :uiripple FI> filter design b+ the FFT algorithm, I SP )agaBine, !ol.1", pp.56&5", )arch 1((%. P. 7raniaus*ar, A plain manDs guide to the FFT, I #"&$-, April 1((". SP )agaBine, !ol.11, pp.

F. T. @an, 0.7. 7ang and '.S. 7oh, An ASI/ design of the )P G&# audio encoder, I/SPATD(%, San 0iego, /A, Sept. 1((%. <,,,.icspat.com=. @. )ura*ami, 7. ?a*amura and F. Ta*uno, @igh&harmonics anal+sis b+ recursi!e 0FT algorithm, I/SPAT (4, Toronto, /anada, Sept. 1((4. @.7. Garg, 0igital signal processing algorithms3 number theor+, fast Fourier transforms and con!olutions, 8oca >aton, FA3 />/ Press, 1((4. S. >ichardson, 0FT strategies for miCed signal and analog designsNfrom la+out& s+stem, I I/ /S (4, Aisbon, Portugal, Sept. 1((4. A. /elantano and ;.0. Aecce, OA FFT based techni:ue for image signature generation,O Proc. of SPI 3 storage and retrie!al for image and !ideo databases ;, !ol. $6##, pp. "-%&"55, Feb. 1((%. ). )orhac and ;. )atouse*, OFast adapti!e Fourier&based transform and its use in multidimensional data compression,O Signal Processing, !ol. 54, pp. 1"1&1-$, 'ul+ 1((4. S. '. Sang,ine, OThe problem of defining the Fourier transform of a colour image,O I I/IP, pp. , /hicago, IA, 9ct. 1((4.

16(.

116.

111.

/. Tellambura, A reduced&compleCit+ coding techni:ue for limiting pea*& to& a!erage po,er ratio in 9F0), I ISPA/SD(4,pp.""%&"-6, )elbourne, Australia, ?o!. 1((4. A. Ia*nich, and F. Atti*iouBel,DA comparison of template matching ,ith neural net,or*&approaches in the recognition of numeric characters hand&stamped in aluminum, I ISPA/SD(4, pp. (4&16#, )elbourne, Australia, ?o!. 1((4. @. /hoi, @. 7im, and T. 7im,>obust ,atermar*s for images in subband domain,I ISPA/SD(4,pp. 154&1%#,)elbourne, Australia, ?o!. 1((4.

11#.

11$.

11". T.). Peters and './. Eilliams, The Fourier transform in biomedical engineering, 8oston, )A 38ir*hauser, 1((4. 11-. F.P. Ain and S.). Phoong, As+mptotical optimalit+ of 0FT based 0)T transcei!ers, IS/AS , pp. , 9rlando, FA, )a+&'une 1(((. 115. ). 'oho, @. )athis and G.S. )osch+tB, An FFT&based algorithm for multichannel blind decon!olution, IS/AS , pp. , 9rlando, FA, )a+&'une 1(((. 11%. F. 0eguillaume et al, >obust $0 0FT !ideo ,atermar*ing, SPI Photonics Eest, !ol. $5-%, pp.11$&1#", San 'ose, /A, 'an. 1(((. 114. '. )arciano and T. 8. ;u, Implementation of a broadband fre:uenc+&in!ariant <FI= arra+ beamformer using the t,o&dimensional discrete Fourier transform. <#0&0FT=, I ISPA/S ((. 11(. E. Philips, 9n computing the FFT of digital images in :radtree format, I IP, !ol. "%, pp. #6-(&#656, 'ul+ 1(((. 1#". 1#-. 1#5. Trans.

>. E. /oC and >. Tong, T,o&and three&dimensional image rotation using the FFT, I Trans. IP, !ol. 4, pp. 1#(%&1#((, Sept. 1(((. @. )ura*ami, GeneraliBed 0IT and 0IF algorithms for signals of composite length, I ISPA/S ((, Pu*het, Thailand, 0ec. 1(((. Altera Application ?ote 4", Implementing FFT ,ith on&chip >A) in FA H 167 de!ices, Feb. 1((4 /. 'ing and @.&). Tai, Implementation of modulated lapped transform using programmable logic, I// ((, pp.#6&#1, Aos Angeles, /A, 'une 1(((. H. 7ang et al, A DWT-DFT composite watermarking scheme robust to
both affine transform and JPEG compression, pp" **+-*,+, Aug" -..)"

1#%.
1#4.

!EEE Trans" #$%T, &o'"(),

16

FFT Software/Hardware
1. FFT tools Soft,are Pac*age. Adds FFT capabilit+ to Aotus 1&#&$ 2 enhances FFT capabilit+ of )icrosoft Ccel. 16#"& point FFT under a second on a "450H1$$ P/. .p to 41(#&point FFT ,ith choice of ,indo,s, 8lac*man, @amming, @anning, ParBen, tapered rectangular 2 triangular taper. 0@ S+stems Inc., 1("6 /otner A!e., Aos Angeles, /A (66#-. Phone3 466&%"%&"%--, FaC3 $16&"%4&"%%6. #. A0SP&#1656 8enchmar*s <P "6)@B= 16#"&point compleC FFT <>adiC " ,ith digit re!erse= 6."5ms <14##1 c+cles=. Analog 0e!ices, Inc., 1 Technolog+ Ea+, P.9. 8oC (165, ?or,ood, )A 6#65#, Phone3 51%&"51&$%%1, FaC3 51%&"51&"""%. $. I>$"151 15 bit ;SP. @igh performance programmable 15&bit 0SP. 1&0 and #&0 FFTs, se!eral 0SP operations, 16#" point radiC&# compleC FFT in #1%4 sec. IP$"$#- $# bit ;SP. 1&0 and #&0 FFTs, se!eral 0SP operations I>$4666 and I>$4661 can eCecute 16#" point radiC&# compleC FFT in 6.44msec. Ioran /orporation, 1%6- E+att 0ri!e, Santa /lara, /A (-6-". Phone3 "64&(45&1$1", FaC3 "64&(45&1#"6. ". FT #66 series )ultiprocessors 1 7 compleC FFT Q --6 sec, 17 C 17 >eal to compleC FFT %4# msec. Alacron, %1 Spitbroo* >oad, Suite #6", ?ashua, ?@ 6$656 Phone3 56$&4(1&#%-6, FaC3 56$&4(1&#%"-. -. . 8idet, /. 'oanblan: and P. Senn, </? T, Grenoble, France=, A fast single chip implementation of 41(# compleC points FFT, /I//(", pp. , San 0iego, /A, )a+ 1((".

5. Image processing toolboC <#&0 transforms= )ATAA8, )ath,or*s, #" Prime

11

Par* Ea+, ?atic*, )A 61%56, &mail 3 infoPmath,or*s.com, FAH3 -64&5-$&5#4". Signal processing toolboC <FFT, 0/T, @ilbert, Filter design= <,,,.math,or*s.com= <FTP ser!er ftp.math,or*s.com= %. I)SA 1663 programmable 0SP. Implement FFT, con!olution, correlation etc. SGS&Thomson )icroelectronics, 1666 ast 8ell >oad, PhoeniC, AI 4-6##&#5((. <,,,.st.com= 4. Eindo,s 0AA !ersion of the prime factor FFT sub&routine librar+, Alligator Technologies, 1%1-6 ?e,hope Street K 11", P.9. 8oC (%65, Fountain ;alle+, /A (#%#4&(%65, Phone3 %1"&4-6&((4", FAH3 %1"&4-6&((4%. (. />P1)"6 P/1ISA&bus float point 0SP board can process 0FT, FFTs, 0/Ts, F/Ts, adapti!e filtering etc., 17 compleC FFT in 4# sec at "6)@B. /an upgrade up to 1 )egapoint FFT. /atalina >esearch Inc., (4- Space /enter 0r., Suite 16-, /olorado Springs, /9 46(1-, Phone3 %1(&5$%&6446, FAH3 %1(&5$%&$4$(. 16. .ltra 0SP&1 board, 17 compleC FFT in (6 sec, ;alle+ Technologies Inc. >0 K", >oute $6(, Tama:ua, PA 14#-#, Phone3 %1%&554&$%$%, FAH3 %1%&554&5$56. 11. SIGAA8 Soft,are, FFT, correlation etc., )onarch, 0SP soft,are, The Athena Group, Inc. $"#" ?E $1st Street, Gaines!ille, FA $#56-, Phone 3(6"&$%1&#-5%, FAH3 (6"&$%$&-14#. 1#. Signal RR 0SP Aibrar+ </RR=, Se!eral transforms including /IT, ,a!elet, cosine, sine, @ilbert, FFT and !arious 0SP operations. Sigsoft, 1-4-5 Aoft+ Trail 0ri!e, San 0iego, /A (#1#%, Phone351(&5%$&6%"-. 1$. 0SP ,or*s&real time ,indo,s&based signal processing soft,are. FFT, /on!olution, Filtering etc. <includes multirate digital filters, L)F ban*=. /omplete bundled hard,are and soft,are pac*ages, 0SP operations. )omentum 0ata S+stems, 1-#6 ?utmeg Place K164, /osta )esa, /A (#5#5, Phone3 %1"&--%&544", FaC3 %1"&--%&5(5(. 1". ;ersion 1.1 ProtoSim, P/ based soft,are, FFT, 8ode plots, con!olution, filtering etc. S+stems ngineering Associates Inc., 8oC $"1%, >>K$, )ontpelier, ;T 6-56#, Phone3 46#&##$&51(", FaC3 46#&##$&51(-. 1-. FFT, filtering histogram techni:ues, image manipulation etc. Soft,are in M/D on a dis*ette. @.>. )+ler and A.>. Eee*s, /omputer imaging recipes in /, ngle,ood /liffs, ?'3 Prentice @all, 1(($. 15. /.0. 8urrus et al, /omputer based eCercises for signal processing using )ATAA8, ngle,ood /liffs, ?'3 Prentice @all, 1((". 1%. 9. Al*in, 0SP&A laborator+ approach using P/&0SP, ngle,ood /liffs, ?'3 Prentice @all, 1((".

1#

14. 16#" point compleC FFT in 4# sec. 0SP )AH&P"6 board, 8utterfl+ 0SP, Inc. 151" S. . 1#6th A!e., ;ancou!er, EA (454", Ph3 #65&4(#&--(%, FaC3 #65&#-"&#-#". 1(. 0SP board3 0SP Aab one. ;arious 0SP soft,are. >eal&time signal capture, anal+sis, and generation plus high&le!el graphics. Standing Applications Aab, 1#61 7ir*land A!e., 7ir*land, EA (46$$, Ph3 #65&"-$&%4--, FaC3 #65&"-$&%4%6. #6. Sig HT), A general purpose signal processing pac*age, Technisoft, P.9. 8oC #-#-, Ai!ermore, /A ("--1, ph3 -16&""$&%#1$, FAH3 -16&%"$&11"-. #1. 0SP 0esigner TM , 0esign en!ironment for 0SP, Iola Technologies, Inc. 51(- @eards /ree* 0r., ?.E., Suite #61, Atlanta, GA $6$#4, Ph3 "6"&4"$&#(%$, FaC3 "6"&4"$&6115. ##. S.7. )itra and '.F. 7aiser, @andboo* for digital signal processing, Filter design and implementation, FFT implementation on !arious 0SPs, ?e, For*, ?F3 'ohn Eile+, 1(($. #$. F.'. Ta+lor, Principles of signals and s+stems, <includes a data dis* of )ATAA8 and )9?A>/@ eCample files=, ?e, For*, ?F3 )cGra,&@ill, 1((". #". Standard filter design soft,are, 0GS Associates, Inc. Ph3 "1-&$#-&"$%$, FaC3"1-& $#-&%#%4. #-. 0igital Alpha AHP parallel s+stems and T)S$#6/"6. Parallel 0SP2 Image Processing S+stems. Tra:uair 0ata S+stems, Inc., To,er 8ldg., 11# Prospect St., Ithaca, ?F 1"4-6, Ph3 56%&#%#&""1%, FaC3 56%&#%#&5#11. #5. 0T ; and ;8& I for ,indo,s. Soft,are for )icrosoft ,indo,s. Filters, FFTs etc., 0ata Translation, 166 Aoc*e 0ri!e, )arlboro, )A 61%-#&11(#, Ph3 -64&"41&$%66 or 466&-#-&4-#4. #%. )ahtematica, <includes FFT, 8essel Functions=, Eolfram >esearch, Inc., 466&""1& )AT@, Ph3 #1%&$(4&6%66, FaC3 #1%&$(4&6%"%, &mail3 infoP,ri.com. #4. )athcad -.6, )athsoft Inc., P.9. 8oC 1614, /ambridge, )A 6#1"#&1-1(, Ph3 466&(5%&-6%-, Ph3 #1%&$(4&6%66, FaC3 #1%&$(4&6%"%. #(. A"116# FFT processor, Aa*e 0SP Pt+. Atd. Suite "1155 )aroubra >oad, )aroubra #6$-, Australia, Ph3 51&#&$1"&#16", FaC3 51&#&$1"&#14%. $6. 0SP1;eclib. ;ast librar+ of 0SP functions for TIDs T)S $#6/"6 architecture, Spectroanal+sis, #" )urra+ >oad, Eest ?e,ton, )A 6#15-, Ph3 51%&4("&4#(5, FaC3 51%&4("&4#(%.

1$

$1. )atriC&based interacti!e language3 Signal Processing FFTs, n &matriC, obGecti!e numerical anal+sis, @armonic Soft,are Inc. Ph3#65&$5%&4%"#, FaC3#65&$5%&165%. $#. A. @iregange, >. Subramani+an and ?. Srini!asa, 1&0 FFT and #&0 0/T routines for the )otorola 0SP -5166 famil+, I/SPAT, 0allas, TH, 9ct. 1((". $$. E. /hen and S. 7ing, Implementation of real input !alued FFT on )otorola 0SPs, I/SPAT, 0allas, TH, 9ct. 1((". $". FFT, @ilbert transform, Acolade R. nhanced soft,are for communication s+stem, /A , Amber technologies Inc., "% 'unction S:uare 0r., /oncord, )A 61%"#&(4%(, Ph3 -64&$5(&6-1-, FaC3 -64&$%1&(5"#. $-. /.S. 8urrus, Teaching the FFT using )atlab, I/ASSP&(#, ;ol. ", pp. ($&(5, San Francisco, /A, )arch 1((#. $5. . 8ernard et al, A pipeline architecture for modified higher radiC FFT, I/ASSP& (#, ;ol. -, pp. 51%&5#6, San Francisco, /A, )arch 1((#.

$%. '.I. Guo, /.). Aiu and /.E. 'en, A memor+&based approach to design and implement s+stolic arra+s for 0FT and 0/T, I/ASSP&(#, ;ol. -, pp. 5#1&5#", San Francisco, /A, )arch 1((#. $4. 0. >odrigueB, Tensor product algebra as a tool for ;ASI implementation of the discrete Fourier transform, I/ASSP&(1, pp.16#-&16#4, Toronto, /anada, )a+ 1((1. $(. >. 8hatia, ). Furuta and '. Ponce, A :uasi radiC&15 FFT ;ASI processor, I/ASSP&(1, pp. 164-&1644, Toronto, /anada, )a+ 1((1. "6. @. )i+anaga, @. Famaguchi and 7. )atsuda, A real&time #-5C#-5 point t,o& dimensional FFT single chip processor, I/ASSP&(1, pp. 11($&11(5, Toronto, /anada, )a+ 1((1. "1. F. 7ocsis, A full+ pipelined high speed 0FT architecture, I/ASSP&(1, pp. 1-5(& 1-%#, Toronto, /anada, )a+ 1((1. "#. S.>. )alladi et al, A high speed pipelined FFT processor, I/ASSP&(1, pp. 156(& 151#, Toronto, /anada, )a+ 1((1. "$. /. Au, '.E. /oole+ and >. Tolimieri, ;ariants of the Einograd mutiplicati!e FFT algorithms and their implementation on I8) >S15666, I/ASSP&(1, pp. #14-&#144, Toronto, /anada, )a+ 1((1. "". 0. >odrigueB, A ne, FFT algorithm and its implementation on the 0SP (566#, I/ASSP&(1, pp. #14(&#1(#, Toronto, /anada, )a+ 1((1.

1"

"-. @igh&order Spectral Anal+sis <ISA&P/$#= Soft,are. Integral Signal Processing, Inc., P.9. 8oC #%551, Austin, TH %4%--&#551, ;oice3 -1#&$"5&1"-1, FaC3 -1#&$"5&4#(6. "5. Toshiba IP (-65 Image Processor. @igh speed image processing on a single chip. Luic*est FFT process. Toshiba, I. . 9 ) 0i!ision, (%"6 Ir!ine 8l!d., /A (#%14, Phone3 %1"&-4$&$146. "%. . 8idet, /. 'oanblan: and P. Senn, A fast 47 FFT ;ASI chip for large 9F0) single fre:uenc+ net,or*, %th Intl. Eor*shop on @0T;, pp. , Torino, Ital+, 9ct. 1((". "4. FFT&-#$. A dedicated FFT accelerator for @PDs 54666&based series #66 ,or*stations. Ariel /orp., "$$ >i!er >oad, @ighland Par*, ?' 4(6". Phone and FaC3 (64&#"(&#(66, &mail3 arielPariel.com. "(. T.'. Tobias, In&line split radiC FFT for the 46$45 famil+ of microprocessors, I/SPAT, Santa /lara, /A, Sept. #4&9ct. 1, 1(($. <1#4 point FFT in %66 msec. 9n a $45, "6)@B P/=. -6. /. Au et al, fficient multidimensional FFT module implementation on the Intel I456 processor, I/SPAT, pp. "%$&"%%, Santa /lara, /A, Sept. #4& 9ct. 1, 1(($. -1. F. Solo,ieGcB+*, #&0 FFTs on a distributed memor+ multiprocessing 0SP based architectures, I/SPAT, pp. , Santa /lara. /A, Sept.#4&9ct. 1, 1(($. -#. E. /hen and S. 7ing, Implementation of real input !alued FFT on )otorola 0SPs, I/SPAT, pp. , Santa /lara, /A, Sept. #4& 9ct. 1, 1(($. -$. 9>IGI? for ,indo,s, !oice spectrum, statistics, FFT , po,er spectrum, phase un,rap, )icrocal soft,are, 9ne >oundhouse PlaBa, ?orthampton, )A 61656, Phone3 "1$&-45&#61$, FaC3 "1$&-4-&61#5.<,,,.microcal.com= -". Sharp lectronics, -%66 ?E Pacific >im 8l!d., /amas, EA (456%, Phone3 #65&4$"& 4(64, FaC3 #65&4$"&4(6$, <>eal time 0SP chip set3 A@ (1#" 0SP and A@ ($#6 Address Generator= 16#" point compleC FFT in 46 sec. >eal and compleC radiC&#, radiC&" and radiC&15 FFTs. --. T)/ #$16 FFT processor, compleC FFT <for,ard or in!erse= of up to 16#" points <-1" sec=. >a+theon Semiconductor, $66 llis St, )ountain ;ie,, /A ("6"$&%615, 466&%##&%6%", FaC3 "1-&(55&%%"#. -5. T)S $#6/46 )ultimedia ;ideo Processor <);P=, 5"&point and #-5&point compleC radiC&# FFT, TI, )ar*et /ommunications )anager, )S%$5, P.9. 8oC 1""$, @ouston, TH %%#-1&1""$, <Phone3 1&466&"%%&4(#"=. -%. ;isilog, Image Processing 2 Anal+sis Soft,are3 FFTs and !arious processing operations, ?oesis, 5466 /ote de Aiesse, Suite #66. St. Aaurent, Luebec, @"T#A%,

1-

/anada, Phone3 -1"&$"-&1"66, FaC3 -1"&$"-&1-%-, Internet3 noesisPcam.org -4. ;alle+ Technologies Inc., >d. ", >oute $6(, Tama:ua, PA 14#-#, Phone3 %1%&554& $%$%, FaC3 %1%&554&5$56, &mail3 !altechPcris.com. -(. Stanford Graphics $.6, ;isual ?umerics, (((6 >ichmand A!enue, Suite "66, @ouston, TH %%6"#, Phone3 %1$&(-"&5"#", FaC3 %1$&%41&(#56. 56. '.I. Guo, /.). Aui and /.E. 'en, A memor+ based approach to design and implement s+stolic arra+s for 0FT and 0/T, I/ASSP&(#, ;ol. -, pp. 5#1&5#", San Francisco, /A, )arch 1((#. 51. . 8essalash, ;ASI architecture for fast orthogonal transforms on&line computation, I/SPAT, pp. 156%&1514, Santa /lara, /A, Sept.19ct. 1(($. 5#. A. Ambardar, Analog and digital processing, <$.- 09S dis*ette, I8) P/, PS1# etc., compatible, re:uires )ATAA8 $.- or ".6=, 8oston, )A3 PES Publishing /o., 1((-. 5$. @.;. Sorensen, /.S. 8urrus and ).T. @eideman, Fast Fourier transform database, <dis* and hard cop+=, 8oston, )A3 PES Publishing /o., 1((-. 5". Te*trum 0e!elopment /orp., P.9. 8oC 14$%, Alief, TH %%"11, &mail3 %"1%1.$$16P/ompuser!e.com <Ph3 %1$&#5-&444#, FaC3 %1$&#5-&444%= 5-. ; for Eindo,s, 0igital 9ptics Atd., 8oC $-&%1-, 8ro,ns 8a+, 9ptics Atd., Auc*land 16, ?e, Iealand, Ph3 <5-R(= "%4&-%%(, <5-R(= "%(&"%-6, &mail3
166#$%."#$P/ompuser!e.com

55. @.>. Eu and F.'. Paoloni, Implementation of #&0 !ector radiC FFT algorithm using the fre:uenc+ domain processor A "116#, Proc. IAST 0 Intl. S+mp. on signal Processing and digital filtering, 'une 1((6. 5%. @.>. Eu and F.'. Paoloni, Structured !ector radiC FFT algorithms and hard,are implementation, '. of lectrical and lectronic ngineering, Australia, !ol. 16, pp. #"1&#-$, Sept. 1((6. 54. ?./. Gec*inli and 0. Fa!uB, 0iscrete Fourier transformation and its applications to po,er spectra estimation, Ansterdam, ?etherlands3 lse!ier Scientific Publishing /o. 1(4$. 5(. ;. /iBe*, 0iscrete Fourier transforms and their applications, 8ristol and 8oston3 Adam @igler, 1(45. %6. ).T.@eideman, )ultiplicati!e compleCit+, /on!olution and the 0FT, @eidelberg, German+3 Springer N ;erlag, 1(44.

15

%1. E.E. Smith and '.). Smith, @andboo* of real&time fast Fourier transforms3 Algorithms to product testing, Piscata,a+, ?', I 1((- <Assembl+ language programming, Implement FFT algorithms on 0SP chips, etc.= %#. A. )intBer, The FPAG as FFT processor, I/SPAT, 8oston, )A, 9ct. 1((%$. >.). Piedra, fficient FFT implementation on reduced memor+ 0SPs, I/SPAT, 8oston, )A, 9ct. 1((-. %". 0A0iSP Eor*sheet <soft pac*age= <0A0iSP ".6= 0SP 0e!elopment /orpn., 9ne 7endall S:uare, /ambridge, )A 6#1$(, FaC3 51%&-%%&4#11, Phone3 51%&-%%&11$$, student edition on the ,eb, Eeb site http311,,,.dadisp.com. %-. /.;. Aoan, /omputational frame,or*s for the fast Fourier transform, <uses )ATAA8 notation= SIA), 1((#. %5. >.). Gra+ and '.E. Goodman, Fourier transforms, 8oston, )A3 7lu,er Academic, 1((-. %%. S.7. Au, S.F. 7uo and /.E. Eu, 9n fault&tolerant FFT butterfl+ net,or* design, IS/AS (5, ;ol. #, pp. 5(&%#, Atlanta, GA, )a+ 1((5. %4. S. >ahardGa and 8.'. Fal*o,s*i, Famil+ of fast transforms for miCed arithmetic logic, IS/AS (5, ;ol. ", pp. $(5&$((, Atlanta, GA, )a+ 1((5.
%(.

)athematica $.6, Eolfram >esearch, Inc. http311,,,.,olfram.com, &mail3 infoP,olfram.com, Ph3#1%&$(4&6%66, 8oo*3 S. Eolfram, The mathematica 8oo*, III dition, /ambridge .ni!. Press, ?e, For*, ?F3 ,eb site3 http311 ,,,.cup.org

46. '.S. Eal*er, Fast Fourier transform, II dition, 8oca >aton, FA3 />/ Press, 1((5 <Soft,are on dis*=. 41. S.A. Tretter, /ommunication s+stem design using 0SP algorithms ,ith laborator+ eCperiments for the T)S $#6/$6, Plenum Publishing /orp., 1((5 <Soft,are on dis*= <466&##1&($5(=. 4#. './.0 de )elo, Partial FFT !aluation, I/SPAT (5, pp. 1$%&1"1, 8oston, )A, 9ct. 1((5. 4$. '.7. )cEilliams and ). . Fleming, Small, FleCible, Ao, Po,er, 0FT Filter 8an* for /hanneled recei!ers, I/SPAT (5, pp. 56(&51$, 8oston, )A, 9ct. 1((5. 4". /. ?agabhushan et al, 0esign of T,o @igh Performance >adiC&" FFT Processors .sing a )odular Architecture Famil+, I/SPAT (5, 8oston, )A, 9ct. 1((5.

1%

4-. '. )c/as*ill, T)&55 si,FFT 8loc* Transform 0SP /hip,I/SPAT (-, pp. 54(&5($, 8oston,)A, 9ct. 1((5. 45. ). Aanghammer and /. /rome, Tool for Automated FFT Processor 0esign, I/SPAT (5, 8oston, )A, 9ct. 1((5. 4%. T.'. 0ing and '.;. )c/A??F, S+nthesiBable FFTs /ores, $6th Asilomar /orf. on Signals, S+stems and /omputers, Pacific Gro!e, /A, ?o!. 1((5. 44. @. 7,an et al, Three&dimensional FFTs on a digital&signal parallel processor ,ith no interprocessor communication, $6th Asilomar /onf. on Signals, S+stems and /omputers, Pacific Gro!e, /A, ?o!. 1((5. 4(. ). /a!adini, A high performance memor+ and bus architecture for implementing #0 FFT on a SP)0 machine, IS/ASD(%, ;ol. $. pp. #6$#&#6$5, @ong 7ong, 'une 1((%. (6. S.F. @siao and /.F. Fen, Po,er, speed and area comparison of se!eral 0FT architectures, IS/ASD(%, ;ol. ", pp. #-%%&#-41, @ong 7ong, 'une 1((%. (1. T)S $#6/ 5#61 General&purpose programmable fiCed&point&0SP chip <-ns c+cle time=. /an compute 16#"&point compleC FFT in %6 sec. TI Inc., P.9. 8oC 1%###4, 0en!er, /9 46#1%. T)S $#6 <,,,.ti.com1dsps= (#. ). GraGcar and 8. Sic*, The FFT butterfl+ operation in " processor c+cles on a #" bit fiCed&point 0SP ,ith a pipelined multiplier, I/ASSP (%, ;ol. 1, pp. 511&51", )unich, German+, April 1((%. ($. S. @siao and /. Fen, ?e, unified ;ASI architectures for computing 0FT and other transforms, I/ASSP (%, !ol. 1, pp. 51-&514, )unich, German+, April 1((%. (". 0. Griesinger, 8e+ond )AS&9ccupied @all measurement ,ith FFT techni:ues, 161th /on!ention of A S, Preprint ""6$, Aos Angeles, /A, ?o!. 1((5. (-. >. )a*o,itB and ). )a+r, 9ptimal pipelined FFT processing based on embedded static >A), I/SPAT (%, San 0iego, /A, Sept. 1((%. (5. /.'. 'u, FFT&8ased parallel s+stems for arra+ processing ,ith lo, latenc+3 Sub&"6ns "7 butterfl+ FFT, I/SPAT (%, San 0iego, /A, Sept. 1((%. (%. T. Eilliams, /ase Stud+3 ;ariable siBe, !ariable bit&,idth FFT engine offering 0SP& Ai*e performance ,ith FPGA !ersatilit+, I/SPAT (%, San 0iego, /A, Sept. 1((%. (4. 0. >idge et al, PA0 based FFTs, I/SPAT (%, San 0iego, /A, Sept. 1((%.

14

((. ). Eintermantel, >educing the compleCit+ of discrete con!olutions and 0FT b+ a linear transformation, //T0 (%, 8udapest, @ungar+, Sept. 1((%. 166. 161. 16#. >. Stasins*i, 9ptimiBation of !ector&radiC&$ FFTs, //T0 (%, 8udapest, @ungar+, Sept. 1((%. Fundamentals of FFT&based signal anal+sis and measurement, application note. ?ational Instruments, 466&"$$&$"44, &mail3 infoPnatinst.com )ulti0SP, "45- Ainaro 0r., /r+press, /A (65$6, Ph3 %1"&-#%&4645, FaC3 %1"&-#%& 4#4%, &mail3 multidspPaol.com. Filters, ,indo,s, etc., also 0/T1I0/T, FFT1IFFT, A!erage FFT. E.E. Smith and '.E. Smith, @andboo* of real&time fast Fourier transforms, Piscata,a+, ?'3 I Press, 1((-. G. Angelopoulos and I. Pitas, Fast parallel 0SP algorithms on barrel shifter computers, I Trans. SP, !ol. "1, pp. #1#5&#1#%, Aug. 1(($. 8.). 8aas, A (.-m, $$6 sec 16#"&point FFT processor, I /lara, /A, )a+ 1((4. /I//, Santa

16$. 16". 16-. 165. 16%. sec=,

S. @e and ). Tor*elson, 0esign and Implementation of a 16#" point pipeline FFT, I /I//, Santa /lara, /A, )a+ 1((4. ST; 6$66 ;ASI chip can be programmed to perform FFT or IFFT <up to 41(# point compleC FFT= ,ith input f s from 17@B to $67@B. <41(# point FFT in "16 SGS&Thomson )icroeletronics ?e,s 2 ;ie,s, issue K%, 0ec. 1((%. <,,,.st.com=

164.

A.F. Eu and T.S. /han, /ost&effecti!e parallel lattice ;ASI architecture for the IFFT1FFT in 0)T transcei!er technolog+, I/ASSP (4, pp. $-1%&$-#6, Seattle, EA, )a+ 1((4. A.S >onga, Fast phase se:uences spreading codes for /0)A using FFT, .SIP/9&(4, Island of >hodes, Greece, Sept. 1((4. A. 'bira, Performance of discrete Fourier transform ,ith small o!erlap in transform&predicti!e&coding&based coders, .SIP/9&(4, Island of >hodes, Greece, Sept. 1((4. A. Petro!s*+, Automated parallel&pipeline structure of FFT hard,are design for real&time multidimensional signal processing, .SIP/9&(4, Island of >hodes, Greece, Sept, 1((4. /. 8ecchetti, 0FT based optimal blind channel identification, .SIP/9&(4,

16(. 116.

111.

11#.

1(

Island of >hodes, Greece, Sept. 1((4. 11$. 11". 11-. 115. A.). 7rot, Fast algorithm for reduction a modulo pol+nomial and ;andermonde transform using FFT, .SIP/9&(4, Island of >hodes, Greece, Sept. 1((4. I.E. Selesnic* and /.S. 8urrus, Automatic generation of prime length FFT programs, I Trans. SP, !ol. "", pp. 1"&#", 'an. 1((5. G. ?a!eh et al, 9ptimal FFT implementation on the /armel 0SP /ore, I/SPAT (4, Toronto, /anada, Sept. 1((4. G. /hiassarini et al, Implementation in a single ASI/ chip, of a Einograd FFT for a fleCible demultipleCer of fre:uenc+ demultipleCed signals, I/SPAT (4, Toronto, /anada, Sept. 1((4. A. )intBer, A 166 megasample1sec FPGA&based 0FT processor, I/SPAT (4, Toronto, /anada, Sept. 1((4. S. ?ag and @.7. ;erma, An efficient parallel design of FFTs in FPGAs, I/SPAT (4, Toronto, /anada, Sept. 1((4. /. 0ic*, /omputing multidimensional 0FTs using HilinC FPGAs, I/SPAT (4, Toronto, /anada, Sept. 1((4. 8. 8ramer, ). Ibrahim and S. >umsb+, An FFT implementation using almanet, I/SPAT (4, Toronto, /anada, Sept. 1((4. '.S. )atos and '.). Sil!a, 8oard&le!el 0FT techni:ues using the P11"(." miCed& signal test bus, I I/ /S (4, Aisbon, Portugal, Sept. 1((4. Trans.

11%. 114. 11(. 1#6. 1#1.

1##. '.). >ius and >. 0e Po!rata&0oria, ?e, FFT bit re!ersal algorithm, I SP, !ol. "$, pp. ((1&((", April 1((-.
1#$.

/.A. Eang and /.@. /hang, A no!el 0@T&based FFT1IFFT processor for A0SA transcei!ers, IS/AS ((, pp. , 9rlando , FA, )a+&'une 1(((. ?. 7uro+anagi, A. Guo and ?. Suehiro, Proposal of a no!el signal separation principle based on 0FT ,ith eCtended frame buffer anal+sis, I Global Telecommunication, /onf., pp. , Singapore, ?o!. 1((-.

1#"..

1#-.

S. ?a*amura and A. Sasou, A pitch eCtraction algorithm using combined ,a!elet and Fourier transforms, I/SPAT, 8oston, )A, 9ct. 1((-. 1#5. ;. Solachidis and I. Pitas, Self&similar ring shaped ,atermar* embedding in #0& 0FTdomain, .SIP/9#666, Tampere, Finland, http311eusipco#666.cs.tut.fi 1#(. ). /aramma, >. Aancini and ). )arconi, A perceptual PS?> based on the utiliBation of a linear model of @;S, motion !ectors and 0FT&$0, .SIP/9#666, Tampere, Finland, http311eusipco#666.cs.tut.fi
#6

1$6. 1$1. 1$#. 1$$. 1$".

Fagle, M/losed form reconstruction of images from irregular #&0 discrete Fourier samples using the Good&Thomas FFT, I I/IP, ;ancou!er, /anada, Sept. #666. . GaliGase!ic and '. 7lie,er, ?on&uniform near&perfect&reconstruction o!ersampled 0FT filterban*s based on all pass transforms, I (th 0SP Eor*shop, @unt, TH, 9ct. #666. @. )ura*ami, P> condition for a bloc* filter ban* in terms of 0FTD EP)/#666, 8ang*o*, Thailand, ?o!. #666. H.&G. Hia, 0iscrete chirp&Fourier transform and its application to chirp rate estimation, I Trans. SP, !ol. "4, pp.$1##&$1$", ?o!. #666. L.G. Aiu, 8. /hampagne and 0.7./ @o, Simple design of o!ersampled uniform 0FT filter ban*s ,ith applications to subband acoustic echo cancellation, Signal Processing, !ol. 46, pp. , #666.

134. . H. Hartenstein and D. Saupe, Lossless acceleration of fractal ima e encodin !ia t"e fast Fourier transform,# Si nal $rocessin % &ma e 'ommunication, !ol. 1(, pp. 3)3*3+4, ,---.

13..

.D. Saupe and D. Hartenstein, Lossless acceleration of fractal ima e compression /0 fast con!olution,# &111 &'&$, !ol. 1, pp. 1).*1)), Lausanne, Swit2erland, 1++( 1$5. 3. A"l!es, 3. 4oet2er and S. 5ec"meier, FFT-/ased Disparit0 Estimation for $tereo !mage #oding, IEEE ICIP, Barcelona, Spain, 2003. 136. 7. 8a"oratna, 1. 9rass and 3. :a d"old, A no&e' +1-point FFT2!FFT processor for !EEE ,.-"((3A4 standard,5 !EEE !#A$$P, &o'" !!, pp" )-(-)-1, -..)" 1$4.'.@. Aai, P./. Fuen and G./. Feng, Spectroface3 a Fourier&based approach for human face recognition, Proc. of the #nd Intrnl. /onf. on multimodal interface, @ong 7ong, pp. ;I11-&1#&. 1(((. 1$(. A.@. Samra, S.T.G. Allah and >.). Ibrahim, Face recognition using ,a!elet transform, fast Fourier transform and discrete cosine transform, "5T@ I Intnl. )ES/AS, pp. ,/airo, g+pt, 0ec. #66$. 1"6. G. Schmidt, Single&channel noise suppression based on spectral ,eighting N an o!er!ie,, Tutorial, .>ASIP ?e,s Aetter, !ol. 1-, Pp. (&#", )arch #66".

1"1. '&/ 7uo et al, ;ASI design of a !ariable&length FFT1IFFT processor for 9F0)&based communication s+stems, urasip 'ournal on applied signal processing, !ol. #66$, K 1$, 0ec. #66$ 1"#. G. Ihong, F. Hu, and A. Eilson 'r., An energ+&efficient reconfigurable FFT1IFFT processor based on a multiprocessor ring, .SIP/9, pp. , ;ienna, Austria, Sept. #66". 1"$. ). 'ang, M 0esign of FFT processor ,ith lo, po,er compleC multiplier for 9F0)&based high&speed ,ireless applications 1"". F. Fo*otani and S. 9raintara, A comparison of integer FFT for lossless coding, IS/IT #66", pp. , Sapporo, 'apan, 9ct. #66".
#1

1"-. E.&@. /hang and T. ?gu+en, An 9F0)&specified lossless FFT architechure, I Trans. /ircuits and S+stems, Part I3 regular papers, !ol. -$, 1#$-&1#"$, 'une #665.

##