Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 Mathematics , 2012, Abstract: In this work, we analyze modulated sampling schemes, such as the Nyquist Folding Receiver, which are highly efficient, readily implementable, non-uniform sampling schemes that allows for the blind estimation of a narrow-band signal's spectral content and location in a wide-band environment. This non-uniform sampling, achieved by narrow-band modulation of the RF instantaneous sample rate, results in a frequency domain point spread function that is between the extremes obtained by uniform sampling and totally random sampling. As a result, while still preserving structured aliasing, the modulated sampling scheme is also useful in a compressive sensing (CS) setting. We estimate restricted isometry property (RIP) constants for CS matrices induced by such modulated sampling schemes and use those estimates to determine the amount of sparsity needed for signal recovery. This is followed by a demonstration and analysis of Orthogonal Matching Pursuit's ability to reconstruct signals from noisy non-uniform samples.
 - , 2018, DOI: 10.16356/j.1005-1120.2018.02.282 Abstract: Signals can be sampled by compressive sensing theory with a much less rate than those by traditional Nyquist sampling theorem, and reconstructed with high probability, only when signals are sparse in the time domain or a transform domain. Most signals are not sparse in real world, but can be expressed in sparse form by some kind of sparse transformation. Commonly used sparse transformations will lose some information, because their transform bases are generally fixed. In this paper, we use principal component analysis for data reduction, and select new variable with low dimension and linearly correlated to the original variable, instead of the original variable with high dimension, thus the useful data of the original signals can be included in the sparse signals after dimensionality reduction with maximize portability. Therefore, the loss of data can be reduced as much as possible, and the efficiency of signal reconstruction can be improved. Finally, the composite material plate is used for the experimental verification. The experimental result shows that the sparse representation of signals based on principal component analysis can reduce signal distortion and improve signal reconstruction efficiency.
 Mathematics , 2009, Abstract: Periodic nonuniform sampling is a known method to sample spectrally sparse signals below the Nyquist rate. This strategy relies on the implicit assumption that the individual samplers are exposed to the entire frequency range. This assumption becomes impractical for wideband sparse signals. The current paper proposes an alternative sampling stage that does not require a full-band front end. Instead, signals are captured with an analog front end that consists of a bank of multipliers and lowpass filters whose cutoff is much lower than the Nyquist rate. The problem of recovering the original signal from the low-rate samples can be studied within the framework of compressive sampling. An appropriate parameter selection ensures that the samples uniquely determine the analog input. Moreover, the analog input can be stably reconstructed with digital algorithms. Numerical experiments support the theoretical analysis.
 Mathematics , 2013, DOI: 10.1186/1687-6180-2013-136 Abstract: Wireless sensor networks (WSN), i.e. networks of autonomous, wireless sensing nodes spatially deployed over a geographical area, are often faced with acquisition of spatially sparse fields. In this paper, we present a novel bandwidth/energy efficient CS scheme for acquisition of spatially sparse fields in a WSN. The paper contribution is twofold. Firstly, we introduce a sparse, structured CS matrix and we analytically show that it allows accurate reconstruction of bidimensional spatially sparse signals, such as those occurring in several surveillance application. Secondly, we analytically evaluate the energy and bandwidth consumption of our CS scheme when it is applied to data acquisition in a WSN. Numerical results demonstrate that our CS scheme achieves significant energy and bandwidth savings wrt state-of-the-art approaches when employed for sensing a spatially sparse field by means of a WSN.
 Mathematics , 2010, Abstract: Wideband wireless channel is a time dispersive channel and becomes strongly frequency-selective. However, in most cases, the channel is composed of a few dominant taps and a large part of taps is approximately zero or zero. To exploit the sparsity of multi-path channel (MPC), two methods have been proposed. They are, namely, greedy algorithm and convex program. Greedy algorithm is easy to be implemented but not stable; on the other hand, the convex program method is stable but difficult to be implemented as practical channel estimation problems. In this paper, we introduce a novel channel estimation strategy using compressive sampling matching pursuit (CoSaMP) algorithm which was proposed in [1]. This algorithm will combine the greedy algorithm with the convex program method. The effectiveness of the proposed algorithm will be confirmed through comparisons with the existing methods.
 Andriyan Bayu Suksmono Computer Science , 2011, Abstract: This paper proposes a new fBm (fractional Brownian motion) interpolation/reconstruction method from partially known samples based on CS (Compressive Sampling). Since 1/f property implies power law decay of the fBm spectrum, the fBm signals should be sparse in frequency domain. This property motivates the adoption of CS in the development of the reconstruction method. Hurst parameter H that occurs in the power law determines the sparsity level, therefore the CS reconstruction quality of an fBm signal for a given number of known subsamples will depend on H. However, the proposed method does not require the information of H to reconstruct the fBm signal from its partial samples. The method employs DFT (Discrete Fourier Transform) as the sparsity basis and a random matrix derived from known samples positions as the projection basis. Simulated fBm signals with various values of H are used to show the relationship between the Hurst parameter and the reconstruction quality. Additionally, US-DJIA (Dow Jones Industrial Average) stock index monthly values time-series are also used to show the applicability of the proposed method to reconstruct a real-world data.
 Mathematics , 2013, DOI: 10.1587/transfun.E95.A.713 Abstract: In remote control, efficient compression or representation of control signals is essential to send them through rate-limited channels. For this purpose, we propose an approach of sparse control signal representation using the compressive sampling technique. The problem of obtaining sparse representation is formulated by cardinality-constrained L2 optimization of the control performance, which is reducible to L1-L2 optimization. The low rate random sampling employed in the proposed method based on the compressive sampling, in addition to the fact that the L1-L2 optimization can be effectively solved by a fast iteration method, enables us to generate the sparse control signal with reduced computational complexity, which is preferable in remote control systems where computation delays seriously degrade the performance. We give a theoretical result for control performance analysis based on the notion of restricted isometry property (RIP). An example is shown to illustrate the effectiveness of the proposed approach via numerical experiments.
 Mathematics , 2012, Abstract: Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm optimization. Recent investigation shows that some signals are sparse in multiple domains. To further improve the signal reconstruction performance, we can exploit this multi-sparsity to generate a new convex programming model. The latter is formulated with multiple sparsity constraints in multiple domains and the linear measurement fitting constraint. It improves signal recovery performance by additional a priori information. Since some EMG signals exhibit sparsity both in time and frequency domains, we take them as example in numerical experiments. Results show that the newly proposed method achieves better performance for multi-sparse signals.
 Morteza Hashemi Mathematics , 2015, Abstract: Many communication systems involve high bandwidth, while sparse, radio frequency (RF) signals. Working with high frequency signals requires appropriate system-level components such as high-speed analog-to-digital converters (ADC). In particular, an analog signal should be sampled at rates that meet the Nyquist requirements to avoid aliasing. However, implementing high-speed ADC devices can be a limiting factor as well as expensive. To mitigate the caveats with high-speed ADC, the solution space can be explored in several dimensions such as utilizing the compressive sensing (CS) framework in order to reduce the sampling rate to the order of information rate of the signal rather than a rate dictated by the Nyquist. In this note, we review the compressive sensing structure and its extensions for continuous-time signals, which is ultimately used to reduce the sampling rate of high-speed ADC devices. Moreover, we consider the application of the compressive sensing framework in wireless sensor networks to save power by reducing the transmission rate of sensor nodes. We propose an alternative solution for the CS minimization problem that can be solved using gradient descent methods. The modified minimization problem is potentially faster and simpler to implement at the hardware level.
 Physics , 2014, Abstract: Recent results from compressive sampling (CS) have demonstrated that accurate reconstruction of sparse signals often requires far fewer samples than suggested by the classical Nyquist--Shannon sampling theorem. Typically, signal reconstruction errors are measured in the $\ell^2$ norm and the signal is assumed to be sparse, compressible or having a prior distribution. Our spectrum estimation by sparse optimization (SpESO) method uses prior information about isotropic homogeneous turbulent flows with power law energy spectra and applies the methods of CS to 1-D and 2-D turbulence signals to estimate their energy spectra with small logarithmic errors. SpESO is distinct from existing energy spectrum estimation methods which are based on sparse support of the signal in Fourier space. SpESO approximates energy spectra with an order of magnitude fewer samples than needed with Shannon sampling. Our results demonstrate that SpESO performs much better than lumped orthogonal matching pursuit (LOMP), and as well or better than wavelet-based best M-term or M/2-term methods, even though these methods require complete sampling of the signal before compression.
 Page 1 /100 Display every page 5 10 20 Item