• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.3
• /
• pp.60-68
• /
• 1994

In this paper, the multiplicative algorithm of two polynomials over finite field GF(($p^{m}$) is presented. Using the presented algorithm, the multiple-valued multiplier of the serial input-output modular structure by CCD is constructed. This multiple-valued multiplier on CCD is consisted of three operation units: the multiplicative operation unit, the modular operation unit, and the primitive irreducible polynomial operation unit. The multiplicative operation unit and the primitive irreducible operation unit are composed of the overflow gate, the inhibit gate and mod(p) adder on CCD. The modular operation unit is constructed by two mod(p) adders which are composed of the addition gate, overflow gate and the inhibit gate on CCD. The multiple-valued multiplier on CCD presented here, is simple and regular for wire routing and possesses the property of modularity. Also. it is expansible for the multiplication of two elements on finite field increasing the degree mand suitable for VLSI implementation.

• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.271-275
• /
• 2011

In this paper, we present a hybrid encryption for a digital hologram which is the most valuable image content. The encryption algorithm is based on a hybrid technique implementation a four-dimensional transform combining the discrete wavelet transform(DWT) and the discrete cosine transform (DCT). The encryption scheme is composed on the basis of the energy distribution. The experimental results showed that encrypting only 0.0244% of the entire data was enough to hide the constants of the hologram. The encryption algorithm expected to be used effectively on the researches on encryption and others for digital holographic display.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.3 no.2
• /
• pp.65-70
• /
• 2008

Digital signal processing (DSP) is the process of taking a signal and performing an algorithm on it to analyze, modify, or better identify that signal.[1] To take advantage of DSP advances, one must have at least a basic understanding of DSP theory along with an understanding of the hardware architecture designed to support these new advances. There are several programming techniques that maximize the efficiency of the DSP hardware, as well as a few fundamental concepts used to implement DSP software. This article introduced some of these underlying functions that are the building blocks of complex signal processing functions, and It will touch on the fundamental concepts of DSP theory and algorithms and also provide an overview of the implementation and optimization of DSP software, and discuss the development of DSP.

• The Journal of Information Technology
• /
• v.6 no.3
• /
• pp.35-44
• /
• 2003

This study shows the implementation of the computer algorithm of active filter less than or equal to the 10th order for biological signals which is indispensably used as the interfaces for biological signal instrumentation of human body. Applications in the field of medial science are proposed by improving the weak point of manually calculated design which takes a lot of time and the complexity to design the active filter.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.4
• /
• pp.840-848
• /
• 2009

This paper proposes a new multi-start scheme that generates guided random bits in selecting initial search points for global optimization with univariate dynamic encoding algorithm for searches (uDEAS). The proposed method counts the number of 1 in each bit position from all the previously generated initial search matrices and, based on this information, generates 0 in proportion with the probability of selecting 1. This rule is simple and effective for improving diversity of initial search points. The performance improvement of the proposed multi-start is validated through implementation in uDEAS and function optimization experiments.

• Journal of Korea Multimedia Society
• /
• v.12 no.6
• /
• pp.794-803
• /
• 2009

In this paper, we will present a container auto-landing system, the system use the stereo camera to measure the container depth information. And the container region can be detected by using its hough line feature. In the line feature detection algorithm, we will detect the parallel lines and perpendicular lines which compose the rectangle region. Among all the candidate regions, we can select the region with the same aspect-ratio to the container. The region will be the detected container region. After having the object on both left and right images, we can estimate the distance from camera to object and container dimension. Then all the detect dimension information and depth inform will be applied to reconstruct the virtual environment of crane which will be introduce in this paper. Through the simulation result, we can know that, the container detection rate achieve to 97% with simple background. And the estimation algorithm can get a more accuracy result with a far distance than the near distance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.8 no.3
• /
• pp.113-119
• /
• 1983

In this paper, a method of the step size adaption is studied on the delta modulation coding of speech signals. Exponential adaption processes are reserched by a new circuit model. It is presented a shorten error recovery in decoder step size. Practical considerations favor one algorithm, and its digital implementation has been adapted for the illustration of above method, using the rate multipliers and the validity is verified by laboratory experiment.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.1
• /
• pp.75-80
• /
• 1995

In this paper, we show that it is more efficient to use a new algorithm than to use a method of trace definition and property when we use trace calculation method on trinomial irreducible polynomial of reed-solomon code. This implementation has been done in SUN SPARC2 workstation using C-language.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2008-2019
• /
• 2000

In this paper, we propose a recovery method for high dimensional index structures. It recovers efficiently transactions including reinsert operations that needs undo or rollback due to system failures or transaction failures. It is based on WAL(Write Ahead Logging) protocol. We apply the method to the FCIR-Tree and implement it based on MiDAS-III which is the storage system of a multimedia DBMS, called BADA-III. We also show through performance evaluation that the recovery method with our algorithm recovers reinsert operations efficiently over that without our algorithm.

• Communications for Statistical Applications and Methods
• /
• v.21 no.5
• /
• pp.423-433
• /
• 2014

Test statistics using cumulative sums of residuals have been widely used in various regression models including generalized linear models(GLM). Recently, Pan and Lin (2005) extended this testing procedure to the generalized linear mixed models(GLMM) having random effects, in which we encounter difficulties in computing the marginal likelihood that is expressed as an integral of random effects distribution. The Gaussian quadrature algorithm is commonly used to approximate the marginal likelihood. Many commercial statistical packages provide an option to apply this type of goodness-of-fit test in GLMs but available programs are very rare for GLMMs. We suggest a computational algorithm to implement the testing procedure in GLMMs by a freely accessible R package, and also illustrate through practical examples.