• Title/Summary/Keyword: random matrices

Search Result 76, Processing Time 0.022 seconds

Identification of Structural Characteristic Matrices of Steel Bar by Genetic Algorithm (유전알고리즘에 의한 강봉의 구조특성행렬 산출법)

  • Park, S.C.;Je, H.K.;Yi, G.J.;Park, Y.B.;Park, K.I.
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.20 no.10
    • /
    • pp.946-952
    • /
    • 2010
  • A method for the identification of structural characteristic parameters of a steel bar in the matrices form such as stiffness matrices and mass matrices from frequency response function(FRF) by genetic algorithm is proposed. As the method is based on the finite element method(FEM), the obtained matrices have perfect physical meanings if the FRFs got from the analysis and the FRFs from the experiments were well coincident each other. The identified characteristic matrices from the FRFs with maximun 40 % of random errors by the genetic algorithm are coincident with the characteristic matrices from exact FEM FRFs well each other. The fitted element diameters by using only 2 points experimental FRFs are similar to the actual diameters of the bar. The fitted FRFs are good accordance with the experimental FRFs on the graphs. FRFs of the rest 9 points not used for calculating could be fitted even well.

A Pseudo-Random Beamforming Technique for Time-Synchronized Mobile Base Stations with GPS Signal

  • Son, Woong;Jung, Bang Chul
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.7 no.2
    • /
    • pp.53-59
    • /
    • 2018
  • This paper proposes a pseudo-random beamforming technique for time-synchronized mobile base stations (BSs) for multi-cell downlink networks which have mobility. The base stations equipped with multi-antennas and mobile stations (MSs) are time-synchronized based on global positioning system (GPS) signals and generate a number of transmit beamforming matrix candidates according to the predetermined pseudo-random pattern. In addition, MSs generate receive beamforming vectors that correspond to the beam index number based on the minimum mean square error (MMSE) using transmit beamforming vectors that make up a number of transmit beamforming matrices and wireless channel matrices from BSs estimated via the reference signals (RS). Afterward, values of received signal-to-interference-plus-noise ratio (SINR) with regard to all transmit beamforming vectors are calculated, and the resulting values are then feedbacked to the BS of the same cells along with the beam index number. Each of the BSs calculates each of the sum-rates of the transmit beamforming matrix candidates based on the feedback information and then transmits the calculated results to the BS coordinator. After this, optimum transmit beamforming matrices, which can maximize a sum-rate of the entire cells, are selected at the BS coordinator and informed to the BSs. Finally, data signals are transmitted using them. The simulation results verified that a sum-rate of the entire cells was improved as the number of transmit beamforming matrix candidates increased. It was also found that if the received SINR values and beam index numbers are feedbacked opportunistically from each of the MSs to the BSs, not only nearly the same performance in sum-rate with that of applying existing feedback techniques could be achieved but also an amount of feedback was significantly reduced.

Global Feature Extraction and Recognition from Matrices of Gabor Feature Faces

  • Odoyo, Wilfred O.;Cho, Beom-Joon
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.2
    • /
    • pp.207-211
    • /
    • 2011
  • This paper presents a method for facial feature representation and recognition from the Covariance Matrices of the Gabor-filtered images. Gabor filters are a very powerful tool for processing images that respond to different local orientations and wave numbers around points of interest, especially on the local features on the face. This is a very unique attribute needed to extract special features around the facial components like eyebrows, eyes, mouth and nose. The Covariance matrices computed on Gabor filtered faces are adopted as the feature representation for face recognition. Geodesic distance measure is used as a matching measure and is preferred for its global consistency over other methods. Geodesic measure takes into consideration the position of the data points in addition to the geometric structure of given face images. The proposed method is invariant and robust under rotation, pose, or boundary distortion. Tests run on random images and also on publicly available JAFFE and FRAV3D face recognition databases provide impressively high percentage of recognition.

Construction of Jacket Matrices Based on q-ary M-sequences (q-ary M-sequences에 근거한 재킷 행렬 설계)

  • S.P., Balakannan;Kim, Jeong-Ki;Borissov, Yuri;Lee, Moon-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.7
    • /
    • pp.17-21
    • /
    • 2008
  • As with the binary pseudo-random sequences q-ary m-sequences possess very good properties which make them useful in many applications. So we construct a class of Jacket matrices by applying additive characters of the finite field $F_q$ to entries of all shifts of q-ary m-sequence. In this paper, we generalize a method of obtaining conventional Hadamard matrices from binary PN-sequences. By this way we propose Jacket matrix construction based on q-ary M-sequences.

Design of Encoder and Decoder for LDPC Codes Using Hybrid H-Matrix

  • Lee, Chan-Ho
    • ETRI Journal
    • /
    • v.27 no.5
    • /
    • pp.557-562
    • /
    • 2005
  • Low-density parity-check (LDPC) codes have recently emerged due to their excellent performance. However, the parity check (H) matrices of the previous works are not adequate for hardware implementation of encoders or decoders. This paper proposes a hybrid parity check matrix which is efficient in hardware implementation of both decoders and encoders. The hybrid H-matrices are constructed so that both the semi-random technique and the partly parallel structure can be applied to design encoders and decoders. Using the proposed methods, the implementation of encoders can become practical while keeping the hardware complexity of the partly parallel decoder structures. An encoder and a decoder are designed using Verilog-HDL and are synthesized using a $0.35 {\mu}m$ CMOS standard cell library.

  • PDF

Experiment study of structural random loading identification by the inverse pseudo excitation method

  • Guo, Xing-Lin;Li, Dong-Sheng
    • Structural Engineering and Mechanics
    • /
    • v.18 no.6
    • /
    • pp.791-806
    • /
    • 2004
  • The inverse pseudo excitation method is used in the identification of random loadings. For structures subjected to stationary random excitations, the power spectral density matrices of such loadings are identified experimentally. The identification is based on the measured acceleration responses and the structural frequency response functions. Numerical simulation is used in the optimal selection of sensor locations. The proposed method has been successfully applied to the loading identification experiments of three structural models, two uniform steel cantilever beams and a four-story plastic glass frame, subjected to uncorrelated or partially correlated random excitations. The identified loadings agree quite well with actual excitations. It is proved that the proposed method is quite accurate and efficient in addition to its ability to alleviate the ill conditioning of the structural frequency response functions.

HIGHER ORDER ITERATIONS FOR MOORE-PENROSE INVERSES

  • Srivastava, Shwetabh;Gupta, D.K.
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.1_2
    • /
    • pp.171-184
    • /
    • 2014
  • A higher order iterative method to compute the Moore-Penrose inverses of arbitrary matrices using only the Penrose equation (ii) is developed by extending the iterative method described in [1]. Convergence properties as well as the error estimates of the method are studied. The efficacy of the method is demonstrated by working out four numerical examples, two involving a full rank matrix and an ill-conditioned Hilbert matrix, whereas, the other two involving randomly generated full rank and rank deficient matrices. The performance measures are the number of iterations and CPU time in seconds used by the method. It is observed that the number of iterations always decreases as expected and the CPU time first decreases gradually and then increases with the increase of the order of the method for all examples considered.

Design of an Efficient LDPC Codec for Hardware Implementation (하드웨어 구현에 적합한 효율적인 LDPC 코덱의 설계)

  • Lee Chan-Ho;Park Jae-Geun
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.7 s.349
    • /
    • pp.50-57
    • /
    • 2006
  • Low-density parity-check (LDPC) codes are recently emerged due to its excellent performance. However, the parity check (H) matrices of the previous works are not adequate for hardware implementation of encoders or decoders. This paper proposes a hybrid parity check matrix which is efficient in hardware implementation of both decoders and encoders. The hybrid H-matrices are constructed so that both the semi-random technique and the partly parallel structure can be applied to design encoders and decoders. Using the proposed methods, the implementation of encoders can become practical while keeping the hardware complexity of the partly parallel decoder structures. An encoder and a decoder are designed using Verilog-HDL and compared with the previous results.

Adaptive State Feedback Control System of DC Motors with Periodic Random Disturbance (주기적 확률외란을 갖는 DC 전동기의 적응형 상태궤환 제어시스템)

  • Jeong, Sang-Chul;Kim, Jun-Su;Cho, Hyun-Cheol;Lee, Hyung-Ki
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.6
    • /
    • pp.1036-1041
    • /
    • 2008
  • Periodic disturbance is practically occurred in several engineering applications, especially in data storage systems. However, recently addressed controls for such problem were mostly dealt with its deterministic nature, which is rarely practical in real-time implementation. We present an adaptive control approach for DC motor systems with periodic stochastic disturbance whose frequency and magnitude are both random variables. We establish adaptive state feedback control which is linearly composed of nominal and corrective control parameter matrices. The former is derived from a nominal system model voiding disturbance and the latter is constructed from a disturbed system model by using Lyapunov stability theory. We carry out computer simulation to evaluate the proposed control methodology and compare to the recently addressed control method to demonstrate its superiority.