• The Journal of the Acoustical Society of Korea
• /
• v.15 no.6
• /
• pp.33-40
• /
• 1996

In this paper, we resolved a trade-off problem of the blind equalizer based on the stop-and-go algorithm that is commonly used for QAM demodulation in CATV receiver. The stop-and-go algorithm has used the LMS(least mean square) algorithm in the updating operation of tap weights so that the structure of equalizer is simple, but there is a trade-off between convergence speed and steady state error as in the typical LMS algorithm. We used the variable step size algrithm to improve the convergence speed with the steady state error in the constant level. With respect to the same level of the steady state error, the variable step size stop-and-go algortihm improved convergence speed by about $36%{\sim}56%$ as compared with that of the constant step size algortihm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1460-1463
• /
• 1997

The aim of this paper is to suggest a design method of the model following optimal boiler-turbine H.inf. control system using genetic algorithm. This boiler-turbine H.inf. control system is designed by applying genetic algortihm with reference model to the optimal determination of weighting functions and design parameter .gamma. that are given by Glover-Doyle algornithm whch can design H.inf. contrlaaer in the sate. space. The first method to do this is ghat the gains of weightinf functions and .gamma. are optimized simultaneously by genetic algroithm. And the second method is that not only the gains and .gamma. but also the dynamics of weighting functions are optimized at the same time by genetic algonithm. The effectiveness of this boiler-turbine H.inf. control system is verified and compared with LQG/LTR control system by computer simulation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1714-1717
• /
• 1997

A human operator is able to perform some tasks smoothly with force feedvack for the teleoperation or a virtual device in a the virtual environments. This paper describes a virtual force generation method with which operator can feel the interactive force between virtula robot and artificial environments. A virtual force generation algortihm is applied to generate the contact force at the arbitrary point of virtual robot, and the virtual force is displayed to the human operator via a tendon master arm consisted with 3 motors. Some experiments has beencarried out to verify the effectiveness of the force generation algorithm and usefulness of the developed backdrivable master arm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.1072-1077
• /
• 1992

In ths paper a new active assembly algorithm for chamferless precision parts mating, is considered. The successful assembly task requires an extremely high position accuracy and a good knowledge of mating parts. However, conventional assembly mehtod alone makes it difficult to achieve satisfactory assembly performance because of the complexity and the uncertainties of the process and its environments such as imperfect knowledge of the parts being assembled as well as the limitation of the devices performing the assebled as well as the limitation of the devices performing the assembly. To cope with these problems, a self-learning rule-based assembly algorithm is proposed by intergaring fuzzy set theory and neural network. In this algortihm, fuzzy set theory copes with the complexity and the uncertainties of the assembly process, while neural network enhances the assembly schemen so as to learn fuzzy rules form experience and adapt to changes in environment of uncertainty and imprecision. The performance of the proposed assembly algorithm is evaluated through a series of experiments. The results show that the self-learning fuzzy assembly scheme can be effecitively applied to chamferless precision parts mating.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.306-312
• /
• 2000

In this paper, the efficient architecture of small Reed-solomon architecture is suggested. Here, 3-stage pipeline is adopted. In decoding, error-location polynomials are obtained by BMA using fast iteration method, and syndrome polynomials, where calculation complexity is required, are obtained by parallel calculation using ROM table, and the roots of error location polynomial are calculated by ROM table using Chein search algorithm. In the suggested decoder, it is confirmed that 3 symbol random errors can be corrected and 124Mbps decoding rate is obtained using 25 Mhz system clock.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.833-841
• /
• 1997

In this paper, the hybrid LB-TJW(Leaky Bucket-Triggered Jumping Window) algorithm for multimedia traffic control is proposed and its performance is evaluated and analyzed. Its architecture is composed of the peak bit rate controller and the average bit rate controller. Generally, the cell which violates the peak bit rate is discraded in LBalgorithm, and the average bit rate of JW or TJW algorithm is better than that of LB algorithm. However, the hybrid LB-TJW algorithm passes it though the network if the cell does not violate the peak bit rate. If the cell violates the peak bit rate, the hybrid LB-TJW algorithm passes it to the average bit rate controller which perforithm to monitor the average bit rate of input traffic. The TJW algorithm monitors the cell that violates the average bit rate. If the cell does not violate the average bit rare, the LB-TJW algorithm passes it through the network. As simulation results, the cell loss rate and the buffer size of the LB-TJW algorithm is reduced to half as much as those of LB algortihm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1876-1879
• /
• 1997

This paper developes an efficient algorithm for the minimum distance calculation between general polyhedra(convex and/or concave). The polyhedron approximates and object using flat polygons which composed of more than three veritices. The algorithm developed in this paper basically computes minimun distance betwen two convex polygons and finds a set of polygons whcih makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that minimum distance computing time is repidly increased with the number of polygons which used to approximate an object. This paper developes a method to eliminate unnecessary sets of polygons, and an efficinet algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. It takes only a few times iteration to find minimum distance for msot polygons. The correctness of the algortihm are visually tested with a line which connects two points making a global minimum distance of simple convex object(box) and concave object(pipe). The algorithm can find minimum distance between two convex objects made of about 200 polygons respectively less than a second computing time.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.4
• /
• pp.293-298
• /
• 2000

In fuzzy expert systems or database systems that have volumes of fuzzy data or large fuzzy rules, the inference time is much increased. Therefore, a high performance parallel fuzzy computing environment is needed. In this paper, we propose a parallel fuzzy inference mechanism in parallel computing environments. In this, fuzzy rules are distributed and executed simultaneously. The ONE_TO_ALL algorithm is used to broadcast the fuzzy input input vector to the all nodes. The results of the MIN/MAX operations are transferred to the output processor by the ALL_TO_ONE algorithm. By parallel processing of fuzzy or data, the parallel fuzzy inference algortihm extracts effective and achieves and achieves a good speed factor.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.11
• /
• pp.2779-2785
• /
• 2014

Edge Detection is a technique that obtains the particular information of the image using the brightness variation of pixel values and utilized for preprocessing in various image processing sectors. The conventional edge detection methods such as Sobel, Prewitt and Roberts are processed by applying the same weighted value to the entire pixels regardless of pixel distrbution and provides somewhat insufficient edge detection results. therefore, this paper has proposed an edge detection method considering the direction and magnitute of pixels by applying a modified directional mask.

• Journal of Satellite, Information and Communications
• /
• v.7 no.2
• /
• pp.97-103
• /
• 2012

A very low complexity QRD-M algorithm based on limited search area is proposed for MIMO systems. The conventional QRD-M algorithm calculates Euclidean distance between all constellation symbols and the temporary detection symbol at each layer. We found that performance will not be degraded even if we adaptively restrict the search area of the candidate symbols only to the neighboring points of temporary detection symbol according to the channel condition at each layer. As a channel condition indicator, we employ the channel gain ratio among the layers without necessity of SNR estimation. The simulation results show that the proposed scheme effectively achieves near optimal performance while maintaining the overall average computation complexity much smaller than the conventional QRD-M algorithm.