Efficient Floating-Point Implementation of High-Order (N)LMS Adaptive Filters in FPGA

2006 ◽  
pp. 311-316 ◽  
Author(s):  
Milan Tichy ◽  
Jan Schier ◽  
David Gregg
Keyword(s):  
Adaptive Filters ◽  
High Order ◽  
Floating Point ◽  
Floating Point Implementation

Acoustic echo control. An application of very-high-order adaptive filters

1999 ◽  
Vol 16 (4) ◽  
pp. 42-69 ◽  
Author(s):  
C. Breining ◽  
P. Dreiscitel ◽  
E. Hansler ◽  
A. Mader ◽  
B. Nitsch ◽  
...  
Keyword(s):  
Adaptive Filters ◽  
High Order ◽  
Acoustic Echo ◽  
Very High

NUMERICAL STABILITY OF ALGORITHMS FOR 2D DELAUNAY TRIANGULATIONS

1995 ◽  
Vol 05 (01n02) ◽  
pp. 193-213 ◽  
Author(s):  
STEVEN FORTUNE
Keyword(s):  
Delaunay Triangulation ◽  
Floating Point ◽  
Worst Case ◽  
Delaunay Triangulations ◽  
Floating Point Arithmetic ◽  
Circular Arcs ◽  
Stability Of Algorithms ◽  
Forming Angle ◽  
Point Arithmetic ◽  
Floating Point Implementation

We consider the correctness of 2-d Delaunay triangulation algorithms implemented using floating-point arithmetic. The α-pseudocircle through points a, b, c consists of three circular arcs connecting ab, bc, and ac, each arc inside the circumcircle of a, b, c and forming angle α with the circumcircle; a triangulation is α-empty if the α-pseudocircle through the vertices of each triangle is empty. We show that a simple Delaunay triangulation algorithm—the flipping algorithm—can be implemented to produce O(n∈)-empty triangulations, where n is the number of point sites and ∈ is the relative error of floating-point arithmetic; its worst-case running time is O(n2). We also discuss floating-point implementation of other 2-d Delaunay triangulation algorithms.

Sign in / Sign up

Export Citation Format

Share Document