• Journal of electromagnetic engineering and science
• /
• v.4 no.1
• /
• pp.23-29
• /
• 2004

In this paper we analyze convergence constraints and time constant of IT-LMS algorithm and derive a method of making it's time constant independent of signal power by using input variance estimation. The method for estimating the input variance is to use a single-pole low-pass filter(LPF) with common smoothing parameter value, θ. The estimator is with narrow bandwidth for large θ but with wide bandwidth for small θ. This small θ gives long term average estimation(low frequency) of the fluctuating input variance well as short term variations (high frequency) of the input power. In our simulations of multipath communication channel equalization environments, the method with large θ has shown not as much improved convergence speed as the speed of the original IT-LMS algorithm. The proposed method with small θ=0.01 reach its minimum MSE in 100 samples whereas the IT-LMS converges in 200 samples. This shows the proposed, tap-power normalized IT-LMS algorithm can be applied more effectively to digital wireless communication systems.

• Journal of applied mathematics & informatics
• /
• v.34 no.1_2
• /
• pp.1-7
• /
• 2016

Some properties of filters are studied with respect to a congru-ence of BE-algebras. The notion of θ-filters is introduced and these classes of filters are then characterized in terms of congruence classes. A bijection is obtained between the set of all θ-filters of a BE-algebra and the set of all filters of the respective BE-algebra of congruences classes.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.3
• /
• pp.39-47
• /
• 2000

In this paper, we propose a new method of finding the true length of the line and long axis of the ellipse at the $\theta$=$\theta$o＋ 90$^{\circ}$ and short axis of the ellipse at the $\theta$ = $\theta$o from the Hough transform (HT) results. Through the simulations, we showed that the true length of the line and ellipse could be obtained with 98 % accuracy by using the distance from the maximum envelope to the minimum envelope. To compare the simulation results with the experimental results, we performed optical experiments by using a HT CGH filter. Through the experiments, we showed that our results were very similar to those of the simulation.

• Communications of the Korean Mathematical Society
• /
• v.26 no.1
• /
• pp.135-149
• /
• 2011

Using (r, s)-preopen sets [14] and pre-${\omega}_t$-closures [6], a new kind of covering property $P^t_{({\omega}_r,s)}$-closedness is introduced in a bitopological space and several characterizations via filter bases, nets and grills [30] along with various properties of such concept are investigated. Two new types of cluster sets, namely pre-(${\omega}_r$, s)t-${\theta}_f$-cluster sets and (r, s)t-${\theta}_f$-precluster sets of functions and multifunctions between two bitopological spaces are introduced. Several properties of pre-(${\omega}_r$, s)t-${\theta}_f$-cluster sets are investigated and using the degeneracy of such cluster sets, some new characterizations of some separation axioms in topological spaces or in bitopological spaces are obtained. A sufficient condition for $P^t_{({\omega}_r,s)}$-closedness has also been established in terms of pre-(${\omega}_r$, s)t-${\theta}_f$-cluster sets.