共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
3.
电磁脉冲测量中常需要通过电流探头、天线等传感器将待测脉冲先转换成易于测量的电压信号。由于传感器一般只给出了幅度的修正关系而缺少相位信息,给重建脉冲波形带来很大困难。为了解决这一问题,引入了最小相位法,将传感器视为一个满足最小相位条件的信号传输系统,通过传感器的修正系数计算其相频特性,得到系统的冲激响应,进而恢复出待测的电磁脉冲的波形。通过对电磁兼容试验中几种常见脉冲的测试,验证了波形重建的效果。这一方法解决了脉冲敏感度试验中门限电平不易确定的难题,也为电磁脉冲测量系统的校准提供了参考。 相似文献
4.
Mingyuan Yan Jing He Shouling Ji Yingshu Li 《Wireless Communications and Mobile Computing》2014,14(9):849-864
Query scheduling as one of the most important technologies used in query processing has been widely studied recently. In this paper, we investigate the Minimum Latency Multi‐Regional Query Scheduling (ML‐MRQS) problem in wireless Sensor Networks (WSNs), which aims to generate a scheduling plan with minimum latency under a more practical query model called Multi‐Regional Query (MRQ). An MRQ targets at interested data from multiple regions of a WSN, where each region is a subarea. Because the ML‐MRQS problem is NP‐hard, we propose a heuristic scheduling algorithm Multi‐Regional Query Scheduling Algorithm (MRQSA) to solve this problem. Theoretical analysis shows that the latency of MRQSA is upper bounded by 23A + B + C for an MRQ with m query regions , where is the maximum latency for non‐overlapped regions, is the maximum latency for overlapped regions, and is the accumulated latency for data transmission from the accessing nodes to the sink. Simulation results show that MRQSA reduces latency by 42.7% to 51.63% with respect to different number of query regions, network density, region size, and interference/transmission range compared with C‐DCQS, while guaranteeing energy efficiency. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
5.
Throughput maximization in wireless powered communication networks with minimum node throughput requirement 下载免费PDF全文
Kaikai Chi Xinchen Wei Yanjun Li Xianzhong Tian 《International Journal of Communication Systems》2018,31(15)
This paper considers wireless powered communication network consisting of one hybrid access point and a set of one‐hop nodes. Hybrid access point conducts wireless energy transfer (WET) in the downlink and nodes conduct wireless information transmissions (WITs) in the uplink based on the time division multiple access (TDMA) mode. Specifically, for the scenario where each node has its own minimum throughput requirement and different nodes' data have different levels of utility, we aim to achieve the minimum node throughput constrained weighted sum throughput maximization (MT‐WSTM) by jointly optimizing the time allocations of the WET and the WITs. First, we formulate the MT‐WSTM problem as a nonlinear optimization problem and further transform it into a more tractable form. Then, we prove the MT‐WSTM problem is convex and develop an efficient algorithm utilizing the dual decomposition technique to obtain the optimal solution of this problem. Compared with two schemes which use the optimal WET time and allocate the surplus WIT time evenly to all nodes and solely to the best node, respectively, the weighted sum throughput of the MT‐WSTM scheme is obviously larger in both homogeneous and heterogeneous scenarios. 相似文献
6.
针对传统人脸识别算法在单训练样本情况下识别 效果不佳的问题,提出一种基于中心对称梯度幅值 相位模式(CSGMP)的单样本人脸识别算法。首先,提取人脸图像的梯度幅值和相位信息;然 后,用一种新 的中心对称局部方向模式(CSLDP)算子对梯度幅值进行编码,再将梯度相位量化到8个区间 进行编码,将 二者融合形成人脸图像的CSGMP特征;最后,分块统计直方图特征信息,将所有块的直方图 串联后作为 人脸图像的特征向量,利用最近邻分类器分类识别。在YALE和AR人脸库上进行测试的结果表 明,本文所提方 法简单有效,对光照变化、表情变化和部分遮挡等环境下单样本人脸识别具有较好的效果。 相似文献
7.
It is well known that IIR digital filters require quite fewer computations,comparedwith FIR filters,in order to meet stringent magnitude specifications when the phase distortioncan be tolerated.An approximately linear phase,however,can be also obtained with the IIRfilter by making use of a technique without increasing the complexity.Based on a certain numberof attenuation zeros in the pass band,a new approach is developed for the design of polyphasewave digital filters with exact magnitude responses and Chebyshev approximation of the desiredphase responses.The minimum number of attenuation zeros is estimated,and some examples areincluded. 相似文献
8.
The approximation problem for high-order minimum phase FIR filter is solved without requiring any polynomial factorization. A modified Parks-McClellan program is used to compute the amplitude function; the minimum phase function is then derived by a method using the FFT algorithm. The procedure is illustrated by the design of various high order filters; short computation time with no numerical troubles is achieved. 相似文献
9.
An improved method of designing optimal minimum phase FIR filters by directly finding zeros is proposed. The zeros off the unit circle are found by an efficient special purpose root-finding algorithm without deflation. The proposed algorithm utilizes the passband minimum ripple frequencies to establish the initial points, and employs a modified Newton's iteration to find the accurate initial points for a standard Newton's iteration. We show, with examples, that the proposed algorithm can be used to design very long filters (L = 325) with very high stopband attenuations. 相似文献
10.
11.
12.
提出一种通用的多维全相位数字滤波器的设计方法.基于一维原型全相位数字滤波器(APDF),通过多维抽取变换,设计出具有任意平行六面体通带的多维APDF,并保持奈奎斯特约束特性和零相位特性.利用一种新型优化窗函数设计了性能优异的一维加窗APDF,将其作为一维原型滤波器,生成了不可分离的多维加窗APDF.实例表明,在滤波器长... 相似文献
13.
The instability of operational channels on cognitive radio networks (CRNs), which is due to the stochastic behavior of primary users (PUs), has increased the complexity of the design of the optimal routing criterion (ORC) in CRNs. The exploitation of available opportunities in CRNs, such as the channel diversity, as well as alternative routes provided by the intermediate nodes belonging to routes (internal backup routes) in the route-cost (or weight) determination, complicate the ORC design. In this paper, to cover the channel diversity, the CRN is modeled as a multigraph in which the weight of each edge is determined according to the behavior of PU senders and the protection of PU receivers. Then, an ORC for CRNs, which is referred to as the stability probability of communication between the source node and the destination node (SPC_SD), is proposed. SPC_SD, which is based on the obtained model, internal backup routes, and probability theory, calculates the precise probability of communication stability between the source and destination. The performance evaluation is conducted using simulations, and the results show that the end-to-end performance improved significantly. 相似文献
14.
Li Hu Liu Yuan'an Yuan Dongming Hu Hefei Duan Sirui Liao Mingxia 《Wireless Communications and Mobile Computing》2016,16(7):825-849
Capacity region and minimum energy function for a variety of delay‐tolerant mobile unicast ad hoc networks are studied by using a cell‐partitioned model. First, theorems about analytical expressions of network capacity and upper bound of minimum energy function are proposed and proved. Algorithm aiming at maximizing capacity and minimizing energy cost is presented and analyzed by Lyapunov drift method. Second, these two theorems are applied to several types of ad hoc networks. Expressions of network capacity and minimum energy function are obtained. Third, capacity property of a type of hybrid ad hoc networks is analyzed in detail. Relationship among limitation of capacity, node density, and coverage of base stations are investigated. Numerical analysis and simulation are carried out. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
15.
基于Matlab和FPGA的CIC滤波器的设计 总被引:1,自引:0,他引:1
基于多速率信号处理原理,设计了用于下变频的CIC抽取滤波器,由于CIC滤波器结构只用到加法器和延迟器,没有乘法器,很适合用FPGA来实现,所以本文分析了CIC滤波器的原理,性能及影响参数,借助MATLAB的FDATool工具箱设计符合系统要求CIC滤波器,并利用Simulink结合具体的结构建模仿真,验证CIC滤波器性能是否达到要求,最后在FPGA上实现这个结构的CIC滤波器设计,并进行了模拟仿真,综合验证。 相似文献
16.
Each node in a wireless ad hoc network runs on a local energy source that has a limited energy life span. Thus, energy conservation is a critical issue in such networks. In addition, it is in general desirable to construct routes with low hop counts as a route with a high hop count is more likely to be unstable (because the probability that intermediate nodes will move away is higher). In this paper, we address these two issues concurrently with energy conservation as the primary objective and low hop count as the secondary objective. One way of addressing the energy conservation issue is to construct routes that maximize the minimum residual battery capacity available among all nodes in each route. A broadcast tree with all routes satisfying this condition is referred to as a maximum residual energy resource broadcast tree. A maximum residual energy resource broadcast tree with the least diameter is referred to as a minimum diameter maximum residual energy resource broadcast tree and the problem of constructing such a tree is referred to as the minimum diameter maximum residual energy resource broadcast routing problem (MDMRERBRP). We propose an algorithm for MDMRERBRP and prove that MDMRERBRP is optimally solvable in polynomial time using the proposed algorithm. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
17.
介绍TMS320F28335的性能特点、仿真工具和开发环境,给出了由TMS320F28335组成的最小应用系统,并结合实际应用介绍其复位电路、时钟电路、JTAG仿真接口电路以及电源模块的设计方法。 相似文献
18.
19.