• Title/Summary/Keyword: code complexity

Search Result 596, Processing Time 0.025 seconds

Viscoplastic Solution of Thick Walled Cylinder Considering Axial Constraint (축방향 경계 조건을 고려한 두꺼운 실린더의 점소성 응력해)

  • Yoon, Sam-Son;Lee, Soon-Bok
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.9
    • /
    • pp.1555-1561
    • /
    • 2003
  • Finite element analysis using modern constitutive equation is one of the most general tools to simulate the deformation behavior and to predict the life of the structure. Constitutive equation becomes complicated so as to predict the material behavior more accurately than the classical models. Because of the complexity of constitutive model, numerical treatment becomes so difficult that the calculation should be verified carefully. One-element tests, simple tension or simple shear, are usually used to verify the accuracy of finite element analysis using complicated constitutive model. Since this test is mainly focused on the time integration scheme, it is also necessary to verify the equilibrium iteration using material stiffness matrix and to compare FE results with solution of structures. In this investigation, viscoplastic solution of thick walled cylinder was derived considering axial constraints and was compared with the finite element analysis. All the numerical solutions showed a good coincidence with FE results. This numerical solution can be used as a verification tool for newly developed FE code with complicated constitutive model.

Implementation and Performance Evaluation of Preempt-RT Based Multi-core Motion Controller for Industrial Robot (산업용 로봇 제어를 위한 Preempt-RT 기반 멀티코어 모션 제어기의 구현 및 성능 평가)

  • Kim, Ikhwan;Ahn, Hyosung;Kim, Taehyoun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.12 no.1
    • /
    • pp.1-10
    • /
    • 2017
  • Recently, with the ever-increasing complexity of industrial robot systems, it has been greatly attention to adopt a multi-core based motion controller with high cost-performance ratio. In this paper, we propose a software architecture that aims to utilize the computing power of multi-core processors. The key concept of our architecture is to use shared memory for the interplay between threads running on separate processor cores. And then, we have integrated our proposed architecture with an industrial standard compliant IDE for automatic code generation of motion runtime. For the performance evaluation, we constructed a test-bed consisting of a motion controller with Preempt-RT Linux based dual-core industrial PC and a 3-axis industrial robot platform. The experimental results show that the actuation time difference between axes is 10 ns in average and bounded up to 689 ns under $1000{\mu}s$ control period, which can come up with real-time performance for industrial robot.

Two-Phase Flow Field Simulation of Horizontal Steam Generators

  • Rabiee, Ataollah;Kamalinia, Amir Hossein;Hadad, Kamal
    • Nuclear Engineering and Technology
    • /
    • v.49 no.1
    • /
    • pp.92-102
    • /
    • 2017
  • The analysis of steam generators as an interface between primary and secondary circuits in light water nuclear power plants is crucial in terms of safety and design issues. VVER-1000 nuclear power plants use horizontal steam generators which demand a detailed thermal hydraulics investigation in order to predict their behavior during normal and transient operational conditions. Two phase flow field simulation on adjacent tube bundles is important in obtaining logical numerical results. However, the complexity of the tube bundles, due to geometry and arrangement, makes it complicated. Employment of porous media is suggested to simplify numerical modeling. This study presents the use of porous media to simulate the tube bundles within a general-purpose computational fluid dynamics code. Solved governing equations are generalized phase continuity, momentum, and energy equations. Boundary conditions, as one of the main challenges in this numerical analysis, are optimized. The model has been verified and tuned by simple two-dimensional geometry. It is shown that the obtained vapor volume fraction near the cold and hot collectors predict the experimental results more accurately than in previous studies.

A Real-time Vehicle Localization Algorithm for Autonomous Parking System (자율 주차 시스템을 위한 실시간 차량 추출 알고리즘)

  • Hahn, Jong-Woo;Choi, Young-Kyu
    • Journal of the Semiconductor & Display Technology
    • /
    • v.10 no.2
    • /
    • pp.31-38
    • /
    • 2011
  • This paper introduces a video based traffic monitoring system for detecting vehicles and obstacles on the road. To segment moving objects from image sequence, we adopt the background subtraction algorithm based on the local binary patterns (LBP). Recently, LBP based texture analysis techniques are becoming popular tools for various machine vision applications such as face recognition, object classification and so on. In this paper, we adopt an extension of LBP, called the Diagonal LBP (DLBP), to handle the background subtraction problem arise in vision-based autonomous parking systems. It reduces the code length of LBP by half and improves the computation complexity drastically. An edge based shadow removal and blob merging procedure are also applied to the foreground blobs, and a pose estimation technique is utilized for calculating the position and heading angle of the moving object precisely. Experimental results revealed that our system works well for real-time vehicle localization and tracking applications.

A Generalized Blind Adaptive Multi-User Detection Algorithm for Multipath Rayleigh Fading Channel Employed in a MIMO System

  • Fahmy Yasmine A.;Mourad Hebat-Allah M.;Al-Hussaini Emad K.
    • Journal of Communications and Networks
    • /
    • v.8 no.3
    • /
    • pp.290-296
    • /
    • 2006
  • In this paper, a generalized blind adaptive algorithm is introduced for multi-user detection of direct sequence code division multiple access (OS-COMA) wireless communication systems. The main property of the proposed algorithm is its ability to resolve the multipath fading channel resulting in inter symbol interference (ISI) as well as multiple access interference (MAI). Other remarkable properties are its low complexity and mitigation to the near-far problem as well as its insensitivity to asynchronous transmission. The proposed system is based on the minimization of the output energy and convergence to the minimum mean square error (MMSE) detector. It is blind in the sense that it needs no knowledge of the other users' signatures, only the intended user signature and timing are required. Furthermore, the convergence of the minimum output energy (MOE) detector to the MMSE detector is analytically proven in case of M-ary PSK. Depicted results show that the performance of the generalized system dominates those previously considered. Further improvements are obtained when multiple input multiple output (MIMO) technique is employed.

Multiple Finger Expansion for Blind Interference Canceller in the Presence of Subchip-Spaced Multipath Components

  • Quek, Tony Q. S.;Suzuki, Hiroshi;Fukawa, Kazuhiko
    • Journal of Communications and Networks
    • /
    • v.6 no.1
    • /
    • pp.26-34
    • /
    • 2004
  • A blind interference canceller in the presence of subchipspaced multipath channels for direct-sequence code division multiple access (DS-CDMA) down-link system is considered. This technique is based on combining the existing blind interference canceller with a technique that involves assigning subchip-tap spacing to the Rake receiver. The proposed receiver minimizes the receiver’s output energy subject to a constraint in order to mitigate the multiple access interference (MAI) along each multipath component, and then suboptimally combining all the multipath components. Moreover, it is able to mitigate the mismatch problem when subchip-spaced multipath components arrive at the blind interference canceller. It is known that optimal combining techniques perform a decorrelation operation before combining, which requires both knowledge and computational complexity. In the following, we have adopted a simpler but suboptimum approach in the combining of the suppressed signals at the output of our proposed receiver. Computer simulation results verify the effectiveness of the proposed receiver to handle subchip-spaced multipath components and still suppresses MAI significantly.

Design of New Closed-Loop Spatial Multiplexing System Using Linear Precoder (선형 선부호기를 이용한 새로운 폐루프 공간 다중화 시스템 설계)

  • Chae, Chang-Hyeon;Choi, Dae-Won;Jung, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1A
    • /
    • pp.44-49
    • /
    • 2008
  • Recently, a so called orthogonal spatial multiplexing(OSM) scheme was presented which allows simple maximum likelihood decoding at the receiver with single phase feedback In this paper, by serially concatenating this scheme by a linear precoder, a new closed-loop SM scheme is proposed for two transmit arid two receive antennas. By computer simulation results, we show that the proposed scheme outperforms the conventional SM and OSM. For the proposed code, we also propose a new simple decoding algorithm which leads to a greatly reduced decoding complexity compared with the ML receiver without any loss of error performance.

Performance Analysis of Error Correction Codes for 3GPP Standard (3GPP 규격 오류 정정 부호 기법의 성능 평가)

  • 신나나;이창우
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.15 no.1
    • /
    • pp.81-88
    • /
    • 2004
  • Turbo code has been adopted in the 3GPP standard, since its performance is very close to the Shannon limit. However, the turbo decoder requires a lot of computations and the amount of the memory increases as the block size of turbo codes becomes larger. In order to reduce the complexity of the turbo decoder, the Log-MAP, the Max-Log-MAP and the sliding window algorithm have been proposed. In this paper, the performance of turbo codes adopted in the 3GPP standard is analyzed by using the floating point and the fixed point implementation. The efficient decoding method is also proposed. It is shown that the BER performance of the proposed method is close to that of the Log-MAP algorithm.

Interference Cancellation for Multiuser under the Environment of DS/CDMA System (DS/CDMA 시스템 환경에서 다중 사용자를 위한 간섭제거)

  • Kim, Hak-Chun;Lee, Byung-Kwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.10
    • /
    • pp.3218-3225
    • /
    • 2000
  • In this paper, the performance of the MMSE multiauser deteclor was analyzed with the SNR from the standpoint of the exproient, according to the multiuser, In was analyzed not only at the AWGN channel, but at the fading channel also. With the result of this test, the MMSE multiuser detector showed better performance of multi-connection interference in comparison with comon deterctors. However, its disadvantageis that the hardware turns out to be too complicated and that it requires too many calculations. Because of multi-connectioninterference that happens as a result of spreading code horizontally, the DS/CDMA system, which contatins the same frequency and time, turns out to thve interference according to the quality of the call and the number of users. In order to solve these problems, an adaptive MMSE multiuser detector is suggested. To increase the system's processing gain, the hardware's complexity can be reduced by establishing the number of taps wirhin the detector.

  • PDF

A Lightweight Packet Filter for Embedded System (임베디드 시스템을 위한 경량의 패킷필터)

  • Lee, Byong-Kwon;Jeon, Joong-Nam
    • The KIPS Transactions:PartC
    • /
    • v.13C no.7 s.110
    • /
    • pp.813-820
    • /
    • 2006
  • The advance of computer and communication technologies enables the embedded systems to be equipped with the network communication interfaces. Their appearance in network leads to security issues on the embedded systems. An easy way to overcome the security problem is to adopt the packet filter that is implemented in the general computer systems. However, general packet filters designed for host computers are not suitable to embedded systems because of their complexity. In this paper, we propose a lightweight packet filter for embedded systems. The lightweight packet filter is implemented in the kernel code. And we have installed a Web-GUI interface for user to easily set the filtering policies at remote space. The experimental results show that the proposed packet filter decreases the packet delivery time compared to the packet filter designed for host computers and it is comparable to the systems without packet filter.