Dissertation > Excellent graduate degree dissertation topics show
Research of Compressed Sensing Reconstruction Algorithms Based on Matrix Decomposition
Author: LiWeiMing
Tutor: LiXiaoHui
School: Anhui University
Course: Communication and Information System
Keywords: compressed sensing (cs) Signal reconstruction algorithm Orthogonal matching pursuit algorithm Matrix decomposition
CLC: TN911.7
Type: Master's thesis
Year: 2013
Downloads: 43
Quote: 0
Read: Download Dissertation
Abstract
|
Traditional signal processing technology follows the law of Nyquist sampling signals, that the sampling frequency must be greater than two times of the highest frequency that the signal can be accurately restore. Therefore, the traditional signal processing technology have been formed by contradiction in growing demand of signal. In recent years, a new signal processing technology was proposed by some related scholars, which is the Compressed Sensing technology. The technology demonstrated a huge advantage when it was compared with the traditional signal processing technology, which combined collection and compression of signal. It had broken the shackles of the law of Nyquist and the signal can be restored accurately. When the theory of compressed Sensing technology was put forwarded, compressed sensing theory has been received widespread attention by people, and has become a hot topic in the field of signal processing research. The theory has great application prospects, which has important significance both in filed of research theory and practical application.This thesis firstly introduces the background and the research significance of compressed sensing theory, and the research status at home and abroad is introduced simply. Then this thesis introduces the overall framework of compressed sensing theory, and expounds the three steps of the process of perception:sparse representation of signal, the design of the observation matrix and the signal reconstruction algorithm. In the part of sparse representation of signal, this thesis introduces the basic principle of signal sparse; To the design of the observation matrix, the selecting principle of the observation matrix is firstly analyzed, then several observation matrix are given. This thesis mainly studies the signal reconstruction algorithm, aiming at several main signal reconstruction algorithm, that the orthogonal matching pursuit algorithm and its improved algorithm are mainly introduced. Several algorithms for the MATLAB simulation are compared and analyzed. Based on the classical orthogonal matching pursuit algorithm, which the least squares method was used in part of signal reconstruction, but the complexity is higher in the process of matrix calculation with least squares calculation, and least squares is applied to each iteration. In the light of this, the principle of least square method is introduced, and several common methods of the matrix decomposition are listed, such as the QR decomposition, the cholesky decomposition and singular value decomposition are suitably applied to least squares. On this basis, the matrix QR decomposition is used in the orthogonal matching pursuit algorithm, and deduces the simplified results. Simulate the improved algorithm and analysis of the simulation results. It is confirmed that running time of the improved algorithm is shorter than the original algorithm.
|
Related Dissertations
- Design and Implementation of Semi-Blind Channel Estimation Based on Matrix Decomposition for MIMO-OFDM Systems,TN919.3
- Research on Compressed Sensing and Its Application in IR-UWB,TN925
- Research on Analytical and Numerical Methods of Electromagnetic Scattering from Randomly Rough Surfaces and Vegetations,TM15
- Adaptive Generalized Eigen-decomposition Algorithms and Its Application in Communication,TN911
- Research on Extended Models and Algorithms for Blind Source Separation,TN911.7
- Application of Compressed Sensing to Solving3D Electromagnetic Scattering Problems Over a Wide Angle,TN011
- The Study on Multi-valued Quantum Reversible Logic Circuit Synthesis Method,TN791
- Studies on Convex Reformulation Methods for Integer Programming Problems Based on SDP Relaxations,O221.4
- Study on mathematical modeling and numerical methods of long chain molecules Brown movement,O211.63
- Research on the Model of Social Network,TP393.4
- Research of Parametric Design Theory,TP391.72
- Fine-grained Algorithm and Architecture for Data Processing in SAR Applications,TN957.52
- Decomposition of Quaternion Matrix and Its Application,O241.6
- Structural Dynamics Modeling and Study of Matrix Modification,O342
- Robust stability of nonlinear delay systems and observer design,O231
- The Supersymmetry and Eigen Energy Spectrum of a Charged Dirac Particle in a Uniform Constant Magnetic Field and Supersymmetic Quantum Mechanics,O572.2
- Decomposition Theorems of Design Matrices for General Autoregressive Models with Applications to Time Series Analysis,O212
- Matrix Decompositions over Quaternion Field,O151.21
- Based on latent semantic indexing text clustering algorithm,TP301.6
- Based on Support Vector Machine for Network Intrusion Detection System,TP393.08
CLC: > Industrial Technology > Radio electronics, telecommunications technology > Communicate > Communication theory > Signal processing
© 2012 www.DissertationTopic.Net Mobile
|