• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.1
• /
• pp.150-158
• /
• 2010

Filtering is necessary for the SRC(sample rate converter), that is used to change the sampling rate of a digital signal. The larger the conversion ratio of the sampling rate becomes, the more signal processing is needed for the filter, which means more complexity on realization. Thus it is important to reduce the amount of signal processing for the case of substantial conversion ratios. In this paper it is presented an efficient design method of a multistage FIR(finite impulse response) filter, with which the rate conversion occurs in stages rather than in one step. In this method, filter searching is performed exhaustively over all possible factorization of the conversion ratio, and also the filter complexity is measured based on direct realization rather than on estimation. It has been shown a designed multistage filter to have a less number of multiplications for filtering operation in comparison with a conventionally designed one. It has also been found that by allowing some variations of the filter architecture such as a halfband filter or a filter with multiple transition bands, the number of multiplications can be reduced further.

• Structural Engineering and Mechanics
• /
• v.37 no.6
• /
• pp.671-684
• /
• 2011

Deciding on an optimal sensor placement (OSP) is a common problem encountered in many engineering applications and is also a critical issue in the construction and implementation of an effective structural health monitoring (SHM) system. The present study focuses with techniques for selecting optimal sensor locations in a sensor network designed to monitor the health condition of Dalian World Trade Building which is the tallest in the northeast of China. Since the number of degree-of-freedom (DOF) of the building structure is too large, multi-modes should be selected to describe the dynamic behavior of a structural system with sufficient accuracy to allow its health state to be determined effectively. However, it's difficult to accurately distinguish the translational and rotational modes for the flexible structures with closely spaced modes by the modal participation mass ratios. In this paper, a new method of the OSP that computing the mode shape matrix in the weak axis of structure by the simplified multi-DOF system was presented based on the equivalent rigidity parameter identification method. The initial sensor assignment was obtained by the QR-factorization of the structural mode shape matrix. Taking the maximum off-diagonal element of the modal assurance criterion (MAC) matrix as a target function, one more sensor was added each time until the maximum off-diagonal element of the MAC reaches the threshold. Considering the economic factors, the final plan of sensor placement was determined. The numerical example demonstrated the feasibility and effectiveness of the proposed scheme.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.324-329
• /
• 2003

The public-key cryptosystems such as Diffie-Hellman Key Distribution and Elliptical Curve Cryptosystems are built on the basis of the operations defined in GF(2$^{m}$ ):addition, subtraction, multiplication and multiplicative inversion. It is important that these operations should be computed at high speed in order to implement these cryptosystems efficiently. Among those operations, as being the most time-consuming, multiplicative inversion has become the object of lots of investigation Formant's theorem says $\beta$$^{-1}$ =$\beta$$^{2}$sup m/-2/, where $\beta$$^{-1}$ is the multiplicative inverse of $\beta$$\in$GF(2$^{m}$ ). Therefore, to compute the multiplicative inverse of arbitrary elements of GF(2$^{m}$ ), it is most important to reduce the number of times of multiplication by decomposing 2$^{m}$ -2 efficiently. Among many algorithms relevant to the subject, the algorithm proposed by Itoh and Tsujii[2] has reduced the required number of times of multiplication to O(log m) by using normal basis. Furthermore, a few papers have presented algorithms improving the Itoh and Tsujii's. However they have some demerits such as complicated decomposition processes[3,5]. In this paper, in the case of 2$^{m}$ -2, which is mainly used in practical applications, an efficient algorithm is proposed for computing the multiplicative inverse at high speed by using both the factorization formula x$^3$-y$^3$=(x-y)(x$^2$＋xy＋y$^2$) and normal basis. The number of times of multiplication of the algorithm is smaller than that of the algorithm proposed by Itoh and Tsujii. Also the algorithm decomposes 2$^{m}$ -2 more simply than other proposed algorithms.