Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantization”

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.

At least 541 records · Page 30

Perceptual compression of magnitude-detected synthetic aperture radar imagery

A perceptually-based approach for compressing synthetic aperture radar (SAR) imagery is presented. Key components of the approach are a multiresolution wavelet transform, a bit allocation mask based on an empirical human visual system (HVS) model, and hybrid scalar/vector quantization. Specifically, wavelet shrinkage techniques are used to segregate wavelet transform coefficients into three components: local means, edges, and texture. Each of these three components is then quantized separately according to a perceptually-based bit allocation scheme. Wavelet coefficients associated with local means and edges are quantized using high-rate scalar quantization while texture information is quantized using low-rate vector quantization. The impact of the perceptually-based multiresolution compression algorithm on visual image quality, impulse response, and texture properties is assessed for fine-resolution magnitude-detected SAR imagery; excellent image quality is found at bit rates at or above 1 bpp along with graceful performance degradation at rates below 1 bpp.

Gorman, John D.↗

Perceptually Lossless Wavelet Compression

The Discrete Wavelet Transform (DWT) decomposes an image into bands that vary in spatial frequency and orientation. It is widely used for image compression. Measures of the visibility of DWT quantization errors are required to achieve optimal compression. Uniform quantization of a single band of coefficients results in an artifact that is the sum of a lattice of random amplitude basis functions of the corresponding DWT synthesis filter, which we call DWT uniform quantization noise. We measured visual detection thresholds for samples of DWT uniform quantization noise in Y, Cb, and Cr color channels. The spatial frequency of a wavelet is r 2(exp -1), where r is display visual resolution in pixels/degree, and L is the wavelet level. Amplitude thresholds increase rapidly with spatial frequency. Thresholds also increase from Y to Cr to Cb, and with orientation from low-pass to horizontal/vertical to diagonal. We propose a mathematical model for DWT noise detection thresholds that is a function of level, orientation, and display visual resolution. This allows calculation of a 'perceptually lossless' quantization matrix for which all errors are in theory below the visual threshold. The model may also be used as the basis for adaptive quantization schemes.

Watson, Andrew B.↗

Optimal Compression of Floating-Point Astronomical Images Without Significant Loss of Information

We describe a compression method for floating-point astronomical images that gives compression ratios of 6 - 10 while still preserving the scientifically important information in the image. The pixel values are first preprocessed by quantizing them into scaled integer intensity levels, which removes some of the uncompressible noise in the image. The integers are then losslessly compressed using the fast and efficient Rice algorithm and stored in a portable FITS format file. Quantizing an image more coarsely gives greater image compression, but it also increases the noise and degrades the precision of the photometric and astrometric measurements in the quantized image. Dithering the pixel values during the quantization process greatly improves the precision of measurements in the more coarsely quantized images. We perform a series of experiments on both synthetic and real astronomical CCD images to quantitatively demonstrate that the magnitudes and positions of stars in the quantized images can be measured with the predicted amount of precision. In order to encourage wider use of these image compression methods, we have made available a pair of general-purpose image compression programs, called fpack and funpack, which can be used to compress any FITS format image.

Pence, William D.↗

Foundations of Quantum Mechanics: Derivation of a dissipative Schrödinger equation from first principles

Dissipation in Quantum Mechanics took some time to become a robust field of investigation after the birth of the field. The main issue hindering developments in the field is that the Quantization process was always tightly connected to the Hamiltonian formulation of Classical Mechanics. In this paper we present a quantization process that does not depend upon the Hamiltonian formulation of Classical Mechanics (although still departs from Classical Mechanics) and thus overcome the problem of finding, from first principles, a completely general Schrödinger equation encompassing dissipation. This generalized process of quantization is shown to be nothing but an extension of a more restricted version that is shown to produce the Schrödinger equation for Hamiltonian systems from first principles (even for Hamiltonian velocity dependent potential). - Highlights: • A Quantization process independent of the Hamiltonian formulation of quantum Mechanics is proposed. • This quantization method is applied to dissipative or absorptive systems. • A Dissipative Schrödinger equation is derived from first principles.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical exploration of three relativistic particles in a finite volume including two-particle resonances and bound states

In this work, we use an extension of the quantization condition, given in ref. [1], to numerically explore the finite-volume spectrum of three relativistic particles, in the case that two-particle subsets are either resonant or bound. The original form of the relativistic three-particle quantization condition was derived under a technical assumption on the two- particle K matrix that required the absence of two-particle bound states or narrow two- particle resonances. Here we describe how this restriction can be lifted in a simple way using the freedom in the definition of the K-matrix-like quantity that enters the quantization condition. With this in hand, we extend previous numerical studies of the quantization condition to explore the finite-volume signature for a variety of two- and three-particle interactions. We determine the spectrum for parameters such that the system contains both dimers (two-particle bound states) and one or more trimers (in which all three particles are bound), and also for cases where the two-particle subchannel is resonant. We also show how the quantization condition provides a tool for determining infinite-volume dimer- particle scattering amplitudes for energies below the dimer breakup. We illustrate this for a series of examples, including one that parallels physical deuteron-nucleon scattering. All calculations presented here are restricted to the case of three identical scalar particles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Photon pumping in a weakly-driven quantum cavity–spin system

Highlights: • We study photon frequency conversion in a driven spin coupled to a cavity mode. • Quantized frequency conversion is excpected in the strong-drive adiabatic limit. • A new photon pumping effect is established in the accessible weak drive regime. • Pumping is linked to the delocalization of the corresponding Floquet states. • Quantum coherence is preserved in both the strong and ultraweak-drive limits. We investigate the photon pumping effect in a topological model consisting of a periodically driven spin-1/2 coupled to a quantum cavity mode out of the adiabatic limit. In the strong-drive adiabatic limit, a quantized frequency conversion of photons is expected as the temporal analog of the Hall current. We numerically establish a novel photon pumping phenomenon in the experimentally accessible nonadiabatic driving regime for a broad region of the parameter space. The photon frequency conversion efficiency exhibits strong fluctuations and high efficiency that can reach up 80% of the quantized value for commensurate frequency combinations. We link the pumping properties to the delocalization of the corresponding Floquet states which display multifractal behavior as the result of hybridization between localized and delocalized sectors. Finally we demonstrate that the quantum coherence properties of the initial state are preserved during the frequency conversion process in both the strong and ultra-weak-drive limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Composite fermions in Fock space: Operator algebra, recursion relations, and order parameters

We develop recursion relations, in particle number, for all (unprojected) Jain composite fermion (CF) wave functions. These recursions generalize a similar recursion originally written down by Read for Laughlin states, in mixed first-second quantized notation. In contrast, our approach is purely second-quantized, giving rise to an algebraic, “pure guiding center” definition of CF states that de-emphasizes first quantized many-body wave functions. Key to the construction is a second-quantized representation of the flux attachment operator that maps any given fermion state to its CF counterpart. An algebra of generators of edge excitations is identified. In particular, in those cases where a well-studied parent Hamiltonian exists, its properties can be entirely understood in the present framework, and the identification of edge state generators can be understood as an instance of “microscopic bosonization.” Here, the intimate connection of Read's original recursion with “nonlocal order parameters” generalizes to the present situation, and we are able to give explicit second-quantized formulas for nonlocal order parameters associated with CF states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Three level delta modulation

The basic concept of three-level delta modulation (TLDM) is to quantize the error signal of a delta modulator into three levels instead of the usual two levels as in ordinary DM. A TLDM system must be able to transmit three different signals, corresponding to three possible states of the quantizer, whereas the ordinary DM system has to transmit only two signals. The problem of transmitting these signals over a noisy channel is examined, where the input signal is band-limited Gaussian noise. Two parameters that can be adjusted to optimize the performance of the system with respect to quantizing noise are considered: step size and quantizer threshold setting. The effect of additive channel noise on the performance of a TLDM system is assessed in terms of baseband transmission, probability of error, FSK and PSK transmission, transmission bandwidth, and baseband pulse transmission. It is concluded that TLDM can provide a 5 to 6 dB improvement in quantizing signal to noise ratio over ordinary DM for band-limited Gaussian signals. This improvement can be achieved without increasing the channel bandwidth and with an increase in system threshold of less than 2 dB.

Frank, J.↗

Improved image decompression for reduced transform coding artifacts

The perceived quality of images reconstructed from low bit rate compression is severely degraded by the appearance of transform coding artifacts. This paper proposes a method for producing higher quality reconstructed images based on a stochastic model for the image data. Quantization (scalar or vector) partitions the transform coefficient space and maps all points in a partition cell to a representative reconstruction point, usually taken as the centroid of the cell. The proposed image estimation technique selects the reconstruction point within the quantization partition cell which results in a reconstructed image which best fits a non-Gaussian Markov random field (MRF) image model. This approach results in a convex constrained optimization problem which can be solved iteratively. At each iteration, the gradient projection method is used to update the estimate based on the image model. In the transform domain, the resulting coefficient reconstruction points are projected to the particular quantization partition cells defined by the compressed image. Experimental results will be shown for images compressed using scalar quantization of block DCT and using vector quantization of subband wavelet transform. The proposed image decompression provides a reconstructed image with reduced visibility of transform coding artifacts and superior perceived quality.

Orourke, Thomas P.↗

Differentiable Neural Architecture, Mixed Precision and Accelerator Co-Search

Quantization, effective Neural Network architecture, and efficient accelerator hardware are three important design paradigms to maximize accuracy and efficiency. Mixed Precision Quantization is a process of assigning different precision to different Neural Network layers for optimized inference. Neural Architecture Search (NAS) is a process of automatically designing the neural network for a task and can also be extended to search for the precision of each weight and activation matrix. In this paper, we develop the following three methods: (i) Fast Differentiable Hardware-aware Mixed Precision Quantization Search method to find optimal precision, (ii) Joint Differentiable hardware-aware Architecture and Mixed Precision Quantization Co-search, (iii) Joint Accelerator, Architecture, and Precision triple co-search to find best possibilities in all the three worlds. We demonstrate the effectiveness of our proposed methods targeting Bitfusion accelerator by searching mixed precision models on MobilenetV2. We achieve better accuracy-latency trade-off models than the manually designed and previously proposed search methods.

97 MATHEMATICS AND COMPUTING↗

The LISE package: solvers for static and time-dependent superfluid local density approximation equations in three dimensions

Nuclear implementation of the density functional theory (DFT) is at present the only microscopic framework applicable to the whole nuclear landscape. The extension of DFT to superfluid systems in the spirit of the Kohn-Sham approach, the superfluid local density approximation (SLDA) and its extension to time-dependent situations, time-dependent superfluid local density ap- proximation (TDSLDA), have been extensively used to describe various static and dynamical problems in nuclear physics, neutron star crust, and cold atom systems. In this paper, we present the codes that solve the static and time-dependent SLDA equations in three-dimensional coordinate space without any symmetry restriction. These codes are fully parallelized with the message passing interface (MPI) library and take advantage of graphic processing units (GPU) for accelerating execution. The dynamic codes have checkpoint/restart capabilities and for initial conditions one can use any generalized Slater determinant type of wave function. The code can describe a large number of physical problems: nuclear fission, collisions of heavy ions, the interaction of quantized vor- tices with nuclei in the nuclear star crust, excitation of superfluid fermion systems by time dependent external fields, quantum shock waves, domain wall generation and propagation, the dynamics of the Anderson-Bogoliubov-Higgs mode, dynamics of fragmented condensates, vortex rings dynamics, generation and dynamics of quantized vortices, their crossing and recombinations and the incipient phases of quantum turbulence.

Jin, Shi↗

Joint Sparsity Pattern Recovery With 1-b Compressive Sensing in Distributed Sensor Networks

In this paper, we study the problem of joint sparse support recovery with 1-b quantized compressive measurements in a distributed sensor network. Multiple nodes in the network are assumed to observe sparse signals having the same but unknown sparse support. Each node quantizes its measurement vector element-wise to 1 b. First, we consider that all the quantized measurements are available at a central fusion center. We derive performance bounds for sparsity pattern recovery using 1-bit quantized measurements from multiple sensors when the maximum likelihood decoder is employed. We further develop two computationally tractable algorithms for joint sparse support recovery in the centralized setting. One algorithm minimizes a cost function defined as the sum of the likelihood function and the l-∝ quasi-norm, while the other algorithm extends the binary iterative hard thresholding algorithm to the multiple measurement vector case. Second, we consider a decentralized setting where each node transmits 1-b measurements to its one-hop neighbors. The basic idea behind the algorithms developed in the decentralized setting is to embed collaboration among nodes and fusion strategies. We show that even with noisy 1-b compressed measurements, joint support recovery can be carried out accurately in both centralized and decentralized settings. Additionally, we further show that the performance of the proposed 1-bit compressive sensing-based algorithms is very close to that of their real-valued counterparts except when the signal-to-noise ratio is very small.

97 MATHEMATICS AND COMPUTING↗

Artificial dynamical effects in quantum field theory

In Newtonian mechanics, studying a system in a non-Galilean reference frame can lead to inertial pseudoforces appearing, such as the centrifugal force that seems to arise in dynamics analysed in a rotating frame. Likewise, artificial effects may arise in relativistic quantum field theory (QFT) if a system is studied in a framework that violates Poincaré invariance. Here, we highlight how such issues complicate the traditional canonical quantization of QFTs and can lead to a subjective description of natural phenomena. By contrast, the treatment of the same problem using light-front quantization is free from spurious pseudoeffects because Poincaré invariance is effectively preserved for all practical intents and purposes. We illustrate these statements using several examples: the Gerasimov-Drell-Hearn (GDH) relation, a fundamental feature of QFT; the absence of any measurable impact of Lorentz contraction in high-energy collisions; and the fictitious character of vacuum fluctuation contributions to the cosmological constant.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Observation of half-quantum flux in the unconventional superconductor β-Bi2Pd

Magnetic flux quantization is one of the defining properties of a superconductor. We report the observation of half-integer magnetic flux quantization in mesoscopic rings of superconducting β-Bi 2 Pd thin films. The half-quantum fluxoid manifests itself as a π phase shift in the quantum oscillation of the superconducting critical temperature. This result verifies unconventional superconductivity of β-Bi 2 Pd and is consistent with a spin-triplet pairing symmetry. Our findings may have implications for flux quantum bits in the context of quantum computing.

phonons, thermal conductivity, thermoelectric, spi↗

Pythia8 Quark and Gluon Jets (float8 e4m3FN)

A float8 (e4m3FN) quantized version of the quark and gluon jet dataset originally published by Komiske, Metodiev, and Thaler (Zenodo record 3164691). Only the 20-file subset without charm and bottom quark jets is included here. All simulation parameters and jet selection criteria are identical to the original: Pythia 8.226, √s = 14 TeV Quarks from WeakBosonAndParton:qg2gmZq, gluons from WeakBosonAndParton:qqbar2gmZg with the Z decaying to neutrinos FastJet 3.3.0, anti-k_t jets with R = 0.4 p_T^jet ∈ [500, 550] GeV, |y^jet| < 1.7 There are 20 files, each in compressed NumPy format (QG_jets_fp8e4m3fn_0.npz through QG_jets_fp8e4m3fn_19.npz). Each file contains two arrays: X: (100000, M, 4) — 50k quark and 50k gluon jets, randomly sorted, padded to max multiplicity M, with particle features (pt, rapidity, azimuthal angle, pdgid) y: (100000,) — jet labels, gluon = 0, quark = 1 Since NumPy has no native fp8 dtype, X is stored as float32, but the values have been quantized through TensorFlow's float8_e4m3fn type and carry only fp8 precision. The quantization procedure is as follows: a global per-channel scale factor is computed from the absolute maximum value across all 20 chunks (with FP8_MAX = 448.0, the maximum representable value of e4m3FN). Each chunk is then scaled into the fp8 dynamic range, round-tripped through tf.experimental.float8_e4m3fn, and scaled back. This global scaling ensures a consistent quantization grid across the full dataset. The y labels are unchanged. Users should be aware that e4m3FN has limited dynamic range and precision. We recommend verifying this format is appropriate for your application; for a less aggressive reduction see the float16 and float32 versions linked below. If you use this dataset, please cite the original Zenodo record and its associated paper: Komiske, Metodiev, Thaler, Energy Flow Networks: Deep Sets for Particle Jets, JHEP 01 (2019) 121, arXiv:1810.05165

DiLullo, Nicholas [Brown University] (ORCID:000000↗

Research study on stabilization and control. Modern sampled-data control theory: Stability analysis of the low cost large space telescope system

The pointing stability of the low-cost large space telescope (LST) system was investigated. The low-cost LST is characterized by the use of reaction wheels for the generation of control torques. Because of the critical requirement on the pointing accuracy of the LST, the nonlinear frictional characteristics of the bearings of the reaction wheels were studied which can cause limit cycles in a closed-loop system. Another possible source of pointing error in the LST is due to the effect of quantization and sensor noise. Since the LST is a digital system, digital to analog and analog to digital converters and sensors for positional and rate feedbacks were used. Sensor noise and amplitude quantization causes pointing error in the LST and, in addition, quantization is a nonlinear phenomenon which can cause self-sustained oscillations in the closed-loop system. The dynamic modeling of the single-axis LST is described, and several methods of evaluating the attitude error of the digital LST due to quantization and noise inputs are given.

Kuo, B. C.↗

Fixed-point error analysis of Winograd Fourier transform algorithms

The quantization error introduced by the Winograd Fourier transform algorithm (WFTA) when implemented in fixed-point arithmetic is studied and compared with that of the fast Fourier transform (FFT). The effect of ordering the computational modules and the relative contributions of data quantization error and coefficient quantization error are determined. In addition, the quantization error introduced by the Good-Winograd (GW) algorithm, which uses Good's prime-factor decomposition for the discrete Fourier transform (DFT) together with Winograd's short length DFT algorithms, is studied. Error introduced by the WFTA is, in all cases, worse than that of the FFT. In general, the WFTA requires one or two more bits for data representation to give an error similar to that of the FFT. Error introduced by the GW algorithm is approximately the same as that of the FFT.

Patterson, R. W.↗

Image data compression having minimum perceptual error

A method for performing image compression that eliminates redundant and invisible image components is described. The image compression uses a Discrete Cosine Transform (DCT) and each DCT coefficient yielded by the transform is quantized by an entry in a quantization matrix which determines the perceived image quality and the bit rate of the image being compressed. The present invention adapts or customizes the quantization matrix to the image being compressed. The quantization matrix comprises visual masking by luminance and contrast techniques and by an error pooling technique all resulting in a minimum perceptual error for any given bit rate, or minimum bit rate for a given perceptual error.

Watson, Andrew B.↗