Abstract
DFT contained by strip spectral correlation algorithm (SSCA) was computed by AFT to obtain the cyclic spectral when the length of DFT was not the integral power of 2. And multiplication of AFT algorithm was modified. By virtue of conversion parameter between real multiplication and real addition, the paper presented the closed-form expression of modified AFT, FFT and DFT employing the number of addition, and the computational complexity of SSCA was analyzed in terms of them. And SSCA was realized by AFT, through which its performance was simulated as well. Simulation results prove that SSCA with arbitrary resolution can be realized with minimum computational complexity if DFT is calculated using FFT or AFT according to different resolution.
| Original language | English |
|---|---|
| Pages (from-to) | 1040-1043 |
| Number of pages | 4 |
| Journal | Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology |
| Volume | 40 |
| Issue number | 7 |
| State | Published - Jul 2008 |
Keywords
- Arithmetic Fourier transform (AFT)
- Computation complexity
- Cyclic spectral correlation
- Strip spectral correlation algorithm
Fingerprint
Dive into the research topics of 'Research of SSCA with arbitrary resolution'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver