New answers tagged

1

Since Discrete Fourier Basis Vectors are $2\pi$-Periodic, hence, negative frequencies $-\frac{2\pi k}{N}$ are conventionally represented as $(2\pi - \frac{2\pi k}{N} = \frac{2\pi}{N} (N-k))$. It has nothing to do with Butterfly Structure of FFT Algorithm. The above statement basically means that $-k^{th}$ tone is represented as $(N-k)^{th}$ tone in DFT/FFT. ...


2

Usually, even before someone builds a processor, they write a specification of the instruction set, and then they build a simulator for that. The same applies to TI's C67xx series: https://processors.wiki.ti.com/index.php/List_of_Simulator The wiki article strangely says that TI is moving away from simulation in Code Composer Studio 6, which would honestly ...


1

Good approach to first do a rough calculation of the bandwidths you need. Couple of remarks on that: You forgot a factor of 3, that camera has three "color pixels" per image pixel Your use case screams "I should be using a commercial off-the-shelf USB camera"; don't engineer something very complex if it doesn't have a value proposition ...


Top 50 recent answers are included