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 19 records

Comparing light-front quantization with instant-time quantization

Here in this paper we compare light-front quantization and instant-time quantization both at the level of operators and at the level of their Feynman diagram matrix elements. At the level of operators light-front quantization and instant-time quantization lead to equal light-front time commutation (or anticommutation) relations that appear to be quite different from equal instant-time commutation (or anticommutation) relations. Despite this we show that at unequal times instant-time and light-front commutation (or anticommutation) relations actually can be transformed into each other, with it only being the restriction to equal times that makes the commutation (or anticommutation) relations appear to be so different. While our results are valid for both bosons and fermions, for fermions there are subtleties associated with tip of the light cone contributions that need to be taken care of. At the level of Feynman diagrams we show for non-vacuum Feynman diagrams that the pole terms in four-dimensional light-front Feynman diagrams reproduce the widely used three-dimensional light-front on-shell Hamiltonian Fock space formulation in which the light-front energy and light-front momentum are on shell. Moreover, we show that the contributions of pole terms in non-vacuum instant-time and non-vacuum light-front Feynman diagrams are equal. However, because of circle at infinity contributions we show that this equivalence of pole terms fails for four-dimensional light-front vacuum tadpole diagrams. Then, and precisely because of these circle at infinity contributions, we show that light-front vacuum tadpole diagrams are not only nonzero, they quite remarkably are actually equal to the pure pole term instant-time vacuum tadpole diagrams. Light-front vacuum diagrams are not correctly describable by the on-shell Hamiltonian formalism, and thus not by the closely related infinite momentum frame prescription either. Thus for the light-front vacuum sector we must use the off-shell Feynman formalism as it contains information that is not accessible in the on-shell Hamiltonian Fock space approach. We show that light-front quantization is intrinsically nonlocal, and that for fermions this nonlocality is present in Ward identities. One can project fermion spinors into so-called good and bad components, and both of these components contribute in Ward identities. Central to our analysis is that the transformation from instant-time coordinates and fields to light-front coordinates and fields is a unitary, spacetime-dependent translation. Consequently, not only are instant-time quantization and light-front quantization equivalent, because of general coordinate invariance they are unitarily equivalent.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Intrinsic quantized anomalous Hall effect in a moiré heterostructure

The quantum anomalous Hall (QAH) effect combines topology and magnetism to produce precisely quantized Hall resistance at zero magnetic field. We report the observation of a QAH effect in twisted bilayer graphene aligned to hexagonal boron nitride. The effect is driven by intrinsic strong interactions, which polarize the electrons into a single spin- and valley-resolved moiré miniband with Chern number C = 1. In contrast to magnetically doped systems, the measured transport energy gap is larger than the Curie temperature for magnetic ordering, and quantization to within 0.1% of the von Klitzing constant persists to temperatures of several kelvin at zero magnetic field. Electrical currents as small as 1 nanoampere controllably switch the magnetic order between states of opposite polarization, forming an electrically rewritable magnetic memory.

Science & Technology - Other Topics↗

High-temperature quantum valley Hall effect with quantized resistance and a topological switch

Edge states of a topological insulator can be used to explore fundamental science emerging at the interface of low dimensionality and topology. Achieving a robust conductance quantization, however, has proven challenging for helical edge states. In this work, we show wide resistance plateaus in kink states—a manifestation of the quantum valley Hall effect in Bernal bilayer graphene—quantized to the predicted value at zero magnetic field. The plateau resistance has a very weak temperature dependence up to 50 kelvin and is flat within a dc bias window of tens of millivolts. We demonstrate the electrical operation of a topology-controlled switch with an on/off ratio of 200. These results demonstrate the robustness and tunability of the kink states and its promise in constructing electron quantum optics devices.

Science & Technology - Other Topics↗

Quantization: History and problems

In this work, I explore the concept of quantization as a mapping from classical phase space functions to quantum operators. I discuss the early history of this notion of quantization with emphasis on the works of Schrödinger and Dirac, and how quantization fit into their overall understanding of quantum theory in the 1920's. Dirac, in particular, proposed a quantization map which should satisfy certain properties, including the property that quantum commutators should be related to classical Poisson brackets in a particular way. However, in 1946, Groenewold proved that Dirac's mapping was inconsistent, making the problem of defining a rigorous quantization map more elusive than originally expected. This result, known as the Groenewold-Van Hove theorem, is not often discussed in physics texts, but here I will give an account of the theorem and what it means for potential ``corrections” to Dirac's scheme. Other proposals for quantization have arisen over the years, the first major one being that of Weyl in 1927, which was later developed by many, including Groenewold, and which has since become known as Weyl Quantization in the mathematical literature. Another, known as Geometric Quantization, formulates quantization in differential-geometric terms by appealing to the character of classical phase spaces as symplectic manifolds; this approach began with the work of Souriau, Kostant, and Kirillov in the 1960's. I will describe these proposals for quantization and comment on their relation to Dirac's original program. Along the way, the problem of operator ordering and of quantizing in curvilinear coordinates will be described, since these are natural questions that immediately present themselves when thinking about quantization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A visual detection model for DCT coefficient quantization

The discrete cosine transform (DCT) is widely used in image compression and is part of the JPEG and MPEG compression standards. The degree of compression and the amount of distortion in the decompressed image are controlled by the quantization of the transform coefficients. The standards do not specify how the DCT coefficients should be quantized. One approach is to set the quantization level for each coefficient so that the quantization error is near the threshold of visibility. Results from previous work are combined to form the current best detection model for DCT coefficient quantization noise. This model predicts sensitivity as a function of display parameters, enabling quantization matrices to be designed for display situations varying in luminance, veiling light, and spatial frequency related conditions (pixel size, viewing distance, and aspect ratio). It also allows arbitrary color space directions for the representation of color. A model-based method of optimizing the quantization matrix for an individual image was developed. The model described above provides visual thresholds for each DCT frequency. These thresholds are adjusted within each block for visual light adaptation and contrast masking. For given quantization matrix, the DCT quantization errors are scaled by the adjusted thresholds to yield perceptual errors. These errors are pooled nonlinearly over the image to yield total perceptual error. With this model one may estimate the quantization matrix for a particular image that yields minimum bit rate for a given total perceptual error, or minimum perceptual error for a given bit rate. Custom matrices for a number of images show clear improvement over image-independent matrices. Custom matrices are compatible with the JPEG standard, which requires transmission of the quantization matrix.

Ahumada, Albert J., Jr.↗

QONNX: Representing Arbitrary-Precision Quantized Neural Networks

We present extensions to the Open Neural Network Exchange (ONNX) intermediate representation format to represent arbitrary-precision quantized neural networks. We first introduce support for low precision quantization in existing ONNX-based quantization formats by leveraging integer clipping, resulting in two new backward-compatible variants: the quantized operator format with clipping and quantize-clip-dequantize (QCDQ) format. We then introduce a novel higher-level ONNX format called quantized ONNX (QONNX) that introduces three new operators -- Quant, BipolarQuant, and Trunc -- in order to represent uniform quantization. By keeping the QONNX IR high-level and flexible, we enable targeting a wider variety of platforms. We also present utilities for working with QONNX, as well as examples of its usage in the FINN and hls4ml toolchains. Finally, we introduce the QONNX model zoo to share low-precision quantized neural networks.

Pappalardo, Alessandro↗

Ps and Qs: Quantization-Aware Pruning for Efficient Low Latency Neural Network Inference

Efficient machine learning implementations optimized for inference in hardware have wide-ranging benefits, depending on the application, from lower inference latency to higher data throughput and reduced energy consumption. Two popular techniques for reducing computation in neural networks are pruning, removing insignificant synapses, and quantization, reducing the precision of the calculations. In this work, we explore the interplay between pruning and quantization during the training of neural networks for ultra low latency applications targeting high energy physics use cases. Techniques developed for this study have potential applications across many other domains. We study various configurations of pruning during quantization-aware training, which we term quantization-aware pruning, and the effect of techniques like regularization, batch normalization, and different pruning schemes on performance, computational complexity, and information content metrics. We find that quantization-aware pruning yields more computationally efficient models than either pruning or quantization alone for our task. Further, quantization-aware pruning typically performs similar to or better in terms of computational efficiency compared to other neural architecture search techniques like Bayesian optimization. Surprisingly, while networks with different training configurations can have similar performance for the benchmark application, the information content in the network can vary significantly, affecting its generalizability.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Bandwidth compression of synthetic aperture radar imagery by quantization of raw radar data

A study is made of the effects of quantization of the radar returns transmitted from aircraft or spacecraft employing a synthetic aperture radar system. The study is based on the output images obtained after one-bit, two-bit, and eight-bit quantizations and comparing the results to ground truth. In this way the degradation resulting from data or bandwidth reduction is determined. Quantization is evaluated in terms of crater scene, number of looks, and transmission error rate. It is found that two-bit quantization of raw radar data from homogeneous scenes processed to 32 looks yields nearly all the details of the original. One-bit quantization of raw radar data from homogeneous scenes processed to 32 looks yields a good visual representation of the scene but some fine detail is lost and the absolute reflectivity level is not reliable. Image quality is observed to improve with more looks and video and intermediate frequency quantization are not distinguishable even for one-bit quantizations. Image quality is not influenced by bit error rates less than about 2 to the -7th power.

Lipes, R. G.↗

An adaptive quantization method for burst mode synthetic aperture radar data

Synthetic aperture radar (SAR) has high data rate because it collects and processes the data coherently. The data rate limitation of the system has to be satisfied while maintaining good image quality. Thus, a quantizer with minimum data rate and high SNR should be employed. An adaptive quantization method is proposed for the burst mode SAR. This adaptive quantizer uses uniformly quantized data to select a subset of bits which is equivalent to changing the step size of the uniform quantizer. A simple implementation which uses the previous burst data to compute the local statistics for the bit selection is presented. The use of previous burst simplifies the implementation because it does not require storage or delay; however, an abrupt change in the terrain could result in incorrect bit selection. An error analysis of this implementation and comparison of two burst mode SAR images formed using the uniformly quantized and adaptively quantized data is presented.

Joo, T. H.↗

DCT quantization matrices visually optimized for individual images

This presentation describes how a vision model incorporating contrast sensitivity, contrast masking, and light adaptation is used to design visually optimal quantization matrices for Discrete Cosine Transform image compression. The Discrete Cosine Transform (DCT) underlies several image compression standards (JPEG, MPEG, H.261). The DCT is applied to 8x8 pixel blocks, and the resulting coefficients are quantized by division and rounding. The 8x8 'quantization matrix' of divisors determines the visual quality of the reconstructed image; the design of this matrix is left to the user. Since each DCT coefficient corresponds to a particular spatial frequency in a particular image region, each quantization error consists of a local increment or decrement in a particular frequency. After adjustments for contrast sensitivity, local light adaptation, and local contrast masking, this coefficient error can be converted to a just-noticeable-difference (jnd). The jnd's for different frequencies and image blocks can be pooled to yield a global perceptual error metric. With this metric, we can compute for each image the quantization matrix that minimizes the bit-rate for a given perceptual error, or perceptual error for a given bit-rate. Implementation of this system demonstrates its advantages over existing techniques. A unique feature of this scheme is that the quantization matrix is optimized for each individual image. This is compatible with the JPEG standard, which requires transmission of the quantization matrix.

Watson, Andrew B.↗

Charge- 4 e and Charge- 6 e Flux Quantization and Higher Charge Superconductivity in Kagome Superconductor Ring Devices

The flux quantization is a key indication of electron pairing in superconductors. For example, the well-known h / 2 e flux quantization is considered strong evidence for the existence of charge- 2 e , two-electron Cooper pairs. Here we report evidence for multicharge flux quantization in mesoscopic ring devices fabricated using the transition-metal kagome superconductor CsV 3 Sb 5 . We perform systematic magnetotransport measurements and observe unprecedented quantization of magnetic flux in units of h / 4 e and h / 6 e in magnetoresistance oscillations. Specifically, at low temperatures, magnetoresistance oscillations with period h / 2 e are detected, as expected from the flux quantization for charge- 2 e superconductivity. We find that the h / 2 e oscillations are suppressed and replaced by resistance oscillations with h / 4 e periodicity when the temperature is increased. Increasing the temperature further suppresses the h / 4 e oscillations, and robust resistance oscillations with h / 6 e periodicity emerge as evidence for charge- 6 e flux quantization. Our observations provide the first experimental evidence for the existence of multicharge flux quanta and emergent quantum matter exhibiting higher-charge superconductivity in the strongly fluctuating region above the charge- 2 e Cooper pair condensate, revealing new insights into the intertwined and vestigial electronic order in kagome superconductors. Published by the American Physical Society 2024

Physics↗

Quantizing and sampling considerations in digital phased-locked loops

The quantizer problem is first considered. The conditions under which the uniform white sequence model for the quantizer error is valid are established independent of the sampling rate. An equivalent spectral density is defined for the quantizer error resulting in an effective SNR value. This effective SNR may be used to determine quantized performance from infinitely fine quantized results. Attention is given to sampling rate considerations. Sampling rate characteristics of the digital phase-locked loop (DPLL) structure are investigated for the infinitely fine quantized system. The predicted phase error variance equation is examined as a function of the sampling rate. Simulation results are presented and a method is described which enables the minimum required sampling rate to be determined from the predicted phase error variance equations.

Hurst, G. T.↗

Some effects of quantization on a noiseless phase-locked loop

If the VCO of a phase-locked receiver is to be replaced by a digitally programmed synthesizer, the phase error signal must be sampled and quantized. Effects of quantizing after the loop filter (frequency quantization) or before (phase error quantization) are investigated. Constant Doppler or Doppler rate noiseless inputs are assumed. The main result gives the phase jitter due to frequency quantization for a Doppler-rate input. By itself, however, frequency quantization is impractical because it makes the loop dynamic range too small.

Greenhall, C. A.↗

Adaptive Quantizer for Burst Synthetic-Aperture Radar

Adaptive quantizer for burst-mode synthetic-aperture radar reduces data rate of return signal. Device, called block floating-point quantizer (BFPQ) basically analog-to-digital converter that covers wide dynamic range and discards appropriate lower order bits. BFPQ is, in effect, digital approximator with automatic gain control. Moves floatingpoint marker binary representation of signal data in accordance with perceived dynamic range. Available step sizes thus limited to multiples of underlying smallest quantization step (represented by lowest order bit). Retains only first K most significant bits of signal; (L,K) BFPQ is one that does K-bit quantization of signal originally quantized to L bits. Quantization error simply difference between actual signal level and its binary approximation. Other potential applications for BFPQ include speech compression and picture data compression.

Joo, T. H.↗

A recursive technique for adaptive vector quantization

Vector Quantization (VQ) is fast becoming an accepted, if not preferred method for image compression. The VQ performs well when compressing all types of imagery including Video, Electro-Optical (EO), Infrared (IR), Synthetic Aperture Radar (SAR), Multi-Spectral (MS), and digital map data. The only requirement is to change the codebook to switch the compressor from one image sensor to another. There are several approaches for designing codebooks for a vector quantizer. Adaptive Vector Quantization is a procedure that simultaneously designs codebooks as the data is being encoded or quantized. This is done by computing the centroid as a recursive moving average where the centroids move after every vector is encoded. When computing the centroid of a fixed set of vectors the resultant centroid is identical to the previous centroid calculation. This method of centroid calculation can be easily combined with VQ encoding techniques. The defined quantizer changes after every encoded vector by recursively updating the centroid of minimum distance which is the selected by the encoder. Since the quantizer is changing definition or states after every encoded vector, the decoder must now receive updates to the codebook. This is done as side information by multiplexing bits into the compressed source data.

Lindsay, Robert A.↗