• Title/Summary/Keyword: space complexity

Search Result 774, Processing Time 0.024 seconds

Subquadratic Space Complexity Multiplier for GF($2^n$) Using Type 4 Gaussian Normal Bases

  • Park, Sun-Mi;Hong, Dowon;Seo, Changho
    • ETRI Journal
    • /
    • v.35 no.3
    • /
    • pp.523-529
    • /
    • 2013
  • Subquadratic space complexity multipliers for optimal normal bases (ONBs) have been proposed for practical applications. However, for the Gaussian normal basis (GNB) of type t > 2 as well as the normal basis (NB), there is no known subquadratic space complexity multiplier. In this paper, we propose the first subquadratic space complexity multipliers for the type 4 GNB. The idea is based on the fact that the finite field GF($2^n$) with the type 4 GNB can be embedded into fields with an ONB.

A study on non-hierarchy of the interior space based on complexity of modern spatial program (현대 공간 프로그램의 복합화에 따른 실내공간의 위계소거에 관한 연구)

  • Park, Eun-Sil;Lim, Jong-Yup
    • Proceedings of the Korean Institute of Interior Design Conference
    • /
    • 2006.11a
    • /
    • pp.209-212
    • /
    • 2006
  • To develop in the long view, based on context of city, the spatial program change to new spatial program that can be adopt city architectural environment. The new spatial program must have paring lot, open space, community center, which are infra structure for citizen. The needs about flexible space Increase according to complexity of spatial program. The space of absolutism, is made up hierarchy, can't accommodate complexity of spatial program. Therefore, modern architectural spaces are characterized by non-hierarchy. This research is tendency to search special quality of space program that is going complex composition according to change of modern society and modern architecture space, and analyze characteristic of inner space that have non-hierarchy to correspond hereupon.

  • PDF

Low Complexity Decoder for Space-Time Turbo Codes

  • Lee Chang-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4C
    • /
    • pp.303-309
    • /
    • 2006
  • By combining the space-time diversity technique and iterative turbo codes, space-time turbo codes(STTCS) are able to provide powerful error correction capability. However, the multi-path transmission and iterative decoding structure of STTCS make the decoder very complex. In this paper, we propose a low complexity decoder, which can be used to decode STTCS as well as general iterative codes such as turbo codes. The efficient implementation of the backward recursion and the log-likelihood ratio(LLR) update in the proposed algorithm improves the computational efficiency. In addition, if we approximate the calculation of the joint LLR by using the approximate ratio(AR) algorithm, the computational complexity can be reduced even further. A complexity analysis and computer simulations over the Rayleigh fading channel show that the proposed algorithm necessitates less than 40% of the additions required by the conventional Max-Log-MAP algorithm, while providing the same overall performance.

A Study on the Relationships between Complex and Preference by Perceptual-cognitive and Affective Judgement - Focused on the Commercial Interior Design - (지각적-인지적 판단과 감정적 판단에 따른 복잡성과 선호도의 관계 - 상업공간의 실내디자인을 중심으로 -)

  • Choi Eun-Hee;Kwon Young-Gull
    • Korean Institute of Interior Design Journal
    • /
    • v.15 no.3 s.56
    • /
    • pp.173-183
    • /
    • 2006
  • Design is inseparably related to aesthetics. In spite of that, it is difficult to explain the precise aesthetic variables that affect the aesthetic value of space or environment. Therefore, this study intended to find the relationships between aesthetic variables by perceptual and affective judgement for space design with focus on complexity and preference variables. The research found low level of 'arousing' as well as high levels of affective dimension variables 'pleasant' and 'relaxing' evoked high preference. High preference also appeared in space design cases with high unity, order, and clarity with low contrast and complexity, which are variables of perceptual dimension. Complexity, one variables of preference by Kaplan, is in an inverse proportion to space preference. Thus, space design with high complexity has high level of 'exciting' and 'arousing' affective responses and relatively low level of 'relaxing' response. Additionally, it was confirmed that the most importantly influential factor on complexity was diverse components rather than visual richness and ornamentation.

Iterative Multiple Symbol Differential Detection for Turbo Coded Differential Unitary Space-Time Modulation

  • Vanichchanunt, Pisit;Sangwongngam, Paramin;Nakpeerayuth, Suvit;Wuttisittikulkij, Lunchakorn
    • Journal of Communications and Networks
    • /
    • v.10 no.1
    • /
    • pp.44-54
    • /
    • 2008
  • In this paper, an iterative multiple symbol differential detection for turbo coded differential unitary space-time modulation using a posteriori probability (APP) demodulator is investigated. Two approaches of different complexity based on linear prediction are presented to utilize the temporal correlation of fading for the APP demodulator. The first approach intends to take account of all possible previous symbols for linear prediction, thus requiring an increase of the number of trellis states of the APP demodulator. In contrast, the second approach applies Viterbi algorithm to assist the APP demodulator in estimating the previous symbols, hence allowing much reduced decoding complexity. These two approaches are found to provide a trade-off between performance and complexity. It is shown through simulation that both approaches can offer significant BER performance improvement over the conventional differential detection under both correlated slow and fast Rayleigh flat-fading channels. In addition, when comparing the first approach to a modified bit-interleaved turbo coded differential space-time modulation counterpart of comparable decoding complexity, the proposed decoding structure can offer performance gain over 3 dB at BER of $10^{-5}$.

Efficient Detection of Space-Time Block Codes Based on Parallel Detection

  • Kim, Jeong-Chang;Cheun, Kyung-Whoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.2A
    • /
    • pp.100-107
    • /
    • 2011
  • Algorithms based on the QR decomposition of the equivalent space-time channel matrix have been proved useful in the detection of V-BLAST systems. Especially, the parallel detection (PD) algorithm offers ML approaching performance up to 4 transmit antennas with reasonable complexity. We show that when directly applied to STBCs, the PD algorithm may suffer a rather significant SNR degradation over ML detection, especially at high SNRs. However, simply extending the PD algorithm to allow p ${\geq}$ 2 candidate layers, i.e. p-PD, regains almost all the loss but only at a significant increase in complexity. Here, we propose a simplification to the p-PD algorithm specific to STBCs without a corresponding sacrifice in performance. The proposed algorithm results in significant complexity reductions for moderate to high order modulations.

Construction of Visual Space using Relief Texture Mapping (Relief Texture 매핑을 이용한 가상공간 구축)

  • 이은경;정영기
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.1899-1902
    • /
    • 2003
  • Recently several methods have been developed for the virtual space construction. Generally, most of the methods are geometric-based rendering technic, but they are difficult to construct real-time rendering because of large data. In this paper, we present a three dimension image-based rendering method that enable a constant speed of real-time rendering regardless of object complexity in virtual space. The Proposed method shows good performance for the virtual space construction with high complexity.

  • PDF

SOC Verification Based on WGL

  • Du, Zhen-Jun;Li, Min
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.12
    • /
    • pp.1607-1616
    • /
    • 2006
  • The growing market of multimedia and digital signal processing requires significant data-path portions of SoCs. However, the common models for verification are not suitable for SoCs. A novel model--WGL (Weighted Generalized List) is proposed, which is based on the general-list decomposition of polynomials, with three different weights and manipulation rules introduced to effect node sharing and the canonicity. Timing parameters and operations on them are also considered. Examples show the word-level WGL is the only model to linearly represent the common word-level functions and the bit-level WGL is especially suitable for arithmetic intensive circuits. The model is proved to be a uniform and efficient model for both bit-level and word-level functions. Then Based on the WGL model, a backward-construction logic-verification approach is presented, which reduces time and space complexity for multipliers to polynomial complexity(time complexity is less than $O(n^{3.6})$ and space complexity is less than $O(n^{1.5})$) without hierarchical partitioning. Finally, a construction methodology of word-level polynomials is also presented in order to implement complex high-level verification, which combines order computation and coefficient solving, and adopts an efficient backward approach. The construction complexity is much less than the existing ones, e.g. the construction time for multipliers grows at the power of less than 1.6 in the size of the input word without increasing the maximal space required. The WGL model and the verification methods based on WGL show their theoretical and applicable significance in SoC design.

  • PDF

Environmental Design Methods Based on the Idea of Fold : The Re-Design Proposal of Do-San Park (폴드 개념을 이용한 환경설계방법 연구 - 도산공원 재설계를 사례로 -)

  • 오창송;조경진
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.30 no.2
    • /
    • pp.50-62
    • /
    • 2002
  • From modernism to post-modernism, the practice in the design field often reduced the complexity of environment and to remove variety. However, contemporary ideas of space have been changed. The current thought premise is that the environment is mutable and is evolving according to inner and outer forces and elements. Therefore, leading designers recognize that the environment is complex in itself while anticipating a new theory explaining on-going trends. The idea of fold formulated by Gilles Deleuze can provide a theoretical base for new environmental design in constrat to current design practices. The fold is a hybrid by accommodating complex relations within an object. It carries a dynamic world view through continual process and yields a topological space against absolute space like Euclid geometry. The characteristics of the fold can be paraphrased as rhizome, stratification and smooth space. Rhizome forms a non-hierarchial connection like networking in internet space. Stratification is a kind of superimposition of autonomous potential layers within a single object. Smooth space is a free space and event oriented space keeping non-linear form. This study tried to incorporate the idea of fold to environmental design methods and design process in order to make space which can correspond with complex environment and topological form. In the design process adapted to fold theory, rhizome analysis accepts the complexity of environment and stratification strategy embraces the possibility of accidental use. As a result, the designed park carries a monadic image and produces an ambiguous space. Lastly, smooth space makes topological space unlike Euclid geometry and is free space comosed by the user themselves. Transporting the idea of fold into environmental design could be an alterative way for indeterminate and flexible design to accept new identity of place. Therefore, this study accepts the concept of incidental morphogenesis to make space based on the complexity of environment. The designed space based on the idea of fold searches to create free event space determined by user rather than designated by designer.

A Study on the Type and the Facilities in Compositeness of the Domestic Discount Store (국내 대형할인점의 복합화에 따른 유형과 시설에 관한 연구)

  • 문선욱;양정필
    • Korean Institute of Interior Design Journal
    • /
    • no.41
    • /
    • pp.137-145
    • /
    • 2003
  • This research analyzed the space scheme in connection with complexity, one of the new changes in the discount stores, and has a goal of predicting the direction of space scheme in the upcoming complexity era. The research was conducted in the following way. Firstly, this researcher tried to grasp what kinds of changes were required in the overall distribution industry socially and economically. Secondly, the characteristic and situation of discount stores were scrutinized. Thirdly, the domestic stores' complexity status was classified and types of those were elicited. Fourthly, the time-series change and use were analyzed. The result of this analysis reveals that the types of complexity can be divided by location and adjustment to environmental changes. The time-series analysis shows that total operating area, the number of parked cars and the tenant ratio have increased dramatically in 2000 and 2003. And, according to the correlation analysis between factors, the tenant ratio has, a strong correlation with other two factors. Self-complexity takes the basic form of living facilities and complexity with other facilities is combined with other cultural, sales, educational and administrative ones. Mass-complexity is merged with the stadiums, parks or station sites. As you've seen, the concept of complex shopping mall for the realization of one stop shopping and convenience will continue in the days to come. It is desirable that the study on the large-scale shopping spaces will be conducted continually for the preparedness of future life style.