Two approaches for fixed-point filter design: "bit-flipping" algorithm and constrained downhill simplex method.

Artur Krukowski Izzet Kale

Published in: ISSPA (1999)

Keyphrases

fixed point
simplex method
filter design
linear programming
dynamic programming
sufficient conditions
np hard
objective function
computational complexity
search space
energy function
monte carlo
motion estimation
convergence rate
state space
cost function
optimal solution