• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.19 no.3
• /
• pp.294-303
• /
• 2008

ISAR(Inverse Synthetic Aperture Radar) images represent the 2-D(two-dimensional) spatial distribution of RCS (Radar Cross Section) of an object, and they can be applied to the problem of target identification. A traditional approach to ISAR imaging is to use a 2-D IFFT(Inverse Fast Fourier Transform). However, the 2-D IFFT results in low resolution ISAR images especially when the measured frequency bandwidth and angular region are limited. In order to improve the resolution capability of the Fourier transform, various high-resolution spectral estimation approaches have been applied to obtain ISAR images, such as AR(Auto Regressive), MUSIC(Multiple Signal Classification) or Modified MUSIC algorithms. In this study, these high-resolution spectral estimators as well as 2-D IFFT approach are combined with a recently developed ISAR image classification algorithm, and their performances are carefully analyzed and compared in the framework of radar target recognition.

• Bulletin of the Korean Mathematical Society
• /
• v.61 no.2
• /
• pp.529-540
• /
• 2024

In this paper, using the Fourier transform, inverse Fourier transform and Littlewood-Paley decomposition technique, we prove the boundedness of bilinear pseudodifferential operators with symbols in the bilinear Hörmander class $BS^{m}_{1,1}$ in variable Triebel-Lizorkin spaces and variable Besov spaces.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1617-1623
• /
• 1989

The introduction of the fast Fourier transform(FFT),an efficient computational algorithm for the discrete Fourier transform(DFT) by Cooley and Tukey(1965), has brought to the limelight various other discrete transforms. Some of the analog functions from which these transforms have been derived date back to the early 1920's, for example, Walsh functions (Walsh, 1923) and Hadamard Transform(Enomoto et al, 1965). Fast algorithms developed for the forward transform are equally applicable, exept for minor changes, to the inverse transform. In this paper, we present a simple pipelined Hadamard matrix(HM) which is used to develop a fast algorithm for the Hadamard Processor (HP). The Fast Hadamard Transform(FHT) can be derived using matrix partitioning techniques. The HP system is incorporated through a modular design which permits tailoring to meet a wide range of video data link applications. Emphasis has been placed on a low cost, a low power design suitable for airbone system and video codec.

• Geophysics and Geophysical Exploration
• /
• v.21 no.1
• /
• pp.1-7
• /
• 2018

In the two-dimensional (2D) modeling of electrical method, the potential in the space domain is reconstructed with the calculated potentials in the wavenumber domain using inverse Fourier transform. The inverse Fourier integral is numerically evaluated using the transformed potential at different wavenumbers. In order to improve the precision of the integration, either the logarithmic or exponential approximation has been used depending on the size of wavenumber. Two numerical methods have been generally used to evaluate the integral; interval integration and Gaussian quadrature. However, both methods do not consider the distance from the current source. Thus the resulting potential in the space domain shows some error. Especially when the distance from the current source is very small or large, the error increases abruptly and the evaluated potential becomes extremely unstable. In this study, we developed a new method to calculate the integral accurately by introducing the distance from the current source to the rescaled Gauss abscissa and weight. The numerical tests for homogeneous half-space model show that the developed method can yield the error level lower than 0.4 percent over the various distances from the current source.

• Bulletin of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.345-362
• /
• 1998

We introduce and anlyze a naturally parallelizable frequency-domain method for parabolic problems with a Neumann boundary condition. After taking the Fourier transformation of given equations in the space-time domain into the space-frequency domain, we solve an indefinite, complex elliptic problem for each frequency. Fourier inversion will then recover the solution of the original problem in the space-time domain. Existence and uniqueness of a solution of the transformed problem corresponding to each frequency is established. Fourier invertibility of the solution in the frequency-domain is also examined. Error estimates for a finite element approximation to solutions fo transformed problems and full error estimates for solving the given problem using a discrete Fourier inverse transform are given.

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

• Proceedings of the KOSOMBE Conference
• /
• v.1990 no.11
• /
• pp.5-10
• /
• 1990

The object detection capabilities of ultrasonic imaging systems are limited by the ability of the detection process to distinguish the resolved object signals from backscattered speckle noise. It has been shown that the phase component of the Fourier transform of the speckle noise is random. Based on this property. we propose a new algorithm for distinguishing between speckle and specular targets. The proposed algorithm is implemented by taking the Fourier transform of the received signal, low-pass filtering the phase, and taking the inverse Fourier transform of the filtered phase to enhance specular reflectors and reduce speckle in the image. Simulations and experiments using phantoms confirm the algorithm yielding significant reduction of speckle noise.

• Journal of applied mathematics & informatics
• /
• v.37 no.5_6
• /
• pp.507-519
• /
• 2019

The ground for this paper is to examine the generalized Stokes' first and second issues for an incompressible couple pressure liquid under isothermal conditions. Exact solutions for each problem are acquired by using the Laplace transform (LT) with respect to the time variable t and the sine Fourier transform (FT) with respect to the y-variable. Further, a comparison is given of the obtained results and the results of Devakar and Lyengar [1] and by using the four inverse Laplace transform algorithms (Stehfest's, Tzou's, Talbot, Fourier series) in the space time domain utilizing a numerical methodology. Moreover, velocity profiles are plotted and considered for various occasions and distinctive estimations of couple stress parameters. At the end, the outcomes are exhibited by graphs and in tabular forms.

• Journal of Satellite, Information and Communications
• /
• v.7 no.3
• /
• pp.26-29
• /
• 2012

In this paper, we propose a Single Carrier Frequency Division Multiple Access(SC-FDMA) scheme with greatly enhanced tolerance of timing offset among the users. The type of the proposed scheme is similar to code spread Multiple Carrier Direct Spread Code Division Multiple Access(MC DS CDMA). The proposed scheme performs partial Discrete Fourier Transform(DFT) in order to solve high Peak to Average Power Ratio(PAPR) of the MC DS CDMA before Inverse Fast Fourier Transform(IFFT). Exploiting the property Properly Scrambled Walsh-Hadamard(PSW) code has zero correlation despite ${\pm}1$ chip timing offset, the proposed scheme achieves Multiple Access Interference free performance with the timing offset up to ${\pm}1$ OFDM symbol duration with low PAPR. In contrast, the other existing schemes in comparison undergo severe performance degradation even with small timing offset in multipath fading channel.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.28 no.6
• /
• pp.444-451
• /
• 2017

In this paper, we have evaluated and analyzed OTFS(Orthogonal Time Frequency Space) modulation and OTFS-MIMO(Multiple Input Multiple Output) system. OTFS modulation can concisely compensate delay-Doppler spreading effect by using 2D(2-Dimension) iDFT (inverse Discrete Fourier Transform) and DFT(Discrete Fourier Transform) operation. It enables OTFS system to transmit high-speed data. Especially, OTFS-MIMO system can transmit all data streams without performance degradation on high Doppler frequency channel. As simulation results, we have confirmed that $1{\times}1$ OTFS system's achievable rate is a similar to each stream of $2{\times}2$ OTFS-MIMO system. That is, we have also confirmed that $2{\times}2$ MIMO system can completely achieve double achievable rate in comparison with OTFS system on high Doppler frequency channel.