Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “LDPC”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS2009

Structured Low-Density Parity-Check Codes with Bandwidth Efficient Modulation

In this work, we study the performance of structured Low-Density Parity-Check (LDPC) Codes together with bandwidth efficient modulations. We consider protograph-based LDPC codes that facilitate high-speed hardware implementations and have minimum distances that grow linearly with block sizes. We cover various higher- order modulations such as 8-PSK, 16-APSK, and 16-QAM. During demodulation, a demapper transforms the received in-phase and quadrature samples into reliability information that feeds the binary LDPC decoder. We will compare various low-complexity demappers and provide simulation results for assorted coded-modulation combinations on the additive white Gaussian noise and independent Rayleigh fading channels.

Crew Exploration Vehicle (CEV)↗
NASA NTRSDate not supplied

Flexible Data and Frame Synchronization Structure for the LunaNet PNT Signal

A LunaNet Lunar Augmented Navigation Service (LANS) is being developed to enable a position, navigation, and timing service for future Lunar operations [1]. The signal includes two components. An in-phase data channel signal is spread by a 1.023 MCPS ranging code that provides a high-rate data message at 250 bps and is encoded by a strong Low Density Parity Check (LDPC) code. A pilot channel with a 5.115 MCPS spreading code is also provided. The pilot code is configured with a secondary (overlay) code that does not currently provide absolute time or frame Synchronization as is the case for L1C [2] [3]. This work shows the advantage of implementing an overlay structure that provides absolute time for the LunaNet LANS signal structure known as the Augmented Forward Signal (AFS). The LunaNet AFS structure was developed to service two classes of user receivers. The first class is a low-complexity user receiver that only receives the 1.023 MCPS signal and does not use the 5.115 MCPS pilot channel. For this class of user, a data frame Sync word is needed. The second class of receiver is a high-end receiver that can processes both data and pilot channels to take advantage of the higher chip rate pilot channel for enhanced robustness and improved accuracy. In the current draft LunaNet LANS AFS design, these users must employ the frame Sync word in the data channel and obtain absolute time after decoding the AFS navigation message [2]. The signal structure would greatly benefit from the addition of a pilot overlay structure that provides absolute time and robust frame Sync for high-end users as done for L1C [3]. To provide a more robust and interoperable AFS structure, this work summarizes a study and recommends alternatives for a new overlay code on the pilot channel that provides absolute time and a Sync word approach on the data channel. The overlay code and Sync word are designed to allow for flexible and robust data synchronization for both low- complexity and high-end user receivers. The new overlay code structure permits frame synchronization performance that is as good as or better than the L1 C signal, while enabling a determination of absolute time upon frame Sync to aid high-end assisted LANS AFS user receivers at low signal to noise levels. We also present the design of rate-matched 5G new radio (5GNR) LDPC codes that fit within the current 6000-symbol frame size along with a time of interval (TOI) word, frame ID (FID) word, and the remaining LunaNet AFS data message blocks. The paper describes and demonstrates robust frame Synchronization performance of the overlay code and Synch word approaches. The results are described in terms of probability of missed detection and probability of false alarm for a correct frame Synchronization at low Eb/No levels expected for decoding the TOI word and LDPC encoded data. Advantages of the proposed data Synchronization structure will be described along with use cases for low-end and high-end receivers. Practical implementation considerations will also be described.

Philip Dafesh↗
NASA NTRSDate not supplied

Flexible Data and Frame Synchronization Structure for the LunaNet PNT Signal

A LunaNet Lunar Augmented Navigation Service (LANS) is being developed to enable a position, navigation, and timing service for future Lunar operations. The signal includes two components. An in-phase data channel signal is spread by a 1.023 MCPS ranging code that provides a high-rate data message at 250 bps and is encoded by a strong Low Density Parity Check (LDPC) code. A pilot channel with a 5.115 MCPS spreading code is also provided. The pilot code is configured with a secondary (overlay) code that does not currently provide absolute time or frame Synchronization as is the case for L1C. This work shows the advantage of implementing an overlay structure that provides absolute time for the LunaNet LANS signal structure known as the Augmented Forward Signal (AFS). The LunaNet AFS structure was developed to service two classes of user receivers. The first class is a low-complexity user receiver that only receives the 1.023 MCPS signal and does not use the 5.115 MCPS pilot channel. For this class of user, a data frame Sync word is needed. The second class of receiver is a high-end receiver that can processes both data and pilot channels to take advantage of the higher chip rate pilot channel for enhanced robustness and improved accuracy. In the current draft LunaNet LANS AFS design, these users must employ the frame Sync word in the data channel and obtain absolute time after decoding the AFS navigation message. The signal structure would greatly benefit from the addition of a pilot overlay structure that provides absolute time and robust frame Sync for high-end users as done for L1C. To provide a more robust and interoperable AFS structure, this work summarizes a study and recommends alternatives for a new overlay code on the pilot channel that provides absolute time and a Sync word approach on the data channel. The overlay code and Sync word are designed to allow for flexible and robust data synchronization for both low- complexity and high-end user receivers. The new overlay code structure permits frame synchronization performance that is as good as or better than the L1 C signal, while enabling a determination of absolute time upon frame Sync to aid high-end assisted LANS AFS user receivers at low signal to noise levels. We also present the design of rate-matched 5G new radio (5GNR) LDPC codes that fit within the current 6000-symbol frame size along with a time of interval (TOI) word, frame ID (FID) word, and the remaining LunaNet AFS data message blocks. The paper describes and demonstrates robust frame Synchronization performance of the overlay code and Synch word approaches. The results are described in terms of probability of missed detection and probability of false alarm for a correct frame Synchronization at low Eb/No levels expected for decoding the TOI word and LDPC encoded data. Advantages of the proposed data Synchronization structure will be described along with use cases for low-end and high-end receivers. Practical implementation considerations will also be described.

LunaNet↗
NASA NTRS2004

Maximum likelihood decoding analysis of Accumulate-Repeat-Accumulate Codes

Repeat-Accumulate (RA) codes are the simplest turbo-like codes that achieve good performance. However, they cannot compete with Turbo codes or low-density parity check codes (LDPC) as far as performance is concerned. The Accumulate Repeat Accumulate (ARA) codes, as a subclass of LDPC codes, are obtained by adding a pre-coder in front of RA codes with puncturing where an accumulator is chosen as a precoder. These codes not only are very simple, but also achieve excellent performance with iterative decoding. In this paper, the performance of these codes with (ML) decoding are analyzed and compared to random codes by very tight bounds. The weight distribution of some simple ARA codes is obtained, and through existing tightest bounds we have shown the ML SNR threshold of ARA codes approaches very closely to the performance of random codes. We have shown that the use of precoder improves the SNR threshold but interleaving gain remains unchanged with respect to RA code with puncturing.

low density parity codes (LDPC)↗
DOE OSTI2025

Low-Density Parity-Check Codes as Stable Phases of Quantum Matter

Phases of matter with robust ground-state degeneracy, such as the quantum toric code, are known to be capable of robust quantum information storage. Here, we address the converse question: given a quantum error-correcting code, when does it define a stable gapped quantum phase of matter, whose ground-state degeneracy is robust against perturbations in the thermodynamic limit? We prove that a low-density parity-check (LDPC) code defines such a phase, robust against all few-body perturbations, if its code distance grows at least logarithmically in the number of degrees of freedom, and it exhibits “check soundness.” Many constant-rate quantum LDPC expander codes have such properties, and define stable phases of matter with a constant zero-temperature entropy density, violating the third law of thermodynamics. Our results also show that quantum toric-code phases are robust to spatially nonlocal few-body perturbations. Similarly, phases of matter defined by classical codes are stable against symmetric perturbations. In the classical setting, we present improved locality bounds on the quasiadiabatic evolution operator between two nearby states in the same code phase.

quantum error correction↗
DOE OSTI2023

Stereoinversion via Alcohol Dehydrogenases Enables Complete Catabolism of β-1-Type Lignin-Derived Aromatic Isomers

Sphingobium sp. strain SYK-6 is an efficient aromatic catabolic bacterium that can consume all four stereoisomers of 1,2-diguaiacylpropane-1,3-diol (DGPD), which is a ring-opened β-1-type dimer. Recently, LdpA-mediated catabolism of erythro-DGPD was reported in SYK-6, but the catabolic pathway for threo-DGPD was as yet unknown. Here, in this study, we elucidated the catabolism of threo-DGPD, which proceeds through conversion to erythro-DGPD. When threo-DGPD was incubated with SYK-6, the Cα hydroxy groups of threo-DGPD (DGPD I and II) were initially oxidized to produce the Cα carbonyl form (DGPD-keto I and II). This initial oxidation step is catalyzed by Cα-dehydrogenases, which belong to the short-chain dehydrogenase/reductase (SDR) family and are involved in the catabolism of β-O-4-type dimers. Analysis of seven candidate genes revealed that NAD + -dependent LigD and LigL are mainly involved in the conversion of DGPD I and II, respectively. Next, we found that DGPD-keto I and II were reduced to erythro-DGPD (DGPD III and IV) in the presence of NADPH. Genes involved in this reduction were sought from Cα-dehydrogenase and ldpA-neighboring SDR genes. The gene products of SLG_12690 (ldpC) and SLG_12640 (ldpB) catalyzed the NADPH-dependent conversion of DGPD-keto I to DGPD III and DGPD-keto II to DGPD IV, respectively. Mutational analysis further indicated that ldpC and ldpB are predominantly involved in the reduction of DGPD-keto. Together, these results demonstrate that SYK-6 harbors a comprehensive catabolic enzyme system to utilize all four β-1-type stereoisomers through successive oxidation and reduction reactions of the Cα hydroxy group of threo-DGPD with a net stereoinversion using multiple dehydrogenases.

09 BIOMASS FUELS↗
DOE OSTI2025

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.

Combinatorics (math.CO)↗
NASA NTRS2003

Low Density Parity Check Codes: Bandwidth Efficient Channel Coding

Low Density Parity Check (LDPC) Codes provide near-Shannon Capacity performance for NASA Missions. These codes have high coding rates R=0.82 and 0.875 with moderate code lengths, n=4096 and 8176. Their decoders have inherently parallel structures which allows for high-speed implementation. Two codes based on Euclidean Geometry (EG) were selected for flight ASIC implementation. These codes are cyclic and quasi-cyclic in nature and therefore have a simple encoder structure. This results in power and size benefits. These codes also have a large minimum distance as much as d,,, = 65 giving them powerful error correcting capabilities and error floors less than lo- BER. This paper will present development of the LDPC flight encoder and decoder, its applications and status.

Fong, Wai↗
NASA NTRS2008

Information-reduced Carrier Synchronization of Iterative Decoded BPSK and QPSK using Soft Decision (Extrinsic) Feedback

This paper addresses the carrier-phase estimation problem under low SNR conditions as are typical of turbo- and LDPC-coded applications. In previous publications by the first author, closed-loop carrier synchronization schemes for error-correction coded BPSK and QPSK modulation were proposed that were based on feeding back hard data decisions at the input of the loop, the purpose being to remove the modulation prior to attempting to track the carrier phase as opposed to the more conventional decision-feedback schemes that incorporate such feedback inside the loop. In this paper, we consider an alternative approach wherein the extrinsic soft information from the iterative decoder of turbo or LDPC codes is instead used as the feedback.

carrier synchronization↗
NASA NTRS2009

NASA Tech Briefs, October 2009

Topics covered include: Light-Driven Polymeric Bimorph Actuators; Guaranteeing Failsafe Operation of Extended-Scene Shack-Hartmann Wavefront Sensor Algorithm; Cloud Water Content Sensor for Sounding Balloons and Small UAVs; Pixelized Device Control Actuators for Large Adaptive Optics; T-Slide Linear Actuators; G4FET Implementations of Some Logic Circuits; Electrically Variable or Programmable Nonvolatile Capacitors; System for Automated Calibration of Vector Modulators; Complementary Paired G4FETs as Voltage-Controlled NDR Device; Three MMIC Amplifiers for the 120-to-200 GHz Frequency Band; Low-Noise MMIC Amplifiers for 120 to 180 GHz; Using Ozone To Clean and Passivate Oxygen-Handling Hardware; Metal Standards for Waveguide Characterization of Materials; Two-Piece Screens for Decontaminating Granular Material; Mercuric Iodide Anticoincidence Shield for Gamma-Ray Spectrometer; Improved Method of Design for Folding Inflatable Shells; Ultra-Large Solar Sail; Cooperative Three-Robot System for Traversing Steep Slopes; Assemblies of Conformal Tanks; Microfluidic Pumps Containing Teflon[Trademark] AF Diaphragms; Transparent Conveyor of Dielectric Liquids or Particles; Multi-Cone Model for Estimating GPS Ionospheric Delays; High-Sensitivity GaN Microchemical Sensors; On the Divergence of the Velocity Vector in Real-Gas Flow; Progress Toward a Compact, Highly Stable Ion Clock; Instruments for Imaging from Far to Near; Reflectors Made from Membranes Stretched Between Beams; Integrated Risk and Knowledge Management Program -- IRKM-P; LDPC Codes with Minimum Distance Proportional to Block Size; Constructing LDPC Codes from Loop-Free Encoding Modules; MMICs with Radial Probe Transitions to Waveguides; Tests of Low-Noise MMIC Amplifier Module at 290 to 340 GHz; and Extending Newtonian Dynamics to Include Stochastic Processes.

Source record↗
NASA NTRS2010

Capacity Maximizing Constellations

Some non-traditional signal constellations have been proposed for transmission of data over the Additive White Gaussian Noise (AWGN) channel using such channel-capacity-approaching codes as low-density parity-check (LDPC) or turbo codes. Computational simulations have shown performance gains of more than 1 dB over traditional constellations. These gains could be translated to bandwidth- efficient communications, variously, over longer distances, using less power, or using smaller antennas. The proposed constellations have been used in a bit-interleaved coded modulation system employing state-ofthe-art LDPC codes. In computational simulations, these constellations were shown to afford performance gains over traditional constellations as predicted by the gap between the parallel decoding capacity of the constellations and the Gaussian capacity

Barsoum, Maged↗
NASA NTRS2010

Landsat Data Continuity Mission (LDCM) - Optimizing X-Band Usage

The NASA version of the low-density parity check (LDPC) 7/8-rate code, shortened to the dimensions of (8160, 7136), has been implemented as the forward error correction (FEC) schema for the Landsat Data Continuity Mission (LDCM). This is the first flight application of this code. In order to place a 440 Msps link within the 375 MHz wide X band we found it necessary to heavily bandpass filter the satellite transmitter output . Despite the significant amplitude and phase distortions that accompanied the spectral truncation, the mission required BER is maintained at < 10(exp -12) with less than 2 dB of implementation loss. We utilized a band-pass filter designed ostensibly to replicate the link distortions to demonstrate link design viability. The same filter was then used to optimize the adaptive equalizer in the receiver employed at the terminus of the downlink. The excellent results we obtained could be directly attributed to the implementation of the LDPC code and the amplitude and phase compensation provided in the receiver. Similar results were obtained with receivers from several vendors.

Garon, H. M.↗
DOE OSTI2026

qSIEVE: Efficient qLDPC Memory via Systolic Movement in Atom Arrays

As quantum machines have scaled up in their number of qubits, significant research has turned towards increasing their fidelity with quantum error correction codes. Although promising results have been shown with the surface code, which only requires near-neighbor connections between qubits, the high qubit overhead of such local codes promises to be problematic. Consequently, recent work has explored non-local quantum LDPC (qLDPC) codes, which have good asymptotic encoding rates. Despite theoretical progress, hardware implementations of these codes have been a longstanding challenge. At the experimental level, demonstrations of movement based communication on atom arrays suggest this is a powerful new primitive to achieve non-local connectivity. Leveraging this, we present a protocol for implementing non-local qLDPC codes in hardware. Our protocol, qSIEVE, is a co-design of such codes with movement in atom arrays. qSIEVE defines a restricted family of qLDPC codes that can be implemented efficiently with systolic movement. We then quantify the utility of qSIEVE in the context of a complete fault tolerant architecture. We compare the cost of implementing benchmark programs in a standard, surface code only architecture and a mixed architecture where data is stored in qLDPC memory with qSIEVE and loaded to surface codes for computation.

Quantum error correction↗
NASA NTRS2004

Accumulate Repeat Accumulate Coded Modulation

In this paper we propose an innovative coded modulation scheme called 'Accumulate Repeat Accumulate Coded Modulation' (ARA coded modulation). This class of codes can be viewed as serial turbo-like codes, or as a subclass of Low Density Parity Check (LDPC) codes that are combined with high level modulation. Thus at the decoder belief propagation can be used for iterative decoding of ARA coded modulation on a graph, provided a demapper transforms the received in-phase and quadrature samples to reliability of the bits.

coded modulation↗
DOE OSTI2025

Fracton models from product codes

We explore a deep connection between fracton order and product codes. In particular, we propose and analyze conditions on classical seed codes which lead to fracton order in the resulting quantum product codes. Depending on the properties of the input codes, product codes can realize either Type-I or Type-II fracton models, in both nonlocal and local constructions. For the nonlocal case, we show that a recently proposed model of lineons on nonlocal graphs can be obtained as a hypergraph product code. Interestingly, constrained mobility in this model arises only from energy barriers associated with the graph. For the local case, we introduce a novel type of classical LDPC code defined on a planar aperiodic tiling. By considering the specific example of the pinwheel tiling, we demonstrate the systematic construction of local Type-I and Type-II fracton models as product codes. Our work establishes product codes as a natural setting for exploring fracton order.

Fractons↗
DOE OSTI2024

Faster Tensor Network Decoding for Topological Quantum Codes

We present a fast and Bayes-optimal-approximating tensor network decoder for planar quantum LDPC codes based on the tensor renormalization group algorithm, originally proposed by Levin, and Nave. By precomputing the renormalization group flow for the null syndrome, we need only recompute tensor contractions in the causal cone of the measured syndrome at the time of decoding. This allows us to achieve an overall runtime complexity of ($pnχ^6$) where p is the depolarizing noise rate, and χ is the cutoff value used to control singular value decomposition approximations used in the algorithm. We apply our decoder to the surface code in the code capacity noise model and compare its performance to the original matrix product state (MPS) tensor network decoder introduced by Bravyi, Suchara, and Vargo. The MPS decoder has a p-independent runtime complexity of $\mathcal{O}(nχ^3)$ resulting in significantly slower decoding times compared to our algorithm in the low-p regime.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2004

Future capabilities for the Deep Space Network

This paper will look at three new capabilities that are in different stages of development. First, turbo decoding, which provides improved telemetry performance for data rates up to about 1 Mbps, will be discussed. Next, pseudo-noise ranging will be presented. Pseudo-noise ranging has several advantages over the current sequential ranging, anmely easier operations, improved performance, and the capability to be used in a regenerative implementation on a spacecraft. Finally, Low Density Parity Check decoding will be discussed. LDPC codes can provide performance that matches or slightly exceed turbo codes, but are designed for use in the 10 Mbps range.

turbo code↗