Search NASA⌕ Search

SEARCH · Search NASA

Results for “Block encoding”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Low-complexity wavelet filter design for image compression

Image compression algorithms based on the wavelet transform are an increasingly attractive and flexible alternative to other algorithms based on block orthogonal transforms. While the design of orthogonal wavelet filters has been studied in significant depth, the design of nonorthogonal wavelet filters, such as linear-phase (LP) filters, has not yet reached that point. Of particular interest are wavelet transforms with low complexity at the encoder. In this article, we present known and new parameterizations of the two families of LP perfect reconstruction (PR) filters. The first family is that of all PR LP filters with finite impulse response (FIR), with equal complexity at the encoder and decoder. The second family is one of LP PR filters, which are FIR at the encoder and infinite impulse response (IIR) at the decoder, i.e., with controllable encoder complexity. These parameterizations are used to optimize the subband/wavelet transform coding gain, as defined for nonorthogonal wavelet transforms. Optimal LP wavelet filters are given for low levels of encoder complexity, as well as their corresponding integer approximations, to allow for applications limited to using integer arithmetic. These optimal LP filters yield larger coding gains than orthogonal filters with an equivalent complexity. The parameterizations described in this article can be used for the optimization of any other appropriate objective function.

Majani, E.↗
NASA NTRS2008

JPEG 2000 Encoding with Perceptual Distortion Control

An alternative approach has been devised for encoding image data in compliance with JPEG 2000, the most recent still-image data-compression standard of the Joint Photographic Experts Group. Heretofore, JPEG 2000 encoding has been implemented by several related schemes classified as rate-based distortion-minimization encoding. In each of these schemes, the end user specifies a desired bit rate and the encoding algorithm strives to attain that rate while minimizing a mean squared error (MSE). While rate-based distortion minimization is appropriate for transmitting data over a limited-bandwidth channel, it is not the best approach for applications in which the perceptual quality of reconstructed images is a major consideration. A better approach for such applications is the present alternative one, denoted perceptual distortion control, in which the encoding algorithm strives to compress data to the lowest bit rate that yields at least a specified level of perceptual image quality. Some additional background information on JPEG 2000 is prerequisite to a meaningful summary of JPEG encoding with perceptual distortion control. The JPEG 2000 encoding process includes two subprocesses known as tier-1 and tier-2 coding. In order to minimize the MSE for the desired bit rate, a rate-distortion- optimization subprocess is introduced between the tier-1 and tier-2 subprocesses. In tier-1 coding, each coding block is independently bit-plane coded from the most-significant-bit (MSB) plane to the least-significant-bit (LSB) plane, using three coding passes (except for the MSB plane, which is coded using only one "clean up" coding pass). For M bit planes, this subprocess involves a total number of (3M - 2) coding passes. An embedded bit stream is then generated for each coding block. Information on the reduction in distortion and the increase in the bit rate associated with each coding pass is collected. This information is then used in a rate-control procedure to determine the contribution of each coding block to the output compressed bit stream.

Watson, Andrew B.↗
NASA NTRS2004

Accumulate-Repeat-Accumulate-Accumulate-Codes

Inspired by recently proposed Accumulate-Repeat-Accumulate (ARA) codes [15], in this paper we propose a channel coding scheme called Accumulate-Repeat-Accumulate-Accumulate (ARAA) codes. These codes can be seen as serial turbo-like codes or as a subclass of Low Density Parity Check (LDPC) codes, and they have a projected graph or protograph representation; this allows for a high-speed iterative decoder implementation using belief propagation. An ARAA code can be viewed as a precoded Repeat-and-Accumulate (RA) code with puncturing in concatenation with another accumulator, where simply an accumulator is chosen as the precoder; thus ARAA codes have a very fast encoder structure. Using density evolution on their associated protographs, we find examples of rate-lJ2 ARAA codes with maximum variable node degree 4 for which a minimum bit-SNR as low as 0.21 dB from the channel capacity limit can be achieved as the block size goes to infinity. Such a low threshold cannot be achieved by RA or Irregular RA (IRA) or unstructured irregular LDPC codes with the same constraint on the maximum variable node degree. Furthermore by puncturing the accumulators we can construct families of higher rate ARAA codes with thresholds that stay close to their respective channel capacity thresholds uniformly. Iterative decoding simulation results show comparable performance with the best-known LDPC codes but with very low error floor even at moderate block sizes.

density evolution↗
DOE OSTI2016

Causality constraints in conformal field theory

Causality places nontrivial constraints on QFT in Lorentzian signature, for example fixing the signs of certain terms in the low energy Lagrangian. In d dimensional conformal field theory, we show how such constraints are encoded in crossing symmetry of Euclidean correlators, and derive analogous constraints directly from the conformal bootstrap (analytically). The bootstrap setup is a Lorentzian four-point function corresponding to propagation through a shockwave. Crossing symmetry fixes the signs of certain log terms that appear in the conformal block expansion, which constrains the interactions of low-lying operators. As an application, we use the bootstrap to rederive the well known sign constraint on the (Φ) 4 coupling in effective field theory, from a dual CFT. We also find constraints on theories with higher spin conserved currents. As a result, our analysis is restricted to scalar correlators, but we argue that similar methods should also impose nontrivial constraints on the interactions of spinning operators

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1989

Implementation issues in source coding

An edge preserving image coding scheme which can be operated in both a lossy and a lossless manner was developed. The technique is an extension of the lossless encoding algorithm developed for the Mars observer spectral data. It can also be viewed as a modification of the DPCM algorithm. A packet video simulator was also developed from an existing modified packet network simulator. The coding scheme for this system is a modification of the mixture block coding (MBC) scheme described in the last report. Coding algorithms for packet video were also investigated.

Sayood, Khalid↗
NASA NTRS2006

Protograph LDPC Codes Over Burst Erasure Channels

In this paper we design high rate protograph based LDPC codes suitable for binary erasure channels. To simplify the encoder and decoder implementation for high data rate transmission, the structure of codes are based on protographs and circulants. These LDPC codes can improve data link and network layer protocols in support of communication networks. Two classes of codes were designed. One class is designed for large block sizes with an iterative decoding threshold that approaches capacity of binary erasure channels. The other class is designed for short block sizes based on maximizing minimum stopping set size. For high code rates and short blocks the second class outperforms the first class.

protgraph based codes↗
NASA NTRS1992

Least Reliable Bits Coding (LRBC) for high data rate satellite communications

An analysis and discussion of a bandwidth efficient multi-level/multi-stage block coded modulation technique called Least Reliable Bits Coding (LRBC) is presented. LRBC uses simple multi-level component codes that provide increased error protection on increasingly unreliable modulated bits in order to maintain an overall high code rate that increases spectral efficiency. Further, soft-decision multi-stage decoding is used to make decisions on unprotected bits through corrections made on more protected bits. Using analytical expressions and tight performance bounds it is shown that LRBC can achieve increased spectral efficiency and maintain equivalent or better power efficiency compared to that of Binary Phase Shift Keying (BPSK). Bit error rates (BER) vs. channel bit energy with Additive White Gaussian Noise (AWGN) are given for a set of LRB Reed-Solomon (RS) encoded 8PSK modulation formats with an ensemble rate of 8/9. All formats exhibit a spectral efficiency of 2.67 = (log2(8))(8/9) information bps/Hz. Bit by bit coded and uncoded error probabilities with soft-decision information are determined. These are traded with with code rate to determine parameters that achieve good performance. The relative simplicity of Galois field algebra vs. the Viterbi algorithm and the availability of high speed commercial Very Large Scale Integration (VLSI) for block codes indicates that LRBC using block codes is a desirable method for high data rate implementations.

Vanderaar, Mark↗
DOE OSTI2020

PchE Regulation of Escherichia coli O157:H7 Flagella, Controlling the Transition to Host Cell Attachment

Shiga toxins and intimate adhesion controlled by the locus of enterocyte effacement are major enterohemorrhagic Escherichia coli (EHEC) virulence factors. Curli fimbriae also contribute to cell adhesion and are essential biofilm components. The transcriptional regulator PchE represses the expression of curli and their adhesion to HEp-2 cells. Past studies indicate that pchE also represses additional adhesins that contribute to HEp-2 cell attachment. In this study, we tested for pchE regulation of several tissue adhesins and their regulators. Three adhesin-encoding genes (eae, lpfA1, fliC) and four master regulators (csgD, stpA, ler, flhDC) were controlled by pchE. pchE over-expression strongly up-regulated fliC but the marked flagella induction reduced the attachment of O157:H7 clinical isolate PA20 to HEp-2 cells, indicating that flagella were blocking cell attachments rather than functioning as an adhesin. Chemotaxis, motor, structural, and regulatory genes in the flagellar operons were all increased by pchE expression, as was PA20 motility. This study identifies new members in the pchE regulon and shows that pchE stimulates flagellar motility while repressing cell adhesion, likely to support EHEC movement to the intestinal surface early in infection. However, induced or inappropriate pchE-dependent flagellar expression could block cell attachments later during disease progression.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1972

Simulation results for the Viterbi decoding algorithm

Concepts involved in determining the performance of coded digital communications systems are introduced. The basic concepts of convolutional encoding and decoding are summarized, and hardware implementations of sequential and maximum likelihood decoders are described briefly. Results of parametric studies of the Viterbi decoding algorithm are summarized. Bit error probability is chosen as the measure of performance and is calculated, by using digital computer simulations, for various encoder and decoder parameters. Results are presented for code rates of one-half and one-third, for constraint lengths of 4 to 8, for both hard-decision and soft-decision bit detectors, and for several important systematic and nonsystematic codes. The effect of decoder block length on bit error rate also is considered, so that a more complete estimate of the relationship between performance and decoder complexity can be made.

Batson, B. H.↗
DOE OSTI2017

Unusual respiratory capacity and nitrogen metabolism in a Parcubacterium (OD1) of the Candidate Phyla Radiation

The Candidate Phyla Radiation (CPR) is a large group of bacteria, the scale of which approaches that of all other bacteria. CPR organisms are inferred to depend on other community members for many basic cellular building blocks and all appear to be obligate anaerobes. To date, there has been no evidence for any significant respiratory capacity in an organism from this radiation. Here we report a curated draft genome for Candidatus Parcunitrobacter nitroensis' a member of the Parcubacteria (OD1) superphylum of the CPR. The genome encodes versatile energy pathways, including fermentative and respiratory capacities, nitrogen and fatty acid metabolism, as well as the first complete electron transport chain described for a member of the CPR. The sequences of all of these enzymes are highly divergent from sequences found in other organisms, suggesting that these capacities were not recently acquired from non-CPR organisms. Although the wide respiration-based repertoire points to a different lifestyle compared to other CPR bacteria, we predict similar obligate dependence on other organisms or the microbial community. The results substantially expand the known metabolic potential of CPR bacteria, although sequence comparisons indicate that these capacities are very rare in members of this radiation.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1990

A high speed CCSDS encoder for space applications

This paper reports a VLSI implementation of the CCSDS standard Reed Solomon encoder circuit for the Space Station. The 1.0 micron double metal CMOS chip is 5.9 mm by 3.6 mm, contains 48,000 transistors, operates at a sustained data rate of 320 Mbits/s, and executes 2,560 Mops. The chip features a pin selectable interleave depth of 1 to 8. Block lengths of up to 255 bytes, as well as shortened codes, are supported. The control circuitry uses register cells which are immune to Single Event Upset. In addition, the CMOS process used is reported to be tolerant of over 1 Mrad total dose radiation.

Whitaker, S.↗
NASA NTRS2003

Polycystins 1 and 2 mediate mechanosensation in the primary cilium of kidney cells

Several proteins implicated in the pathogenesis of polycystic kidney disease (PKD) localize to cilia. Furthermore, cilia are malformed in mice with PKD with mutations in TgN737Rpw (encoding polaris). It is not known, however, whether ciliary dysfunction occurs or is relevant to cyst formation in PKD. Here, we show that polycystin-1 (PC1) and polycystin-2 (PC2), proteins respectively encoded by Pkd1 and Pkd2, mouse orthologs of genes mutated in human autosomal dominant PKD, co-distribute in the primary cilia of kidney epithelium. Cells isolated from transgenic mice that lack functional PC1 formed cilia but did not increase Ca(2+) influx in response to physiological fluid flow. Blocking antibodies directed against PC2 similarly abolished the flow response in wild-type cells as did inhibitors of the ryanodine receptor, whereas inhibitors of G-proteins, phospholipase C and InsP(3) receptors had no effect. These data suggest that PC1 and PC2 contribute to fluid-flow sensation by the primary cilium in renal epithelium and that they both function in the same mechanotransduction pathway. Loss or dysfunction of PC1 or PC2 may therefore lead to PKD owing to the inability of cells to sense mechanical cues that normally regulate tissue morphogenesis.

Non-NASA Center↗
NASA NTRS2004

Accumulate repeat accumulate codes

In this paper we propose an innovative channel coding scheme called 'Accumulate Repeat Accumulate codes' (ARA). This class of codes can be viewed as serial turbo-like codes, or as a subclass of Low Density Parity Check (LDPC) codes, thus belief propagation can be used for iterative decoding of ARA codes on a graph. The structure of encoder for this class can be viewed as precoded Repeat Accumulate (RA) code or as precoded Irregular Repeat Accumulate (IRA) code, where simply an accumulator is chosen as a precoder. Thus ARA codes have simple, and very fast encoder structure when they representing LDPC codes. Based on density evolution for LDPC codes through some examples for ARA codes, we show that for maximum variable node degree 5 a minimum bit SNR as low as 0.08 dB from channel capacity for rate 1/2 can be achieved as the block size goes to infinity. Thus based on fixed low maximum variable node degree, its threshold outperforms not only the RA and IRA codes but also the best known LDPC codes with the dame maximum node degree. Furthermore by puncturing the accumulators any desired high rate codes close to code rate 1 can be obtained with thresholds that stay close to the channel capacity thresholds uniformly. Iterative decoding simulation results are provided. The ARA codes also have projected graph or protograph representation that allows for high speed decoder implementation.

Low Density Parity Check codes (LDPC)↗
DOE OSTI2013

Bubble masks for time-encoded imaging of fast neutrons.

Time-encoded imaging is an approach to directional radiation detection that is being developed at SNL with a focus on fast neutron directional detection. In this technique, a time modulation of a detected neutron signal is induced typically, a moving mask that attenuates neutrons with a time structure that depends on the source position. An important challenge in time-encoded imaging is to develop high-resolution two-dimensional imaging capabilities; building a mechanically moving high-resolution mask presents challenges both theoretical and technical. We have investigated an alternative to mechanical masks that replaces the solid mask with a liquid such as mineral oil. Instead of fixed blocks of solid material that move in pre-defined patterns, the oil is contained in tubing structures, and carefully introduced air gaps bubbles propagate through the tubing, generating moving patterns of oil mask elements and air apertures. Compared to current moving-mask techniques, the bubble mask is simple, since mechanical motion is replaced by gravity-driven bubble propagation; it is flexible, since arbitrary bubble patterns can be generated by a software-controlled valve actuator; and it is potentially high performance, since the tubing and bubble size can be tuned for high-resolution imaging requirements. We have built and tested various single-tube mask elements, and will present results on bubble introduction and propagation as a function of tubing size and cross-sectional shape; real-time bubble position tracking; neutron source imaging tests; and reconstruction techniques demonstrated on simple test data as well as a simulated full detector system.

Brubaker, Erik↗
DOE OSTI2025

Observable measurement-induced transitions

One of the main postulates of quantum mechanics is that measurements destroy quantum coherence (wave function collapse). Recently it was discovered that in a many-body system dilute local measurements still preserve some coherence across the entire system. As the measurement density is increased, a phase transition occurs that is characterized by the disentanglement of different parts of the system. Unfortunately, this transition is impossible to observe experimentally for macroscopic systems because it requires an exponentially costly full tomography of the many-body wave function or a comparison with the simulation on an oracle classical computer. In this work we report the discovery of another measurement-induced phase transition that can be observed experimentally if quantum dynamics can be reversed. On one side of this phase transition the quantum information encoded in some part of the Hilbert space is fully recovered after the time inversion. On the other side, all quantum information is corrupted. This transition also manifests itself as the change in the behavior of the probability to observe the same measurement outcome in the process that consists of identical blocks repeated many times. In each block the unitary evolution is followed by the measurement. On one side of the transition the probability decreases exponentially with the number of repetitions, on the other it tends to a constant as the number of repetitions is increased. We confirm the existence of the proposed phase transition through numerical simulations of realistic quantum circuits and analytical calculations using an effective random-matrix theory model.

Measurement-induced phase transitions↗
DOE OSTI2013

Fission yeast LAMMER kinase Lkh1 regulates the cell cycle by phosphorylating the CDK-inhibitor Rum1

Highlights: ► Deletion of lkh1{sup +} made cells pass the G1/S phase faster than the wild type. ► Lkh1 can interact with a cyclin-dependent kinase inhibitor (CKI) Rum1. ► Lkh1 can phosphorylate Rum1 to activate its CKI activity. ► Thr110 was confirmed as the Lkh1-dependent phosphorylation site of Rum1. ► Positive acting mechanism for the Rum1 activation is reported for the first time. - Abstract: In eukaryotes, LAMMER kinases are involved in various cellular events, including the cell cycle. However, no attempt has been made to investigate the mechanisms that underlie the involvement of LAMMER kinase. In this study, we performed a functional analysis of LAMMER kinase using the fission yeast, Schizosaccharomyces pombe. FACS analyses revealed that deletion of the gene that encodes the LAMMER kinase Lkh1 made mutant cells pass through the G1/S phase faster than their wild-type counterparts. Co-immunoprecipitation and an in vitro kinase assay also revealed that Lkh1 can interact with and phosphorylate Rum1 to activate this molecule as a cyclin-dependent kinase inhibitor, which blocks cell cycle progression from the G1 phase to the S phase. Peptide mass fingerprinting and kinase assay with Rum1{sup T110A} confirmed T110 as the Lkh1-dependent phosphorylation residue. In this report we present for the first time a positive acting mechanism that is responsible for the CKI activity of Rum1, in which the LAMMER kinase-mediated phosphorylation of Rum1 is involved.

60 APPLIED LIFE SCIENCES↗
NASA NTRS1973

Multimegabit Operation Multiplexer System

The Multimegabit Operation Multiplexer System (MOMS) is a high-data-rate PCM telemetry unit capable of sampling and encoding 60 scanning radiometer and four vidicon channels at 250 kilosamples/second and 5 megasamples/second, respectively. This sampling capacity plus the seven-bit quantization requires a total throughput rate of 40 megasamples/second and 280 megabits/second. To produce these rates efficiently, the system was divided into a pair of identical 140-megabit blocks. A low-power 20-MHz analog multiplexer and analog-to-digital converter were developed together with a video sample-and-hold that features an aperture time error of less than 50 psec. Breadboard testing of these basic building blocks confirmed the design prediction that the total system would consume 27 watts of power. Two 140-megabit output parts are suitable for quadriphase modulation.

Giri, R. R.↗