http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
AR model-based crosstalk cancellation method for operational transfer path analysis
Wei Cheng,Yan Zhu,Xuefeng Chen,Chao Song,Le Zhang,Lin Gao,Yilong Liu,Zelin Nie,Hongrui Cao,Yang Yang 대한기계학회 2022 JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY Vol.36 No.3
To reduce the crosstalk effects between the signals at reference points in operational transfer path analysis (OTPA) and improve the reliability of solutions, a novel OTPA method based on auto-regressive (AR) model is proposed in this paper. The key to this method is to obtain the power spectrum by AR model for estimating the prior transmissibility function matrix. Firstly, in view of the lack of noise reduction process in conventional crosstalk cancellation method, singular value decomposition (SVD) is applied to reduce the noise of original signals. Secondly, Burg algorithm is used to calculate AR model parameters. Thirdly, auto-power spectrum and cross-power spectrum are obtained by AR model and the periodogram method respectively. Fourthly, the transmissibility function matrix is obtained by Landweber iterative method based on corrected signals at reference points. Finally, the proposed method can significantly reduce the crosstalk effects, resulting in more accurate evaluation of transfer path contributions. Generally, this study can provide accurate and reliable evidences for vibration & noise monitoring and reduction for mechanical systems, and thus benefit for the active control of vibration & noise.
Development and characterization of a fully functional small anti-HER2 antibody
( Jie Gao ),( Bo Hua Le ),( Hui Mei Li ),( Xun Min Zhang ),( Da Peng Zhang ),( Lei Zhao ),( Chong Wang ),( Chen Fang ),( Wei Zhu Qian ),( Sheng Hou ),( Geng Kou ),( Hua Feng Wei ),( Shu Shi ),( Hao Wa 생화학분자생물학회 2009 BMB Reports Vol.42 No.10
Design of Quasi-Cyclic Low-Density Parity Check Codes with Large Girth
Long-Jiang Jing,Jing-Li Lin,Wei-Le Zhu 한국전자통신연구원 2007 ETRI Journal Vol.29 No.3
In this paper we propose a graph-theoretic method based on linear congruence for constructing low-density parity check (LDPC) codes. In this method, we design a connection graph with three kinds of special paths to ensure that the Tanner graph of the parity check matrix mapped from the connection graph is without short cycles. The new construction method results in a class of (3, ρ)- regular quasi-cyclic LDPC codes with a girth of 12. Based on the structure of the parity check matrix, the lower bound on the minimum distance of the codes is found. The simulation studies of several proposed LDPC codes demonstrate powerful bit-error-rate performance with iterative decoding in additive white Gaussian noise channels.