• 한국정보처리학회논문지
• /
• 제5권9호
• /
• pp.2378-2387
• /
• 1998

본 논문에서는 VLSI 회로의 내장 자체 테스트(Built-In Self-Test)를 위한 효율적인 공간 응답 압축기의 설계 방식을 제안한다. 제안하는 공간 압축기의 설계 방식은 테스트 대상 회로의 구조와는 독립적으로 적용할 수 있다. 기존의 공간 응답 압축기는 하드웨어 오버헤드(hardware overheads)가 크고, 고장 응답을 비고장 응답으로 변환시키는 에일리어싱(aliasing)에 의해 고장 검출률(fault coverage)을 감소시켰으나, 제안하는 방식에 의해 설계된 공간 응답 압축기는 기존의 방법에 비해 하드웨어 오버헤드가 작고, 고장 검출률을 감소시키지 않는다. 또한, 제안하는 방식은 일반적인 N-입력 논리 게이트로 확장이 가능하여 테스트 대상 회로의 출력 시퀸스에 따른 가장 효율적인 공간 응답 압축기를 설계할 수 있다. 제안한 설계 방식은 SUN SPARC Workstation 상에서 C 언어를 사용하여 구현하며, ISCAS'85 벤치마크 회로를 대상으로 선형 피드백 시프트 레지스터(Linear Feedback Shift Registers)에 의해 생성된 의사 랜덤(pseudo random)패턴을 입력원으로 사용하여 시뮬레이션을 수행하므로써 그 타당성과 효율성을 입증한다.

• International Journal of Aeronautical and Space Sciences
• /
• 제14권3호
• /
• pp.256-263
• /
• 2013

The saturation of the actuator impairs the response performance of the near space interceptor control system. A control system based on the properties of linear tracking system is designed for this problem. The properties are that the maximum value of the pseudo-Lyapunov function of the linear tracking control system do not present at the initial state but at the steady state, based on which the bounded stability problem is converted into linear tracking problem. The pseudo-Lyapunov function of the linear tracking system contain the input variables; the amplitude and frequency of the input variables affect the stability of the nonlinear control system. Designate expected closed-loop poles area for different input commands and obtain a controller which is function of input variables. The coupling between variables and linear matrices make the control system design problem non-convex. The non-convex problem is converted into a convex LMI according to the Shur complement lemma and iterative algorithm. Finally the simulation shows that the designed optimal control system is quick and accurate; the rationality of the presented design techniques is validated.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1991년도 추계종합학술발표회논문집
• /
• pp.215-219
• /
• 1991

This paper is equivalent model transform which reduces the restriction of digitalization in the discrete linear system. This algorithm is the method that weight is given to contribillity and obserbility gramian, the regular matrix T of coordinate transform is obtained and then the state space coefficents of weighted model can be obtained. This study shows the frequency reponse of low quantization error according to the order of weighting function. The result shows that frequency response of the proposed algorithm is better than that of the balanced realization in the system of smaller bit.

• 전기학회논문지P
• /
• 제62권2호
• /
• pp.90-94
• /
• 2013

In this paper, we propose a new algorithm to improve the contrast ratio, to preserve information of bright regions and to maintain the color of backlight image that appears with a great relative contrast. Backlight images of the natural environment have characteristics for difference of local brightness; the overall image contrast improvement is not easy. To improve the contrast of the backlight images, MSR (Multi-Scale Retinex) algorithm using the existing multi-scale Gaussian filter is applied. However, existing multi-scale Gaussian filter involves color distortion and information loss of bright regions due to excessive contrast enhancement and noise because of the brightness improvement of dark regions. Moreover, it also increases computational complexity due to the use of multi-scale Gaussian filter. In order to solve these problems, a linear MSR is performed that reduces the amount of computation from the HSV color space preventing the color distortion and information loss due to excessive contrast enhancement. It can also remove the noise of the dark regions which is occurred due to the improved contrast through edge preserving filter. Through experimental evaluation of the average color difference comparison of CIELAB color space and the visual assessment, we have confirmed excellent performance of the proposed algorithm compared to conventional MSR algorithm.

• International Journal of Aeronautical and Space Sciences
• /
• 제17권2호
• /
• pp.184-194
• /
• 2016

In existing identification methods for on-orbit spacecraft, such as eigensystem realization algorithm (ERA) and subspace method identification (SMI), singular value decomposition (SVD) is used frequently to estimate the modal parameters. However, these identification methods are often used to process the linear time-invariant system, and there is a lower computation efficiency using the SVD when the system order of spacecraft is high. In this study, to improve the computational efficiency in identifying time-varying modal parameters of large spacecraft, a faster recursive algorithm called fast approximated power iteration (FAPI) is employed. This approach avoids the SVD and can be provided as an alternative spacecraft identification method, and the latest modal parameters obtained can be applied for updating the controller parameters timely (e.g. the self-adaptive control problem). In numerical simulations, two large flexible spacecraft models, the Engineering Test Satellite-VIII (ETS-VIII) and Soil Moisture Active/Passive (SMAP) satellite, are established. The identification results show that this recursive algorithm can obtain the time-varying modal parameters, and the computation time is reduced significantly.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2004년도 추계학술대회논문집
• /
• pp.741-744
• /
• 2004

In concrete pavements with uniform tining space, the whine noise which has high frequency spectrum related to the uniform tining space exist. In this paper, randomization procedure of tining space for concrete pavements is proposed. The proposed procedure developed based on the LCG(Linear Congruential Generator) algorithm. And the factor concerned in the procedure are drag span length, number of different tining space, ratio of each tining space, total tinings of each size, sequence of actual tining.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.392-394
• /
• 2003

There is a well-known simple, stable standard merge algorithm, which uses only linear time but for the price of double space. This extra space consumption has been often remarked as lack of the standard merge sort algorithm that covers a merge process as central operation. In-place merging is a way to overcome this lack and so is a topic with a long tradition of inspection in the area of theoretical computer science. We present an in-place merging algorithm that rear-ranges the elements to be merged by rotation, a special form of block interchanging. Our algorithm is novel, due to its technique of determination of the rotation-areas. Further it has a short and transparent definition. We will give a presentation of our algorithm and prove that it needs in the worst case not more than twice as much comparisons as the standard merge algorithm. Experimental work has shown that our algorithm is efficient and so might be of high practical interest.

• 한국정보처리학회논문지
• /
• 제6권1호
• /
• pp.66-74
• /
• 1999

사진트리를 메모리에 저장하는 방법 중 선형 사진트리 표현 방법은 다른 표현 방법과 비교할 때 저장 공간을 매우 효율적으로 절약할 수 있는 장점을 가진다. 따라서 지금가지 사진트리와 관련된 연산의 수행에 있어, 선형 사진트리를 사용하는 효율적인 알고리즘들이 많이 개발되고 연구되어 왔다. 본 논문에서는 RMESH(Reconfigurable MESH) 구조에서 3-차원 n$\times$n$\times$n 프로세서를 사용하여 선형 사진트리로 표현된 이진 영상의 이웃 블록들을 찾는 알고리즘을 제안한다. 이 알고리즘은 O(1)시간 복잡도를 잡는다.

• 한국소음진동공학회논문집
• /
• 제15권8호
• /
• pp.897-903
• /
• 2005

When driving on uniformly tining concrete pavement road, the whine noise which has high spectrum at the specific frequency related to the uniform tining space exist. In this paper, a randomization method of tining space for concrete pavements is proposed to reduce the whine noise. The proposed method is developed based on the LCG(linear congruential generator) algorithm. The design parameters used in the method are number of different tining space, ratio of each tining space, total linings of each size. sequence of actual tining under given constant drag length and texture. Monte Carlo simulations are used to validate the proposed method.

• Journal of Astronomy and Space Sciences
• /
• 제34권1호
• /
• pp.7-17
• /
• 2017

In South Korea, there are about 80 Global Positioning System (GPS) monitoring stations providing total electron content (TEC) every 10 min, which can be accessed through Korea Astronomy and Space Science Institute (KASI) for scientific use. We applied the computerized ionospheric tomography (CIT) algorithm to the TEC dataset from this GPS network for monitoring the regional ionosphere over South Korea. The algorithm utilizes multiplicative algebraic reconstruction technique (MART) with an initial condition of the latest International Reference Ionosphere-2016 model (IRI-2016). In order to reduce the number of unknown variables, the vertical profiles of electron density are expressed with a linear combination of empirical orthonormal functions (EOFs) that were derived from the IRI empirical profiles. Although the number of receiver sites is much smaller than that of Japan, the CIT algorithm yielded reasonable structure of the ionosphere over South Korea. We verified the CIT results with NmF2 from ionosondes in Icheon and Jeju and also with GPS TEC at the center of South Korea. In addition, the total time required for CIT calculation was only about 5 min, enabling the exploration of the vertical ionospheric structure in near real time.