• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.86.4-86
• /
• 2002

1. Review of one dimensional M-transform 2. Definition of two dimensional(2D)M-transform 3. Properties of 2D M-transform 4. Mean, Autocorrelation 5. Crosscorrelation of input and output of a system 6. Application to fault detection of mechanical shape

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.497-501
• /
• 2003

In this paper, impulse response of giant magnetostrictive material (GMM) is identified by using M-transform. First, the displacement of GMM was measured by using the dual frequency laser interferometer. The noise included in the measured signal was removed by using M-transform. The impulse response of the GMM was identified from the input current of the driving coil and the displacement.

• 제어로봇시스템학회:학술대회논문집
• /
• 1999.10a
• /
• pp.234-237
• /
• 1999

In this paper, a new method for identification of two-dimensional(2D) impulse response is presented. As is well known, identification of 2D impulse response is an important and necessary theme for image processing or signal processing. Here, the authors extend M-transform which has been proposed by some of the authors to 2D case where an image is used instead of signal, and M-array is used instead of M-sequence. Firstly, we show that 2D impulse response can be obtained by use of M-array. Next 2D M-transform is defined where any 2D image can be considered to be the output of 2D filter whose input is 2D M-array. Simulation results show the effectiveness of identification of 2D impulse response by either using M-array or by 2D M-transform.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.5
• /
• pp.415-419
• /
• 2001

This paper proposes and adaptive nonlinear equalizer based on Volterra Series along with M-band wavelet transform(M-DWT). The proposed wavelet transform-domain approach leads to diagonalization of the input vector auto-correlation matrix, which yields clustering its eigenvalue spread around one, and improving the convergence rate of the corresponding transform-domain LMS algorithm. In particular, the proposed adaptive Volterra equalizer is employed to compensate for the output distortion produced by a weakly nonlinear system. Finally, some simulation results obtained by using a TWT amplifier model are provide to demonstrated the converging performance of the proposed approach.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.3
• /
• pp.519-524
• /
• 2009

In multivariate analysis, the inversion formula of the Stieltjes transform is used to find the density of a spectral distribution of random matrices of sample covariance type. Let $B_{n}\;=\;\frac{1}{n}Y_{m}^{T}T_{m}Y_{m}$ where $Ym\;=\;[Y_{ij}]_{m{\times}n}$ is with independent, identically distributed entries and $T_m$ is an $m{\times}m$ symmetric nonnegative definite random matrix independent of the $Y_{ij}{^{\prime}}s$. In the present paper, using the inversion formula of the Stieltjes transform, we will find the density function of the limiting distribution of $B_n$ away from zero.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.6
• /
• pp.127-140
• /
• 2003

This paper develops a novel algorithm of computing 2 Dimensional Discrete Cosine Transform (2D-DCT) via Polynomial Transform (PT) converting 2D-DCT to the sum of 1D-DCTs. In computing N${\times}$M size 2D-DCT, the conventional row-column algorithm needs 3/2NMlog$_2$(NM)-2NM＋N＋M additions and 1/2NMlog$_2$(NM) additions and 1/2NMlog$_2$(NM) multiplications, while the proposed algorithm needs 3/2NMlog$_2$M＋NMlog$_2$N-M-N/2＋2 additions and 1/2NMlog$_2$M multiplications The previous polynomial transform needs complex operations because it applies the Euler equation to DCT. Since the suggested algorithm exploits the modular regularity embedded in DCT and directly decomposes 2D DCT into the sum of ID DCTs, the suggested algorithm does not require any complex operations.

• Honam Mathematical Journal
• /
• v.46 no.3
• /
• pp.335-348
• /
• 2024

This paper deals with a new extension of the generalized Bessel-Maitland function (EGBMF) associated with the beta function. We evaluated integral representations, recurrence relation and integral transforms such as Mellin transform, Laplace transform, Euler transform, K-transform and Whittaker transform. Furthermore, the Riemann-Liouville fractional integrals are also discussed.

• International Journal of Reliability and Applications
• /
• v.13 no.1
• /
• pp.49-56
• /
• 2012

Using total time on test transform (TTT), a new approach is taken for testing exponentiality versus the unknown age, exponential better than equilibrium life in convex ordering (EBELC). Selected critical values are tabulated for sample size n =2(2)50 and powers of the test are estimated for some commonly used distributions in reliability. Finally real example is presented to illustrate the theoretical results.

• Journal of Broadcast Engineering
• /
• v.16 no.4
• /
• pp.647-656
• /
• 2011

Motion estimation using one-bit transform and two-bit transform reduces the complexity for computation of matching error; however, the peak signal-to-noise ratio (PSNR) is degraded. Modified 1BT (M1BT) and modified 2BT (M2BT) have been proposed to compensate degraded PSNR by adding conditional local search. However, these algorithms require many additional search points in fast moving sequences with a block size of $16{\times}16$. This paper provides more efficient search method by preparing candidate blocks using the number of non-matching points (NNMP) than the conditional local search. With this NNMP-based search, we can easily obtain candidate blocks with small NNMP and efficiently search final motion vector. Experimental results show that the proposed algorithm not only reduces computational complexity, but also improves PSNR on average compared with conventional search algorithm used in M1BT, M2BT and AM2BT.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2620-2623
• /
• 2000

The standard approach consists of using correlation of orthogonal functions in digital filtering, such as well-known FFT(Fast Fourier Transform) and FWT(Fast Walsh Transform). But it needs much calculations, multiplications and additions. The calculation amount is m $log_2m$ in the general case. Therefore, this requires high speed processors to calculate in real time, which can calculate floating point. This study developed improved fast Walsh transform based on dyadic-ordered fast Walsh transform, then regenerated signal flow graph of improved fast Walsh transform, and used it for digital filtering, and then measured fundamental frequency and harmonics for current and voltage signals of power system.