基于最小生成树路由的电力线载波通信数据融合算法

电力线载波通信技术利用现有的电力传输网络进行数据传输,具有建设成本低,部署快速灵活等特点,被广泛用于局域网本地通信中。但当节点数过多或传输数据量过高时,如每个节点单独将数据传到调控中心,将会给整个通信系统带来巨大的数据量,同时降低通信效率,甚至造成通信拥塞。为降低传输数据量,节省通信传输资源,提升电力线载波接入网络的传输能力,本文提出了基于最小生成树传输路径的电力线载波通信数据融合算法。将所提算法与未使用融合算法带来的数据量进行对比,证明了所提算法的有效性。     

一种最小电压应力的软开关无桥PFC技术研究

针对传统桥式整流升压功率因数校正(PFC)电路效率较低的缺点,提出了一种最小电压应力的软开关无桥PFC电路拓扑.在理论分析和仿真验证的基础上,研制了一台300 W的实验样机.结果表明,改进的无桥PFC电路拓扑具有通态损耗低、电流采样简单,能实现开关管零电压关断和零电流开通,同时实现整流二极管零电压导通和接近零电流软关断...     

基于最小误码率准则的多载波CDMA系统多用户检测算法

本文介绍了一种将正交频分复用(OFDM)技术和码分多址(CDMA)技术相结合的多载波CDMA (MC-CDMA)系统,分析了MC-CDMA系统的发射端和接收端的结构,建立了MC-CDMA系统的信号模型,详细分析了MC-CDMA中的多址干扰形式,以及针对MC-CDMA系统的多用户检测原理,提出了一种基于最小误码率准则的多用户检测算法。理想的基于最小误码率准则的多用户检测算法在实际中难于实现,本文采用估计概率密度函数的方法,推导出了一种自适应实现的最小误码率多用户检测算法。仿真结果表明,该算法能够有效抑制多址干扰,降低误码率,同时,该算法还具有比基于最小均方误差准则的多用户检测器更低的误码率的优点。      

APGAN and RPMC: Complementary Heuristics for Translating DSP Block Diagrams into Efficient Software Implementations

Dataflow has proven to be an attractive computational model for graphical DSP design environments that support the automatic conversion of hierarchical signal flow diagrams into implementations on programmable processors. The synchronous dataflow (SDF) model is particularly well-suited to dataflow-based graphical programming because its restricted semantics offer strong formal properties and significant compile-time predictability, while capturing the behavior of a large class of important signal processing applications. When synthesizing software for embedded signal processing applications, critical constraints arise due to the limited amounts of memory. In this paper, we propose a solution to the problem of jointly optimizing the code and data size when converting SDF programs into software implementations.We consider two approaches. The first is a customization to acyclic graphs of a bottom-up technique, called pairwise grouping of adjacent nodes (PGAN), that was proposed earlier for general SDF graphs. We show that our customization to acyclic graphs significantly reduces the complexity of the general PGAN algorithm, and we present a formal study of our modified PGAN technique that rigorously establishes its optimality for a certain class of applications. The second approach that we consider is a top-down technique, based on a generalized minimum-cut operation, that was introduced recently in [14]. We present the results of an extensive experimental investigation on the performance of our modified PGAN technique and the top-down approach and on the trade-offs between them. Based on these results, we conclude that these two techniques complement each other, and thus, they should both be incorporated into SDF-based software implementation environments in which the minimization of memory requirements is important. We have implemented these algorithms in the Ptolemy software environment [5] at UC Berkeley.     

The Fast Blind Equalization Algorithm with Global Convergence

ＴｈｅＦａｓｔＢｌｉｎｄＥｑｕａｌｉｚａｔｉｏｎＡｌｇｏｒｉｔｈｍｗｉｔｈＧｌｏｂａｌＣｏｎｖｅｒｇｅｎｃｅＬｕＪｕｎＬｉＴｏｎｇ（ＩｎｓｔｉｔｕｔｅｏｆＩｎｆｏｒｍａｔｉｏｎａｎｄＥｎｇｉｎｅｅｒｉｎｇｏｆＰＬＡ，Ｚｈｅｎｇｚｈｏｕ４５０００２）Ａ...     

大规模MIMO系统低复杂度混合迭代信号检测

在大规模MIMO系统上行链路信号检测算法中,最小均方误差(MMSE)算法能获得接近最优的线性检测性能.但是,传统的MMSE检测算法涉及高维矩阵求逆运算,由于复杂度过高而使其在实际应用中难以快速有效地实现.基于最速下降(steepest descent,SD)算法和高斯一赛德尔(Gauss-Seidel,GS)迭代的方法提出了一种低复杂度的混合迭代算法,利用SD算法为复杂度相对较低的GS迭代算法提供有效的搜索方向,以加快算法收敛的速度.同时,给出了一种用于信道译码的比特似然比(LLR)近似计算方法.仿真结果表明,通过几次迭代,给出的算法能够快速收敛并接近MMSE检测性能,并将算法复杂度降低一个数量级,保持在O(K2).     

基于局部结构变换域稀疏外观模型的目标跟踪

[目的]为了降低稀疏表示目标跟踪算法的计算复杂度,[方法]在粒子滤波框架下提出了基于局部结构变换域稀疏外观模型的视觉目标跟踪算法.[结果]该算法在目标区域附近提取重叠的局部图像块,并计算出所有局部图像块的二维离散余弦变换,获得图像块的变换域系数.变换域的能量集中特性被采用来降低字典的维度与候选样本的数量,并且对系数压缩一定的自由度可以抑制噪声与遮挡影响.采用被裁剪的样本与字典获得局部图像块的稀疏编码,然后将当前目标区域中所有小图像块的稀疏向量加权融合得到目标区域的稀疏表示值,并通过决策模型获取最优跟踪结果.与现有三种最新的跟踪算法比较的实验结果表明,[结论]所提算法的跟踪性能接近或超过对比算法,同时大大减小了f1范数最小化的计算复杂度.     

基于太阳能的ZigBee无线校园网络环境监测系统

本项目结合各高校的特点和供电要求,设计了一种基于太阳能供电的ZigBee无线校园网络环境监测系统,可以实现对多实验楼、多个校区的环境等信息进行实时的管理和监控功能.整个监测系统由太阳能供电系统、ZigBee模块、PM2.5传感器模块、温湿度传感器模块、Labview上位机模块等几个部分组成.经过多次测试后的实验结果表明,此系统运行可靠、稳定,具有广泛的推广价值和一定的实用性.     

Resource allocation in orthogonal frequency division multiple access‐based cognitive radio systems with minimum rate constraints

In this paper, resource allocation problem in orthogonal frequency division multiple access‐based cognitive radio (CR) systems to maintain minimum transmission rate constraints of CR users (CRUs) with the specified interference thresholds is investigated. Firstly, a single primary user (PU) CR system is considered, and a suboptimal resource allocation algorithm to maximize the sum transmission rate of all CRUs is proposed. Secondly, the single‐PU scenario is extended to multiple‐PU case, and an asymptotically optimal resource allocation algorithm is proposed using dual methods subject to constraints on both interference thresholds of PUs and total transmit power of all CRUs. Analysis and numerical results show that, in contrast to classical resource allocation algorithms, the proposed algorithm can achieve higher transmission rate and guarantee each CRU's minimum transmission rate in both scenarios. Copyright © 2012 John Wiley & Sons, Ltd.     

Minimum symbol error rate multiuser detection using an effective invasive weed optimization for MIMO/SDMA–OFDM system

Space division multiple access–orthogonal frequency division multiplexing system has become a potential wireless communication system by offering high spectral efficiency, performance and capacity. This article deals with minimum symbol error rate (MSER)‐based multiuser detection (MUD) technique for the space division multiple access–orthogonal frequency division multiplexing system using an efficient invasive weed optimization (IWO) algorithm. The IWO algorithm is used for finding optimal weights such that the probability of error is directly minimized rather than minimizing the mean square error. Because of this, the MSER MUD is able to detect users even in overload scenario, where the number of users is more than the number of receiving antennas, unlike several classical detection techniques. The IWO is inspired from the nature of invasive colonization of weeds and relatively simple compared with other optimization techniques. The bit error rate performance of the proposed IWO‐aided MSER MUD is found to be better than minimum means square error and differential evolution algorithm‐aided MSER MUDs. Simulation results show that the proposed IWO MSER achieves faster convergence and lower complexity compared with the differential evolution MSER MUD. Copyright © 2013 John Wiley & Sons, Ltd.