1 / 19

An FFT/IFFT Accelerator for OCT Application

An FFT/IFFT Accelerator for OCT Application. Zhenhong Liu. What is OCT?. OCT = Optical Coherence Tomography An optical analogy of Ultrasound Tomography Provide micrometer-resolution Light source is not harmful (unlike x-ray). Optical coherence tomogram of a fingertip

khanh
Télécharger la présentation

An FFT/IFFT Accelerator for OCT Application

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An FFT/IFFT Accelerator for OCT Application • Zhenhong Liu

  2. What is OCT? • OCT = Optical Coherence Tomography • An optical analogy of Ultrasound Tomography • Provide micrometer-resolution • Light source is not harmful (unlike x-ray) Optical coherence tomogram of a fingertip (http://en.wikipedia.org/wiki/File:HautFingerspitzeOCT.gif)

  3. Data Processing • 3 FFT/IFFT in the algorithm • # of data point is large: 1024/2048

  4. Sample Data • 16-bit int for image data, converted to floating-point during processing • single precision floating-point for background and calibration data • output to a gray scale bmp file, 1024x1024 pixels

  5. Using Floating-point

  6. Using Fixed-point • Fixed-point number (WL, FL): • Keep twiddle factors (32, 30) • Change the fractional length for input/output data. • Prevent overflow during FFT/IFFT: arithmetic right shift the output by 1 bit after every butterfly operation in FFT or IFFT.

  7. Using Fixed-point (32, 2) (32, 4)

  8. Using Fixed-point (32, 4) (32, 6)

  9. Using Fixed-point f-p (32, 6)

  10. Fixed-point + Approx. Twiddle Factor • Very sensitive to twiddle factor • Simply reduce the fraction length is not effective: • OK for the twiddle factors >> 0 • Large errors for twiddle factors ~ 0

  11. Approx. Twiddle Factor • A suitable approx. multiplier • Finish a multiplication in n iterations • Round A to a number that has n 1’s at most • Store the positions of the 1’s in SRAM • Requires that A does not change often • The larger n is, the more accurate the product is

  12. Fixed-point + Approx. Twiddle Factor n=1 n=2

  13. Fixed-point + Approx. Twiddle Factor n=3 n=4

  14. Fixed-point + Approx. Twiddle Factor fp n=4

  15. Hardware Implementation • Original design only supports positive A • need an extra sign bit in SRAM for each entry • xor B with the sign bit. • Support for complex multiplication • two units share one SRAM • no add/sub operation after multiplying • Cannot pipeline the design, use multiple unit in the butterfly unit to increase throughput • n iteration -> n units in a butterfly unit • For IFFT, only need a 1-bit control signal.

  16. Hardware Implementation schematic: One complex multiplying in 2n cycles

  17. Hardware Implementation schematic: Butterfly unit, DIF FFT/IFFT

  18. Hardware Implementation • For N-point FFT/IFFT, each stage takes N/2 cycles • Hardware cost even smaller than using fixed-point accurate multiplier • Should be more power efficient • No visible changes to the output images

  19. Thank you!

More Related