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

ROUNDOFF ERROR ANALYSIS OF THE DISCRETE WIGNER DISTRIBUTION USING fixed-point arithmetic

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1991年第9期39卷 2096-2098页

作者： GRIFFIN, C RAO, P TAYLOR, F Department of Electrical Engineering University of Florida Gainesville FL USA

The Wigner distribution (WD) is a powerful and fundamental time-frequency representation. The WD is now being considered for a number of real-time signal and image processing applications. However, to achieve a high bandwidth digital implementation, fixed-point arithmetic is generally required with the attendant quantization errors. This correspondence concerns roundoff error analysis of the discrete Wigner algorithm using fixed-point arithmetic. The error analysis is based on a statistical approach with the measure of error being the noise-to-signal ratio. Theoretical noise-to-signal ratios are derived and then verified through experimental simulations.

关键词： Roundoff errors Error analysis fixed-point arithmetic Signal analysis Algorithm design and analysis Signal to noise ratio Time frequency analysis Bandwidth Speech analysis Frequency domain analysis

来源：评论

学校读者我要写书评

暂无评论

Offline geometric parameters for automatic signature verification using fixed-point arithmetic

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2005年第6期27卷 993-997页

作者： Ferrer, MA Alonso, JB Travieso, CM Univ Las Palmas Gran Canaria Dept Senales & Comunicac E-35017 Las Palmas Gran Canaria Spain

This paper presents a set of geometric signature features for offline automatic signature verification based on the description of the signature envelope and the interior stroke distribution in polar and Cartesian coordinates. The features have been calculated using 16 bits fixed-point arithmetic and tested with different classifiers, such as hidden Markov models, support vector machines, and Euclidean distance classifier. The experiments have shown promising results in the task of discriminating random and simple forgeries.

关键词： automatic signature verification (ASV) hidden Markov models (HMM) support vector machines (SVM) fixed-point arithmetic

来源：评论

学校读者我要写书评

暂无评论

Feedback decoding of fixed-point arithmetic convolutional codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2004年第6期52卷 857-860页

作者： Redinbo, GR Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

Convolutional codes defined over the integers modulo a power of two, an arithmetic structure used for fixed-point arithmetic computations, employ well-known binary convolutional codes as their underlying generators. A recursive decoding technique that exploits binary expansion components of the code symbols uses any binary decoding algorithm valid for the underlying code.

关键词： convolutional codes over integers feedback decoding fixed-point arithmetic free modules real number codes

来源：评论

学校读者我要写书评

暂无评论

Unkeyed hash function based on chaotic sponge construction and fixed-point arithmetic

引用

NONLINEAR DYNAMICS 2020年第1期100卷 713-729页

作者： Teh, Je Sen Alawida, Moatsum Ho, Jia Jie Univ Sains Malaysia Sch Comp Sci Gelugor 11800 Pulau Pinang Malaysia

Chaotic maps have various properties that mirror the security requirements of cryptographic algorithms. As such, researchers have utilized them in the design of algorithms such as hash functions. Although there exist a wide range of chaos-based hash functions in literature, most of them are designed in an ad hoc manner rather than relying on well-established design paradigms. In addition, they are commonly implemented using floating-point operations which are inefficient as compared to their bitwise counterparts. The combination of convoluted designs and floating-point representation also leads to hash functions that are difficult to analyze;therefore, claims of security cannot be verified easily. These issues are some of the reasons why chaos-based hash functions have not seen widespread use in practice. This paper proposes a new unkeyed hash function based on a chaotic sponge construction and fixed-point arithmetic to overcome the aforementioned problems. The use of a sponge construction provides provable security justifications, whereas the use of fixed-point arithmetic allows chaotic map operations to be implemented using bitwise operations. The combination of these design elements leads to a design that is both efficient and facilitates future cryptanalysis for security verification. Security and performance evaluations indicate that the proposed hash function has near-ideal diffusion, confusion, collision resistance, and distribution properties in addition to a hashing speed that is at least on par with the current state of the art in chaos-based hash functions.

关键词： Digital chaotic map Cryptography fixed-point arithmetic Hash function Sponge construction Tent map

来源：评论

学校读者我要写书评

暂无评论

Implementation of Dynamic Matrix Control Algorithm Using a Microcontroller with fixed-point arithmetic

引用

International Conference Challenges in Automation, Robotics and Measurement Techniques (Automation)

作者： Chaber, Patryk Warsaw Univ Technol Inst Control & Computat Engn Ul Nowowiejska 15-19 PL-00665 Warsaw Poland

ISBN: (纸本)9783319293578;9783319293561

The aim of this paper is to describe software implementation of the Dynamic Matrix Control (DMC) algorithm using a microcontroller with fixed-point arithmetic. A 32-bit RISC ARM platform is used, which is cheap, but quite a powerful hardware system. To prevent register overflow and drastic loss of precision, a partial shifting of values technique is performed. The DMC algorithm with fixed-point arithmetic is applied to a laboratory thermal process and the obtained results are compared with those of the DMC algorithm implemented in floating-point arithmetic.

关键词： Model predictive control Dynamic model control fixed-point arithmetic Microcontroller

来源：评论

学校读者我要写书评

暂无评论

Accuracy Evaluation of Long Short Term Memory Network Based Language Model with fixed-point arithmetic 13th

Accuracy Evaluation of Long Short Term Memory Network Based ...

引用

13th International Symposium on Applied Reconfigurable Computing (ARC)

作者： Jin, Ruochun Jiang, Jingfei Dou, Yong Natl Univ Def Technol Natl Lab Parallel & Distributed Proc Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9783319562582;9783319562575

Long Short Term Memory network based language models are state-of-art techniques in the field of natural language processing. Training LSTM networks is computationally intensive, which naturally results in investigating FPGA acceleration where fixed-point arithmetic is employed. However, previous studies have focused only on accelerators using some fixed bit-widths without thorough accuracy evaluation. The main contribution of this paper is to demonstrate the bit-width effect on the LSTM based language model and the tanh function approximation in a comprehensive way by experimental evaluation. Theoretically, the 12-bit number with 6-bit fractional part is the best choice balancing the accuracy and the storage saving. Gaining similar performance to the software implementation and fitting the bit-widths of FPGA primitives, we further propose a mixed bit-widths solution combing 8-bit numbers and 16-bit numbers. With clear trade-off in accuracy, our results provide a guide to inform the design choices on bit-widths when implementing LSTMs in FPGAs. Additionally, based on our experiments, it is amazing that the scale of the LSTM network is irrelevant to the optimum fixed-point configuration, which indicates that our results are applicable to larger models as well.

关键词： LSTM network fixed-point arithmetic Bit-width FPGA

来源：评论

学校读者我要写书评

暂无评论

An Efficient Scheduling Architecture for QR Decomposition Using fixed-point arithmetic for Detection of STBC-VBLAST Codes

An Efficient Scheduling Architecture for QR Decomposition Us...

引用

20th International Conference on Computer Communications and Networks (ICCCN)

作者： Cortez, Joaquin Bazdresch, Miguel Torres, Deni Ruiz-Ibarra, Erica Department of Electrical Engineering ITSON University Mexico Department of Electronics Systems and Computer Science ITESO University Mexico Department of Electrical Engineering CINVESTAV-IPN Mexico

ISBN: (纸本)9781457706387

In this work we propose a low complexity detector for hybrid MIMO space-time codes based on linear dispersion coding. This detector is designed for systems with fewer receiver than transmitter antennas. We also present a fast, scalable hardware architecture (suitable for FPGA implementation) that performs the matrix inversion required by the detector. This architecture is based on the QR matrix decomposition, implemented with a low-complexity, parallel and pipelined CORDIC with fixed-point arithmetic. This results in a 60% reduction in complexity, compared with other reported algorithms. We show that the proposed detector achieves better bit-error rates than comparable double-space-time transmit diversity (DSTTD) fixed-point detectors.

关键词： MIMO QR-RLS Givens Rotation MGS Algorithm CORDIC DSTTD fixed-point arithmetic

来源：评论

学校读者我要写书评

暂无评论

ROUNDOFF NOISE AND ATTENUATION SENSITIVITY IN DIGITAL FILTERS WITH fixed-point arithmetic

引用

IEEE TRANSACTIONS ON CIRCUIT THEORY 1973年第2期CT20卷 174-175页

作者： FETTWEIS, A UNIV BOCHUM BOCHUMWEST GERMANY

A general expression is established which relates the output roundoff noise generated by a fixed-point multiplier in a digital filter to the sensitivity of the filter attenuation with respect to the corresponding multiplier coefficient. It confirms that filters with low sensitivity of the attenuation also produce less roundoff noise.

关键词： Attenuation Digital filters fixed-point arithmetic Equations Noise generators Spline Circuit theory Circuit noise Frequency Design methodology

来源：评论

学校读者我要写书评

暂无评论

Error Distribution Estimation for fixed-point arithmetic using Program Derivatives 25

Error Distribution Estimation for Fixed-point Arithmetic usi...

引用

25th International Symposium on Quality Electronic Design (ISQED)

作者： Akiyama, Soramichi Shioya, Ryota Miyatake, Yuto Yang, Tongxin Ritsumeikan Univ Coll Informat Sci & Engn Osaka Japan Univ Tokyo Grad Sch Informat Sci & Technol Tokyo Japan Osaka Univ Cybermedia Ctr Osaka Japan Sony Semicond Solut Corp Atsugi Kanagawa Japan Univ Tokyo Tokyo Japan

ISBN: (纸本)9798350309270;9798350309287

fixed-point arithmetic is widely used because of its efficiency in latency, area, and power consumption. However, determining the number of bits assigned to each variable while considering the balance of efficiency and the error of the program output is challenging. To ease this burden, we (1) propose a new method that estimates the statistical error distributions of the program output when fixed-point arithmetic is used, and (2) implement an error estimation system for HLS programs based on our method. The main idea is to apply an error propagation model based on program derivatives to the distributions of data and their errors. This achieves estimating not only the range of the errors but also the statistical aspects of them without feeding a lot of input data to the program. Furthermore, the input data and their errors can be tweaked at the distribution level, allowing an easy-to-conduct robustness analysis of chosen precision. Our experiments show that our method can estimate error distributions for various operators and a realistic application well, and the estimated results can be used for different types of analyses that help the user determine precision in fixed-point arithmetic.

关键词： fixed-point arithmetic Error Estimation Program Derivatives

来源：评论

学校读者我要写书评

暂无评论

Automated Synthesis of Target-Dependent Programs for Polynomial Evaluation in fixed-point arithmetic 16

Automated Synthesis of Target-Dependent Programs for Polynom...

引用

16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

作者： Mouilleron, Christophe Najahi, Amine Revy, Guillaume ENSIIE F-91025 Evry France Univ Perpignan DALI F-66860 Perpignan France Univ Montpellier 2 LIRMM UMR 5506 F-34095 Montpellier France LIRMM CNRS UMR 5506 F-34095 Montpellier France

ISBN: (纸本)9781479984480

The design of both fast and numerically accurate programs is a real challenge. Thus, the CGPE tool was introduced to assist programmers in synthesizing fast and numerically certified codes in fixed-point arithmetic for the particular case of polynomial evaluation. For performance purposes, this tool produces programs using exclusively unsigned arithmetic and addition/subtraction or multiplication operations, thus requiring some constraints on the fixed-point operands. These choices are well-suited when dealing with the implementation of certain mathematical functions, however they prevent from tackling a broader class of polynomial evaluation problems. In this paper, we first expose a rigorous arithmetic model for CGPE that takes into account signed arithmetic. Then, in order to make the most out of advanced instructions, we enhance this tool with a multi-criteria instruction selection module. This allows us to optimize the generated codes according to different criteria, like operation count, evaluation latency, or accuracy. Finally, we illustrate this technique on operation count, and we show that it yields an average reduction of up to 22.3% of the number of operations in the synthesized codes of some functions. We also explicit practical examples to show the impact of using accuracy based rather than latency based instruction selection.

关键词： fixed-point arithmetic automated code synthesis error analysis polynomial evaluation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：