"Algorithms meeting the lower bounds on the multiplicative complexity of ..."

Pierre Duhamel (1990)

> Home

Details and statistics

DOI: 10.1109/29.60070

access: closed

type: Journal Article

metadata version: 2020-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tsp/Duhamel90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsp/Duhamel90
Pierre Duhamel:
Algorithms meeting the lower bounds on the multiplicative complexity of length-2ⁿ DFTs and their connection with practical algorithms. IEEE Trans. Acoust. Speech Signal Process. 38(9): 1504-1511 (1990)

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.