Search NASA⌕ Search

SEARCH · Search NASA

Results for “Low Density Parity Check (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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS2007

Accumulate-Repeat-Accumulate-Accumulate Codes

Accumulate-repeat-accumulate-accumulate (ARAA) codes have been proposed, inspired by the recently proposed accumulate-repeat-accumulate (ARA) codes. These are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. ARAA codes can be regarded as serial turbolike codes or as a subclass of low-density parity-check (LDPC) codes, and, like ARA codes they have projected graph or protograph representations; these characteristics make it possible to design high-speed iterative decoders that utilize belief-propagation algorithms. The objective in proposing ARAA codes as a subclass of ARA codes was to enhance the error-floor performance of ARA codes while maintaining simple encoding structures and low maximum variable node degree.

Divsalar, Dariush↗
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)↗
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 NTRS2005

Memory-efficient decoding of LDPC codes

We present a low-complexity quantization scheme for the implementation of regular (3,6) LDPC codes. The quantization parameters are optimized to maximize the mutual information between the source and the quantized messages. Using this non-uniform quantized belief propagation algorithm, we have simulated that an optimized 3-bit quantizer operates with 0.2dB implementation loss relative to a floating point decoder, and an optimized 4-bit quantizer operates less than 0.1dB quantization loss.

Low-Density-Parity-Check (LDPC)↗
NASA NTRS2006

Protograph LDPC Codes with Node Degrees at Least 3

In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower, by about 0.2 dB, than the best known irregular LDPC codes with degree at least 3. The main motivation is to gain linear minimum distance to achieve low error floor. Also to construct rate-compatible protograph-based LDPC codes for fixed block length that simultaneously achieves low iterative decoding threshold and linear minimum distance. We start with a rate 1/2 protograph LDPC code with degree-3 nodes and one high degree node. Higher rate codes are obtained by connecting check nodes with degree-2 non-transmitted nodes. This is equivalent to constraint combining in the protograph. The condition where all constraints are combined corresponds to the highest rate code. This constraint must be connected to nodes of degree at least three for the graph to have linear minimum distance. Thus having node degree at least 3 for rate 1/2 guarantees linear minimum distance property to be preserved for higher rates. Through examples we show that the iterative decoding threshold as low as 0.544 dB can be achieved for small protographs with node degrees at least three. A family of low- to high-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.

low density parity check (LDPC)↗
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

Optimal Codes for the Burst Erasure Channel

Deep space communications over noisy channels lead to certain packets that are not decodable. These packets leave gaps, or bursts of erasures, in the data stream. Burst erasure correcting codes overcome this problem. These are forward erasure correcting codes that allow one to recover the missing gaps of data. Much of the recent work on this topic concentrated on Low-Density Parity-Check (LDPC) codes. These are more complicated to encode and decode than Single Parity Check (SPC) codes or Reed-Solomon (RS) codes, and so far have not been able to achieve the theoretical limit for burst erasure protection. A block interleaved maximum distance separable (MDS) code (e.g., an SPC or RS code) offers near-optimal burst erasure protection, in the sense that no other scheme of equal total transmission length and code rate could improve the guaranteed correctible burst erasure length by more than one symbol. The optimality does not depend on the length of the code, i.e., a short MDS code block interleaved to a given length would perform as well as a longer MDS code interleaved to the same overall length. As a result, this approach offers lower decoding complexity with better burst erasure protection compared to other recent designs for the burst erasure channel (e.g., LDPC codes). A limitation of the design is its lack of robustness to channels that have impairments other than burst erasures (e.g., additive white Gaussian noise), making its application best suited for correcting data erasures in layers above the physical layer. The efficiency of a burst erasure code is the length of its burst erasure correction capability divided by the theoretical upper limit on this length. The inefficiency is one minus the efficiency. The illustration compares the inefficiency of interleaved RS codes to Quasi-Cyclic (QC) LDPC codes, Euclidean Geometry (EG) LDPC codes, extended Irregular Repeat Accumulate (eIRA) codes, array codes, and random LDPC codes previously proposed for burst erasure protection. As can be seen, the simple interleaved RS codes have substantially lower inefficiency over a wide range of transmission lengths.

Hamkins, Jon↗
NASA NTRS2011

Coded Modulation in C and MATLAB

This software, written separately in C and MATLAB as stand-alone packages with equivalent functionality, implements encoders and decoders for a set of nine error-correcting codes and modulators and demodulators for five modulation types. The software can be used as a single program to simulate the performance of such coded modulation. The error-correcting codes implemented are the nine accumulate repeat-4 jagged accumulate (AR4JA) low-density parity-check (LDPC) codes, which have been approved for international standardization by the Consultative Committee for Space Data Systems, and which are scheduled to fly on a series of NASA missions in the Constellation Program. The software implements the encoder and decoder functions, and contains compressed versions of generator and parity-check matrices used in these operations.

Hamkins, Jon↗
NASA NTRS2012

Measurement Techniques for Clock Jitter

NASA is in the process of modernizing its communications infrastructure to accompany the development of a Crew Exploration Vehicle (CEV) to replace the shuttle. With this effort comes the opportunity to infuse more advanced coded modulation techniques, including low-density parity-check (LDPC) codes that offer greater coding gains than the current capability. However, in order to take full advantage of these codes, the ground segment receiver synchronization loops must be able to operate at a lower signal-to-noise ratio (SNR) than supported by equipment currently in use.

Lansdowne, Chatwin↗
NASA NTRS2012

Replacing the CCSDS Telecommand Protocol with Next Generation Uplink

Better performing Forward Error Correction on the forward link along with adequate power in the data open an uplink operations trade space that enable missions to: Command to greater distances in deep space (increased uplink margin) Increase the size of the payload data (latency may be a factor) Provides space for the security header/trailer of the CCSDS Space Data Link Security Protocol Note: These higher rates could be used for relief of emergency communication margins/rates and not limited to improving top-end rate performance. A higher performance uplink could also reduce the requirements on flight emergency antenna size and/or the performance required from ground stations. Use of a selective repeat ARQ protocol may increase the uplink design requirements but the resultant development is deemed acceptable, due the factor of 4 to 8 potential increase in uplink data rate.

Low Density Parity Check (LDPC)↗
NASA NTRS2010

Performance of Low-Density Parity-Check Coded Modulation

This paper reports the simulated performance of each of the nine accumulate-repeat-4-jagged-accumulate (AR4JA) low-density parity-check (LDPC) codes [3] when used in conjunction with binary phase-shift-keying (BPSK), quadrature PSK (QPSK), 8-PSK, 16-ary amplitude PSK (16- APSK), and 32-APSK.We also report the performance under various mappings of bits to modulation symbols, 16-APSK and 32-APSK ring scalings, log-likelihood ratio (LLR) approximations, and decoder variations. One of the simple and well-performing LLR approximations can be expressed in a general equation that applies to all of the modulation types.

Hamkins, Jon↗
NASA NTRS2011

Frame Synchronization Without Attached Sync Markers

We describe a method to synchronize codeword frames without making use of attached synchronization markers (ASMs). Instead, the synchronizer identifies the code structure present in the received symbols, by operating the decoder for a handful of iterations at each possible symbol offset and forming an appropriate metric. This method is computationally more complex and doesn't perform as well as frame synchronizers that utilize an ASM; nevertheless, the new synchronizer acquires frame synchronization in about two seconds when using a 600 kbps software decoder, and would take about 15 milliseconds on prototype hardware. It also eliminates the need for the ASMs, which is an attractive feature for short uplink codes whose coding gain would be diminished by the overheard of ASM bits. The lack of ASMs also would simplify clock distribution for the AR4JA low-density parity-check (LDPC) codes and adds a small amount to the coding gain as well (up to 0.2 dB).

Hamkins, Jon↗
NASA NTRS2019

Bit Error Rate and Frame Error Rate Data Processing for Space Communications and Navigation-Related Communication System Analysis Tools

One of the capabilities that the Space Communications and Navigation (SCaN) Strategic Center for Networking, Integration, and Communications (SCENIC) user interface (UI) web application intends to provide its users is the addition of network protocol and link encryption augmentations of communication system analyses. Before any of these analyses capabilities can be modeled, the simulations of bit error rate (BER) and frame error rate (FER) against signal-to-noise ratio (SNR) have been conducted, requiring parameters from several known coding types (low-density parity-check (LDPC), convolutional, etc.), signal modulations (binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), etc.), coding rates (1/2, 1/3, etc.), and frame sizes (1,280, 3,580, etc.). However, in order to extract useful information from the results of these simulations, a curve fitting technique has been applied to each resulting dataset to extend and extrapolate the curve fit of BER and FER down to 10–30 using MATLAB® Curve Fitting Toolbox™ (The MathWorks, Inc.). This is a necessary step because simulations of BER and FER were only performed to around 10–9 due to the extensive simulation time that would be required to obtain significant simulation results at the error levels desired. Furthermore, the fitted curve results were applied to a finer resolution for the SNR at 0.01-dB interval instead of the 0.05-dB interval limitation used in the simulation. All the possible combinations of the coding types, signal modulations, coding rates, frame sizes, and the extension of BER and FER curves would enable users to capture a wide range of link performances that directly relates to the addition of higher level networking data encapsulated in a frame. The curve fitting results also led to the modeling of the optical link error rate performance by solving for coding gain, FER_BER SNR delta, coded optical BER-SNR, and coded optical FER–SNR.

Communication link analysis↗
NASA NTRSDate not supplied

The Design of a Flexible, Interoperable Navigation Signal for Future Lunar Missions

The LunaNet Interoperability Specification (LNIS) is a set of standards currently under development by NASA, ESA, and JAXA, which define a common, interoperable set of services and interfaces for lunar communication and navigation. The LNIS includes specifications for the GNSS-like Augmented Forward Signal (AFS). The LANS (Lunar Augmented Navigation Service) will be comprised of Multiple LunaNet Service Provider (LNSP) nodes broadcasting the AFS, such as NASA’s LCRNS (Lunar Communications Relay and Navigation Systems), ESA’s Moonlight LCNS (Lunar Communication and Navigation Services) and the Japan LNSS (Lunar Navigation Satellite System). The LANS will provide a GNSS-like capability enabling orbiting and surface users in lunar space (such as Artemis) to estimate their position, velocity and time as described in Giordano et al., (2023). Initial capabilities will focus on providing service to the lunar South pole region. The specification of AFS defines two orthogonal signal components on a single carrier, with the in-phase component (AFS-I) being a lower-chip-rate data channel tailored for applications where low SWaP is critical (e.g., IoT devices or search and rescue), and the quadrature component (AFS-Q) being a high-chip-rate data-less pilot signal for high-precision, robust lunar navigation and positioning applications. An initial description of AFS was provided in the LNIS, (2023), and initial analysis results were shown in Dafesh, et al., (2024). In this work, we provide rationale for updates to the LNIS that define key aspects of the signal including the primary spreading code designs for the data and pilot channels, and a three-tiered overlay code approach for the pilot channel that provides flexible signal acquisition alternatives, rapid time dissemination and robust frame Sync. The paper also describes a robust data sync word that is designed to enable frame Sync. for low-SWaP receivers that only use the I channel, as well as a low-density parity check code (LDPC) data message encoding design and interleaving definition. The work further describes the impact of the updated AFS design in terms of improved acquisition performance, interference resistance, navigation message capabilities and rapid absolute time dissemination for users able to access clock and ephemeris data over an external network. The cross-correlation and synchronization performance of the AFS design is also compared to potential alternatives, further providing rationale for the final signal design configuration.

LANS↗
NASA NTRS2025

The Design of a Flexible, Interoperable Navigation Signal for Future Lunar Missions

The LunaNet Interoperability Specification (LNIS) is a set of standards currently under development by NASA, ESA, and JAXA, which define a common, interoperable set of services and interfaces for lunar communication and navigation. The LNIS includes specifications for the GNSS-like Augmented Forward Signal (AFS). The LANS (Lunar Augmented Navigation Service) will be comprised of Multiple LunaNet Service Provider (LNSP) nodes broadcasting the AFS, such as NASA’s LCRNS (Lunar Communications Relay and Navigation Systems), ESA’s Moonlight LCNS (Lunar Communication and Navigation Services) and the Japan LNSS (Lunar Navigation Satellite System). The LANS will provide a GNSS-like capability enabling orbiting and surface users in lunar space (such as Artemis) to estimate their position, velocity and time as described in Giordano et al., (2023). Initial capabilities will focus on providing service to the lunar South pole region. The specification of AFS defines two orthogonal signal components on a single carrier, with the in-phase component (AFS-I) being a lower-chip-rate data channel tailored for applications where low SWaP is critical (e.g., IoT devices or search and rescue), and the quadrature component (AFS-Q) being a high-chip-rate data-less pilot signal for high-precision, robust lunar navigation and positioning applications. An initial description of AFS was provided in the LNIS, (2023), and initial analysis results were shown in Dafesh, et al., (2024). In this work, we provide rationale for updates to the LNIS that define key aspects of the signal including the primary spreading code designs for the data and pilot channels, and a three-tiered overlay code approach for the pilot channel that provides flexible signal acquisition alternatives, rapid time dissemination and robust frame Sync. The paper also describes a robust data sync word that is designed to enable frame Sync. for low-SWaP receivers that only use the I channel, as well as a low-density parity check code (LDPC) data message encoding design and interleaving definition. The work further describes the impact of the updated AFS design in terms of improved acquisition performance, interference resistance, navigation message capabilities and rapid absolute time dissemination for users able to access clock and ephemeris data over an external network. The cross-correlation and synchronization performance of the AFS design is also compared to potential alternatives, further providing rationale for the final signal design configuration.

LunaNet↗
NASA NTRS2013

Bilayer Protograph Codes for Half-Duplex Relay Channels

Direct to Earth return links are limited by the size and power of lander devices. A standard alternative is provided by a two-hops return link: a proximity link (from lander to orbiter relay) and a deep-space link (from orbiter relay to Earth). Although direct to Earth return links are limited by the size and power of lander devices, using an additional link and a proposed coding for relay channels, one can obtain a more reliable signal. Although significant progress has been made in the relay coding problem, existing codes must be painstakingly optimized to match to a single set of channel conditions, many of them do not offer easy encoding, and most of them do not have structured design. A high-performing LDPC (low-density parity-check) code for the relay channel addresses simultaneously two important issues: a code structure that allows low encoding complexity, and a flexible rate-compatible code that allows matching to various channel conditions. Most of the previous high-performance LDPC codes for the relay channel are tightly optimized for a given channel quality, and are not easily adapted without extensive re-optimization for various channel conditions. This code for the relay channel combines structured design and easy encoding with rate compatibility to allow adaptation to the three links involved in the relay channel, and furthermore offers very good performance. The proposed code is constructed by synthesizing a bilayer structure with a pro to graph. In addition to the contribution to relay encoding, an improved family of protograph codes was produced for the point-to-point AWGN (additive white Gaussian noise) channel whose high-rate members enjoy thresholds that are within 0.07 dB of capacity. These LDPC relay codes address three important issues in an integrative manner: low encoding complexity, modular structure allowing for easy design, and rate compatibility so that the code can be easily matched to a variety of channel conditions without extensive re-optimization. The main problem of half-duplex relay coding can be reduced to the simultaneous design of two codes at two rates and two SNRs (signal-to-noise ratios), such that one is a subset of the other. This problem can be addressed by forceful optimization, but a clever method of addressing this problem is via the bilayer lengthened (BL) LDPC structure. This method uses a bilayer Tanner graph to make the two codes while using a concept of "parity forwarding" with subsequent successive decoding that removes the need to directly address the issue of uneven SNRs among the symbols of a given codeword. This method is attractive in that it addresses some of the main issues in the design of relay codes, but it does not by itself give rise to highly structured codes with simple encoding, nor does it give rate-compatible codes. The main contribution of this work is to construct a class of codes that simultaneously possess a bilayer parity- forwarding mechanism, while also benefiting from the properties of protograph codes having an easy encoding, a modular design, and being a rate-compatible code.

Divsalar, Dariush↗
NASA NTRS2010

High-Performance CCSDS AOS Protocol Implementation in FPGA

The Consultative Committee for Space Data Systems (CCSDS) Advanced Orbiting Systems (AOS) space data link protocol provides a framing layer between channel coding such as LDPC (low-density parity-check) and higher-layer link multiplexing protocols such as CCSDS Encapsulation Service, which is described in the following article. Recent advancement in RF modem technology has allowed multi-megabit transmission over space links. With this increase in data rate, the CCSDS AOS protocol implementation needs to be optimized to both reduce energy consumption and operate at a high rate.

Clare, Loren P.↗
NASA NTRS2006

Ensemble Weight Enumerators for Protograph LDPC Codes

Recently LDPC codes with projected graph, or protograph structures have been proposed. In this paper, finite length ensemble weight enumerators for LDPC codes with protograph structures are obtained. Asymptotic results are derived as the block size goes to infinity. In particular we are interested in obtaining ensemble average weight enumerators for protograph LDPC codes which have minimum distance that grows linearly with block size. As with irregular ensembles, linear minimum distance property is sensitive to the proportion of degree-2 variable nodes. In this paper the derived results on ensemble weight enumerators show that linear minimum distance condition on degree distribution of unstructured irregular LDPC codes is a sufficient but not a necessary condition for protograph LDPC codes.

enumerators↗