![]() |
NFFT
3.3.1
|
00001 /* 00002 * Copyright (c) 2002, 2016 Jens Keiner, Stefan Kunis, Daniel Potts 00003 * 00004 * This program is free software; you can redistribute it and/or modify it under 00005 * the terms of the GNU General Public License as published by the Free Software 00006 * Foundation; either version 2 of the License, or (at your option) any later 00007 * version. 00008 * 00009 * This program is distributed in the hope that it will be useful, but WITHOUT 00010 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS 00011 * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more 00012 * details. 00013 * 00014 * You should have received a copy of the GNU General Public License along with 00015 * this program; if not, write to the Free Software Foundation, Inc., 51 00016 * Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. 00017 */ 00018 00019 #include "infft.h" 00020 00021 #if defined(DIRAC_DELTA) 00022 #elif defined(GAUSSIAN) 00023 static const INT m2K_[] = {0, 1, 3, 6, 7, 9, 11, 13, 15, 17, 19, 21, 22, 23, 24}; 00024 #elif defined(B_SPLINE) 00025 static const INT m2K_[] = {0, 0, 4, 7, 10, 13, 15, 17, 19, 22, 24}; 00026 #elif defined(SINC_POWER) 00027 static const INT m2K_[] = {0, 0, 2, 5, 8, 11, 12, 14, 16, 18, 21, 23, 24, 24}; 00028 #else /* Kaiser-Bessel is the default. */ 00029 static const INT m2K_[] = {1, 3, 7, 9, 14, 17, 20, 23, 24}; 00030 #endif 00031 00036 INT Y(m2K)(const INT m) 00037 { 00038 int j = MIN(((int)(m)), ((int)((sizeof(m2K_) / sizeof(m2K_[0])) - 1))); 00039 return (INT)((1U << m2K_[j]) * (m + 2)); 00040 }