• Title/Summary/Keyword: Design complexity

Search Result 1,995, Processing Time 0.028 seconds

DEVELOPING A STRUCTURED APPROACH WITH SYSTEMS ENGINEERING TO THE BUILDING DESIGN

  • Azzedine Yahiaoui
    • International conference on construction engineering and project management
    • /
    • 2007.03a
    • /
    • pp.356-365
    • /
    • 2007
  • The development in the design process is usually based on the choice of a method for designing the system, in which this method is frequently faced with tightening environmental requirements, reducing development cycle times and growing complexity. To tackle such factors, the paper proposes a comprehensive approach focusing on applying systems engineering approach to the building design support. In particular, this paper addresses all capabilities of using some available systems engineering standards (like EIA-632) in the design process. Then, a methodological approach is proposed for the practice of requirements engineering by applying quality assessment and control to design in early phase. The paradigm used, here is to extend and particularly to adapt the work carried out in military and space systems to modern building services by taking into account the semantics of buildings in terms of different engineering fields and architecture issues.

  • PDF

A Study on Implementation System of 'Design Charrette' for Sustainable Community Design -Focused on Sensitive Urban Infill Charrette in Canada (지속가능한 커뮤니티 계획을 위한 디자인샤렛 실행체계 연구 -캐나다 Sensitive Urban Infill Charrette 프로젝트를 중심으로)

  • Choi, Soon-Sub
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.12
    • /
    • pp.153-161
    • /
    • 2016
  • Urban design claiming the notion of 'Sustainability', which inevitably includes ecological complexity, is normally geared towards the reflection of environmentally-friendly technical guidelines in the existing planning process. Although physical planning should be combined with economic, social, cultural, environmental issues, and policies, it is conducted conventionally as the sum of the closed sectoral approaches of planning. To overcome this limit, Design Charrette was invented for sustainable urban design or community design, which should consider the complexity of diverse issues. This design process unveils complicated and divergent problems and a variety of stakeholders participate in the integrated design simultaneously and cooperatively. Because Design Charrette must also be a process of agreement, it is used for sustainable community design. The aim of this study was to introduce Design Charrette as an alternative of Korean sustainable urban design, which is regarded as 'making guidelines related to green principles'. For such a purposes, the definition and differentiation of Design Charrette will be explained with an analysis of the introduction background, benefit and procedure. The contents, system and process of Design Charrette will be analyzed through case studies in Canada, where this method of design is widespread. In the last part, the implementation system (the comprehensive system of organization / content and direction of planning / process and output) will be deduced after concentrated analysis of one respected case, 'Sensitive Urban Infill Charrette' of the City of Surrey. This implementation system will be a crucial reference to develop Korean Design Charrette.

Hardware Implementation of the 3GPP KASUMI crypto algorithm

  • Kim, Ho-Won;Park, Yong-Je;Kim, Moo-Seop;Ryu, Hui-Su
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.317-320
    • /
    • 2002
  • In this paper, we will present the design and implementation of the KASUMI crypto algorithm and confidentiality algorithm (f8) to an hardware chip for 3GPP system. The f8 algorithm is based on the KASUMI which is a block cipher that produces a 64-bit output from a 64-bit input under the control of a 128-bit key. Various architectures (low hardware complexity version and high performance version) of the KASUMI are made with a Xilinx FPGA and the characteristics such as hardware complexity and thor performance are analyzed.

  • PDF

Log N-stage self-fouting ATM concentrator (Log N 단 자기루팅 ATM 셀 집중기)

  • 이성창
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.2
    • /
    • pp.50-57
    • /
    • 1998
  • In this paper, we propoe a log N-stage ATM concentator. ATM concentrator is used in the ATM access network to concentrate the traffic offered at UNI, so that high utilization of the newtork rewources is achieved. The concetrator may be used as a construction block in the design of ATM switch. We define abasic element, named equalizer, and decribe its function and theory to construct an efficient concentrator using the element. In addition, a control scheme to enhance the concentrator to a superconcentrator is presented, which enables the concentration to start from an arbitrary output. This scheme makes it possible to construct an efficient ditributior or a barrel shifter which are often used in ATM switch and other application. The proposed concentrator has a low hardware complexity of O(N log N), thus it is economical to implement. Also, the time complexity of proposed concentrator for determining the rouging is O(N log N), which is faster than that of the existing ones.

  • PDF

A Parallel Structure of SRAMs in embedded DRAMs for Testability (테스트 용이화를 위한 임베디드 DRAM 내 SRAM의 병열 구조)

  • Gook, In-Sung;Lee, Jae-Min
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.3 no.3
    • /
    • pp.3-7
    • /
    • 2010
  • As the distance between signal lines in memories of high density ICs like SoCs decreases rapidly, failure occurs more frequently and effective memory test techniques are needed. In this paper, a new SRAM structure is proposed to decrease test complexity and test time for embedded DRAMs. In the presented technique, because memory test can be handled as a single port testing and read-write operation is possible at dual port without high complexity, test time can be much reduced.

  • PDF

Design and Implementation of HomeTDMA: a TDMA Protocol for Home Networks

  • Casaquite, Reizel;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.12
    • /
    • pp.1612-1621
    • /
    • 2007
  • In this paper, we introduced our designed TDMA (Time Division Multiple Access) based MAC (Medium Access Control) protocol for Home Networks called HomeTDMA. We have implemented and tested it in a test bed using crossbow motes and TinyOS. We also have compared HomeTDMA and CSMA (Carrier Sense Multiple Access) in terms of space and time complexity, channel access time, delivery success ratio, and throughput. Based on our results, HomeTDMA has an advantage over CSMA on channel access time, throughput and delivery success ratioIn the case of complexity, HomeTDMA is more complex compared to CSMA. Thus, CSMA is more appropriate in wireless sensor networks (WSNs) where memory, energy, and throughput are important parameters to be considered. However, HomeTDMA has a natural advantage of collision free medium access and is very promising for home networks where a reliable transmission or data transfer and congestion control is highly preferred.

  • PDF

A Study on the design of Hilbert transformer using the MAG Algorithm (MAG 알고리즘을 이용한 힐버트 변환기의 설계에 관한 연구)

  • Lee, Young-seock
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.7 no.3
    • /
    • pp.121-125
    • /
    • 2014
  • A hardware implementation of Hilbert transform is indespensible element in DSP system, but it suffers form a high complexity of system level hardware resulted in a large amount of the used gate. In this paper, we implemented the Hilbert transformer using MAG algorithm that reduces the complexity of hardware.

An Analysis of the Complexity Measurement Factor for a Program (프로그램에 대한 복잡도 측정인자 분석)

  • 이규범;송정영
    • Journal of Internet Computing and Services
    • /
    • v.3 no.4
    • /
    • pp.61-69
    • /
    • 2002
  • Measurement of the object, messages, clones, capsulation, inheritance, etc. that are conventional object-oriented paradigm characteristics as a method of measurement of the complexity of object-oriented programs has been reported. In this paper, the measures that are helpful to designing and coding of JAVA program, which is the representative language of object-oriented programs, are applied to six measures(i,e., Halstead's Program Volume, Program Level, Program Impurity, Macabe's Cyclomatic Number, Handerson-Seller's lock of cohesion in method and Sullivan's PVG.) suggested in the present study by referring to several actual programs as example for comparative analysis.

  • PDF

Design of Digital Fingerprinting Scheme for Multi-purchase

  • Choi, Jae-Gwi;Rhee, Kyung-Hyune
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.12
    • /
    • pp.1708-1718
    • /
    • 2004
  • In this paper, we are concerned with a digital fingerprinting scheme for multi-purchase where a buyer wants to buy more than a digital content. If we apply previous schemes to multi-purchase protocol, the number of execution of registration step and decryption key should be increased in proportion to that of digital contents to be purchased in order to keep unlinkability. More worse, most of fingerprinting schemes in the literature are based on either secure multi-party computation or general zero-knowledge proofs with very high computational complexity. These high complexities complicate materialization of fingerprinting protocol more and more. In this paper, we propose a multi-purchase fingerprinting scheme with lower computational complexity. In the proposed scheme, a buyer executes just one-time registration step regardless of the number of contents to be purchased. The number of decryption key is constant and independent of the number of contents to be purchased. We can also reduce the computational costs of buyers by introducing a concept of proxy-based fingerprinting protocol.

  • PDF

A Study on the Ultimate Strength Behavior according to Analysis Boundary at Stiffened Plate (선체보강판의 해석영역에 따른 최종강도거동에 관한 연구)

  • 박주신;고재용
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2004.10a
    • /
    • pp.262-269
    • /
    • 2004
  • Ship structures are basically an assembly of plate elements and the load-carrying capacity or the ultimate strength is one of the most important criteria for safety assessment and economic design. Also, Structural elements making up ship plated structures do not work separately, resulting in high degree of redundancy and complexity, in contrast to those of steel framed structures. To enable the behavior of such structures to be analyzed, simplifications or idealizations must essentially be made considering the accuracy needed and the degree of complexity of the analysis to be used. On this study, to investigate effect of analysis range, the finite element method are used and their results are compared varying the analysis ranges. The model has been selected from bottom panels of large merchant ship structures. For FEA, three types of structural modeling are adopted in terms of the extent of the analysis. The purpose of the present study is to numerically calculate the characteristics of ultimate strength behavior according to the analysis ranges of stiffened panels subject to uniaxial compressive loads.

  • PDF