Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.01115

32-point DFT Approximations Based on Minimal Frobenius Error and DFT Symmetries

L. Andrade-Silva·W. A. S. Aleixo·R. J. Cintra
View original source ↗Read source document ↗Export metadata ↓

Abstract

This work introduces low-complexity, multiplierless approximations for the 32-point discrete Fourier transform. The proposed methods are obtained by minimizing the Frobenius error compared against the DFT matrix over a set of trivial multipliers. A row-wise, symmetry-constrained parameterization is employed to reduce the search space size, rendering the task computationally tractable. The resulting approximations could outperform the reference method in the literature according to energy-based error measurements. A sparse matrix factorization is provided for efficient computation; the arithmetic costs are 152 real additions and 34 bit-shifts only.

Explore related subjects

eess.SPcs.NAmath.NA

Keep this discovery

BibTeXRIS

L. Andrade-Silva, W. A. S. Aleixo, R. J. Cintra. 2026-09-01. 32-point DFT Approximations Based on Minimal Frobenius Error and DFT Symmetries. https://arxiv.org/abs/2609.01115

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.NA subjecteess.SP subjectmath.NA subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

arXiv2026

Spectra of Non-Self-Adjoint Almost Mathieu Matrices and the Scottish Flag Operator

For $N\geq 3$ and a potential phase $\vartheta\in\mathbb{R}$, we study the non-self-adjoint almost Mathieu matrix obtained by multiplying the discrete Laplacian by a complex phase with angle $φ\in\mathbb{R}$, $A_N(φ,\vartheta)=e^{iφ}(S+S^{-1})/2+\operatorname{diag}(\cos(2πj/N+\vartheta))_{j\in\mathbb{Z}/N\mathbb{Z}}$, where $S e_j=e_{j+1}$ is the periodic shift on $\mathbb{C}^N$. We derive a Chambers formula and isolate the part $Q_{N,φ}$ of the characteristic polynomial that depends only on $N$ and $φ$, but not on $\vartheta$ or on a change of boundary conditions for the shift operator. We then show, for every $N$, that the zeros of $Q_{N,φ}$ lie on the two perpendicular lines $e^{iφ/2}\mathbb{R}\cup e^{i(φ/2+π/2)}\mathbb{R}$. For even $N$, the same property holds for the matrices $A_N(φ,\vartheta)$ with $\vartheta\in 2π\mathbb{Z}/N$, and we compute their limiting eigenvalue measure explicitly. For $φ\in[-π,π]$, the eigenvalue distribution approximates elliptic-integral densities with masses $1-|φ|/π$ and $|φ|/π$, and maximal radii $2|\cos(φ/2)|$ and $2|\sin(φ/2)|$, respectively. At $φ=π/2$, the central polynomial $Q_{N,φ}$ factors into positive quartic factors. This proves that the Scottish flag matrix, after Trefethen and Chapman, has its spectrum on the two diagonal lines of the saltire.

math.SP↗
arXiv2026

Nechvile-Transformed Spacecraft Dynamics and Propellant Computation in the 3-Body Problem

The uncontrolled equations of motion in the Nechvile frame for the restricted three-body problem have been well-known since at least the 1960s. It would seem that adding an external force to these equations is quite trivial: simply add an external force per mass term to the acceleration equations. Here we show that the last statement is not true. In fact, we show that the additive generic external force must be multiplied by the inverse of $(1 + e \cosθ)^3$ where $e$ is the relative eccentricity of the primaries and $θ$ is the true anomaly of the rotating frame located at the barycenter. Furthermore, when this result is combined with the mass flow rate equation, it generates several surprising results due to the mismatch between the resulting quadratic term and the cubic term in the equations of motion. This leads to a corresponding modification of the rocket equation itself. A Birkhoff-theoretic solution to an illustrative cislunar space mission problem shows propellent savings of 80% with the use of the correct cost functional. The popular quadratic cost utilizes more than $2X$ the minimum propellant consumption.

math.OC↗
arXiv2026

D-RADI: A Low-rank ADI Algorithm for Solving Large-scale Discrete-time Algebraic Riccati Equations

The low-rank alternating direction implicit (ADI) method is an efficient numerical technique for solving several types of large-scale matrix equations that admit low-rank solutions. The discrete-time algebraic Riccati equation (DARE) is an important matrix equation with applications in state estimation, controller design, and filter design. In the literature, the low-rank Cholesky factor ADI method for Stein equations has been used within Newton iterations to solve large-scale DAREs. However, no dedicated low-rank ADI solver is available for such DAREs. To address this gap, this paper presents a low-rank ADI solver for large-scale DAREs. We also propose an efficient approach to generate ADI shifts automatically, which makes the proposed solver fully autonomous for solving DAREs. The effectiveness of the proposed solver is compared with MATLAB's \texttt{idare} on a moderate-order problem. Efficiency and accuracy are further demonstrated on large-scale DAREs of order $10^6$. Numerical results confirm that the solver is efficient, accurate, and fully autonomous.

math.NA↗