Abstract
The plane wave transform (PWT) plays an important role in computational modeling of electromagnetic field interaction problems. It has recently been determined that the plane wave transform has an interpolation-free O(N log N) representation. The same data structure is here shown to provide an O(N log N) representation of the discrete Fourier transform (DFT). It is well known that the DFT matrix is the eigen basis of the graph Laplacian associated with points on a line. This presentation explores the performance observed when the same data structure is used to compress the graph Fourier transform for more complex graphs.
| Original language | English |
|---|---|
| Title of host publication | IEEE SoutheastCon 2025 |
| Pages | 1330-1331 |
| Number of pages | 2 |
| ISBN (Electronic) | 9798331504847 |
| DOIs | |
| State | Published - 2025 |
| Event | 2025 IEEE SoutheastCon, SoutheastCon 2025 - Concord, United States Duration: Mar 22 2025 → Mar 30 2025 |
Publication series
| Name | Conference Proceedings - IEEE SOUTHEASTCON |
|---|---|
| ISSN (Print) | 1091-0050 |
| ISSN (Electronic) | 1558-058X |
Conference
| Conference | 2025 IEEE SoutheastCon, SoutheastCon 2025 |
|---|---|
| Country/Territory | United States |
| City | Concord |
| Period | 3/22/25 → 3/30/25 |
Bibliographical note
Publisher Copyright:© 2025 IEEE.
Keywords
- compression
- Fourier transform
- graphs
ASJC Scopus subject areas
- Computer Networks and Communications
- Software
- Electrical and Electronic Engineering
- Control and Systems Engineering
- Signal Processing
Fingerprint
Dive into the research topics of 'A Sparse Data Structure for Graph Fourier Transforms'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver