• 제목/요약/키워드: Linear Cyclic Systems

검색결과 47건 처리시간 0.027초

Dynamic Characterization of Noise and Vibration Transmission Paths in Linear Cyclic Systems (I)-Theory-

  • Kim, Han-Jun;Cho, Young-Man
    • Journal of Mechanical Science and Technology
    • /
    • 제14권10호
    • /
    • pp.1051-1060
    • /
    • 2000
  • Linear cyclic systems (LCS's) are a class of systems whose dynamic behavior changes cyclically. Such cyclic behavior is ubiquitous in systems with fundamentally repetitive motions (e. g. all rotating machinery). Yet, the knowledge of the noise and vibration transmission paths in LCS's is quite limited due to the time-varying nature of their dynamics. The first part of this two-part paper derives a generic expression that describes how the noise and/or vibration are transmitted between two (or multiple) locations in the LCS's. An analysis via the Fourier series and Fourier transform (FT) plays a major role in deriving this expression that turns out to be transfer function dependent upon the cycle position of the system. The cyclic nature of the LCS' transfer functions is shown to generate a series of amplitude modulated input signals whose carrier frequencies are harmonic multiples of the LCS' fundamental frequency. Applicability of signal processing techniques used in the linear time-invariant systems (LTIS's to the general LCSs is also discussed. Then, a criterion is proposed to determine how well a LCS can be approximated as a LTIS. In Part II, experimental validation of the analyses carried out in Part I is provided.

  • PDF

Dynamic Characterization of Noise and Vibration Transmission Paths in Linear Cyclic Systems (II)- Experimental Validation-Experimental Validation-

  • Kim, Han-Jun;Cho, Young-Man
    • Journal of Mechanical Science and Technology
    • /
    • 제14권10호
    • /
    • pp.1061-1071
    • /
    • 2000
  • Linear cyclic systems (LCS's) are a class of systems whose dynamic behavior changes periodically. Such a cyclic behavior is ubiquitous in systems with fundamentally repetitive motion. Yet, the knowledge of the noise and vibration transmission paths in LCS's is quite limited due to the time-varying nature of their dynamics. The first part of this two-part paper derives a generic expression that describes how the noise and/or vibration are transmitted between two (or multiple) points in the LCS's. In Part II, experimental validation of the theoretical development of Part I is provided. The noise and vibration transmission paths of the scroll and rotary compressors (two typical LCS's) are examined to show that the LCS's indeed generate a series of amplitude modulated input signals at the output, where the carrier frequencies are harmonic multiples of the LCS' fundamental frequency. The criterion proposed in Part I to determine how well a given LCS can be approximated as a linear time-invariant systems (LTIS) is applied to the noise and vibration transmission paths of the two compressors. Furthermore, the implications of the experimental validations/applications are discussed in order to assess the applicability of the noise/vibration source and transmission path identification techniques based on the assumption that the system under consideration is linear and time-invariant.

  • PDF

Direct Methods for Linear System on Distributed Memory Parallel Computers

  • Nishimura, S.;Shigehara, T.;Mizoguchi, H.;Mishima, T.;Kobayashi, H.
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 ITC-CSCC -1
    • /
    • pp.333-336
    • /
    • 2000
  • We discuss the direct methods (Gauss-Jordan and Gaussian eliminations) to solve linear systems on distributed memory parallel computers. It will be shown that the so-called row-cyclic storage gives rise to the best performance among the standard three (row-cyclic, column-cyclic and cyclic-cyclic) data storages. We also show that Gauss-Jordan elimination, rather than Gaussian elimination, is highly efficient for the direct solution of linear systems in parallel processing, though Gauss-Jordan elimination requires a larger number of arithmetic operations than Gaussian elimination. Numerical experiment is performed on HITACHI SR12201 with the standard libraries MPI and BLAS.

  • PDF

A Linear Precoding Technique for OFDM Systems with Cyclic Delay Diversity

  • Hui, Bing;Chang, Kyung-Hi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제2권5호
    • /
    • pp.253-264
    • /
    • 2008
  • Cyclic delay diversity (CDD) is considered a simple approach to exploit the frequency diversity, to improve the system performance in orthogonal frequency division multiplexing (OFDM) systems. Also, the linear precoding technique can significantly improve the performance of communication systems by exploiting the channel state information (CSI). In order to achieve enhanced performance, we propose applying linear precoding to the conventional CDD-OFDM transmit diversity schemes over Rayleigh fading channels. The proposed scheme works effectively with the accurate CSI in time-division-duplex (TDD) OFDM systems with CDD, where the reciprocity is assumed instead of channel state feedback. For a BER of $10^{-4}$ and the mobility of 3 km/h, simulation results show that a gain of 6 dB is achieved by the proposed scheme over both flat fading and Pedestrian A (Ped A) channels, compared to the conventional CDD-OFDM system. On the other hand, for a mobility of 120 km/h, a gain of 2.7 dB and 3.8 dB is achieved in flat fading and Vehicular A (Veh A) channels, respectively.

순환 지연 다이버시티를 사용하는 OFDM 시스템을 위한 선형 프리코팅 기법 (A Linear Precoding Technique for OFDM Systems with Cyclic Delay Diversity)

  • 휘빙;김영범;장경희
    • 한국통신학회논문지
    • /
    • 제34권3A호
    • /
    • pp.197-204
    • /
    • 2009
  • 순환 지연 다이버시티(CDD, cyclic delay diversity) 기법은 주파수 다이버시티를 이용하여 OFDM 시스템의 성능을 향상시키는 기법이다. 또한, 선형 프리코딩 기법은 채널 상황 정보(CSI, channel state information)를 이용하여 통신 시스템의 성능을 크게 증가시킬 수 있는 기법이다. 본 논문은 기존의 CDD-OFDM 송신 다이버시티 기법보다 향상된 성능을 얻기 위하여 선형 프리코딩 기법의 적용을 제안한다. 제안된 기법은 채널 상황 정보 feedback이 필요한 FDD(frequency division duplex) 시스템 보다, feedback을 사용할 필요 없이 채널 가역성(reciprocity)의 성질을 이용할 수 있는 TDD(time division duplex) 시스템에서 더욱 효과적이다. 모의실험 결과를 통해 본 논문에서 제안된 기법이 기존의 프리코딩을 사용하지 않는 CDD-OFDM 시스템에 비하여 target BER $10^{-4}$에서 3km/h의 이동성(mobility)을 갖는 flat 페이딩 채널과 Pedestrian A(Ped A) 채널, 120km/h의 이동성을 갖는 flat 페이딩 채널과 Vehicular A(Veh A) 채널에서 각각 6.3dB. 6.2dB, 2.8dB, 3.8dB의 SNR 성능 이득을 얻는 것을 보인다.

Numerical modelling of soil-foundation interaction by a new non-linear macro-element

  • Khebizi, Mourad;Guenfoud, Hamza;Guenfoud, Mohamed
    • Geomechanics and Engineering
    • /
    • 제14권4호
    • /
    • pp.377-386
    • /
    • 2018
  • This paper focuses on the development of a new non-linear macro-element for the modelling of soil-foundation interaction. Material and geometrical nonlinearities (soil yielding and foundation uplift respectively) are taken into account in the present macro-element to examine the response of shallow foundations under monotonic and cyclic loads. Several applications of soil-foundation systems are studied. The results obtained from these applications are in very favourable agreement with those obtained through other numerical models in the literature.

Voltammetry of Constant Phase Elements: Analyzing Scan Rate Effects

  • Hyeonsu Je;Kwok-Fan Chow;Byoung-Yong Chang
    • Journal of Electrochemical Science and Technology
    • /
    • 제15권3호
    • /
    • pp.427-435
    • /
    • 2024
  • Here we introduce a new method for characterizing the constant phase element (CPE) in electrochemical systems using cyclic voltammetry (CV), presenting an alternative to the conventional electrochemical impedance spectroscopy (EIS) approach. While CV is recognized for its diagnostic capabilities in electrochemical analysis, it traditionally encounters difficulties in accurately measuring CPE systems due to a lack of clear linearity with scan rates, unlike capacitors. Our research demonstrates a linear relationship between current and scan rate on a log-log plot, enabling the calculation of n and Y0 values for CPE from the slopes of these linear relationships. For validation of our method, it is applied to two kinds of capacitors and the results agree with those measured by EIS. Although EIS is known to be accurate in measuring CPE systems, our alternative approach offers a timely and reasonably precise diagnostic tool, balancing between ease of use and accuracy, especially beneficial for preliminary assessments before conducting further in-depth analysis.

$p^m$-주기 이진 수열의 ${\kappa}$-오류 선형복잡도와 이진 순환 부호에의 응용 (On the ${\kappa}$-Error Linear Complexity of $p^m$-Periodic Binary Sequences and Its Applications to Binary Cyclic Codes)

  • 한윤경;양경철
    • 한국통신학회논문지
    • /
    • 제31권9C호
    • /
    • pp.846-852
    • /
    • 2006
  • ${\kappa}$-오류 선형복잡도는 통신 시스템 및 스트림 암호 시스템 등에 사용되는 수열의 안정성 여부를 판단하는 중요한 척도이다. 본 논문은 p가 소수이고 2가 모듈로 $p^2$의 원시근일 때 $p^m$-주기 이진 수열의 k-오류 선형복잡도와 해당 오류벡터를 효과적으로 구할 수 있는 알고리듬을 소개한다. 또한 암호학적인 관점에서 정의된 ${\kappa}$-오류 선형 복잡도의 의미를 부호 이론의 관점에서 살펴봄으로써 부호어의 길이가 $p^m$인 이진 순환 부호를 효과적으로 복호할 수 있는 알고리듬을 소개하며 이러한 부호의 최소 거리에 관한 중요한 성질들을 유도한다.

미지의 선형 순회부호에 대한 복원기법 (Reconstruction of Linear Cyclic Codes)

  • 정하봉;장환석;조원찬;박철순
    • 한국통신학회논문지
    • /
    • 제36권10C호
    • /
    • pp.605-613
    • /
    • 2011
  • 잡음에 있는 채널을 통한 디지털 통신에서는 채널 잡음에 대항하기 위해 오류정정부호(채널부호)를 사용하게 된다. 만일 송신측의 협조 없이 전송정보를 알아내려면 사용된 채널부호를 복원하는 것이 무엇보다 중요하다. 본 논문에서는 잡음에 오염된 수신 비트열로부터 사용된 채널부호의 여려 파라메타를 추출하여 궁극적으로 채널부호를 복원하는 채널부호 복원기법 중 순회부호(cyclic code)의 복원 기법을 제안한다.

확률적 순서를 이용한 대기행렬 망에서 안정 대기시간의 범위 (Bounds for Stationary Waiting Times in a Class of Queueing Networks using Stochastic Ordering)

  • 서동원
    • 한국경영과학회지
    • /
    • 제29권4호
    • /
    • pp.1-10
    • /
    • 2004
  • In this paper we study bounds for characteristics of stationary waiting times in (max, +)-linear systems with a Poisson arrival process. which are prevalent in manufacturing systems, kanban systems, cyclic and acyclic fork-and-join type systems, finite or infinite capacity tandem queues with various kinds of blocking, transportation systems, and telecommunication networks, and so on. Recently, some results on series expansion for characteristics, such as higher moments, Laplace transform, and tail probability, of transient and stationary waiting times in a class of (max, +)-linear systems via Taylor series expansions have been studied. In order to overcome the computational complexity in those results, we consider bounds for characteristics of stationary waiting times using valuable stochastic ordering results. Some numerical examples are also provided.