• Title/Summary/Keyword: blind identification

Search Result 75, Processing Time 0.021 seconds

Online structural identification by Teager Energy Operator and blind source separation

  • Ghasemi, Vida;Amini, Fereidoun
    • Smart Structures and Systems
    • /
    • v.26 no.2
    • /
    • pp.135-146
    • /
    • 2020
  • This paper deals with an application of adaptive blind source separation (BSS) method, equivariant adaptive separation via independence (EASI), and Teager Energy Operator (TEO) for online identification of structural modal parameters. The aim of adaptive BSS methods is recovering a set of independent sources from their unknown linear mixtures in each step when a new sample is received. In the proposed approach, firstly, the EASI method is used to decompose structural responses into independent sources at each instance. Secondly, the TEO based demodulation method with discrete energy separation algorithm (DESA-1) is applied to each independent source, and the instantaneous frequencies and damping ratios are extracted. The DESA-1 method can provide the fast time response and has high resolution so it is suitable for online problems. This paper also compares the performance of DESA-1 algorithm with Hilbert transform (HT) method. Compared to HT method, the DESA-1 method requires smaller amounts of samples to estimate and has a smaller computational complexity and faster adaption due to instantaneous characteristic. Furthermore, due to high resolution of the DESA-1 algorithm, it is very sensitive to noise and outliers. The effectiveness of the proposed approach has been validated using synthetic examples and a benchmark structure.

A Two-Step Screening Algorithm to Solve Linear Error Equations for Blind Identification of Block Codes Based on Binary Galois Field

  • Liu, Qian;Zhang, Hao;Yu, Peidong;Wang, Gang;Qiu, Zhaoyang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.9
    • /
    • pp.3458-3481
    • /
    • 2021
  • Existing methods for blind identification of linear block codes without a candidate set are mainly built on the Gauss elimination process. However, the fault tolerance will fall short when the intercepted bit error rate (BER) is too high. To address this issue, we apply the reverse algebra approach and propose a novel "two-step-screening" algorithm by solving the linear error equations on the binary Galois field, or GF(2). In the first step, a recursive matrix partition is implemented to solve the system linear error equations where the coefficient matrix is constructed by the full codewords which come from the intercepted noisy bitstream. This process is repeated to derive all those possible parity-checks. In the second step, a check matrix constructed by the intercepted codewords is applied to find the correct parity-checks out of all possible parity-checks solutions. This novel "two-step-screening" algorithm can be used in different codes like Hamming codes, BCH codes, LDPC codes, and quasi-cyclic LDPC codes. The simulation results have shown that it can highly improve the fault tolerance ability compared to the existing Gauss elimination process-based algorithms.

Blind Source Separation of Instantaneous Mixture of Delayed Sources Using High-Order Taylor Approximation

  • Zhao, Wei;Yuan, Zhigang;Shen, Yuehong;Cao, Yufan;Wei, Yimin;Xu, Pengcheng;Jian, Wei
    • ETRI Journal
    • /
    • v.37 no.4
    • /
    • pp.727-735
    • /
    • 2015
  • This paper deals with the problem of blind source separation (BSS), where observed signals are a mixture of delayed sources. In reference to a previous work, when the delay time is small such that the first-order Taylor approximation holds, delayed observations are transformed into an instantaneous mixture of original sources and their derivatives, for which an extended second-order blind identification (SOBI) approach is used to recover sources. Inspired by the results of this previous work, we propose to generalize its first-order Taylor approximation to suit higher-order approximations in the case of a large delay time based on a similar version of its extended SOBI. Compared to SOBI and its extended version for a first-order Taylor approximation, our method is more efficient in terms of separation quality when the delay time is large. Simulation results verify the performance of our approach under different time delays and signal-to-noise ratio conditions, respectively.

Joint Blind Data/Channel Estimation Based on Linear Prediction

  • Ahn, Kyung-Seung;Byun, Eul-Chool;Baik, Heung-Ki
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.869-872
    • /
    • 2001
  • Blind identification and equalization of communication channel is important because it does not need training sequence, nor does it require a priori channel information. So, we can increase the bandwidth efficiency. The linear prediction error method is perhaps the most attractive in practice due to the insensitive to blind channel estimator and equalizer length mismatch as well as for its simple adaptive algorithms. In this paper, we propose method for fractionally spaced blind equalizer with arbitrary delay using one-step forward prediction error filter from second-order statistics of the received signals for SIMO channel. Our algorithm utilizes the forward prediction error as training sequences for data estimation and desired signal for channel estimation.

  • PDF

An Introduction to Energy-Based Blind Separating Algorithm for Speech Signals

  • Mahdikhani, Mahdi;Kahaei, Mohammad Hossein
    • ETRI Journal
    • /
    • v.36 no.1
    • /
    • pp.175-178
    • /
    • 2014
  • We introduce the Energy-Based Blind Separating (EBS) algorithm for extremely fast separation of mixed speech signals without loss of quality, which is performed in two stages: iterative-form separation and closed-form separation. This algorithm significantly improves the separation speed simply due to incorporating only some specific frequency bins into computations. Simulation results show that, on average, the proposed algorithm is 43 times faster than the independent component analysis (ICA) for speech signals, while preserving the separation quality. Also, it outperforms the fast independent component analysis (FastICA), the joint approximate diagonalization of eigenmatrices (JADE), and the second-order blind identification (SOBI) algorithm in terms of separation quality.

Identification of fault signal for rotating machinery diagnosis using Blind Source Separation (BSS) (BSS를 이용한 회전 기계 진단 신호 분석)

  • Seo, Jong-Soo;Lee, Jeong-Hak;J. K. Hammond
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2003.05a
    • /
    • pp.839-845
    • /
    • 2003
  • This paper introduces multichannel blind source separation (BSS) and multichannel blind deconvolution (MBD) based on higher order statistics of signals from convolutive mixtures. In particular, we are concerned with the case that the number of inputs is the same as the number of outputs. Simulations for two input two output cases are carried out and their performances are assessed. One of the major applications of those sequential algorithms (BSS and MBD) is demonstrated through the fault signal detection from only a single measurement of rotating machine, which offers a certain degree of practicability in the engineering field such as machine health monitoring or condition monitoring.

  • PDF

An Approach to Eliminate Ambiguity of Blind ML Detection for Orthogonal Space-Time Block Codes

  • Pham, Van-Su;Le, Minh-Tuan;Mai, Linh;Kabir, S. M. Humayun;Yoon, Gi-Wan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.83-86
    • /
    • 2007
  • In the blind Maximum-likelihood (ML) detection for Orthogonal Space-Time Block Codes (OSTBC), the problem of ambiguity in determining the symbols has been a great concern. A solution to this problem is to apply semi-blind ML detection, i.e., the blind ML decoding with pilot symbols or training sequence. In order to increase the performance, the number of pilot symbols or length of training sequence should be increased. Unfortunately, this leads to a significant decrease in system spectral efficiency. This work presents an approach to resolve the aforementioned issue by introducing a new method for constructing transmitted information symbol. Thus, by transmitting information symbols drawn from different modulation constellation, the ambiguity can be easily eliminated in blind detection. Also, computer simulations are implemented to verify the performance of the proposed approach.

  • PDF

BLIND IDENTIFICATION OF IMPACTING SIGNAL USING HIGHER ORDER STATISTICS (고차통계를 이용한 충격/불량신호 탐지)

  • Seo, Jong-Soo;J.K. Hammond
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2001.11b
    • /
    • pp.1044-1049
    • /
    • 2001
  • Classical deconvolution methods for source identification following linear filtering can only be used if the transfer function of the system is known. For many practical situations, however, this information is not accessible and/or is time varying. The problem addressed here is that of reconstruction of the original input from only the measured signal. This is known as 'blind deconvolution'. By using Higher Order Statistics (HOS), the restoration of the input signal is established through the maximisation of higher order moments (cumulants) with respect to the characteristics of the signals concerned. This restoration is achieved by constructing an inverse filter considering the choice of the initial inverse filter type. As a practical application, an experimental verification is carried out for the restoration of our impacting signal arising in the response of a cantilever beam with an end stop when randomly excited.

  • PDF

Blind Signal Subspace-Based Channel Identification for DS/CDMA DM Downlink (DS/CDMA DMB 하향 링크에서의 신호 공간에 기초한 블라인드 채널 추정)

  • Yang Wan-Chul;Lee Byung-Seub
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.15 no.9
    • /
    • pp.848-855
    • /
    • 2004
  • In this paper, we propose a new channel identification technique for long code DS/CDMA DMB down link system which estimate the channel response based on the signal space vector only, unlike the most conventional subspace method relying on the orthogonal property of noise space vectors to the signal space vector. Because of this property of the proposed method, it is optimum and practical in manipulation of the covariance matrix to be analyzed. In the paper, we derive the mathematical expression necessary to clarify the proposed method and show the relevant simulation and numerical results to verify the validity of the proposed algorithm.

DOA Estimation of Arrays Antenna using Second Order Statistics (2차 통계량을 이용한 배열 안테나의 도래 방향 추정)

  • Byon Kun-Sik;Jang Eun-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.3
    • /
    • pp.522-527
    • /
    • 2005
  • We need a transmission of high quality and capacity according to a fast supply of mobile communication terminal. As multipath fading occured in high speed transmission, adaptive array antenna habe been studied to solve such a demand. DOA(Direction of Arrival) estimation play a important .ole in adaptive a..ay antenna. This paper present a space time blind identification using second order statistics and present blind space time adaptive array antenna. Also we verified a effect of the presented method.