Download now Free registration required
Compared with FFT (Fast Fourier Transform), only addition and subtraction operations are involved in FMT (Fast M-sequence Transform). In this paper, three classes of fast correlation algorithms for Gold large sets of Kasami sequences are proposed, where FMT is used for fast computation instead of FFT. Analytic results show that computational complexity can be greatly reduced by V-FMT Class and U-FMT Class algorithms. These proposed correlation algorithms with possible applications in low spectral density wireless communications such as the DS/CDMA system.
- Format: PDF
- Size: 353.37 KB