Debian Codegraph @

modules/lsp-dsp-lib/include/private/dsp/arch/aarch64/asimd/fft.h

raw
1 /*
2 * Copyright (C) 2025 Linux Studio Plugins Project <https://lsp-plug.in/>
3 * (C) 2025 Vladimir Sadovnikov <[email protected]>
4 *
5 * This file is part of lsp-dsp-lib
6 * Created on: 31 мар. 2020 г.
7 *
8 * lsp-dsp-lib is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU Lesser General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or
11 * any later version.
12 *
13 * lsp-dsp-lib is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU Lesser General Public License for more details.
17 *
18 * You should have received a copy of the GNU Lesser General Public License
19 * along with lsp-dsp-lib. If not, see <https://www.gnu.org/licenses/>.
20 */
21
22 #ifndef PRIVATE_DSP_ARCH_AARCH64_ASIMD_FFT_H_
23 #define PRIVATE_DSP_ARCH_AARCH64_ASIMD_FFT_H_
24
25 #ifndef PRIVATE_DSP_ARCH_AARCH64_ASIMD_IMPL
26 #error "This header should not be included directly"
27 #endif /* PRIVATE_DSP_ARCH_AARCH64_ASIMD_IMPL */
28
29 #include <private/dsp/arch/aarch64/asimd/fft/const.h>
30 #include <private/dsp/arch/aarch64/asimd/fft/scramble.h>
31 #include <private/dsp/arch/aarch64/asimd/fft/butterfly.h>
32 #include <private/dsp/arch/aarch64/asimd/fft/normalize.h>
33
34 namespace lsp
35 {
36 namespace asimd
37 {
38 void direct_fft(float *dst_re, float *dst_im, const float *src_re, const float *src_im, size_t rank)
39 {
40 // Check bounds
41 if (rank <= 2)
42 {
43 if (rank == 2)
44 {
45 float s0_re = src_re[0] + src_re[2];
46 float s1_re = src_re[0] - src_re[2];
47 float s2_re = src_re[1] + src_re[3];
48 float s3_re = src_re[1] - src_re[3];
49
50 float s0_im = src_im[0] + src_im[2];
51 float s1_im = src_im[0] - src_im[2];
52 float s2_im = src_im[1] + src_im[3];
53 float s3_im = src_im[1] - src_im[3];
54
55 dst_re[0] = s0_re + s2_re;
56 dst_re[1] = s1_re + s3_im;
57 dst_re[2] = s0_re - s2_re;
58 dst_re[3] = s1_re - s3_im;
59
60 dst_im[0] = s0_im + s2_im;
61 dst_im[1] = s1_im - s3_re;
62 dst_im[2] = s0_im - s2_im;
63 dst_im[3] = s1_im + s3_re;
64 }
65 else if (rank == 1)
66 {
67 // s0' = s0 + s1
68 // s1' = s0 - s1
69 float s1_re = src_re[1];
70 float s1_im = src_im[1];
71 dst_re[1] = src_re[0] - s1_re;
72 dst_im[1] = src_im[0] - s1_im;
73 dst_re[0] = src_re[0] + s1_re;
74 dst_im[0] = src_im[0] + s1_im;
75 }
76 else
77 {
78 dst_re[0] = src_re[0];
79 dst_im[0] = src_im[0];
80 }
81 return;
82 }
83
84 // Scramble data
85 if ((dst_re == src_re) || (dst_im == src_im))
86 {
87 dsp::move(dst_re, src_re, 1 << rank);
88 dsp::move(dst_im, src_im, 1 << rank);
89 scramble_self_direct(dst_re, dst_im, rank);
90 }
91 else
92 scramble_copy_direct(dst_re, dst_im, src_re, src_im, rank);
93
94 direct_butterfly_rank3(dst_re, dst_im, 1 << (rank-3));
95
96 for (size_t i=4; i <= rank; ++i)
97 direct_butterfly_rank4p(dst_re, dst_im, i, 1 << (rank - i));
98 }
99
100 void reverse_fft(float *dst_re, float *dst_im, const float *src_re, const float *src_im, size_t rank)
101 {
102 // Check bounds
103 if (rank <= 2)
104 {
105 if (rank == 2)
106 {
107 float s0_re = src_re[0] + src_re[2];
108 float s1_re = src_re[0] - src_re[2];
109 float s2_re = src_re[1] + src_re[3];
110 float s3_re = src_re[1] - src_re[3];
111
112 float s0_im = src_im[0] + src_im[2];
113 float s1_im = src_im[0] - src_im[2];
114 float s2_im = src_im[1] + src_im[3];
115 float s3_im = src_im[1] - src_im[3];
116
117 dst_re[0] = (s0_re + s2_re) * 0.25f;
118 dst_re[1] = (s1_re - s3_im) * 0.25f;
119 dst_re[2] = (s0_re - s2_re) * 0.25f;
120 dst_re[3] = (s1_re + s3_im) * 0.25f;
121
122 dst_im[0] = (s0_im + s2_im) * 0.25f;
123 dst_im[1] = (s1_im + s3_re) * 0.25f;
124 dst_im[2] = (s0_im - s2_im) * 0.25f;
125 dst_im[3] = (s1_im - s3_re) * 0.25f;
126 }
127 else if (rank == 1)
128 {
129 // s0' = s0 + s1
130 // s1' = s0 - s1
131 float s1_re = src_re[1];
132 float s1_im = src_im[1];
133 dst_re[1] = (src_re[0] - s1_re) * 0.5f;
134 dst_im[1] = (src_im[0] - s1_im) * 0.5f;
135 dst_re[0] = (src_re[0] + s1_re) * 0.5f;
136 dst_im[0] = (src_im[0] + s1_im) * 0.5f;
137 }
138 else
139 {
140 dst_re[0] = src_re[0];
141 dst_im[0] = src_im[0];
142 }
143 return;
144 }
145
146 // Scramble data
147 if ((dst_re == src_re) || (dst_im == src_im))
148 {
149 dsp::move(dst_re, src_re, 1 << rank);
150 dsp::move(dst_im, src_im, 1 << rank);
151 scramble_self_reverse(dst_re, dst_im, rank);
152 }
153 else
154 scramble_copy_reverse(dst_re, dst_im, src_re, src_im, rank);
155
156 reverse_butterfly_rank3(dst_re, dst_im, 1 << (rank-3));
157
158 for (size_t i=4; i <= rank; ++i)
159 reverse_butterfly_rank4p(dst_re, dst_im, i, 1 << (rank - i));
160
161 dsp::normalize_fft2(dst_re, dst_im, rank);
162 }
163
164 } /* namespace asimd */
165 } /* namespace lsp */
166
167 #endif /* PRIVATE_DSP_ARCH_AARCH64_ASIMD_FFT_H_ */