Abstract

Recording of flash-ADC traces is challenging from both the transmission bandwidth and storage cost perspectives. This paper presents a configuration-free lossless compression algorithm which addresses both limitations, by compressing the data on-the-fly in the controlling field-programmable gate array (FPGA). Thus the difference predicted trace compression (DPTC) can easily be used directly in front-end electronics. The method first computes the differences between consecutive samples in the traces, thereby concentrating the most probable values around zero. The values are then stored as groups of four, with only the necessary least-significant bits in a variable-length code, packed in a stream of 32-bit words. To evaluate the efficiency, the storage cost of compressed traces is modeled as a baseline cost including the ADC noise, and a cost for pulses that depends on their amplitude and width. The free parameters and the validity of the model are determined by comparing it with the results of compressing a large set of artificial traces with varying characteristics. The compression method was also applied to actual data from different types of detectors, thereby demonstrating its general applicability. The compression efficiency is found to be comparable to popular general-purpose compression methods, while available for FPGA implementation using limited resources. A typical storage cost is around 4 to 5 bits per sample. Code for the FPGA implementation in VHDL and for the CPU decompression routine in C of DPTC are available as open source software, both operating at multi-100 Msamples/s speeds.

Highlights

  • T HIS work is motivated by developments in data handling in nuclear and particle physics

  • By performing VHDL synthesis for all combinations of the optional pipeline stages, and directing the respective field programmable gate array (FPGA) development toolchain to optimise for speed, the achievable performance as function of resource usage can be determined

  • 2) Barrel Shifter vs. Multiplier Units: A barrel shifter on FPGAs is normally realised as one multiplexer for each output bit

Read more

Summary

INTRODUCTION

T HIS work is motivated by developments in data handling in nuclear and particle physics. Of particular interest for this work is the recording of signal traces, because this is associated with a dramatic increase of data that need to be transferred, compared with a simple digitization of pulse amplitudes. Between 1980 and 2010, the increase was on average a factor 30 every 10 years, with a peak between 1990 and 2005 where the area density doubled and prices per byte fell by half on a yearly basis [5]. If compression is employed as software running on a PC, only data which has already been sent from the signal acquisition unit can be reduced This gives no reduction in the transfer rate demands. To address both limitations, an implementation of the compression directly on the FPGA, where the initial signal processing takes place, is needed. The achieved storage cost reduction is benchmarked using traces from actual detectors

OVERVIEW OF AVAILABLE SOLUTIONS
OPERATING PRINCIPLE
Differencing Procedure
Group Creation
Output Word Formation
OPTIMISATION
Compression Factor Optimisation
Circuit Optimisation
VHDL MODULE INTERFACE
DECOMPRESSION
COMPRESSION EFFICIENCY—STORAGE COST
Bare Trace Cost
Pulse Cost
Pulse-Noise Interaction
Storage Cost Verification—Synthetic Traces
Storage Cost Verification—Actual Traces
Caveat Emptor—How to Ignore ADC Noise
Findings
VIII. CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.