Page 1

Displaying 1 – 2 of 2

Showing per page

Hierarchical residue number systems with small moduli and simple converters

Tadeusz Tomczak (2011)

International Journal of Applied Mathematics and Computer Science

In this paper, a new class of Hierarchical Residue Number Systems (HRNSs) is proposed, where the numbers are represented as a set of residues modulo factors of 2k ± 1 and modulo 2k . The converters between the proposed HRNS and the positional binary number system can be built as 2-level structures using efficient circuits designed for the RNS (2k-1, 2k, 2k+1). This approach allows using many small moduli in arithmetic channels without large conversion overhead. The advantages resulting from the...

How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations

Sid-Ahmed-Ali Touati, Sébastien Briais, Karine Deschinkel (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Usual periodic scheduling problems deal with precedence constraints having non-negative latencies. This seems a natural way for modelling scheduling problems, since task delays are generally non-negative quantities. However, in some cases, we need to consider edges latencies that do not only model task latencies, but model other precedence constraints. For instance in register optimisation problems devoted to optimising compilation, a generic machine or processor model can allow considering access...

Currently displaying 1 – 2 of 2

Page 1