检索结果-内蒙古大学图书馆

Online Parameter Estimation for Continuously Monitored Quantum Systems

IEEE CONTROL SYSTEMS LETTERS 2024年 8卷 1247-1252页

作者： Clausen, Henrik Glavind Rouchon, Pierre Wisniewski, Rafal Aalborg Univ Dept Elect Syst Sect Automat & Control DK-9220 Aalborg Denmark Univ PSL Lab Phys Ecole Normale Super Mines Paris PSLInriaENS PSLCNRS F-75272 Paris France

In this letter, we consider the problem of online (real-time, single-shot) estimation of static or slow-varying parameters along quantum trajectories in quantum dynamical systems. Based on the measurement signal of a continuously monitored quantum system, we propose a recursive algorithm for computing the maximum likelihood (ML) estimate of unknown parameters using an approach based on stochastic gradient ascent on the log-likelihood function. We formulate the algorithm in both discrete-time and continuous-time and illustrate the performance of the algorithm through simulations of a simple two-level system undergoing homodyne measurement from which we are able to track multiple parameters simultaneously.

关键词： Maximum likelihood estimation Mathematical models Sensitivity Quantum system Quantum computing Time measurement signal processing algorithms Quantum information and control estimation stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Instantaneous Frequency Estimation via Ridge Detection in Polynomial Time and Space

引用

IEEE signal processing LETTERS 2025年 32卷 1975-1979页

作者： Djurovic, Igor Univ Montenegro Elect Engn Dept Podgorica 81000 Montenegro Montenegrin Acad Sci & Arts Podgorica 81000 Montenegro

Application of ridge detection algorithms to various transforms and problems in time-frequency (TF) analysis has become increasingly widespread with notable application in the instantaneous frequency (IF) estimation. Metaheuristic techniques, such as simulated annealing algorithms, are commonly employed for ridge detection. In this letter, we demonstrate that ridge detection can be achieved using an instance of the Viterbi algorithm (VA). This implementation ensures a global optimum with polynomial time and space complexity. The proposed ridge detection IF estimator is compared to an alternative approach based on the VA.

关键词： Time-frequency analysis Estimation Frequency estimation Viterbi algorithm Polynomials signal processing algorithms Metaheuristics Transforms Simulated annealing Memory management Instantaneous frequency ridge detection time-frequency analysis

来源：评论

学校读者我要写书评

暂无评论

Collision Resolution in RFID Systems Using Antenna Arrays and Mix Source Separation

引用

IEEE COMMUNICATIONS LETTERS 2025年第5期29卷 1122-1125页

作者： Siala, Mohamed Sellami, Noura Univ Carthage Higher Sch Commun Tunis SUP COM Mediatron Lab Tunis 2083 Tunisia Univ Sfax Natl Sch Engn Sfax ENIS LETI Lab Sfax 3038 Tunisia

In this letter, we propose an efficient mix source separation (MSS) algorithm for collision resolution in radio frequency identification (RFID) systems equipped with an antenna array at the reader. We first introduce an approach that exploits the zero constant modulus (ZCM) criterion to separate colliding tags through gradient descent, without using pilot symbols. We show that the ZCM characteristic, considered alone, in the design of the objective function can lead to significant ambiguities in the determination of the beamformers used in the recovery of tag messages. To address this limitation, we propose a more sophisticated approach, relying on a hybrid objective function, incorporating a new ambiguity-raising criterion in addition to the ZCM criterion.

关键词： Radiofrequency identification Linear programming Vectors Symbols signal processing algorithms Receiving antennas Fluctuations Encoding Blind source separation Antenna arrays Mix source separation (MSS) gradient descent algorithm RFID zero constant modulus criterion

来源：评论

学校读者我要写书评

暂无评论

Outage Constrained Design for RIS-Assisted Integrated Sensing and Communication Systems

引用

IEEE COMMUNICATIONS LETTERS 2025年第5期29卷 1037-1041页

作者： Huang, Xingxing Zhang, Guoping Xu, Hongbo Wang, Dong Li, Kunyu Wang, Ze Cent China Normal Univ Coll Phys Sci & Technol Wuhan 430079 Peoples R China

In practice, obtaining perfect channel state information (CSI) is challenging. This letter studies a reconfigurable intelligent surface (RIS)-aided integrated sensing and communication (ISAC) framework under imperfect CSI conditions. Specifically, in the statistical CSI error model, while ensuring the users' rate outage probability (OP) constraints and the minimum beampattern gain for radar targets, the total transmit power is minimized. To solve this non-convex problem, we rephrase the rate OP constraint through Bernstein inequality and suggest an alternating optimization algorithm. The numerical results validate the algorithm's effectiveness and reveal the influence of channel errors on system performance.

关键词： Reconfigurable intelligent surfaces Integrated sensing and communication Array signal processing Vectors signal processing algorithms Optimization Radar antennas Radar Numerical models Training Integrated sensing and communication (ISAC) imperfect channel state information reconfigurable intelligent surface (RIS) beamforming design

来源：评论

学校读者我要写书评

暂无评论

Improved SOCP Relaxation for SRI-Unknown Emitter Localization Using a Moving Receiver

引用

IEEE signal processing Letters 2025年 32卷 2199-2203页

作者： Liu, Sining Yue, Yaxing Zhao, Jiayi Shi, Zhiguo Liao, Guisheng Xidian University National Key Laboratory of Radar Signal Processing Xi'an710071 China Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China

Employing a single moving receiver for emitter localization offers numerous advantages, including low cost, ease of implementation, and elimination of clock synchronization. A novel localization method is proposed for a stationary emitter with an unknown signal Repetition Interval (SRI). We first construct a localization model based on time-of-arrival, taking into account potential missed detections, and then derive the Cramér-Rao Lower Bound. Given that the established model is non-convex, we reformulate the problem into a convex form and convert it to Second-order Cone Programming (SOCP) format. However, the SOCP formulation encounters convex hull issues, which may hinder far-field localization. To address this challenge, we introduce a penalty term to alleviate the convex hull problem for the first time. Simulation results demonstrate the effectiveness of the proposed approach in comparison to existing methods, and the validity of the penalty term is also confirmed. © 1994-2012 IEEE.

关键词： Location awareness Receivers signal processing algorithms Convex hulls Maximum likelihood estimation Vectors Synchronization Lower bound Iterative methods Costs

来源：评论

学校读者我要写书评

暂无评论

signal Power Estimation of All Sensor Network Nodes With Measurements From a Subset of Network Nodes

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2023年第6期59卷 7750-7763页

作者： Liu, Zhaoting Zhang, Huizhe Li, Chunguang Xi, Feng Wu, Duanpo Yao, Yingbiao Zhao, Yinan Hangzhou Dianzi Univ Sch Commun Engn Hangzhou 310018 Peoples R China Zhejiang Univ Coll Informat Sci & Elect Engn Hangzhou 310027 Peoples R China Nanjing Univ Sci & Technol Dept Elect Engn Nanjing 210094 Peoples R China

signal or noise power is an important performance parameter or indicator used for many applications in signal processing and wireless communications. This article investigates the power estimation of random signals on all sensor network nodes by using measurements taken over a subset of nodes, where the power values are assumed to be smooth on the network. This power-estimation problem is formulated as a regularized optimization problem involving the minimization of a sum of nonnegative log-likelihood and the total variation. To find its optimal solution, a primal-dual hybrid gradient (PDHG) algorithm is developed. Moreover, due to the strong demand for low hardware cost and bandwidth/power consumption in wireless communication systems, an extended algorithm, called low-resolution few-bit PDHG (LBit-PDHG), is also developed, which implements the power estimation with low-resolution few-bit quantized measurements. The LBit-PDHG algorithm could achieve competitive estimation performance when increasing the quantization resolution to 2 or 3 b while the energy consumption and implementation costs are still much lower in comparison to the high-resolution sampling implementations. Theoretical analyses prove the convergence of the proposed algorithms. Simulation studies and an application to acoustic source localization further validate the performance of the proposed algorithms.

关键词： Estimation signal processing algorithms Quantization (signal) Wireless sensor networks Wireless communication Power measurement Energy resolution Low bit quantization maximum-likelihood power estimation wireless sensor networks (WSNs)

来源：评论

学校读者我要写书评

暂无评论

Ultra-Low-Complexity algorithms With Structurally Optimal Multi-Group Multicast Beamforming in Large-Scale Systems

引用

IEEE TRANSACTIONS ON signal processing 2023年 71卷 1626-1641页

作者： Zhang, Chong Dong, Min Liang, Ben Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 1A1 Canada Ontario Tech Univ Dept Elect Comp & Software Engn Oshawa ON Canada

In this work, we propose ultra-low-complexity design solutions for multi-group multicast beamforming in large-scale systems. For the quality-of-service (QoS) problem, by utilizing the optimal multicast beamforming structure obtained recently in [2], we convert the original problem into a non-convex weight optimization problem of a lower dimension and propose two fast first-order algorithms to solve it. Both algorithms are based on successive convex approximation (SCA) and provide fast iterative updates to solve each SCA subproblem. The first algorithm uses a saddle point reformulation in the dual domain and applies the extragradient method with an adaptive step-size procedure to find the saddle point with simple closed-form updates. The second algorithm adopts the alternating direction method of multipliers (ADMM) method by converting each SCA subproblem into a favorable ADMM structure. The structure leads to simple closed-form ADMM updates, where the problem in each update block can be further decomposed into parallel subproblems of small sizes, for which closed-form solutions are obtained. We also propose efficient initialization methods to obtain favorable initial points that facilitate fast convergence. Furthermore, taking advantage of the proposed fast algorithms, for the max-min fair (MMF) problem, we propose a simple closed-form scaling scheme that directly uses the solution obtained from the QoS problem, avoiding the conventional computationally expensive method that iteratively solves the inverse QoS problem. We further develop lower and upper bounds on the performance of this scaling scheme. Simulation results show that the proposed algorithms offer near-optimal performance with substantially lower computational complexity than the state-of-the-art algorithms for large-scale systems.

关键词： Array signal processing Multicast algorithms signal processing algorithms Quality of service Interference Optimization Computational complexity Alternating direction method of multipliers extragradient algorithm large-scale optimization low complexity multicast beamforming optimal beamforming structure

来源：评论

学校读者我要写书评

暂无评论

Method for Locating Single-Phase Disconnection Faults in a Smart Distribution System Based on Refined Composite Multiscale Permutation q-Complexity Entropy and Random Forest

引用

IEEE SENSORS JOURNAL 2023年第11期23卷 11925-11935页

作者： Zhang, Xiaowen Zhang, Shuqing Dong, Wei Song, Shanshan Wang, Kainan Yanshan Univ Inst Elect Engn Qinhuangdao 066000 Hebei Peoples R China State Grid Jibei Elect Power Co Ltd Zhangjiakou 075000 Peoples R China

In this article, a novel hybrid method of combining refined composite multiscale permutation q-complexity entropy (RCMPQE) and random forest (RF) is developed to locate disconnection faults in a power distribution system. As a feature extraction method, RCMPQE is used to analyze the negative-sequence current to obtain fault features, and then they are input into RF to build a fault location model. The effectiveness of the proposed method is corroborated by referencing a three-feeder distribution network. The results demonstrate that compared with multiscale permutation entropy (MPE), refined composite MPE (RCMPE), and generalized MPE (GMPE), the RCMPQE has stronger feature extraction ability and can abstract more prominent fault information from negative-sequence current signals. The proposed method for locating faults significantly outperforms other commonly employed machine learning models, and it is immune to various levels of noise. Furthermore, the proposed method can perform well with a high fault location accuracy in a new system.

关键词： Entropy Circuit faults Feature extraction Time series analysis signal processing algorithms Complexity theory Radio frequency Disconnection fault distribution network feature extraction random forest (RF) refined composite multiscale permutation q-complexity entropy (RCMPQE)

来源：评论

学校读者我要写书评

暂无评论

Event-Triggered Approximate Byzantine Consensus With Multi-Hop Communication

引用

IEEE TRANSACTIONS ON signal processing 2023年 71卷 1742-1754页

作者： Yuan, Liwei Ishii, Hideaki Hunan Univ Coll Elect & Informat Engn Changsha 410082 Peoples R China Tokyo Inst Technol Dept Comp Sci Yokohama 2268502 Japan

In this article, we consider a resilient consensus problem for the multi-agent network where some of the agents are subject to Byzantine attacks and may transmit erroneous state values to their neighbors. In particular, we develop two event-triggered update schemes to tackle this problem as well as reduce the communication for each agent. Our approach is based on the mean subsequence reduced (MSR) algorithm with agents being capable to communicate with multi-hop neighbors through relaying process. Since communication delays are critical in such an environment, we provide necessary graph conditions for the proposed algorithms to perform well with delays in the communication. Moreover, a novel multi-hop relay scheme with event-triggered feature is proposed. It can reduce more transmissions than the conventional one-hop event-triggered algorithm. We also highlight that through multi-hop communication, the network connectivity can be reduced especially in comparison with the common one-hop communication case. Lastly, we show the effectiveness of the proposed algorithms by numerical examples.

关键词： signal processing algorithms Relays Spread spectrum communication Delays Robustness Resilience Protocols Resilient consensus distributed algorithms byzantine attack event-triggered updates multi-hop communication

来源：评论

学校读者我要写书评

暂无评论

On Ordered Transmission Based Distributed Gaussian Shift-in-Mean Detection Under Byzantine Attacks

引用

IEEE TRANSACTIONS ON signal processing 2023年 71卷 3343-3356页

作者： Quan, Chen Bulusu, Saikiran Geng, Baocheng Han, Yunghsiang S. Sriranga, Nandan Varshney, Pramod K. Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA Univ Alabama Birmingham Dept Comp Sci Birmingham AL 35294 USA Univ Elect Sci & Technol China Shenzhen Inst Adv Study Shenzhen 610054 Peoples R China

The ordered transmission based (OT-based) schemes reduce the number of transmissions needed in a distributed detection network without any loss in the probability of error performance. In this paper, we investigate the performance of a conventional OT-based system in the presence of additive Byzantine attacks in Gaussian shift in mean problems. In this work, by launching additive Byzantine attacks, attackers are able to alter the order as well as the data for the binary hypothesis testing problem. We also determine the optimal attack strategy for the Byzantine sensors. Furthermore, we analyze a communication efficient OT-based (CEOT-based) scheme in the presence of additive Byzantine attacks. We obtain the probabilities of error for both the OT-based system and the CEOT-based system under attack and evaluate the number of transmissions they save. We also derive analytical bounds for the number of transmissions saved in both systems under attack. Simulation results show that the additive Byzantine attacks have significant impact on the number of transmissions saved even when the signal strength is sufficiently large. A comparison of detection performance between the conventional OT-based system and the CEOT-based system reveals that the CEOT-based system is more robust to additive Byzantine attacks.

关键词： Sensors Sensor systems Additives Wireless sensor networks Sensor phenomena and characterization signal processing algorithms Testing Ordered transmissions Byzantine attacks wireless sensor networks distributed detection

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：