caption: The FFT algorithm A nice, memory efficient algorithm exists if the number of points is a power of 2.
exif: {"Image DocumentName": "The FFT algorithm A nice, memory efficient algorithm exists if the number of points is a power of 2.", "Image ImageDescription": "Each component can be written as a sum of components from a transform of the interval divided in half. It maybe makes sense that the number of steps depends on log N.", "Image XResolution": "300", "Image YResolution": "300", "Image ResolutionUnit": "Pixels/Inch", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}