Cover Image

Fast Computation of the Discrete Fourier Transform Rectangular Index Coefficients

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Queiroz, Saulo, Vilela, João P., Ng, Benjamin Koon Kei, Lam, Chan-Tong, Monteiro, Edmundo
Format:	Preprint
Published:	2025
Subjects:	Signal Processing Computational Complexity Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fast Computation of the Discrete Fourier Transform Square Index Coefficients
by: Queiroz, Saulo, et al.
Published: (2024)

Fast Compressed-Domain N-Point Discrete Fourier Transform: The "Twiddless" FFT Algorithm
by: Queiroz, Saulo
Published: (2025)

Computational Complexity-Constrained Spectral Efficiency Analysis for 6G Waveforms
by: Queiroz, Saulo, et al.
Published: (2024)

Computation-Limited Signals: A Channel Capacity Regime Constrained by Computational Complexity
by: Queiroz, Saulo, et al.
Published: (2023)

Counting Small Induced Subgraphs: Hardness via Fourier Analysis
by: Curticapean, Radu, et al.
Published: (2024)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

Fourier Analysis of Iterative Algorithms
by: Jones, Chris, et al.
Published: (2024)

Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems
by: Ghosh, Mrinalkanti
Published: (2025)

Fast Leaf-to-Ancestor Minimum Query in the Oracle Model
by: Upirvitskiy, Aleksey, et al.
Published: (2026)

Computational Complexity in Property Testing
by: Pinto Jr., Renato Ferreira, et al.
Published: (2025)

The Structure of In-Place Space-Bounded Computation
by: Cook, James, et al.
Published: (2025)

Computational Explorations of Total Variation Distance
by: Bhattacharyya, Arnab, et al.
Published: (2024)

Fast DCT+: A Family of Fast Transforms Based on Rank-One Updates of the Path Graph
by: Fernández-Menduiña, Samuel, et al.
Published: (2024)

Quadratic Speedup for Computing Contraction Fixed Points
by: Chen, Xi, et al.
Published: (2026)

The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization
by: Kontogiannis, Andreas, et al.
Published: (2026)

A Fast Coloring Oracle for Average Case Hypergraphs
by: Marcussen, Cassandra, et al.
Published: (2025)

Computational Complexity of Swish
by: Horiyama, Takashi, et al.
Published: (2026)

Simple approximation algorithms for Polyamorous Scheduling
by: Biktairov, Yuriy, et al.
Published: (2024)

On Approximating the Dynamic and Discrete Network Flow Problem
by: Manna, Bubai, et al.
Published: (2024)

Computing the $D$-base and $D$-relation in finite closure systems
by: Adaricheva, Kira, et al.
Published: (2024)

Fast quantum algorithm for differential equations
by: Bagherimehrab, Mohsen, et al.
Published: (2023)

Smoothed analysis for graph isomorphism
by: Anastos, Michael, et al.
Published: (2024)

Fast and simple multiplication of bounded twin-width matrices
by: Kozma, László, et al.
Published: (2026)

Microscopic Structure of Random 3-SAT: A Discrete Geometric Approach to Phase Transitions and Algorithmic Complexity
by: Zhan, Yongjian
Published: (2026)

Computational Complexities of Folding
by: Eppstein, David
Published: (2024)

Linear Index for Logarithmic Search-Time for any String under any Internal Node in Suffix Trees
by: Al-okaily, Anas
Published: (2024)

Fast decision tree learning solves hard coding-theoretic problems
by: Koch, Caleb, et al.
Published: (2024)

Fast Approximation Algorithm for Non-Monotone DR-submodular Maximization under Size Constraint
by: Tran, Tan D., et al.
Published: (2025)

Cascaded Learned Bloom Filter for Optimal Model-Filter Size Balance and Fast Rejection
by: Sato, Atsuki, et al.
Published: (2025)

Efficient Turing Machine Simulation with Transformers
by: Li, Qian, et al.
Published: (2025)

Efficient Computation of Time-Index Powered Weighted Sums Using Cascaded Accumulators
by: Linares, Deijany Rodriguez, et al.
Published: (2025)

Beyond Bits: An Introduction to Computation over the Reals
by: Miltzow, Tillmann
Published: (2026)

Computational-Statistical Tradeoffs from NP-hardness
by: Blanc, Guy, et al.
Published: (2025)

The Computational Complexity of Almost Stable Clustering with Penalties
by: Khodamoradi, Kamyar, et al.
Published: (2025)

Better Indexing for Rectangular Pattern Matching
by: Gawrychowski, Paweł, et al.
Published: (2025)

Neighborhood-Aware Graph Labeling Problem
by: Shahverdikondori, Mohammad, et al.
Published: (2026)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
by: Greilhuber, Jakob, et al.
Published: (2025)

Lazy Kronecker Product
by: Song, Zhao
Published: (2026)

The Trichotomy of Regular Property Testing
by: Bathie, Gabriel, et al.
Published: (2025)

Complexity of Local Search for Euclidean Clustering Problems
by: Manthey, Bodo, et al.
Published: (2023)