• KIEAE Journal
• /
• v.7 no.4
• /
• pp.147-152
• /
• 2007

Numerous non-destructive tests(NDT) to assess the safety of real structures have been developed. System identification(SI) techniques using dynamic responses and behaviors of structural systems become an outstanding issue of researchers. However the conventional SI techniques are identified to be non-practical to the complex and tall buildings, due to limitation of the availability of an accurate data that is magnitude or location of external loads. In most SI approaches, the information on input loading and output responses must be known. In many cases, measuring the input information may take most of the resources, and it is very difficult to accurately measure the input information during actual vibrations of practical importance, e.g., earthquakes, winds, micro seismic tremors, and mechanical vibration. However, the desirability and application potential of SI to real structures could be highly improved if an algorithm is available that can estimate structural parameters based on the response data alone without the input information. Thus a technique to estimate structural properties of building without input measurement data and using limited response is essential in structural health monitoring. In this study, shaking table tests on three-story plane frame steel structures were performed. Out-put only model analysis on the measured data was performed, and the dynamic properties were inverse analyzed using least square method in time domain. In results damage detection was performed in each member level, which was performed at story level in conventional SI techniques of frequency domain.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.6
• /
• pp.849-861
• /
• 1995

In this paper, a new trace driven simulation algorithm is proposed to evaluate the bus traffic and the miss ration of the various sector cache memories, which have various sub-block sizes and block sizes and associativities and number of sets, with a single pass through an address trace. Trace-driven simulaton is usually used as a method for performance evaluation of sector cache memories, but it spends a lot of simulation time for simulating the diverse cache configurations with a long address trace. The proposed algorithm shortens the simulation time by evaluating the performance of the various sector cache configurations. which have various sub-block sizes and block sizes and associativities and number of sets , with a single pass through an address trace. Our simulation results show that the run times of the proposed simulation algorithm can be considerably reduced than those of existing simulation algorithms, when the proposed algorithm is miplemented in C language and the address traces obtained from the various sample programs are used as a input of trace-driven simulation.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.1165-1168
• /
• 2003

In this paper, a CLB-based CPLD low-power technology mapping algorithm is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. Therefore the proposed algorithm is proved an efficient algorithm for a low power CPLD technology mapping.

• ETRI Journal
• /
• v.34 no.4
• /
• pp.503-510
• /
• 2012

We analyze the relationship between channel coherence bandwidth and two complexity-reduced lattice reduction aided detection (LRAD) algorithms for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems in correlated fading channels. In both the adaptive LR algorithm and the fixed interval LR algorithm, we exploit the inherent feature of unimodular transformation matrix P that remains the same for the adjacent highly correlated subcarriers. Complexity simulations demonstrate that the adaptive LR algorithm could eliminate up to approximately 90 percent of the multiplications and 95 percent of the divisions of the brute-force LR algorithm with large coherence bandwidth. The results also show that the adaptive algorithm with both optimum and globally suboptimum initial interval settings could significantly reduce the LR complexity, compared with the brute-force LR and fixed interval LR algorithms, while maintaining the system performance.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.114-117
• /
• 2004

This paper proposes a novel algorithm for hybrid lossless audio coding, which employs integer discrete cosine transform. The proposed algorithm divides the input signal into frames of a proper length, decorrelates the framed data using the integer DCT and finally entropy-codes the frame data. In particular, the adaptive Golomb-Rice coding method used for the entropy coding selects an optimal option which gives the best compression efficiency. Since the proposed algorithm uses integer operations, it significantly improves the computation speed in comparison with an algorithm using real or floating-point operations. When the coding algorithm is implemented in hardware, the system complexity as well as the power consumption is remarkably reduced. Finally, because each frame is independently coded and is byte-aligned with respect to the frame header, it is convenient to move, search, and edit the coded data.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.255-258
• /
• 2002

Recently, Digital TV viewer have been replacing cathode ray tubes (CRT) with Plasma display panel(PDP). But the chromaticity of the primaries are dependent on RGB input signals. And the colorimetry of PDP changes with gray scale and has a poor performance in color reproduction. In this paper we propose the enhanced algorithm of color reproduction considering nonlinear gamut mapping algorithm. In order to test performance of this algorithm we use the sample colors. As a result of experiments, it was confirmed that the color difference of the digital PDP using the proposed algorithm was considerably reduced.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.137-146
• /
• 2002

In order to remove the intersymbol interference(ISI) phenomenon in data transmission channel, the structure and convergence analysis of the improved multiplication free adaptive digital filter(IMADF) is presented. Under conditions of zero-mean, wide-sense stationary and white Gaussian noise, it is shown that this paper analyze the convergence characteristics of the IMADF with a fractionally-spaced equalizer(FSE). In the experimental results, the convergence characteristics of the IMADF algorithm is almost same as the sign algorithm, but is better than the MADF algorithm. Here, this algorithm has useful characteristics when the correlation of the input signal is highly.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.3
• /
• pp.327-339
• /
• 1986

In this paper, a hardware compiler for symbolic description language(SDL) is proposed for logic design automation. Lexical analysis is performed for SDL which describes the behavioral characteristics of a digital system at the register transfer level by the proposed algorithm I. The algorithm I is proposed to get the expressions for the control unit and for the data transfer unit. In order to obtain the network description language(NDL) expressions equivalent to gate-level logic circuits, another algorithm, the the algorithm II, is proposed. Syntax analysis for the data formed by the algorithm I is also Performed using circuit elements such as D Flip-Flop, 2-input AND, OR, and NOT gates. This SDL hardware compiler is implemented in the programming language C(VAX-11/750(UNIX)), and its efficiency is shown by experiments with logic design examples.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.93-96
• /
• 2001

In this paper, we present a vision algorithm and method for input image improvement and preprocessing of dented and raised characters on the sidewall of tires. we define optical condition between reflect coefficient and reflectance by the physical vector calculate. On the contrary this work will recognize the engraved characters using the computer vision technique. Tire input images have all most same grey levels between the characters and backgrounds. The reflectance is little from a tire surface. therefore, it's very difficult segment the characters from the background. Moreover, one side of the character string is raised and the other is dented. So, the captured images are varied with the angle of camera and illumination. For optimum input images, the angle between camera and illumination was found out to be with in 90。 .In addition, We used complex filtering with low-pass and high-pass band filters to improve input images, for clear input images. Finally we define equation reflect coefficient and reflectance. By doing this, we obtained good images of tires for pattern recognition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.830-841
• /
• 2000

We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-1, we may compute the updated estimate of this vector at iteration a upon the arrival of new data. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. In this paper, we propose new tap weight updated RLS algorithm in adaptive transversal filter with data-recycling buffer structure. We prove that convergence speed of learning curve of RLS algorithm with data-recycling buffer is faster than it of exiting RL algorithm to mean square error versus iteration number. Also the resulting rate of convergence is typically an order of magnitude faster than the simple LMS algorithm. We show that the number of desired sample is portion to increase to converge the specified value from the three dimension simulation result of mean square error according to the degree of channel amplitude distortion and data-recycle buffer number. This improvement of convergence character in performance, is achieved at the (B+1)times of convergence speed of mean square error increase in data recycle buffer number with new proposed RLS algorithm.