Results 291 to 300 of about 790,476 (361)
Some of the next articles are maybe not open access.
Parameter-Efficient Fine-Tuning with Discrete Fourier Transform
International Conference on Machine LearningLow-rank adaptation~(LoRA) has recently gained much interest in fine-tuning foundation models. It effectively reduces the number of trainable parameters by incorporating low-rank matrices $A$ and $B$ to represent the weight change, i.e., $\Delta W=BA ...
Ziqi Gao +6 more
semanticscholar +1 more source
Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform
SIAM Journal on Scientific Computing, 1996Accuracy of the discrete Fourier transform (DFT) and the fast Fourier transform (FFT) depends on the accuracy of the twiddle factors entirely. For accurate twiddle factor tables, this paper recommends to compute the sine/cosine functions with high precision arithmetic along the algorithms in terms of faster converging approximations, such as rational ...
openaire +1 more source
On commutativity of Discrete Fourier Transform
Information Processing Letters, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2020
The ordinary Fourier Transform is for a continuous function. The continuous Fourier Transform is difficult to use in real time because in real time, one is dealing with discrete data sampled using some kind of sensors. For instance, the time series from weather, traffic, stocks etc., one is getting the discrete values at each time point (e.g. 1-s, 2-s,
openaire +2 more sources
The ordinary Fourier Transform is for a continuous function. The continuous Fourier Transform is difficult to use in real time because in real time, one is dealing with discrete data sampled using some kind of sensors. For instance, the time series from weather, traffic, stocks etc., one is getting the discrete values at each time point (e.g. 1-s, 2-s,
openaire +2 more sources
The Discrete Fourier Transform and the Fast Fourier Transform
1998The preceding chapters have made extensive mention of the Fourier transform (FT), the discrete Fourier transform (DFT), and the fast Fourier transform (FFT). This chapter examines the relationship between the FT and the DFT, discusses the FFT algorithm as a means of computing the DFT much more rapidly than can be achieved with the DFT algorithm ...
T. M. Peters, J. H. T. Bates
openaire +1 more source
The Discrete Fourier Transform
2018The DTFT of a discrete-time signal is a continuous function of the frequency (\( \omega \)), and hence, the relation between \( X\left( {\text{e}^{{j}\omega } } \right) \) and \( x(n) \) is not a computationally convenient representation. However, it is possible to develop an alternative frequency representation called the discrete Fourier transform ...
K. Deergha Rao, M. N. S. Swamy
openaire +1 more source
The Discrete Fourier Transform
1996As discussed in Section 1.1.2, the design of a DSP system basically involves two fundamental tasks, namely, the analysis of the input signal and the design of a processing system to give the desired output. There are several different mathematical tools for carrying out these two tasks. A time-domain approach was presented in Chapter 1, where a sampled
Trevor J. Terrell, Lik-Kwan Shark
openaire +1 more source
Discrete-Time Fourier Transform Discrete Fourier Transform
2022Muhammad N. Khan +2 more
openaire +1 more source
The Discrete Fourier Transform
1993Abstract We will consider how several different networks handle many common algorithms. In order to do this, we follow Preparata and Vuillemin in [125] in defining a pair of generic parallel algorithms that can be easily implemented on the common network-Naturally, some networks are better than others for developing parallel algorithms ...
openaire +1 more source