• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9C
• /
• pp.860-870
• /
• 2005

In this paper we propose a new method to derive GRM(Generalized Reed-Muller) coefacients for each $2^{n}$ polarities using cell of karnaugh map(k-map). Generally, there are the serial and parallel method to derive GRM coefficients. As a serial method, Green method generates GRM coefncients using transform matrix. And as a parallel method, Besslich algorithm produces GRM coefficients of each polarity using the generated anteriorly. Green's method generates GRM coefficients for n-variable by calculating transform matrix for one-variable and n-times kronecker product this matrix. And Besslich's method generates GRM coefficients of each polarity in order of Grey-code. But those methods have disadvantages that the number of variable exceeding four makes transform matrix large and there are so many operation steps. In this paper, GRM coefficients is generated by producing cell [$f_{i}$] minimizing variable on k-map and operating this cell [$f_{i}$] and transform matrix for one-variable. So, we can generate GRM coefficients of all polarities easily by using the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.303-310
• /
• 2006

In sensor network environments, a sensor node has a limited power because of their resource constraints. Therefore it is important to efficiently use its power in sensor networks. Power consumption of sensor node is closely related to its amount of transmission data. So, we need to reduce the transmission data in order to minimize the power consumption. And sensor networks are inherently unreliable because radio transmission can fail, node can move, and so on. In this paper, we propose the reliable data aggregation protocol in order to these problems. This protocol performs the routing and the query inserting process at the same time to minimize the packet loss caused by network changes. And, this protocol removes the unnecessary routing caused by the periodic routing without query. Additionally, we suggest the countermeasure algorithm against the frequent errors in sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3C
• /
• pp.256-262
• /
• 2002

This paper presents a novel radix-4 modular multiplication algorithm based on the sign estimation technique (3). The sign estimation technique detects the sign of a number represented in the form of a carry-sum pair. It can be implemented with 5-bit carry look-ahead adder. The hardware speed of the cryptosystem is dependent on the performance modular multiplication of large numbers. Our algorithm requires only (n/2+3) clock cycle for n bit modulus in performing modular multiplication. Our algorithm out-performs existing algorithm in terms of required clock cycles by a half, It is efficient for modular exponentiation with large modulus used in RSA cryptosystem. Also, we use high-speed adder (7) instead of CPA (Carry Propagation Adder) for modular multiplication hardware performance in fecal stage of CSA (Carry Save Adder) output. We apply RL (Right-and-Left) binary method for modular exponentiation because the number of clock cycles required to complete the modular exponentiation takes n cycles. Thus, One 1024-bit RSA operation can be done after n(n/2+3) clock cycles.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.4
• /
• pp.323-335
• /
• 1992

In this paper, an adaptive cosine transform coding scheme which incorporate human visual properties into the coding scheme is investigated. Human vision is relatively sensitive to mid-frequency band, and insensitive to very low and very high frequency band. These property was mathematically modelled with MTF(Modulation Transfer Function) through many psychovisual experiment. DCT transforms energy in spatial domain into frequency domain, so can exploit the MTF very efficiently. Another well-known visual characteristics is spatial masking effect that visibility of noise is less in regions of high activity than in regions of low activity. Proposed coding scheme imploys quantization matrix which represent the properties of these spatial frequency response of human vision, and adaptively quality of an image. To compute the activity index of an image block, simple operation is performed in spatial domain, and according to activity index. block of low activity region is more exactly quantized relatively than that of high activity region. Results showed that, at low bit rate, the subjective quality of the reconstructed images by proposed coding scheme is acceptible than that of coding scheme without HVS properties.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.278-286
• /
• 2007

In this paper, an efficient algorithm is proposed for the interpolation of interlaced images. First of all, by efficiently estimating the directional spatial correlations of neighboring pixels, increased interpolation accuracy can be achieved. And then using the gradient vector which was obtained by Sobel operation, enables to consider the fine directional edges and make it possible to estimate the accurate direction of edges. In other words, it is possible to interpolate the interlaced images with considering the characteristics of images. In addition, by altering the conventional edge detector for the purpose of a easy De-interlacing and multiplying the optimal translation coefficients to each of the gradient vectors, an efficient interpolation for images can be achieved. Comparing with the conventional De-interlacing algorithms, proposed algorithm not only reduced the complexity but also estimated the accurate edge direction and the proposed scheme have been clearly verified that it enhances the objective and subjective image quality by the extensive simulations for various images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.314-322
• /
• 2007

This paper proposes a new optimization algorithm named by GBNSGA(Goal-Pareto Based Non-dominated Sorting Genetic Algorithm) which determines the best configuration for CR(Cognitive Radio) communication systems. Conventionally, in order to select the proper radio configuration, genetic algorithm has been introduced so as to alleviate computational burden along the execution of the cognition cycle proposed by Mitola. This paper proposes a novel optimization algorithm designated as GBNSGA for cognitive engine which can be described as a hybrid algorithm combining well-known Pareto-based NSGA(Non-dominated Sorting Genetic Algorithm) as well as GP(Goal Programming). By conducting computer simulations, it will be verified that the proposed method not only satisfies the user's service requirements in the form of goals. It reveals the fast optimization capability and more various solutions rather than conventional NSGA or weighted-sum approach.

• Journal of KIISE
• /
• v.44 no.12
• /
• pp.1313-1318
• /
• 2017

Aggregating local features in a single vector is a fundamental problem in an image search. In this process, the image search process can be speeded up if binary features which are extracted almost two order of magnitude faster than gradient-based features are utilized. However, in order to utilize the binary features in an image search, it is necessary to study the techniques for clustering binary features to generate binary visual words. This investigation is necessary because traditional clustering techniques for gradient-based features are not compatible with binary features. To this end, this paper studies the techniques for clustering binary features for the purpose of generating binary visual words. Through experiments, we analyze the trade-off between the accuracy and computational efficiency of an image search using binary features, and we then compare the proposed techniques. This research is expected to be applied to mobile applications, real-time applications, and web scale applications that require a fast image search.

• Journal of Korea Water Resources Association
• /
• v.36 no.5
• /
• pp.777-785
• /
• 2003

A numerical model for the solution of two-dimensional free surface flow is developed on unstructured grid. By using fractional step method, the two-dimensional shallow water equations (SWE) are treated as two one-dimensional problems. Thus, it is possible to simulate computational hydraulic problems with higher computational efficiency. The one-dimensional problems are solved using upwind TVD version of second-order Weighted Averaged Flux (WAF) scheme with HLLC approximate Riemann solver. The numerical oscillations which are common with second-order numerical scheme are controlled by exploiting WAF flux limiter, Some idealized test problems are solved using this model and very accurate and stable solutions are obtained. It can be concluded as an efficient implement for the computation of SWE including dam break problems that concerning discontinuities, subcritical and supercritical flows and complex domain.

• Korean Journal of Optics and Photonics
• /
• v.23 no.4
• /
• pp.143-146
• /
• 2012

All-optical data extraction, one of the key technologies for all-optical computing and optical communication to perform add-drop, packet switching, and data reset, etc., is experimentally demonstrated by using cross-gain modulation (XGM) of semiconductor optical amplifiers (SOAs). Also, all-optical data extraction based on numerical simulation is performed by using the VPI simulation tool. In this paper, the suggested optical system based on SOAs shows the potential for high speed, and highly integrable and low power optical data computing.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.7
• /
• pp.603-611
• /
• 2003

This paper proposes an effective feature compensation scheme based on speech model for achieving robust speech recognition. Conventional model-based method requires off-line training with noisy speech database and is not suitable for online adaptation. In the proposed scheme, we can relax the off-line training with noisy speech database by employing the parallel model combination technique for estimation of correction factors. Applying the model combination process over to the mixture model alone as opposed to entire HMM makes the online model combination possible. Exploiting the availability of noise model from off-line sources, we accomplish the online adaptation via MAP (Maximum A Posteriori) estimation. In addition, the online channel estimation procedure is induced within the proposed framework. For more efficient implementation, we propose a selective model combination which leads to reduction or the computational complexities. The representative experimental results indicate that the suggested algorithm is effective in realizing robust speech recognition under the combined adverse conditions of additive background noise and channel distortion.