A scaling-less Newton-Raphson pipelined implementation for a fixed-point inverse square root operator

Erwan Libessart (1, 2) , Matthieu Arzel (3, 2, 4) , Cyril Lahuec (3, 2, 4) , Francesco Andriulli (1, 5)

1 Lab-STICC_IMTA_MOM_PIM
2 IMT Atlantique - ELEC - Département Electronique
3 Lab-STICC_IMTA_CACS_IAS
4 Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
5 IMT Atlantique - MO - Département Micro-Ondes

The inverse square root is a common operation in digital signal processing architectures, in particular when matrix inversions are required. The Newton-Raphson algorithm is usually used, either in floating or in fixed-point formats. With the former format, the well-known fast inverse square root computation is based on a 32-bit integer constant, which is allowed by the standardized format of the mantissa. For the fixed-point format, there are many possibilities, which usually force a design with scaling of the input in order to respect a pre-determined work range. Having the input in a known range makes it possible to compute a first approximation with coefficients stored in memory. In this paper, a novel generic architecture which does not require scaling is proposed. This design is totally pipelined, ROM-less and can be directly used in any architecture. The implementation is optimized to reach the maximum clock frequency offered by the DSP cells of Xilinx FPGAs. This frequency is higher than the one available by using memory blocks.

Domaines: Electronique; Traitement du signal et de l'image [eess.SP]

Erwan Libessart, Matthieu Arzel, Cyril Lahuec, Francesco Andriulli. A scaling-less Newton-Raphson pipelined implementation for a fixed-point inverse square root operator. NEWCAS 2017 : 15th IEEE International New Circuits and Systems Conference, Jun 2017, Strasbourg, France. ⟨10.1109/NEWCAS.2017.8010129⟩. ⟨hal-01617301⟩