• Title/Summary/Keyword: partitioning approach

Search Result 160, Processing Time 0.018 seconds

Design of Pipelined Parallel CRC Circuits (파이프라인 구조를 적용한 병렬 CRC 회로 설계)

  • Yi, Hyun-Bean;Kim, Ki-Tae;Kwon, Young-Min;Park, Sung-Ju
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.43 no.6 s.312
    • /
    • pp.40-47
    • /
    • 2006
  • This paper introduces an efficient CRC logic partitioning algorithm to design pipelined parallel CRC circuits aimed at improving speed performance. Focusing on the cases that the input data width is greater than the polynomial degree, equations are derived to divide the parallel CRC logic and decide the length of the pipeline stage. Through design experiments on different types of parallel CRC circuits, we have found a significant reduction in delay by adopting our approach.

Efficient Global Placement Using Hierarchical Partitioning Technique and Relaxation Based Local Search (계층적 분할 기법과 완화된 국부 탐색 알고리즘을 이용한 효율적인 광역 배치)

  • Sung Young-Tae;Hur Sung-Woo
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.12
    • /
    • pp.61-70
    • /
    • 2005
  • In this paper, we propose an efficient global placement algorithm which is an enhanced version of Hybrid Placer$^{[25]}$, a standard cell placement tool, which uses a middle-down approach. Combining techniques used in the well-known partitioner hMETIS and the RBLS(Relaxation Based Local Search) in Hybrid Placer improves the quality of global placements. Partitioning techniques of hMETIS is applied in a top-down manner and RBLS is used in each level of the top-down hierarchy to improve the global placement. The proposed new approach resolves the problem that Hybrid Placer seriously depends on initial placements and it speeds up without deteriorating the placement quality. Experimental results prove that solutions generated by the proposed method on the MCNC benchmarks are comparable to those by FengShui which is a well known placement tool. Compared to the results of the original Hybrid Placer, new method is 5 times faster on average and shows improvement on bigger circuits.

An Efficient Clustering Algorithm for Massive GPS Trajectory Data (대용량 GPS 궤적 데이터를 위한 효율적인 클러스터링)

  • Kim, Taeyong;Park, Bokuk;Park, Jinkwan;Cho, Hwan-Gue
    • Journal of KIISE
    • /
    • v.43 no.1
    • /
    • pp.40-46
    • /
    • 2016
  • Digital road map generation is primarily based on artificial satellite photographing or in-site manual survey work. Therefore, these map generation procedures require a lot of time and a large budget to create and update road maps. Consequently, people have tried to develop automated map generation systems using GPS trajectory data sets obtained by public vehicles. A fundamental problem in this road generation procedure involves the extraction of representative trajectory such as main roads. Extracting a representative trajectory requires the base data set of piecewise line segments(GPS-trajectories), which have close starting and ending points. So, geometrically similar trajectories are selected for clustering before extracting one representative trajectory from among them. This paper proposes a new divide- and-conquer approach by partitioning the whole map region into regular grid sub-spaces. We then try to find similar trajectories by sweeping. Also, we applied the $Fr{\acute{e}}chet$ distance measure to compute the similarity between a pair of trajectories. We conducted experiments using a set of real GPS data with more than 500 vehicle trajectories obtained from Gangnam-gu, Seoul. The experiment shows that our grid partitioning approach is fast and stable and can be used in real applications for vehicle trajectory clustering.

Habitat selectivity of fresh water fishes of two second-order tropical streams in Tigray, Northern Ethiopia

  • Tesfay, Solomon;Teferi, Mekonen;Tsegazeabe, Haileselasie Hadush
    • Journal of Ecology and Environment
    • /
    • v.43 no.1
    • /
    • pp.73-83
    • /
    • 2019
  • Background: Habitat selectivity and ecology of freshwater fishes were studied in two selected streams and their junction point which consist a total of 39 microhabitats. The aims of this study were to describe the habitat preference and its availability to fish assemblage, as well as ecology, habitat use, and habitat characteristics. Methods: We collected fish with backpack electrofishing three times during August 2013, December 2013, and March 2014. Using a variation partitioning approach of R software, we studied the relationship of fish abundances with stream type, habitat type, and abundance of key macroinvertebrate taxa. Results: A total of 6554 fishes representing four species belonging to the family Cyprinidae were caught. A higher total fish abundance was recorded from Gereb Tsedo (4870; 74.3%) than from Elala stream (1684; 25.7%). Taking both streams together, the overall total relative fish abundance was significantly higher in pools (53%) than in runs (35%) and in riffles (12%) at P < 0.05. Species-wise comparisons showed that 71%, 15%, 13%, and 1% of the pool fish community were occupied by Garra blanfordii, Garra ignestii, Garra dembecha, and Garra aethiopica, respectively. Stream type, habitat type, and key macroinvertebrate taxa each explained a significant proportion of the variation in fish abundance. Based on the variation partitioning approach, fish abundance was higher in Gereb Tsedo stream (P < 0.01). Moreover, fish abundance increased with pool habitat type (P < 0.01) and with availability of key macroinvertebrate taxa (P < 0.01). Conclusion: Fish abundance differed between stream types, among habitats and among key macroinvertebrate taxa availability. Among the factors, habitat type was the most important driving factor behind variation among fish abundances, and pool supports the highest fish abundance.

A genetic-algorithm-based high-level synthesis for partitioned bus architecture (유전자 알고리즘을 이용한 분할 버스 아키텍처의 상위 수준 합성)

  • 김용주;최기영
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.3
    • /
    • pp.1-10
    • /
    • 1997
  • We present an approach to high-level synthesis for a specific target architecture-partitioned bus architecture. In this approach, we have specific goals of minimizing data transfer length and number of buses in addition to common synthesis goals such as minimizing number of control steps and satisfying given resource constraint. Minimizing data transfer length and number of buses can be very important design goals in the era of deep submicron technology in which interconnection delay and area dominate total delay and area of the chip to be designed. in partitioned bus architecture, to get optimal solution satisfying all the goals, partitioning of operation nodes among segments and ordering of segments as well as scheduling and allocation/binding must be considered concurrently. Those additional goals may impose much more complexity on the existing high-level synthesis problem. To cope with this increased complexity and get reasonable results, we have employed two ideas in ur synthesis approach-extension of the target architecture to alleviate bus requirement for data transfer and adoption of genetic algorithm as a principal methodology for design space exploration. Experimental results show that our approach is a promising high-level synthesis mehtodology for partitioned bus architecture.

  • PDF

A Hybrid Approach for Automated Building Area Extraction from High-Resolution Satellite Imagery (고해상도 위성영상을 활용한 자동화된 건물 영역 추출 하이브리드 접근법)

  • An, Hyowon;Kim, Changjae;Lee, Hyosung;Kwon, Wonsuk
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.37 no.6
    • /
    • pp.545-554
    • /
    • 2019
  • This research aims to provide a building area extraction approach over the areas where data acquisition is impossible through field surveying, aerial photography and lidar scanning. Hence, high-resolution satellite images, which have high accessibility over the earth, are utilized for the automated building extraction in this study. 3D point clouds or DSM (Digital Surface Models), derived from the stereo image matching process, provides low quality of building area extraction due to their high level of noises and holes. In this regards, this research proposes a hybrid building area extraction approach which utilizes 3D point clouds (from image matching), and color and linear information (from imagery). First of all, ground and non-ground points are separated from 3D point clouds; then, the initial building hypothesis is extracted from the non-ground points. Secondly, color based building hypothesis is produced by considering the overlapping between the initial building hypothesis and the color segmentation result. Afterwards, line detection and space partitioning results are utilized to acquire the final building areas. The proposed approach shows 98.44% of correctness, 95.05% of completeness, and 1.05m of positional accuracy. Moreover, we see the possibility that the irregular shapes of building areas can be extracted through the proposed approach.

On Top-Down Design of MPEG-2 Audio Encoder

  • Park, Sung-Wook
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.8 no.1
    • /
    • pp.75-81
    • /
    • 2008
  • This paper presents a top-down approach to implement an MPEG-2 audio encoder in VLSI. As the algorithm of an MPEG-2 audio encoder is heavy-weighted and heterogeneous(to be mixture of several strategies), the encoder design process is undertaken carefully from the algorithmic level to the architectural level. Firstly, the encoding algorithm is analyzed and divided into sub-algorithms, called tasks, and the tasks are partitioned in the way of reusing the same designs. Secondly, the partitioned tasks are scheduled and synthesized to make the most efficient use of time and space. In the end, a real-time 5 channel MPEG-2 audio encoder is designed which is a heterogeneous multiprocessor system; two hardwired logic blocks and one specialized DSP processor.

Dynamic Analysis of a Moving Vehicle on Flexible Beam structures ( I ) : General Approach

  • Park, Tae-Won;Park, Chan-Jong
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.3 no.4
    • /
    • pp.54-63
    • /
    • 2002
  • In recent years, mechanical systems such as high speed vehicles and railway trains moving on elastic beam structures have become a very important issue to consider. In this paper, a general approach, which can predict the dynamic behavior of a constrained mechanical system moving on a flexible beam structure, is proposed. Various supporting conditions for the foundation support are considered for the elastic beam structure. The elastic structure is assumed to be a non-uniform and linear Bernoulli-Euler beam with a proportional damping effect. Combined differential-algebraic equation of motion is derived using the multi-body dynamics theory and the finite element method. The proposed equations of motion can be solved numerically using the generalized coordinate partitioning method and predictor-corrector algorithm, which is an implicit multi-step integration method.

Dynamic Analysis of a Moving Vehicle on Flexible beam Structure (II) : Application

  • Park, Tae-Won;Park, Chan-Jong
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.3 no.4
    • /
    • pp.64-71
    • /
    • 2002
  • Recently, mechanical systems such as a high-speed vehicles and railway trains moving on flexible beam structures have become a very important issue to consider. Using the general approach proposed in the first part of this paper, it is possible to predict motion of the constrained mechanical system and the elastic structure, with various kinds of foundation supporting conditions. Combined differential-algebraic equation of motion derived from both multibody dynamics theory and finite element method can be analyzed numerically using a generalized coordinate partitioning algorithm. To verify the validity of this approach, results from the simply supported elastic beam subjected to a moving load are compared with the exact solution from a reference. Finally, parametric study is conducted for a moving vehicle model on a simply supported 3-span bridge.

OPTIMAL DESIGN MODEL FOR A DISTRIBUTED HIERARCHICAL NETWORK WITH FIXED-CHARGED FACILITIES

  • Yoon, Moon-Gil;Baek, Young-Ho;Tcha, Dong-Wan
    • Management Science and Financial Engineering
    • /
    • v.6 no.2
    • /
    • pp.29-45
    • /
    • 2000
  • We consider the design of a two-level telecommunication network having logical full-mesh/star topology, with the implementation of conduit systems taken together. The design problem is then viewed as consisting of three subproblems: locating hub facilities, placing a conduit network, and installing cables therein to configure the logical full-mesh/star network. Without partitioning into subproblems as done in the conventional approach, the whole problem is directly dealt with in a single integrated framework, inspired by some recent successes with the approach. We successfully formulate the problem as a variant of the classical multicommodity flow model for the fixed charge network design problem, aided by network augmentation, judicious commodity definition, and some flow restrictions. With our optimal model, we solve some randomly generated sample problems by using CPLEX MIP program. From the computational experiments, it seems that our model can be applied to the practical problem effectively.

  • PDF