Ultrasound Systems

Ultrasound Front End

Everything that decides image quality happens between the transducer and the first displayed pixel. That stretch of the system has a fixed power budget and no time to think.

The receive chain is where the image is won or lost

Echoes arriving at a transducer array are weak, wideband and arrive at different times at every element. The analog front end compensates gain with depth and digitises them; the beamforming unit then delays, weights and sums them into one line of the image. Whatever information that chain discards is gone before any image processing runs.

Almost every commercial system uses delay and sum beamforming, because it is cheap. It also assumes the medium is a homogeneous diffuse scatterer, so delays and apodization weights depend only on the Euclidean distance from a pixel to each element. That assumption holds for speckle and fails for bone, needles and vessel walls, whose reflections are highly directive.

Better beamformers exist. Delay multiply and sum recovers resolution and contrast, but it generates harmonics that must stay inside the processable band of the system, which restricts it to lower transducer frequencies. Minimum variance methods compute weights from the data itself, at a cost of O(n3) in the aperture size: roughly 98.78 GOPs per frame for a 368 by 128 frame. Deep beamformers reconstruct beautifully and do not fit on an edge device.

The work below treats that as a hardware question rather than an algorithm question. Each project asks what the receive chain can be made to do inside the resource and latency budget of an FPGA or an embedded GPU.

Block diagram of an ultrasound receive chain: echoes from tissue reach an array of transducer elements, pass through an analog front end performing time gain compensation and analog to digital conversion, then a beamforming unit performing delay calculation, interpolation and apodization weighting, and finally post-beamforming processing for demodulation, log compression and scan conversion.
Fig. 1 The receive signal chain. Analog front end applies time gain compensation and digitisation; the beamforming unit applies delays and apodization weights across Nc channels before demodulation, log compression and scan conversion.

Let each pixel choose its own beamformer

A system that ships one beamforming scheme has to pick the compromise in advance. Delay and sum suffers high sidelobes and limited resolution; delay multiply and sum gives finer detail at depth but cannot be used above the frequency at which its harmonics leave the processable band. Choosing between them is a property of the transducer and of the tissue region, not of the product.

Two architectures make that choice reconfigurable with almost no extra logic. Both modify the existing delay and sum and delay multiply and sum datapaths so a single core can run either, selected by a flag Qf derived from the transducer centre frequency. Because each core is built per pixel and pixels are independent, the selection can also be made per pixel: regions that need resolution get delay multiply and sum, regions that need contrast to noise ratio get delay and sum.

The two architectures

FBRA
Fully bypassed reconfigurable architecture. The multiply stage is bypassed rather than duplicated, so it occupies less logic than the alternative. Preferable where hardware savings are the priority.
MEBRA
Multiplier embedded reconfigurable architecture. Slightly larger, with the cumulative sum transferred from source to destination through the same datapath in both modes.
Block diagram of the FBRA reconfigurable beamforming core showing the mode flag Q sub f selecting between a delay and sum path summing delayed channel data and a delay multiply and sum path taking the signed square root, summing, squaring and halving before a final multiplexer produces the reconfigurable beamformed output.
Fig. 2 FBRA. The mode flag Qf selects between the delay and sum output and the delay multiply and sum output at the final multiplexer, so one core serves both schemes.
Logic utilisation for beamforming a single pixel with Nc = 128, on the xc7z010clg400-1 device, Xilinx Vivado 2019.1.
ArchitectureLogic LUTsRegistersDSPs
FBRA 222 of 17600 196 of 35200 1 of 80
MEBRA 251 of 17600 222 of 35200 1 of 80
Device
xc7z010clg400-1
Clock
125 MHz
Channels
64 / 128 / 256
Square root latency
5 clocks
Resolution
0.33 mm

Hardware increment is close to negligible across Nc = 64, 128 and 256, so the complexity of the reconfigurable core is not constrained by aperture size. Clock counts scale with Nc as expected, with TDAS = Nc + 1. The imaging datasets were sampled at 20.832 MHz from a 5.2 MHz transducer.

Pixel level reconfigurability was demonstrated in simulation on an in vivo carotid artery dataset, with different regions of the same frame beamformed by different schemes.

Four B-mode images of an in vivo carotid artery longitudinal axis dataset. The first is beamformed entirely with delay and sum, the second entirely with delay multiply and sum, and the third and fourth show single frames in which separate regions are labelled DAS and DMAS, demonstrating pixel level selection between the two schemes.
Fig. 3 In vivo carotid artery, longitudinal axis. (a) delay and sum, (b) delay multiply and sum, (c) and (d) single frames in which separate tissue regions are beamformed by different schemes on the same reconfigurable core.

Weights that follow the reflector, not the geometry

Apodization weights the signals across the receive aperture to suppress sidelobes. Under the diffuse assumption those weights are a function of pixel position alone, and the window sits centred on the pixel. A specular reflector, a bone surface or a needle in a guided intervention, sends its energy in a direction set by the angle of incidence and the reflector orientation. The aperture that actually receives that energy is not the one centred on the pixel, so the structure appears distorted or vanishes altogether.

Data adaptive beamforming solves this by computing weights from received data, and pays for it in covariance estimation. Raster apodization design takes a different route: it adjusts the apodization coefficients at pixel level in hardware according to reflection directivity, estimating coefficients for every pixel at a fixed depth simultaneously, in the manner of a raster scan, while reusing a single reference apodization window.

Hardware architecture for raster apodization design, showing a map of apodization window centres indexed by frame depth and current depth, n-bit coefficient registers feeding adders and comparators that produce validity and direction signals, and a bank of shift registers of width N sub c by n bits holding the apodized channel data.
Fig. 4 Raster apodization design. Window centres for a depth are read from block RAM in parallel into buffer block RAMs, and the reference window is shifted per pixel by the required amount in the shift register bank.
Device
XCZ7010clg400-1
Clock
125 MHz
Row latency
260 clocks
Transmit
7.6 MHz, one plane wave
Steering
18°

All raster apodization design block units for a row execute in parallel, giving a latency of 260 clock cycles for a single row. Validation used a Verasonics Vantage 128 with an L11-5v 128 element linear array, imaging a custom needle guided at 20° into the tissue mimicking region of a CIRS Model 769 flow phantom, at a speed of sound of 1540 m/s and attenuation of 0.7 dB/cm/MHz. Coefficients produced by the FPGA were checked against the same computation in MATLAB, and beamformed images were compared against conventional apodization at a 60 dB dynamic range.

A capsule network small enough to synthesise

Adaptive and deep beamformers improve images and do not fit on the devices that would benefit most. CapsBeam is a capsule network beamformer that operates directly on raw radio frequency data and returns the envelope of the beamformed data, from a single non steered plane wave insonification. It was then made deployable, rather than being reported as a model and left there.

Contrast, in vitro versus DAS
+32.31%
Complexity per frame 368 × 128
28.79 ~6 GOPs
Dynamic routing throughput after optimisation
0.37 17.4 GOPS

Against standard delay and sum, in vitro data showed a 32.31% increase in contrast with gains of 16.54% axial and 6.7% lateral resolution; in silico data showed 26% contrast with 13.6% axial and 21.5% lateral. In vivo, artefacts were reduced. Getting from there onto a board took three separate reductions: multi layer LookAhead Kernel Pruning compressed the model by 85% without affecting image quality, quantisation from 32 bit to 16 bit doubled the data moved per transaction, and the exponential in the routing algorithm was replaced by a Taylor expansion of multiplications and additions.

Architecture of the CapsBeam accelerator: a processing system block connects through an AXI interconnect and two DMA units to an AXI stream, which feeds a block RAM holding weights, activations and parameters, a convolution module, a dynamic routing module, a processing element array, and a squash and exponential unit. Raw radio frequency data enters at one end and a B-mode image leaves at the other.
Fig. 5 The CapsBeam accelerator. Separate convolution and dynamic routing modules share a 4 by 128 processing element array, with weights, activations and parameters held in on chip block RAM.
Reconstruction rate of the optimised CapsBeam accelerator against lightweight beamformers, on the Xilinx ZCU104 evaluation kit.
ModelFrames per second
CapsBeam optimised2.07
Tiny-VBF1.48
Tiny-CNN1.41
CNN0.015

The accelerator reaches 30 GOPS on the convolution operation and 17.4 GOPS on dynamic routing. Compared against minimum variance beamforming at 98.78 GOPs per frame, the optimised model needs roughly 6.

Consecutive frames are nearly the same frame

A tissue adaptive network run at high frame rate recomputes, for every frame, feature maps that barely changed since the last one. FeatuReBeam exploits that similarity to skip redundant computation, and borrows the (m,k) model from real time scheduling to keep the skipping honest: at least m out of every k consecutive frames are computed in full, which bounds how far output quality can drift before a mandatory frame resets it.

Each frame is classified as mandatory or optional. Mandatory frames run the pretrained beamformer end to end and publish their feature maps; optional frames reuse the similar maps and compute only what differs. Inter frame similarity determines the window size k and the filter choosing rate per layer.

Methodology flowchart for FeatuReBeam. Radio frequency data from the transducer is preprocessed into delay compensated data and passed to a pretrained model, whose reconstructed frames are used to compute inter frame similarity, estimate window size k, extract similar feature maps between frames, estimate the filter choosing rate and design a feature reuse model. Feature maps from mandatory frames feed the feature reuse model running on CPU or FPGA, which produces the beamformed image and reconstructed frame.
Fig. 6 Feature reuse is designed offline from inter frame similarity, then deployed on CPU or FPGA. Feature maps from mandatory frames are what optional frames reuse.
Computational complexity image quality preserved
−50% and beyond
Latency on Xilinx ZU7EV U-Net / GoogLeNet
−45% / −46%
Against filter pruning magnitude and feature map based
+14%

Evaluation used U-Net and GoogLeNet based beamformers on in vitro and in vivo data. The method cut computational complexity by more than half while preserving the image quality of the original models, and outperformed both magnitude based and feature map based filter pruning on computational reduction and on output image quality.

The whole chain, in something you can carry

Portable point of care systems have generally chased focused transmit at low frame rate, extending a 16 or 32 channel receive aperture to reach acceptable image quality. High frame rate imaging with non steered plane wave transmit needs a different pipeline. This prototype pairs a programmable handheld acquisition platform, built around two integrated low power 32 channel analog front ends supporting 128 channel transmit and 64 channel receive, with an Nvidia Clara AGX development kit carrying a 24 GB GPU.

Raw radio frequency data is acquired with non steered plane wave transmit, passed through a host system to the Clara AGX, and beamformed there. Six beamformers were implemented in GPU accelerated Python with CuPy: delay and sum on radio frequency and on in phase and quadrature data, pth root delay and sum, baseband delay multiply and sum, and two Fourier domain techniques, Lu’s method and Stolt’s f-k migration.

Block diagram of the portable imaging pipeline. A 128 channel linear ultrasound array connects to a programmable handheld platform containing the analog front end, transmit circuitry and an Artix-7 FPGA, which connects over USB 3 to a host PC, which passes data to an Nvidia Clara AGX performing GPU accelerated beamforming before display. A USB power module supplies the handheld platform over USB Type C.
Fig. 7 The portable imaging pipeline. Acquisition on the handheld platform, beamforming on the Nvidia Clara AGX, with the host system in between.
Transmit / receive
128 ch / 64 ch
Centre freq.
7.5 MHz
Sampling
50 MHz
ADC precision
10 bit
Footprint
150 × 100 mm
A grid of reconstructed B-mode images. The top row shows an in vitro phantom containing an anechoic cyst and point targets, the bottom row a preliminary in vivo scan, each reconstructed by six beamformers: RF-DAS, IQ-DAS, pDAS, BB-DMAS, Lu's method and f-k migration, with lateral axis in millimetres and depth axis in millimetres.
Fig. 8 (a) In vitro phantom with an anechoic cyst and point targets. (b) Preliminary in vivo scan. Both reconstructed through the same pipeline by six beamformers.
Three panels. Panel a plots contrast ratio, axial resolution, contrast to noise ratio and lateral resolution for CPU and GPU implementations of each beamformer, showing closely matched values. Panel b compares execution time of each beamformer on host CPU and on GPU for a grid of 1750 by 64 on a base ten logarithmic time axis. Panel c plots acceleration relative to CPU against imaging grid size for each beamformer.
Fig. 9 (a) Contrast and resolution metrics match between CPU and GPU. (b) Execution time per beamformer for a 1750 by 64 grid, on a logarithmic axis. (c) Acceleration against CPU across imaging grid sizes.

Image quality quantified by standard contrast and resolution metrics was comparable to the CPU implementation. Speedup reached as high as 180 times the CPU implementation for larger imaging grids with RF-DAS, IQ-DAS, pDAS and BB-DMAS, falling to around 5 times for the smallest grids. Lu’s method and f-k migration accelerated least, which the authors flag as needing further work.

Papers behind this page

IEEE Trans. Biomedical Circuits and Systems

Towards A Pixel-Level Reconfigurable Digital Beamforming Core for Ultrasound Imaging

Gayathri Malamal · Mahesh Raveendranatha Panicker
IEEE Transactions on Biomedical Circuits and Systems, vol. 14, no. 3, pp. 570–582, June 2020.
IEEE ISCAS 2024

FPGA based Adaptive Receive Apodization Design for Diagnostic Ultrasound Imaging

Gayathri Malamal · Mahesh Raveendranatha Panicker
2024 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1–4, May 2024.
IEEE UFFC-JS 2024

AI Enabled High Frame Rate Portable Ultrasound Imaging Pipeline: Prototype Implementation with GPU Acceleration

Arun Kumar V · Madhavanunni A. N. · Mahesh Raveendranatha Panicker
2024 IEEE Ultrasonics, Ferroelectrics, and Frequency Control Joint Symposium (UFFC-JS), pp. 1–5, September 2024.
IEEE Trans. VLSI Systems

CapsBeam: Accelerating Capsule Network-Based Beamformer for Ultrasound Nonsteered Plane-Wave Imaging on Field-Programmable Gate Array

Abdul Rahoof · Vivek Chaturvedi · Mahesh Raveendranatha Panicker · Muhammad Shafique
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 33, no. 7, pp. 1934–1944, July 2025.
IEEE Access

FeatuReBeam: Efficient Beamforming for High-Frame Ultrasound Imaging Using Adaptive Feature Reuse With (m,k)-Guarantee

Abdul Rahoof · Vivek Chaturvedi · Mahesh Raveendranatha Panicker · Muhammad Shafique · Gang Quan
IEEE Access, vol. 13, pp. 157526–157536, September 2025. Open access under CC BY-NC-ND 4.0.