• Title/Summary/Keyword: Complexity analysis

Search Result 2,403, Processing Time 0.034 seconds

Process for the Architectural Application of Biomimicry (생체모방의 건축적 적용을 위한 프로세스)

  • Kim, Jong-Moo;Kang, Chul-Hee;Yoon, Heakyung
    • Journal of the Architectural Institute of Korea Planning & Design
    • /
    • v.34 no.12
    • /
    • pp.77-84
    • /
    • 2018
  • Biomimicry architecture has been highlighted in recent years for the innovative ideas from the nature have provided main developments in many areas. The related studies in Korean architecture is entering the first step and are needed close attentions for its vitalizations. This study starts with the acknowledgement of necessity to establish the architectural application process. First of all, it is named as a 'Passive Cycle' if a problem-solving or a project has been through the analysis of process complexity and biomimicry application process in other areas. Then, the basic frame is structured as a 'Process-Cooperation,' which integrates process complexation with process circulation. The cooperative relationship starts from the beginning of the design with not only professionalists related with architecture but also ones in various areas when it is issued a difficult problem or high environmental performance not found in common architectural design processes. To make the architectural application good progress, the characteristics of bio-mimetic architectural applications are categorized as three areas; the expected effect, the application level, and application method. As a result, the organic complexity should be prioritized to have bio-mimetic application effectively while accessing the principles. Therefore, the process for the architectural application of biomimicry is suggested as 'Organic Cycle-Cooperation.'

Replica Correlation-Based Synchronization with Low Complexity and Frequency Offset Immunity

  • Chang, Kapseok;Bang, Seung Chan;Kim, Hoon
    • ETRI Journal
    • /
    • v.35 no.5
    • /
    • pp.739-747
    • /
    • 2013
  • This paper investigates the multifarious nature of the long-term evolution (LTE) scheme and that of the modified LTE scheme for symbol timing synchronization (STS). This investigation allows us to propose a new replica correlation-based STS scheme to overcome the inherent weaknesses of the other two schemes. The proposed STS signal combines a gold sequence and a half sine wave in the time domain, whereas conventional STS signals specify either binary sequences or complex sequences in the time domain or in the frequency domain. In the proposed scheme, a sufficient correlation property is realized by the gold sequence, and robustness against the frequency offset (FO) is achieved through the sine wave. Compared to the existing LTE-related schemes, the proposed scheme can better achieve immunity to FO and reduction in detector complexity, as well as a low peak-to-average power ratio and a low detection error rate. Performance evaluations through analysis and simulation are provided in the paper to demonstrate these attributes.

Complexity Analysis of HM and JEM Encoder Software

  • Li, Xiang;Wu, Xiangjian;Marzuki, Ismail;Ahn, Yong-Jo;Sim, Donggyu
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2016.06a
    • /
    • pp.264-266
    • /
    • 2016
  • During the $2^{nd}$ JVET (Joint Group on Future Video Coding Technology Exploration) meeting, up to 22 coding tools focusing on Future Video Coding (FVC) were proposed. Despite that the application of proposed coding tools has a considerable performance enhancement, however, the encoding time of Joint Exploration Model (JEM) software is over 20 times for All Intra coding mode, 6 times for Random Access coding mode, of HEVC reference model (HM), and decoding time is 1.6 times for All Intra coding mode, 7.9 times for Random Access coding mode, of HM. This paper focuses on analyzing the complexity of the JEM software compared with HM.

  • PDF

Image Label Prediction Algorithm based on Convolution Neural Network with Collaborative Layer (협업 계층을 적용한 합성곱 신경망 기반의 이미지 라벨 예측 알고리즘)

  • Lee, Hyun-ho;Lee, Won-jin
    • Journal of Korea Multimedia Society
    • /
    • v.23 no.6
    • /
    • pp.756-764
    • /
    • 2020
  • A typical algorithm used for image analysis is the Convolutional Neural Network(CNN). R-CNN, Fast R-CNN, Faster R-CNN, etc. have been studied to improve the performance of the CNN, but they essentially require large amounts of data and high algorithmic complexity., making them inappropriate for small and medium-sized services. Therefore, in this paper, the image label prediction algorithm based on CNN with collaborative layer with low complexity, high accuracy, and small amount of data was proposed. The proposed algorithm was designed to replace the part of the neural network that is performed to predict the final label in the existing deep learning algorithm by implementing collaborative filtering as a layer. It is expected that the proposed algorithm can contribute greatly to small and medium-sized content services that is unsuitable to apply the existing deep learning algorithm with high complexity and high server cost.

AN ECHO CANCELLATION ALGORITHM FOR REDUCING THE HARDWARE COMPLEXITIES AND ANALYSIS ON ITS CONVERGENCE CHARACTERISTICS

  • LEE HAENG-WOO
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.1_2
    • /
    • pp.637-645
    • /
    • 2006
  • An adaptive algorithm for reducing the hardware complexity is presented. This paper proposes a simplified LMS algorithm for the adaptive system and analyzes its convergence characteristics mathematically. An objective of the proposed algorithm is to reduce the hardware complexity. In order to test the performances, it is applied to the echo canceller, and a program is described. The results from simulations show that the echo canceller adopting the proposed algorithm achieves almost the same performances as one adopting the NLMS algorithm. If an echo canceller is implemented with this algorithm, its computation quantities are reduced to the half as many as the one that is implemented with the LMS algorithm, without so much degradation of performances.

A comparison study of the performance and computational complexity of various MIMO technoques in WiBro downlink system (WiBro 다운링크 환경에서 여러 가지 MIMO 기법의 성능 및 연산량에 대한 비교 연구)

  • Hong, Gyeong-Hua;Oh, Tae-Youl;Choi, Seung-Won
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.4 no.2
    • /
    • pp.49-55
    • /
    • 2008
  • Combining OFDMA with MIMO is the key technology for the 4G mobile communication. OFDMA can relieve inherent difficulties of high-speed transmission. MIMO technology can be largely categorized into two techniques: one is STC for diversity gain and the other is SM for high frequency efficiency. In this paper, we depict various MIMO techniques of two transmit antenna and compare the computational complexity of decoding process for the techniques. Then, we analysis the performance of the techniques in the WiBro downlink environment based on OFDMA. We perfer ML algorithm which is the optimum performance and ZF algorithm of least computational complexity for SM detection.

Improved Method for the Macroblock-Level Deblocking Scheme

  • Le, Thanh Ha;Jung, Seung-Won;Baek, Seung-Jin;Ko, Sung-Jea
    • ETRI Journal
    • /
    • v.33 no.2
    • /
    • pp.194-200
    • /
    • 2011
  • This paper presents a deblocking method for video compression in which the blocking artifacts are effectively extracted and eliminated based on both spatial and frequency domain operations. Firstly, we use a probabilistic approach to analyze the performance of the conventional macroblock-level deblocking scheme. Then, based on the results of the analysis, an algorithm to reduce the computational complexity is introduced. Experimental results show that the proposed algorithm outperforms the conventional video coding methods in terms of computation complexity while coding efficiency is maintained.

Performance Analysis of Layer Pruning on Sphere Decoding in MIMO Systems

  • Karthikeyan, Madurakavi;Saraswady, D.
    • ETRI Journal
    • /
    • v.36 no.4
    • /
    • pp.564-571
    • /
    • 2014
  • Sphere decoding (SD) for multiple-input and multiple-output systems is a well-recognized approach for achieving near-maximum likelihood performance with reduced complexity. SD is a tree search process, whereby a large number of nodes can be searched in an effort to find an estimation of a transmitted symbol vector. In this paper, a simple and generalized approach called layer pruning is proposed to achieve complexity reduction in SD. Pruning a layer from a search process reduces the total number of nodes in a sphere search. The symbols corresponding to the pruned layer are obtained by adopting a QRM-MLD receiver. Simulation results show that the proposed method reduces the number of nodes to be searched for decoding the transmitted symbols by maintaining negligible performance loss. The proposed technique reduces the complexity by 35% to 42% in the low and medium signal-to-noise ratio regime. To demonstrate the potential of our method, we compare the results with another well-known method - namely, probabilistic tree pruning SD.

Corporate Meeting Destination Choice: The Effects of Organizational Structure

  • Ariffin, Ahmad Azrni M.;Ishak, Nor Khomar
    • Journal of Global Scholars of Marketing Science
    • /
    • v.16 no.4
    • /
    • pp.75-95
    • /
    • 2006
  • This study attempted to determine the influence of organizational structure on the novelty preference for corporate meeting destination choice. The three dimensions of structure incorporated were formalization, centralization and complexity. A total of 75 corporate meeting planners drawn from public listed services organizations were involved. The main method of data collection was questionnaire survey and multiple regression analysis was employed as the main statistical technique. The results revealed that both formalization and centralization were negatively correlated with novelty preference while complexity was positively correlated. However, only complexity contributed significantly to the prediction of novelty preference for corporate meeting destination choice. The main implication of this study is pertaining to the segmentation and targeting of the corporate meeting market. This study helped in bridging the gap between tourism marketing and organizational research. It also contributed by developing the measurement for novelty preference from the context of experiential marketing.

  • PDF

A Study on Proper Acquisition Cost Estimation Using the PRICE Model (PRICE모델을 이용한 적정 획득비용 추정 방안)

  • 한현진;강성진
    • Journal of the military operations research society of Korea
    • /
    • v.27 no.1
    • /
    • pp.10-27
    • /
    • 2001
  • This paper deals with the application of PRICE model in estimating the proper acquisition cost for weapon budgeting phase. The PRICE(Parametric Review of Information for Costing and Evaluation) Hardware model is a computerized method for deriving cost estimates of electronic and mechanical hardware assemblies and systems. The model can be used in obtaining not only initial cost estimates in conceptual phase, but also detailed cost estimates in budgeting phase depending on available historical and empirical data. We analyzed first step cost estimate parameters and derived cost equations using PRICe output dta. Using weight and complexity, We can find cost variation. Sensitivity analysis shows that cost increases exponentially as complexity increases exponentially as complexity increases. We estimated KAAV\`s (Korea Amphibious Assault Vehicle) production cost using the PRICE model and compare with engineering cost estimates which is based on actual production data submitted by the production company. The result shows that tow estimates are close within $\pm2%$ differences.

  • PDF