forked from glidernet/ogn-rf
-
Notifications
You must be signed in to change notification settings - Fork 0
/
buffer.h
879 lines (804 loc) · 32.6 KB
/
buffer.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
/*
OGN - Open Glider Network - http://glidernet.org/
Copyright (c) 2015 The OGN Project
A detailed list of copyright holders can be found in the file "AUTHORS".
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this software. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef __BUFFER_H_
#define __BUFFER_H_
#include <unistd.h>
#include <string.h>
#include "fft.h"
#include "r2fft.h"
// ==================================================================================================
template <class Type>
class SampleBuffer // a buffer to hold a batch of samples
{
public:
int32_t Size; // allocated size ot data
int32_t Full; // number of values in the buffer
int32_t Len; // number of values per sample
double Rate; // [Hz] sampling rate
double Time; // [sec] time when samples were acquired
double Freq; // [Hz] RF frequency where samples were acquired
Type *Data; // (allocated) storage
public:
SampleBuffer() {
Size = 0;
Data = 0;
Full = 0;
Len = 1;
}
~SampleBuffer() {
Free();
}
void Free(void) {
if (Data) delete [] Data;
Data = 0;
Size = 0;
Full = 0;
}
int Allocate(int NewSize) {
if (NewSize <= Size) {
Full = 0;
return Size;
} // for timing eficiency: do not reallocate if same or bigger size already allocated
Free();
Data = new (std::nothrow) Type [NewSize];
if (Data == 0) {
Size = 0;
Full = 0;
return Size;
}
Size = NewSize;
return Size;
}
int Allocate(int NewLen, int Samples) {
Allocate(NewLen * Samples);
Len = NewLen;
return Size;
}
static const uint32_t FileSync = 0x254F7D00 + sizeof (Type);
int Write(int File) // write SampleBuffer to a file/socket
{
int Total = 0, Bytes;
uint32_t Sync = FileSync;
Bytes = write(File, &Sync, sizeof (uint32_t));
if (Bytes < 0) return -1;
Total += Bytes;
Bytes = write(File, &Size, sizeof (int32_t));
if (Bytes < 0) return -1;
Total += Bytes;
Bytes = write(File, &Full, sizeof (int32_t));
if (Bytes < 0) return -1;
Total += Bytes;
Bytes = write(File, &Len, sizeof (int32_t));
if (Bytes < 0) return -1;
Total += Bytes;
Bytes = write(File, &Rate, sizeof (double));
if (Bytes < 0) return -1;
Total += Bytes;
Bytes = write(File, &Time, sizeof (double));
if (Bytes < 0) return -1;
Total += Bytes;
Bytes = write(File, &Freq, sizeof (double));
if (Bytes < 0) return -1;
Total += Bytes;
Bytes = write(File, Data, Full * sizeof (Type));
if (Bytes < 0) return -1;
Total += Bytes;
return Total;
}
int ReadSync(int File) {
int Total = 0, Bytes;
uint32_t Sync;
while (1) {
Bytes = read(File, &Sync, sizeof (uint32_t));
if (Bytes < 0) return -1;
Total += Bytes;
if (Sync == FileSync) break;
}
return Total;
}
int Read(int File) // read SampleBuffer from a file/socket
{
int Total = 0, Bytes;
int32_t NewSize = 0;
Bytes = read(File, &NewSize, sizeof (int32_t));
if (Bytes < 0) return -1;
if (NewSize < 0) return -1;
Total += Bytes;
if (Allocate(NewSize) == 0) return -2;
Bytes = read(File, &Full, sizeof (int32_t));
if (Bytes < 0) return -1;
Total += Bytes;
Bytes = read(File, &Len, sizeof (int32_t));
if (Bytes < 0) return -1;
Total += Bytes;
Bytes = read(File, &Rate, sizeof (double));
if (Bytes < 0) return -1;
Total += Bytes;
Bytes = read(File, &Time, sizeof (double));
if (Bytes < 0) return -1;
Total += Bytes;
Bytes = read(File, &Freq, sizeof (double));
if (Bytes < 0) return -1;
Total += Bytes;
Bytes = read(File, Data, Full * sizeof (Type));
if (Bytes < 0) return -1;
Total += Bytes;
return Total;
}
int Samples(void) const {
return Full / Len;
} // number of samples
Type *SamplePtr(int Idx) const {
return Data + Idx*Len;
} // pointer to an indexed sample
Type &operator[](int Idx) {
return Data[Idx];
} // reference to an indexed value
Type *Sample(int Idx) {
return Data + Idx*Len;
}
template <class OtherType> // allocate after another SampleBuffer
int Allocate(SampleBuffer<OtherType> &Buffer) {
Allocate(Buffer.Size);
Len = Buffer.Len;
Rate = Buffer.Rate;
Time = Buffer.Time;
Freq = Buffer.Freq;
return Size;
}
void Set(Type Value = 0) {
Type *DataPtr = Data;
for (int Idx = 0; Idx < Size; Idx++) (*DataPtr++) = Value;
}
double Average(void) const {
double Sum = 0;
for (int Idx = 0; Idx < Full; Idx++) Sum += Data[Idx];
return Sum / Full;
}
int Copy(SampleBuffer<Type> &Buffer) // allocate and copy from another SampleBuffer
{
Allocate(Buffer.Size);
memcpy(Data, Buffer.Data, Size * sizeof (Type));
Full = Buffer.Full;
Len = Buffer.Len;
Rate = Buffer.Rate;
Time = Buffer.Time;
Freq = Buffer.Freq;
return Size;
}
int CopySample(SampleBuffer<Type> &Buffer, int Idx) // copy just one sample (but can be more than one value)
{
Allocate(Buffer->Len);
Full = Buffer.Len;
Len = Buffer.Len;
Rate = Buffer.Rate;
Time = Buffer.Time + Idx / Rate;
Freq = Buffer.Freq;
memcpy(Data, Buffer.Data + Idx*Len, Len * sizeof (Type));
return Size;
}
template <class OtherType>
int CopySampleSum(SampleBuffer<OtherType> &Buffer) // copy the sum of all samples
{
return CopySampleSum(Buffer, 0, Buffer.Samples() - 1);
}
template <class OtherType>
int CopySampleSum(SampleBuffer<OtherType> &Buffer, int Idx1, int Idx2) // copy the sum of several samples
{
Allocate(Buffer.Len);
Full = Buffer.Len;
Len = Buffer.Len;
Rate = Buffer.Rate;
Time = Buffer.Time + 0.5 * (Idx1 + Idx2) / Rate;
Freq = Buffer.Freq;
for (int Idx = 0; Idx < Len; Idx++) {
Data[Idx] = 0;
}
for (int sIdx = Idx1; sIdx <= Idx2; sIdx++) {
Type *sPtr = Buffer.Data + sIdx*Len;
for (int Idx = 0; Idx < Len; Idx++) {
Data[Idx] += sPtr[Idx];
}
}
return Size;
}
template <class ScaleType>
void operator*=(ScaleType Scale) {
for (int Idx = 0; Idx < Full; Idx++) Data[Idx] *= Scale;
}
int WritePlotFile(const char *FileName) {
FILE *File = fopen(FileName, "wt");
if (File == 0) return 0;
for (int Idx = 0; Idx < Size; Idx++)
fprintf(File, "%4d: %+10.6f\n", Idx, Data[Idx]);
fclose(File);
return Size;
}
int Write(FILE *File) // write all samples onto a binary file (with header)
{
if (fwrite(&Size, sizeof (Size), 1, File) != 1) return -1;
if (fwrite(&Full, sizeof (Full), 1, File) != 1) return -1;
if (fwrite(&Len, sizeof (Len), 1, File) != 1) return -1;
if (fwrite(&Rate, sizeof (Rate), 1, File) != 1) return -1;
if (fwrite(&Time, sizeof (Time), 1, File) != 1) return -1;
if (fwrite(&Freq, sizeof (Freq), 1, File) != 1) return -1;
if (fwrite(Data, sizeof (Type), Size, File) != (size_t) Size) return -1;
return 1;
}
int Read(FILE *File) // read samples from a binary file (with header)
{
if (fread(&Size, sizeof (Size), 1, File) != 1) return -1;
if (fread(&Full, sizeof (Full), 1, File) != 1) return -1;
if (fread(&Len, sizeof (Len), 1, File) != 1) return -1;
if (fread(&Rate, sizeof (Rate), 1, File) != 1) return -1;
if (fread(&Time, sizeof (Time), 1, File) != 1) return -1;
if (fread(&Freq, sizeof (Freq), 1, File) != 1) return -1;
Allocate(Size);
if (fread(Data, sizeof (Type), Size, File) != (size_t) Size) return -1;
return 1;
}
int ReadRaw(FILE *File, int Len, int MaxSamples, double Rate = 1) // read samples from a raw binary file
{
Allocate(Len, MaxSamples);
this->Rate = Rate;
int Read = fread(Data, Len * sizeof (Type), MaxSamples, File);
Full = Len*Read;
return Full;
}
int ReadRaw(const char *FileName, int Len, int MaxSamples, double Rate = 1) {
FILE *File = fopen(FileName, "rb");
if (!File) return -1;
int Ret = ReadRaw(File, Len, MaxSamples, Rate);
fclose(File);
return Ret;
}
};
// ==================================================================================================
// Note 1: the sliding FFT routines below take sliding step = half the FFT window size (thus SineWindow should be used)
// Note 2: the FFT output spectra have the two halfs swapped around thus the FFT amplitude corresponding to the center frequency is in the middle
template <class Float>
int SlidingFFT(SampleBuffer< std::complex<Float> > &Output, SampleBuffer<uint8_t> &Input,
InpSlideFFT<Float> &FFT, Float InpBias = 127.38) {
return SlidingFFT(Output, Input, FFT.FwdFFT, FFT.Window, InpBias);
}
template <class Float> // do sliding FFT over a buffer of (complex 8-bit) samples, produce (float/double complex) spectra
int SlidingFFT(SampleBuffer< std::complex<Float> > &Output, SampleBuffer<uint8_t> &Input,
DFT1d<Float> &FwdFFT, Float *Window, Float InpBias = 127.38) {
int WindowSize = FwdFFT.Size; // FFT object and Window shape are prepared already
int WindowSize2 = WindowSize / 2; // Slide step
int InpSamples = Input.Full / 2; // number of complex,8-bit input samples
// printf("SlidingFFT() %d point FFT, %d input samples\n", FwdFFT.Size, InpSamples);
Output.Allocate((InpSamples / WindowSize2 + 1) * WindowSize);
Output.Len = WindowSize; // output is rows of spectral data
Output.Rate = Input.Rate / WindowSize2;
Output.Time = Input.Time;
Output.Freq = Input.Freq;
uint8_t *InpData = Input.Data;
std::complex<Float> *OutData = Output.Data;
int Slides = 0;
{
std::complex<Float> *Buffer = FwdFFT.Buffer; // first slide is special
for (int Bin = 0; Bin < WindowSize2; Bin++) {
Buffer[Bin] = 0;
} // half the window is empty
for (int Bin = WindowSize2; Bin < WindowSize; Bin++) // the other half contains the first input samples
{
Buffer[Bin] = std::complex<float>(Window[Bin]*(InpData[0] - InpBias), Window[Bin]*(InpData[1] - InpBias));
InpData += 2;
}
FwdFFT.Execute(); // execute FFT
memcpy(OutData, Buffer + WindowSize2, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2; // copy spectra into the output buffer
memcpy(OutData, Buffer, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2; // swap around the two halfs
InpData -= 2 * WindowSize2;
Slides++;
}
for (; InpSamples >= WindowSize; InpSamples -= WindowSize2) // now the following slides
{
std::complex<Float> *Buffer = FwdFFT.Buffer;
for (int Bin = 0; Bin < WindowSize; Bin++) {
Buffer[Bin] = std::complex<float>(Window[Bin]*(InpData[0] - InpBias), Window[Bin]*(InpData[1] - InpBias));
InpData += 2;
}
FwdFFT.Execute();
memcpy(OutData, Buffer + WindowSize2, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2;
memcpy(OutData, Buffer, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2;
InpData -= 2 * WindowSize2;
Slides++;
}
{
std::complex<Float> *Buffer = FwdFFT.Buffer; // and the last slide: special
for (int Bin = 0; Bin < WindowSize2; Bin++) {
Buffer[Bin] = std::complex<float>(Window[Bin]*(InpData[0] - InpBias), Window[Bin]*(InpData[1] - InpBias));
InpData += 2;
}
for (int Bin = WindowSize2; Bin < WindowSize; Bin++) {
Buffer[Bin] = 0;
}
FwdFFT.Execute();
memcpy(OutData, Buffer + WindowSize2, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2;
memcpy(OutData, Buffer, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2;
InpData -= 2 * WindowSize2;
Slides++;
}
Output.Full = Slides*WindowSize;
return Slides;
}
// --------------------------------------------------------------------------------------------------
template <class Float> // do sliding FFT over a buffer of float/double complex samples, produce (float/double complex) spectra
int SlidingFFT(SampleBuffer< std::complex<Float> > &Output, SampleBuffer< std::complex<Float> > &Input,
DFT1d<Float> &FwdFFT, Float *Window) {
int WindowSize = FwdFFT.Size; // FFT object and Window shape are prepared already
int WindowSize2 = WindowSize / 2; // Slide step
int InpSamples = Input.Full; // number of complex float/double samples
// printf("SlidingFFT() %d point FFT, %d input samples\n", FwdFFT.Size, InpSamples);
Output.Allocate((InpSamples / WindowSize2 + 1) * WindowSize);
Output.Len = WindowSize; // output is rows of spectral data
Output.Rate = Input.Rate / WindowSize2;
Output.Time = Input.Time;
Output.Freq = Input.Freq;
std::complex<Float> *InpData = Input.Data;
std::complex<Float> *OutData = Output.Data;
int Slides = 0;
{
std::complex<Float> *Buffer = FwdFFT.Buffer; // first slide is special
for (int Bin = 0; Bin < WindowSize2; Bin++) {
Buffer[Bin] = 0;
} // half the window is empty
for (int Bin = WindowSize2; Bin < WindowSize; Bin++) // the other half contains the first input samples
{
Buffer[Bin] = Window[Bin] * InpData[Bin - WindowSize2];
}
FwdFFT.Execute(); // execute FFT
memcpy(OutData, Buffer + WindowSize2, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2; // copy spectra into the output buffer
memcpy(OutData, Buffer, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2; // swap around the two halfs
Slides++;
}
for (; InpSamples >= WindowSize; InpSamples -= WindowSize2) // now the following slides
{
std::complex<Float> *Buffer = FwdFFT.Buffer;
for (int Bin = 0; Bin < WindowSize; Bin++) {
Buffer[Bin] = Window[Bin] * InpData[Bin];
}
FwdFFT.Execute();
memcpy(OutData, Buffer + WindowSize2, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2;
memcpy(OutData, Buffer, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2;
InpData += WindowSize2;
Slides++;
}
{
std::complex<Float> *Buffer = FwdFFT.Buffer; // and the last slide: special
for (int Bin = 0; Bin < WindowSize2; Bin++) {
Buffer[Bin] = Window[Bin] * InpData[Bin];
}
for (int Bin = WindowSize2; Bin < WindowSize; Bin++) {
Buffer[Bin] = 0;
}
FwdFFT.Execute();
memcpy(OutData, Buffer + WindowSize2, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2;
memcpy(OutData, Buffer, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2;
InpData += WindowSize2;
Slides++;
}
Output.Full = Slides*WindowSize;
return Slides;
}
template <class Float> // do sliding FFT over a buffer of float/double complex samples, produce (float/double complex) spectra
int ReconstrFFT(SampleBuffer< std::complex<Float> > &Output, SampleBuffer< std::complex<Float> > &Input,
DFT1d<Float> &InvFFT, Float *Window) {
int WindowSize = InvFFT.Size; // FFT object and Window shape are prepared already
int WindowSize2 = WindowSize / 2; // Slide step
int InpSlides = Input.Samples(); //
// printf("ReconstrFFT() %d point FFT, %d input samples\n", FwdFFT.Size, InpSlides);
Output.Allocate(1, (InpSlides + 1) * WindowSize2); // output is complex time-linear samples
Output.Rate = Input.Rate*WindowSize2;
Output.Time = Input.Time - 1.0 / Input.Rate;
Output.Freq = Input.Freq;
std::complex<Float> *InpData = Input.Data;
std::complex<Float> *OutData = Output.Data;
int Slides = 0;
{
std::complex<Float> *Buffer = InvFFT.Buffer;
memcpy(Buffer + WindowSize2, InpData, WindowSize2 * sizeof (std::complex<Float>));
InpData += WindowSize2; // copy spectra into the output buffer
memcpy(Buffer, InpData, WindowSize2 * sizeof (std::complex<Float>));
InpData += WindowSize2; // swap around the two halfs
InvFFT.Execute();
for (int Idx = 0; Idx < WindowSize; Idx++) {
OutData[Idx] = Window[Idx] * Buffer[Idx];
}
OutData += WindowSize2;
Slides++;
InpSlides--;
}
for (; InpSlides;) {
std::complex<Float> *Buffer = InvFFT.Buffer;
memcpy(Buffer + WindowSize2, InpData, WindowSize2 * sizeof (std::complex<Float>));
InpData += WindowSize2; // copy spectra into the output buffer
memcpy(Buffer, InpData, WindowSize2 * sizeof (std::complex<Float>));
InpData += WindowSize2; // swap around the two halfs
InvFFT.Execute();
for (int Idx = 0; Idx < WindowSize2; Idx++) {
OutData[Idx] += Window[Idx] * Buffer[Idx];
}
for (int Idx = WindowSize2; Idx < WindowSize; Idx++) {
OutData[Idx] = Window[Idx] * Buffer[Idx];
}
OutData += WindowSize2;
Slides++;
InpSlides--;
}
Output.Full = (Slides + 1) * WindowSize2;
return Slides;
}
// ==================================================================================================
// Sliding FFT with r2FFT (no open-source restrictions)
template <class Float> // do sliding FFT over a buffer of float/double complex samples, produce (float/double complex) spectra
int SlidingFFT(SampleBuffer< std::complex<Float> > &Output, SampleBuffer< std::complex<Float> > &Input,
r2FFT<Float> &FFT, Float *Window, std::complex<Float> *Buffer) {
int WindowSize = FFT.Size; // FFT object and Window shape are prepared already
int WindowSize2 = WindowSize / 2; // Slide step
int InpSamples = Input.Full; // number of complex float/double samples
// printf("SlidingFFT() %d point FFT, %d input samples\n", FFT.Size, InpSamples);
Output.Allocate((InpSamples / WindowSize2 + 1) * WindowSize);
Output.Len = WindowSize; // output is rows of spectral data
Output.Rate = Input.Rate / WindowSize2;
Output.Time = Input.Time;
Output.Freq = Input.Freq;
std::complex<Float> *InpData = Input.Data;
std::complex<Float> *OutData = Output.Data;
int Slides = 0;
{ // first slide is special
for (int Bin = 0; Bin < WindowSize2; Bin++) {
Buffer[Bin] = 0;
} // half the window is empty
for (int Bin = WindowSize2; Bin < WindowSize; Bin++) // the other half contains the first input samples
{
Buffer[Bin] = Window[Bin] * InpData[Bin - WindowSize2];
}
FFT.Process(Buffer); // execute FFT
memcpy(OutData, Buffer + WindowSize2, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2; // copy spectra into the output buffer
memcpy(OutData, Buffer, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2; // swap around the two halfs
Slides++;
}
for (; InpSamples >= WindowSize; InpSamples -= WindowSize2) // now the following slides
{
for (int Bin = 0; Bin < WindowSize; Bin++) {
Buffer[Bin] = Window[Bin] * InpData[Bin];
}
FFT.Process(Buffer);
memcpy(OutData, Buffer + WindowSize2, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2;
memcpy(OutData, Buffer, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2;
InpData += WindowSize2;
Slides++;
}
{ // and the last slide: special
for (int Bin = 0; Bin < WindowSize2; Bin++) {
Buffer[Bin] = Window[Bin] * InpData[Bin];
}
for (int Bin = WindowSize2; Bin < WindowSize; Bin++) {
Buffer[Bin] = 0;
}
FFT.Process(Buffer);
memcpy(OutData, Buffer + WindowSize2, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2;
memcpy(OutData, Buffer, WindowSize2 * sizeof (std::complex<Float>));
OutData += WindowSize2;
InpData += WindowSize2;
Slides++;
}
Output.Full = Slides*WindowSize;
return Slides;
}
template <class Float> // do sliding FFT over a buffer of float/double complex samples, produce (float/double complex) spectra
int ReconstrFFT(SampleBuffer< std::complex<Float> > &Output, SampleBuffer< std::complex<Float> > &Input,
r2FFT<Float> &FFT, Float *Window, std::complex<Float> *Buffer) {
int WindowSize = FFT.Size; // FFT object and Window shape are prepared already
int WindowSize2 = WindowSize / 2; // Slide step
int InpSlides = Input.Samples(); //
// printf("ReconstrFFT() %d point FFT, %d input samples\n", FwdFFT.Size, InpSlides);
Output.Allocate(1, (InpSlides + 1) * WindowSize2); // output is complex time-linear samples
Output.Rate = Input.Rate*WindowSize2;
Output.Time = Input.Time - 1.0 / Input.Rate;
Output.Freq = Input.Freq;
std::complex<Float> *InpData = Input.Data;
std::complex<Float> *OutData = Output.Data;
int Slides = 0;
{
// memcpy(Buffer+WindowSize2, InpData, WindowSize2*sizeof(std::complex<Float>)); InpData+=WindowSize2; // copy spectra into the output buffer
// memcpy(Buffer, InpData, WindowSize2*sizeof(std::complex<Float>)); InpData+=WindowSize2; // swap around the two halfs
for (int Idx = 0; Idx < WindowSize2; Idx++) {
Buffer[WindowSize2 + Idx] = conj(InpData[Idx]);
}
InpData += WindowSize2;
for (int Idx = 0; Idx < WindowSize2; Idx++) {
Buffer[ Idx] = conj(InpData[Idx]);
}
InpData += WindowSize2;
FFT.Process(Buffer);
for (int Idx = 0; Idx < WindowSize; Idx++) {
OutData[Idx] = Window[Idx] * conj(Buffer[Idx]);
}
OutData += WindowSize2;
Slides++;
InpSlides--;
}
for (; InpSlides;) {
// memcpy(Buffer+WindowSize2, InpData, WindowSize2*sizeof(std::complex<Float>)); InpData+=WindowSize2; // copy spectra into the output buffer
// memcpy(Buffer, InpData, WindowSize2*sizeof(std::complex<Float>)); InpData+=WindowSize2; // swap around the two halfs
for (int Idx = 0; Idx < WindowSize2; Idx++) {
Buffer[WindowSize2 + Idx] = conj(InpData[Idx]);
}
InpData += WindowSize2;
for (int Idx = 0; Idx < WindowSize2; Idx++) {
Buffer[ Idx] = conj(InpData[Idx]);
}
InpData += WindowSize2;
FFT.Process(Buffer);
for (int Idx = 0; Idx < WindowSize2; Idx++) {
OutData[Idx] += Window[Idx] * conj(Buffer[Idx]);
}
for (int Idx = WindowSize2; Idx < WindowSize; Idx++) {
OutData[Idx] = Window[Idx] * conj(Buffer[Idx]);
}
OutData += WindowSize2;
Slides++;
InpSlides--;
}
Output.Full = (Slides + 1) * WindowSize2;
return Slides;
}
// ==================================================================================================
#ifdef USE_RPI_GPU_FFT
// template <class Float> // do sliding FFT over a buffer of (complex 8-bit) samples, produce (float/double complex) spectra
int SlidingFFT(SampleBuffer< std::complex<float> > &Output, SampleBuffer<uint8_t> &Input,
RPI_GPU_FFT &FwdFFT, float *Window, float InpBias = 127.38) {
int Jobs = FwdFFT.Jobs;
int WindowSize = FwdFFT.Size; // FFT object and Window shape are prepared already
int WindowSize2 = WindowSize / 2; // Slide step
int InpSamples = Input.Full / 2; // number of complex,8-bit input samples
// printf("SlidingFFT(RPI_GPU_FFT) %d point FFT, %d jobs/GPU, %d input samples\n", FwdFFT.Size, Jobs, InpSamples);
Output.Allocate((InpSamples / WindowSize2 + 1) * WindowSize);
Output.Len = WindowSize; // output is rows of spectral data
Output.Rate = Input.Rate / WindowSize2;
Output.Time = Input.Time;
Output.Freq = Input.Freq;
uint8_t *InpData = Input.Data;
std::complex<float> *OutData = Output.Data;
int Slides = 0;
int Job = 0;
{
std::complex<float> *Buffer = FwdFFT.Input(Job); // first slide is special
for (int Bin = 0; Bin < WindowSize2; Bin++) {
Buffer[Bin] = 0;
} // half the window is empty
for (int Bin = WindowSize2; Bin < WindowSize; Bin++) // the other half contains the first input samples
{
Buffer[Bin] = std::complex<float>(Window[Bin]*(InpData[0] - InpBias), Window[Bin]*(InpData[1] - InpBias));
InpData += 2;
}
Job++;
InpData -= 2 * WindowSize2;
}
for (; InpSamples >= WindowSize; InpSamples -= WindowSize2) // now the following slides
{
std::complex<float> *Buffer = FwdFFT.Input(Job);
for (int Bin = 0; Bin < WindowSize; Bin++) {
Buffer[Bin] = std::complex<float>(Window[Bin]*(InpData[0] - InpBias), Window[Bin]*(InpData[1] - InpBias));
InpData += 2;
}
Job++;
InpData -= 2 * WindowSize2;
if (Job >= Jobs) {
FwdFFT.Execute();
for (int J = 0; J < Jobs; J++) {
memcpy(OutData, FwdFFT.Output(J) + WindowSize2, WindowSize2 * sizeof (std::complex<float>));
OutData += WindowSize2;
memcpy(OutData, FwdFFT.Output(J), WindowSize2 * sizeof (std::complex<float>));
OutData += WindowSize2;
}
Slides += Jobs;
Job = 0;
}
}
{
std::complex<float> *Buffer = FwdFFT.Input(Job); // and the last slide: special
for (int Bin = 0; Bin < WindowSize2; Bin++) {
Buffer[Bin] = std::complex<float>(Window[Bin]*(InpData[0] - InpBias), Window[Bin]*(InpData[1] - InpBias));
InpData += 2;
}
for (int Bin = WindowSize2; Bin < WindowSize; Bin++) {
Buffer[Bin] = 0;
}
Job++;
InpData -= 2 * WindowSize2;
{
FwdFFT.Execute();
for (int J = 0; J < Job; J++) {
memcpy(OutData, FwdFFT.Output(J) + WindowSize2, WindowSize2 * sizeof (std::complex<float>));
OutData += WindowSize2;
memcpy(OutData, FwdFFT.Output(J), WindowSize2 * sizeof (std::complex<float>));
OutData += WindowSize2;
}
Slides += Job;
Job = 0;
}
}
// printf("SlidingFFT(RPI_GPU_FFT) %d slides\n", Slides);
Output.Full = Slides*WindowSize;
return Slides;
}
#endif
// ==================================================================================================
template <class Float>
inline Float Power(Float *X) {
Float Re = X[0];
Float Im = X[1];
return Re * Re + Im*Im;
}
template <class Float>
inline Float Power(std::complex<Float> &X) {
Float Re = real(X);
Float Im = imag(X);
return Re * Re + Im*Im;
}
template <class Float> // convert (complex) spectra to power (energy)
void SpectraPower(SampleBuffer<Float> &Output, SampleBuffer< std::complex<Float> > &Input) {
Output.Allocate(Input);
int WindowSize = Input.Len;
std::complex<Float> *InpData = Input.Data;
Float *OutData = Output.Data;
int Slides = Input.Full / Input.Len;
for (int Slide = 0; Slide < Slides; Slide++) {
for (int Bin = 0; Bin < WindowSize; Bin++) {
OutData[Bin] = Power(InpData[Bin]);
}
InpData += WindowSize;
OutData += WindowSize;
}
Output.Time = Input.Time;
Output.Rate = Input.Rate;
Output.Freq = Input.Freq;
Output.Full = Input.Full;
}
template <class Float> // convert (complex) spectra to power (energy) - at same time calc. the average spectra power
Float SpectraPower(SampleBuffer<Float> &Output, SampleBuffer< std::complex<Float> > &Input, int LowBin, int Bins) {
int WindowSize = Input.Len;
int Slides = Input.Full / WindowSize;
Output.Allocate(Bins, Slides);
Float *OutData = Output.Data;
double Sum = 0;
for (int Slide = 0; Slide < Slides; Slide++) {
std::complex<Float> *InpData = Input.Data + (Slide * WindowSize + LowBin);
for (int Bin = 0; Bin < Bins; Bin++) {
Sum += OutData[Bin] = Power(InpData[Bin]);
}
OutData += Bins;
}
Output.Full = Bins*Slides;
Output.Time = Input.Time;
Output.Rate = Input.Rate; // Output.Freq=Input.Freq;
return Sum / Output.Full;
}
template <class Float>
Float SpectraPowerLogHist(int *LogHist, SampleBuffer<Float> &Power, Float Median) {
Float Thres[3];
Thres[0] = Median;
Thres[1] = 2 * Median;
Thres[2] = 4 * Median;
LogHist[0] = 0;
LogHist[1] = 0;
LogHist[2] = 0;
LogHist[3] = 0;
for (int Idx = 0; Idx < Power.Full; Idx++) {
Float Pwr = Power.Data[Idx];
if (Pwr < Thres[0]) {
LogHist[0]++;
continue;
}
if (Pwr < Thres[1]) {
LogHist[1]++;
continue;
}
if (Pwr < Thres[2]) {
LogHist[2]++;
continue;
}
LogHist[3]++;
}
if (LogHist[1] == 0) return 0;
return -Median / log((double) LogHist[1] / LogHist[0]);
} // return estimated sigma of the noise
template <class Float>
Float SpectraPowerLogHist(SampleBuffer<Float> &Power, Float Median) {
int LogHist[4];
return SpectraPowerLogHist(LogHist, Power, Median);
}
template <class Float>
Float SpectraPowerLogHist(int *LogHist, SampleBuffer<Float> &Power, Float Median, int HistSize) {
Float Thres[HistSize - 1];
LogHist[0] = 0;
Thres[0] = Median;
for (int Bin = 1; Bin < (HistSize - 1); Bin++) {
LogHist[Bin] = 0;
Thres[Bin] = 2 * Thres[Bin - 1];
}
LogHist[HistSize - 1] = 0;
for (int Idx = 0; Idx < Power.Full; Idx++) {
Float Pwr = Power.Data[Idx];
int Bin;
for (Bin = 0; Bin < (HistSize - 1); Bin++) {
if (Pwr < Thres[Bin]) {
LogHist[Bin] += 1;
break;
}
}
if (Bin == (HistSize - 1)) LogHist[HistSize - 1] += 1;
}
if (LogHist[1] == 0) return 0;
return -Median / log((double) LogHist[1] / LogHist[0]);
} // return estimated sigma of the noise
template <class Float>
Float SpectraPowerLogHist(SampleBuffer<Float> &Power, Float Median, int HistSize) {
int LogHist[HistSize];
return SpectraPowerLogHist(LogHist, Power, Median, HistSize);
}
// ==================================================================================================
template <class Float> // write an image (.pgm) spectrogram file out of the spectra power data
int Spectrogram(const Float *Power, int Slides, int SpectraSize, const char *ImageFileName, Float RefPwr = 1.00) {
FILE *ImageFile = 0;
if (ImageFileName) ImageFile = fopen(ImageFileName, "wb");
if (ImageFile == 0) return -1;
fprintf(ImageFile, "P5\n%5d %6d\n255\n", SpectraSize, Slides);
uint8_t ImageLine[SpectraSize];
for (int Slide = 0; Slide < Slides; Slide++) {
for (int Idx = 0; Idx < SpectraSize; Idx++) {
Float Pwr = (*Power++);
int Pixel = 0;
if (Pwr > 0) Pixel = (int) floor(16 + 100.0 * log10(Pwr / RefPwr) + 0.5);
if (Pixel < 0) {
Pixel = 0;
} else if (Pixel > 255) {
Pixel = 255;
}
ImageLine[Idx] = Pixel;
}
fwrite(ImageLine, 1, SpectraSize, ImageFile);
}
fclose(ImageFile);
return Slides*SpectraSize;
}
template <class Float>
int Spectrogram(SampleBuffer<Float> &SpectraPower, const char *ImageFileName, Float RefPwr = 1.00) {
return Spectrogram(SpectraPower.Data, SpectraPower.Samples(), SpectraPower.Len, ImageFileName, RefPwr);
}
// ==================================================================================================
#endif // __BUFFER_H_