• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.457-473
• /
• 2005

In each step of the quasi-minimal residual (QMR) method which uses a look-ahead variant of the nonsymmetric Lanczos process to generate basis vectors for the Krylov subspaces induced by A, it is necessary to decide whether to construct the Lanczos vectors $v_{n+l}\;and\;w{n+l}$ as regular or inner vectors. For a regular step it is necessary that $D_k\;=\;W^{T}_{k}V_{k}$ is nonsingular. Therefore, in the floating-point arithmetic, the smallest singular value of matrix $D_k$, ${\sigma}_min(D_k)$, is computed and an inner step is performed if $\sigma_{min}(D_k)<{\epsilon}$, where $\epsilon$ is a suitably chosen tolerance. In practice it is absolutely impossible to choose correctly the value of the tolerance $\epsilon$. The subject of this paper is to show how discrete stochastic arithmetic remedies the problem of this tolerance, as well as the problem of the other tolerances which are needed in the other checks of the QMR method with the estimation of the accuracy of some intermediate results. Numerical examples are used to show the good numerical properties.

• Journal of Digital Convergence
• /
• v.12 no.9
• /
• pp.209-217
• /
• 2014

As an idea of healing or fatigue recovery, a desire for massage therapy has increased for modern people who complain of pain such as knotted muscles or shoulder discomfort due to fatigue accumulation and stress. To resolve this, although a massage chair has been developed, it does not provide the most efficient massage as it is not suitable for Korean body types. In this paper, this research analyzed massage, assembly, massage intensity, Korean body types and functions of the massage for maximized efficiency to design critical functions. Also, we implemented the action control and algorithm of the massage chair for localization.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.17 no.1
• /
• pp.23-30
• /
• 1980

The reconstruction problem in a low dose case requires some compromise of resolution and noise artifacts, and also some modification of filter kernels depending on the signal-to-noise ratio of projection data. In this paper, ail algorithm for the reconstruction of an image function from noisy projection data is suggested, based on minimum-mean-square error criterion. Modification of the falter kernel is made from information (statistics) obtained from the projection data. The simulation study Proves that this algorithm, based on the Wiener falter approach, provides substantially improved image with reduction of noise as well as improvement of the resolution. An approximate method was also studied which leads to the possible use of a recursive filter in the convolution process of image reconstruction.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.3
• /
• pp.37-43
• /
• 2009

The new still image compression standard JPEG2000 is consisted of DWT and EBCOT. In this paper, proposed and designed new algorithm in efficient EBCOT. BPC based on the contort. Proposed BPC Algorithm is forecasted coding pass using Sigstage, column, mpass value. BAC design apply 4-pipeline stage. EBCOT designed using Verilog HDL. Verification and Synthesis using Xillinx FPGA technology.

• Proceedings of the KSME Conference
• /
• 2007.05b
• /
• pp.2797-2802
• /
• 2007

It has been confirmed that implementation of the no-slip boundary conditions for the lattice-Boltzmann method play an important role in the overall accuracy of the numerical solutions as well as the stability of the solution procedure. We in this paper propose a new algorithm, i.e. the method of the dynamic boundary condition for no-slip boundary condition. The distribution functions on the wall along each of the links across the physical boundary are assumed to be composed of equilibrium and nonequilibrium parts which inherit the idea of Guo's extrapolation method. In the proposed algorithm, we apply a dynamic equation to reflect the computational slip velocity error occurred on the actual wall boundary to the correction; the calculated slip velocity error dynamically corrects the fictitious velocity on the wall nodes which are subsequently employed to the computation of equilibrium distribution functions on the wall nodes. Along with the dynamic selfcorrecting process, the calculation efficiently approaches the steady state. Numerical results show that the dynamic boundary method is featured with high accuracy and simplicity.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.3
• /
• pp.32-38
• /
• 2001

Multi-carrier data transmission system performance is mostly limited by Inter- symbol-interference that is caused by a dispersive characteristic of the transmission channel. In order to enhance the system performance to meet the service requirements of local access, the channel impulse response shortening method incorporated with a channel frequency response compensation method is proposed. For a fast and efficient implementation of the equalizer proposed, Kalman and LMS algorithms are successively used. To verify the channel equalization performance, a set of computer simulation is performed on a filter bank based multitone system operating in a typical high-speed local area data transmission environment. The results showed us a comparable signal-to-interference improvement over the conventional multitone equalization scheme.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.7 no.2
• /
• pp.137-148
• /
• 2002

Direct Torque Control(DTC) is considered to be an useful control scheme of high performance induction motor drives because the scheme provides a quick torque response without requiring the complex field-orientation block and inner current regulation loop. Among a few drawbacks of the conventional DTC scheme, large current harmonics due to flux drooping phenomenon in a low speed range may be the major difficulty In order to remove the difficulty, a fuzzy variable switching sector scheme and its real-time implementation algorithm are proposed in this paper. A DSP based control board is designed for the Induction motor drives with the DTC scheme including the fuzzy switching sector algorithm. Simulation and experimental results show the effectiveness of the proposed scheme.

• Journal of Communications and Networks
• /
• v.11 no.2
• /
• pp.157-165
• /
• 2009

In this paper, we investigate a dynamic spectrum sharing problem for the centralized uplink cognitive radio networks using orthogonal frequency division multiple access. We formulate a large-scale joint rate and power allocation as an optimization problem under quality of service constraint for secondary users and interference constraint for primary users. We also suggest admission control to nd a feasible solution to the optimization problem. To implement the resource allocation on a large-scale, we introduce a notion of using the conservative factors $\alpha$ and $\beta$ depending on the outage and violation probabilities. Since estimating instantaneous channel gains is costly and requires high complexity, the proposed algorithm pursues a practical and implementation-friendly resource allocation. Simulation results demonstrate that the large-scale joint rate and power allocation incurs a slight loss in system throughput over the instantaneous one, but it achieves lower complexity with less sensitivity to variations in shadowing statistics.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.2
• /
• pp.237-243
• /
• 1994

Fast curve generation is one of important techniques which facilitate fast process of computer graphics applications. It is possible to resolve the task through hardware or software. But rapid development of computer graphics area need methods for more fast generation of curves. This paper propose a algorithm (called CDAUD), which computes the coordinates of points on curve only with add operations using for ward differences and draw the curve fast. It also contains the method for generation of smooth and fully connected curves. Time complexity of CDAUD shows that it is superior than the existing method for constrained case, and it's superiority was validated through experimental implementation.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.305-310
• /
• 2003

The performance of various GFR implementations has been recently studied due to the interest to provide bandwidth guarantees with a simpler implementation than ABR in ATM networks. One of the important factors is buffer management for guaranteeing QoS in GFR service. An efficient buffer management algorithm is necessary to guarantee MCR for untagged cell in ATM switch. In this paper, we propose and evaluate a buffer management scheme to provide the GFR service guarantees. The proposed scheme can control the cell discarding for fairness in each VC, and compared with Double-EPD and DFBA. Our results show that the proposed buffer management with per-VC queuing achieves significant enhancement on goodputs and fairness index than those of existing methods.