1 /*
2 * Copyright (c) 2008-2010 Stefan Krah. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 *
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 *
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND
16 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
25 * SUCH DAMAGE.
26 */
27
28
29 #include "mpdecimal.h"
30 #include <stdio.h>
31 #include <stdlib.h>
32 #include <assert.h>
33 #include "bits.h"
34 #include "difradix2.h"
35 #include "numbertheory.h"
36 #include "fnt.h"
37
38
39 /* forward transform, sign = -1 */
40 int
std_fnt(mpd_uint_t * a,mpd_size_t n,int modnum)41 std_fnt(mpd_uint_t *a, mpd_size_t n, int modnum)
42 {
43 struct fnt_params *tparams;
44
45 assert(ispower2(n));
46 assert(n >= 4);
47 assert(n <= 3*MPD_MAXTRANSFORM_2N);
48
49 if ((tparams = _mpd_init_fnt_params(n, -1, modnum)) == NULL) {
50 return 0;
51 }
52 fnt_dif2(a, n, tparams);
53
54 mpd_free(tparams);
55 return 1;
56 }
57
58 /* reverse transform, sign = 1 */
59 int
std_inv_fnt(mpd_uint_t * a,mpd_size_t n,int modnum)60 std_inv_fnt(mpd_uint_t *a, mpd_size_t n, int modnum)
61 {
62 struct fnt_params *tparams;
63
64 assert(ispower2(n));
65 assert(n >= 4);
66 assert(n <= 3*MPD_MAXTRANSFORM_2N);
67
68 if ((tparams = _mpd_init_fnt_params(n, 1, modnum)) == NULL) {
69 return 0;
70 }
71 fnt_dif2(a, n, tparams);
72
73 mpd_free(tparams);
74 return 1;
75 }
76
77
78
79