Computer Arithmetic Adapting to a Changing World

A special issue of Informatics (ISSN 2227-9709).

Deadline for manuscript submissions: closed (30 June 2023) | Viewed by 5154

Special Issue Editor

Electrical and Computer Engineering, Texas A&M University, College Station, TX 77843, USA
Interests: parallel/distributed processing; computer architectures/applications; computational geometry; computer arithmetic; VLSI algorithms; AI; wireless mobile networks

Special Issue Information

Dear Colleagues,

Computer arithmetic has significantly enhanced the power of digital computers, while the rapid development of digital computing has presented new technology challenges to computer arithmetic, which has seen advances in its theory, analysis, modeling, regularity, and processing. With the tracks and reflection to traditional and emerging computational paradigms, the methodologies for the exploration, representation, and management of our data implied knowledges have been promoted. The influences extend to academia, industry, and defense applications, including quality improvement and risk minimization. This Special Issue invites submissions of research articles describing recent discoveries on all aspects related to computer arithmetic, including but is not restricted to the following topics:

  • New arithmetic paradigms (algorithms, architectures, and implementations);
  • Innovative number systems and their applications;
  • Special function implementations;
  • Test and validation, for arithmetic architectures and implementations;
  • Floating-point units and algorithms, and their application in emerging domains;
  • Low-power arithmetic units and processors;
  • Arithmetic for FPGAs and reconfigurable logic;
  • Computer arithmetic for approximate computing, or to enhance accuracy or reliability;
  • Computer arithmetic for security and cryptography;
  • Special arithmetic applications in the Internet of Things, artificial intelligence, neural networks, machine/deep learning, big data analytics, signal processing, computer graphics, multimedia, computer vision, distributed and parallel computing, finance, etc.;
  • Non-conventional computer arithmetic, and computer arithmetic for emerging technologies.

Dr. Mi Lu
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Informatics is an international peer-reviewed open access quarterly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1800 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • algorithms
  • architectures
  • function evaluation
  • multiplication–addition validation
  • heuristics
  • cryptography
  • function-evaluation
  • floating/fixed point
  • power efficiency
  • FPGA
  • artificial intelligence
  • machine/deep-learning
  • HPC
  • residue/logarithmic number systems
  • precision rounding

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

26 pages, 3042 KiB  
Article
Revising the Classic Computing Paradigm and Its Technological Implementations
by János Végh
Informatics 2021, 8(4), 71; https://doi.org/10.3390/informatics8040071 - 25 Oct 2021
Cited by 4 | Viewed by 2522
Abstract
Today’s computing is based on the classic paradigm proposed by John von Neumann, three-quarters of a century ago. That paradigm, however, was justified for (the timing relations of) vacuum tubes only. The technological development invalidated the classic paradigm (but not the model!). It [...] Read more.
Today’s computing is based on the classic paradigm proposed by John von Neumann, three-quarters of a century ago. That paradigm, however, was justified for (the timing relations of) vacuum tubes only. The technological development invalidated the classic paradigm (but not the model!). It led to catastrophic performance losses in computing systems, from the operating gate level to large networks, including the neuromorphic ones. The model is perfect, but the paradigm is applied outside of its range of validity. The classic paradigm is completed here by providing the “procedure” missing from the “First Draft” that enables computing science to work with cases where the transfer time is not negligible apart from the processing time. The paper reviews whether we can describe the implemented computing processes by using the accurate interpretation of the computing model, and whether we can explain the issues experienced in different fields of today’s computing by omitting the wrong omissions. Furthermore, it discusses some of the consequences of improper technological implementations, from shared media to parallelized operation, suggesting ideas on how computing performance could be improved to meet the growing societal demands. Full article
(This article belongs to the Special Issue Computer Arithmetic Adapting to a Changing World)
Show Figures

Figure 1

18 pages, 1449 KiB  
Article
Exact Analysis of the Finite Precision Error Generated in Important Chaotic Maps and Complete Numerical Remedy of These Schemes
by Constantinos Chalatsis, Constantin Papaodysseus, Dimitris Arabadjis, Athanasios Rafail Mamatsis and Nikolaos V. Karadimas
Informatics 2021, 8(3), 54; https://doi.org/10.3390/informatics8030054 - 15 Aug 2021
Viewed by 1817
Abstract
A first aim of the present work is the determination of the actual sources of the “finite precision error” generation and accumulation in two important algorithms: Bernoulli’s map and the folded Baker’s map. These two computational schemes attract the attention of a growing [...] Read more.
A first aim of the present work is the determination of the actual sources of the “finite precision error” generation and accumulation in two important algorithms: Bernoulli’s map and the folded Baker’s map. These two computational schemes attract the attention of a growing number of researchers, in connection with a wide range of applications. However, both Bernoulli’s and Baker’s maps, when implemented in a contemporary computing machine, suffer from a very serious numerical error due to the finite word length. This error, causally, causes a failure of these two algorithms after a relatively very small number of iterations. In the present manuscript, novel methods for eliminating this numerical error are presented. In fact, the introduced approach succeeds in executing the Bernoulli’s map and the folded Baker’s map in a computing machine for many hundreds of thousands of iterations, offering results practically free of finite precision error. These successful techniques are based on the determination and understanding of the substantial sources of finite precision (round-off) error, which is generated and accumulated in these two important chaotic maps. Full article
(This article belongs to the Special Issue Computer Arithmetic Adapting to a Changing World)
Show Figures

Figure 1

Back to TopTop