• 제목/요약/키워드: Time complexity

검색결과 3,063건 처리시간 0.028초

복잡계로서의 건축개념과 조형적 특성에 관한 연구(I) (The Architectural Concepts and Design Properties as a Complex System)

  • 김주미
    • 한국실내디자인학회논문집
    • /
    • 제22호
    • /
    • pp.123-131
    • /
    • 2000
  • The purpose of this study is to propose a new design concept and properties within new paradigm. Contemporary students of architectural design seem to redefine the mechanic and reductive approach to design method based upon Euclidean geometry. In this study, the organic space-time and holistic view-point that constitutes the background for all this is radically different from the modern design. It consists of three sections as follow: First, it presents a concept of complex system and properties of complexity that we find in new natural science and tries to combine that news geometry with architectural design to provide a methodological basis for morphogenesis and transformation. Second, the complexity in architecture is defined as a fractal shape, folded space, and irreducible organic system that cannot be fully understood by modernist idea of architecture. Third, the complexity in architecture is strategy based on the electronic paradigm that would enable the emergence of creative possibility. The complexity theory offer new insights to explain not only natural laws but also define dynamic architecture. In fine, this study places a great emphasis on the organic world-view to the spatial organization, which I hope will contribute to generating a greater number of creative possibilities for design.

  • PDF

커뮤니티센터로서 농촌 마을회관의 복합화에 따른 이용실태 및 공간구성에 관한 연구 -전라북도 임실군을 중심으로- (A Study on Utilization and the Spatial Organization of Complexity for Community Center in Rural - Focused on Imsil-Gun in Jeollabukdo -)

  • 박창선
    • 한국농촌건축학회논문집
    • /
    • 제10권3호
    • /
    • pp.35-42
    • /
    • 2008
  • The purpose of this study is to suggest the possibility of complexity use these facilities for elderly welfare facility or public health facility and community center in rural. For this purpose this article researched into elderly welfare facilities, public health facilities and social welfare centers. And we studied of village community center, life pattern in old people in rural. With a rapidly increase in population of older people in rural, there is a great demand for the construction of complexes facilities. Particularly, there was highly demand for the public health facilities and the welfare programme of physiotherapy facilities on village community center in rural. However, there is not a intersection of space composition and specification function between elderly welfare facilities and public healthcare facilities and community welfare centers in this time. Accordingly, in the future plan for community center in rural, it is necessary to consider integration with public health facility. And it is necessary to compose the community center in consideration of the spatial organization of complexity as a possibility of community welfare activities.

  • PDF

저연산량의 효율적인 콘볼루션 신경망 (Efficient Convolutional Neural Network with low Complexity)

  • 이찬호;이중경;호콩안
    • 전기전자학회논문지
    • /
    • 제24권3호
    • /
    • pp.685-690
    • /
    • 2020
  • 휴대용 기기나 에지 단말을 위한 CNN인 MobileNet V2를 기반으로 연산량을 크게 줄이면서도 정확도는 증가시킨 효율적인 인공신경망 네트워크 구조를 제안한다. 제안하는 구조는 Bottleneck 층 구조를 유지하면서 확장 계수를 증가시키고 일부 층을 제거하는 등의 변화를 통해 연산량을 절반 이하로 줄였다. 설계한 네트워크는 ImageNet100 데이터셋을 이용하여 분류 정확도와 CPU 및 GPU에서의 연산 시간을 측정하여 그 성능을 검증 하였다. 또한, 현재 딥러닝 가속기로 널리 이용하는 GPU에서 네트워크 구조에 따라 동작 성능이 달라짐도 보였다.

인접한 블럭의 움직임 벡터를 이용한 수정된 삼단계 움직임 추정 기법 (Modified three step search using adjacent block's motion vectors)

  • 오황석;백윤주;이흥규
    • 한국통신학회논문지
    • /
    • 제22권9호
    • /
    • pp.2053-2061
    • /
    • 1997
  • 움직임 보상 부호화 가법은 연속한 비디오 프레임간의 시간적 증복성을 제거하기 때문에 비디오 영상 압축에 매우 중요한 역합을 한다. 그러나 많은 계산량으로 인하여 실시간 응용이나 고해상도 응용에 많은 어려움이 있다. 이러한 문제점을 해결하기 위하여 빠른 탑색 가법과 하드웨어 설계 기법이 활발히 연구되어 왔다. 특히 계산량을 크게 줄이고 안정된 성능을 갖는 삼단계 탐색 기법이 널리 이용되고 있으며 이를 기반으로 한 새로운 탐색 기법들이 제안되었다 본 논문에서는 인접한 블럭들의 움직임 벡터가 미치는 영향을 고려하여 수정된 삼단계 탐색 기법을 제안하고 이의 성능을 평가한다. 실험에 의하여 제안된 기법이 삼단계 탐색 기법에 비교하여 적은 계산량을 가지며, MAE 측면에서 이득이 있음을 보였다.

  • PDF

Low-Complexity Energy Efficient Base Station Cooperation Mechanism in LTE Networks

  • Yu, Peng;Feng, Lei;Li, Zifan;Li, Wenjing;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권10호
    • /
    • pp.3921-3944
    • /
    • 2015
  • Currently Energy-Saving (ES) methods in cellular networks could be improved, as compensation method for irregular Base Station (BS) deployment is not effective, most regional ES algorithm is complex, and performance decline caused by ES action is not evaluated well. To resolve above issues, a low-complexity energy efficient BS cooperation mechanism for Long Time Evolution (LTE) networks is proposed. The mechanism firstly models the ES optimization problem with coverage, resource, power and Quality of Service (QoS) constraints. To resolve the problem with low complexity, it is decomposed into two sub-problems: BS Mode Determination (BMD) problem and User Association Optimization (UAO) problem. To resolve BMD, regional dynamic multi-stage algorithms with BS cooperation pair taking account of load and geographic topology is analyzed. And then a distributed heuristic algorithm guaranteeing user QoS is adopted to resolve UAO. The mechanism is simulated under four LTE scenarios. Comparing to other algorithms, results show that the mechanism can obtain better energy efficiency with acceptable coverage, throughput, and QoS performance.

L2 한국어 통사 발달과 학습자 변인에 대한 종적 고찰: 자연 학습 환경의 예 (A Longitudinal Investigation on L2 Korean Syntactic Development and Learner Variables: Evidence from Natural Learning Environment)

  • 김정운;김영주;이선진
    • 한국어교육
    • /
    • 제28권4호
    • /
    • pp.1-38
    • /
    • 2017
  • This longitudinal study analyzed syntactic development (Complexity, Accuracy, and Fluency; CAF) of six L2 Korean learners in a natural learning context. The learners recalled the stories of a short animated video through speaking and writing every 3 months, from month 0 to 15. The learners' responses were analyzed for a series of CAF measures and their cognitive, psychological, and social variables were investigated. The results showed that (i) L2 Korean learners' speaking and writing in various time periods showed significant differences in spoken and written accuracy, and complexity; (ii) the correlation between spoken and written complexity, spoken and written accuracy, as well as spoken and written fluency were significant, and (iii) the regression analysis showed that learners' cognitive, social, and psychological variables have significant effect on the L2 Korean syntactic development. The current study reports that L2 Korean learners engaged in self-learning in a natural learning environment without formal instruction made significant syntactic development.

Low-complexity de-mapping algorithms for 64-APSK signals

  • Bao, Junwei;Xu, Dazhuan;Zhang, Xiaofei;Luo, Hao
    • ETRI Journal
    • /
    • 제41권3호
    • /
    • pp.308-315
    • /
    • 2019
  • Due to its high spectrum efficiency, 64-amplitude phase-shift keying (64-APSK) is one of the primary technologies used in deep space communications and digital video broadcasting through satellite-second generation. However, 64-APSK suffers from considerable computational complexity because of the de-mapping method that it employs. In this study, a low-complexity de-mapping method for (4 + 12 + 20 + 28) 64-APSK is proposed in which we take full advantage of the symmetric characteristics of each symbol mapping. Moreover, we map the detected symbol to the first quadrant and then divide the region in this first quadrant into several partitions to simplify the formula. Theoretical analysis shows that the proposed method requires no operation of exponents and logarithms and involves only multiplication, addition, subtraction, and judgment. Simulation results validate that the time consumption is dramatically decreased with limited degradation of bit error rate performance.

Harmonic-Mean-Based Dual-Antenna Selection with Distributed Concatenated Alamouti Codes in Two-Way Relaying Networks

  • Li, Guo;Gong, Feng-Kui;Chen, Xiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권4호
    • /
    • pp.1961-1974
    • /
    • 2019
  • In this letter, a harmonic-mean-based dual-antenna selection scheme at relay node is proposed in two-way relaying networks (TWRNs). With well-designed distributed orthogonal concatenated Alamouti space-time block code (STBC), a dual-antenna selection problem based on the instantaneous achievable sum-rate criterion is formulated. We propose a low-complexity selection algorithm based on the harmonic-mean criterion with linearly complexity $O(N_R)$ rather than the directly exhaustive search with complexity $O(N^2_R)$. From the analysis of network outage performance, we show that the asymptotic diversity gain function of the proposed scheme achieves as $1/{\rho}{^{N_R-1}}$, which demonstrates one degree loss of diversity order compared with the full diversity. This slight performance gap is mainly caused by sacrificing some dual-antenna selection freedom to reduce the algorithm complexity. In addition, our proposed scheme can obtain an extra coding gain because of the combination of the well-designed orthogonal concatenated Alamouti STBC and the corresponding dual-antenna selection algorithm. Compared with the common-used selection algorithms in the state of the art, the proposed scheme can achieve the best performance, which is validated by numerical simulations.

A low-complexity PAPR reduction SLM scheme for STBC MIMO-OFDM systems based on constellation extension

  • Li, Guang;Li, Tianyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권6호
    • /
    • pp.2908-2924
    • /
    • 2019
  • Multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) is widely applied in wireless communication by virtue of its excellent properties in data transmission rate and transmission accuracy. However, as a major drawback of MIMO-OFDM systems, the high peak-to-average power ratio (PAPR) complicates the design of the power amplifier at the receiver end. Some available PAPR reduction methods such as selective mapping (SLM) suffer from high computational complexity. In this paper, a low-complexity SLM method based on active constellation extension (ACE) and joint space-time selective mapping (AST-SLM) for reducing PAPR in Alamouti STBC MIMO-OFDM systems is proposed. In SLM scheme, two IFFT operations are required for obtaining each transmission sequence pair, and the selected phase vector is transmitted as side information(SI). However, in the proposed AST-SLM method, only a few IFFT operations are required for generating all the transmission sequence pairs. The complexity of AST-SLM is at least 86% less than SLM. In addition, the SI needed in AST-SLM is at least 92.1% less than SLM by using the presented blind detection scheme to estimate SI. We show, analytically and with simulations, that AST-SLM can achieve significant performance of PAPR reduction and close performance of bit error rate (BER) compared to SLM scheme.

$GF(2^m)$ 상의 저복잡도 고속-직렬 곱셈기 구조 (Low Complexity Architecture for Fast-Serial Multiplier in $GF(2^m)$)

  • 조용석
    • 정보보호학회논문지
    • /
    • 제17권4호
    • /
    • pp.97-102
    • /
    • 2007
  • 본 논문에서는 $GF(2^m)$ 상의 새로운 저복잡도 고속-직렬 곱셈기 구조를 제안하였다. 고속-직렬 곱셈기는 유한체 $GF(2^m)$의 표준기저 상에서 동작하며, 직렬 곱셈기 보다는 짧은 지연시간에 결과를 얻을 수 있고, 병렬 곱셈기 보다는 적은 하드웨어로 구현할 수 있다. 이 고속-직렬 곱셈기는 회로의 복잡도와 지연시간 사이에 적절한 절충을 꾀할 수 있는 장점을 가지고 있다. 그러나 기존의 고속-직렬 곱셈기는 t배의 속도를 향상시키기 위하여 (t-1)m개의 레지스터가 더 사용되었다. 본 논문에서는 레지스터 수를 증가시키지 않는 새로운 고속-직렬 곱셈기를 설계하였다.