• Journal of Biomedical Engineering Research
• /
• v.15 no.4
• /
• pp.395-400
• /
• 1994

High resolution spectral analysis is essential for ECG anaysis. The fast Fourier transform has been widely used for frequency analysis of ECG signals but this procedure provides poor resolution when the data record is short and shows Gibb's phenomena. The ARMA FTF (Fast Transversal Filter) algorithm is used for high resolution spectral analysis. The reason of unsalability of this algorithm is investigated and the method for improving the numerical stability is proposed. The proposed algorithm is applied to spectral analysis of the ECG. Since this result has less variations than the FFT based results, it can be used for the computerized diagonosis of the ECG.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.2
• /
• pp.13-18
• /
• 2000

This paper presents the result of a technique to enhance TDAC in the AC-3 algorithm. To reduce block boundary noise without decreasing the performance of transform coding, We propose new special windows which improve the defect of the AC-3 algorithm that could not properly cancel aliasing in the transient period. In addition, a fast MDCT calculation algorithm based on a fast Fourier transform, is adopted.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.5
• /
• pp.214-219
• /
• 2007

This paper proposes a new IFFT(Inverse Fast Fourier Transform) algorithm, which is proper for IMDCT(Inverse Modified Discrete Cosine Transform) of MPEG-2 AAC(Advanced Audio Coding) decoder. The $2^n$(N-point) type IMDCT is the most powerful among many IMDCT algorithms, however it includes IFFT that requires many calculation cycles. The IFFT used in $2^n$(N-point) type IMDCT employ the bit-reverse data arrangement of inputs and N/4-point complex IFFT to reduce the calculation cycles. We devised a new data arrangement method of IFFT input and $N/4^{n+1}$-type IFFT and thus we can reduce multiplication cycles, addition cycles, and ROM size.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06e
• /
• pp.23-26
• /
• 1998

This paper presents a technique to enhance TDAC in the AC-3 algorithm. To reduce block boundary noise without decreasing the performance of transform coding, new special window adopted. They improves the defect of the AC-3 algorithm that could not properly cancel aliasing in the tansient period. In addition, a fast MDCT calculation algorithm based on a fast Fourier Transform, is adopted.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.498-503
• /
• 2009

As for Hadamard Transform, because the calculation time of this transform is slower than Discrete Cosine Transform (DCT) and Fast Fourier Transform (FFT), the effectiveness and the practicality are insufficient. Then, the computational complexity can be decreased by using the butterfly operation as well as FFT. We composed calculation time of FFT with that of Fast Complex Hadamard Transform by constructing the algorithm of Fast Complex Hadamard Transform. They are indirect conversions using program of complex number calculation, and immediate calculations. We compared calculation time of them with that of FFT. As a result, the reducing the calculation time of the Complex Hadamard Transform is achieved. As for the computational complexity and calculation time, the result that quadrinomial Fast Complex Hadamard Transform that don't use program of complex number calculation decrease more than FFT was obtained.

• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.697-702
• /
• 2021

Fast Fourier Transform (FFT) is a major signal processing block being widely used. For long-point FFT processing, usually more than 1024 points, its low-complexity implementation becomes very important while retaining high SQNR (Signal-to-Quantization Noise Ratio). In this paper, we present a low-complexity FFT algorithm with a simple dynamic scaling scheme. For the 2048-point pipelined FFT processing, we can reduce the number of general multipliers by half compared to the well-known radix-2 algorithm. Also, the table size for twiddle factors is reduced to 35% and 53% compared to the radix-2 and radix-2² algorithms respectively, while achieving SQNR of more than 55dB without increasing the internal wordlength progressively.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.473-476
• /
• 2003

We suggest 2 dimensional Fast Fourier Transform using Polynomial Transform and integer Fast Fourier Transform. Unlike conventional 2D-FFT using the direct quantization of twiddle factor, the suggested 2D-FFT adopts implemented by the lifting so that the suggested 2D-FFT is power adaptable and reversible. Since the suggested FFT performg integer-to-integer mapping, the transform can be implemented by only bit shifts and auditions without multiplications. In addition. polynomial transform severely reduces the multiplications of 2D-FFT. While preserving the reversibility, complexity of this algorithm is shown to be much lower than that of any other algorithms in terms of the numbers of additions and shifts.

• International Journal of Highway Engineering
• /
• v.16 no.5
• /
• pp.59-66
• /
• 2014

PURPOSES : This study is to predict the Sound Pressure Level(SPL) obtained from the Noble Close ProXimity(NCPX) method by using the Extended Kalman Filter Algorithm employing the taylor series and Linear Regression Analysis based on the least square method. The objective of utilizing EKF Algorithm is to consider stochastically the effect of error because the Regression analysis is not the method for the statical approach. METHODS : For measuring the friction noise between the surface and vehicle's tire, NCPX method was used. With NCPX method, SPL can be obtained using the frequency analysis such as Discrete Fourier Transform(DFT), Fast Fourier Transform(FFT) and Constant Percentage Bandwidth(CPB) Analysis. In this research, CPB analysis was only conducted for deriving A-weighted SPL from the sound power level in terms of frequencies. EKF Algorithm and Regression analysis were performed for estimating the SPL regarding the vehicle velocities. RESULTS : The study has shown that the results related to the coefficient of determination and RMSE from EKF Algorithm have been improved by comparing to Regression analysis. CONCLUSIONS : The more the vehicle is fast, the more the SPL must be high. But in the results of EKF Algorithm, SPLs are irregular. The reason of that is the EKF algorithm can be reflected by the error covariance from the measurements.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.231-238
• /
• 2004

This paper presents the high speed noise reduction processing system using the modified discrete fourier transform(MDFT) on the frequency domain. The proposed filter uses the linear prediction coefficients of the adaptive line enhance(ALE) method based on the Sign algorithm The signals with a random noise tracking performance are examined through computer simulations. It is confirmed that the fast adaptive digital filter is realized by the high speed adaptive noise reduction(HANR) algorithm with rapid convergence on the frequency domain(FD).

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.8
• /
• pp.1253-1260
• /
• 2001

Transient thermal analysis of a three-dimensional axisymmetric automotive disk brake is presented in this paper. Temperature fields are obtained using a hybrid FFT-FEM scheme that combines Fourier transform techniques and finite element method. The use of a fast Fourier transform algorithm can avoid singularity problems and lead to inexpensive computing time. The transformed problem is solved with finite element scheme for each frequency domain. Inverse transforms are then performed for time domain solution. Numerical examples are presented for validation tests. Comparisons with analytical results show very good agreement. Also, a 3-D simulation, based upon an automotive brake disk model is performed.