Academic literature on the topic 'Discrete Fourier transforms (DFTs)'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Discrete Fourier transforms (DFTs).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Discrete Fourier transforms (DFTs)"

1

Mahmood, Faisal, Märt Toots, Lars-Göran Öfverstedt, and Ulf Skoglund. "Algorithm and Architecture Optimization for 2D Discrete Fourier Transforms with Simultaneous Edge Artifact Removal." International Journal of Reconfigurable Computing 2018 (August 6, 2018): 1–17. http://dx.doi.org/10.1155/2018/1403181.

Full text
Abstract:
Two-dimensional discrete Fourier transform (DFT) is an extensively used and computationally intensive algorithm, with a plethora of applications. 2D images are, in general, nonperiodic but are assumed to be periodic while calculating their DFTs. This leads to cross-shaped artifacts in the frequency domain due to spectral leakage. These artifacts can have critical consequences if the DFTs are being used for further processing, specifically for biomedical applications. In this paper we present a novel FPGA-based solution to calculate 2D DFTs with simultaneous edge artifact removal for high-perfo
APA, Harvard, Vancouver, ISO, and other styles
2

He, Y., K. Hueske, J. Götze, and E. Coersmeier. "Matrix-Vector Based Fast Fourier Transformations on SDR Architectures." Advances in Radio Science 6 (May 26, 2008): 89–94. http://dx.doi.org/10.5194/ars-6-89-2008.

Full text
Abstract:
Abstract. Today Discrete Fourier Transforms (DFTs) are applied in various radio standards based on OFDM (Orthogonal Frequency Division Multiplex). It is important to gain a fast computational speed for the DFT, which is usually achieved by using specialized Fast Fourier Transform (FFT) engines. However, in face of the Software Defined Radio (SDR) development, more general (parallel) processor architectures are often desirable, which are not tailored to FFT computations. Therefore, alternative approaches are required to reduce the complexity of the DFT. Starting from a matrix-vector based descr
APA, Harvard, Vancouver, ISO, and other styles
3

Yang, Y., M. Crimp, R. A. Tomlinson, and E. A. Patterson. "Quantitative measurement of plastic strain field at a fatigue crack tip." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 468, no. 2144 (March 14, 2012): 2399–415. http://dx.doi.org/10.1098/rspa.2011.0682.

Full text
Abstract:
A novel approach is introduced to map the mesoscale plastic strain distribution resulting from heterogeneous plastic deformation in complex loading and component geometries, by applying the discrete Fourier transform (DFT) to backscattered electron (BSE) images of polycrystalline patches. These DFTs are then calibrated against the full width at half the maximum of the central peak of the DFTs collected from the same material tested under in situ scanning electron microscopy uniaxial tensile conditions, which indicates a close relationship with the global tensile strain. In this work, the techn
APA, Harvard, Vancouver, ISO, and other styles
4

Peng, Yaqiu, and Mingqi Li. "Discrete Fourier Transform-Based Block Faster-Than- Nyquist Transmission for 5G Wireless Communications." Applied Sciences 10, no. 4 (February 14, 2020): 1313. http://dx.doi.org/10.3390/app10041313.

Full text
Abstract:
Faster-than-Nyquist (FTN) signaling is regarded as a potential candidate for improving data rate and spectral efficiency of 5G new radio (NR). However, complex detectors have to be utilized to eliminate the inter symbol interference (ISI) introduced by time-domain packing and the inter carrier interference (ICI) introduced by frequency-domain packing. Thus, the exploration of low complexity transceiver schemes and detectors is of great importance. In this paper, we consider a discrete Fourier transform (DFT) block transmission for multi-carrier FTN signaling, i.e., DBT-MC-FTN. With the aid of
APA, Harvard, Vancouver, ISO, and other styles
5

SAKK, ERIC. "ON THE COMPUTATION OF MOLECULAR SURFACE CORRELATIONS FOR PROTEIN DOCKING USING FOURIER TECHNIQUES." Journal of Bioinformatics and Computational Biology 05, no. 04 (August 2007): 915–35. http://dx.doi.org/10.1142/s0219720007002916.

Full text
Abstract:
The computation of surface correlations using a variety of molecular models has been applied to the unbound protein docking problem. Because of the computational complexity involved in examining all possible molecular orientations, the fast Fourier transform (FFT) (a fast numerical implementation of the discrete Fourier transform (DFT)) is generally applied to minimize the number of calculations. This approach is rooted in the convolution theorem which allows one to inverse transform the product of two DFTs in order to perform the correlation calculation. However, such a DFT calculation result
APA, Harvard, Vancouver, ISO, and other styles
6

de Oliveira Neto, Jose R., and Juliano B. Lima. "Discrete Fractional Fourier Transforms Based on Closed-Form Hermite–Gaussian-Like DFT Eigenvectors." IEEE Transactions on Signal Processing 65, no. 23 (December 1, 2017): 6171–84. http://dx.doi.org/10.1109/tsp.2017.2750105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Han, Feng, Yao Lin Liu, Zhen Liu, and Hai Dong Zeng. "Comments on Errors of DFT Spectrum." Applied Mechanics and Materials 568-570 (June 2014): 189–92. http://dx.doi.org/10.4028/www.scientific.net/amm.568-570.189.

Full text
Abstract:
Discrete Fourier transform (DFT/FFT) spectrums contain a variety of inherent errors in asynchronous sampling. Spectrum analysis with the accuracy above 10-3 are generally challenging issues. This work divides the DFT procedure into four signal transforms and exams six spectrum errors originated from these distortions. Besides the review of traditional errors, a so-called energy loss-gain (ELG) error is briefly introduced, which is proved to be a considerable error on the basis of Parseval's theorem. With the help of full error analysis mentioned here and the further development of analytical e
APA, Harvard, Vancouver, ISO, and other styles
8

BI, GUOAN, A. C. KOT, and ZIHOU MENG. "GENERALISED SPLIT-RADIX ALGORITHMS FOR DFT." Journal of Circuits, Systems and Computers 08, no. 03 (June 1998): 405–9. http://dx.doi.org/10.1142/s0218126698000201.

Full text
Abstract:
This letter presents a general split-radix algorithm based on the decimation-in-time decomposition. It can flexibly compute the discrete Fourier transforms of length-q*2m where q is an odd integer. In comparison with other reported algorithms, our proposed one supports a wider range of sequence lengths, achieves a reduction of arithmetic operations and requires a simple computational structure.
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Bangbing, Bo Sun, Jiaxin Wang, Jamin Greenbaum, Jingxue Guo, Laura Lindzey, Xiangbin Cui, Duncan A. Young, Donald D. Blankenship, and Martin J. Siegert. "Removal of ‘strip noise’ in radio-echo sounding data using combined wavelet and 2-D DFT filtering." Annals of Glaciology 61, no. 81 (March 28, 2019): 124–34. http://dx.doi.org/10.1017/aog.2019.4.

Full text
Abstract:
ABSTRACTRadio-echo sounding (RES) can be used to understand ice-sheet processes, englacial flow structures and bed properties, making it one of the most popular tools in glaciological exploration. However, RES data are often subject to ‘strip noise’, caused by internal instrument noise and interference, and/or external environmental interference, which can hamper measurement and interpretation. For example, strip noise can result in reduced power from the bed, affecting the quality of ice thickness measurements and the characterization of subglacial conditions. Here, we present a method for re
APA, Harvard, Vancouver, ISO, and other styles
10

Lai, Chao-Yuan, Tien-Yen Yang, and Chih-Wen Liu. "Performance of Implementing Smart DFT in Micro Phasor Measurement Unit." E3S Web of Conferences 69 (2018): 01005. http://dx.doi.org/10.1051/e3sconf/20186901005.

Full text
Abstract:
The advance of the signal processing, this paper implement a more accurate digital measurement algorithm, Smart DFT(SDFT) in Micro Phasor Measurement Unit(μPMU), which is based on Discrete Fourier Transforms(DFT) to estimate frequency information from Taiwan power system. μPMU, the sensor we plan to acquire the information from the power system by using the signal of outlet voltage-level 110V in Taiwan, such as frequency, voltage and angle. The performance of SDFT implemented in μPMU represents a more precise frequency information when frequency fluctuation occurred just as the frequency of po
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Discrete Fourier transforms (DFTs)"

1

Heiskanen, Andreas, and Erik Johansson. "Analysing Memory Performance when computing DFTs using FFTW." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-230225.

Full text
Abstract:
Discrete Fourier Transforms (DFTs) are used in a wide variety of dif-ferent scientific areas. In addition, there is an ever increasing demand on fast and effective ways of computing DFT problems with large data sets. The FFTW library is one of the most common used libraries when computing DFTs. It adapts to the system architecture and predicts the most effective way of solving the input problem. Previous studies have proved the FFTW library to be superior to other DFT solving libraries. However, not many have specifically examined the cache memory performance, which is a key factor for overall
APA, Harvard, Vancouver, ISO, and other styles
2

Akhtar, Mahmood Electrical Engineering &amp Telecommunications Faculty of Engineering UNSW. "Genomic sequence processing: gene finding in eukaryotes." Publisher:University of New South Wales. Electrical Engineering & Telecommunications, 2008. http://handle.unsw.edu.au/1959.4/40912.

Full text
Abstract:
Of the many existing eukaryotic gene finding software programs, none are able to guarantee accurate identification of genomic protein coding regions and other biological signals central to pathway from DNA to the protein. Eukaryotic gene finding is difficult mainly due to noncontiguous and non-continuous nature of genes. Existing approaches are heavily dependent on the compositional statistics of the sequences they learn from and are not equally suitable for all types of sequences. This thesis firstly develops efficient digital signal processing-based methods for the identification of genomic
APA, Harvard, Vancouver, ISO, and other styles
3

Khan, Aman Ullah. "Parallel computation of fast Fourier transforms." Thesis, Cardiff University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340239.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Al-Harbi, Hamad F. "Crystal plasticity finite element simulations using discrete Fourier transforms." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/51788.

Full text
Abstract:
Crystallographic texture and its evolution are known to be major sources of anisotropy in polycrystalline metals. Highly simplified phenomenological models cannot usually provide reliable predictions of the materials anisotropy under complex deformation paths, and lack the fidelity needed to optimize the microstructure and mechanical properties during the production process. On the other hand, physics-based models such as crystal plasticity theories have demonstrated remarkable success in predicting the anisotropic mechanical response in polycrystalline metals and the evolution of underlying t
APA, Harvard, Vancouver, ISO, and other styles
5

Arof, H. "Texture classification and segmentation using one dimensional discrete Fourier transforms." Thesis, Swansea University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.635797.

Full text
Abstract:
This thesis introduces a texture descriptor that is invariant to rotation. The new texture descriptor utilizes the property of the magnitudes of Fourier transform coefficients that do not change with spatial shift of input elements. Since rotating an image by an arbitrary angle does not change pixel intensities in an image but shifts them in circular motion, the notion of producing texture features invariant to rotation using 1-D Fourier transform coefficients can be realized if the relationship between circular motion and spatial shift can be established. By analyzing individual circular neig
APA, Harvard, Vancouver, ISO, and other styles
6

Barrera, David. "Quenched Asymptotics for the Discrete Fourier Transforms of a Stationary Process." University of Cincinnati / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1460652609.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sayyah, Jahromi Mohammad Reza Information Technology &amp Electrical Engineering Australian Defence Force Academy UNSW. "Efficient broadband antenna array processing using the discrete fourier form transform." Awarded by:University of New South Wales - Australian Defence Force Academy. School of Information Technology and Electrical Engineering, 2005. http://handle.unsw.edu.au/1959.4/38690.

Full text
Abstract:
Processing of broadband signals induced on an antenna array using a tapped delay line filter and a set of steering delays has two problems. Firstly one needs to manipulate large matrices to estimate the filter coefficients. Secondly the use of steering delays is not only cumbersome but implementation errors cause loss of system performance. This thesis looks at both of these problems and presents elegant solutions by developing and studying a design method referred to as the DFT method, which does not require steering delays and is computationally less demanding compared to existing methods.
APA, Harvard, Vancouver, ISO, and other styles
8

Ganesh, Murthy C. N. S. "A Study On Bandpassed Speech From The Point Of Intelligibility." Thesis, Indian Institute of Science, 1989. http://hdl.handle.net/2005/93.

Full text
Abstract:
Speech has been the subject of interest for a very long time. Even with so much advancement in the processing techniques and in the understanding of the source of speech, it is, even today, rather difficult to generate speech in the laboratory in all its aspects. A simple aspect like how the speech can retain its intelligibility even if it is distorted or band passed is not really understood. This thesis deals with one small feature of speech viz., the intelligibility of speech is retained even when it is bandpassed with a minimum bandwidth of around 1 KHz located any where on the speech spect
APA, Harvard, Vancouver, ISO, and other styles
9

Bleiler, Sarah K. "Orthogonal filters and the implications of wrapping on discrete wavelet transforms." [Tampa, Fla] : University of South Florida, 2008. http://purl.fcla.edu/usf/dc/et/SFE0002676.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lo, King Chuen. "Theory and realization of novel algorithms for random sampling in digital signal processing." Thesis, Durham University, 1996. http://etheses.dur.ac.uk/5239/.

Full text
Abstract:
Random sampling is a technique which overcomes the alias problem in regular sampling. The randomization, however, destroys the symmetry property of the transform kernel of the discrete Fourier transform. Hence, when transforming a randomly sampled sequence to its frequency spectrum, the Fast Fourier transform cannot be applied and the computational complexity is N(^2). The objectives of this research project are (1) To devise sampling methods for random sampling such that computation may be reduced while the anti-alias property of random sampling is maintained : Two methods of inserting limite
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Discrete Fourier transforms (DFTs)"

1

Henson, Van Emden. DFTS on irregular grids: The anterpolated DFT. Monterey, Calif: Naval Postgraduate School, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Briggs, William L. The DFT: An owner's manual for the discrete Fourier transform. Philadelphia: Society for Industrial and Applied Mathematics, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chu, Eleanor Chin-hwa. Discrete and Continuous Fourier Transforms. London: Taylor and Francis, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chu, Eleanor Chin-hwa. Discrete and continuous fourier transforms analysis. Boca Raton, Fla: Chapman & Hall/CRC Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Discrete Fourier transforms and their applications. Bristol, England: Adam Hilger, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mathematics of the discrete Fourier transform (DFT): With music and audio applicaitons. [S.l.]: W3K Pub., 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chu, Eleanor Chin-hwa. Discrete and continuous fourier transforms: Analysis, applications and fast algorithms. Boca Raton, Fla: CRC Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chu, Eleanor Chin-hwa. Discrete and continuous fourier transforms: Analysis, applications and fast algorithms. Boca Raton, Fla: CRC Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

F, Doyle James. Wave propagation in structures: Spectral analysis using fast discrete Fourier transforms. 2nd ed. New York: Springer, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

F, Doyle James. Wave Propagation in Structures: Spectral Analysis Using Fast Discrete Fourier Transforms. New York, NY: Springer New York, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Discrete Fourier transforms (DFTs)"

1

Zieliński, Tomasz P. "Discrete Fourier Transforms: DtFT and DFT." In Starting Digital Signal Processing in Telecommunication Engineering, 65–92. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-49256-4_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Firth, Jean M. "Fast Fourier transforms." In Discrete Transforms, 156–77. Dordrecht: Springer Netherlands, 1992. http://dx.doi.org/10.1007/978-94-011-2358-7_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Firth, Jean M. "The discrete Fourier transform." In Discrete Transforms, 117–40. Dordrecht: Springer Netherlands, 1992. http://dx.doi.org/10.1007/978-94-011-2358-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Heideman, Michael T. "Multiplicative Complexity of Discrete Fourier Transform." In Multiplicative Complexity, Convolution, and the DFT, 76–107. New York, NY: Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4612-3912-3_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jerri, Abdul J. "Discrete Fourier Transforms." In Linear Difference Equations with Discrete Transform Methods, 281–328. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4757-5657-9_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Plonka, Gerlind, Daniel Potts, Gabriele Steidl, and Manfred Tasche. "Discrete Fourier Transforms." In Numerical Fourier Analysis, 107–57. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04306-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Firth, Jean M. "The Fourier transform. Convolution of analogue signals." In Discrete Transforms, 25–53. Dordrecht: Springer Netherlands, 1992. http://dx.doi.org/10.1007/978-94-011-2358-7_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Firth, Jean M. "Fourier series, integral theorem, and transforms: a review." In Discrete Transforms, 1–24. Dordrecht: Springer Netherlands, 1992. http://dx.doi.org/10.1007/978-94-011-2358-7_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Firth, Jean M. "Simplification and factorization of the discrete Fourier transform matrix." In Discrete Transforms, 141–55. Dordrecht: Springer Netherlands, 1992. http://dx.doi.org/10.1007/978-94-011-2358-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wong, M. W. "Wavelet Transforms and Filter Banks." In Discrete Fourier Analysis, 61–66. Basel: Springer Basel, 2011. http://dx.doi.org/10.1007/978-3-0348-0116-4_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Discrete Fourier transforms (DFTs)"

1

Xu, Y. F., and W. D. Zhu. "Efficient and Accurate Calculation of Discrete Frequency Response Functions and Impulse Response Functions." In ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-47779.

Full text
Abstract:
Modal properties of a structure can be identified by experimental modal analysis (EMA). Discrete frequency response functions (FRFs) and impulse response functions (IRFs) between responses and excitation are bases for EMA. In calculation of a discrete FRF, discrete Fourier transform (DFT) is applied to both response and excitation data series, and a transformed data series in DFT is virtually extended to have an infinite length and be periodic with a period equal to the length of the series; the resulting periodicity can be physically incorrect in some cases, which depends on an excitation tec
APA, Harvard, Vancouver, ISO, and other styles
2

Yao, Xueyang, and Natalie Baddour. "Numerical Computation of the Discrete 2D Fourier Transform in Polar Coordinates." In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-85616.

Full text
Abstract:
The discrete Fourier transform in Cartesian coordinates has proven to be invaluable in many disciplines. However, in application such as photoacoustics and tomography, a discrete 2D-Fourier transform in polar coordinates is needed. In this paper, a discrete 2D-Fourier transform in polar coordinates is presented. It is shown that numerical implementation is best achieved by interpreting the transform as a 1D-discrete Fourier transform (DFT), a 1D-discrete Hankel transform (DHT) and a 1D-discrete inverse transform (IDFT) in sequence. The transform is tested by numerical simulations with respect
APA, Harvard, Vancouver, ISO, and other styles
3

Davis, John M., Ian A. Gravagne, and Robert J. Marks. "Time scale discrete Fourier transforms." In 2010 42nd Southeastern Symposium on System Theory (SSST 2010). IEEE, 2010. http://dx.doi.org/10.1109/ssst.2010.5442859.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Khalil, Ethar H. "EHK Index Method for Calculating Discrete Fourier Transform." In ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-86442.

Full text
Abstract:
A new mathematical model has been achieved, for the calculation of DFT and its inversion depending on the indices which represent the shortest way for referring to the elements, pixels or pixels in each slide dealing with 1-D, 2-D, and 3-D digital signals respectively. This method indicates clearly the contribution factor of each input signal element in each output signal element.
APA, Harvard, Vancouver, ISO, and other styles
5

L. Fontaine, Fred. "Multi Resolution Lattice Discrete Fourier Transform (MRL-DFT)." In 4th International Conference on Information Technology, Control, Chaos, Modeling and Applications. Academy & Industry Research Collaboration Center (AIRCC), 2017. http://dx.doi.org/10.5121/csit.2017.70706.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wolf, Kurt Bernardo. "Discrete and finite fractional Fourier transforms." In Frontiers in Optics. Washington, D.C.: OSA, 2003. http://dx.doi.org/10.1364/fio.2003.waa8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mitra, S., and A. Srinivasan. "Small Discrete Fourier Transforms on GPUs." In 2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid). IEEE, 2011. http://dx.doi.org/10.1109/ccgrid.2011.14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Oraintara, Soontorn. "The generalized discrete fractional fourier transforms." In Proceedings of ICASSP '02. IEEE, 2002. http://dx.doi.org/10.1109/icassp.2002.5744012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Oraintara. "The generalized discrete fractional Fourier transforms." In IEEE International Conference on Acoustics Speech and Signal Processing ICASSP-02. IEEE, 2002. http://dx.doi.org/10.1109/icassp.2002.1005960.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Talwalkar, Sumit A., and S. Lawrence Marple. "Time-frequency scaling property of Discrete Fourier Transform (DFT)." In 2010 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2010. http://dx.doi.org/10.1109/icassp.2010.5495902.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Discrete Fourier transforms (DFTs)"

1

Yegulalp, A. F. Asymptotic Error for Windowed Discrete Fourier Transforms. Fort Belvoir, VA: Defense Technical Information Center, August 2006. http://dx.doi.org/10.21236/ada452964.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gabriel, William F. Adaptive Digital Processing Investigation of DFT (Discrete Fourier Transform) Subbanding vs. Transversal Filter Canceler. Fort Belvoir, VA: Defense Technical Information Center, July 1986. http://dx.doi.org/10.21236/ada171894.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!