PyTorchKR Papers

최신 논문

총 549편
태그·기간 등 상세 필터

카테고리 탐색

로그인 후 이 태그 구독

arXiv:1904.12272

A Block Sparsity Based Estimator for mmWave Massive MIMO Channels with Beam Squint

Multiple-input multiple-output (MIMO) millimeter wave (mmWave) communication is a key technology for next generation wireless networks. One of the consequences of utilizing a large number of antennas with an increased bandwidth is that array steering vectors vary among different subcarriers. Due to this effect, known as beam squint, the conventional channel model is no longer applicable for mmWave massive MIMO systems. In this paper, we study channel estimation under the resulting non-standard model. To that aim, we first analyze the beam squint effect from an array signal processing perspective, resulting in a model which sheds light on the angle-delay sparsity of mmWave transmission. We next design a compressive sensing based channel estimation algorithm which utilizes the shift-invariant block-sparsity of this channel model. The proposed algorithm jointly computes the off-grid angles, the off-grid delays, and the complex gains of the multi-path channel. We show that the newly proposed scheme reflects the mmWave channel more accurately and results in improved performance compared to traditional approaches. We then demonstrate how this approach can be applied to recover both the uplink as well as the downlink channel in frequency division duplex (FDD) systems, by exploiting the angle-delay reciprocity of mmWave channels.

arXiv:1903.08938

Algebraic Channel Estimation Algorithms for FDD Massive MIMO systems

We consider downlink (DL) channel estimation for frequency division duplex based massive MIMO systems under the multipath model. Our goal is to provide fast and accurate channel estimation from a small amount of DL training overhead. Prior art tackles this problem using compressive sensing or classic array processing techniques (e.g., ESPRIT and MUSIC). However, these methods have challenges in some scenarios, e.g., when the number of paths is greater than the number of receive antennas. Tensor factorization methods can also be used to handle such challenging cases, but it is hard to solve the associated optimization problems. In this work, we propose an efficient channel estimation framework to circumvent such difficulties. Specifically, a structural training sequence that imposes a tensor structure on the received signal is proposed. We show that with such a training sequence, the parameters of DL MIMO channels can be provably identified even when the number of paths largely exceeds the number of receive antennas---under very small training overhead. Our approach is a judicious combination of Vandermonde tensor algebra and a carefully designed conjugate-invariant training sequence. Unlike existing tensor-based channel estimation methods that involve hard optimization problems, the proposed approach consists of very lightweight algebraic operations, and thus real-time implementation is within reach. Simulation results are carried out to showcase the effectiveness of the proposed methods.

arXiv:1902.06297

Spatial Channel Covariance Estimation for Hybrid Architectures Based on Tensor Decompositions

Spatial channel covariance information can replace full instantaneous channel state information for the analog precoder design in hybrid analog/digital architectures. Obtaining spatial channel covariance estimation, however, is challenging in the hybrid structure due to the use of fewer radio frequency (RF) chains than the number of antennas. In this paper, we propose a spatial channel covariance estimation method based on higher-order tensor decomposition for spatially sparse time-varying frequency-selective channels. The proposed method leverages the fact that the channel can be represented as a low-rank higher-order tensor. We also derive the Cram\'er-Rao lower bound on the estimation accuracy of the proposed method. Numerical results and theoretical analysis show that the proposed tensor-based approach achieves higher estimation accuracy in comparison with prior compressive-sensing-based approaches or conventional angle-of-arrival estimation approaches. Simulation results reveal that the proposed approach becomes more beneficial at low signal-to-noise (SNR) region.

arXiv:1902.00061

Image Reconstruction from Undersampled Confocal Microscopy Data using Multiresolution Based Maximum Entropy Regularization

We consider the problem of reconstructing 2D images from randomly under-sampled confocal microscopy samples. The well known and widely celebrated total variation regularization, which is the L1 norm of derivatives, turns out to be unsuitable for this problem; it is unable to handle both noise and under-sampling together. This issue is linked with the notion of phase transition phenomenon observed in compressive sensing research, which is essentially the break-down of total variation methods, when sampling density gets lower than certain threshold. The severity of this breakdown is determined by the so-called mutual incoherence between the derivative operators and measurement operator. In our problem, the mutual incoherence is low, and hence the total variation regularization gives serious artifacts in the presence of noise even when the sampling density is not very low. There has been very few attempts in developing regularization methods that perform better than total variation regularization for this problem. We develop a multi-resolution based regularization method that is adaptive to image structure. In our approach, the desired reconstruction is formulated as a series of coarse-to-fine multi-resolution reconstructions; for reconstruction at each level, the regularization is constructed to be adaptive to the image structure, where the information for adaption is obtained from the reconstruction obtained at coarser resolution level. This adaptation is achieved by using maximum entropy principle, where the required adaptive regularization is determined as the maximizer of entropy subject to the information extracted from the coarse reconstruction as constraints. We demonstrate the superiority of the proposed regularization method over existing ones using several reconstruction examples.

arXiv:1901.03565

Biomedical Image Reconstruction: From the Foundations to Deep Neural Networks

This tutorial covers biomedical image reconstruction, from the foundational concepts of system modeling and direct reconstruction to modern sparsity and learning-based approaches. Imaging is a critical tool in biological research and medicine, and most imaging systems necessarily use an image-reconstruction algorithm to create an image; the design of these algorithms has been a topic of research since at least the 1960's. In the last few years, machine learning-based approaches have shown impressive performance on image reconstruction problems, triggering a wave of enthusiasm and creativity around the paradigm of learning. Our goal is to unify this body of research, identifying common principles and reusable building blocks across decades and among diverse imaging modalities. We first describe system modeling, emphasizing how a few building blocks can be used to describe a broad range of imaging modalities. We then discuss reconstruction algorithms, grouping them into three broad generations. The first are the classical direct methods, including Tikhonov regularization; the second are the variational methods based on sparsity and the theory of compressive sensing; and the third are the learning-based (also called data-driven) methods, especially those using deep convolutional neural networks. There are strong links between these generations: classical (first-generation) methods appear as modules inside the latter two, and the former two are used to inspire new designs for learning-based (third-generation) methods. As a result, a solid understanding of all of three generations is necessary for the design of state-of-the-art algorithms.

arXiv:1901.01758

New ECCM Techniques Against Noise-like and/or Coherent Interferers

Multiple-stage adaptive architectures are conceived to face with the problem of target detection buried in noise, clutter, and intentional interference. First, a scenario where the radar system is under the electronic attack of noise-like interferers is considered. In this context, two sets of training samples are jointly exploited to devise a novel two-step estimation procedure of the interference covariance matrix. Then, this estimate is plugged in the adaptive matched filter to mitigate the deleterious effects of the noise-like jammers on radar sensitivity. Besides, a second scenario, which also includes the presence of coherent jammers, is addressed. Specifically, the sparse nature of data is brought to light and the compressive sensing paradigm is applied to estimate target response and coherent jammers amplitudes. The likelihood ratio test, where the unknown parameters are replaced by previous estimates, is designed and assessed. Remarkably, the sparse approach allows for echo classification and estimation of both angles of arrival and number of the interfering sources. The performance analysis, conducted resorting to simulated data, highlights the effectiveness of the newly proposed architectures also in comparison with suitable competing architectures (when they exist).

arXiv:1811.11575

Quantity over Quality: Dithered Quantization for Compressive Radar Systems

In this paper, we investigate a trade-off between the number of radar observations (or measurements) and their resolution in the context of radar range estimation. To this end, we introduce a novel estimation scheme that can deal with strongly quantized received signals, going as low as 1-bit per signal sample. We leverage for this a dithered quantized compressive sensing framework that can be applied to classic radar processing and hardware. This allows us to remove ambiguous scenarios prohibiting correct range estimation from (undithered) quantized base-band radar signal. Two range estimation algorithms are studied: Projected Back Projection (PBP) and Quantized Iterative Hard Thresholding (QIHT). The effectiveness of the reconstruction methods combined with the dithering strategy is shown through Monte Carlo simulations. Furthermore we show that: (i), in dithered quantization, the accuracy of target range estimation improves when the bit-rate (i.e., the total number of measured bits) increases, whereas the accuracy of other undithered schemes saturate in this case; and (ii), for fixed, low bit-rate scenarios, severely quantized dithered schemes exhibit better performances than their full resolution counterparts. These observations are confirmed using real measurements obtained in a controlled environment, demonstrating the feasibility of the method in real ranging applications.

arXiv:1811.04347

Compressive Sensing and Morphology Singular Entropy-Based Real-time Secondary Voltage Control of Multi-area Power Systems

This paper presents an improved secondary voltage control (SVC) methodology incorporating compressive sensing (CS) for a multi-area power system. SVC minimizes the voltage deviation of the load buses while CS deals with the problem of the limited bandwidth capacity of the communication channel by reducing the size of massive data output from phasor measurement unit (PMU) based monitoring system. The proposed strategy further incorporates the application of a Morphological Median Filter (MMF) to reduce noise from the output of the PMUs. To keep the control area secure and protected locally, Mathematical Singular Entropy (MSE) based fault identification approach is utilized for fast discovery of faults in the control area. Simulation results with 27-bus and 486-bus power systems show that CS can reduce the data size up to 1/10th while the MSE based fault identification technique can accurately distinguish between fault and steady state conditions.

arXiv:1811.01720

Capture and Recovery of Connected Vehicle Data: A Compressive Sensing Approach

Connected vehicles (CVs) can capture and transmit detailed data through vehicle-to-vehicle and vehicle-to-infrastructure communications, which bring new opportunities to improve the safety, mobility, and sustainability of transportation systems. However, the potential data explosion is likely to over-burden storage and communication systems. We design a compressive sensing (CS) approach which allows CVs to capture and compress data in real-time and later recover the original data accurately and efficiently. We have evaluated our approach using two case studies. In the first case study, the CS approach is applied to re-capture 10 million CV Basic Safety Message (BSM) speed samples from the Safety Pilot Model Deployment program. The recovery performances of our approach regarding several BSM variables are explored in detail. In the second case study, a freeway traffic simulation model is built to evaluate the impact of our approach on travel time estimation. Multiple scenarios with various CV market penetration rates, On-board Unit (OBU) capacities, compression ratios, arrival rate patterns, and data capture rates are simulated. The results show the potential of saving large amounts of OBU hardware cost. Furthermore, our approach can greatly improve the accuracy of travel time estimation when CVs are in traffic congestion.

arXiv:1810.10871

Snapshot fiber spectral imaging using speckle correlations and compressive sensing

Snapshot spectral imaging is rapidly gaining interest for remote sensing applications. Acquiring spatial and spectral data within one image promotes fast measurement times, and reduces the need for stabilized scanning imaging systems. Many current snapshot technologies, which rely on gratings or prisms to characterize wavelength information, are difficult to reduce in size for portable hyperspectral imaging. Here, we show that a multicore multimode fiber can be used as a compact spectral imager with sub-nanometer resolution, by encoding spectral information within a monochrome CMOS camera. We characterize wavelength-dependent speckle patterns for up to 3000 fiber cores over a broad wavelength range. A clustering algorithm is employed in combination with l$_{1}$-minimization to limit data collection at the acquisition stage for the reconstruction of spectral images that are sparse in the wavelength domain. We also show that in the non-compressive regime these techniques are able to accurately reconstruct broadband information.

arXiv:1810.05422

A Survey: Non-Orthogonal Multiple Access with Compressed Sensing Multiuser Detection for mMTC

One objective of the 5G communication system and beyond is to support massive machine type of communication (mMTC) to propel the fast growth of diverse Internet of Things use cases. The mMTC aims to provide connectivity to tens of billions sensor nodes. The dramatic increase of sensor devices and massive connectivity impose critical challenges for the network to handle the enormous control signaling overhead with limited radio resource. Non-Orthogonal Multiple Access (NOMA) is a new paradigm shift in the design of multiple user detection and multiple access. NOMA with compressive sensing based multiuser detection is one of the promising candidates to address the challenges of mMTC. The survey article aims at providing an overview of the current state-of-art research work in various compressive sensing based techniques that enable NOMA. We present characteristics of different algorithms and compare their pros and cons, thereby provide useful insights for researchers to make further contributions in NOMA using compressive sensing techniques.

arXiv:1809.09219

Fast Signal Recovery from Saturated Measurements by Linear Loss and Nonconvex Penalties

Sign information is the key to overcoming the inevitable saturation error in compressive sensing systems, which causes information loss and results in bias. For sparse signal recovery from saturation, we propose to use a linear loss to improve the effectiveness from existing methods that utilize hard constraints/hinge loss for sign consistency. Due to the use of linear loss, an analytical solution in the update progress is obtained, and some nonconvex penalties are applicable, e.g., the minimax concave penalty, the $\ell_0$ norm, and the sorted $\ell_1$ norm. Theoretical analysis reveals that the estimation error can still be bounded. Generally, with linear loss and nonconvex penalties, the recovery performance is significantly improved, and the computational time is largely saved, which is verified by the numerical experiments.

arXiv:1808.06540

Experimental Results of a 3D Millimeter-Wave Compressive-Reflector-Antenna Imaging System

This letter presents the first experimental results of our three-dimensional (3D) millimeter-wave (mm-wave) Compressive-Reflector-Antenna (CRA) imaging system. In this prototype, the CRA is 3D-printed and coated with a metallic spray to easily introduce pseudo-random scatterers on the surface of a traditional reflector antenna (TRA). The CRA performs a pseudo random coding of the incident wavefront, thus adding spatial diversity in the imaging region and enabling the effective use of compressive sensing (CS) and imaging techniques. The CRA is fed with a multiple-input-multiple-output (MIMO) radar, which consists of four transmitting and four receiving ports. Consequently, the mechanical scanning parts and phase shifters, which are necessary in conventional physical or synthetic aperture arrays, are not needed in this system. Experimental results show the effectiveness of the prototype to perform a successful 3D reconstruction of a T-shaped metallic target.

arXiv:1808.06530

Comparative Study on Millimeter Wave Location-Based Beamforming

This paper presents a comparative study on millimeter wave (mmWave) location-based analog beamforming (BF) techniques based on channel estimation. Localization and compressive sensing (CS) effectively reduces mmWave BF complexity and enhance the performance of mmWave system comparable to the conventional mmWave analog BF techniques. BF techniques based on channel state information (CSI) has high complexity in constructing mmWave channel sensing matrix using CS. Location services based techniques highly reduce this complexity by defining the area within which the user equipment (UE) mostly probable to be exist. In this paper, we study the performance of mmWave location-based BF using various location services. Where, the BF is conducted using channel estimation based CS to estimate both the angle of departures (AoDs) and the angle of arrivals (AoAs) of the mmWave channel.

arXiv:1805.03973

Active User Detection of Uplink Grant-Free SCMA in Frequency Selective Channel

Massive machine type communication (mMTC) is one of the three fifth generation mobile networking (5G) key usage scenarios, which is characterized by a very large number of connected devices typically transmitting a relatively low volume of non-delay sensitive data. To support the mMTC communication, an uplink (UL) grant-free sparse code multiple access (SCMA) system has been proposed. In this system, the knowledge of user equipments' (UEs') status should be obtained before decoding the data by a message passing algorithm (MPA). An existing solution is to use the compressive sensing (CS) theory to detect active UEs under the assumed condition of flat fading channel. But the assumed condition is not suitable for the frequency selective channel and will decrease the accuracy of active UEs detection. This paper proposes a new simple module named refined active UE detector (RAUD), which is based on frequency selective channel gain analyzing. By making full use of the channel gain and analyzing the difference between characteristic values of the two status of UEs, RAUD module can enhance the active UEs detection accuracy. Meanwhile, the addition of the proposed module has a negligible effect on the complexity of UL grant-free SCMA receiver.

arXiv:1804.10683

Compressive Sensing Imaging of 3-D Object by a Holographic Algorithm

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 so doing, the problem induced by the large-scale sensing matrix is avoided. With no interpolations required, both the computational speed and the image quality can be improved. Simulation and experimental results are provided to demonstrate the performance of the proposed method in comparison with those of the Omega-K based CS and the traditional Fourier-based imaging techniques.

arXiv:1803.08184

Generalized Optimization of High Capacity Compressive Imaging Systems

One of the greatest challenges in applying compressive sensing (CS) signal processing techniques to electromagnetic imaging applications is designing a sensing matrix that has good reconstruction capabilities. Compressive reflector antennas (CRA) are a class of antennas that have been shown to provide enhanced image reconstruction performance over traditional reflector antennas (TRA) when CS techniques are employed. In this paper, we present a unified CRA design method, which considers both the sensing capacity and efficiency of the antenna, and can be used for both compressive imaging and multiple-input multiple-output (MIMO) communication applications. The unified design method is assessed for a CRA configuration in which dielectric scatterers are added to the surface of a TRA. The design results demonstrate the ability of the unified design method to enhance the CS reconstruction capabilities of the CRA.

arXiv:1803.01729

Frequency-modulated continuous-wave LiDAR compressive depth-mapping

We present an inexpensive architecture for converting a frequency-modulated continuous-wave LiDAR system into a compressive-sensing based depth-mapping camera. Instead of raster scanning to obtain depth-maps, compressive sensing is used to significantly reduce the number of measurements. Ideally, our approach requires two difference detectors. % but can operate with only one at the cost of doubling the number of measurments. Due to the large flux entering the detectors, the signal amplification from heterodyne detection, and the effects of background subtraction from compressive sensing, the system can obtain higher signal-to-noise ratios over detector-array based schemes while scanning a scene faster than is possible through raster-scanning. %Moreover, we show how a single total-variation minimization and two fast least-squares minimizations, instead of a single complex nonlinear minimization, can efficiently recover high-resolution depth-maps with minimal computational overhead. Moreover, by efficiently storing only $2m$ data points from $m<n$ measurements of an $n$ pixel scene, we can easily extract depths by solving only two linear equations with efficient convex-optimization methods.

arXiv:1802.07180

Comparison of threshold-based algorithms for sparse signal recovery

Intensively growing approach in signal processing and acquisition, the Compressive Sensing approach, allows sparse signals to be recovered from small number of randomly acquired signal coefficients. This paper analyses some of the commonly used threshold-based algorithms for sparse signal reconstruction. Signals satisfy the conditions required by the Compressive Sensing theory. The Orthogonal Matching Pursuit, Iterative Hard Thresholding and Single Iteration Reconstruction algorithms are observed. Comparison in terms of reconstruction error and execution time is performed within the experimental part of the paper.

arXiv:1802.00337

Biomedical Signals Reconstruction Under the Compressive Sensing Approach

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.