首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 234 毫秒
1.
李浩  彭华  丁金忠 《信号处理》2012,28(9):1284-1289
粒子滤波是一种基于贝叶斯估计的算法,在信道盲辨识和盲均衡问题上具有快收敛、抗深衰信道等优势。Turbo盲均衡在低信噪比条件下有较好的误码性能。为了在深衰信道下使通信具有良好的误码性能,对粒子滤波盲均衡算法进行改进,改进算法的重要性采样函数利用了粒子的先验信息,得到一种软输入软输出的粒子滤波盲均衡算法。依据Turbo盲均衡的框架结构实现了一种基于粒子滤波的Turbo盲均衡算法,该算法利用信道编码带来的编码增益,提高了均衡和信道辨识的性能。仿真结果表明相比粒子滤波盲均衡算法本文提出算法的误码率性能提高1dB左右,误帧率性能则提高了3dB以上,经分析可知在信道系数估计较为准确的条件下,系统数据帧几乎没有误码。   相似文献   

2.
为了解决当收发两端频谱环境不一致时,变换域通信系统(TDCS)基函数序列的盲同步估计问题,文章提出了一种TDCS信号盲同步的改进算法。相比于传统的基于F_范数盲同步法系统性能明显改善。将接收到的TDCS信号进行周期分段以形成连续多个观察向量,分段向量通过改进算法估计采样延时。同步后将接收信号按基函数周期分段得到分段向量,求协方差矩阵并累加平均,最后通过特征值分解法得到最大特征向量即估计的基函数序列。仿真结果表明:估计的基函数相关解调接收信号得到的误码率与收发两端基函数一致条件下的误码率基本一致。  相似文献   

3.
一种基于过采样的单通道MPSK信号盲分离算法   总被引:5,自引:0,他引:5  
针对单通道接收两个MPSK混合信号的盲分离问题,该文提出了一种基于过采样的盲分离新算法。该算法基于最优贝叶斯估计准则,利用粒子滤波对发送的符号和一些参数进行序贯估计,从而实现了混合信号的分离。算法通过对接收信号的过采样,利用了更多的接收波形信息,有效地抑制了噪声的影响。仿真实验表明,新算法具有良好的误码率性能。该文同时还从极大似然的角度,对分离算法的性能进行了分析,给出了算法的误码率性能界。  相似文献   

4.
针对跳频通信中多跳频信号的盲源分离问题,提出了一种基于自适应惯性权重粒子群的盲源分离算法。该算法将分离信号的负熵作为目标函数,依据迭代前后每个粒子适应度值间差值自适应地调节惯性权重。把适应度值变差的粒子惯性权重设成零,以消除惯性分量不利影响,这样可以减少无效迭代次数,提高收敛速度。应用于盲源分离时,比经典算法分离效果好且克服了激活函数选取难题。实验结果表明该算法用于多跳频信号盲分离时性能稳定且收敛速度快,与经典算法比较优势明显,为智能算法在盲源分离方面的研究提供了一定的参考。  相似文献   

5.
基于频率选择性信道中由一个发射节点、一个目标节点和多个中继节点构成的中继网络,该文提出一种新型的分布式波束形成技术。该技术除了在中继节点上采用滤波而后转发的中继数据中转策略之外,在接收节点也配备一个有限长响应(Finite Impulse Response, FIR)滤波器,共同均衡发射节点与中继节点以及中继节点与接收节点之间的频率选择性信道。该文中,此两种滤波器将得到联合优化以提高接收节点的服务质量,并同时满足中继节点的发射功率限制。仿真结果表明,相较于放大而后转发以及滤波而后转发但无接收滤波器的波束形成器而言,所提波束形成技术极大地提高了频率选择性信道中中继网络的性能。  相似文献   

6.
针对无线传感器网络中节点通信能力及能量有限的情况,该文提出基于动态分簇路由优化和分布式粒子滤波的传感器网络目标跟踪方法。该方法以动态分簇的方式将监测区域内随机部署的传感器节点划分为若干个簇,并对簇内成员节点与簇首节点之间、簇首节点与基站之间的通信路由进行优化,确保网络能耗的均衡分布,在此基础上,被激活的簇内成员节点并行地执行分布式粒子滤波算法实现目标跟踪。仿真结果表明,该方法能有效地降低传感器网络中节点的总能耗,能在实现跟踪的同时保证目标跟踪的精度。  相似文献   

7.
为了解决铁路监测场景中线性无线传感器网络的节点间能耗不均衡导致的网络生命周期短、数据传输时延大的问题,提出了一种基于粒子群优化理论和广度优先搜索的路由算法。以候选簇头节点的相对能耗、簇头间距和簇头负载为指标构建适应度函数,通过调整惯性权重系数增强粒子群算法局部搜索能力,获得簇头最优解集;构建能耗与时延驱动的路径成本函数,基于广度优先搜索获得源节点到sink节点的最优主路径;设计基于Markov决策过程(MDP)模型的Q-learning备选路径更新与路由维护机制。仿真结果表明,所提算法能够有效均衡节点间能耗,在延长网络生命周期和降低数据传输时延方面具有较优的性能。  相似文献   

8.
基于虚拟MIMO的协作通信节点选择算法   总被引:1,自引:0,他引:1  
针对一种新的协作通信方式O-DSTC(Opportunistic Distributed Space-Time Coding),该文在保证误码率的前提下,基于效益函数和后悔函数,提出了均衡剩余能量的协作节点选择算法。在只能得到信道的统计特性并考虑距离信息的情况下,由于O-DSTC的平均误码率无法计算,所以该文提出并简化了协作中继的平均误码率逼近公式。根据该逼近公式选择满足误码率要求的协作节点集合,集合中的节点通过后悔函数分布式地设置延迟时间,并采用竞争方式成为协作节点。仿真结果验证了该文提出的误码率逼近公式的有效性和可靠性。实验结果也表明,协作节点选择算法可以保证误码率,提高最小剩余能量,同时减少竞争接入时间。  相似文献   

9.
马思扬  王彬  彭华 《电子学报》2017,45(9):2302-2307
针对深衰落稀疏多径信道下多进制相移键控(Multiple Phase Shift Keying,MPSK)信号的盲均衡问题,提出了一种l0-范数约束的分数间隔稀疏自适应双模式盲均衡算法.该算法借鉴传统的分数间隔双模式盲均衡算法思想,结合稀疏自适应滤波理论,首先利用l0-范数对均衡器抽头系数进行稀疏性约束,构造出一种l0-范数约束的分数间隔双模式最小均方误差代价函数,然后依据梯度下降法推导出盲均衡器抽头系数更新公式,并对迭代步长进行归一化和比例系数化.理论分析和仿真实验表明,与基于门限稀疏化的盲均衡算法、基于分数阶范数的盲均衡算法及分数间隔双模式盲均衡算法相比,本文所提算法在保证较快收敛速度的前提下,能有效降低剩余符号间干扰.本文设计的盲均衡算法为水声通信系统中接收方恢复出发送信号,提供了一种快速有效的方法.  相似文献   

10.
粒子滤波算法在多传感器测量中的应用   总被引:1,自引:0,他引:1  
目标跟踪是粒子滤波算法在处理非线性问题的一种典型应用,但由于在线处理能力或传输条件的限制,实际应用中往往无法对多个传感器数据同时处理。据此,给出了一种基于多传感器选优的粒子滤波算法。假设每个时刻可以处理一个测量数据,该算法先采用加权的概率密度函数来评价每个传感器获得的测量值,并用粒子滤波对概率密度函数的加权进行实时更新,基于最大熵标准来选取最优测量数据进行处理。同时,最大熵标准保证了最优似然函数分布最宽,从而缓解粒子衰竭问题。通过数值仿真实验证明,该算法可以选择最优观测数据进行处理,有效降低多传感器测量中粒子滤波在线实时处理性能的要求,也较好地缓解了粒子滤波的"衰竭"问题。  相似文献   

11.
宽带分布式协作压缩频谱感知不仅降低过高的采样速率,而且改善在低信噪比环境下的频谱感知性能。为进一步提高频谱感知性能,提出一种基于加权一致优化的宽带分布式协作压缩频谱感知算法。该算法根据当前迭代重构出的频谱信号设定下一次迭代重构的权值,促使频谱信号上存在授权用户的子频段产生信号值,降低重构出错的可能性。仿真结果表明,该算法不仅能够增大频谱重构的准确性,而且能够降低感知过程的时间和通信开销,改善频谱感知性能。  相似文献   

12.
针对粒子滤波宽带波达方向估计中因采样粒子权值不稳定导致估计误差较大的问题,提出了基于辅助粒子滤波的宽带波达方向估计算法。该算法利用贝叶斯重要性采样算法,在权值大的粒子基础上引入辅助粒子变量,重新定义重要性采样分布函数。经过两次加权计算,进而改善粒子退化问题,并引导粒子向高似然区域移动,使粒子在真实状态周围分布更均匀,粒子权值比仅用重采样的粒子权值变化更稳定。仿真实验表明,该算法在均方根误差和检测概率性能上优于粒子滤波算法。   相似文献   

13.
This paper presents an algorithm for iterative joint channel parameter (carrier phase, Doppler shift, and Doppler rate) estimation and decoding of transmission over channels affected by Doppler shift and Doppler rate using a distributed receiver. This algorithm is derived by applying the sum-product algorithm (SPA) to a factor graph representing the joint a posteriori distribution of the information symbols and channel parameters given the channel output. In this paper, we present two methods for dealing with intractable messages of the SPA. In the first approach, we use particle filtering with sequential importance sampling for the estimation of the unknown parameters. We also propose a method for fine-tuning of particles for improved convergence. In the second approach, we approximate our model with a random walk phase model, followed by a phase tracking algorithm and polynomial regression algorithm to estimate the unknown parameters. We derive the Weighted Bayesian Cramer-Rao Bounds for joint carrier phase, Doppler shift, and Doppler rate estimation, which take into account the prior distribution of the estimation parameters and are accurate lower bounds for all considered signal-to-noise ratio values. Numerical results (of bit error rate and the mean-square error of parameter estimation) suggest that phase tracking with the random walk model slightly outperforms particle filtering. However, particle filtering has a lower computational cost than the random walk model-based method.  相似文献   

14.
This paper describes the distributed information filtering where a set of sensor networks are required to simultaneously estimate input and state of a linear discrete-time system from collaborative manner. Our research purpose is to develop a consensus strategy in which sensor nodes communicate within the network through a sequence of Kalman iterations and data diffusion. A novel recursive information filtering is proposed by integrating input estimation error into measurement data and weighted information matrices. On the fusing process, local system state filtering transmits estimation information using the consensus averaging algorithm, which penalizes the disagreement in a dynamic manner. A simulation example is provided to compare the performance of the distributed information filtering with optimal Gillijins–De Moor’s algorithm.  相似文献   

15.
何华  柯熙政  王武 《激光技术》2011,35(6):738-741,791
为了有效改善大气激光正交频分复用通信系统接收端的符号检测性能,采用现有的混合粒子滤波算法对大气激光正交频分复用时变信道进行半盲估计,并进行了理论分析与实验验证.与传统的基于导频的时变信道估计方法相比,该方法可有效改善接收端的符号检测性能,并通过MATLAB仿真结果验证了该方法的有效性.结果表明,在相同的信噪比下,所用方...  相似文献   

16.
The main objective in distributed sensor networks is to reach agreement or consensus on values acquired by the sensors. A common methodology to approach this problem is using the iterative and weighted linear combination of those values to which each sensor has access. Different methods to compute appropriate weights have been extensively studied, but the resulting iterative algorithm still requires many iterations to provide a fairly good estimate of the consensus value. In this paper, different accelerating consensus approaches based on adaptive and non‐adaptive filtering techniques are studied and applied on the problem of acoustic source localization using the adaptive projected subgradient method. A comparative simulation study shows that the non‐adaptive polynomial filters based on Newton's interpolating polynomials and semi‐definite programming can provide more accelerated consensus and better estimation accuracy than adaptive filters evaluated using constrained affine projection algorithm or stochastic gradient algorithm provided that the network topology is known beforehand. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   

17.
针对在低信噪比目标检测问题中,基于PHD的粒子滤波检测前跟踪算法(PHD-TBD)存在目标位置估计误差较大的缺陷,提出一种结合粒子群优化算法的基于PHD的粒子滤波检测前跟踪方法(PSO-PHD-TBD)。该算法在滤波预测和更新步骤之间加入基于NSGA-Ⅱ的多目标粒子群优化算法,结合量测信息将预测完成的粒子集的分布进行优化,将所有粒子转移到后验概率密度较大的区域,进而改善了多目标位置估计的性能;然后使用基于密度聚类的DBSCAN算法对粒子聚类,提取目标状态。仿真实验表明,在不同信噪比条件下,PSO-PHD-TBD在多目标数目估计情况与PHD-TBD算法一致,而位置估计精度明显优于PHD-TBD算法。  相似文献   

18.
A covariance shaping framework for linear multiuser detection   总被引:1,自引:0,他引:1  
A new class of linear multiuser receivers, referred to as the covariance shaping multiuser (CSMU) receiver, is proposed, for suppression of interference in multiuser wireless communication systems. This class of receivers is based on the recently proposed covariance shaping least-squares estimator, and is designed to minimize the total variance of the weighted error between the receiver output and the observed signal, subject to the constraint that the covariance of the noise component in the receiver output is proportional to a given covariance matrix, so that we control the dynamic range and spectral shape of the output noise. Some of the well-known linear multiuser receivers are shown to be special cases of the CSMU receiver. This allows us to interpret these receivers as the receivers that minimize the total error variance in the observations, among all linear receivers with the same output noise covariance, and to analyze their performance in a unified way. We derive exact and approximate expressions for the probability of bit error, as well as the asymptotic signal-to-interference+noise ratio in the large system limit. We also characterize the spectral efficiency versus energy-per-information bit of the CSMU receiver in the wideband regime. Finally, we consider a special case of the CSMU receiver, equivalent to a mismatched minimum mean-squared error (MMSE) receiver, in which the channel signal-to-noise ratio (SNR) is not known precisely. Using our general performance analysis results, we characterize the performance of the mismatched MMSE receiver. We then treat the case in which the SNR is known to lie in a given uncertainty range, and develop a robust mismatched MMSE receiver whose performance is very close to that of the MMSE receiver over the entire uncertainty range.  相似文献   

19.
针对传统粒子滤波(PF)没有引入当前信息,并存在粒子退化的问题,提出了一种基于序列二次规划(SQP)多级优化的PF 算法。首先,基于残差分布特性采用置信区间剔除较大偏差粒子,调整粒子权值分布;然后,将重采样后的粒子映射到集合U,根据集合U 中各粒子复制次数建立多级优化模型,通过SQP 求解模型的参数值,当前后两级模型优化参数差异小于门限时,输出最后一级优化参数为滤波结果;最后,为防止过度采样导致粒子退化,利用滤波值及其协方差采样新粒子。仿真实验表明:SQP鄄PF 算法在跟踪精度,粒子多样性方面优于传统PF 算法。  相似文献   

20.
Sensing events occur in an area without knowing the events locations, is meaningless. Since there is no priorly knowledge about the locations of most of the sensors which scattered randomly in an area, wireless sensor network localization methods try to find out where sensors are located. A new cooperative and distributed range-free localization algorithm, based on only connectivity information is proposed in this paper. The method first uses convex optimization techniques to find primitive target nodes locations estimation, then nodes cooperate with each other in several iterations to improve the whole network location estimation. CRWSNP converges after a finite number of iterations because of applying two novel heuristic location correction techniques. As well as, results of the algorithm have been compared with six range-free based methods like CPE, DV-hop, APIT; and CRWSNP algorithm provides more accurate results over 50 random topologies for the network, in mean error and maximum error metrics.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号