Prompted by the development of algorithms for analysing geometric tolerancing, this article describes a method to determine the Minkowski sum for 3-dimension polytopes. This purposed method is based exclusively on intersection operations on normal cones, using the properties of the normal fan of a Minkowski sum obtained by common refinement of the normal fans of the operands. It can be used to ...

Vector processors reduce the fetch and decode bandwidth as the number of instructions fetched are less. They also exploit data parallelism in large scientific and multimedia applications. Based on how the operands are fetched, vector processors can be divided into two categories in memory-memory architecture operands are directly streamed to the functional units from the memory and results are ...

The rapid moving of computing into multimedia leads computers to include special instructions to support multimedia operations, including those with RISC architectures[5,6]. Multimedia performance now becomes a pseudo-benchmark for modern processors. This paper presents such benchmark in HISC, which stands for Highlevel Instruction Set Computer [1,2]. HISC is a generalpurpose descriptor compute...

This paper deals with a new method for implementing Binary Adders of two operands whose main characteristics are: They are built using only threshold gates; carry output, besides carry input, is used to obtain each sum bit and the total number of gates is a linear function of the number of bits of the operands (n).

Based on branch prediction, value prediction has emerged as a solution for problems caused by true data dependencies in pipelined processors. While predictors have binary outcomes (taken/not taken), face challenging task their can take any value. Because of that, coverage is reduced to enhance high accuracy and minimise costly recovery from misprediction. This paper evaluates focusing instructi...

The paper presents the basic concepts of C+++, an extension of C++ allowing the programmer to define new operator symbols with user-defined priorities by specifying a partial precedence relationship. Furthermore, so-called flexary operators accepting any number of operands and operators with lazily evaluated operands are supported. The latter are particularly useful to implement new kinds of co...

Bootstrapping is a technique that was introduced by Gentry in 2009. It based on reencryption which allows an encryption scheme to perform unlimited number of processing encrypted data. bottleneck the practicability these schemes because multiplication operations are costly complexity. This complexity reduced TFHE bootstrapping result two-bit logic gate thirteen milliseconds using Fast Fourier T...

The technique for hardware multiplication based upon Fourier transformation has been introduced. The technique has the highest efficiency on multiplication units with up to 8 bit range. Each multiplication unit is realized on base of the minimized Boolean functions. Experimental data showed that this technique the multiplication process speed up to 20% higher for 2 − 8 bit range of input operan...