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

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.745-748
• /
• 1999

This paper propose the method to derive RM(Reed-Muller) expansion coefficients for Multiple-Valued function. The general method to obtain RM expansion coefficient for p valued n variable is derivation of single variable transform matrix and expand it n times using Kronecker product. The transform matrix used is p$^{n}$ $\times$ p$^{n}$ matrix. In this case the size of matrix increases depending on the augmentation of variables and the operation is complicated. Thus, to solving the problem, we propose derivation of RM expansion coefficients using p$\times$p transform matrix and Karnaugh-map.

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

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.113-119
• /
• 2010

If f is M-harmonic and integrable with respect to a weighted radial measure $\upsilon_{\alpha}$ over the unit ball $B_n$ of $\mathbb{C}^n$, then $\int_{B_n}(f\circ\psi)d\upsilon_{\alpha}=f(\psi(0))$ for every $\psi{\in}Aut(B_n)$. Equivalently f is fixed by the weighted Berezin transform; $T_{\alpha}f = f$. In this paper, we show that if a function f defined on $B_n$ satisfies $R(f\circ\phi){\in}L^{\infty}(B_n)$ for every $\phi{\in}Aut(B_n)$ and Sf = rf for some |r|=1, where S is any convex combination of the iterations of $T_{\alpha}$'s, then f is M-harmonic.

• Journal of the Korean Mathematical Society
• /
• v.59 no.5
• /
• pp.927-944
• /
• 2022

Let $\vec{p}{\in}(0,\;1]^n$ be an n-dimensional vector and A a dilation. Let $H^{\vec{p}}_A(\mathbb{R}^n)$ denote the anisotropic mixed-norm Hardy space defined via the radial maximal function. Using the known atomic characterization of $H^{\vec{p}}_A(\mathbb{R}^n)$ and establishing a uniform estimate for corresponding atoms, the authors prove that the Fourier transform of $f{\in}H^{\vec{p}}_A(\mathbb{R}^n)$ coincides with a continuous function F on ℝⁿ in the sense of tempered distributions. Moreover, the function F can be controlled pointwisely by the product of the Hardy space norm of f and a step function with respect to the transpose matrix of A. As applications, the authors obtain a higher order of convergence for the function F at the origin, and an analogue of Hardy-Littlewood inequalities in the present setting of $H^{\vec{p}}_A(\mathbb{R}^n)$.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.165-168
• /
• 2000

A fast estimation method using wavelet transform for a time delay system is proposed. Main point of this method is to get the wavelet transform of the correlation between the input signal and delayed signal using transformed signals. But wavelet transform using Haar wavelet functions has basis with different phases and can offers a bisection method to estimate a time delay of a signal. Selective computation of the transform of correlation is performed and the computational complexity is reduced. Computational order of this method is O(N log N) and it is much love. than a simple correlation esimation when the length of signal is long.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.769-772
• /
• 2001

Waish-Hadamard Transform은 압축, 필터링, 코드 디자인 등 다양한 이미지처리 분야에 응용되어왔다. 이러한 Hadamard Transform을 기본으로 확장한 Jacket Transform은 행렬의 원소에 가중치를 부여함으로써 Weighted Hadamard Matrix라고 한다. Jacket Matrix의 cocyclic한 특성은 암호화, 정보이론, TCM 등 더욱 다양한 응용분야를 가질 수 있고, Space Time Code에서 대역효율, 전력면에서도 효율적인 특성을 나타낸다 [6],[7]. 본 논문에서는 Distributed Arithmetic(DA) 구조를 이용하여 Fast Jacket Transform(FJT)을 구현한다. Distributed Arithmetic은 ROM과 어큐뮬레이터를 이용하고, Jacket Watrix의 행렬을 분할하고 간략화하여 구현함으로써 하드웨어의 복잡도를 줄이고 기존의 시스톨릭한 구조보다 면적의 이득을 얻을 수 있다. 이 방법은 수학적으로 간단할 뿐 만 아니라 행렬의 곱의 형태를 단지 덧셈과 뺄셈의 형태로 나타냄으로써 하드웨어로 쉽게 구현할 수 있다. 이 구조는 입력데이타의 워드길이가 n일 때, O(2n)의 계산 복잡도를 가지므로 기존의 시스톨릭한 구조와 비교하여 더 적은 면적을 필요로 하고 FPGA로의 구현에도 적절하다.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.25-28
• /
• 2001

A theory of binary wavelets has been recently proposed by using two-band perfect reconstruction filter banks over binary field . Binary wavelet transform (BWT) of binary images can be used as an alternative to the real-valued wavelet transform of binary images in image processing applications such as compression, edge detection, and recognition. The BWT, however, requires large amount of computations since its operation is accomplished by matrix multiplication. In this paper, a fast BWT algorithm which utilizes filtering operation instead or matrix multiplication is presented . It is shown that the proposed algorithm can significantly reduce the computational complexity of the BWT. For the decomposition and reconstruction or an N ${\times}$ N image, the proposed algorithm requires only 2LN$^2$ multiplications and 2(L-1)N$^2$addtions when the filter length is L, while the BWT needs 2N$^3$multiplications and 2N(N-1)$^2$additions.

• Journal of the Korean Mathematical Society
• /
• v.51 no.6
• /
• pp.1321-1322
• /
• 2014

• Korean Journal of Mathematics
• /
• v.31 no.3
• /
• pp.305-311
• /
• 2023

We exhibit some properties of the weighted Berezin transform T_αf on L^∞(B_n) and on L¹(B_n). As the main result, we prove that if f ∈ L^∞(B_n) with lim_k→∞ T^k_αf exists, then there exist unique M-harmonic function g and $h{\in}{\bar{(I-T_{\alpha})L^{\infty}(B_n)}}$ such that f = g + h. We also show that of the norm of weighted Berezin operator T_α on L¹(B_n, ν) converges to 1 as α tends to infinity, where ν is an ordinary Lebesgue measure.