• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2378-2387
• /
• 1998

This thesis proposes a design algorithm of an efficient space response compactor for Built-In Self-Testing of VLSI circuits. The proposed design algorithm of space compactors can be applied independently from the structure of Circuit Cnder Test. There are high hardware overhead cost in conventional space response compactors and the fault coverage is reduced by aliasing which maps faulty circuit's response to fault-free one. However, the proposed method designs space response compactors with reduced hardware overheads and does not reduce the fault coverage comparing to conventional method. Also, the proposed method can be extended to general N -input logic gate and design the most efficient space response L'Ompactors according to the characteristies of output sequence from CUT. The prolxlsed design algorithm is implemented by C language on a SUN SPARC Workstation, and some experiment results of the simulation applied to ISCAS'85 benchmark circuits with pseudo random patterns generated bv LFSR( Linear Feedback Shift Register) show the efficiency and validity of the proposed design algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.8
• /
• pp.30-41
• /
• 2001

In this paper, the architecture of Dynamic GSMP V3(General Switch Management Protocol Version 3), an open interface protocol with resource management functions for efficient IP service on ATM over MPLS, is proposed and implemented in hardware. And we compare and analyze the proposed GSMP with the GSMP under standardization process in terms of CLR (Cell Loss Rate). We design the Slave block of the Dynamic GSMP V3 using SAM-SUNG SoG $0.5{\mu}m$ process, which performs functions for switch connection control in the ATM Switch. In order to compare difference performanaces between the proposed method and the conventional one, we conducts simulations using the minimum buffer search algorithm with random cell generation. The exponential results show that the proposed method leads to performance enhancement in CLR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7B
• /
• pp.417-426
• /
• 2005

Routing and wavelength assignment problem is one of the most important issues in optical transport networks based on wavelength division multiplexing(WDM) technique. In this paper, we propose a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths. And then we compare the performance of the proposed algorithm with that of bounded greedy approach for EDP(BGAforEDP). The proposed one outperforms up to about 20$\%$ in the fixed traditional topology(NSFNET) and about 32$\%$ in random topologies over the BGA for EDP algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.3
• /
• pp.27-32
• /
• 2020

In this paper, we propose an algorithm to measure the accumulated status of scrap boxes where metal scraps are accumulated. The accumulated status measuring is defined as a multi-class classification problem, and the method with deep learning classify the accumulated status using only the scrap box image. The learning was conducted by the Transfer Learning method, and the deep learning model was NASNet-A. In order to improve the accuracy of the model, we combined the Random Forest classifier with the trained NASNet-A and improved the model through post-processing. Testing with 4,195 data collected in the field showed 55% accuracy when only NASNet-A was applied, and the proposed method, NASNet with Random Forest, improved the accuracy by 88%.

• Journal of Korea Multimedia Society
• /
• v.4 no.2
• /
• pp.136-144
• /
• 2001

visual cryptography is a simple method in which secret information can be directly decoded in human visual system without any cryptographic computations. This scheme is a kind of secret sharing scheme in which secret of image type is distributed to n random image(we call it share). When the secret image is distributed to n shares, the original pixel is expanded as much as the size of column in basis matrix. It causes the deterioration of contrast in docoded secret image. Therefore, many researches have performed to reduce the size of pixel expansion and to improve the contrast by overlapping the row in basis matrix for (k, n) visual cryptography. In addition, we show that the proposed method can construct the (k, n) visual cryptography with multiple contrasts depending on selecting k out of n slides in a group.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7A
• /
• pp.587-596
• /
• 2005

In this paper, we propose an OFDMA/CDM-based cellular system, which accommodates multiple users in frequency-domain and multiplexes user data with frequency-domain spreading. The proposed system utilizes random codes to discriminate cells and adopts the pre-equalization to enhance the performance. For cellular applications, a number of pre-equalization techniques are compared and an efficient power allocation scheme is suggested with a transmit power constraint. Especially, the validity of OFDMA/CDM based cellular system is investigated, by comparing the performance for varying the number of multiplexed data symbols at different locations. Finally the pre/post-equalization is proposed to reduce the performance degradation caused by time delay.

• Journal of IKEEE
• /
• v.18 no.4
• /
• pp.523-531
• /
• 2014

In this paper, a fast single image blind denoising algorithm is presented, where noise parameters are estimated by local statistics of an observed degraded image without a prior information about the additive noise. The estimated noise parameters are used to define the constraints on the noise detection which is coupled with the 1st-order Markov Random Field. In addition, an adaptive modified weighted Gaussian filter is introduced, where variable window sizes and weighting coefficients defined by the constraints are used to control the degree of the smoothness of the reconstructed image. The experimental results demonstrate the capability of the proposed algorithm. Please put the abstract of paper here.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.248-256
• /
• 2004

Woerner had suggested an asynchronous trellis-coded DS/CDMA system based on a multi-sequence signaling, biorthogonal sequence, which is superior to single sequence signaling, such as M-ary PSK, due to their better cross-correlation properties. This paper analyzes and compares system performance between OPSM, a recently-presented multi-sequence signaling scheme, and biorthogonal sequence signaling. Interuser interference moments of the two schemes are derived and compared which verifies that OPSM, having smaller signature sequences per symbol than biorthogonal signaling, reduces cross-correlation. Numerical results compare the power and spectral efficiency of asynchronous trellis-coded DS/CDMA systems based on multi-sequence signaling.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.10
• /
• pp.48-58
• /
• 1998

We present a method that can recognize face images using independent component analysis that is used mainly for blind sources separation in signal processing. We assumed that a face image can be expressed as the sum of a set of statistically independent feature images, which was obtained by using independent component analysis. Face recognition was peformed by projecting the input image to the feature image space and then by comparing its projection components with those of stored reference images. We carried out face recognition experiments with a database that consists of various varied face images (total 400 varied facial images collected from 10 per person) and compared the performance of our method with that of the eigenface method based on principal component analysis. The presented method gave better results of recognition rate than the eigenface method did, and showed robustness to the random noise added in the input facial images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.10A
• /
• pp.830-838
• /
• 2011

Recently, studies for the network coding in the wireless network to achieve improvement of the network capacity are conducted. In this paper, we analysis considerations to apply RLNC in the wireless network. First of all, we verify whether the RLNC method in multicast is applied to distributed wireless network. In simulation results, the decoding failure can occur in the original manner of multicast. In RLNC which conducts encoding and decoding in X topology to gets rid of the decoding failure, the RLNC gain is insignificant. In this paper we also discuss considerations such as the hidden node problem, the occurrence of coding opportunity, and the RLNC overhead which are practical issues in the wireless network.