• Title/Summary/Keyword: Space Complexity

Search Result 772, Processing Time 0.025 seconds

Complexity Analysis of the Viking Labeled Release Experiments

  • Bianciardi, Giorgio;Miller, Joseph D.;Straat, Patricia Ann;Levin, Gilbert V.
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.13 no.1
    • /
    • pp.14-26
    • /
    • 2012
  • The only extraterrestrial life detection experiments ever conducted were the three which were components of the 1976 Viking Mission to Mars. Of these, only the Labeled Release experiment obtained a clearly positive response. In this experiment $^{14}C$ radiolabeled nutrient was added to the Mars soil samples. Active soils exhibited rapid, substantial gas release. The gas was probably $CO_2$ and, possibly, other radiocarbon-containing gases. We have applied complexity analysis to the Viking LR data. Measures of mathematical complexity permit deep analysis of data structure along continua including signal vs. noise, entropy vs.negentropy, periodicity vs. aperiodicity, order vs. disorder etc. We have employed seven complexity variables, all derived from LR data, to show that Viking LR active responses can be distinguished from controls via cluster analysis and other multivariate techniques. Furthermore, Martian LR active response data cluster with known biological time series while the control data cluster with purely physical measures. We conclude that the complexity pattern seen in active experiments strongly suggests biology while the different pattern in the control responses is more likely to be non-biological. Control responses that exhibit relatively low initial order rapidly devolve into near-random noise, while the active experiments exhibit higher initial order which decays only slowly. This suggests a robust biological response. These analyses support the interpretation that the Viking LR experiment did detect extant microbial life on Mars.

From Complexity to Hybridity: Transformative Combinations of Different Programs in Stadium Architecture

  • Shin, Yoon Jeong;Baek, Jin
    • Architectural research
    • /
    • v.21 no.3
    • /
    • pp.59-67
    • /
    • 2019
  • Although many stadiums around the world have incorporated various profitable facilities, many are making conventional and cursory decisions without deep consideration of the interrelationships of different programs. This paper investigates cases in which new programs such as a hotel, a youth hostel, and a dormitory have been introduced into stadiums, showing different results. In the first part of this paper, the theoretical precedents of program combination are studied. Although Bernard Tschumi's notion of the combination of different programs presented its prophetic probability, this paper discern different approaches addressing program mixture, engendering eventually a productive modification of his notion based on the empirical observation of the cases. This paper classifies the manner of programmatic combination into complexity and hybridity, arguing that the latter transforms the spaces and gives rise to unexpected synergy, while the former merely assembles different programs. The second part compares the spaces of complexity and hybridity in stadiums. Through the plan and the section analysis of the spatial structure and the interrelationship of programs, this section reveals how the two different ways of the program combinations have had different results. In hybrid stadiums, programs are not simply gathered, but directly connected and intertwined. In the third part, the nature of the spatial transformation in the hybrid space is researched in detail. In the hybrid stadiums, the collision of the different programs changes the conception of the programs themselves and their related spaces. Hotels and stadiums are not what they once were, provoking unanticipated situations. These transformed spaces not only suggest a method of reutilizing of disused urban spaces, but also of meaningful and communicative program mixture, diversifying and vitalizing a city, not isolated islands of discrepancy. The ultimate purpose of this paper is clarifying the programmatic hybrid paradigm, surpassing complexity through the analysis of the stadium cases and illuminating the manner by which the hybridity breaks the typical tie between the program and space, to cause transformed situations.

Hybrid SNR-Adaptive Multiuser Detectors for SDMA-OFDM Systems

  • Yesilyurt, Ugur;Ertug, Ozgur
    • ETRI Journal
    • /
    • v.40 no.2
    • /
    • pp.218-226
    • /
    • 2018
  • Multiuser detection (MUD) and channel estimation techniques in space-division multiple-access aided orthogonal frequency-division multiplexing systems recently has received intensive interest in receiver design technologies. The maximum likelihood (ML) MUD that provides optimal performance has the cost of a dramatically increased computational complexity. The minimum mean-squared error (MMSE) MUD exhibits poor performance, although it achieves lower computational complexity. With almost the same complexity, an MMSE with successive interference cancellation (SIC) scheme achieves a better bit error rate performance than a linear MMSE multiuser detector. In this paper, hybrid ML-MMSE with SIC adaptive multiuser detection based on the joint channel estimation method is suggested for signal detection. The simulation results show that the proposed method achieves good performance close to the optimal ML performance at low SNR values and a low computational complexity at high SNR values.

Low Latency Systolic Multiplier over GF(2m) Using Irreducible AOP (기약 AOP를 이용한 GF(2m)상의 낮은 지연시간의 시스톨릭 곱셈기)

  • Kim, Kee-Won;Han, Seung-Chul
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.11 no.4
    • /
    • pp.227-233
    • /
    • 2016
  • Efficient finite field arithmetic is essential for fast implementation of error correcting codes and cryptographic applications. Among the arithmetic operations over finite fields, the multiplication is one of the basic arithmetic operations. Therefore an efficient design of a finite field multiplier is required. In this paper, two new bit-parallel systolic multipliers for $GF(2^m)$ fields defined by AOP(all-one polynomial) have proposed. The proposed multipliers have a little bit greater space complexity but save at least 22% area complexity and 13% area-time (AT) complexity as compared to the existing multipliers using AOP. As compared to related works, we have shown that our multipliers have lower area-time complexity, cell delay, and latency. So, we expect that our multipliers are well suited to VLSI implementation.

Pilot Symbol Assisted Low Complexity LS Channel Estimation for OFDM in Fast Time Varying Channels (고속 시변 채널 OFDM을 위한 파일럿 심볼을 이용한 저복잡도 LS 채널 예측)

  • Lim, Dong-Min
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.11
    • /
    • pp.17-21
    • /
    • 2011
  • In this paper, we propose a pilot symbol assisted low complexity LS channel estimation method for OFDM in fast time varying channels. The proposed method shows low complexity characteristics in terms of memory space and processing time compared with conventional BEM channel model LS estimation methods.

A Generalized Space Vector Modulation Scheme Based on a Switch Matrix for Cascaded H-Bridge Multilevel Inverters

  • K.J., Pratheesh;G., Jagadanand;Ramchand, Rijil
    • Journal of Power Electronics
    • /
    • v.18 no.2
    • /
    • pp.522-532
    • /
    • 2018
  • The cascaded H Bridge (CHB) multilevel inverter (MLI) is popular among the classical MLI topologies due to its modularity and reliability. Although space vector modulation (SVM) is the most suitable modulation scheme for MLIs, it has not been used widely in industry due to the higher complexity involved in its implementation. In this paper, a simple and novel generalized SVM algorithm is proposed, which has both reduced time and space complexity. The proposed SVM involves the generalization of both the duty cycle calculation and switching sequence generation for any n-level inverter. In order to generate the gate pulses for an inverter, a generalized switch matrix (SM) for the CHB inverter is also introduced, which further simplifies the algorithm. The algorithm is tested and verified for three-phase, three-level and five-level CHB inverters in simulations and hardware implementation. A comparison of the proposed method with existing SVM schemes shows the superiority of the proposed scheme.

Conceptual Design Optimization of Tensairity Girder Using Variable Complexity Modeling Method

  • Yin, Shi;Zhu, Ming;Liang, Haoquan;Zhao, Da
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.17 no.1
    • /
    • pp.29-36
    • /
    • 2016
  • Tensairity girder is a light weight inflatable fabric structural concept which can be used in road emergency transportation. It uses low pressure air to stabilize compression elements against buckling. With the purpose of obtaining the comprehensive target of minimum deflection and weight under ultimate load, the cross-section and the inner pressure of tensairity girder was optimized in this paper. The Variable Complexity Modeling (VCM) method was used in this paper combining the Kriging approximate method with the Finite Element Analysis (FEA) method, which was implemented by ABAQUS. In the Kriging method, the sample points of the surrogate model were outlined by Design of Experiment (DOE) technique based on Optimal Latin Hypercube. The optimization framework was constructed in iSIGHT with a global optimization method, Multi-Island Genetic Algorithm (MIGA), followed by a local optimization method, Sequential Quadratic Program (SQP). The result of the optimization gives a prominent conceptual design of the tensairity girder, which approves the solution architecture of VCM is feasible and efficient. Furthermore, a useful trend of sensitivity between optimization variables and responses was performed to guide future design. It was proved that the inner pressure is the key parameter to balance the maximum Von Mises stress and deflection on tensairity girder, and the parameters of cross section impact the mass of tensairity girder obviously.

Improving Lookup Time Complexity of Compressed Suffix Arrays using Multi-ary Wavelet Tree

  • Wu, Zheng;Na, Joong-Chae;Kim, Min-Hwan;Kim, Dong-Kyue
    • Journal of Computing Science and Engineering
    • /
    • v.3 no.1
    • /
    • pp.1-4
    • /
    • 2009
  • In a given text T of size n, we need to search for the information that we are interested. In order to support fast searching, an index must be constructed by preprocessing the text. Suffix array is a kind of index data structure. The compressed suffix array (CSA) is one of the compressed indices based on the regularity of the suffix array, and can be compressed to the $k^{th}$ order empirical entropy. In this paper we improve the lookup time complexity of the compressed suffix array by using the multi-ary wavelet tree at the cost of more space. In our implementation, the lookup time complexity of the compressed suffix array is O(${\log}_{\sigma}^{\varepsilon/(1-{\varepsilon})}\;n\;{\log}_r\;\sigma$), and the space of the compressed suffix array is ${\varepsilon}^{-1}\;nH_k(T)+O(n\;{\log}\;{\log}\;n/{\log}^{\varepsilon}_{\sigma}\;n)$ bits, where a is the size of alphabet, $H_k$ is the kth order empirical entropy r is the branching factor of the multi-ary wavelet tree such that $2{\leq}r{\leq}\sqrt{n}$ and $r{\leq}O({\log}^{1-{\varepsilon}}_{\sigma}\;n)$ and 0 < $\varepsilon$ < 1/2 is a constant.

Analysis of Adaptive Digital Signal Processing for Anti-Jamming GPS System (Anti-Jamming GPS 시스템을 위한 적응형 디지털 신호 처리에 관한 분석)

  • Han, Jung-Su;Kim, Seok-Joong;Kim, Hyun-Do;Choi, Hyung-Jin;Kim, Ki-Yun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8C
    • /
    • pp.745-757
    • /
    • 2007
  • In this paper, we propose a design of GPS anti-jamming system and its operational method, which can effectively suppress interference and jamming signals induced in GPS receiver. The 7-array antenna used in the proposed system is composed of conventional 6 equi-spaced circular elements with one element on the center of antenna and can be efficiently operated under power-constrained conditions. Futhermore, in this paper, we analyze the structure and complexity of STAP and SFAP which are well known techniques in adaptive array antenna signal processing, and we compare the BER performances between STAP and SFAP in various jamming environment based on the same complexity.

Battle Damage Analysis of Aircraft Wing Fuel Tanks by Hydrodynamic Ram Effect (항공기 날개 연료탱크의 수압램 전투손상 해석연구)

  • Kim, Jong-Heon;Jeon, Seung-Mun
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.34 no.4
    • /
    • pp.17-24
    • /
    • 2006
  • Hydrodynamic ram of aircraft fuel tanks is one of main ballistic battle damages of an aircraft and has great importance to airframe survivability design. Basic concept, physics and research history of hydrodynamic ram are investigated. The penetration and internal detonation of a simple fuel tank and ICW(Intermediate Complexity Wing) are analyzed by computational method. Structural rupture and fluid burst are analytically realized using general coupling and coupling surface interaction. The results such as fluid pressure, tank stress and displacement are shown and future research chances are suggested based on the study.