• Journal of Mechanical Science and Technology
• /
• v.14 no.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.

• Journal of Mechanical Science and Technology
• /
• v.14 no.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.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3A
• /
• pp.197-204
• /
• 2009

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 preceding technique can significantly improve the performance of communication systems by exploiting the channel state in formation (CSI). In order to achieve enhanced performance, we propose applying linear preceding 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 ass umed 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.

• Geomechanics and Engineering
• /
• v.14 no.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.

• Journal of Electrochemical Science and Technology
• /
• v.15 no.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 Y₀ 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9C
• /
• pp.846-852
• /
• 2006

The ${\kappa}$-error linear complexity is a ky measure of the stability of the sequences used in the areas of communication systems, stream ciphers in cryptology and so on. This paper introduces an efficient algorithm to determine the ${\kappa}$-error linear complexity and the corresponding error vectors of $p^m$-periodic binary sequences, where : is a prime and 2 is a primitive root modulo $p^2$. We also give a new sense about the ${\kappa}$-error linear complexity in viewpoint of coding theory instead of cryptographic results. We present an efficient algorithm for decoding binary cyclic codes of length $p^m$ and derive key properties of the minimum distance of these codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.10C
• /
• pp.605-613
• /
• 2011

In most digital communication systems over the noisy channel, some form of forward error correction scheme is employed for reliable communications. If one wants to recover the transmitted message without any knowledge of the error correcting codes employed, it is of utmost importance to figure out and reconstruct the error correcting codes. In this paper, we propose two algorithms of reconstructing linear cyclic codes from the corrupted received bit sequence, one for general linear binary cyclic codes and the other for Reed-Solomon codes. For two algorithms, we ran computer simulations and the performances are shown to be superior to those with the conventional LWM method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.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.