Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “ENCODER”

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 73 records · Page 4

Many-fermion simulation from the contracted quantum eigensolver without fermionic encoding of the wave function

Quantum computers potentially have an exponential advantage over classical computers for the quantum simulation of many-fermion quantum systems. Nonetheless, fermions are more expensive to simulate than bosons due to the fermionic encoding—a mapping by which the qubits are encoded with fermion statistics. Here we generalize the contracted quantum eigensolver (CQE) to avoid fermionic encoding of the wave function. In contrast to the variational quantum eigensolver, the CQE solves for a many-fermion stationary state by minimizing the contraction (projection) of the Schrödinger equation onto two fermions. We avoid fermionic encoding of the wave function by contracting the Schrödinger equation onto an unencoded pair of particles. Solution of the resulting contracted equation by a series of unencoded two-body exponential transformations generates an unencoded wave function from which the energy and two-fermion reduced density matrix (2-RDM) can be computed. We apply the unencoded and the encoded CQE algorithms to the hydrogen fluoride molecule, the dissociation of oxygen O 2 , and a series of hydrogen chains. Both algorithms show comparable convergence towards the exact ground-state energies and 2-RDMs, but the unencoded algorithm has computational advantages in terms of state preparation and tomography.

74 ATOMIC AND MOLECULAR PHYSICS↗

Fidelity of an encoded [7,1,3] logical zero

I calculate the fidelity of a [7,1,3] Calderbank-Shor-Steane quantum error correction code logical zero state constructed in a nonequiprobable Pauli operator error environment for two methods of encoding. The first method is to apply fault-tolerant error correction to an arbitrary state of seven qubits utilizing Shor states for syndrome measurement. The Shor states are themselves constructed in the nonequiprobable Pauli operator error environment, and their fidelity depends on the number of verifications done to ensure multiple errors will not propagate into the encoded quantum information. Surprisingly, performing these verifications may lower the fidelity of the constructed Shor states. The second encoding method is to simply implement the [7,1,3] encoding gate sequence also in the nonequiprobable Pauli operator error environment. Perfect error correction is applied after both methods to determine the correctability of the implemented errors. I find that which method attains higher fidelity depends on which of the Pauli operators errors is dominant. Nevertheless, perfect error correction applied after the encoding suppresses errors to at least first order for both methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

CovS inactivation reduces CovR promoter binding at diverse virulence factor encoding genes in group A Streptococcus

The control of virulence gene regulator (CovR), also called caspsule synthesis regulator (CsrR), is critical to how the major human pathogen group A Streptococcus fine-tunes virulence factor production. CovR phosphorylation (CovR~P) levels are determined by its cognate sensor kinase CovS, and functional abrogating mutations in CovS can occur in invasive GAS isolates leading to hypervirulence. Presently, the mechanism of CovR-DNA binding specificity is unclear, and the impact of CovS inactivation on global CovR binding has not been assessed. Thus, we performed CovR chromatin immunoprecipitation sequencing (ChIP-seq) analysis in the emm1 strain MGAS2221 and its CovS kinase deficient derivative strain 2221-CovS-E281A. We identified that CovR bound in the promoter regions of nearly all virulence factor encoding genes in the CovR regulon. Additionally, direct CovR binding was observed for numerous genes encoding proteins involved in amino acid metabolism, but we found limited direct CovR binding to genes encoding other transcriptional regulators. The consensus sequence AATRANAAAARVABTAAA was present in the promoters of genes directly regulated by CovR, and mutations of highly conserved positions within this motif relieved CovR repression of the hasA and MGAS2221_0187 promoters. Analysis of strain 2221-CovS-E281A revealed that binding of CovR at repressed, but not activated, promoters is highly dependent on CovR~P state. CovR repressed virulence factor encoding genes could be grouped dependent on how CovR~P dependent variation in DNA binding correlated with gene transcript levels. Taken together, the data show that CovR repression of virulence factor encoding genes is primarily direct in nature, involves binding to a newly-identified DNA binding motif, and is relieved by CovS inactivation. These data provide new mechanistic insights into one of the most important bacterial virulence regulators and allow for subsequent focused investigations into how CovR-DNA interaction at directly controlled promoters impacts GAS pathogenesis.

59 BASIC BIOLOGICAL SCIENCES↗

Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems

Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of research, this manuscript has three distinct purposes. First, we present an intuitive method for synthesizing and analyzing discrete (i.e., integer-based) optimization problems, wherein the problem and corresponding algorithmic primitives are expressed using a discrete quantum intermediate representation (DQIR) that is encoding-independent. This compact representation often allows for more efficient problem compilation, automated analyses of different encoding choices, easier interpretability, more complex runtime procedures, and richer programmability, as compared to previous approaches, which we demonstrate with a number of examples. Second, we perform numerical studies comparing several qubit encodings; the results exhibit a number of preliminary trends that help guide the choice of encoding for a particular set of hardware and a particular problem and algorithm. Our study includes problems related to graph coloring, the traveling salesperson problem, factory/machine scheduling, financial portfolio rebalancing, and integer linear programming. Third, we design low-depth graph-derived partial mixers (GDPMs) up to 16-level quantum variables, demonstrating that compact (binary) encodings are more amenable to QAOA than previously understood. We expect this toolkit of programming abstractions and low-level building blocks to aid in designing quantum algorithms for discrete combinatorial problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Explicit block encodings of boundary value problems for many-body elliptic operators

Simulation of physical systems is one of the most promising use cases of future digital quantum computers. In this work we systematically analyze the quantum circuit complexities of block encoding the discretized elliptic operators that arise extensively in numerical simulations for partial differential equations, including high-dimensional instances for many-body simulations. When restricted to rectangular domains with separable boundary conditions, we provide explicit circuits to block encode the many-body Laplacian with separable periodic, Dirichlet, Neumann, and Robin boundary conditions, using standard discretization techniques from low-order finite difference methods. To obtain high-precision, we introduce a scheme based on periodic extensions to solve Dirichlet and Neumann boundary value problems using a high-order finite difference method, with only a constant increase in total circuit depth and subnormalization factor. We then present a scheme to implement block encodings of differential operators acting on more arbitrary domains, inspired by Cartesian immersed boundary methods. We then block encode the many-body convective operator, which describes interacting particles experiencing a force generated by a pair-wise potential given as an inverse power law of the interparticle distance. This work provides concrete recipes that are readily translated into quantum circuits, with depth logarithmic in the total Hilbert space dimension, that block encode operators arising broadly in applications involving the quantum simulation of quantum and classical many-body mechanics.

Kharazi, Tyler [University of California, Berkeley↗

The complexity of deterministic source encoding with a fidelity criterion

Block encoding of discrete, memoryless sources with equiprobable outputs subject to a fidelity criterion is discussed. The encoder is assumed to be deterministic and a lower bound is derived on the amount of computational work required to encode such sources as a function of the code rate and fidelity of the encoding. An example is given to show that the bound cannot be substantially improved. These bounds apply primarily to sources and distortion measures which are such that the minimum distortion given by the rate-distortion bound is not achievable with a finite block length, deterministic encoder.

Savage, J. E.↗

On the detection of differentially encoded polyphase signals.

Consideration of the transmission and detection of differentially encoded multiple phase-shift-keyed (MPSK) signals, paying particular attention to the ambiguity resolution problem resulting from suppression of the transmitted carrier. A study is made of the coherent detection of differentially encoded MPSK signals, and the performance of a differentially encoded MPSK system is compared with that of a system which transmits absolutely encoded polyphase signals and performs perfect ambiguity resolution. Both the perfect and noisy reference signal cases are treated. Also, the performance of coherent detection of differentially encoded MPSK signals is compared with that of differentially coherent reception of the same signal set.

Lindsey, W. C.↗

A command encoding scheme for a multiplexed space communications link

This paper describes a command encoding scheme which was conceived to provide the necessary error protection for digital commands from a ground-based terminal to a manned spacecraft. The selected approach is compatible with a time-division multiplexing scheme which combines the command channel with two digital voice channels prior to transmission over the RF link. The command encoding scheme is also fully compatible with a channel encoding strategy which is applied to the multiplexed bit sequence (commands plus voice) to provide increased link efficiency. Implementation aspects of the command encoder and decoder are discussed and the system end-to-end performance improvement provided by the command encoding scheme is calculated.

Huth, G. K.↗

The realization of arithmetic processors for delta modulation encoded signals

The design and realization of digital devices which add or multiply delta modulation (DM) encoded signals are presented. These systems operate directly on the DM bit stream. It is shown that the devices can be constructed using standard digital hardware and that the hardware complexity needed to add or multiply the two DM encoded signals is equivalent to that needed for pulse code modulation (PCM) signals. Experimental results are presented showing the operation of these systems. The results obtained by adding or multiplying DM encoded signals are compared with those obtained using PCM encoded signals on the basis of signal-to-noise ratio (SNR). A spectral-analysis technique applicable to a DM encoded signal is developed to obtain SNR curves.

Locicero, J. L.↗

Video encoding using adaptive delta modulation

Research work is described that was carried out to develop adaptive delta modulators (ADM) capable of encoding black-and-white and color video signals in the presence of high bit error rates. These were a one-dimensional ADM capable of encoding black-and-white pictures and transmitting digitally encoded voice without increase in bandwidth; an ADM capable of encoding color video signals; and an ADM capable of encoding field-sequential color. For each of these three units, the bit rate could be adjusted within the range from 6 to 24 Mbits/sec. The effects of the bit rate and channel errors on the response of the picture are examined.

Schilling, D. L.↗

Architecture for VLSI design of Reed-Solomon encoders

A description is given of the logic structure of the universal VLSI symbol-slice Reed-Solomon (RS) encoder chip, from a group of which an RS encoder may be constructed through cascading and proper interconnection. As a design example, it is shown that an RS encoder presently requiring approximately 40 discrete CMOS ICs may be replaced by an RS encoder consisting of four identical, interconnected VLSI RS encoder chips, offering in addition to greater compactness both a lower power requirement and greater reliability.

Liu, K. Y.↗

Negative base encoding in optical linear algebra processors

In the digital multiplication by analog convolution algorithm, the bits of two encoded numbers are convolved to form the product of the two numbers in mixed binary representation; this output can be easily converted to binary. Attention is presently given to negative base encoding, treating base -2 initially, and then showing that the negative base system can be readily extended to any radix. In general, negative base encoding in optical linear algebra processors represents a more efficient technique than either sign magnitude or 2's complement encoding, when the additions of digitally encoded products are performed in parallel.

Perlee, C.↗

Software package for performing experiments about the convolutionally encoded Voyager 1 link

A software package enabling engineers to conduct experiments to determine the actual performance of long constraint-length convolutional codes over the Voyager 1 communication link directly from the Jet Propulsion Laboratory (JPL) has been developed. Using this software, engineers are able to enter test data from the Laboratory in Pasadena, California. The software encodes the data and then sends the encoded data to a personal computer (PC) at the Goldstone Deep Space Complex (GDSC) over telephone lines. The encoded data are sent to the transmitter by the PC at GDSC. The received data, after being echoed back by Voyager 1, are first sent to the PC at GDSC, and then are sent back to the PC at the Laboratory over telephone lines for decoding and further analysis. All of these operations are fully integrated and are completely automatic. Engineers can control the entire software system from the Laboratory. The software encoder and the hardware decoder interface were developed for other applications, and have been modified appropriately for integration into the system so that their existence is transparent to the users. This software provides: (1) data entry facilities, (2) communication protocol for telephone links, (3) data displaying facilities, (4) integration with the software encoder and the hardware decoder, and (5) control functions.

Cheng, U.↗

Efficient Encoding and Rendering of Time-Varying Volume Data

Visualization of time-varying volumetric data sets, which may be obtained from numerical simulations or sensing instruments, provides scientists insights into the detailed dynamics of the phenomenon under study. This paper describes a coherent solution based on quantization, coupled with octree and difference encoding for visualizing time-varying volumetric data. Quantization is used to attain voxel-level compression and may have a significant influence on the performance of the subsequent encoding and visualization steps. Octree encoding is used for spatial domain compression, and difference encoding for temporal domain compression. In essence, neighboring voxels may be fused into macro voxels if they have similar values, and subtrees at consecutive time steps may be merged if they are identical. The software rendering process is tailored according to the tree structures and the volume visualization process. With the tree representation, selective rendering may be performed very efficiently. Additionally, the I/O costs are reduced. With these combined savings, a higher level of user interactivity is achieved. We have studied a variety of time-varying volume datasets, performed encoding based on data statistics, and optimized the rendering calculations wherever possible. Preliminary tests on workstations have shown in many cases tremendous reduction by as high as 90% in both storage space and inter-frame delay.

CODING↗

Encoding of symbols for a computer interconnect based on frequency of symbol values

Data are serially communicated over an interconnect between an encoder and a decoder. The encoder includes a first training unit to count a frequency of symbol values in symbol blocks of a set of N number of symbol blocks in an epoch. A circular shift unit of the encoder stores a set of most-recently-used (MRU) amplitude values. An XOR unit is coupled to the first training unit and the first circular shift unit as inputs and to the interconnect as output. A transmitter is coupled to the encoder XOR unit and the interconnect and thereby contemporaneously sends symbols and trains on the symbols. In a system, a device includes a receiver and decoder that receive, from the encoder, symbols over the interconnect. The decoder includes its own training unit for decoding the transmitted symbols.

SeyedzadehDelcheh, SeyedMohammad↗

Encoders for block-circulant LDPC codes

In this paper, we present two encoding methods for block-circulant LDPC codes. The first is an iterative encoding method based on the erasure decoding algorithm, and the computations required are well organized due to the block-circulant structure of the parity check matrix. The second method uses block-circulant generator matrices, and the encoders are very similar to those for recursive convolutional codes. Some encoders of the second type have been implemented in a small Field Programmable Gate Array (FPGA) and operate at 100 Msymbols/second.

encoders↗

Epstein-Barr virus-encoded latent membrane protein 1 induces epithelial to mesenchymal transition by inducing V-set Ig domain containing 4 (VSIG4) expression via NF-kB in renal tubular epithelial HK-2 cells

The epithelial to mesenchymal transition (EMT), a hallmark of chronic kidney disease, is a key event in the conversion from tubular epithelial cells to myofibroblasts in renal fibrosis. Epstein-Barr virus (EBV) is a γ-herpes oncovirus associated with chronic kidney disease. However, the relationship between EBV and the EMT process in renal tubular epithelial cells is not well understood. Among EBV-latent genes, EBV-encoded latent membrane protein 1 (LMP1) induces EMT by regulating a variety of molecules in EBV-induced oncogenic transformation. In this study, we investigated EBV-encoded LMP1 and EMT process markers in human proximal tubule epithelial cell line HK-2. LMP1 overexpression induces cell morphological changes via the epithelial to mesenchymal process in HK-2 cells, and these changes accelerate cell proliferation, cell motility, and invasion. Furthermore, VSIG4 upregulation by EBV-LMP1 induced LMP1-mediated EMT, cell motility, and invasion. VSIG4 upregulation by LMP1 was regulated at the transcriptional level via the NF-kB signaling axis. These results suggest that EBV-encoded LMP1 regulates EMT through the NF-kB-VSIG4 axis in HK-2 cells, and VSIG4 is a potential target in EBV-induced chronic kidney diseases. - Highlights: • Epstein Barr virus-encoded LMP1 overexpression induces epithelial to mesenchymal transition in renal epithelial HK-2 cells. • Upregulation of VISG4 expression by EBV-LMP1 plays an important role in LMP1-induced EMT process in HK-2 cells. • VSIG4 upregulation by EBV-LMP1 is regulated at transcriptional level via LMP1-induced NF-kB activation. • The interruption of VSIG4 expression could be a potential strategy for treatment of EBV-infected renal diseases.

60 APPLIED LIFE SCIENCES↗

An encoder–decoder LSTM-based EMPC framework applied to a building HVAC system

Numerous studies have demonstrated the benefit of economic model predictive control (EMPC) applied to building heating, ventilation, and air conditioning (HVAC) systems. However, the construction and training of predictive models for building HVAC systems are widely recognized as a key technological barrier preventing large-scale adoption of EMPC for buildings. In this work, an encoder–decoder long short-term memory-based EMPC framework is developed. The key advantage of the approach is that a model may be automatically generated from a list of inputs and outputs. From the definition of inputs and outputs, the constructed model may be trained and automatically embedded into the EMPC framework for real-time estimation and control. The overall end-to-end EMPC framework from model training to on-line estimation and control are described. To this end, the encoder–decoder model provides a natural framework for state estimation (encoder), which is required to provide an initial condition for the predictive model of EMPC (decoder). Closed-loop simulations using EnergyPlus are performed to demonstrate the approach. The simulated closed-loop system consists of a building zone from a multi-zone building, which is served by an air handling unit-variable air volume HVAC system. For the HVAC example considered, the trained encoder–decoder model can predict the indoor air temperature and HVAC sensible cooling rate of a building zone over a two-day horizon with high accuracy. Overall, we find that considering a time-of-use electric rate structure, the EMPC, which manipulates the zone temperature setpoint, can reduce the HVAC power consumption cost relative to keeping the zone temperature setpoint at its maximum value (i.e., minimum energy approach).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗