Share Email Print
cover

Proceedings Paper

Delay generation methods with reduced memory requirements
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Modern diagnostic ultrasound beamformers require delay information for each sample along the image lines. In order to avoid storing large amounts of focusing data, delay generation techniques have to be used. In connection with developing a compact beamformer architecture, recursive algorithms were investigated. These included an original design and a technique developed by another research group. A piecewise-linear approximation approach was also investigated. Two imaging setups were targeted -- conventional beamforming with a sampling frequency of 40 MHz and subsample precision of 2 bits, and an oversampled beamformer that performs a sparse sample processing by reconstructing the in-phase and quadrature components of the echo signal for 512 focal points. The algorithms were synthesized for a FPGA device XCV2000E-7, for a phased array image with a depth of 15 cm. Their performance was as follows: (1) For the best parametric approach, the gate count was 2095, the maximum operation speed was 131.9 MHz, the power consumption at 40 MHz was 10.6 mW, and it requires 4 12-bit words for each image line and channel. (2) For the piecewise-linear approximation, the corresponding numbers are 1125 gates, 184.9 MHz, 7.8 mW, and 15 16-bit words.

Paper Details

Date Published: 23 May 2003
PDF: 10 pages
Proc. SPIE 5035, Medical Imaging 2003: Ultrasonic Imaging and Signal Processing, (23 May 2003); doi: 10.1117/12.479957
Show Author Affiliations
Borislav Gueorguiev Tomov, Technical Univ. of Denmark (Denmark)
Jorgen Arendt Jensen, Technical Univ. of Denmark (Denmark)


Published in SPIE Proceedings Vol. 5035:
Medical Imaging 2003: Ultrasonic Imaging and Signal Processing
William F. Walker; Michael F. Insana, Editor(s)

© SPIE. Terms of Use
Back to Top