• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제11권1호
• /
• pp.89-96
• /
• 2004

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

• 대한수학회지
• /
• 제37권4호
• /
• pp.531-544
• /
• 2000

• 대한수학회논문집
• /
• 제12권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
• /
• 제32권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.

• 대한수학회지
• /
• 제42권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|)$.

• 대한수학회보
• /
• 제47권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.

• 소음진동
• /
• 제6권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.

• 대한수학회지
• /
• 제32권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
• /
• 제8권1호
• /
• pp.9-20
• /
• 1997

밀도함수를 추정하는 방법에 있어서 퓨리에(Fourier) 급수기법과 핵(kernel) 기법, 스플라인(spline)평활기법들이 많은 통계학자들의 관심의 대상이 되어 왔다. 이 연구는 확률밀도함수의 추정에 있어서 전통적으로 각각 독립적으로 사용하여 왔던 정진규칙(stopping rule)과 승수규칙(selection multiplier)을 조합하여 퓨리에 급수기법을 이용한 새로운 추정기법을 연구하였다. 모의 실험을 통해 제시된 추정기법이 기존의 연구기법들보다 다소 우월 하다는 결론을 얻었다.

• 대한전자공학회논문지TC
• /
• 제44권11호
• /
• pp.11-18
• /
• 2007

FFT(Fast Fourier Transform) 프로세서는 WiBro, DAB, UWB와 같은 OFDM 시스템의 구현에 있어 중요한 블록 중 하나이다. 현재, FFT 프로세서의 구현에 관한 연구는 계속 이루어지고 있으며 대부분의 연구들은 곱셈기의 수나 면적감소, 메모리 사이즈 감소, 제어회로를 감소시키는 것에 초점을 두어 진행되고 있다. 본 논문에서는 IFFT(Inverse Fast Fourier Transform)에서 요구되는 메모리를 감소시키기 위하여 mapping 방법을 토대로 한 새로운 IFFT 설계방법을 제안한다. WiBro를 위한 1024포인트 IFFT를 설계하기 위해 $Radix-2^4$ SDF(Single-Path Delay Feedback) 구조를 사용하여 시뮬레이션하였으며 제안된 IFFT 설계방법으로 구현했을 시 기존의 방법으로 설계했을 때와 비교하여 메모리가 차지하는 면적에서 60%이상의 감소와 입력비트별로 다양한 SQNR(Signal-to-Quantization-Noise Ratio) 이득을 보였다.