"Radix-$N$ Algorithm for Computing $N^{2^{n}}$-Point DFT Approximations."

Luan Portella et al. (2022)

> Home

Details and statistics

DOI: 10.1109/LSP.2022.3200573

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/spl/PortellaCBMC22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/spl/PortellaCBMC22
Luan Portella, Diego F. G. Coelho, Fábio M. Bayer, Arjuna Madanayake, Renato J. Cintra:
Radix-$N$ Algorithm for Computing $N^{2^{n}}$-Point DFT Approximations. IEEE Signal Process. Lett. 29: 1838-1842 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.