• Title/Summary/Keyword: cluster method

Search Result 2,498, Processing Time 0.032 seconds

A CLB based CPLD Low-power Technology Mapping Algorithm (CLB 구조의 CPLD 저전력 기술 매핑 알고리즘)

  • 김재진;윤충모;인치호;김희석
    • 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.

  • PDF

A Method of Evaluating Korean Articulation Quality for Rehabilitation of Articulation Disorder in Children

  • Lee, Keonsoo;Nam, Yunyoung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.8
    • /
    • pp.3257-3269
    • /
    • 2020
  • Articulation disorders are characterized by an inability to achieve clear pronunciation due to misuse of the articulators. In this paper, a method of detecting such disorders by comparing to the standard pronunciations is proposed. This method defines the standard pronunciations from the speeches of normal children by clustering them with three features which are the Linear Predictive Cepstral Coefficient (LPCC), the Mel-Frequency Cepstral Coefficient (MFCC), and the Relative Spectral Analysis Perceptual Linear Prediction (RASTA-PLP). By calculating the distance between the centroid of the standard pronunciation and the inputted pronunciation, disordered speech whose features locates outside the cluster is detected. 89 children (58 of normal children and 31 of children with disorders) were recruited. 35 U-TAP test words were selected and each word's standard pronunciation is made from normal children and compared to each pronunciation of children with disorders. In the experiments, the pronunciations with disorders were successfully distinguished from the standard pronunciations.

Document Clustering using Non-negative Matrix Factorization and Fuzzy Relationship (비음수 행렬 분해와 퍼지 관계를 이용한 문서군집)

  • Park, Sun;Kim, Kyung-Jun
    • Journal of Advanced Navigation Technology
    • /
    • v.14 no.2
    • /
    • pp.239-246
    • /
    • 2010
  • This paper proposes a new document clustering method using NMF and fuzzy relationship. The proposed method can improve the quality of document clustering because the clustered documents by using fuzzy relation values between semantic features and terms to distinguish well dissimilar documents in clusters, the selected cluster label terms by using semantic features with NMF, which is used in document clustering, can represent an inherent structure of document set better. The experimental results demonstrate that the proposed method achieves better performance than other document clustering methods.

A Study on Computer Aided VLSI System Design (VLSI System CAD에 관한 연구)

  • 박진수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.8 no.1
    • /
    • pp.30-37
    • /
    • 1983
  • In this paper I have proposed a heuristic layout algorism which is important in the CAD system of VLSI. I have designed a placement algorism to be used the method which depends upon the synthetic judgment of human. The placement algorism can reflect the position of a module in a logical design circuit diagram drawn up by human beings. Also, in order to show the usefulness of the new method I have compared through a program experiment it with the former method of cluster development placement. Moreover, a routing algorism is proposed in order to reduce the excessive problem of memory capacity. Of course this new algorism compensates for the former Maze's defects.

  • PDF

Recognition of Partial Discharge Patterns (부분방전 패턴의 인식)

  • 이준호;이진우
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.14 no.2
    • /
    • pp.8-17
    • /
    • 2000
  • In this work, two approaches were proposed for the recognition of partial discharge patterns. The first approach was neural network with backpropagation algorithm, and the second approach was angle calculation between t재 operator vectors. PD signals were detected using three electrode systems; IEC(b), needle-plane and CIGRE method II electrode system. Both of neural network and angle comparison method showed good recognition performance for the patterns similar to the trained patterns. And the number of operators to be used had a great influence on the recognition performance to the untrained patterns.

  • PDF

Analyses on Viscosity Properties of $TiO_2$ Sol and $SiO_2$ Sol using Sol-Gel Method (솔젤법에 의해 제작된 $TiO_2$ 솔과 $SiO_2$ 솔의 점도 특성에 대한 분석)

  • You Do-Hyun
    • The Transactions of the Korean Institute of Electrical Engineers C
    • /
    • v.54 no.12
    • /
    • pp.573-577
    • /
    • 2005
  • [$TiO_2$] sol and $SiO_2$ sol were prepared using sol-gel method. As $H_{2}O$/Alkoxide ratios increased, sol had cluster structure and as $H_{2}O$/Alkoxide ratios decreased, sol had linear structure. Gelation time of $TiO_2$ sol was faster than that of $SiO_2$ sol according to the time. In comparison with initial viscosity between $TiO_2$ sol and $SiO_2$ sol, $TiO_2$ sol was highest at $H_{2}O/Ti(OC_{3}H_{7})_{4}=5$, $SiO_2$ sol was almost constant according to $H_{2}O/Si(OC_{2}H_{5})_{4}$ ratios.

Finding the Number of Clusters and Various Experiments Based on ASA Clustering Method (ASA 군집화를 이용한 군집수 결정 및 다양한 실험)

  • Yoon Bok-Sik
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.2
    • /
    • pp.87-98
    • /
    • 2006
  • In many cases of cluster analysis we are forced to perform clustering without any prior knowledge on the number of clusters. But in some clustering methods such as k-means algorithm it is required to provide the number of clusters beforehand. In this study, we focus on the problem to determine the number of clusters in the given data. We follow the 2 stage approach of ASA clustering algorithm and mainly try to improve the performance of the first stage of the algorithm. We verify the usefulness of the method by applying it for various kinds of simulated data. Also, we apply the method for clustering two kinds of real life qualitative data.

Efficient Block Packing to Minimize Wire Length and Area

  • Harashima, Katsumi;Ootaki, Yousuke;Kutsuwa, Toshirou
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1539-1542
    • /
    • 2002
  • In layout of LSI and PWB, block pack- ing problem is very important in order to reduce chip area. Sequence-pair is typical one of conventional pack- ing method and can search nearly-optimal solution by using Simulated Annealing(SA). SA takes huge computation time due to evaluating of various packing results. Therefore, Sequence-pair is not effective enough for fast layout evaluation including estimation of wire length and rotation of every blocks. This paper proposes an efficient block packing method to minimize wire length and chip area. Our method searches an optimal packing efficient- ly by using a cluster growth algorithm with changing the most valuable packing score on packing process.

  • PDF

An efficient iterative improvement technique for VLSI circuit partitioning using hybrid bucket structures (하이브리드 버켓을 이용한 대규모 집적회로에서의 효율적인 분할 개선 방법)

  • 임창경;정정화
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.3
    • /
    • pp.16-23
    • /
    • 1998
  • In this paper, we present a fast and efficient Iterative Improvement Partitioning(IIP) technique for VLSI circuits and hybrid bucket structures on its implementation. The IIP algorithms are very widely used in VLSI circuit partition due to their time efficiency. As the performance of these algorithms depends on choices of moving cell, various methods have been proposed. Specially, Cluster-Removal algorithm by S. Dutt significantly improved partition quality. We indicate the weakness of previous algorithms wjere they used a uniform method for choice of cells during for choice of cells during the improvement. To solve the problem, we propose a new IIP technique that selects the method for choice of cells according to the improvement status and present hybrid bucket structures for easy implementation. The time complexity of proposed algorithm is the same with FM method and the experimental results on ACM/SIGDA benchmark circuits show improvment up to 33-44%, 45%-50% and 10-12% in cutsize over FM, LA-3 and CLIP respectively. Also with less CUP tiem, it outperforms Paraboli and MELO represented constructive-partition methods by about 12% and 24%, respectively.

  • PDF

Fast Circuit Simulation Based on Parallel-Distributed LIM using Cloud Computing System

  • Inoue, Yuta;Sekine, Tadatoshi;Hasegawa, Takahiro;Asai, Hideki
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.10 no.1
    • /
    • pp.49-54
    • /
    • 2010
  • This paper describes a fast circuit simulation technique using the latency insertion method (LIM) with a parallel and distributed leapfrog algorithm. The numerical simulation results on the PC cluster system that uses the cloud computing system are shown. As a result, it is confirmed that our method is very useful and practical.