The paper analyses the possibility to recover different biomedical signals if limited number of samples is available. Having in mind that monitoring of health condition is done by measuring and observing key parameters such as heart activity through electrocardiogram or anatomy and body processes through magnetic resonance imaging, it is important to keep the quality of the reconstructed signal as better as possible. To recover the signal from limited set of available coefficients, the Compressive Sensing approach and optimization algorithms are used. The theory is verified by the experimental results.
The characterization of multicomponent signals with a particular emphasis on musical and communication signals is one of the problems studied in the dissertation. In order to provide an efficient analysis of the multicomponent signals, the possibility to separate signal components is observed. The procedure for decomposition and classification of the signal components whose energy and physical characteristics differ in the time-frequency domain is proposed in this work. A special focus in the dissertation is on the application of the compressive sensing approach in multicomponent signals. The …
In this paper, the instantaneous frequency estimation of nonstationary signals is considered. The instantaneous frequency is estimated from the timefrequency representation where certain percent of the coefficients is missing. The time-frequency representation is considered as an image, whose missing pixels are reconstructed by using compressive sensing recovery algorithms. As a time-frequency representation, the S-method is considered. The Compressive Sensing as a intensively growing novel approach for signal acquisition, ensures accurate signal reconstruction from relatively small percent of…
As the Internet of Things (IoT) technology is being deployed, the demand for radio spectrum is increasing. Cognitive radio (CR) is one of the most promising solutions to allow opportunistic spectrum access for IoT secondary users through utilizing spectrum holes resulting from the underutilization of frequency spectrum. A CR needs to frequently sense the spectrum to avoid interference with primary users (PUs). Compressive spectrum sensing techniques have been gaining increasing interest in wideband spectrum sensing, as they reduce the need for high-rate analog-to-digital converters, reducing t…
Existing three-dimensional (3-D) compressive sensing-based millimeter-wave (MMW) imaging methods require a large-scale storage of the sensing matrix and immense computations owing to the high dimension matrix-vector model employed in the optimization. To overcome this shortcoming, we propose an efficient compressive sensing (CS) method based on a holographic algorithm for near-field 3-D MMW imaging. An interpolation-free holographic imaging algorithm is developed and used as a sensing operator, in lieu of the nominal sensing matrix typically used in the CS iterative optimization procedure. In …
For wideband spectrum sensing, compressive sensing has been proposed as a solution to speed up the high dimensional signals sensing and reduce the computational complexity. Compressive sensing consists of acquiring the essential information from a sparse signal and recovering it at the receiver based on an efficient sampling matrix and a reconstruction technique. In order to deal with the uncertainty, improve the signal acquisition performance, and reduce the randomness during the sensing and reconstruction processes, compressive sensing requires a robust sampling matrix and an efficient recon…
Jacobs University Bremen（不来梅雅各布大学）；Katholische Universität Eichstätt-Ingolstadt（艾希施泰特-因戈尔施塔特天主教大学）
We present a Compressive Sensing algorithm for reconstructing binary signals from its linear measurements. The proposed algorithm minimizes a non-convex cost function expressed as a weighted sum of smoothed $\ell_0$ norms which takes into account the binariness of signals. We show that for binary signals the proposed algorithm outperforms other existing algorithms in recovery rate while requiring a short run time.
This paper considers the problem of estimating the sparse mmWave massive multiple input - multiple output (MIMO) OFDM channel from one-bit quantized measurements. Unlike previous grid-based one-bit compressive sensing approaches, we present a gridless convex method to recover sparse channel form one-bit measurements via Binary Atomic Norm Minimization (BiANM) and Reweighted Binary Atomic Norm Minimization (ReBiANM). Simulation results verify the accuracy of the binary and reweighted binary atomic norm minimization techniques.
It is well established in the compressive sensing (CS) literature that sensing matrices whose elements are drawn from independent random distributions exhibit enhanced reconstruction capabilities. In many CS applications, such as electromagnetic imaging, practical limitations on the measurement system prevent one from generating sensing matrices in this fashion. Although one can usually randomized the measurements to some degree, these sensing matrices do not achieve the same reconstruction performance as the truly randomized sensing matrices. In this paper, we present a novel method, based up…
Compressive sensing (CS) has recently emerged as an extremely efficient technology of the wideband spectrum sensing. In compressive spectrum sensing (CSS), it is necessary to know the sparsity or the noise information in advance for reliable reconstruction. However, such information is usually absent in practical applications. In this paper, we propose a blind-block orthogonal least squares-based compressive spectrum sensing (B-BOLS-CSS) algorithm, which utilizes a novel blind stopping rule to cut the cords to these prior information. Specifically, we first present both the noiseless and noisy…
In this paper, a cooperative spectrum sensing scheme based on compressive sensing is proposed. In this scheme, secondary users (SUs) are organized in clusters. In each cluster, SUs forward their compressed signals to the cluster head. Then, the cluster heads report the local sensing data to the fusion center to make the final decision. Analog to information converter is adopted to acquire the received SUs signals. The proposed scheme is evaluated using several metrics, including probability of detection, compression ratio, probability of error, and processing time. The simulation results are c…
In this paper, deterministic construction of measurement matrices in Compressive Sensing (CS) is considered. First, by employing the column replacement concept, a theorem for construction of large minimum distance linear codes containing all-one codewords is proposed. Then, by applying an existing theorem over these linear codes, deterministic sensing matrices are constructed. To evaluate this procedure, two examples of constructed sensing matrices are presented. The first example contains a matrix of size ${{p}^{2}}\times {{p}^{3}}$ and coherence ${1}/{p}\;$, and the second one comprises a ma…
Spectrum sensing is an important process in cognitive radio. A number of sensing techniques that have been proposed suffer from high processing time, hardware cost and computational complexity. To address these problems, compressive sensing has been proposed to decrease the processing time and expedite the scanning process of the radio spectrum. Selection of a suitable sparse recovery algorithm is necessary to achieve this goal. A number of sparse recovery algorithms have been proposed. This paper surveys the sparse recovery algorithms, classify them into categories, and compares their perform…
Sungkyunkwan University（成均馆大学）；College of Information and Communication Engineering, Sungkyunkwan University（成均馆大学信息与通信工程学院）；Institute for Datability Science, Osaka University（大阪大学数据科学研究所）
Compressive sensing (CS) is well-known for its unique functionalities of sensing, compressing, and security (i.e. CS measurements are equally important). However, there is a tradeoff. Improving sensing and compressing efficiency with prior signal information tends to favor particular measurements, thus decrease the security. This work aimed to improve the sensing and compressing efficiency without compromise the security with a novel sampling matrix, named Restricted Structural Random Matrix (RSRM). RSRM unified the advantages of frame-based and block-based sensing together with the global smo…
This article introduces a novel paradigm for the unsourced multiple-access communication problem. This divide-and-conquer approach leverages recent advances in compressive sensing and forward error correction to produce a computationally efficient algorithm. Within the proposed framework, every active device first partitions its data into several sub-blocks, and subsequently adds redundancy using a systematic linear block code. Compressive sensing techniques are then employed to recover sub-blocks, and the original messages are obtained by connecting pieces together using a low-complexity tree…
A Compressive Sensing (CS) approach is applied to utilize intrinsic computation capabilities of Spin-Orbit Torque Magnetic Random Access Memory (SOT-MRAM) devices for IoT applications wherein lifetime energy, device area, and manufacturing costs are highly-constrained while the sensing environment varies rapidly. In this manuscript, we propose the Adaptive Compressed-sampling via Multibit Crossbar Array (ACMCA) approach to intelligently generate the CS measurement matrix using a multibit SOT-MRAM crossbar array. SPICE circuit and MATLAB algorithm simulation results indicate that ACMCA reduces …
This work focuses on the reconstruction of sparse signals from their 1-bit measurements. The context is the one of 1-bit compressive sensing where the measurements amount to quantizing (dithered) random projections. Our main contribution shows that, in addition to the measurement process, we can additionally reconstruct the signal with a binarization of the sensing matrix. This binary representation of both the measurements and sensing matrix can dramatically simplify the hardware architecture on embedded systems, enabling cheaper and more power efficient alternatives. Within this framework, g…
New constraints based on practical hardware are introduced in compressive sensing (CS) based rectangular antenna array thinning technique. In a standard CS array sparsity enforcement, antenna elements are considered as ideal point sources which do not comply with the practical hardware. It also does not consider the impact of mutual coupling of neighbouring antenna elements on the impedance mismatch. In this work, we propose a combination of constraints based on physical antenna array specifications, mutual coupling and practical antenna element radiation performance in the CS-based array thin…
Technion - Israel Institute of Technology（以色列理工学院）；The Chinese University of Hong Kong（香港中文大学）；Johns Hopkins University（约翰斯·霍普金斯大学）；Colorado School of Mines（科罗拉多矿业学院）
We consider designing a robust structured sparse sensing matrix consisting of a sparse matrix with a few non-zero entries per row and a dense base matrix for capturing signals efficiently We design the robust structured sparse sensing matrix through minimizing the distance between the Gram matrix of the equivalent dictionary and the target Gram of matrix holding small mutual coherence. Moreover, a regularization is added to enforce the robustness of the optimized structured sparse sensing matrix to the sparse representation error (SRE) of signals of interests. An alternating minimization algor…
A photonic integrated circuit comprised of an 11 cm multimode speckle waveguide, a 1x32 splitter, and a linear grating coupler array is fabricated and utilized to receive 2 GHz of RF signal bandwidth from 2.5 to 4.5 GHz using a 35 MHz mode locked laser.
The neighbor discovery paradigm finds wide application in Internet of Things networks, where the number of active devices is orders of magnitude smaller than the total device population. Designing low-complexity schemes for asynchronous neighbor discovery has recently gained significant attention from the research community. Concurrently, a divide-and-conquer framework, referred to as coupled compressive sensing, has been introduced for the synchronous massive random access channel. This work adapts this novel algorithm to the problem of asynchronous neighbor discovery with unknown transmissio…
Compressive sensing has been receiving a great deal of interest from researchers in many areas because of its ability in speeding up data acquisition. This framework allows fast signal acquisition and compression when signals are sparse in some domains. It extracts the main information from high dimensional sparse signals using only a few samples, then the sparse signals are recovered from the few measurements. There are two main points to consider when it comes to using compressive sensing. The first one is how to design the linear measurement matrix to ensure that the compressive sensing is …
University of Maryland, Baltimore County（马里兰大学巴尔的摩县分校）
We leverage the idea of a statistical ensemble to improve the quality of quantum annealing based binary compressive sensing. Since executing quantum machine instructions on a quantum annealer can result in an excited state, rather than the ground state of the given Hamiltonian, we use different penalty parameters to generate multiple distinct quadratic unconstrained binary optimization (QUBO) functions whose ground state(s) represent a potential solution of the original problem. We then employ the attained samples from minimizing all corresponding (different) QUBOs to estimate the solution of …
In this paper, we prove a compressive sensing guarantee for restricted measurement domains on the rotation group, $\mathrm{SO}(3)$. We do so by first defining Slepian functions on a measurement sub-domain $R$ of the rotation group $\mathrm{SO}(3)$. Then, we transform the inverse problem from the measurement basis, the bounded orthonormal system of band-limited Wigner $D$-functions on $\mathrm{SO}(3)$, to the Slepian functions in a way that limits increases to signal sparsity. Contrasting methods using Wigner $D$-functions that require measurements on all of $\mathrm{SO}(3)$, we show that the o…
In colocated compressive sensing MIMO radar, the measurement matrix is specified by antenna placement. To guarantee an acceptable recovery performance, this measurement matrix should satisfy certain properties, e.g., a small coherence. Prior work in the literature often employs randomized placement algorithms which optimize the prior distribution of antenna locations. The performance of these algorithms is suboptimal, as they can be easily enhanced via expurgation. In this paper, we suggest an iterative antenna placement algorithm which determines the antenna locations deterministically. The p…
Reconfigurable intelligent surface (RIS) has been recognized as a potential technology for 5G beyond and attracted tremendous research attention. However, channel estimation in RIS-aided system is still a critical challenge due to the excessive amount of parameters in cascaded channel. The existing compressive sensing (CS)-based RIS estimation schemes only adopt incomplete sparsity, which induces redundant pilot consumption. In this paper, we exploit the specific triple-structured sparsity of the cascaded channel, i.e., the common column sparsity, structured row sparsity after offset compensat…
