wiffleball 4,790 Posted April 16, 2024 I just googled FFT. Damn, these fantasy leagues are getting intense. Fast Fourier Transform (FFT) is an algorithm that computes the Discrete Fourier Transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa. The DFT is obtained by decomposing a sequence of values into components of different frequencies.[1] This operation is useful in many fields, but computing it directly from the definition is often too slow to be practical. An FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse (mostly zero) factors.[2] As a result, it manages to reduce the complexity of computing the DFT from �(�2), which arises if one simply applies the definition of DFT, to �(�log�), where n is the data size Share this post Link to post Share on other sites
tubby_mcgee 701 Posted April 16, 2024 220, 221 whatever it takes. 1 Share this post Link to post Share on other sites
kilroy69 1,250 Posted April 16, 2024 It was always McNair. 1 Share this post Link to post Share on other sites
Bert 1,128 Posted April 16, 2024 1 hour ago, kilroy69 said: It was always McNair. Maybe but Pennington is still alive. Share this post Link to post Share on other sites
BeenHereBefore 1,523 Posted April 16, 2024 1 hour ago, Bert said: Maybe but Pennington is still alive. But Pennington INT rate is higher. Share this post Link to post Share on other sites
cmh6476 1,025 Posted April 17, 2024 Never bench your studs Share this post Link to post Share on other sites