• 호남수학학술지
• /
• 제35권2호
• /
• pp.179-200
• /
• 2013

Let $C[0,t]$ denote the function space of all real-valued continuous paths on $[0,t]$. Define $X_n:C[0,t]{\rightarrow}\mathbb{R}^{n+1}$ by $Xn(x)=(x(t_0),x(t_1),{\cdots},x(t_n))$, where $0=t_0$ < $t_1$ < ${\cdots}$ < $t_n$ < $t$ is a partition of $[0,t]$. In the present paper, using a simple formula for the conditional expectation given the conditioning function $X_n$, we evaluate the $L_p(1{\leq}p{\leq}{\infty})$-analytic conditional Fourier-Feynman transform and the conditional convolution product of the cylinder functions which have the form $$f((v_1,x),{\cdots},(v_r,x))\;for\;x{\in}C[0,t]$$, where {$v_1,{\cdots},v_r$} is an orthonormal subset of $L_2[0,t]$ and $f{\in}L_p(\mathbb{R}^r)$. We then investigate several relationships between the conditional Fourier-Feynman transform and the conditional convolution product of the cylinder functions.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.807-810
• /
• 1998

This paper propose the method to produce GRM(Generalized Reed-Muller)expansion. The general method to obtain GRM expansion coefficient for p valued n variable is derivation of single variable transform matrix and expand it n times using Kronecker product. In this case the size of matrix increases depending on the augmentation of variables. In this paper we propose the simple algorithm to produce GRM coefficient using a single variable transform matrix.

• 대한전자공학회논문지
• /
• 제21권6호
• /
• pp.70-77
• /
• 1984

This paper represents a fast computational algorithm for the discrete sine transform defined by Kekre and Solanki. Techniques are developed to factor the discrete sine trans form matrix into M=log2 2N matrices, where the number(N) of sampled data points is a power of two. Each factorial matrix contains not more than two non-zero real elem tints in any row or column. As a result of this method, the exact a배orithm for the fast discrete sine transform is accomplished. The algorithm is illustiated by a signal flow graph, which may be readily translated to hardware or software implementation.

• 대한수학회논문집
• /
• 제12권2호
• /
• pp.311-324
• /
• 1997

We show that if $f \in L^{\infty}(D^n)$ satisfies Sf = rf for some r in the unit circle, where S is any convex combination of the iterations of Berezin operator, then f is n-harmonic. And we give some remarks and a conjecture on the space $M_2={f \in L^2(D^2, m \times m)\midBf = f$.

• 대한수학회지
• /
• 제43권5호
• /
• pp.967-990
• /
• 2006

In this paper, we evaluate first variations, conditional first variations and conditional Fourier-Feynman transforms of cylinder type functions over Wiener paths in abstract Wiener space and then, investigate relationships among first variation, conditional first variation, Fourier-Feynman transform and conditional Fourier-Feynman transform of those functions. Finally, we derive the conditional Fourier-Feynman transform for the product of cylinder type function which defines the functions in a Banach algebra introduced by Yoo, with n linear factors.

• 충청수학회지
• /
• 제35권2호
• /
• pp.177-196
• /
• 2022

The Elzaki Transform method is fuzzified to fuzzy Elzaki Transform by Rehab Ali Khudair. In this article, we propose a Double fuzzy Elzaki transform (DFET) method to solving fuzzy partial differential equations (FPDEs) and we prove some properties and theorems of DFET, fundamental results of DFET for fuzzy partial derivatives of the n^th order, construct the Procedure to find the solution of FPDEs by DFET, provide duality relation of Double Fuzzy Laplace Transform (DFLT) and Double Fuzzy Sumudu Transform(DFST) with proposed Transform. Also we solve the Fuzzy Poisson's equation and fuzzy Telegraph equation to show the DFET method is a powerful mathematical tool for solving FPDEs analytically.

• 한국통신학회논문지
• /
• 제30권9C호
• /
• pp.860-870
• /
• 2005

본 논문에서는 karnaugh map(k-map)상의 셀을 이용하여 $2^{n}$개의 서로 다른 극수(polarity)를 갖는 GRM(Generalized Reed-Muller)상수를 생성하는 새로운 기법을 제안하였다. n개의 입력변수에 대한 일반적인 GRM 함수의 생성 방법은 단일 변수에 대한 변환 행렬을 구하고 이를 n번의 Kronecker 곱을 행한 변환 행렬을 이용하여 GRM 상수를 구하는 것이다. 이런 방법을 사용하는 경우, 변수의 숫자가 증가함에 따라 변환 행렬의 차수가 $2^{n}\times2^{n}$로 커지는 단점을 갖는다. 이에 반하여 본 논문에서는 k-map상에서 변수를 축약시킨 셀 [$f_{i}$]을 구하고 이를 단일 변수 변환 행렬과 연산하여 GBM 상수를 구하는 새로운 기법을 제안한다. 본 논문에서 제안한 새로운 방법과 타 논문과의 비교를 한 결과, 기존 방법은 가산기, 승산기, KP(Kronecker 곱 승산기)회로가 필요한데 반하여 본 논문에서는 가산기만이 필요하므로 효율적인 VLSI 설계에 유리하다

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.727-730
• /
• 1998

In this paper, we propose an implementation of an efficient parallel Radon transform on TMS320C80-based system. For an N$\times$N SAR image, we can obtain O(NM/p) of the conventional parallel Radon transform, by representing the projection patterns in Radon space variables instead of the image space variables, and pipelining the algorithm, where p is the number of processors and M is the number of projection angles. Also, we can reduce the time for the dynamic load distribution among the nodes and the communication overheads of accessing the global memories, by pipelining the memory and processing operations by using tripple buffer structure. Experimental results show an efficient parallel Radon transform of speedup Sp=3.9 and efficiency E=97.5% for 256$\times$256 image, when implemented on TMS320C80 composed of four parallel slave processors with three memory blocks.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.745-748
• /
• 1998

Recently, image and voice processing part is using wavelet transform. We propose thining algorithm using wavelet tranform. Wavelet transform consists of low frequency and high frequency in the spatial and frequency domain. After the wavelet decomposition, more than 90 percents of energy are contained in lowest frequency band. Therefor, for images with large difference of gray value between foreground and background like character images, we can more accurately in the lowest frequency band. Lowest frequency band has wavelet transform significant coefficient(WTS) that is required for the thinning algorithm we proposed Paper [3][5][7][8] can not separate consonants and vowels of korean characters. Becuase korean characters have structural feature. This paper can separate consonants and vowels. Simulation executed low frequency image and data compression can reduce 1/4$^{n}$ with level n. we can redcue time complexity 3/8.

• Kyungpook Mathematical Journal
• /
• 제46권1호
• /
• pp.49-56
• /
• 2006

The aim of the present work is to obtain the inverse Laplace transform of the product of the factors of the type $s^{-\rho}\prod\limit_{i=1}^{\tau}(s^{li}+{\alpha}_i)^{-{\sigma}i}$, a general class of polynomials an the multivariable H-function. The polynomials and the functions involved in our main formula as well as their arguments are quite general in nature. On account of the general nature of our main findings, the inverse Laplace transform of the product of a large variety of polynomials and numerous simple special functions involving one or more variables can be obtained as simple special cases of our main result. We give here exact references to the results of seven research papers that follow as simple special cases of our main result.