#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1996

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jean-Claude Bajard, Laurent-Stéphane Didier, Peter Kornerup
- IEEE Trans. Computers
- 1997

We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery’s method adapted to mixed radix, and is performed using a Residue Number System. By choosing… (More)

- Jean-Claude Bajard, Laurent-Stéphane Didier, Peter Kornerup
- IEEE Symposium on Computer Arithmetic
- 2001

We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery’s method adapted to residue arithmetic. By choosing the moduli of the RNS system reasonably… (More)

We propose in this paper a new algorithm and architecture for performing divisions in residue number systems. Our algorithm is suitable for residue number systems with large moduli, with the aim of… (More)

Computing cores to be implemented on FPGAs may involve divisions by small integer constants in fixed or floating point. This article presents a family of architectures addressing this need. They are… (More)

- Laurent-Stéphane Didier, Pierre-Yves Rivaille
- IEEE Transactions on Circuits and Systems II…
- 2009

A generalization of a new generic 4-modulus base for residue number systems (RNS) is presented in this paper. An efficient RNS to binary conversion algorithm and a hierarchical architecture for these… (More)

- Benoit Lopez, Thibault Hilaire, Laurent-Stéphane Didier
- Proceedings of the 2012 Conference on Design and…
- 2012

The signal processing and control algorithms are widely based on sum-of-products evaluation. In fixed-point arithmetic, the roundoff errors and coefficient quantization may have an important effect… (More)

- Benoit Lopez, Thibault Hilaire, Laurent-Stéphane Didier
- PECCS
- 2014

This article deals with the fixed-point computation of the sum-of-products, necessary for the implementation of several algorithms, including linear filters. Fixed-point arithmetic implies output… (More)

- Alexandre Chapoutot, Laurent-Stéphane Didier, Fanny Villers
- Proceedings of the 2012 Conference on Design and…
- 2012

Fixed-point arithmetic is widely used in embedded applications because it allows to build compact, fast and low-power application-specific integrated circuits designs. Practically, many of them are… (More)

- Laurent-Stéphane Didier, Fabien Rico
- Numerical Algorithms
- 2004

In this paper, a high radix implementation of the BKM algorithm is introduced. The BKM algorithm is a shift-and-add CORDIC-like algorithm that performs fast computation of complex exponential and… (More)

- Daniel Ménard, Romuald Rocher, +13 authors Christophe Clienti
- Proceedings of the 2012 Conference on Design and…
- 2012

Embedded applications are usually coming with stringent constraints in term of cost, energy consumption and realtime. Consequently, fixed-point arithmetic is mainstream for their implementation into… (More)

- ‹
- 1
- ›