![]() | |
ADSP-21062_FIR.zip The files contained in ADSP-21062 FIR.zip implement an FIR filter per the equation below given input consisting of filter coefficients and samples. This example program reads a buffer of input values stored in memory, passes the data through the filter, and writes the results to another buffer in memory.
Sample input data, filter coefficients, and expected output values are included to aid users in verifying proper results. | |
![]() | |
| |
![]() | |
ADSP-21062_IIR.zip The files contained in ADSP-21062 IIR.zip implement an IIR filter per the equation below given input consisting of filter coefficients and samples. This example program reads a buffer of input values stored in memory, passes the data through the filter, and writes the results to another buffer in memory.
Sample input data, and filter coefficients are included. | |
![]() | |
| |
![]() | |
ADSP-21062_IIR_IRQ.zip The files contained in ADSP-21062 IIR IRQ.zip implement an IIR filter per the equation below given input consisting of filter coefficients and samples. This example reads input data via a memory-mapped I/O port and writes the filtered values to another port. This program also serves to demonstrate how the interval timer can be used to generate processor interrupts at a desired sampling rate and how interrupts are handled on the ADSP-21062. Sample input data, and filter coefficients are included. | |
![]() | |
| |
![]() | |
ADSP-21062_Compl_FFT_rad-2.zip The files contained in ADSP-21062 Compl FFT rad-2.zip contains code and utilities for running and testing a highly optimized Complex Radix-2 DIT FFT on the ADSP-21062. All input and output data are in normal order. The constants and test files are setup for an N=1024 point FFT. To use as is just open it in your VisualDSP Environment. The files in ADSP-21062 Compl FFT rad-2 N256.zip (zip file, 62 KB) contains code and test files for an N=256 point FFT. The smallest FFT calculable by this implementation is N >= 32 points.
| |
![]() | |
| |
![]() | |
ADSP-21062_Compl_FFT_Rad-4.zip The files in ADSP-21062 Compl FFT Rad-4.zip contains code and utilities for running and testing a optimized Complex Radix-4 DIF FFT on the ADSP-21062. All input and output data are in normal order. The constants and test files are setup for an N=1024 point FFT. To use as is just open it in your VisualDSP Environment. This implementation executes about 10% faster than the radix-2 program. The only drawbacks are that the number of points in this program is restricted to a power of four, the program is a bit longer and that there are N/2 more twiddle factors required. The smallest FFT calculable by this implementation is N >= 64 points.
| |
![]() | |
| |
![]() | |
ADSP-21062_Real_FFT_rad-2.zip The files in ADSP-21062 Real FFT rad-2.zip contains code and utilities for running and testing a Real Radix-2 DIT FFT on the ADSP-21062. All input and output data are in normal order. The constants and test files are setup for an N=1024 point FFT. To use as is just open it in your VisualDSP Environment. The smallest FFT calculable by this implementation is N >= 64 points.
| |
![]() | |
| |
![]() | |
ADSP-21062_Real_FFT_Rad-4.zip The files in ADSP-21062 Real FFT Rad-4.zip contains code and utilities for running and testing a optimized Real Radix-4 DIF FFT on the ADSP-21062. All input and output data are in normal order. The constants and test files are setup for an N=2048 point FFT. To use as is just open it in your VisualDSP Environment. This implementation executes about 10% faster than the radix-2 program. The only drawbacks are that the number of points in this program is restricted to two times a power of four, the program is a bit longer and that there are N/2 more twiddle factors required. The smallest FFT calculable by this implementation is N >= 128 points.
|