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

ML Criterion Based signal Detection of a MIMO-OFDM system Using Quantum and semi-Quantum Assisted Modified DHA/BBHT search algorithm

引用

IEEE TRANsACTIONs ON VEHICULAR TECHNOLOGY 2021年第2期70卷 1688-1698页

作者： Mondal, subhadeep Laskar, Mostafizur Rahaman Dutta, Amit Kumar Indian Inst Technol Kharagpur GS Sanyal Sch Telecommun Kharagpur 721302 W Bengal India

The quantum search algorithm (QsA) is one of the most recent developments in the era of quantum signal processing (QsP) and quantum information theory (QIT). It shows a faster performance in finding the solutions of system such as multiple-input multiple-output (MIMO) communication system, quantum error correction and others with a polynomial order over the classical one. Grover's algorithm is one of the first proposed QsA in identifying the index number of the solution of a system, whose solutions are known to the oracle. A further improved QsA called Boyer-Brassard-Hoyer-Tapp (BBHT) is followed by the Durr-Hoyer algorithm (DHA), which proposes to find the solutions, while the exact number of the solutions is not known. In this treatise, we propose two modifications to the existing DHA and BBHT algorithms. In DHA, we propose a semi-quantum framework, where after each iteration in DHA, the non-solution points are removed in classical framework. This makes the data set iteratively shorter. In the case of BBHT algorithm, we propose to choose the Grover search number based on the Gamma distribution instead of the uniform one, which gives more chances to the new larger values to improve probability of success. The performance of the proposed QsAs demonstrates plausible improvement in search success performance as compared to their existing BBHT and DHA counterparts. Numerical simulations are conducted with the proposed QsA algorithms on a MIMO orthogonal frequency division multiplexing (OFDM) system to demonstrate the performance improvement.

关键词： Quantum search algorithm (QsA) wireless communication MIMO OFDM grover&apos s algorithm BBHT DHA

来源：评论

学校读者我要写书评

暂无评论

Using small-scale quantum devices to solve algebraic equations

引用

QUANTUM INFORMATION PROCEssING 2021年第4期20卷 1-15页

作者： Li, Hongshu Ma, Zhi Wang, Hong Duan, Qianheng Fei, Yangyang Meng, Xiangdong State Key Lab Math Engn & Adv Comp Zhengzhou 450001 Peoples R China

solving algebraic equations over GF(2) is a problem which has a wide range of applications, including NP-Hard problems and problems related to cryptography. The existing mature algorithms are difficult to solve large-scale problems. Inspired by schoning's algorithm and its quantum version, we apply related methods to solve algebraic equations over GF (2). The new algorithm we proposed has a significant improvement of solving efficiency in large-scale and sparse algebraic equations. As a hybrid algorithm, the new algorithm can not only run on a classic computer alone, but also use small-scale quantum devices to assist acceleration. And the new algorithm can be seen as an example of solving a large-scale problem on a small-scale quantum device.

关键词： schö ning’ s algorithm Algebraic equations small-scale quantum devices

来源：评论

学校读者我要写书评

暂无评论

Compass Construction of Bezier Curves and B-splines

引用

NEXUs NETWORK JOURNAL 2021年第3期23卷 789-811页

作者： Yazar, Tugrul Istanbul Bilgi Univ Fac Architecture Santralistanbul Campus TR-34060 Istanbul Turkey

This article reveals a mathematical bridge between compass-only geometric constructions and parametric curves. A set of construction algorithms are presented which are used to locate points on any Bezier curve or B-spline by using an abstract compass. These constructions aim to translate the B-spline definition of Paul de Casteljau into the modified versions of compass-only constructions explained by Aleksandr Kostovskii. several computer scripts are developed and used to simulate these constructions while calculating and minimizing their computational complexities. The mathematical bridge explained in this article is expected to bring back to mind the synthetic and axiomatic roots of design geometries.

关键词： B-spline Compass-only construction de Casteljau’ s algorithm Bé zier curve Geometrography Architectural geometry

来源：评论

学校读者我要写书评

暂无评论

single-Pulse simultaneous Target Detection and Angle Estimation in a Multichannel Phased Array Radar

引用

IEEE TRANsACTIONs ON sIGNAL PROCEssING 2020年 68卷 6649-6664页

作者： Aubry, Augusto Maio, Antonio De Marano, stefano Rosamilia, Massimo Univ Naples Federico II DIETI Via Claudio 21 I-80125 Naples Italy Univ Salerno Dipartimento Ingn Informaz Elettr & Matemat Appl I-84084 Fisciano Italy

This paper is focused on simultaneous target detection and angle estimation with a multichannel phased array radar. Resorting to a linearized expression for the array steering vector around the beam pointing direction, the problem is formulated as a composite binary hypothesis test where the unknowns, under the alternative hypothesis, include the target directional cosines displacements with respect to the array nominal coarse pointing direction. The problem is handled via the Generalized Likelihood Ratio (GLR) criterion (both one-step and two-step) where decision statistics leveraging the Maximum Likelihood Estimates (MLEs) of the parameters are compared with a detection threshold. If crossed, target presence is declared and the MLEs of the aforementioned displacements directly provide target angular position with respect to the pointing direction. From the analytic point of view, ML estimation involves a constrained fractional quadratic optimization problem whose optimal solution can be found via the Dinkelbach's algorithm or approximated through a fast-converging procedure based on a Coordinate Descent (CD) optimization. The performance analysis of the proposed architectures as well as the corresponding discussion is developed in terms of computational complexity, Constant False Alarm Rate (CFAR) behavior, detection performance, and angular estimation accuracy, also in comparison with some counterparts available in the open literature and theoretical benchmark limits.

关键词： Radar Object detection Optimization Interference Transmission line matrix methods Radar detection Phased arrays Adaptive radar detection dinckebach&apos s algorithm array signal processing

来源：评论

学校读者我要写书评

暂无评论

smart Control of an Electric Vehicle for Ancillary service in DC Microgrid

引用

IEEE ACCEss 2020年 8卷 197222-197235页

作者： Yu, Yue Nduka, Onyema sunday Pal, Bikash C. Imperial Coll London Control & Power Grp London SW7 2AZ England Royal Holloway Univ London Dept Elect Engn London TW20 0EX England

This article presents a two-stage framework for optimal Electric Vehicle (EV) charging/discharging strategy for DC Microgrid (MG) with Distributed Generators (DGs). A multi-objective optimisation task aimed at minimising system losses and EV battery degradation with Vehicle-to-Grid (V2G) peak shaving service has been realised. This coordinated EV integration into the DCMG was formulated as a directed weighted single source shortest path problem that was solved using a modified Dijkstra's algorithm. The weights of the edges were obtained using primal-dual interior point method. The proposed framework has been experimentally verified using simulations with a test DCMG system with practical IEEE European low voltage test feeder load profiles. Results show realisation of peak demand shaving leveraging on EV discharge with minimal on-board battery degradation as well as reduced system losses. It is also shown that the proposed two-stage framework reduces the battery state of charge (sOC) sample space requirements in the analysis, thus, reducing the computational burden.

关键词： Batteries Optimization state of charge Vehicle-to-grid Resistance Load modeling Microgrids EV integration dc microgrid control V2G battery degradation multi-objective optimisation optimal power flow modified Dijkstra’ s algorithm power losses

来源：评论

学校读者我要写书评

暂无评论

Identification of Logic Paths Influenced by severe Coupling Capacitances

引用

JOURNAL OF ELECTRONIC TEsTING-THEORY AND APPLICATIONs 2020年第6期36卷 731-741页

作者： Meza-Ibarra, I. D. Champac, V Gomez-Fuentes, R. Noriega, J. R. Vera-Marquina, A. Univ Sonora Dept Invest Fis Hermosillo Sonora Mexico Natl Inst Astrophys Opt & Elect Puebla Mexico

signals in modern integrated circuits travel through complex interconnect structures, which present several layers and important coupling capacitance effects. Even more, the impact of signal coupling on the overall circuit behavior has grown with technology scaling as the interconnect have become taller. In this paper, a methodology to identify those logic paths more significantly influenced by the coupling capacitances is presented. The proposed methodology is based on a modified Dijkstra's algorithm, which finds those paths between a primary input and a primary output more severely influenced by the coupling capacitances. This methodology can be used to validate circuit behavior and it can also be applied in testing techniques oriented to detect interconnect defects (e.g., opens and short defects). The proposed methodology is applied to IsCAs'85 benchmark circuits to show its feasibility.

关键词： Dijkstra’ s algorithm Coupling capacitances Logic paths IsCAs’ 85 circuits Interconnection lines

来源：评论

学校读者我要写书评

暂无评论

Lattice Reduction Over Imaginary Quadratic Fields

引用

IEEE TRANsACTIONs ON sIGNAL PROCEssING 2020年 68卷 6380-6393页

作者： Lyu, shanxiang Porter, Christian Ling, Cong Jinan Univ Coll Cyber Secur Guangzhou 510632 Peoples R China State Key Lab Cryptol Beijing 100878 Peoples R China Imperial Coll London Dept Elect & Elect Engn London SW7 2AZ England

Complex bases, along with direct-sums defined by rings of imaginary quadratic integers, induce algebraic lattices. In this work, we study such lattices and their reduction algorithms. Firstly, when the lattice is spanned over a two dimensional basis, we show that the algebraic variant of Gauss's algorithm returns a basis that corresponds to the successive minima of the lattice if the chosen ring is Euclidean. secondly, we extend the celebrated Lenstra-Lenstra-Lovasz (LLL) reduction from over real bases to over complex bases. Properties and implementations of the algorithm are examined. In particular, satisfying Lovasz's condition requires the ring to be Euclidean. Lastly, we numerically show the time-advantage of using algebraic LLL by considering lattice bases generated from wireless communications and cryptography.

关键词： Lattices signal processing algorithms Cryptography Information theory Wireless communication Conferences Generators Algebraic lattices euclidean gauss&apos s algorithm LLL lattice reduction

来源：评论

学校读者我要写书评

暂无评论

Global Least squares Path Modeling: A Full-Information Alternative to Partial Least squares Path Modeling

引用

PsYCHOMETRIKA 2020年第4期85卷 947-972页

作者： Hwang, Heungsun Cho, Gyeongcheol McGill Univ Montreal PQ Canada

Partial least squares path modeling has been widely used for component-based structural equation modeling, where constructs are represented by weighted composites or components of observed variables. This approach remains a limited-information method that carries out two separate stages sequentially to estimate parameters (component weights, loadings, and path coefficients), indicating that it has no single optimization criterion for estimating the parameters at once. In general, limited-information methods are known to provide less efficient parameter estimates than full-information ones. To address this enduring issue, we propose a full-information method for partial least squares path modeling, termed global least squares path modeling, where a single least squares criterion is consistently minimized via a simple iterative algorithm to estimate all the parameters simultaneously. We evaluate the relative performance of the proposed method through the analyses of simulated and real data. We also show that from algorithmic perspectives, the proposed method can be seen as a block-wise special case of another full-information method for component-based structural equation modeling-generalized structured component analysis.

关键词： partial least squares path modeling full-information single optimization criterion alternating least squares block-wise generalized structured component analysis component-based structural equation modeling regularized generalized canonical correlation analysis Lohmö ller’ s algorithm Wold’ s algorithm

来源：评论

学校读者我要写书评

暂无评论

HHFDs: Heterogeneous hybridized fuzzy-based Dijkstra's multitask scheduling in WsN

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2021年第3期33卷 e5354-e5354页

作者： Prakash, B. Guru Chelliah, C. Balasubramanian Ramanujam, R. sukumar Sethu Inst Technol Dept Comp Sci & Engn Virudunagar 626115 Tamil Nadu India PSR Engn Coll Dept Comp Sci & Engn Virudunagar Tamil Nadu India Jain Univ Sch Engn & Technol Dept Comp Sci & Engn Bengaluru Karnataka India

Wireless sensor Network (WsN) has to diffuse the independent wireless sensor nodes, which can track the physical or environmental status. In previous works, many issues prevailed with multitask scheduling such as interference, high energy consumption, throughput, etc. Moreover, some issues arise while working with heterogeneous WsN. This work deals with these issues in heterogeneous WsN with aid of the multitask scheduling. For this purpose, a Heterogeneous Hybridized Fuzzy-based (depends on degree of truth) Dijkstra's organizing algorithm (HHFDs) was proposed. This technique integrates light weight characteristics as well as a queuing-based analysis methods, hence identifying the greatest parallel arrangements for which the provided data packet effectively. In this technique, fuzzy Dijkstra's algorithm is hybridized with deep neural network. This also depicts in what way to utilize the identifications outcome with varying data packets and thereby helps with various heterogeneous organizing objectives. The proposed HHFDs algorithm is implemented via the use of the network simulator (Ns2). The results of the proposed and existing methods are measured in terms of the metrics like Energy Consumption, Time Consumption, Transmission Delay, and Average Throughput. The simulation results are depicted as follows and the comparison result shown as follows demonstrates the effectiveness of the proposed algorithm.

关键词： deep neural connections Fuzzy‐ based Dijkstra&apos s algorithm heterogeneous scheduling interference multitask scheduling wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Counting the points on elliptic curves over finite fields

Counting the points on elliptic curves over finite fields

引用

作者： Eržiak, Igor Charles University of Prague

The goal of this thesis is to explain and implement schoof's algorithm for counting points on elliptic curves over finite fields. We start by defining elliptic curve as a set of points satisfying certain equation and then proceeding to define an operation on this set. Theoretical background needed for the algorithm is presented in the second chapter. Finally, the schoof's algorithm is introduced in the third chapter, supplemented by an implementation in sageMath open-source software.

关键词： schoof&apos s algorithm Elliptic curve Division polynomial Frobenius endomorphism

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：