• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3438-3454
• /
• 2018

In this paper, we propose a robust blind watermarking scheme for high-definition video. In the embedding process, luminance component of each frame is transformed by 2-dimensional fast Fourier transform (2D FFT). A secret key is used to generate a matrix of random numbers for the security of watermark information. The matrix is transformed by inverse steerable pyramid transform (SPT). We embed the watermark into the low and mid-frequency of 2D FFT coefficients with the transformed matrix. In the extraction process, the 2D FFT coefficients of each frame and the transformed matrix are transformed by SPT respectively, to produce two oriented sub-bands. We extract the watermark from each frame by cross-correlating two oriented sub-bands. If a video is degraded by some attacks, the watermarks of frames contain some errors. Thus, we use an ensemble position-based error correcting algorithm to estimate the errors and correct them. The experimental results show that the proposed watermarking algorithm is imperceptible and moreover is robust against various attacks. After embedding 64 bits of watermark into each frame, the average peak signal-to-noise ratio between original frames and embedded frames is 45.7 dB.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.851-856
• /
• 1987

A direct computation algorithm of two dimensional fast Fourier transform (2D-FFT) is considered here for implementation in mesh connected multiprocessor array of both a 2D-toroidal and a rectangular type. Results are derived for a hardware algorithm including data allocation and interprocessor communications. A performance comparison is carried out between the proposed direct 2D-FFT computation and the conventional one to show that a new algorithm gives higher speedup under a reasonable assumption on the speeds of operations.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.2
• /
• pp.71-77
• /
• 2017

This paper proposes a low complexity frequency modulated continuous wave (FMCW) surveillance radar algorithm. In the conventional surveillance radar systems, the two dimensional (2D) fast Fourier transform (FFT) method is usually employed in order to detect the distance and velocity of the targets. However, in a surveillance radar systems, it is more important to immediately detect the presence or absence of the targets, rather than accurately detecting the distance or speed information of the target. In the proposed algorithm, in order to immediately detect the presence or absence of targets, 1D FFT is performed on the first and M-th bit signals among a total of M beat signals and then a phase change between two FFT outputs is observed. The range of target is estimated only when the phase change occurs. By doing so, the proposed algorithm achieves a significantly lower complexity compared to the conventional surveillance scheme using 2D FFT. In addition, show in order to verify the performance of the proposed algorithm, the simulation and the experiment results are performed using 24GHz FMCW radar module.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.145-148
• /
• 2001

This paper presents a phase-based stereo matching algorithm in order to efficiently extract 3-dimensional objects from two 2D images. Conventional phase-based methods, especially using windowed Fourier phases, inherit good properties in the cage of hierarchical approaches, because they basically use a multi-resolution phase map. On the contrary, their computational cost is too heavy. Therefore, a fast hierarchical approach, using multi-resolution phase-based strategy and reducing redundancies of phase calculations based on FFT concept is proposed in this paper. In addition, a structural matching algorithm on the phase domain is presented to improve the matching quality. In experimental results. it is shown that the computation loads are considerably reduced about 8 times and stable outputs are obtained from various images.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.13 no.2
• /
• pp.83-92
• /
• 2005

An electromagnetic acoustic transducer (EMAT) is a unique probe that does not require a couplant or gel and also can usually generate or detect an ultrasonic wave into specimens across a small gap. It, therefore can be applied in a noncontact mode with a high degree of reproducibility. Especially stiffness of composites depends on layup sequence of CFRP(carbon fiber reinforced plastics) laminates. It is very important to evaluate the layup errors in prepreg laminates. A nondestructive technique can therefore serve as a useful measurement for detecting layup errors. This shear wave for detecting the presence of the errors is very sensitive. A decomposition model has been used in the interpretation and prediction of test results. Test results have been com pared with model data. It is found that the high probability shows between tests and the model utilized in characterizing cured layups of the laminates. Also a C-scan method was used for detecting layup of the laminates because of extracting fiber orientation information from the ultrasonic reflection caused by structural imperfections in the laminates. Therefore, it was found that interface C-scan images show the fiber orientation information by using two-dimensional fast Fourier transform (2-D FFT).

• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.2
• /
• pp.34-42
• /
• 1997

This paper deals with the recognition of closed planar shape using a three dimensional spectral feature vector which is derived from the FFT(Fast Fourier Transform) spectrum of contour sequence and fuzzy ARTMAP neural network classifier. Contour sequences obtained from 2-D planar images represent the Euclidean distance between the centroid and all boundary pixels of the shape, and are related to the overall shape of the images. The Fourier transform of contour sequence and spectrum analyzer are used as a means of feature selection and data reduction. The three dimensional spectral feature vectors are extracted by spectrum analyzer from the FFT spectrum. These spectral feature vectors are invariant to shape translation, rotation and scale transformation. The fuzzy ARTMAP neural network which is combined with two fuzzy ART modules is trained and tested with these feature vectors. The experiments including 4 aircrafts and 4 industrial parts recognition process are presented to illustrate the high performance of this proposed method in the recognition problems of noisy shapes.

• ETRI Journal
• /
• v.44 no.1
• /
• pp.85-93
• /
• 2022

We propose an efficient method for synthesizing mesh-based realistic computer-generated hologram (CGH). In a previous nonanalytic mesh-based CGH synthesis, the angular spectrum of the two-dimensional (2D) plane is calculated using the fast Fourier transform (FFT) with the same size as the resolution of the final hologram. Because FFT increases the computation time as the size of the input matrix increases, the previous method has a problem: The higher the resolution of the hologram, the greater the computational load, thereby delaying synthesis time. In this study, when calculating the angular spectrum of the 2D plane in mesh-based CGH synthesis, we propose a method to calculate the angular spectrum by defining the 2D plane with an arbitrary size smaller than the resolution of the final hologram. The resolution adjustment method reduces the computation time and can be applied to occlusion culling and texturing for the realistic effect of mesh-based CGH. We describe the principle, error analysis, application of realistic effect, and experimental results of the proposed method.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.712_713
• /
• 2009

This paper deals with the analysis on eddy current looses of high speed permanent magnet synchronous motor (PMSM) for turbo compressor according to voltage source driving. This paper presents analytical procedures for calculation of the eddy current losses using Poynting theorem. On the basis of the magnetic vector potential and a two-dimensional (2-D) cylindrical coordinate system, this paper derived analytical solutions of the eddy current looses using phase current analysis. The eddy current losses of each harmonic obtained by fast Fourier transform (FFT) analysis of phase current are with results obtained from finite-element method (FEM).

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.108-115
• /
• 1990

This paper describes the design and fabrication of a processing element that will be used as a component in the construction of a two dimensional systolic for FFT. The chip performs data shuffling and radix-2 decimation-in-time (DIT) butterfly arithmetic. It consists of a data routing unit, internal control logic and HBA unit which computes butterfly arithmetic. The 6.5K transistors processing element designed with standard cells has been fabricated with a 2u'm double metal CMOS process, and evaluated by wafer probing measurements. The measured characteristics show that a HBA can be computed in 0.5 usec with a 20MHz clok, and it is estimated that the FFT of length 1024 can be transformed in 11.2 usec.