Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

ISCAS
2006
IEEE

favoriteEmaildiscussreport

77views Hardware» more ISCAS 2006»

A parallel search algorithm for CLNS addition optimization

14 years 4 months ago

A parallel search algorithm for CLNS addition optimization

Download www.cse.lehigh.edu

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

Panagiotis D. Vouzis, Mark G. Arnold

Real-time Traffic

Algorithm Offer Memory | CLNS Addition Algorithm | ISCAS 2006 | Multiple Memories |

claim paper

Related Content

» Parallel Search for Combinatorial Optimization Genetic Algorithms Simulated Annealing Tabu...

» A DecoderBased Evolutionary Algorithm for Constrained Parameter Optimization Problems

» Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions

» Fast Parallel Similarity Search in Multimedia Databases

» Evolving Dynamic Change and Exchange of Genotype Encoding in Genetic Algorithms for Diffic...

» Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm

» A Parallel Tabu Search Algorithm For The 01 Multidimensional Knapsack Problem

» Parallel hybrid evolutionary algorithms on GPU

» A Parallel Algorithm for CompileTime Scheduling of Parallel Programs on Multiprocessors

Post Info
More Details (n/a)

Added	12 Jun 2010
Updated	12 Jun 2010
Type	Conference
Year	2006
Where	ISCAS
Authors	Panagiotis D. Vouzis, Mark G. Arnold

Comments (0)