ABSTRACT: Sparse Fast Fourier Transform (SFFT) is a recently proposed highly efficient Fourier transform algorithm. It can also be utilized to extract the K largest frequency coefficients from the N-point sequence, which is sparse in the frequency domain. Although SFFT has a higher algorithm efficiency than FFTW (Frigo & Johnson 2005), the SFFT algorithm still has higher computational requirements because of its complexity. In this paper, we present a parallel implementation of SFFT on the Texas Instruments’ TMS320C6678 multicore Digital Signal Processor (DSP). The result showed that the SFFT implementation on multicore DSP could obtain an acceleration of up to 1.9 times that of a single-threaded PC. With the advantages of low power and low cost, DSP-based SFFT implementation is particularly suitable for embedded systems.