• MALSORI
• /
• no.51
• /
• pp.85-98
• /
• 2004

It is almost impossible to generate the sound field effect in real time with the time-domain linear convolution because of its large multiplication operation requirement. To solve this, three methods are introduced to reduce the number of multiplication operations in this paper. Firstly, the time-domain linear convolution is replaced with the frequency-domain circular convolution. In other words, the linear convolution result can be derived from that of the circular convolution. This technique reduces the number of multiplication operations remarkably, Secondly, a subframe concept is introduced, i.e., one original frame is divided into several subframes. Then the FFT is executed for each subframe and, as a result, the number of multiplication operations can be reduced. Finally, the QFT is used in stead of the FFT. By combining all the above three methods into our final the SFE generation algorithm, the number of computations are reduced sufficiently and the real-time SFE generation becomes possible with a general PC.

• Journal of the Korean Mathematical Society
• /
• v.37 no.3
• /
• pp.371-389
• /
• 2000

Working within classical distribution theory, we develop notions of multiplication and convolution for tempered distributions which are general enough to encompass the classical cases -such as pointwise multiplication of continuous functions or the convolution of $L^1$ functions- which most textbook treatments of distribution theory leave out. Pains are taken to develop a theory which satisfies the commutative and asociative laws.

• Kyungpook Mathematical Journal
• /
• v.56 no.1
• /
• pp.147-159
• /
• 2016

In this paper, we obtained some properties for subclasses of starlike functions defined by convolution such as partial sums, integral means, square root and integral transform for these classes.

• Journal of the Korean Mathematical Society
• /
• v.57 no.3
• /
• pp.655-668
• /
• 2020

In this paper, we establish the generalized Cameron-Storvick type theorem on function space. We then give relationships involving the generalized Cameron-Storvick type theorem, modified generalized integral transform and modified convolution product. A motivation of studying the generalized Cameron-Storvick type theorem is to generalize formulas and results with respect to the modified generalized integral transform on function space. From the some theories and formulas in the functional analysis, we can obtain some formulas with respect to the translation theorem of exponential functionals.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.2
• /
• pp.349-362
• /
• 2010

We establish the various relationships among the integral transform ${\mathcal{F}}_{{\alpha},{\beta}}F$, the convolution product $(F*G)_{\alpha}$ and the first variation ${\delta}F$ for a class of functionals defined on K(Q), the space of complex-valued continuous functions on $Q=[0,S]{\times}[0,T]$ which satisfy x(s, 0) = x(0, t) = 0 for all $(s,t){\in}Q$. And also we obtain Parseval's and Plancherel's relations for the integral transform of some functionals defined on K(Q).

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.5
• /
• pp.835-844
• /
• 2009

The ridgelet transform is extended to the space of square integrable Boehmians. It is proved that the extended ridgelet transform $\mathfrak{R}$ is consistent with the classical ridgelet transform R, linear, one-to-one, onto and both $\mathfrak{R}$, $\mathfrak{R}^{-1}$.1 are continuous with respect to $\delta$-convergence as well as $\Delta$-convergence.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.2
• /
• pp.125-133
• /
• 1996

In this paper, we dicuss on the properties related to the circular filtering in orthogonal transform domain. The efficient filtering schemes in six orthogonal transform domains are presented by generalizing the convolution-multiplication property of the DFT. In brief, the circular filtering can be accomplished by multiplying the transform domain filtering matrix W, which is shown to be very sparse, yielding the computational gains compared with the time domain processing. As an application, decimation and interpolation techniques in orthogonal transform domains are also investigated.

• Proceedings of the KIEE Conference
• /
• 1988.11a
• /
• pp.131-134
• /
• 1988

This Paper describes a algorithm for evaluating the loss of load probability of a generating system using Fast Hartley Transform. The Fast Hartley Transform(FHT) Is as fast as or faster than the Fast Fourier Transform(FHT) and serves for all the uses such as spectral, digital processing and convolution to which the FFT is at present applied. The method has been tested by applying to IEEE reliability test system and the effectiveness is demonstrated.

• The Pure and Applied Mathematics
• /
• v.28 no.2
• /
• pp.119-142
• /
• 2021

In this paper, we first introduce a new L_p analytic Fourier-Feynman transform with respect to subordinate Brownian motion (AFFTSB), which extends the Fourier-Feynman transform in the Wiener space. We next examine several relationships involving the L_p-AFFTSB, the convolution product, and the gradient operator for several types of functionals.

• ETRI Journal
• /
• v.4 no.3
• /
• pp.18-29
• /
• 1982

In a block adaptive filtering procedure, the filter coefficients are adjusted once per each output block while maintaining performance comparable to that of widely used LMS adaptive filtering in which the filter coefficients are adjusted once per each output data sample. An efficient implementation of block adaptive filter is possible by means of discrete transform technique which has cyclic convolution property and fast algorithms. In this paper, the block adaptive filtering using Fermat Number Transform (FNT) is investigated to exploit the computational efficiency and less quantization effect on the performance compared with finite precision FFT realization. And this has been verified by computer simulation for several applications including adaptive channel equalizer and system identification.