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

Implementation of the Distributed fixed-point algorithm and Its Application 1

17th Annual International Symposium on Knowledge and Systems Sciences (KSS)

作者： Wu, Zhengtian Shi, Qinfen Yu, Yu Xia, Haili Yang, Hongyan Suzhou Univ Sci & Technol Suzhou Peoples R China Nanjing Audit Univ Nanjing Jiangsu Peoples R China

ISBN: (数字)9789811028571

ISBN: (纸本)9789811028571;9789811028564

A implementation of the distributed Dang and Ye's fixed-point algorithm, which is a new alternative algorithm for integer programming, is developed in this paper. This fixed-point algorithm is derived from an increasing mapping which satisfies certain properties. A classical problem, which is called market split problem, has been solved by this distributed implementation. It is shown that this implementation is effective in numerical results. Besides, it can be used to other similar integer problems.

关键词： fixed-point algorithm Increasing mapping Integer programming Market split problem

来源：评论

学校读者我要写书评

暂无评论

Design and FPGA Implementation of a Universal Chaotic Signal Generator Based on the Verilog HDL fixed-point algorithm and State Machine Control

引用

INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS 2017年第3期27卷 1750040-1750040页

作者： Qiu, Mo Yu, Simin Wen, Yuqiong Lu, Jinhu He, Jianbin Lin, Zhuosheng Guangdong Univ Technol Coll Automat Guangzhou 510006 Guangdong Peoples R China Chinese Acad Sci Acad Math & Syst Sci Inst Syst Sci Beijing 100190 Peoples R China

In this paper, a novel design methodology and its FPGA hardware implementation for a universal chaotic signal generator is proposed via the Verilog HDL fixed-point algorithm and state machine control. According to continuous-time or discrete-time chaotic equations, a Verilog HDL fixed-point algorithm and its corresponding digital system are first designed. In the FPGA hardware platform, each operation step of Verilog HDL fixed-point algorithm is then controlled by a state machine. The generality of this method is that, for any given chaotic equation, it can be decomposed into four basic operation procedures, i.e. nonlinear function calculation, iterative sequence operation, iterative values right shifting and ceiling, and chaotic iterative sequences output, each of which corresponds to only a state via state machine control. Compared with the Verilog HDL floating-point algorithm, the Verilog HDL fixed-point algorithm can save the FPGA hardware resources and improve the operation efficiency. FPGA-based hardware experimental results validate the feasibility and reliability of the proposed approach.

关键词： Chaotic system fixed-point algorithm state machine control Verilog HDL FPGA implementation

来源：评论

学校读者我要写书评

暂无评论

A new fixed-point algorithm to solve the blade element momentum equations with high robustness

引用

ENERGY SCIENCE & ENGINEERING 2021年第10期9卷 1734-1746页

作者： Jin, Meng Yang, Xiaogang Univ Nottingham Ningbo China Dept Mech Mat & Mfg Engn Ningbo Peoples R China

The most common approach to solving blade element momentum (BEM) equations is through fixed point method. The fixed point method can provide reliable solutions with high precision, yet the robustness of the method has been challenged when infrequent failures of converging to a physical solution are found for some design space. Though the lack of robustness is alleviated by applying two improved algorithms, their shortcomings should not be of an understatement. Ning's method can result in a converged yet nonphysical solution, and Sun's method decreases the computational efficiency remarkably. To overcome these setbacks, a new algorithm has been proposed in this paper. A clear classification of a wind turbine operating states has been given first to correct the thrust relation for a > 1, followed by discussions of three failure cases encountered during solving BEM equations. Then, the new algorithm with three major modifications has been introduced and explained. The test of Section 4 reveals that the decreasing rf technique has a positive effect on improving the robustness. Besides, the first two tests in Section 5 prove that the new thrust equation can greatly enhance the robustness, and Aitken's squared process can significantly strengthen the efficiency. The results show that all three modifications contribute to offering a new FPA with high robustness and satisfactory computing efficiency, which serves as the best option for solving the BEM equations.

关键词： blade element momentum equations fixed-point algorithm robustness and convergence wind turbine

来源：评论

学校读者我要写书评

暂无评论

An adaptive fixed-point proximity algorithm for solving total variation denoising models

引用

INFORMATION SCIENCES 2017年 402卷 69-81页

作者： Wang, Jin-He Meng, Fan-Yun Pang, Li-Ping Hao, Xing-Hua Huzhou Univ Sch Engn Huzhou 313000 Peoples R China Qingdao Technol Univ Comp Engn Inst Qingdao 266033 Peoples R China Dalian Univ Technol Sch Math Sci Dalian 116024 Peoples R China

We study an adaptive fixed-point proximity algorithm to solve the total variation denoising model. The objective function is a sum of two convex functions and one of them is composed by an affine transformation, which is usually a regularization term. By decoupiing and splitting, the problem is changed into two subproblems. Due to the nonsmooth and nondifferentiability of the subproblem, we solve its proximity minimization problem instead of the original one. To overcome the "staircase" effect during the process of denoising, an adaptive criterion on proximity parameters is put forward. At last we apply the improved algorithm to solve the isotropic total variation denoising model. The numerical results are given to illustrate the efficiency of the algorithm. (C) 2017 Elsevier Inc. All rights reserved.

关键词： ROF total variation fixed-point algorithm Split Bregman Image denoising

来源：评论

学校读者我要写书评

暂无评论

A content-adaptive unstructured grid based regularized CT reconstruction method with a SART-type preconditioned fixed-point proximity algorithm

引用

INVERSE PROBLEMS 2022年第3期38卷 035005-035005页

作者： Chen, Yun Lu, Yao Ma, Xiangyuan Xu, Yuesheng Xiangtan Univ Sch Math & Computat Sci Xiangtan 411105 Peoples R China Old Dominion Univ Dept Math & Stat Norfolk VA 23529 USA Sun Yat Sen Univ Guangdong Prov Key Lab Computat Sci Guangzhou 510006 Peoples R China Sun Yat Sen Univ Sch Comp Sci & Engn Guangzhou 510006 Peoples R China Shanghai Univ Med & Hlth Sci Shanghai Key Lab Mol Imaging Shanghai 201318 Peoples R China Shantou Univ Dept Biomed Engn Coll Engn Shantou 515063 Peoples R China

The goal of this study is to develop a new computed tomography (CT) image reconstruction method, aiming at improving the quality of the reconstructed images of existing methods while reducing computational costs. Existing CT reconstruction is modeled by pixel-based piecewise constant approximations of the integral equation that describes the CT projection data acquisition process. Using these approximations imposes a bottleneck model error and results in a discrete system of a large size. We propose to develop a content-adaptive unstructured grid (CAUG) based regularized CT reconstruction method to address these issues. Specifically, we design a CAUG of the image domain to sparsely represent the underlying image, and introduce a CAUG-based piecewise linear approximation of the integral equation by employing a collocation method. We further apply a regularization defined on the CAUG for the resulting ill-posed linear system, which may lead to a sparse linear representation for the underlying solution. The regularized CT reconstruction is formulated as a convex optimization problem, whose objective function consists of a weighted least square norm based fidelity term, a regularization term and a constraint term. Here, the corresponding weighted matrix is derived from the simultaneous algebraic reconstruction technique (SART). We then develop a SART-type preconditioned fixed-point proximity algorithm to solve the optimization problem. Convergence analysis is provided for the resulting iterative algorithm. Numerical experiments demonstrate the superiority of the proposed method over several existing methods in terms of both suppressing noise and reducing computational costs. These methods include the SART without regularization and with the quadratic regularization, the traditional total variation (TV) regularized reconstruction method and the TV superiorized conjugate gradient method on the pixel grid.

关键词： CT reconstruction integral equation unstructured grid regularization precondition fixed-point algorithm

来源：评论

学校读者我要写书评

暂无评论

Complex quantized minimum error entropy with fiducial points: theory and application in model regression

引用

NEURAL NETWORKS 2025年 187卷 107305页

作者： Lin, Bingqing Qian, Guobing Ruan, Zongli Qian, Junhui Wang, Shiyuan Southwest Univ Coll Elect & Informat Engn Chongqing 400715 Peoples R China China Univ Petr Coll Sci Qingdao 266580 Peoples R China Chongqing Univ Sch Microelect & Commun Engn Chongqing 400030 Peoples R China

Minimum error entropy with fiducial points (MEEF) has gained significant attention due to its excellent performance in mitigating the adverse effects of non-Gaussian noise in the fields of machine learning and signal processing. However, the original MEEF algorithm suffers from high computational complexity due to the double summation of error samples. The quantized MEEF (QMEEF), proposed by Zheng et al. alleviates this computational burden through strategic quantization techniques, providing a more efficient solution. In this paper, we extend the application of these techniques to the complex domain, introducing complex QMEEF (CQMEEF). We theoretically introduce and prove the fundamental properties and convergence of CQMEEF. Furthermore, we apply this novel method to the training of a range of Linear-in-parameters (LIP) models, demonstrating its broad applicability. Experimental results show that CQMEEF achieves high precision in regression tasks involving various noise-corrupted datasets, exhibiting effectiveness under unfavorable conditions, and surpassing existing methods across critical performance metrics. Consequently, CQMEEF not only offers an efficient computational alternative but also opens up new avenues for dealing with complex data in regression tasks.

关键词： fixed-point algorithm Quantized technique Regression analysis Linear-in-parameters (LIP) model Convergence Complex domain

来源：评论

学校读者我要写书评

暂无评论

fixed-point algorithms for solving the critical value and upper tail quantile of Kuiper's statistics

引用

HELIYON 2024年第7期10卷 e28274页

作者： Zhang, Hong-Yan Sun, Wei Chen, Xiao Lin, Rui-Jia Zhou, Yu Hainan Normal Univ Sch Informat Sci & Technol 99 Rd LongKun South Haikou 571158 Peoples R China Xiamen Haicang Yunjing Expt Middle Sch 99 Rd Yunmei Xiamen 361026 Peoples R China Hainan Normal Univ Informat Network & Data Ctr 99 Rd LongKun South Haikou 571158 Peoples R China

Kuiper's statistic is a good measure for the difference of ideal distribution and empirical distribution in the goodness -of -fit test. However, it is a challenging problem to solve the critical value and upper tail quantile, or simply Kuiper pair, of Kuiper's statistics due to the difficulties of solving the nonlinear equation and reasonable approximation of infinite series. In this work, the contributions lie in three perspectives: firstly, the second order approximation for the infinite series of the cumulative distribution of the critical value is used to achieve higher precision;secondly, the principles and fixed-point algorithms for solving the Kuiper pair are presented with details;finally, finally, a mistake about the critical value c n a for ( a, n ) = (0 . 01 , 30) in Kuiper's distribution table has been labeled and corrected where n is the sample capacity and a is the upper tail quantile. The algorithms are verified and validated by comparing with the table provided by Kuiper. The methods and algorithms proposed are enlightening and worth of introducing to the college students, computer programmers, engineers, experimental psychologists and so on.

关键词： Kuiper's statistic Upper tail quantile fixed-point algorithm Numerical approximation algorithm design STEM education

来源：评论

学校读者我要写书评

暂无评论

RATE OF CONVERGENCE OF THE GENERALIZED NEWTON algorithm USING THE fixed-point APPROACH

引用

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 1984年第4期43卷 543-555页

作者： KALABA, R TISHLER, A WANG, JS NANJING UNIV DEPT MATHNANJINGPEOPLES R CHINA TEL AVIV UNIV FAC MANAGEMENTIL-69978 TEL AVIVISRAEL

This paper shows that the generalized Newton algorithm [GN(r)], developed by Kalaba and Tishler (Ref. 1), can be described as a fixed-point algorithm. In addition to specifying sufficient conditions for convergence of the GN(r), we show that, forr=1, 2, 3, its rate of convergence increases with the order of the derivatives which are used.

关键词： Generalized Newton algorithm fixed-point algorithm higher-order derivatives rate of convergence

来源：评论

学校读者我要写书评

暂无评论

A fixed-point nonlinear PCA algorithm for blind source separation

引用

NEUROCOMPUTING 2005年第1-3期69卷 264-272页

作者： Zhu, XL Ye, JM Zhang, XD Tsinghua Univ Dept Automat Beijing 100084 Peoples R China Xidian Univ Key Lab Radar Signal Proc Xian 710071 Peoples R China

This paper addresses the problem of blind source separation and, presents a fixed-point nonlinear principal component analysis (NPCA) algorithm. It is a block-wise batch algorithm and gives an alternative perspective on existing adaptive online NPCA algorithms. Utilizing new activation functions that automatically satisfy a stability condition, the proposed algorithm can separate mixed signals with sub- and super-Gaussian source distributions. The efficiency is confirmed by extensive computer simulations on man-made sources as well as practical speech signals. (c) 2005 Elsevier B.V. All rights reserved.

关键词： blind source separation nonlinear principal component analysis independent component analysis fixed-point algorithm

来源：评论

学校读者我要写书评

暂无评论

Fast fixed-point Bicubic Interpolation algorithm on FPGA 5

Fast Fixed-point Bicubic Interpolation Algorithm on FPGA

引用

IEEE Nordic Circuits and Systems Conference (NORCAS) NORCHIP / International Symposium of System-on-Chip (SoC)

作者： Koljonen, Janne Bochko, Vladimir A. Lauronen, Sami J. Alander, Jarmo T. Univ Vaasa Sch Technol & Innovat Vaasa Finland

ISBN: (纸本)9781728127699

We propose a fast fixed-point algorithm for bicubic interpolation on FPGA. Bicubic interpolation algorithms on FPGA are mainly used in image processing systems and based on floating-point calculation. In these systems, calculations are synchronized with the frame rate and reduction of computation time is achieved designing a particular hardware architecture. Our system is intended to work with images or other similar applications like industrial control systems. The fast and energy efficient calculation is achieved using a fixed-point implementation. We obtained a maximum frequency of 27.26 MHz, a relative quantization error of 0.36% with the fractional number of bits being 7, logic utilization of 8%, and about 30% of energy saving in comparison with a C-program on the embedded HPS for the popular Matlab test function Peaks(25,25) data on SoCkit development kit (Terasic), chip: Cyclone V, 5CSXFC6D6F31C8. The experiments confirm the feasibility of the proposed method.

关键词： control fixed-point algorithm bicubic interpolation FPGA energy efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：