Reinhard Prix 2007 Class. Quantum Grav. 24 S481 doi:10.1088/0264-9381/24/19/S11
Reinhard Prix
Show affiliationsThe construction of optimal template banks for matched-filtering searches is an example of the sphere covering problem. For parameter spaces with constant-coefficient metrics a (near-) optimal template bank is achieved by the A*n lattice, which is the best lattice covering in dimensions n ≤ 5, and is close to the best covering known for dimensions n ≤ 16. Generally, this provides a substantially more efficient covering than the simpler hyper-cubic lattice. We present an algorithm for generating lattice template banks for constant-coefficient metrics and we illustrate its implementation by generating A*n template banks in n = 2, 3, 4 dimensions.
Issue 19 (7 October 2007)
Received 10 April 2007, in final form 3 July 2007
Published 19 September 2007
Reinhard Prix 2007 Class. Quantum Grav. 24 S481
S Seok et al 2006 J. Micromech. Microeng. 16 2384
J. E. Lawler et al. 2001 ApJS 137 341
F Cusso and F Jaque 1982 J. Phys. C: Solid State Phys. 15 2875
Riccardo D'Auria et al 2001 Class. Quantum Grav. 18 3181
V Ya Fainberg et al 1997 J. Phys. A: Math. Gen. 30 3947
A Takemura et al 2003 Phys. Med. Biol. 48 2697
D E N Brancus and L Ion 2009 J. Phys.: Condens. Matter 21 485301
G. Hallinan et al. 2008 ApJ 684 644
Hiroto Tanaka et al 2007 J. Micromech. Microeng. 17 2485