Due to the sparse nature of the impulse radio ultra-wideband(IR-UWB)communication channel in the time domain,compressive sensing(CS)theory is very suitable for the sparse channel estimation. Besides the sparse nature,...Due to the sparse nature of the impulse radio ultra-wideband(IR-UWB)communication channel in the time domain,compressive sensing(CS)theory is very suitable for the sparse channel estimation. Besides the sparse nature,the IR-UWB channel has shown more features which can be taken into account in the channel estimation process,such as the clustering structures. In this paper,by taking advantage of the clustering features of the channel,a novel IR-UWB channel estimation scheme based on the Bayesian compressive sensing(BCS)framework is proposed,in which the sparse degree of the channel impulse response is not required. Extensive simulation results show that the proposed channel estimation scheme has obvious advantages over the traditional scheme,and the final demodulation performance,in terms of Bit Error Rate(BER),is therefore greatly improved.展开更多
Face hallucination or super-resolution is an inverse problem which is underdetermined,and the compressive sensing(CS)theory provides an effective way of seeking inverse problem solutions.In this paper,a novel compress...Face hallucination or super-resolution is an inverse problem which is underdetermined,and the compressive sensing(CS)theory provides an effective way of seeking inverse problem solutions.In this paper,a novel compressive sensing based face hallucination method is presented,which is comprised of three steps:dictionary learning、sparse coding and solving maximum a posteriori(MAP)formulation.In the first step,the K-SVD dictionary learning algorithm is adopted to obtain a dictionary which can sparsely represent high resolution(HR)face image patches.In the second step,we seek the sparsest representation for each low-resolution(LR)face image paches input using the learned dictionary,super resolution image blocks are obtained from the sparsest coefficients and dictionaries,which then are assembled into super-resolution(SR)image.Finally,MAP formulation is introduced to satisfy the consistency restrictive condition and obtain the higher quality HR images.The experimental results demonstrate that our approach can achieve better super-resolution faces compared with other state-of-the-art method.展开更多
In order to reduce the pilot number and improve spectral efficiency, recently emerged compressive sensing （CS） is applied to the digital broadcast channel estimation. According to the six channel profiles of the Eur...In order to reduce the pilot number and improve spectral efficiency, recently emerged compressive sensing （CS） is applied to the digital broadcast channel estimation. According to the six channel profiles of the European Telecommunication Standards Institute（ETSI） digital radio mondiale （DRM） standard, the subspace pursuit （SP） algorithm is employed for delay spread and attenuation estimation of each path in the case where the channel profile is identified and the multipath number is known. The stop condition for SP is that the sparsity of the estimation equals the multipath number. For the case where the multipath number is unknown, the orthogonal matching pursuit （OMP） algorithm is employed for channel estimation, while the stop condition is that the estimation achieves the noise variance. Simulation results show that with the same number of pilots, CS algorithms outperform the traditional cubic-spline-interpolation-based least squares （LS） channel estimation. SP is also demonstrated to be better than OMP when the multipath number is known as a priori.展开更多
A joint two-dimensional(2D)direction-of-arrival(DOA)and radial Doppler frequency estimation method for the L-shaped array is proposed in this paper based on the compressive sensing(CS)framework.Revised from the conven...A joint two-dimensional(2D)direction-of-arrival(DOA)and radial Doppler frequency estimation method for the L-shaped array is proposed in this paper based on the compressive sensing(CS)framework.Revised from the conventional CS-based methods where the joint spatial-temporal parameters are characterized in one large scale matrix,three smaller scale matrices with independent azimuth,elevation and Doppler frequency are introduced adopting a separable observation model.Afterwards,the estimation is achieved by L1-norm minimization and the Bayesian CS algorithm.In addition,under the L-shaped array topology,the azimuth and elevation are separated yet coupled to the same radial Doppler frequency.Hence,the pair matching problem is solved with the aid of the radial Doppler frequency.Finally,numerical simulations corroborate the feasibility and validity of the proposed algorithm.展开更多
Ultra-wide-band (UWB) signals are suitable for localization, since their high time resolution can provide precise time of arrival (TOA) estimation. However, one major challenge in UWB signal processing is the requirem...Ultra-wide-band (UWB) signals are suitable for localization, since their high time resolution can provide precise time of arrival (TOA) estimation. However, one major challenge in UWB signal processing is the requirement of high sampling rate which leads to complicated signal processing and expensive hardware. In this paper, we present a novel UWB signal sampling method called UWB signal sampling via temporal sparsity (USSTS). Its sampling rate is much lower than Nyquist rate. Moreover, it is implemented in one step and no extra processing unit is needed. Simulation results show that USSTS can not recover the signal precisely, but for the use in localization, the accuracy of TOA estimation is the same as that in traditional methods. Therefore, USSTS gives a novel and effective solution for the use of UWB signals in localization.展开更多
Media based modulation(MBM)is expected to be a prominent modulation scheme,which has access to the high data rate by using radio frequency(RF)mirrors and fewer transmit antennas.Associated with multiuser multiple inpu...Media based modulation(MBM)is expected to be a prominent modulation scheme,which has access to the high data rate by using radio frequency(RF)mirrors and fewer transmit antennas.Associated with multiuser multiple input multiple output(MIMO),the MBM scheme achieves better performance than other conventional multiuser MIMO schemes.In this paper,the massive MIMO uplink is considered and a conjunctive MBM transmission scheme for each user is employed.This conjunctive MBM transmission scheme gathers aggregate MBM signals in multiple continuous time slots,which exploits the structured sparsity of these aggregate MBM signals.Under this kind of scenario,a multiuser detector with low complexity based on the compressive sensing(CS)theory to gain better detection performance is proposed.This detector is developed from the greedy sparse recovery technique compressive sampling matching pursuit(CoSaMP)and exploits not only the inherently distributed sparsity of MBM signals but also the structured sparsity of multiple aggregate MBM signals.By exploiting these sparsity,the proposed CoSaMP based multiuser detector achieves reliable detection with low complexity.Simulation results demonstrate that the proposed CoSaMP based multiuser detector achieves better detection performance compared with the conventional methods.展开更多
Compressive sampling matching pursuit （CoSaMP） algorithm integrates the idea of combining algorithm to ensure running speed and provides rigorous error bounds which provide a good theoretical guarantee to convergenc...Compressive sampling matching pursuit （CoSaMP） algorithm integrates the idea of combining algorithm to ensure running speed and provides rigorous error bounds which provide a good theoretical guarantee to convergence. And compressive sensing （CS） can help us ease the pressure of hardware facility from the requirements of the huge amount in information processing. Therefore, a new video coding framework was proposed, which was based on CS and curvelet transform in this paper. Firstly, this new framework uses curvelet transform and CS to the key frame of test sequence, and then gains recovery frame via CoSaMP to achieve data compress. In the classic CoSaMP method, the halting criterion is that the number of iterations is fixed. Therefore, a new stopping rule is discussed to halting the algorithm in this paper to obtain better performance. According to a large number of experimental results, we ran see that this new framework has better performance and lower RMSE. Through the analysis of the experimental data, it is found that the selection of number of measurements and sparsity level has great influence on the new framework. So how to select the optimal parameters to gain better performance deserves worthy of further study.展开更多
It is understood that the sparse signal recovery with a standard compressive sensing（CS） strategy requires the measurement matrix known as a priori. The measurement matrix is, however, often perturbed in a practical...It is understood that the sparse signal recovery with a standard compressive sensing（CS） strategy requires the measurement matrix known as a priori. The measurement matrix is, however, often perturbed in a practical application.In order to handle such a case, an optimization problem by exploiting the sparsity characteristics of both the perturbations and signals is formulated. An algorithm named as the sparse perturbation signal recovery algorithm（SPSRA） is then proposed to solve the formulated optimization problem. The analytical results show that our SPSRA can simultaneously recover the signal and perturbation vectors by an alternative iteration way, while the convergence of the SPSRA is also analytically given and guaranteed. Moreover, the support patterns of the sparse signal and structured perturbation shown are the same and can be exploited to improve the estimation accuracy and reduce the computation complexity of the algorithm. The numerical simulation results verify the effectiveness of analytical ones.展开更多
Source and mask joint optimization(SMO)is a widely used computational lithography method for state-of-the-art optical lithography process to improve the yield of semiconductor wafers.Nowadays,computational efficiency ...Source and mask joint optimization(SMO)is a widely used computational lithography method for state-of-the-art optical lithography process to improve the yield of semiconductor wafers.Nowadays,computational efficiency has become one of the most challenging issues for the development of pixelated SMO techniques.Recently,compressive sensing(CS)theory has be explored in the area of computational inverse problems.This paper proposes a CS approach to improve the computational efficiency of pixel-based SMO algorithms.To our best knowledge,this paper is the first to develop fast SMO algorithms based on the CS framework.The SMO workflow can be separated into two stages,i.e.,source optimization(SO)and mask optimization(MO).The SO and MO are formulated as the linear CS and nonlinear CS reconstruction problems,respectively.Based on the sparsity representation of the source and mask patterns on the predefined bases,the SO and MO procedures are implemented by sparse image reconstruction algorithms.A set of simulations are presented to verify the proposed CS-SMO methods.The proposed CS-SMO algorithms are shown to outperform the traditional gradient-based SMO algorithm in terms of both computational efficiency and lithography imaging performance.展开更多
Compressed sensing(CS)aims for seeking appropriate algorithms to recover a sparse vector from noisy linear observations.Currently,various Bayesian-based algorithms such as sparse Bayesian learning(SBL)and approximate ...Compressed sensing(CS)aims for seeking appropriate algorithms to recover a sparse vector from noisy linear observations.Currently,various Bayesian-based algorithms such as sparse Bayesian learning(SBL)and approximate message passing(AMP)based algorithms have been proposed.For SBL,it has accurate performance with robustness while its computational complexity is high due to matrix inversion.For AMP,its performance is guaranteed by the severe restriction of the measurement matrix,which limits its application in solving CS problem.To overcome the drawbacks of the above algorithms,in this paper,we present a low complexity algorithm for the single linear model that incorporates the vector AMP(VAMP)into the SBL structure with expectation maximization(EM).Specifically,we apply the variance auto-tuning into the VAMP to implement the E step in SBL,which decrease the iterations that require to converge compared with VAMP-EM algorithm when using a Gaussian mixture(GM)prior.Simulation results show that the proposed algorithm has better performance with high robustness under various cases of difficult measurement matrices.展开更多
The compressive sensing （CS） theory allows people to obtain signal in the frequency much lower than the requested one of sampling theorem. Because the theory is based on the assumption of that the location of sparse...The compressive sensing （CS） theory allows people to obtain signal in the frequency much lower than the requested one of sampling theorem. Because the theory is based on the assumption of that the location of sparse values is unknown, it has many constraints in practical applications. In fact, in many cases such as image processing, the location of sparse values is knowable, and CS can degrade to a linear process. In order to take full advantage of the visual information of images, this paper proposes the concept of dimensionality reduction transform matrix and then se- lects sparse values by constructing an accuracy control matrix, so on this basis, a degradation algorithm is designed that the signal can be obtained by the measurements as many as sparse values and reconstructed through a linear process. In comparison with similar methods, the degradation algorithm is effective in reducing the number of sensors and improving operational efficiency. The algorithm is also used to achieve the CS process with the same amount of data as joint photographic exports group （JPEG） compression and acquires the same display effect.展开更多
This paper extends the application of compressive sensing(CS) to the radar reconnaissance receiver for receiving the multi-narrowband signal. By combining the concept of the block sparsity, the self-adaption methods, ...This paper extends the application of compressive sensing(CS) to the radar reconnaissance receiver for receiving the multi-narrowband signal. By combining the concept of the block sparsity, the self-adaption methods, the binary tree search,and the residual monitoring mechanism, two adaptive block greedy algorithms are proposed to achieve a high probability adaptive reconstruction. The use of the block sparsity can greatly improve the efficiency of the support selection and reduce the lower boundary of the sub-sampling rate. Furthermore, the addition of binary tree search and monitoring mechanism with two different supports self-adaption methods overcome the instability caused by the fixed block length while optimizing the recovery of the unknown signal.The simulations and analysis of the adaptive reconstruction ability and theoretical computational complexity are given. Also, we verify the feasibility and effectiveness of the two algorithms by the experiments of receiving multi-narrowband signals on an analogto-information converter(AIC). Finally, an optimum reconstruction characteristic of two algorithms is found to facilitate efficient reception in practical applications.展开更多
Because of the specific of underwater acoustic channel,spectrum sensing entails many difficulties in cognitive underwater acoustic communication( CUAC) networks, such as severe frequency-dependent attenuation and low ...Because of the specific of underwater acoustic channel,spectrum sensing entails many difficulties in cognitive underwater acoustic communication( CUAC) networks, such as severe frequency-dependent attenuation and low signal-to-noise ratios. To overcome these problems, two cooperative compressive spectrum sensing( CCSS) schemes are proposed for different scenarios( with and without channel state information). To strengthen collaboration among secondary users( SUs),cognitive central node( CCN) is provided to collect data from SUs. Thus,the proposed schemes can obtain spatial diversity gains and exploit joint sparse structure to improve the performance of spectrum sensing. Since the channel occupancy is sparse,we formulate the spectrum sensing problems into sparse vector recovery problems,and then present two CCSS algorithms based on path-wise coordinate optimization( PCO) and multi-task Bayesian compressive sensing( MT-BCS),respectively.Simulation results corroborate the effectiveness of the proposed methods in detecting the spectrum holes in underwater acoustic environment.展开更多
In airborne array synthetic aperture radar(SAR), the three-dimensional(3D) imaging performance and cross-track resolution depends on the length of the equivalent array. In this paper, Barker sequence criterion is used...In airborne array synthetic aperture radar(SAR), the three-dimensional(3D) imaging performance and cross-track resolution depends on the length of the equivalent array. In this paper, Barker sequence criterion is used for sparse flight sampling of airborne array SAR, in order to obtain high cross-track resolution in as few times of flights as possible. Under each flight, the imaging algorithm of back projection(BP) and the data extraction method based on modified uniformly redundant arrays(MURAs) are utilized to obtain complex 3D image pairs. To solve the side-lobe noise in images, the interferometry between each image pair is implemented, and compressed sensing(CS) reconstruction is adopted in the frequency domain. Furthermore, to restore the geometrical relationship between each flight, the phase information corresponding to negative MURA is compensated on each single-pass image reconstructed by CS. Finally,by coherent accumulation of each complex image, the high resolution in cross-track direction is obtained. Simulations and experiments in X-band verify the availability.展开更多
Non Wide Sense Stationary Uncorrelated Scattering (Non-WSSUS) is one of characteristics for high-speed railway wireless channels. In this paper, estimation of Non-WSSUS Channel for OFDM Systems is considered by using ...Non Wide Sense Stationary Uncorrelated Scattering (Non-WSSUS) is one of characteristics for high-speed railway wireless channels. In this paper, estimation of Non-WSSUS Channel for OFDM Systems is considered by using Compressive Sensing (CS) method. Given sufficiently wide transmission bandwidth, wireless channels encountered here tend to exhibit a sparse multipath structure. Then a sparse Non-WSSUS channel estimation approach is proposed based on the delay-Doppler-spread function representation of the channel. This approach includes two steps. First, the delay-Doppler-spread function is estimated by the Compressive Sensing (CS) method utilizing the delay-Doppler basis. Then, the channel is tracked by a reduced order Kalman filter in the sparse delay-Doppler domain, and then estimated sequentially. Simulation results under LTE-R standard demonstrate that the proposed algorithm significantly improves the performance of channel estimation, comparing with the conventional Least Square (LS) and regular CS methods.展开更多
Spectrum sensing in a wideband regime for cognitive radio network(CRN) faces considerably technical challenge due to the constraints on analog-to-digital converters(ADCs).To solve this problem,an eigenvalue-based comp...Spectrum sensing in a wideband regime for cognitive radio network(CRN) faces considerably technical challenge due to the constraints on analog-to-digital converters(ADCs).To solve this problem,an eigenvalue-based compressive wideband spectrum sensing(ECWSS) scheme using random matrix theory(RMT) was proposed in this paper.The ECWSS directly utilized the compressive measurements based on compressive sampling(CS) theory to perform wideband spectrum sensing without requiring signal recovery,which could greatly reduce computational complexity and data acquisition burden.In the ECWSS,to alleviate the communication overhead of secondary user(SU),the sensors around SU carried out compressive sampling at the sub-Nyquist rate instead of SU.Furthermore,the exact probability density function of extreme eigenvalues was used to set the threshold.Theoretical analyses and simulation results show that compared with the existing eigenvalue-based sensing schemes,the ECWSS has much lower computational complexity and cost with no significant detection performance degradation.展开更多
A compressive near-field millimeter wave(MMW)imaging algorithm is proposed.From the compressed sensing(CS)theory,the compressive near-field MMW imaging process can be considered to reconstruct an image from the under-...A compressive near-field millimeter wave(MMW)imaging algorithm is proposed.From the compressed sensing(CS)theory,the compressive near-field MMW imaging process can be considered to reconstruct an image from the under-sampled sparse data.The Gini index(GI)has been founded that it is the only sparsity measure that has all sparsity attributes that are called Robin Hood,Scaling,Rising Tide,Cloning,Bill Gates,and Babies.By combining the total variation(TV)operator,the GI-TV mixed regularization introduced compressive near-field MMW imaging model is proposed.In addition,the corresponding algorithm based on a primal-dual framework is also proposed.Experimental results demonstrate that the proposed GI-TV mixed regularization algorithm has superior convergence and stability performance compared with the widely used l1-TV mixed regularization algorithm.展开更多
基金sponsored by the National Natural Science Foundation of China(Grant Nos.61001092,61371102)
文摘Due to the sparse nature of the impulse radio ultra-wideband(IR-UWB)communication channel in the time domain,compressive sensing(CS)theory is very suitable for the sparse channel estimation. Besides the sparse nature,the IR-UWB channel has shown more features which can be taken into account in the channel estimation process,such as the clustering structures. In this paper,by taking advantage of the clustering features of the channel,a novel IR-UWB channel estimation scheme based on the Bayesian compressive sensing(BCS)framework is proposed,in which the sparse degree of the channel impulse response is not required. Extensive simulation results show that the proposed channel estimation scheme has obvious advantages over the traditional scheme,and the final demodulation performance,in terms of Bit Error Rate(BER),is therefore greatly improved.
文摘Face hallucination or super-resolution is an inverse problem which is underdetermined,and the compressive sensing(CS)theory provides an effective way of seeking inverse problem solutions.In this paper,a novel compressive sensing based face hallucination method is presented,which is comprised of three steps:dictionary learning、sparse coding and solving maximum a posteriori(MAP)formulation.In the first step,the K-SVD dictionary learning algorithm is adopted to obtain a dictionary which can sparsely represent high resolution(HR)face image patches.In the second step,we seek the sparsest representation for each low-resolution(LR)face image paches input using the learned dictionary,super resolution image blocks are obtained from the sparsest coefficients and dictionaries,which then are assembled into super-resolution(SR)image.Finally,MAP formulation is introduced to satisfy the consistency restrictive condition and obtain the higher quality HR images.The experimental results demonstrate that our approach can achieve better super-resolution faces compared with other state-of-the-art method.
基金The National Natural Science Foundation of China (No.60872075)the National High Technology Research and Development Program of China (863 Program) (No.2008AA01Z227)
文摘In order to reduce the pilot number and improve spectral efficiency, recently emerged compressive sensing （CS） is applied to the digital broadcast channel estimation. According to the six channel profiles of the European Telecommunication Standards Institute（ETSI） digital radio mondiale （DRM） standard, the subspace pursuit （SP） algorithm is employed for delay spread and attenuation estimation of each path in the case where the channel profile is identified and the multipath number is known. The stop condition for SP is that the sparsity of the estimation equals the multipath number. For the case where the multipath number is unknown, the orthogonal matching pursuit （OMP） algorithm is employed for channel estimation, while the stop condition is that the estimation achieves the noise variance. Simulation results show that with the same number of pilots, CS algorithms outperform the traditional cubic-spline-interpolation-based least squares （LS） channel estimation. SP is also demonstrated to be better than OMP when the multipath number is known as a priori.
文摘A joint two-dimensional(2D)direction-of-arrival(DOA)and radial Doppler frequency estimation method for the L-shaped array is proposed in this paper based on the compressive sensing(CS)framework.Revised from the conventional CS-based methods where the joint spatial-temporal parameters are characterized in one large scale matrix,three smaller scale matrices with independent azimuth,elevation and Doppler frequency are introduced adopting a separable observation model.Afterwards,the estimation is achieved by L1-norm minimization and the Bayesian CS algorithm.In addition,under the L-shaped array topology,the azimuth and elevation are separated yet coupled to the same radial Doppler frequency.Hence,the pair matching problem is solved with the aid of the radial Doppler frequency.Finally,numerical simulations corroborate the feasibility and validity of the proposed algorithm.
基金supported by National science foundation(No. 60772035): Key technique study on heterogeneous network convergenceDoctoral grant(No.20070004010)s: Study on cross layer design for heterogeneous network convergence+1 种基金National 863 Hi-Tech Projects(No.2007AA01Z277): Pa-rameter design based electromagnetic compatibility study in cognitive radio communication systemNational science foundation(No. 60830001): Wireless communication fundamentals and key techniuqes for high speed rail way control and safety data transmission
文摘Ultra-wide-band (UWB) signals are suitable for localization, since their high time resolution can provide precise time of arrival (TOA) estimation. However, one major challenge in UWB signal processing is the requirement of high sampling rate which leads to complicated signal processing and expensive hardware. In this paper, we present a novel UWB signal sampling method called UWB signal sampling via temporal sparsity (USSTS). Its sampling rate is much lower than Nyquist rate. Moreover, it is implemented in one step and no extra processing unit is needed. Simulation results show that USSTS can not recover the signal precisely, but for the use in localization, the accuracy of TOA estimation is the same as that in traditional methods. Therefore, USSTS gives a novel and effective solution for the use of UWB signals in localization.
文摘Media based modulation(MBM)is expected to be a prominent modulation scheme,which has access to the high data rate by using radio frequency(RF)mirrors and fewer transmit antennas.Associated with multiuser multiple input multiple output(MIMO),the MBM scheme achieves better performance than other conventional multiuser MIMO schemes.In this paper,the massive MIMO uplink is considered and a conjunctive MBM transmission scheme for each user is employed.This conjunctive MBM transmission scheme gathers aggregate MBM signals in multiple continuous time slots,which exploits the structured sparsity of these aggregate MBM signals.Under this kind of scenario,a multiuser detector with low complexity based on the compressive sensing(CS)theory to gain better detection performance is proposed.This detector is developed from the greedy sparse recovery technique compressive sampling matching pursuit(CoSaMP)and exploits not only the inherently distributed sparsity of MBM signals but also the structured sparsity of multiple aggregate MBM signals.By exploiting these sparsity,the proposed CoSaMP based multiuser detector achieves reliable detection with low complexity.Simulation results demonstrate that the proposed CoSaMP based multiuser detector achieves better detection performance compared with the conventional methods.
基金the Youth Foundation of Jiangxi Provincial Education Department,China
文摘Compressive sampling matching pursuit （CoSaMP） algorithm integrates the idea of combining algorithm to ensure running speed and provides rigorous error bounds which provide a good theoretical guarantee to convergence. And compressive sensing （CS） can help us ease the pressure of hardware facility from the requirements of the huge amount in information processing. Therefore, a new video coding framework was proposed, which was based on CS and curvelet transform in this paper. Firstly, this new framework uses curvelet transform and CS to the key frame of test sequence, and then gains recovery frame via CoSaMP to achieve data compress. In the classic CoSaMP method, the halting criterion is that the number of iterations is fixed. Therefore, a new stopping rule is discussed to halting the algorithm in this paper to obtain better performance. According to a large number of experimental results, we ran see that this new framework has better performance and lower RMSE. Through the analysis of the experimental data, it is found that the selection of number of measurements and sparsity level has great influence on the new framework. So how to select the optimal parameters to gain better performance deserves worthy of further study.
基金supported by the National Natural Science Foundation of China(61171127)
文摘It is understood that the sparse signal recovery with a standard compressive sensing（CS） strategy requires the measurement matrix known as a priori. The measurement matrix is, however, often perturbed in a practical application.In order to handle such a case, an optimization problem by exploiting the sparsity characteristics of both the perturbations and signals is formulated. An algorithm named as the sparse perturbation signal recovery algorithm（SPSRA） is then proposed to solve the formulated optimization problem. The analytical results show that our SPSRA can simultaneously recover the signal and perturbation vectors by an alternative iteration way, while the convergence of the SPSRA is also analytically given and guaranteed. Moreover, the support patterns of the sparse signal and structured perturbation shown are the same and can be exploited to improve the estimation accuracy and reduce the computation complexity of the algorithm. The numerical simulation results verify the effectiveness of analytical ones.
基金the National Natural Science Foundation of China(NSFC)(61675021)the Fundamental Research Funds for the Central Universities(2018CX01025).
文摘Source and mask joint optimization(SMO)is a widely used computational lithography method for state-of-the-art optical lithography process to improve the yield of semiconductor wafers.Nowadays,computational efficiency has become one of the most challenging issues for the development of pixelated SMO techniques.Recently,compressive sensing(CS)theory has be explored in the area of computational inverse problems.This paper proposes a CS approach to improve the computational efficiency of pixel-based SMO algorithms.To our best knowledge,this paper is the first to develop fast SMO algorithms based on the CS framework.The SMO workflow can be separated into two stages,i.e.,source optimization(SO)and mask optimization(MO).The SO and MO are formulated as the linear CS and nonlinear CS reconstruction problems,respectively.Based on the sparsity representation of the source and mask patterns on the predefined bases,the SO and MO procedures are implemented by sparse image reconstruction algorithms.A set of simulations are presented to verify the proposed CS-SMO methods.The proposed CS-SMO algorithms are shown to outperform the traditional gradient-based SMO algorithm in terms of both computational efficiency and lithography imaging performance.
基金supported by NSFC projects(61960206005,61803211,61871111,62101275,62171127,61971136,and 62001056)Jiangsu NSF project(BK20200820)+1 种基金Postgraduate Research&Practice Innovation Program of Jiangsu Province(KYCX210106)Research Fund of National Mobile Communications Research Laboratory.
文摘Compressed sensing(CS)aims for seeking appropriate algorithms to recover a sparse vector from noisy linear observations.Currently,various Bayesian-based algorithms such as sparse Bayesian learning(SBL)and approximate message passing(AMP)based algorithms have been proposed.For SBL,it has accurate performance with robustness while its computational complexity is high due to matrix inversion.For AMP,its performance is guaranteed by the severe restriction of the measurement matrix,which limits its application in solving CS problem.To overcome the drawbacks of the above algorithms,in this paper,we present a low complexity algorithm for the single linear model that incorporates the vector AMP(VAMP)into the SBL structure with expectation maximization(EM).Specifically,we apply the variance auto-tuning into the VAMP to implement the E step in SBL,which decrease the iterations that require to converge compared with VAMP-EM algorithm when using a Gaussian mixture(GM)prior.Simulation results show that the proposed algorithm has better performance with high robustness under various cases of difficult measurement matrices.
基金supported by the National Natural Science Foundation of China (61077079)the Specialized Research Fund for the Doctoral Program of Higher Education (20102304110013)the Program Ex-cellent Academic Leaders of Harbin (2009RFXXG034)
文摘The compressive sensing （CS） theory allows people to obtain signal in the frequency much lower than the requested one of sampling theorem. Because the theory is based on the assumption of that the location of sparse values is unknown, it has many constraints in practical applications. In fact, in many cases such as image processing, the location of sparse values is knowable, and CS can degrade to a linear process. In order to take full advantage of the visual information of images, this paper proposes the concept of dimensionality reduction transform matrix and then se- lects sparse values by constructing an accuracy control matrix, so on this basis, a degradation algorithm is designed that the signal can be obtained by the measurements as many as sparse values and reconstructed through a linear process. In comparison with similar methods, the degradation algorithm is effective in reducing the number of sensors and improving operational efficiency. The algorithm is also used to achieve the CS process with the same amount of data as joint photographic exports group （JPEG） compression and acquires the same display effect.
基金supported by the National Natural Science Foundation of China(61172159)
文摘This paper extends the application of compressive sensing(CS) to the radar reconnaissance receiver for receiving the multi-narrowband signal. By combining the concept of the block sparsity, the self-adaption methods, the binary tree search,and the residual monitoring mechanism, two adaptive block greedy algorithms are proposed to achieve a high probability adaptive reconstruction. The use of the block sparsity can greatly improve the efficiency of the support selection and reduce the lower boundary of the sub-sampling rate. Furthermore, the addition of binary tree search and monitoring mechanism with two different supports self-adaption methods overcome the instability caused by the fixed block length while optimizing the recovery of the unknown signal.The simulations and analysis of the adaptive reconstruction ability and theoretical computational complexity are given. Also, we verify the feasibility and effectiveness of the two algorithms by the experiments of receiving multi-narrowband signals on an analogto-information converter(AIC). Finally, an optimum reconstruction characteristic of two algorithms is found to facilitate efficient reception in practical applications.
基金National Natural Science Foundations of China(Nos.60872073,51075068,60975017,61301219)Doctoral Fund of Ministry of Education,China(No.20110092130004)
文摘Because of the specific of underwater acoustic channel,spectrum sensing entails many difficulties in cognitive underwater acoustic communication( CUAC) networks, such as severe frequency-dependent attenuation and low signal-to-noise ratios. To overcome these problems, two cooperative compressive spectrum sensing( CCSS) schemes are proposed for different scenarios( with and without channel state information). To strengthen collaboration among secondary users( SUs),cognitive central node( CCN) is provided to collect data from SUs. Thus,the proposed schemes can obtain spatial diversity gains and exploit joint sparse structure to improve the performance of spectrum sensing. Since the channel occupancy is sparse,we formulate the spectrum sensing problems into sparse vector recovery problems,and then present two CCSS algorithms based on path-wise coordinate optimization( PCO) and multi-task Bayesian compressive sensing( MT-BCS),respectively.Simulation results corroborate the effectiveness of the proposed methods in detecting the spectrum holes in underwater acoustic environment.
文摘In airborne array synthetic aperture radar(SAR), the three-dimensional(3D) imaging performance and cross-track resolution depends on the length of the equivalent array. In this paper, Barker sequence criterion is used for sparse flight sampling of airborne array SAR, in order to obtain high cross-track resolution in as few times of flights as possible. Under each flight, the imaging algorithm of back projection(BP) and the data extraction method based on modified uniformly redundant arrays(MURAs) are utilized to obtain complex 3D image pairs. To solve the side-lobe noise in images, the interferometry between each image pair is implemented, and compressed sensing(CS) reconstruction is adopted in the frequency domain. Furthermore, to restore the geometrical relationship between each flight, the phase information corresponding to negative MURA is compensated on each single-pass image reconstructed by CS. Finally,by coherent accumulation of each complex image, the high resolution in cross-track direction is obtained. Simulations and experiments in X-band verify the availability.
文摘Non Wide Sense Stationary Uncorrelated Scattering (Non-WSSUS) is one of characteristics for high-speed railway wireless channels. In this paper, estimation of Non-WSSUS Channel for OFDM Systems is considered by using Compressive Sensing (CS) method. Given sufficiently wide transmission bandwidth, wireless channels encountered here tend to exhibit a sparse multipath structure. Then a sparse Non-WSSUS channel estimation approach is proposed based on the delay-Doppler-spread function representation of the channel. This approach includes two steps. First, the delay-Doppler-spread function is estimated by the Compressive Sensing (CS) method utilizing the delay-Doppler basis. Then, the channel is tracked by a reduced order Kalman filter in the sparse delay-Doppler domain, and then estimated sequentially. Simulation results under LTE-R standard demonstrate that the proposed algorithm significantly improves the performance of channel estimation, comparing with the conventional Least Square (LS) and regular CS methods.
基金National Natural Science Foundations of China(Nos.61201161,61271335)Postdoctoral Science Foundation of Jiangsu Province of China(No.1301002B)
文摘Spectrum sensing in a wideband regime for cognitive radio network(CRN) faces considerably technical challenge due to the constraints on analog-to-digital converters(ADCs).To solve this problem,an eigenvalue-based compressive wideband spectrum sensing(ECWSS) scheme using random matrix theory(RMT) was proposed in this paper.The ECWSS directly utilized the compressive measurements based on compressive sampling(CS) theory to perform wideband spectrum sensing without requiring signal recovery,which could greatly reduce computational complexity and data acquisition burden.In the ECWSS,to alleviate the communication overhead of secondary user(SU),the sensors around SU carried out compressive sampling at the sub-Nyquist rate instead of SU.Furthermore,the exact probability density function of extreme eigenvalues was used to set the threshold.Theoretical analyses and simulation results show that compared with the existing eigenvalue-based sensing schemes,the ECWSS has much lower computational complexity and cost with no significant detection performance degradation.
基金supported in part by the National Natural Science Foundation of China under Grants No.62027803,No.61601096,No.61971111,No.61801089,and No.61701095in part by the Science and Technology Program under Grants No.8091C24,No.80904020405,No.2021JCJQJJ0949,and No.2022JCJQJJ0784in part by Industrial Technology Development Program under Grant No.2020110C041.
文摘A compressive near-field millimeter wave(MMW)imaging algorithm is proposed.From the compressed sensing(CS)theory,the compressive near-field MMW imaging process can be considered to reconstruct an image from the under-sampled sparse data.The Gini index(GI)has been founded that it is the only sparsity measure that has all sparsity attributes that are called Robin Hood,Scaling,Rising Tide,Cloning,Bill Gates,and Babies.By combining the total variation(TV)operator,the GI-TV mixed regularization introduced compressive near-field MMW imaging model is proposed.In addition,the corresponding algorithm based on a primal-dual framework is also proposed.Experimental results demonstrate that the proposed GI-TV mixed regularization algorithm has superior convergence and stability performance compared with the widely used l1-TV mixed regularization algorithm.
