• Honam Mathematical Journal
• /
• v.35 no.3
• /
• pp.435-443
• /
• 2013

We give an $L^p$ Fourier multiplier condition which implies the H$\ddot{o}$rmander-Mikhlin multiplier theorem.

• Korean Journal of Mathematics
• /
• v.16 no.1
• /
• pp.85-90
• /
• 2008

We consider Fourier multiplier operators whose symbols satisfy a generalization of $H{\ddot{o}}rmander^{\prime}s$ condition and establish their Sobolev-type mapping properties on the homogeneous Besov-Lipschitz spaces by making use of a continuous characterization of Besov-Lipschitz spaces. As an application, we derive Sobolev-type imbedding theorem.

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

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.17 no.1
• /
• pp.101-109
• /
• 2017

This paper presents a high-throughput low-complexity 512-point eight-parallel mixed-radix multipath delay feedback (MDF) fast Fourier transform (FFT) processor architecture for orthogonal frequency division multiplexing (OFDM) applications. To decrease the number of twiddle factor (TF) multiplications, a mixed-radix $2^4/2^3$ FFT algorithm is adopted. Moreover, a dual-path shared canonical signed digit (CSD) complex constant multiplier using a multi-layer scheme is proposed for reducing the hardware complexity of the TF multiplication. The proposed FFT processor is implemented using TSMC 90-nm CMOS technology. The synthesis results demonstrate that the proposed FFT processor can lead to a 16% reduction in hardware complexity and higher throughput compared to conventional architectures.

• 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 Advanced Navigation Technology
• /
• v.7 no.2
• /
• pp.141-148
• /
• 2003

This paper presents and compares several techniques that detect the symbol rate of unknown received signal. Symbol rate is detected from the power spectral density of the circuits such as the delay and multiplier circuit, the square law circuit, and analytic signal, etc. As a result of discrete Fourier transform of the output signals of these circuits, a lot of spectral lines and some peaks appear in frequency domain and the position of first peak is corresponding to the symbol rate. If a spectral line on the frequency that is not located in symbol rate is larger than the first peak, the symbol rate is erroneously detected. Thus, the ratio between the value of first peak and the highest side spectral line is used for the measure of the performance of symbol rate detector. For the MPSK modulation, the analytic signal method shows better performance than the delay and multiplier and square law circuits when the received signal power is lager than -20dB. It is also noted that the delay and multiplier circuit is not able to detect the symbol rate for the QAM modulation.

• 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 Institute of Electronics Engineers of Korea SD
• /
• v.44 no.9
• /
• pp.48-53
• /
• 2007

Some digital signal processing applications, such as FFT, request multiplications with a group(or, groups) of a few predetermined coefficients. In this paper, based on the modified CSD algorithm, an efficient multiplier design method for predetermined coefficient groups is proposed. In the multiplier design for sine-cosine generator used in direct digital frequency synthesizer(DDFS), and in the multiplier design used in 128 point $radix-2^4$ FFT, it is shown that the area, power and delay time can be reduced up to 34%.

• Journal of the Korean Mathematical Society
• /
• v.45 no.2
• /
• pp.455-466
• /
• 2008

Current studies on products of analytic functionals have been based on applying convolution products in D' and the Fourier exchange formula. There are very few results directly computed from the ultradistribution space Z'. The goal of this paper is to introduce a definition for the product of analytic functionals and construct a new multiplier space $F(N_m)$ for $\delta^{(m)}(s)$ in a one or multiple dimension space, where Nm may contain functions without compact support. Several examples of the products are presented using the Cauchy integral formula and the multiplier space, including the fractional derivative of the delta function $\delta^{(\alpha)}(s)$ for $\alpha>0$.