• The Pure and Applied Mathematics
• /
• v.11 no.1
• /
• pp.89-96
• /
• 2004

We prove de Leeuw's restriction theorem result Jodeit, Jr. [4] for multipliers on $H^{p}$ spaces, p＜1.

• Journal of the Korean Mathematical Society
• /
• v.37 no.4
• /
• pp.531-544
• /
• 2000

• Communications of the Korean Mathematical Society
• /
• v.12 no.1
• /
• pp.59-67
• /
• 1997

Let $K'_M$ be the space of distributions on $R^m$ which grow no faster than $e^{M(kx)}$ for some k > 0 and an index function M(x) and $K'_M$ be the Fourier transform of $K'_M$. We establish the characterizations of the space $O_M(K'_m;K'_M)$ of multipliers in $K'_M$.

• ETRI Journal
• /
• v.32 no.1
• /
• pp.1-10
• /
• 2010

In this paper, we present a fast Fourier transform (FFT) processor with four parallel data paths for multiband orthogonal frequency-division multiplexing ultra-wideband systems. The proposed 128-point FFT processor employs both a modified radix-$2^4$ algorithm and a radix-$2^3$ algorithm to significantly reduce the numbers of complex constant multipliers and complex booth multipliers. It also employs substructure-sharing multiplication units instead of constant multipliers to efficiently conduct multiplication operations with only addition and shift operations. The proposed FFT processor is implemented and tested using 0.18 ${\mu}m$ CMOS technology with a supply voltage of 1.8 V. The hardware- efficient 128-point FFT processor with four data streams can support a data processing rate of up to 1 Gsample/s while consuming 112 mW. The implementation results show that the proposed 128-point mixed-radix FFT architecture significantly reduces the hardware cost and power consumption in comparison to existing 128-point FFT architectures.

• Journal of the Korean Mathematical Society
• /
• v.42 no.3
• /
• pp.599-619
• /
• 2005

We define the convolutions of Fourier hyperfunctions and show that every strongly decreasing Fourier hyperfunction is a convolutor for the space of Fourier hyperfunctions and the converse is true. Also we show that there are no differential operator with constant coefficients which have a fundamental solution in the space of strongly decreasing Fourier hyperfunctions. Lastly we show that the space of multipliers for the space of Fourier hyperfunctions consists of analytic functions extended to any strip in $\mathbb{C}^n$ which are estimated with a special exponential function exp$(\mu|\chi|)$.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.4
• /
• pp.839-857
• /
• 2010

We give a set of continuous characterizations for the homogeneous Triebel-Lizorkin spaces and use them to study boundedness properties of Fourier multiplier operators whose symbols satisfy a generalization of H$\ddot{o}$rmander's condition. As an application, we give new direct proofs of the imbedding theorems of the Sobolev type.

• Journal of KSNVE
• /
• v.6 no.6
• /
• pp.771-779
• /
• 1996

In this paper, double Fourier sine series is used as a modal displacement functions of a rectangular plate and applied to the free vibration analysis of a rectangular plate under various boundary conditions. The method of stationary potential energy is used to obtain the modal displacements of a plate. To enhance the flexibility of the double Fourier sine series, Lagrangian multipliers are utilized to match the geometric boundary conditions, and Stokes' transformation is used to handle the displacements that are not satisfied by the double Fourier sine series. The frequency parameters and mode shapes obtained by the present method are compared with those obtained by MSC/NASTRAN and other analysis.

• Journal of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.615-623
• /
• 1995

Consider a function m defined in $R^n$ and the associated convolution operator T given by the Fourier transform $\hat{T} = m\hat{f}$.

• Journal of the Korean Data and Information Science Society
• /
• v.8 no.1
• /
• pp.9-20
• /
• 1997

Several methods are proposed for optimizing Fourier series estimators with respect to Mean Integrated Square Error metrics. Traditionally, such method have followed. one of two basic strategies; A stopping rules or the rules of determine multipliers. A central hypothesis of this study is that better estimates can be obtained by combining the two strategies. A new multiplier sequence is proposed, which used in conjunction with any of the stopping rules, is shown to improve the performance of estimator which relies solely on a stopping rule.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.11
• /
• pp.11-18
• /
• 2007

FFT(Fast Fourier Transform) processor is one of the key components in the implementation of OFDM systems such as WiBro, DAB and UWB systems. Most of the researches on the implementation of FFT processors have focused on reducing the complexities of multipliers, memory and control circuits. In this paper, to reduce the memory size required for IFFT(Inverse Fast Fourier Transform), we propose a new IFFT design method based on a mapping method. By simulations, it is shown that the reposed IFFT design method achieves more than 60% area reduction and much SQNR(Signal-to-Quantization-Noise Ratio) gain compared with previous IFFT circuits.