• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1551-1555
• /
• 1987

This paper proposes a new test generation algorithm to detect stuck-open faults regardless of tine-skews in CMOS circuits. For testing for stuck-open faults regardless of time-skews, in this method, Hamming distance between the initialization pattern and the test pattern is made 1 by considering the responses of the internal gates. Therefore, procedure of the algorithm is simpler than that of the conventional methods because the line justification is unnecessary. Also, this method needs no extra hardware for testability and can be applied to random CMOS circuits in addition to two-level NAND - NAND CMOS circuits.

• 정보학연구
• /
• 제9권3호
• /
• pp.27-32
• /
• 2006

If is interested and create rule between it in item that association rules buys, by negative association rules is interested to item that do not buy, it is attempt to do data Maining more effectively. It is difficult that existent methods to find negative association rules find one part of rule, or negative association rules because use more complicated algorithm than algorithm that find association rules. Therefore, this paper presents method to create negative association rules by simpler process using Boolean Analyzer that use dependency between items. And as Boolean Analyzer through an experiment, show that can find negative association rules and more various rule through comparison with other algorithm.

• 한국항해항만학회지
• /
• 제28권4호
• /
• pp.299-303
• /
• 2004

In the Internet, to guarantee transmission rate and delay and to achieve fair bandwidth allocation, many per-flow scheduling algorithms, such as fair queueing, which have many desirable properties for congestion control, have been proposed and designed. However, algorithms based on per-flow need maintain rate state, buffer management and packet scheduling, so that it cost great deal ： implement. Therefore, in this paper, to implement routers cost-effectively, we propose CS-FNE algorithm based on FNE in Core-Stateless network We evaluate CS-FNE comparing with four additional algorithms i.e., CSFQ, FRED, RED and DRR, in several different, configurations and traffic sources. Through simulation results, we show that CS-FNE algorithm can allocate fair bandwidth approximately and is simpler and easier to implement than other per-flow basis queueing mechanisms.

• 한국정밀공학회지
• /
• 제16권10호
• /
• pp.25-34
• /
• 1999

In this paper, an algorithm is presented to recognize lane and obstacles based on highway road image. The road images obtained by a video camera undergoes a pre-processing that includes filtering, edge detection, and identification of lanes. After this pre-processing, a part of image is grouped into 27 sub-windows and fed into a three-layer feed-forward neural network. The neural network is trained to indicate the road direction and the presence of absence of an obstacle. The proposed algorithm has been tested with the images different from the training images, and demonstrated its efficacy for recognizing lane and obstacles. Based on the test results, it can be said that the algorithm successfully combines the traditional image processing and the neural network principles towards a simpler and more efficient driver warning of assistance system

• ETRI Journal
• /
• 제26권5호
• /
• pp.501-504
• /
• 2004

This paper presents a simple gain/phase blind compensation algorithm with an automatic gain control (AGC) function for the adoption of the AGC function and compensation for gain/phase imbalances in quadrature phase shift keying (QPSK) direct conversion receivers (DCRs). The AGC function is interactively operated with the compensation algorithm for gain/phase imbalances. By detecting the gain sum and difference values between the I-channel and Q-channel, the combined AGC and gain imbalance compensation algorithm provides a simpler DCR architecture.

• Journal of the Optical Society of Korea
• /
• 제17권5호
• /
• pp.392-398
• /
• 2013

As the essential techniques for the CD (Critical Dimension) measurement of the LCD pattern, there are various modules such as an optics design, auto-focus [1-4], and precise edge detection. Since the operation of image enhancement to improve the CD measurement repeatability, a ring type of the reflected lighting optics is devised. It has a simpler structure than the transmission light optics, but it delivers the same output. The edge detection is the most essential function of the CD measurements. The CD measurement is a vital inspection for LCDs [5-6] and semiconductors [7-8] to improve the production yield rate, there are numbers of techniques to measure the CD. So in this study, a new subpixel algorithm is developed through facet modeling, which complements the previous sub-pixel edge detection algorithm. Currently this CD measurement system is being used in LCD manufacturing systems for repeatability of less than 30 nm.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2010년도 춘계학술대회
• /
• pp.176-179
• /
• 2010

In this paper, we propose a fast implementation of Bilateral filter for tone mapping algorithm. Bilateral filter is able to preserve detail while at the same time prevent halo-ing artifacts because of improper scale selection by ensuring image smoothed that not only depend on pixel closeness, but also similarity. We accelerate Bilateral filter by using a piecewise linear approximation and recursive Gaussian filter as its domain filter. Recursive Gaussian filter is scale independent filter that combines low cost 1D filter which makes this filter much faster than conventional convolution filter and filtering in frequency domain. The experiment results show that proposed method is simpler and faster than previous method without mortgaging the quality.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2010년도 춘계학술발표논문집 1부
• /
• pp.261-264
• /
• 2010

Fast algorithm is proposed by using mel scale and the distribution characteristic of LSP parameters, and is to reduce the computational amount. Computational amount means the calculating times of transformation from LPC coefficients to LSP parameters. Among conventional methods, the real root method is considerably simpler than other, but neverthless, it still suffer from its indeterministic computational time. Because the root searching is processed sequentially in frequency region. In this paper, the searching interval is arranged by using mel scale but not it is uniform and searching order is arranged by the distribution characteristic of LSP parameters that is most LSP papameters are occured in specific frequency region. In experimental results, computational amount of the proposed algorithm is reduced about 48.95% in average, but the transformed LSP parameters of the proposed method were the same as those of real root method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권12호
• /
• pp.2326-2339
• /
• 2011

To reduce the implementation complexity of the Vertical Bell Labs layered space-time (V-BLAST) systems with respect to the zero-forcing (ZF) criterion, a computationally efficient recursive algorithm is proposed. A fast implementation of the proposed algorithm is developed and its complexity is analyzed in detail. The proposed algorithm matches the ZF-OSIC detection well, and its three significant advantages can be demonstrated by analyses and simulations. Firstly, its speedups over the conventional ZF-OSIC with norm-based ordering, the original fast recursive algorithm (FRA) and the fastest known algorithm (FKA) in the number of flops are 1.58, 2.33 and 1.22, respectively. Secondly, a much simpler implementation than FRA and FKA can be expected. Finally, the storage requirements are lower than those of FRA and FKA. These advantages make the proposed algorithm more efficient and practical.

• 한국정보통신학회논문지
• /
• 제13권12호
• /
• pp.2541-2546
• /
• 2009

EPCglobal Class-1 Gen-2 충돌방지 기법에서는 Q-알고리즘을 통하여 질의 라운드의 프레임 크기를 결정한다. Q-알고리즘은 리더의 식별영역 내에 있는 태그의 수를 추정하지 않고 슬롯의 상태만을 이용하여 질의 라운드의 프레임 크기를 계산하므로 다른 DFSA 알고리즘에 비하여 리더의 알고리즘이 단순한 장점이 있다. 반면, Q-알고리즘에서는 프레임 크기를 조절하기 위한 매개변수의 최적화 된 값은 정의하지 않고 있다. 따라서 본 논문에서는 시뮬레이션을 통하여 최소의 식별시간을 얻을 수 있는 최적의 매개변수 값을 제안하였다.