From 5fd9866479ec50051d2c9eeb4e217e9376e6f9b4 Mon Sep 17 00:00:00 2001
From: Jaron Kent-Dobias <jaron@kent-dobias.com>
Date: Thu, 8 May 2025 07:24:33 -0300
Subject: Made log-Fourier padding symmetric, and began writing regular
 integrator

---
 log-fourier.cpp | 8 ++++++++
 1 file changed, 8 insertions(+)

(limited to 'log-fourier.cpp')

diff --git a/log-fourier.cpp b/log-fourier.cpp
index 9ae70be..9d1f2cb 100644
--- a/log-fourier.cpp
+++ b/log-fourier.cpp
@@ -64,6 +64,8 @@ std::vector<Complex> LogarithmicFourierTransform::fourier(const std::vector<Real
     for (unsigned n = 0; n < pad*N; n++) {
       if (n < N) {
         a[n] = c[n] * exp((1 - k) * τ(n));
+      } else if (n >= (pad - 1) * N) {
+        a[n] = c[pad*N-n-1] * exp((1 - k) * τ(pad*N-n-1));
       } else {
         a[n] = 0;
       }
@@ -92,6 +94,12 @@ std::vector<Real> LogarithmicFourierTransform::inverse(const std::vector<Complex
         } else {
           a[n] = ĉ[n] * std::exp((1 - k) * ω(n));
         }
+      } else if (n >= (pad - 1) * N) {
+        if (σ < 0) {
+          a[n] = ĉ[pad*N-n-1] * std::exp((1 - k) * ω(pad*N-n-1));
+        } else {
+          a[n] = std::conj(ĉ[pad*N-n-1]) * std::exp((1 - k) * ω(pad*N-n-1));
+        }
       } else {
         a[n] = 0;
       }
-- 
cgit v1.2.3-70-g09d2