• Title/Summary/Keyword: Matching pursuit algorithm

Search Result 55, Processing Time 0.026 seconds

Joint Localization and Velocity Estimation for Pulse Radar in the Near-field Environments

  • Nakyung Lee;Hyunwoo Park;Daesung Park;Bukeun Byeon;Sunwoo Kim
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.12 no.3
    • /
    • pp.315-321
    • /
    • 2023
  • In this paper, we propose an algorithm that jointly estimates the location and velocity of a near-field moving target in a pulse radar system. The proposed algorithm estimates the location and velocity corresponding to the outcome of orthogonal matching pursuit (OMP) in a 4-dimensional (4D) location-velocity space. To address the high computational complexity of 4D parameter joint estimation, we propose an algorithm that iteratively estimates the target's 2D location and velocity sequentially. Through simulations, we analyze the estimation performance and verify the computational efficiency of the proposed algorithm.

Highband Coding Method Using Matching Pusuit Estimation and CELP Coding for Wideband Speech Coder (광대역 음성부호화기를 위한 매칭퍼슈잇 알고리즘과 CELP 방법을 이용한 고대역 부호화 방법)

  • Jeong Gyu-Hyeok;Ahn Yeong-Uk;Kim Jong-Hark;Shin Jae-Hyun;Seo Sang-Won;Hwang In-Kwan;Lee In-Sung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.25 no.1
    • /
    • pp.21-29
    • /
    • 2006
  • In this Paper a split bandwidth wideband speech coder and its highband coding method are Proposed. The coder uses a split-band approach. where the wideband input speech signal is split into two equal frequency bands from 0-4kHz and 4-8kHz. The lowband and the highband are coded respectively by the 11.8kb/s G.729 Annex E and the proposed coding method. After the LPC analysis, the highband is divided by two modes according to the properties of signals. In stationary mode. the highband signals are compressed by the mixture excitation model; CELP algorithm and W (Matching Pursuit) algorithm. The others are coded by the only CELP algorithm. We compare the performance of the new wideband speech coder with that of G.722 48kbps SB-ADPCM and G.722.2 12.85kbps in a subjective method. The simulation results show that the Performance of the proposed wideband speech coder has better than that of 48kbps G.722 and no better than that of 12.85kbps G.722.2.

Ultrasonic Flaw Detection in Composite Materials Using SSP-MPSD Algorithm

  • Benammar, Abdessalem;Drai, Redouane
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.5
    • /
    • pp.1753-1761
    • /
    • 2014
  • Due to the inherent inhomogeneous and anisotropy nature of the composite materials, the detection of internal defects in these materials with non-destructive techniques is an important requirement both for quality checks during the production phase and in service inspection during maintenance operations. The estimation of the time-of-arrival (TOA) and/or time-of-flight (TOF) of the ultrasonic echoes is essential in ultrasonic non-destructive testing (NDT). In this paper, we used split-spectrum processing (SSP) combined with matching pursuit signal decomposition (MPSD) to develop a dedicated ultrasonic detection system. SSP algorithm is used for Signal-to-Noise Ratio (SNR) enhancement, and the MPSD algorithm is used to decompose backscattered signals into a linear expansion of chirplet echoes and estimate the chirplet parameters. Therefore, the combination of SSP and MPSD (SSP-MPSD) presents a powerful technique for ultrasonic NDT. The SSP algorithm is achieved by using Gaussian band pass filters. Then, MPSD algorithm uses the Maximum Likelihood Estimation. The good performance of the proposed method is experimentally verified using ultrasonic traces acquired from three specimens of carbon fibre reinforced polymer multi-layered composite materials (CFRP).

A Compressed Sensing-Based Signal Detection Technique for Generalized Space Shift Keying Systems (일반화된 공간천이변조 시스템에서 압축센싱기술을 이용한 수신신호 복호 알고리즘)

  • Park, Jeonghong;Ban, Tae Won;Jung, Bang Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.7
    • /
    • pp.1557-1564
    • /
    • 2014
  • In this paper, we propose a signal detection technique based on the parallel orthogonal matching pursuit (POMP) is proposed for generalized shift space keying (GSSK) systems, which is a modified version of the orthogonal matching pursuit (OMP) that is widely used as a greedy algorithm for sparse signal recovery. The signal recovery problem in the GSSK systems is similar to that in the compressed sensing (CS). In the proposed POMP technique, multiple indexes which have the maximum correlation between the received signal and the channel matrix are selected at the first iteration, while a single index is selected in the OMP algorithm. Finally, the index yielding the minimum residual between the received signal and the M recovered signals is selected as an estimate of the original transmitted signal. POMP with Quantization (POMP-Q) is also proposed, which combines the POMP technique with the signal quantization at each iteration. The proposed POMP technique induces the computational complexity M times, compared with the OMP, but the performance of the signal recovery significantly outperform the conventional OMP algorithm.

A New Compressive Feedback Scheme Based on Distributed Compressed Sensing for Time-Correlated MIMO Channel

  • Li, Yongjie;Song, Rongfang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.2
    • /
    • pp.580-592
    • /
    • 2012
  • In this paper, a new compressive feedback (CF) scheme based on distributed compressed sensing (DCS) for time-corrected MIMO channel is proposed. First, the channel state information (CSI) is approximated by using a subspace matrix, then, the approximated CSI is compressed using a compressive matrix. At the base station, the approximated CSI can be robust recovered with simultaneous orthogonal matching pursuit (SOMP) algorithm by using forgone CSIs. Simulation results show our proposed DCS-CF method can improve the reliability of system without creating a large performance loss.

Sparse Signal Recovery with Pruning-based Tree search

  • Kim, Jinhong;Shim, Byonghyo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2015.11a
    • /
    • pp.51-53
    • /
    • 2015
  • In this paper, we propose an efficient sparse signal recovery algorithm referred to as the matching pursuit with a tree pruning (TMP). Two key ingredients of TMP are the pre-selection to put a restriction on columns of the sensing matrix to be investigated and the tree pruning to eliminate unpromising paths from the search tree. In our analysis, we show that the sparse signal is accurately reconstructed when the sensing matrix satisfies the restricted isometry property. In our simulations, we confirm that TMP is effective in recovering sparse signals and outperforms conventional sparse recovery algorithms.

  • PDF

Sparse Index Multiple Access for Multi-Carrier Systems with Precoding

  • Choi, Jinho
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.439-445
    • /
    • 2016
  • In this paper, we consider subcarrier-index modulation (SIM) for precoded orthogonal frequency division multiplexing (OFDM) with a few activated subcarriers per user and its generalization to multi-carrier multiple access systems. The resulting multiple access is called sparse index multiple access (SIMA). SIMA can be considered as a combination of multi-carrier code division multiple access (MC-CDMA) and SIM. Thus, SIMA is able to exploit a path diversity gain by (random) spreading over multiple carriers as MC-CDMA. To detect multiple users' signals, a low-complexity detection method is proposed by exploiting the notion of compressive sensing (CS). The derived low-complexity detection method is based on the orthogonal matching pursuit (OMP) algorithm, which is one of greedy algorithms used to estimate sparse signals in CS. From simulation results, we can observe that SIMA can perform better than MC-CDMA when the ratio of the number of users to the number of multi-carrier is low.

A Spatial-Temporal Three-Dimensional Human Pose Reconstruction Framework

  • Nguyen, Xuan Thanh;Ngo, Thi Duyen;Le, Thanh Ha
    • Journal of Information Processing Systems
    • /
    • v.15 no.2
    • /
    • pp.399-409
    • /
    • 2019
  • Three-dimensional (3D) human pose reconstruction from single-view image is a difficult and challenging topic. Existing approaches mostly process frame-by-frame independently while inter-frames are highly correlated in a sequence. In contrast, we introduce a novel spatial-temporal 3D human pose reconstruction framework that leverages both intra and inter-frame relationships in consecutive 2D pose sequences. Orthogonal matching pursuit (OMP) algorithm, pre-trained pose-angle limits and temporal models have been implemented. Several quantitative comparisons between our proposed framework and recent works have been studied on CMU motion capture dataset and Vietnamese traditional dance sequences. Our framework outperforms others by 10% lower of Euclidean reconstruction error and more robust against Gaussian noise. Additionally, it is also important to mention that our reconstructed 3D pose sequences are more natural and smoother than others.

Fault Diagnosis of Wind Power Converters Based on Compressed Sensing Theory and Weight Constrained AdaBoost-SVM

  • Zheng, Xiao-Xia;Peng, Peng
    • Journal of Power Electronics
    • /
    • v.19 no.2
    • /
    • pp.443-453
    • /
    • 2019
  • As the core component of transmission systems, converters are very prone to failure. To improve the accuracy of fault diagnosis for wind power converters, a fault feature extraction method combined with a wavelet transform and compressed sensing theory is proposed. In addition, an improved AdaBoost-SVM is used to diagnose wind power converters. The three-phase output current signal is selected as the research object and is processed by the wavelet transform to reduce the signal noise. The wavelet approximation coefficients are dimensionality reduced to obtain measurement signals based on the theory of compressive sensing. A sparse vector is obtained by the orthogonal matching pursuit algorithm, and then the fault feature vector is extracted. The fault feature vectors are input to the improved AdaBoost-SVM classifier to realize fault diagnosis. Simulation results show that this method can effectively realize the fault diagnosis of the power transistors in converters and improve the precision of fault diagnosis.

Sparsity Adaptive Expectation Maximization Algorithm for Estimating Channels in MIMO Cooperation systems

  • Zhang, Aihua;Yang, Shouyi;Li, Jianjun;Li, Chunlei;Liu, Zhoufeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3498-3511
    • /
    • 2016
  • We investigate the channel state information (CSI) in multi-input multi-output (MIMO) cooperative networks that employ the amplify-and-forward transmission scheme. Least squares and expectation conditional maximization have been proposed in the system. However, neither of these two approaches takes advantage of channel sparsity, and they cause estimation performance loss. Unlike linear channel estimation methods, several compressed channel estimation methods are proposed in this study to exploit the sparsity of the MIMO cooperative channels based on the theory of compressed sensing. First, the channel estimation problem is formulated as a compressed sensing problem by using sparse decomposition theory. Second, the lower bound is derived for the estimation, and the MIMO relay channel is reconstructed via compressive sampling matching pursuit algorithms. Finally, based on this model, we propose a novel algorithm so called sparsity adaptive expectation maximization (SAEM) by using Kalman filter and expectation maximization algorithm so that it can exploit channel sparsity alternatively and also track the true support set of time-varying channel. Kalman filter is used to provide soft information of transmitted signals to the EM-based algorithm. Various numerical simulation results indicate that the proposed sparse channel estimation technique outperforms the previous estimation schemes.