A parallel search algorithm for CLNS addition optimization

— 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.

• Type: Conference
• Year: 2006
• Where: ISCAS
• Authors: Panagiotis D. Vouzis, Mark G. Arnold
• Keywords: Algorithm Offer Memory, CLNS Addition Algorithm, ISCAS 2006, Multiple Memories