{"repository":{"description":"Fast Fourier Transform (FFT) algorithm is one of the corner stones modern computational science and engineering. I have been working on FFT-related projects over the past few years and accumulated a large collection of notes and code examples. They are particularly useful for beginners who wants to quickly get started with the algorithm.  ","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":116,"owner":"ningli","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-06-19T04:08:48-07:00","pushed_at":"2013-06-19T04:36:36-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Ning Li","company":"The Numerical Algorithm Group (NAG)","location":"Oxford, UK","email":"7c3cdbaac10a7f3692b2c4f11edf3b47f1ecdf27@nag.co.uk"},"url":"https://github.com/ningli/fft-examples/wiki/Bluestein%27s-FFT-algorithm"}