Search NASA⌕ Search

SEARCH · Search NASA

Results for “Data compression (Telecommunication)”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

Application specific compression : final report.

With the continuing development of more capable data gathering sensors, comes an increased demand on the bandwidth for transmitting larger quantities of data. To help counteract that trend, a study was undertaken to determine appropriate lossy data compression strategies for minimizing their impact on target detection and characterization. The survey of current compression techniques led us to the conclusion that wavelet compression was well suited for this purpose. Wavelet analysis essentially applies a low-pass and high-pass filter to the data, converting the data into the related coefficients that maintain spatial information as well as frequency information. Wavelet compression is achieved by zeroing the coefficients that pertain to the noise in the signal, i.e. the high frequency, low amplitude portion. This approach is well suited for our goal because it reduces the noise in the signal with only minimal impact on the larger, lower frequency target signatures. The resulting coefficients can then be encoded using lossless techniques with higher compression levels because of the lower entropy and significant number of zeros. No significant signal degradation or difficulties in target characterization or detection were observed or measured when wavelet compression was applied to simulated and real data, even when over 80% of the coefficients were zeroed. While the exact level of compression will be data set dependent, for the data sets we studied, compression factors over 10 were found to be satisfactory where conventional lossless techniques achieved levels of less than 3.

99 GENERAL AND MISCELLANEOUS↗

Simultaneous broadband laser ranging and photonic Doppler velocimetry for dynamic compression experiments

A diagnostic was developed to simultaneously measure both the distance and velocity of rapidly moving surfaces in dynamic compression experiments, specifically non-planar experiments where integrating the velocity in one direction does not always give the material position accurately. The diagnostic is constructed mainly from fiber-optic telecommunications components. The distance measurement is based on a technique described by Xia and Zhang [Opt. Express 18, 4118 (2010)], which determines the target distance every 20 ns and is independent of the target speed. We have extended the full range of the diagnostic to several centimeters to allow its use in dynamic experiments, and we multiplexed it with a photonic Doppler velocimetry (PDV) system so that distance and velocity histories can be measured simultaneously using one fiber-optic probe. The diagnostic was demonstrated on a spinning square cylinder to show how integrating a PDV record can give an incorrect surface position and how the ranging diagnostic described here obtains it directly. The diagnostic was also tested on an explosive experiment where copper fragments and surface ejecta were identified in both the distance and velocity signals. We show how the distance measurements complement the velocity data. Potential applications are discussed.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

CODAS Data from Oliktok Point, Beaufort Sea, Alaska

Cryosphere/Ocean Distributed Acoustic Sensing (CODAS) data collected from the Beaufort Sea, Alaska, using ~37.4 km of dark telecommunications fiber located at Oliktok Point, Alaska. Data were collected with a Silixa iDAS, using 10 m gauge length, 2 m spatial resolution, and 1000 Hz sample rate. Provided here are the DAS-recorded time series for the rapid refreeze event described in Baker & Abbott (2022) (see link below). This covers a date range of 2021-11-10 15:00 UTC to 2021-11-11 17:00 UTC. Data have been decimated to 100 Hz and 20 m (i.e., every 10th channel for 1831 channels, total), as used in Baker & Abbott (2022). Data have been extracted from raw format into 1-hour long .sac* files and organized into directories by channel number, spanning channels 100 to 18400. Time series units are nano-strainrate (nm/m/s). For distribution, data have been compressed into .zip files containing all time series files for 100 channels. *For information on the Seismic Analysis Code (SAC) file format: https://seiscode.iris.washington.edu/projects/sac

16 TIDAL AND WAVE POWER↗

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗