您的位置: 专家智库 > >

国家自然科学基金(61072088)

作品数:8 被引量:11H指数:2
相关作者:张延华孙恩昌周作成孙艳华管建中更多>>
相关机构:北京工业大学西安电子科技大学更多>>
发文基金:国家自然科学基金北京市教委课题国家重点实验室开放基金更多>>
相关领域:电子电信自动化与计算机技术更多>>

文献类型

  • 8篇中文期刊文章

领域

  • 7篇电子电信
  • 1篇自动化与计算...

主题

  • 2篇信道
  • 1篇动态规划
  • 1篇信道模型
  • 1篇信号
  • 1篇译码
  • 1篇译码算法
  • 1篇酉空时码
  • 1篇中继
  • 1篇中继节点
  • 1篇神经网
  • 1篇神经网络
  • 1篇时码
  • 1篇似然
  • 1篇搜索
  • 1篇搜索空间
  • 1篇最大似然
  • 1篇网络
  • 1篇无线
  • 1篇无线信道
  • 1篇稀疏信道

机构

  • 4篇北京工业大学
  • 1篇西安电子科技...

作者

  • 4篇张延华
  • 2篇孙恩昌
  • 1篇周作成
  • 1篇王杰令
  • 1篇管建中
  • 1篇孙艳华
  • 1篇蔡融文

传媒

  • 2篇High T...
  • 2篇中国电子科学...
  • 1篇电子学报
  • 1篇北京工业大学...
  • 1篇Journa...
  • 1篇Journa...

年份

  • 2篇2014
  • 2篇2013
  • 1篇2012
  • 3篇2011
8 条 记 录,以下是 1-8
排序方式:
A modified image matching algorithm based on robust Hausdorff distance被引量:3
2014年
Hausdorff distance measure is one of the widely adopted feature-based image matching algo- rithms due to its simplicity and accuracy. However, it is considered that its robustness still needs to be improved. In this paper, various forms of original and improved Hausdorff distance (HD) and their limitations are studied. Focusing on robust Hausdorff distance ( RHD), an improved RHD with an adaptive outlier point threshold selection method is proposed. Furthermore, another new form of the Hausdorff distance which possesses the merits of RHD and M-HD is prsented. Finally, a recur- sire algorithm is introduced to accelerate the image matching speed of Hausdorff algorithms. Exten- sive simulation and experiment results are presented to validate the feasibility of the proposed Haus- dorff distance algorithm.
吴强Wu XuefengLi XuwenJia Kebin
基于BP网络的稀疏信道估计算法的改进被引量:1
2011年
为了在稀疏信道下有效地降低传统信道估计算法的复杂度,提出了一种基于反向传播(BP,back propagation)网络的正交匹配追踪后接消除(OMPC,orthogonal matching pursuit cancellation)信道估计改进算法。首先通过OMPC算法确定各个非零抽头的位置,其次设置BP网络的权值与阈值,进一步实现对非零抽头估计值的逼近,最后通过自适应调整来对信道估计的准确度进行修正。通过与基于BP和OMPC信号稀疏分解的比较发现,本方法较好地解决了信号稀疏分解计算量大、收敛速度慢、不能利用信道稀疏特性等难题。
管建中孙艳华张延华
关键词:稀疏信道BP神经网络OMPCMP
Optimal spectrum allocation of primary users in light-handed cognitive radio networks被引量:1
2012年
In traditional cognitive radio(CR) network,secondary users(SUs) are always assumed to obey the rule of"introducing no interference to the primary users(PUs) ".However,this assumption may be not realistic as the CR devices becoming more and more intelligent nowadays.In this paper,with the concept of lighthanded CR,which is proposed to deal with the above mentioned problem by enforcing"punishment"to illegal CR transmissions,the action decisions of primary users(PUs) are modeled as a partially observable Markov decision process(POMDP),and the optimal spectrum allocation scheme with the objective of maximizing their reward is proposed,which is defined by the utility function.Furthermore,a reduced scheme with much smaller state space has been proposed in this paper for lower computational complexity.Extensive simulation results show that the proposed schemes improve the reward significantly compared to the existing scheme.
司鹏博孙恩昌张延华
关键词:POMDP
An efficient multi-relay selection scheme in cooperative communication system
2013年
Cooperative relaying has played an important role in rapid evolution of wireless communications.The cooperative performance strongly depends on the selected relays.In this paper,we concentrate on relay selection in amplify-and-forward(AF)cooperative communication system,and an optimal multi-relay selection scheme is put forward to minimize the average symbol error rate(SER)of the system.Firstly,for the minimum average SER,on the basis of the statistic channel information,we define a parameter named equivalent channel gain which describes the channel status of two phases in the cooperative process.Then,under the constraint of equal power allocation,an optimal relay selection scheme is proposed in ascending order of equivalent channel gain(ECG).The scheme implies that the suitable number of relay nodes should be selected under the different signal-to-noise ratio(SNR)ranges to minimize the average SER.Computer simulation results show that the average SER rate of the proposed scheme is lower than these of the other schemes.
蔡融文孙恩昌张延华
基于动态规划(DP)的信道模型变化检测被引量:6
2011年
本文提出一种适用于快衰落信道结构的模型变化检测算法.针对信号包络幅值寻找信道模型发生突变的采样时间点,运用动态规划(DP)方法推导了快衰落信道的模型变化检测的理论表达式,构造了信道的变结构模型切换准则.理论分析和仿真实验表明结合幅值变化检测,可有效地找出模型变化采样时间点,并在这些时间点对信道进行模型切换,使估计器达到了较好的估计精度.
周作成张延华
关键词:动态规划无线信道
一种高效的酉空时信号译码算法
2011年
针对系统产生的酉空时码,提出一种高效的译码算法.接收机计算连续产生的L/2+W(L为星座点数目,W为窗长)个星座点与接收信号的内积范数,将L/2+W个内积范数每隔W的范数值相加,得到L/2个和值;从所得到的和值中搜索极大值,通过该极大值的位置可以将搜索范围降低至3个星座点,最后比较这3个星座点便可搜索到全局最优解.所提算法可以有效地降低最大似然(maximum likelihood,ML)算法的搜索空间,窗长W越小搜索空间降低越多.计算机仿真结果表明,针对给定的星座点,当窗长W为4时,所提算法将ML算法的搜索空间降低一半,而信噪比损失只有2 dB左右.
孙恩昌张延华王杰令
关键词:酉空时码最大似然搜索空间
一种改进的中继节点选择方案
2013年
3GPP标准组织在2004年底启动了其长期演进(LTE)技术的标准化工作。上行传输方案采用带循环前缀的单载波频分多址接入(SC-FDMA)技术。对LTE上行链路进行仿真,实现无中继节点的直接传输。引入中继节点,通过传统最大路径损耗最小(LMP,least maximum pathloss)方案选取最优中继参与协作传输。重点分析并指出了传统LMP算法的缺点和不足,在此基础上提出了一种改进的中继节点选择算法,并结合考虑了源节点和中继节点的功率分配。从系统误码率和用户消耗功率两个方面对各传输方案进行了仿真分析。仿真结果表明LTE上行链路引入中继节点实现协作传输可明显提高系统的误码率性能。协作传输还节约了功率的使用,提高了用户的待机时间和功率效率。相比传统中继选择方案,改进后的LMP算法无论是从误码率还是功率消耗都得到明显改善。
蔡融文孙恩昌张延华
关键词:LTESC-FDMA功率分配
Error propagation determined iterative channel estimation with ICI mitigation for fast time-varying OFDM channels
2014年
The intersubcarrier interference(ICI) degrades the performance of the pilot-aided channel estimation in fast time-varying orthogonal frequency division multiplexing(OFDM) systems.To solve the error propagation in joint channel estimation and data detection due to this ICI,a scheme of error propagation determined iterative estimation is proposed,where in the first iteration,Kalman filter based on signal to interference and noise is designed with ICI transformed to be part of the noise,and for the later iterations,a determined iterative estimation algorithm obtains an optimal output from all iterations using the iterative updating strategy.Simulation results present the significant improvement in the performance of the proposed scheme in high-mobility situation in comparison with the existing ones.
张杰Yang RuizheSi PengboZhang YanhuaYu Richard
关键词:KALMAN
共1页<1>
聚类工具0