Linear Version of Parseval's Theorem

• Published in: IEEE access Vol. 10; pp. 27230 - 27241
• Main Authors: Hassanzadeh, Mohammad, Shahrrava, Behnam
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Adjoint operators; Algorithms; Autocorrelation functions; Digital signal processing; discrete Fourier transform (DFT); Discrete Fourier transforms; Eigenvalues and eigenfunctions; Fourier transforms; Hilbert space; Hilbert spaces; Identities; invariant functions; Invariants; Linear equations; Operators (mathematics); Parseval’s theorem; Questions; Signal processing; Signal processing algorithms; Spectral analysis; Symmetric matrices; Theorems; Time-frequency analysis
• ISSN: 2169-3536; 2169-3536
• DOI: 10.1109/ACCESS.2022.3157736

Parseval's theorem states that the energy of a signal is preserved by the discrete Fourier transform (DFT). Parseval's formula shows that there is a nonlinear invariant function for the DFT, so the total energy of a signal can be computed from the signal or its DFT using the same nonlinear function. In this paper, we try to answer the question of whether there are linear invariant functions for the DFT, and how they can be found, along with their potential applications in digital signal processing. In order to answer this question, we first prove that the only linear equations that are preserved by the DFT are its orthogonal projections. Then, using Hilbert spaces and adjoint operators, we propose an algorithm that computes all linear invariant functions for the DFT. These linear invariant functions are also shown to be useful and important in a variety of signal-processing applications, particularly for finding some boundaries for transformed signals without explicitly evaluating the DFT, and vice versa. Additionally, using the proposed identities, we demonstrate that the average of a circular auto-correlation function for a large class of signals is preserved by the DFT. Finally, the results reported in this paper are verified for several short-length and long-length DFTs, including a 256-point DFT.