"Probabilistic complexity analysis for a class of approximate DFT algorithms."

Joseph M. Winograd, S. Hamid Nawab (1996)

> Home

Details and statistics

DOI: 10.1007/BF00925499

access: closed

type: Journal Article

metadata version: 2020-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/vlsisp/WinogradN96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/vlsisp/WinogradN96
Joseph M. Winograd, S. Hamid Nawab:
Probabilistic complexity analysis for a class of approximate DFT algorithms. J. VLSI Signal Process. 14(2): 193-205 (1996)

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.