جستجوی مقالات مرتبط با کلیدواژه « Compressive Sensing » در نشریات گروه « برق »

Special conditions of wireless sensor networks, such as energy limitation, make it essential to accelerate the convergence of algorithms in this field, especially in the distributed compressive sensing (DCS) scenarios, which have a complex reconstruction phase. This paper presents a DCS reconstruction algorithm that provides a higher convergence rate. The proposed algorithm is a distributed primal-dual algorithm in a bidirectional incremental cooperation mode where the parameters change with time. The parameters are changed systematically in the convex optimization problems in which the constraint and cooperation functions are strongly convex. The proposed method is supported by simulations, which show the higher performance of the proposed algorithm in terms of convergence rate, even in stricter conditions such as the small number of measurements or the lower degree of sparsity.

To overcome the problem of channel estimation in massive multiple-input multiple-output (M-MIMO) systems, in this paper we propose a downlink link channel estimation scheme in frequency-division duplex (FDD) based on structured compressive sensing to reduce the pilot required by which Intrinsic spatial sparsity of M-MIMO delay channels are amplified. For this purpose, first, after discussing the different methods of channel estimation and examining the existing challenges, we define our roadmap and propose our algorithm, in which we estimate the channel based on the greedy orthogonal matching pursuit (OMP) algorithm. In this algorithm, spatial correlation between the channel impulse response of different transmitter antennas is used for accurate channel estimation. This algorithm obtains the channel sparsity in an adaptive way, which negates the ideal assumption of the previous works that the channel sparsity is in hand. In this case, this algorithm estimates the channel with good accuracy in cases when the exact amount of channel sparsity is not known. Finally, we present simulations that demonstrate the ability of this method to reduce the required pilot. The simulations show that the proposed channel estimation reliably obtains the channel sparsity level and the support set compared to similar methods.

Special conditions of wireless sensor networks, such as energy limitation, make it essential to accelerate the convergence of algorithms in this field, especially in the distributed compressive sensing (DCS) scenarios, which have a complex reconstruction phase. This paper presents a DCS reconstruction algorithm that provides a higher convergence rate. The proposed algorithm is a distributed primal-dual algorithm in a bidirectional incremental cooperation mode where the parameters change with time. The parameters are changed systematically in the convex optimization problems in which the constraint and cooperation functions are strongly convex. The proposed method is supported by simulations, which show the higher performance of the proposed algorithm in terms of convergence rate, even in stricter conditions such as the small number of measurements or the lower degree of sparsity.

Nowadays, wireless sensor networks (WSNs) have found many applications in a variety of topics. The main purpose of these networks is to measure environmental phenomena and to send read data in multi-hop paths to the sink to be exploited by users. The most important challenge in WSNs is to minimize energy consumption in sensor batteries and increase network lifetime. One of the most important techniques for reducing energy consumption in WSNs is the compressive sensing (CS) technique. CS reduces network energy consumption by reducing data transmission in the network and increasing the network lifetime. The use of CS technique in a WSN results in the production of different models of CS signals. These models are based on spatial, temporal and spatio-temporal sensors readings. On the other hand, in order to overcome the challenge of energy consumption, the exact recognition of energy resources in the network is essential.  Energy consumption in a sensor node can be divided into two parts: (a) the energy used for computing; and (b) the energy consumed by the communication. The energy used for the computing consists of three components: 1. sensor energy consumption (data reading), 2. background energy consumption, and 3. energy consumption for processing. The power consumption of the communication includes the following: 1. energy consumption for data transmission; 2. energy consumption for data receiving; 3. energy consumption for sending messages; and 4. energy consumption for receiving messages. Hence, the existence of a model for analyzing energy consumption in a CS-based WSN is necessary. Several models have been developed to analyze energy consumption in a WSN, but there is not a complete model for analyzing energy consumption in a CS-based WSN.  In this paper, we study all energy consumption components mentioned above in a CS-based WSN and present a complete model for energy consumption analysis. This model can optimize the design of CS-based WSNs energy efficiency improvement approach. To evaluate the proposed model, we use this model to analyze energy consumption in the compressive data gathering technique which is a CS-based data aggregation method. Using this model can optimize the design of CS-based WSNs.

Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this application must be optimized in terms of energy consumption. In other words, the computational complexity of algorithms must be as low as possible and should require minimal interaction between the sensors. For such networks, CS has been used in data gathering and data persistence scenario, in order to minimize the total number of transmissions and consequently minimize the network energy consumption and to save the storage by distributing the traffic load and storage throughout the network. In these applications, the compression stage of CS is performed in sensor nodes, whereas the recovering duty is done in the fusion center (FC) unit in a centralized manner. In some applications, there is no FC unit and the recovering duty must be performed in sensor nodes in a cooperative and distributed manner which we have focused on in this paper. Indeed, the notable algorithm for this purpose is distributed least absolute shrinkage and selection operation (D-LASSO) algorithm which is based on diffusion cooperation structure. This algorithm that compete to the state-of-the-art CS algorithms has a major disadvantage; it involves matrix inversion that may be computationally demanding for sufficiently large matrices. On this basis, in this paper, we have proposed a distributed CS recovery algorithm for the WSNs with a bi-directional incremental mode of cooperation. Actually, we have proposed a comprehensive distributed framework for the recovery of sparse signals in WSNs.  Here, we applied this comprehensive structure to three problems with different constraints which results in three completely distributed solutions named as distributed bi-directional incremental basis pursuit (DBIBP), distributed bi-directional incremental noise-aware basis pursuit (DBINBP) and distributed bi-directional incremental regularized least squares (DBIRLS). The proposed algorithms solely involve linear combinations of vectors and soft thresholding operations. Hence, the computational load is significantly reduced in each sensor. In the proposed method each iteration consists of two phases; clockwise and anti-clockwise phases. At each iteration, in anti-clockwise phase, each node receives the local estimate from its previous neighbor and updates an auxiliary variable. Then in the clockwise phase, each node receives the updated auxiliary variable from its next neighbors to update the local estimate. On the other hand, information exchange in two directions in an incremental manner which we called it bi-directional incremental structure. In an incremental strategy, information flows in a sequential manner from one node to the adjacent node. Unlike the diffusion structure (like as D-LASSO) where each node communicates with all of their neighbors, the incremental mode of cooperation requires the least amount of communication and power. The low computational complexity and better steady state performance are the important features of the proposed methods.

In this review article, we aim to describe recent advances in compressive sensing-based data aggregation techniques in wireless sensor networks, including current research efforts, challenges, and research trends. Sparse and compressible signals are present in many applications of sensor networks, such as environmental monitoring and vehicle surveillance. Compressive sensing has many properties such as simplicity of sensing and compression operations, universality, and an acceptable decrease in the quality of signal reconstruction, which makes it attractive for use in sensor networks. Packet drops do not damage the network as much as other protocols, and only for each measurement that does not reach the sink will cause a slight decrease in the quality of signal reconstruction. We begin the discussion with a brief introduction to compressive sensing theory and then describe the use of this technique in wireless sensor networks. Finally, the research issues and challenges ahead are discussed to provide a perspective for future research

one of the most prevalent causes for mortality of infants is cardiac failure. Recordings of heart electrical activities by Electrocardiogram (ECG) are a safe method to detect abnormal arrhythmia in time and reduce cardiac failure in newborns. However, the non-invasive extraction of fetal ECG (fECG) from the maternal abdominal is quite challenging, since the fECG signals are often corrupted by some electrical noises from other sources such as: maternal heart activity, uterine contractions, and respiration, in addition to instrumental noises. Among such signals, the maternal heart signal (due to high amplitude) has the most disruptive effect and the fetal brain signal (due to low amplitude) has the least effect on distortion of the fetal heart signal. In this paper, a new method for extracting fECG signals from multichannel abdominal recordings is proposed. The proposed method uses Compressive Sensing (CS)to reduce the computational complexity and fast Independent Component Analysis (fICA) algorithm to estimate the sources. Also, for finding sparse representations of the acquired ECG signals, two dictionaries namely: discrete cosine transformation and discrete wavelet transform are deployed here. The proposed method is then implemented and its performance is tested using the well-known and publicly available database used in 2013 Physionet Challenge. The performance results are compared with that of the best performing existing methods. The results show that the proposed method based on CS and ICA outperforms the existing detection methods with a Mean Minimum Square Error (MMSE) of 171.65, and therefore can be used for non-invasive and reliable extraction fECG from abdominal recordings.

In this paper, a new method is proposed to estimate the direction of arrival (DOA) using non-uniform linear array structure and modeling the measurement matrix as a DFT matrix. In order to estimate the DOA using compressive sensing (CS), continuous angle space should be divided into a discrete set using small steps. This division, leads to the increment of mutual coherence between columns of the measurement matrix and performance of the sparse recovery algorithms is degraded. To solve this problem, we propose a new method in which DFT matrix with mutual coherence of zero is used as the measurement matrix. In order to increase the accuracy of estimation, the size of DFT matrix or the number of antennas should be increased. Implementation of an array with large number of antennas is complex and expensive. A solution to decrease the number of antennas is using a non-uniform linear array and constructing a virtual uniform linear array. A virtual uniform linear array can be constructed by vectorizing the correlation matrix of the received signal of a non-uniform linear array. Increasing the number of antennas in the virtual array will increase the size of DFT matrix. Therefore, the accuracy of DOA estimation will be increased. Simulation results show that DOA estimation using compressive sensing, based on DFT measurement matrix, has a good performance in terms of mean square error of estimation.