• Title/Summary/Keyword: Linear Time Complexity

Search Result 247, Processing Time 0.023 seconds

ON A REDUCTION OF PITCH SEARCHING TIME BY PREPROCESSING IN THE CELP VOCODER

  • Kim, Daesik;Bae, Myungjin;Kim, Jongjae;Byun, Kyungjin;Han, Kichun;Yoo, Hahyoung
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1994.06a
    • /
    • pp.904-911
    • /
    • 1994
  • Code Excited Linear Prediction (CELP) speech coders exhibit good performance at data rates below 4.8 kbps. The major drawback to CELP type coders is their many computation. In this paper, we propose a new pitch search method that preserves the quality of the CELP vocoder with reducing complexity. The basic idea is to apply the preprocessing technique beforehand grasping the autocorrelation property of speech waveform. By using the proposed method, we can get approximately 77% complexity reduction in the pitch search.

  • PDF

Complexity Issues of Perfect Roman Domination in Graphs

  • Chakradhar, Padamutham;Reddy, Palagiri Venkata Subba
    • Kyungpook Mathematical Journal
    • /
    • v.61 no.3
    • /
    • pp.661-669
    • /
    • 2021
  • For a simple, undirected graph G = (V, E), a perfect Roman dominating function (PRDF) f : V → {0, 1, 2} has the property that, every vertex u with f(u) = 0 is adjacent to exactly one vertex v for which f(v) = 2. The weight of a PRDF is the sum f(V) = ∑v∈V f(v). The minimum weight of a PRDF is called the perfect Roman domination number, denoted by γRP(G). Given a graph G and a positive integer k, the PRDF problem is to check whether G has a perfect Roman dominating function of weight at most k. In this paper, we first investigate the complexity of PRDF problem for some subclasses of bipartite graphs namely, star convex bipartite graphs and comb convex bipartite graphs. Then we show that PRDF problem is linear time solvable for bounded tree-width graphs, chain graphs and threshold graphs, a subclass of split graphs.

High-Speed Transformer for Panoptic Segmentation

  • Baek, Jong-Hyeon;Kim, Dae-Hyun;Lee, Hee-Kyung;Choo, Hyon-Gon;Koh, Yeong Jun
    • Journal of Broadcast Engineering
    • /
    • v.27 no.7
    • /
    • pp.1011-1020
    • /
    • 2022
  • Recent high-performance panoptic segmentation models are based on transformer architectures. However, transformer-based panoptic segmentation methods are basically slower than convolution-based methods, since the attention mechanism in the transformer requires quadratic complexity w.r.t. image resolution. Also, sine and cosine computation for positional embedding in the transformer also yields a bottleneck for computation time. To address these problems, we adopt three modules to speed up the inference runtime of the transformer-based panoptic segmentation. First, we perform channel-level reduction using depth-wise separable convolution for inputs of the transformer decoder. Second, we replace sine and cosine-based positional encoding with convolution operations, called conv-embedding. We also apply a separable self-attention to the transformer encoder to lower quadratic complexity to linear one for numbers of image pixels. As result, the proposed model achieves 44% faster frame per second than baseline on ADE20K panoptic validation dataset, when we use all three modules.

Performance Comparison of Optimal Power Flow Algorithms for LMP Calculations of the Full Scale Korean Power System

  • Lee, Sungwoo;Kim, Wook;Kim, Balho H.
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.1
    • /
    • pp.109-117
    • /
    • 2015
  • This paper proposes the comparison results of various optimal power flow algorithms (OPF) to calculate the locational marginal prices (LMP) of the unreduced full scale Korean transmission system. Five different types of optimal power flow models are employed: Full AC OPF, Cubic AC OPF, Quadratic AC OPF, Linear AC OPF and DC OPF. As the results, full AC OPF and cubic AC OPF model provides LMP calculation results very similar to each other while the calculation time of cubic AC OPF model is faster than that of the Full AC OPF. Other simplified OPF models, quadratic AC OPF, linear AC OPF and DC OPF offer erroneous results even though the calculation times are much faster than the Full AC OPF and the Cubic AC OPF. Given the condition that the OPF models sometimes fail to find the optimal solution due to the severe complexity of the Korean transmission power system, the Full AC OPF should be used as the primary OPF model while the Cubic AC OPF can be a promising backup OPF model for the LMP calculations and/or real-time operation.

A Case Study on the Improvement of Display FAB Production Capacity Prediction (디스플레이 FAB 생산능력 예측 개선 사례 연구)

  • Ghil, Joonpil;Choi, Jin Young
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.43 no.2
    • /
    • pp.137-145
    • /
    • 2020
  • Various elements of Fabrication (FAB), mass production of existing products, new product development and process improvement evaluation might increase the complexity of production process when products are produced at the same time. As a result, complex production operation makes it difficult to predict production capacity of facilities. In this environment, production forecasting is the basic information used for production plan, preventive maintenance, yield management, and new product development. In this paper, we tried to develop a multiple linear regression analysis model in order to improve the existing production capacity forecasting method, which is to estimate production capacity by using a simple trend analysis during short time periods. Specifically, we defined overall equipment effectiveness of facility as a performance measure to represent production capacity. Then, we considered the production capacities of interrelated facilities in the FAB production process during past several weeks as independent regression variables in order to reflect the impact of facility maintenance cycles and production sequences. By applying variable selection methods and selecting only some significant variables, we developed a multiple linear regression forecasting model. Through a numerical experiment, we showed the superiority of the proposed method by obtaining the mean residual error of 3.98%, and improving the previous one by 7.9%.

Ne-Ne 레이저의 간섭을 이용한 고정밀 리니어 스케일의 제작에 관한 연구

  • 전병욱;박두원;이명호;한응교
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1991.04a
    • /
    • pp.176-194
    • /
    • 1991
  • A study on the Manufactiring of High-Precision Linear Scale by the Use of He-Ne Laser Interference Of late, along with the advancement of procision machining technology, the reauirement of super-precision measurement increases as time goes on, and the precision and accuracy of standard scale which is a basis of procision measurement has been cognized as a oriterion of industrial development in a nation. Up to now, mechanical and chemical methods have been widely employed to carve scale lines on linear scale, and it is impossible for the linear scale manufactured by means of those methods to guarantee the measurement with sub-micron level owing to errors attended with various problems. And the measuring length also bears errors subjected to the influence of surroundings condition, and shows inefficient circumstances in measurement on the ground of the complexity of measuring procedure as well as massive measuring apparatus. Hence in this paper, we described on technology by which we can carve scale lines thru optical method under the condition of laboratory by using rhcoherence of He-Ne two-mode stabilized laser and in turn, put it to practical use as linear scale for the measurment of lengrh. In this researchin the case of setting scale interval to 20 .mu. m, we employed super-precision scale-carving device associated by Ar larser and acoustic optical modulator in lieu of flsahing lamp scale-carving device, and we consequently obtained superior linear scales carved with precision and accuracy of .+-. 0.3 .mu. m.

Constant Time Algorithm for Alignment of Unaligned Linear Quadtrees on RMESH (RMESH구조에서 unaligned 선형 사진트리의 alignment를 위한 상수시간 알고리즘)

  • 김경훈;우진운
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.1_2
    • /
    • pp.10-18
    • /
    • 2004
  • Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The operations of unaligned linear quadtrees, which are operations among the linear quadtrees with different origin, are able to perform the translated or rotated images efficiently. And this operations requires alignment of the linear quadtrees. In this paper, we present an efficient algorithm to perform alignment of unaligned linear quadtrees, using three-dimensional $n{\pm}n{\pm}n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of $n{\pm}n{\pm}n$ RMESH.

Constant Time RMESH Algorithm for Linear Translation of Linear Quadtrees (선형 사진트리의 선형이동을 위한 상수시간 RMESH 알고리즘)

  • Kim, Kyung-Hoon;Woo, Jin-Woon
    • The KIPS Transactions:PartA
    • /
    • v.10A no.3
    • /
    • pp.207-214
    • /
    • 2003
  • Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The linear translation is one of important operations in image processing, which moves the image by a given distance. In this paper, we present an algorithm to perform the linear translation of binary images represented by quadtrees, using three-dimensional $n{\times}n{\times}n$ processors on RMESH (Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of n${\times}$n${\times}$n RMESH.

Design and Performance Analysis of a DS/CDMA Multiuser Detection Algorithm in a Mixed Structure Form (혼합구조 형태의 DS/CDMA 다중사용자 검파 알고리즘 설계 및 성능 분석)

  • Lim, Jong-Min
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.39 no.3
    • /
    • pp.51-58
    • /
    • 2002
  • The conventional code division multiple access(CDMA) detector shows severe degradation in communication quality as the number of users increases due to multiple access interferences(MAI). This problem thus restricts the user capacity. Various multiuser detection algorithms have been proposed to overcome the MAI problem. The existing detectors can be generally classified into one of the two categories : linear multiuser detection and subtractive interference cancellation detectors. In the linear multiuser detection, a linear transform is applied to the soft outputs of the conventional detector. In the subtractive interference cancellation detection, estimates of the interference are generated and subtracted out from the received signal. There has been great interest in the family of the subtractive interference cancellation detection because the linear multiuser detection exhibits the disadvantage of taking matrix inversion operations. The successive interference cancellation (SIC) and the parallel interference cancellation (PIC) are the two most popular structures in the subtractive interference cancellation detector. The SIC structure is very simple in hardware complexity, but has the disadvantage of increased processing delay time, while the PIC structure is good in performance, but shows the disadvantage of increased hardware complexity. In this paper we propose a mixed structure form of SIC and PIC in order to achieve good performance as well as simple hardware complexity. A performance analysis of the proposed scheme has been made, and the superior characteristics of the mixed structure are demonstrated by extensive computer simulations. 

A Study on Design and Implementation of Scalable Angle Estimator Based on ESPRIT Algorithm (ESPRIT 알고리즘 기반 재구성 가능한 각도 추정기 설계에 관한 연구)

  • Dohyun Lee;Byunghyun Kim;Jongwha Chong;Sungjin Lee;Kyeongyuk Min
    • Journal of IKEEE
    • /
    • v.27 no.4
    • /
    • pp.624-629
    • /
    • 2023
  • Estimation of signal parameters via rotational invariance techniques (ESPRIT) is an algorithm that estimates the angle of a signal arriving at an array antenna using the shift invariance property of an array antenna. ESPRIT offers the good trade-off between performance and complexity. However, the ESPRIT algorithm still requires high-complexity operations such as covariance matrix and eigenvalue decomposition, so implementation with a hardware processor is essential to estimate the angle of arrival in real time. In addition, ESPRIT processors should have high performance. The performance is related to the number of antennas, and the number of antennas required for each application are different. Therefore, we proposed an ESPRIT processor that provides 2 to 8 variable antenna configurations to meet the performance and complexity requirements according to the applied field. The proposed ESPRIT processor was designed using the Verilog-HDL and implemented on a field programmable gate array (FPGA).