A Fast Multiplierless Discrete Fourier Transform Approximation by Sparse Factorization Optimization [Tips & Tricks]

Provides society information that may include news, reviews or technical notes that should be of interest to practitioners and researchers.

Authors

Institutions

Publication Details

Journal
IEEE Signal Processing Magazine
Published
2025-03-01
DOI
https://doi.org/10.1109/msp.2025.3527869
Citations
1
Primary Topic
Advanced Data Compression Techniques
Type
article
Field-Weighted Citation Impact
1.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Fast Multiplierless Discrete Fourier Transform Approximation by Sparse Factorization Optimization [Tips & Tricks]

K. C. Ho, Danyan Lin, Gang Wang, Xin Liao
1 citations
IEEE Signal Processing Magazine
Advanced Data Compression Techniques
1.28
article

A Fast Multiplierless Discrete Fourier Transform Approximation by Sparse Factorization Optimization [Tips & Tricks]

K. C. Ho, Danyan Lin, Gang Wang, Xin Liao
article en
1 citations

Abstract

Provides society information that may include news, reviews or technical notes that should be of interest to practitioners and researchers.

IEEE Signal Processing MagazineVol. 42(2)
Ningbo University (CN), Hunan University (CN), University of Missouri (US)
Openalex Percentile: Top 17%
Advanced Data Compression Techniques
1.28
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.