"A note on the computational complexity of the arithmetic Fourier transform."

Nazif Tepedelenlioglu (1989)

> Home

Details and statistics

DOI: 10.1109/29.32291

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/Tepedelenlioglu89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsp/Tepedelenlioglu89
Nazif Tepedelenlioglu:
A note on the computational complexity of the arithmetic Fourier transform. IEEE Trans. Acoust. Speech Signal Process. 37(7): 1146-1147 (1989)

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.