Tensor-based blind signal recovery for multi-carrier amplify-and-forward relay networks

Cooperative communications have great potentials in performance enhancement via deploying relay nodes. However, these kinds of benefits usually come at the cost of more system parameters to be estimated. This fact definitely reduces the efficiency of wireless systems and then it motivates the research on the blind algorithms for cooperative communications that need fewer parameters. In this paper, we investigate the parallel factors （PARAFAC） decomposition-based blind signal recovery algorithm design for two-hop amplify-and-forward （AF） multi-carrier cooperative networks. In particular, the uniqueness of the PARAFAC decomposition used in the proposed algorithm is first investigated in detail, and then the performance of signal recovery is analyzed. Finally, the simulation results assess the performance of our proposed algorithm.     

Efficient resource allocation scheme for multi-service based on interference mitigation in LTE-Advanced networks

The exponential growth of various services demands the increased capacity of the next-generation broadband wireless access networks, which is toward the deployment of femtocell in macrocell network based on orthogonal frequency division multiple access. However, serious time-varying interference obstructs this macro/femto overlaid network to realize its true potential. In this article, we present a macro services guaranteed resource allocation scheme, which can mitigate various dominant interferences and provide multiple services in macro/femto overlaid Third-Generation Partnership Project Long Term Evolution-Advanced networks. We model our multiple services resource allocation scheme into a multiobjective optimization problem, which is a non-deterministic polynomial-time （NP）-hard problem. Then, we give a low-complexity algorithm consisting of two layers based on chordal graph. Simulation results verify that the proposed scheme can achieve better efficiency than the previous works and raise the satisfaction ratio of Guaranteed Bit Rate （GBR） services while improving the average performance of non-GBR services.     

Adaptive GLR-, Rao- and Wald-based CFAR detectors for a subspace signal embedded in structured Gaussian interference

The problem of detecting a subspace signal embedded in subspace Gaussian interference and thermal noise is studied in this paper. In this problem, both the signal-independent and signal-dependent interferences are assumed to be present, therefore the overall interference subspace covers the signal subspace. The approach of this paper extends previous works involving either of those two kinds of interferences. A set of secondary data containing only interference plus noise is employed to estimate the interference covariance matrix and the noise power. Three new detectors are designed via the generalized likelihood ratio (GLR), Rao and Wald tests, respectively. Their probabilities of false alarms (PFAs) and detections are analytically derived. The PFAs show that the new detectors have the constant false alarm rate (CFAR) property against the interference and noise. Numerical results show that the new detectors outperform their counterparts for the studied problem. Furthermore, the new detectors are less sensitive to the secondary data size and to the mismatched subspace signal than some other detectors, such as the GLR detector (GLRD), the adaptive matched filter (AMF), the adaptive subspace detector (ASD), etc.     

Adaptive array detection in noise and completely unknown jamming

The presence of jamming usually degrades the detection performance of a detector. Moreover, sufficient information about the jamming may be difficult to be obtained. To overcome the problem of adaptive array signal detection in noise and completely unknown jamming, we temporarily assume the jamming belongs to a subspace which is orthogonal to the signal steering vector in the stage of detector design. Consequently, by resorting to the criteria of generalized likelihood ratio test (GLRT) and Wald test, we propose two adaptive detectors, which can achieve signal detection and jamming suppression. It is shown, by Monte Carlo simulations, that the two proposed adaptive detectors have improved detection performance over existing ones.     

Persymmetric adaptive subspace detectors for range-spread targets

This paper investigates the problem of adaptive detection of a range-spread target in colored Gaussian disturbance. The range-spread target is described by a multi-rank subspace model, which lies in a subspace but with unknown coordinates. The disturbance, usually including clutter and thermal noise, has an unknown covariance matrix. Under the above assumption, we design the Rao and generalized likelihood ratio test (GLRT) detectors by the two-step procedure, which incorporates persymmetric structure of received data. The two detectors are shown to coincide with each other. Remarkably, the proposed detector ensures constant false alarm rate property. Experimental results conducted by both simulation and real data verify that the proposed detector outperforms the existing counterparts in training-limited scenarios.     

Adaptive detection of distributed targets in compound-Gaussian clutter with inverse gamma texture

The problem of coherent detection for distributed target in compound-Gaussian clutter with inverse gamma texture is studied and three detectors. One-step generalized likelihood ratio test (GLRT), maximum a-posteriori GLRT and two-step GLRT, are proposed respectively in a Bayesian architecture. Resultantly, these detectors have similar detection structures with their test statistics modulated by the shape and scale parameters of the texture. Alternatively, they can be reformulated into another form with their test statistics associated with the scale parameter and detection thresholds related with the shape parameter. And this detection structure can be seen as a matched filter form with a shape-parameter-dependent threshold like the detectors for point target. Subsequently, the proposed detectors are compared with two-step GLRT based on compound-Gaussian clutter without considering texture model, their detection performances are evaluated, and their robustness are analyzed via Monte Carlo simulations. Results enlighten us that: (1) the three Bayesian detectors bear pretty much the same detection performances; (2) the detection performances fluctuate more intensely when the shape parameter or the scale parameter is smaller; (3) the shape parameter has more influences on the detection performances than the scale parameter, as it is an indication of the clutter impulsiveness.     

基于Krylov子空间的测向算法

提出一种基于Krylov子空间的信号波达方向估计算法,搜索信号可能入射角度,通过测试所构造的Krylov子空间与信号子空间的等价性来判断信号的DOA,算法用多级维纳滤波实现子空间分解。仿真实验表明,算法在低信噪比条件下对相邻信号有良好的谱分辨率和估计性能。     

Kernel matched subspace detectors for hyperspectral target detection

In this paper, we present a kernel realization of a matched subspace detector (MSD) that is based on a subspace mixture model defined in a high-dimensional feature space associated with a kernel function. The linear subspace mixture model for the MSD is first reformulated in a high-dimensional feature space and then the corresponding expression for the generalized likelihood ratio test (GLRT) is obtained for this model. The subspace mixture model in the feature space and its corresponding GLRT expression are equivalent to a nonlinear subspace mixture model with a corresponding nonlinear GLRT expression in the original input space. In order to address the intractability of the GLRT in the feature space, we kernelize the GLRT expression using the kernel eigenvector representations as well as the kernel trick where dot products in the feature space are implicitly computed by kernels. The proposed kernel-based nonlinear detector, so-called kernel matched subspace detector (KMSD), is applied to several hyperspectral images to detect targets of interest. KMSD showed superior detection performance over the conventional MSD when tested on several synthetic data and real hyperspectral imagery.     

Efficient Acoustic Echo Cancellation With Reduced-Rank Adaptive Filtering Based on Selective Decimation and Adaptive Interpolation

This paper presents a new approach to efficient acoustic echo cancellation (AEC) based on reduced-rank adaptive filtering equipped with selective-decimation and adaptive interpolation. We propose a novel structure of an AEC scheme that jointly optimizes an interpolation filter, a decimation unit, and a reduced-rank filter. With a practical choice of parameters in AEC, the total computational complexity of the proposed reduced-rank scheme with the normalized least mean square (NLMS) algorithm is approximately half of that of the full-rank NLMS algorithm. We discuss the convergence properties of the proposed scheme and present a convergence condition. First, we examine the performance of the proposed scheme in a single-talk situation with an error-minimization criterion adopted in the decimation selection. Second, we investigate the potential of the proposed scheme in a double-talk situation by employing an ideal decimation selection. In addition to mean squared error (MSE) and power spectrum analysis of the echo estimation error, subjective assessments based on absolute category rating are performed, and the results demonstrate that the proposed structure provides significant improvements compared to the full-rank NLMS algorithm.     

Online reduced gaussian process regression based generalized likelihood ratio test for fault detection

In this paper we consider a new fault detection approach that merges the benefits of Gaussian process regression (GPR) with a generalized likelihood ratio test (GLRT). The GPR is one of the most well-known machine learning techniques. It is simpler and generally more robust than other methods. To deal with both high computational costs for large data sets and time-varying dynamics of industrial processes, we consider a reduced and online version of the GPR method. The online reduced GPR (ORGPR) aims to select a reduced set of kernel functions to build the GPR model and apply it for online fault detection based on GLRT chart. Compared with the conventional GPR technique, the proposed ORGPR method has the advantages of improving the computational efficiency by decreasing the dimension of the kernel matrix. The developed ORGPR-based GLRT (ORGPR-based GLRT) could improve the fault detection efficiency since it is able to track the time-varying characteristics of the processes. The fault detection performance of the developed ORGPR-based GLRT method is evaluated using a Tennessee Eastman process. The simulation results show that the proposed method outperforms the conventional GPR-based GLRT technique.     

应用预处理AWE技术快速计算导体目标宽带RCS

应用渐近波形估计技术计算目标宽带雷达散射截面（RCS）,可有效提高计算效率。然而当目标为电大尺寸时,阻抗矩阵求逆运算将十分耗时,甚至无法计算。提出使用Krylov子空间迭代法取代矩阵逆来求解大型矩阵方程,应用双门槛不完全LU分解预处理技术降低迭代求解所需的迭代次数。数值计算表明,该方法结果与矩量法逐点求解结果吻合良好,并且计算效率大大提高。     

稀疏距离扩展目标自适应检测及性能分析

在球不变随机向量杂波背景下,研究了稀疏距离扩展目标的自适应检测问题.基于有序检测理论, 利用协方差矩阵估计方法,分析了自适应检测器(Adaptive detector, AD).其中,基于采样协方差矩阵(Sample covariance matrix, SCM)和归一化采样协方差矩阵(Normalized sample covariance matrix, NSCM),分别建立了AD-SCM和AD-NSCM检测器.从恒虚警率特性和检测性能综合来看, AD-NSCM的性能优于AD-SCM和已有的修正广义似然比检测器.最后,通过仿真实验验证了所提方法的有效性.     

一种有效的直接数据域地面动目标检测方法

直接数据域(Direct data domain, DDD)方法利用子孔径平滑来从单个距离门中获得足够样本,但空域、时域孔径损失严重,使得空时自适应处理的地面动目标检测性能下降严重.针对该问题提出了一种不需要协方差矩阵估计和求逆的DDD方法,该方法将多级维纳滤波器引入到DDD的最优权求解过程中,在低的空时孔径损失下仍然能够获得好的性能.某机载实测雷达数据的实验结果验证了该方法的有效性.     

Adaptive detection for distributed targets in Gaussian noise with Rao and Wald tests

The problem of adaptively detecting a range distributed target or targets in Gaussian interference is considered in this paper.It is assumed that a set of secondary data is available.Firstly,we derive the adaptive Rao and Wald tests with one-step detection algorithm,and find that both of them are of the same asymptotic performance as the GLRT one.Secondly,the Rao and Wald tests are derived by resorting to the two-step design strategy.To our surprise,our derivations show that all the Rao,Wald and GLR tests in the two-step design strategy are equivalent.Thirdly,the property assessments are presented.It is shown that these new detectors guarantee CFAR property with respect to the Gaussian noise.Finally,simulation results show that these results are accurate.     

小波变换用于基于图像内容的自适应数字水印算法

为了提高在频率域嵌入水印抵抗攻击的能力,该文提出一种基于DWT的CBWM自适应数字水印嵌入算法,该算法依据离散小波变换域的水印嵌入策略:水印应当首先嵌入小波图像的低频系数中,若有剩余,再按小波图像频带重要性的排序,嵌入高频带中,并且水印嵌入到图像的低频系数和高频系数中时,需采用不同的嵌入强度;将水印嵌入到图像三级小波分解变换域的低频空间(LL3)的特征向量中,并且水印与特征向量两者正交。并且,其中水印的嵌入过程是自适应的,即先将小波系数组织成小波块,再依据纹理强弱对小波块分类,然后根据分类结果,将不同强度的水印分量嵌入到特征向量的不同分量中。此外,该算法对静止图像的水印检测是通过Neymann-Pearson决策准则来实现的。实验结果证明,该算法对滤波、噪声、几何变换、图像压缩、以及x-y方向修剪、StirMark攻击等都具有很好的抵抗能力;对裁剪和图像旋转也具有较好的鲁棒性。     

Target detection based on a dynamic subspace

For hyperspectral target detection, it is usually the case that only part of the targets pixels can be used as target signatures, so can we use them to construct the most proper background subspace for detecting all the probable targets? In this paper, a dynamic subspace detection (DSD) method which establishes a multiple detection framework is proposed. In each detection procedure, blocks of pixels are calculated by the random selection and the succeeding detection performance distribution analysis. Manifold analysis is further used to eliminate the probable anomalous pixels and purify the subspace datasets, and the remaining pixels construct the subspace for each detection procedure. The final detection results are then enhanced by the fusion of target occurrence frequencies in all the detection procedures. Experiments with both synthetic and real hyperspectral images (HSI) evaluate the validation of our proposed DSD method by using several different state-of-the-art methods as the basic detectors. With several other single detectors and multiple detection methods as comparable methods, improved receiver operating characteristic curves and better separability between targets and backgrounds by the DSD methods are illustrated. The DSD methods also perform well with the covariance-based detectors, showing their efficiency in selecting covariance information for detection.     

基于消息延迟预测的自适应失效检测模型

失效检测是实现高可用性的一个关键技术,通常采用超时机制判断进程是否失效的方法实现。然而,由于网络状况的不断变化,缺乏自适应机制的失效检测器难以满足应用对QoS的需求。自适应失效检测要求失效检测器能够根据实际应用和网络负载变化而动态地改变检测的质量。在对现有自适应失效检测算法研究、分析的基础上提出一种基于消息延迟预测的失效检测模型,采用基于历史消息延迟预测下一个消息延迟的方法,实现了一种PA-AFD自适应失效检测算法。实验及分析表明该算法在保证检测准确性和完整性的同时缓解了网络延迟对失效检测的影响。     

Adaptive subspace detection of range-distributed target in compound-Gaussian clutter

This paper deals with high-resolution radar (HRR) adaptive detection of range-distributed target embedded in compound-Gaussian clutter which is modeled as a spherically invariant random process (SIRP). Using multiple dominant scattering (MDS) model of range-distributed target, we justify that range-distributed target can be modeled as a subspace random signal. The unknown deterministic parameters are replaced by their ML estimates and then the nonadaptive detector is proposed. A closed-form expression for the probability of false alarm of the nonadaptive detector is derived and it ensures CFAR property with respect to the unknown statistics of the clutter texture component. Moreover, an adaptive detector is obtained relying on a two-step GLRT-based design procedure. Performances of these proposed detectors are assessed through Monte Carlo simulations and are shown to have better detection performance compared with existing similar detector.     

Study of spectrum sensing exploiting polarization: From optimal LRT to practical detectors

Spectrum sensing exploiting polarization can be leveraged to improve detection performance. In this paper, we present an optimal likelihood ratio test (LRT) which serves as the upper bound on the performance of all methods that exploit polarization under Gaussian assumption. However, the performance of LRT for realistic blind sensing is unclear since the practical implementation of polarization sensing has to face several challenges, which is the focus of this paper. Four practical sensing algorithms utilizing polarization are considered in this work, that is, a generalized likelihood ratio test (GLRT) for polarization sensing using maximum likelihood estimate (MLE) method when any prior knowledge is unknown, an optimal test when the noise of channel between primary user and secondary user is partially polarized, a realistic detector considering that the received polarization wave arrived with a specific direction rather than is almost perpendicular to the receiver dual-polarized antennas, and a more practical blind detector for polarization channel exhibiting polarization mode dispersion (PMD) phenomenon especially in wideband system. The simulation results show the performance gains possible with proposed detectors and how well the proposed detectors are expected to perform in practice.     

有色噪声中信号的GLRT检测算法研究

针对在高斯广义平稳(WSS)有色噪声环境中含有未知参数信号的检测问题,对于广义似然比检验(GLRT)和匹配子空间方法,提出了一种新的检测算法.通过AR(自回归)参数模型得到含有未知参数的信号加噪声渐进概率密度函数,利用参数变换的方法把一个非线性最小二乘估计问题转化为线性求解问题,然后采用最小二乘估计方法得到参数的极大似然估计(MLE),从而建立了具有恒虚警特性的GLRT检测器.最后结合匹配子空间方法得到了检测概率和虚警概率的表达式,计算机仿真实验验证了方法的有效性.