Search NASA⌕ Search

SEARCH · Search NASA

Results for “QUANTIZER”

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 37 records · Page 2

Quantization effects in Viterbi decoding rate 1/n convolutional codes

A Viterbi decoder's performance loss due to quantizing data from the additive white Gaussian noise (AWGN) channel is studied. An optimal quantization scheme and branch metric calculation method are presented. The uniformly quantized channel capacity C(sub u)(q) is used to determine the smallest number of quantization bits q that does not cause a significant loss. The quantizer stepsize which maximizes C(sub u)(q) almost minimizes the decoder bit error rate (BER). However, a slightly larger stepsize is better, like the value that minimizes the Bhattacharyya bound. The range and renormalization of state metrics is analyzed, in particular for K = 15 decoders such as the Big Viterbi Decoder (BVD) for the Galileo mission. These results are required to design reduced hardware complexity Viterbi decoders with a negligible quantization loss.

Onyszchuk, I. M.↗

Visual optimization of DCT quantization matrices for individual images

Many image compression standards (JPEG, MPEG, H.261) are based on the Discrete Cosine Transform (DCT). However, these standards do not specify the actual DCT quantization matrix. We have previously provided mathematical formulae to compute a perceptually lossless quantization matrix. Here I show how to compute a matrix that is optimized for a particular image. The method treats each DCT coefficient as an approximation to the local response of a visual 'channel'. For a given quantization matrix, the DCT quantization errors are adjusted by contrast sensitivity, light adaptation, and contrast masking, and are pooled non-linearly over the blocks of the image. This yields an 8x8 'perceptual error matrix'. A second non-linear pooling over the perceptual error matrix yields total perceptual error. With this model we 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.

Watson, Andrew B.↗

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 determined by the quantization of the transform coefficients. The standards do not specify how the DCT coefficients should be quantized. Our approach is to set the quantization level for each coefficient so that the quantization error is at the threshold of visibility. Here we combine results from our previous work to form our 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.

Ahumada, Albert J., Jr.↗

Visibility of Wavelet Quantization Noise

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)-L , 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 describe a mathematical model to predict DWT noise detection thresholds as 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.↗

Visibility of wavelet quantization noise

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 we call DWT uniform quantization noise; it is the sum of a lattice of random amplitude basis functions of the corresponding DWT synthesis filter. 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-lambda, where r is display visual resolution in pixels/degree, and lambda is the wavelet level. Thresholds increase rapidly with wavelet spatial frequency. Thresholds also increase from Y to Cr to Cb, and with orientation from lowpass to horizontal/vertical to diagonal. We construct 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.

NASA Center ARC↗

Quantum simulation of second-quantized Hamiltonians in compact encoding

We describe methods for simulating general second-quantized Hamiltonians using the compact encoding, in which qubit states encode only the occupied modes in physical occupation number basis states. These methods apply to second-quantized Hamiltonians composed of a constant number of interactions, i.e., linear combinations of ladder operator monomials of fixed form. Compact encoding leads to qubit requirements that are optimal up to logarithmic factors. Here, we show how to use sparse Hamiltonian simulation methods for second-quantized Hamiltonians in compact encoding, give explicit implementations for the required oracles, and analyze the methods. We also describe several example applications including the free boson and fermion theories, the φ 4 -theory, and the massive Yukawa model, all in both equal-time and light-front quantization. Our methods provide a general-purpose tool for simulating second-quantized Hamiltonians, with optimal or near-optimal scaling with error and model parameters.

97 MATHEMATICS AND COMPUTING↗

Quantization noise in digital speech

The amount of quantization noise generated in a digital-to-analog converter is dependent on the number of bits or quantization levels used to digitize the analog signal in the analog-to-digital converter. The minimum number of quantization levels and the minimum sample rate were derived for a digital voice channel. A sample rate of 6000 samples per second and lowpass filters with a 3 db cutoff of 2400 Hz are required for 100 percent sentence intelligibility. Consonant sounds are the first speech components to be degraded by quantization noise. A compression amplifier can be used to increase the weighting of the consonant sound amplitudes in the analog-to-digital converter. An expansion network must be installed at the output of the digital-to-analog converter to restore the original weighting of the consonant sounds. This technique results in 100 percent sentence intelligibility for a sample rate of 5000 samples per second, eight quantization levels, and lowpass filters with a 3 db cutoff of 2000 Hz.

Schmidt, O. L.↗

Minimum distortion quantizers

The well-known algorithm of Max is used to determine the minimum distortion quantizers for normal, two-sided exponential, and specialized two-sided gamma input distributions and for mean-square, magnitude, and relative magnitude error distortion criteria. The optimum equally-spaced and unequally-spaced quantizers are found, with the resulting quantizer distortion and entropy. The quantizers, and the quantizers with entropy coding, are compared to the rate distortion bounds for mean-square and magnitude error.

Jones, H. W., Jr.↗

Video data compression using artificial neural network differential vector quantization

An artificial neural network vector quantizer is developed for use in data compression applications such as Digital Video. Differential Vector Quantization is used to preserve edge features, and a new adaptive algorithm, known as Frequency-Sensitive Competitive Learning, is used to develop the vector quantizer codebook. To develop real time performance, a custom Very Large Scale Integration Application Specific Integrated Circuit (VLSI ASIC) is being developed to realize the associative memory functions needed in the vector quantization algorithm. By using vector quantization, the need for Huffman coding can be eliminated, resulting in superior performance against channel bit errors than methods that use variable length codes.

Krishnamurthy, Ashok K.↗

An all digital implementation of a modified Hamming net for video compression with prediction and quantization circuits

The hardware and algorithms used to vector quantize (VQ) predicted pixel intensity differences for real-time video compression are described. The hardware is designed for rapid vector quantization performance, which entails the development of application-specific associative memory circuits. A modified DPCM algorithm is originally examined to determine how neural circuitry could enhance its operation. It was determined that quantization and encoding could be improved by consolidating these two functions into one, and by increasing the amount of information (i.e. number of pixels) quantized at a time. The result is a predictive scheme that vector quantizes differential values. Some of the disadvantages of VQ algorithms are solved using associative memories. The video compression algorithm and the associative memory design are described.

Kaul, Richard↗

Weighted MinMax Algorithm for Color Image Quantization

The maximum intercluster distance and the maximum quantization error that are minimized by the MinMax algorithm are shown to be inappropriate error measures for color image quantization. A fast and effective (improves image quality) method for generalizing activity weighting to any histogram-based color quantization algorithm is presented. A new non-hierarchical color quantization technique called weighted MinMax that is a hybrid between the MinMax and Linde-Buzo-Gray (LBG) algorithms is also described. The weighted MinMax algorithm incorporates activity weighting and seeks to minimize WRMSE, whereby obtaining high quality quantized images with significantly less visual distortion than the MinMax algorithm.

Reitan, Paula J.↗

From Quantum Time to Manifestly Covariant QFT: On the Need for a Quantum-Action-Based Quantization

In quantum time (QT) schemes, time is promoted to a degree of freedom, allowing Lorentz covariance to be made explicit for single particles. We ask whether this can be lifted to QFT so that Lorentz covariance becomes manifest at the Hilbert-space level, rather than being hidden as in the standard canonical formulation. We address this question by proposing a second-quantized approach in which the elementary particle is the QT particle itself, leading naturally to the notion of spacetime field algebras and of quantum action. We show, however, that a naive many-body construction runs into inconsistencies. To pinpoint their origin we introduce a classical counterpart of the second-quantized formalism, spacetime classical mechanics (SCM), and prove a no-go theorem: Dirac quantization of SCM collapses back to standard QFT and therefore hides covariance. We circumvent this problem by presenting a quantum-action-based quantization that yields a spacetime version of quantum mechanics (SQM), making covariance manifest for (interacting) QFTs. Finally, we show that this resolution is tied to a genuine spacetime generalization of the notion of a quantum state, required by causality and closely connected to recent “states over time” proposals and, in dS/CFT–motivated settings, to microscopic notions of timelike entanglement and emergent time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data reduction through optimized scalar quantization for more compact neural networks

Raw data generation for several existing and planned large physics experiments now exceeds TB/s rates, generating untenable data sets in very little time. Those data often demonstrate high dimensionality while containing limited information. Meanwhile, Machine Learning algorithms are now becoming an essential part of data processing and data analysis. Those algorithms can be used offline for post processing and post data analysis, or they can be used online for real time processing providing ultra low latency experiment monitoring. Both use cases would benefit from data throughput reduction while preserving relevant information: one by reducing the offline storage requirements by several orders of magnitude and the other by allowing ultra fast online inferencing with low complexity Machine Learning models. Moreover, reducing the data source throughput also reduces material cost, power and data management requirements. In this work we demonstrate optimized nonuniform scalar quantization for data source reduction. This data reduction allows lower dimensional representations while preserving the relevant information of the data, thus enabling high accuracy Tiny Machine Learning classifier models for online fast inferences. We demonstrate this approach with an initial proof of concept targeting the CookieBox, an array of electron spectrometers used for angular streaking, that was developed for LCLS-II as an online beam diagnostic tool. We used the Lloyd-Max algorithm with the CookieBox dataset to design an optimized nonuniform scalar quantizer. Optimized quantization lets us reduce input data volume by 69% with no significant impact on inference accuracy. When we tolerate a 2% loss on inference accuracy, we achieved 81% of input data reduction. Finally, the change from a 7-bit to a 3-bit input data quantization reduces our neural network size by 38%.

97 MATHEMATICS AND COMPUTING↗

Quantized thermoelectric Hall effect induces giant power factor in a topological semimetal

Abstract Thermoelectrics are promising by directly generating electricity from waste heat. However, (sub-)room-temperature thermoelectrics have been a long-standing challenge due to vanishing electronic entropy at low temperatures. Topological materials offer a new avenue for energy harvesting applications. Recent theories predicted that topological semimetals at the quantum limit can lead to a large, non-saturating thermopower and a quantized thermoelectric Hall conductivity approaching a universal value. Here, we experimentally demonstrate the non-saturating thermopower and quantized thermoelectric Hall effect in the topological Weyl semimetal (WSM) tantalum phosphide (TaP). An ultrahigh longitudinal thermopower $$S_{xx} \sim 1.1 \times 10^3 \, \mu \, {\mathrm{V}} \, {\mathrm{K}}^{ - 1}$$ S x x ~ 1.1 × 1 0 3 μ V K − 1 and giant power factor $$\sim 525 \, \mu \, {\mathrm{W}} \, {\mathrm{cm}}^{ - 1} \, {\mathrm{K}}^{ - 2}$$ ~ 525 μ W cm − 1 K − 2 are observed at ~40 K, which is largely attributed to the quantized thermoelectric Hall effect. Our work highlights the unique quantized thermoelectric Hall effect realized in a WSM toward low-temperature energy harvesting applications.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Conductivity and size quantization effects in semiconductor $$\delta$$-layer systems

Abstract We present an open-system quantum-mechanical 3D real-space study of the conduction band structure and conductive properties of two semiconductor systems, interesting for their beyond-Moore and quantum computing applications: phosphorus $$\delta$$ δ -layers and P $$\delta$$ δ -layer tunnel junctions in silicon. In order to evaluate size quantization effects on the conductivity, we consider two principal cases: nanoscale finite-width structures, used in transistors, and infinitely-wide structures, electrical properties of which are typically known experimentally. For devices widths $$W<10$$ W < 10 nm, quantization effects are strong and it is shown that the number of propagating modes determines not only the conductivity, but the distinctive spatial distribution of the current-carrying electron states. For $$W>10$$ W > 10 nm, the quantization effects practically vanish and the conductivity tends to the infinitely-wide device values. For tunnel junctions, two distinct conductivity regimes are predicted due to the strong conduction band quantization.

36 MATERIALS SCIENCE↗

Giant Graviton Expansion from Bubbling Geometry: Discreteness from Quantized Geometry

The superconformal index of half-BPS states in N = 4 supersymmetric Yang-Mills with gauge group U⁡(N) admits an expansion in terms of giant gravitons, J N (q) = J ∞ ⁡(q)⁢Σ$^{∞}_{m=0}$ q m⁢N ⁢ J^ m ⁡(q), where m is the number of giant gravitons and J ∞ ⁡(q) is the graviton index. The expansion can be viewed as the implementation of trace relations for finite N. We derive this expansion directly in supergravity from the class of half-BPS solutions due to Lin, Lunin, and Maldacena in type IIB supergravity. The moduli space of these configurations can be quantized using covariant quantization methods. We show how this quantization leads to the precise expression for the expansion in terms of giant gravitons. Our proposal provides a derivation of the giant graviton expansion directly in terms of quantized supergravity degrees of freedom, and it recovers discrete data via quantum geometries that are classically nonsmooth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Uniform quantizers for noisy channels

We consider optimum uniform data quantization for noisy channels. We present a general formulation for natural encoding that results in simple expressions for the mean-square error. Specifically, we show that the optimum location of the center of the quantizer is at the mean of the distribution for all error rates. The optimum levels for quantization and the corresponding mean-square error are presented for Gaussian and uniform data. For the latter the width of the optimum quantizer for noisy channels is shown to be smaller than the entire range of probability distribution.

Murthy, B. R. N.↗

The effects of quantization on signal processing

Typically an analog signal from a space system is sampled, quantized by Analog-to-Digital (A/D) conversion, merged into a bit stream, communicated to a ground station, received by the ground station, and processed by the ground station to extract useful information for dissemination to the users. The cost of each of these steps is reduced as the number of quantization steps is reduced in the A/D converter. The number of quantization steps should be as small as possible without losing the required information content. This report deals specifically with the accuracy of averages as a function of the number of quantized samples used to compute the averages with the noise on the analog signal as a parameter. For example, the success of the Visible Infrared Spin Scan Radiometer (VISSR) Atmospheric Sounder (VAS) Demonstration depends upon temporally averaging multiple samples in an effort to reduce noise to a sufficiently low level such that temperature profile sounding is made possible. A tutorial description of this process is presented.

Montgomery, H. E.↗