Loading [a11y]/accessibility-menu.js
A parallel search algorithm for CLNS addition optimization | IEEE Conference Publication | IEEE Xplore

A parallel search algorithm for CLNS addition optimization


Abstract:

We present analytical formulas for the calculation of the memory requirements for a system using the complex logarithmic number system (CLNS). Certain properties of the C...Show More

Abstract:

We present analytical formulas for the calculation of the memory requirements for a system using the complex logarithmic number system (CLNS). Certain properties of the CLNS addition algorithm allow replacement of a large memory by smaller multiple memories and combinational circuitry. The multiple memories combined with a parallel search algorithm offer memory savings up to 90% at the cost of extra hardware. However, depending on the particular case, there is a tradeoff between memory and combinational logic used
Date of Conference: 21-24 May 2006
Date Added to IEEE Xplore: 11 September 2006
Print ISBN:0-7803-9389-9

ISSN Information:

Conference Location: Kos, Greece

References

References is not available for this document.