Search NASASearch

SEARCH · Search NASA

Results for “Error Floors”

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 19 records

An error floor in tone calibrated transmission

Use of a low level pilot tone has been shown to eliminate the error floor in fading channels. This paper demonstrates that non-idealities in the receiver's pilot tone filter cause reappearance of the error floor. It also presents the bit error rate (BER) in closed form, in contrast to the multidimensional numerical integration of previous work.

Cavers, James K.

Method of Error Floor Mitigation in Low-Density Parity-Check Codes

A digital communication decoding method for low-density parity-check coded messages. The decoding method decodes the low-density parity-check coded messages within a bipartite graph having check nodes and variable nodes. Messages from check nodes are partially hard limited, so that every message which would otherwise have a magnitude at or above a certain level is re-assigned to a maximum magnitude.

Hamkins, Jon

LDPC Codes with Minimum Distance Proportional to Block Size

Low-density parity-check (LDPC) codes characterized by minimum Hamming distances proportional to block sizes have been demonstrated. Like the codes mentioned in the immediately preceding article, the present codes are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. The previously mentioned codes have low decoding thresholds and reasonably low error floors. However, the minimum Hamming distances of those codes do not grow linearly with code-block sizes. Codes that have this minimum-distance property exhibit very low error floors. Examples of such codes include regular LDPC codes with variable degrees of at least 3. Unfortunately, the decoding thresholds of regular LDPC codes are high. Hence, there is a need for LDPC codes characterized by both low decoding thresholds and, in order to obtain acceptably low error floors, minimum Hamming distances that are proportional to code-block sizes. The present codes were developed to satisfy this need. The minimum Hamming distances of the present codes have been shown, through consideration of ensemble-average weight enumerators, to be proportional to code block sizes. As in the cases of irregular ensembles, the properties of these codes are sensitive to the proportion of degree-2 variable nodes. A code having too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code having too many such nodes tends not to exhibit a minimum distance that is proportional to block size. Results of computational simulations have shown that the decoding thresholds of codes of the present type are lower than those of regular LDPC codes. Included in the simulations were a few examples from a family of codes characterized by rates ranging from low to high and by thresholds that adhere closely to their respective channel capacity thresholds; the simulation results from these examples showed that the codes in question have low error floors as well as low decoding thresholds. As an example, the illustration shows the protograph (which represents the blueprint for overall construction) of one proposed code family for code rates greater than or equal to 1.2. Any size LDPC code can be obtained by copying the protograph structure N times, then permuting the edges. The illustration also provides Field Programmable Gate Array (FPGA) hardware performance simulations for this code family. In addition, the illustration provides minimum signal-to-noise ratios (Eb/No) in decibels (decoding thresholds) to achieve zero error rates as the code block size goes to infinity for various code rates. In comparison with the codes mentioned in the preceding article, these codes have slightly higher decoding thresholds.

Divsalar, Dariush

Multiple symbol partially coherent detection of MPSK

It is shown that by using the known (or estimated) value of carrier tracking loop signal to noise ratio (SNR) in the decision metric, it is possible to improve the error probability performance of a partially coherent multiple phase-shift-keying (MPSK) system relative to that corresponding to the commonly used ideal coherent decision rule. Using a maximum-likeihood approach, an optimum decision metric is derived and shown to take the form of a weighted sum of the ideal coherent decision metric (i.e., correlation) and the noncoherent decision metric which is optimum for differential detection of MPSK. The performance of a receiver based on this optimum decision rule is derived and shown to provide continued improvement with increasing length of observation interval (data symbol sequence length). Unfortunately, increasing the observation length does not eliminate the error floor associated with the finite loop SNR. Nevertheless, in the limit of infinite observation length, the average error probability performance approaches the algebraic sum of the error floor and the performance of ideal coherent detection, i.e., at any error probability above the error floor, there is no degradation due to the partial coherence. It is shown that this limiting behavior is virtually achievable with practical size observation lengths. Furthermore, the performance is quite insensitive to mismatch between the estimate of loop SNR (e.g., obtained from measurement) fed to the decision metric and its true value. These results may be of use in low-cost Earth-orbiting or deep-space missions employing coded modulations.

Simon, M. K.

Error-Rate Bounds for Coded PPM on a Poisson Channel

Equations for computing tight bounds on error rates for coded pulse-position modulation (PPM) on a Poisson channel at high signal-to-noise ratio have been derived. These equations and elements of the underlying theory are expected to be especially useful in designing codes for PPM optical communication systems. The equations and the underlying theory apply, more specifically, to a case in which a) At the transmitter, a linear outer code is concatenated with an inner code that includes an accumulator and a bit-to-PPM-symbol mapping (see figure) [this concatenation is known in the art as "accumulate-PPM" (abbreviated "APPM")]; b) The transmitted signal propagates on a memoryless binary-input Poisson channel; and c) At the receiver, near-maximum-likelihood (ML) decoding is effected through an iterative process. Such a coding/modulation/decoding scheme is a variation on the concept of turbo codes, which have complex structures, such that an exact analytical expression for the performance of a particular code is intractable. However, techniques for accurately estimating the performances of turbo codes have been developed. The performance of a typical turbo code includes (1) a "waterfall" region consisting of a steep decrease of error rate with increasing signal-to-noise ratio (SNR) at low to moderate SNR, and (2) an "error floor" region with a less steep decrease of error rate with increasing SNR at moderate to high SNR. The techniques used heretofore for estimating performance in the waterfall region have differed from those used for estimating performance in the error-floor region. For coded PPM, prior to the present derivations, equations for accurate prediction of the performance of coded PPM at high SNR did not exist, so that it was necessary to resort to time-consuming simulations in order to make such predictions. The present derivation makes it unnecessary to perform such time-consuming simulations.

Moision, Bruce

Soft-Decision-Data Reshuffle to Mitigate Pulsed Radio Frequency Interference Impact on Low-Density-Parity-Check Code Performance

This presentation briefly discusses a research effort on mitigation techniques of pulsed radio frequency interference (RFI) on a Low-Density-Parity-Check (LDPC) code. This problem is of considerable interest in the context of providing reliable communications to the space vehicle which might suffer severe degradation due to pulsed RFI sources such as large radars. The LDPC code is one of modern forward-error-correction (FEC) codes which have the decoding performance to approach the Shannon Limit. The LDPC code studied here is the AR4JA (2048, 1024) code recommended by the Consultative Committee for Space Data Systems (CCSDS) and it has been chosen for some spacecraft design. Even though this code is designed as a powerful FEC code in the additive white Gaussian noise channel, simulation data and test results show that the performance of this LDPC decoder is severely degraded when exposed to the pulsed RFI specified in the spacecraft s transponder specifications. An analysis work (through modeling and simulation) has been conducted to evaluate the impact of the pulsed RFI and a few implemental techniques have been investigated to mitigate the pulsed RFI impact by reshuffling the soft-decision-data available at the input of the LDPC decoder. The simulation results show that the LDPC decoding performance of codeword error rate (CWER) under pulsed RFI can be improved up to four orders of magnitude through a simple soft-decision-data reshuffle scheme. This study reveals that an error floor of LDPC decoding performance appears around CWER=1E-4 when the proposed technique is applied to mitigate the pulsed RFI impact. The mechanism causing this error floor remains unknown, further investigation is necessary.

Ni, Jianjun David

Protograph based LDPC codes with minimum distance linearly growing with block size

We propose several LDPC code constructions that simultaneously achieve good threshold and error floor performance. Minimum distance is shown to grow linearly with block size (similar to regular codes of variable degree at least 3) by considering ensemble average weight enumerators. Our constructions are based on projected graph, or protograph, structures that support high-speed decoder implementations. As with irregular ensembles, our constructions are sensitive to the proportion of degree-2 variable nodes. A code with too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code with too many such nodes tends to not exhibit a minimum distance that grows linearly in block length. In this paper we also show that precoding can be used to lower the threshold of regular LDPC codes. The decoding thresholds of the proposed codes, which have linearly increasing minimum distance in block size, outperform that of regular LDPC codes. Furthermore, a family of low to high rate codes, with thresholds that adhere closely to their respective channel capacity thresholds, is presented. Simulation results for a few example codes show that the proposed codes have low error floors as well as good threshold SNFt performance.

minimum decoding

Short-Block Protograph-Based LDPC Codes

Short-block low-density parity-check (LDPC) codes of a special type are intended to be especially well suited for potential applications that include transmission of command and control data, cellular telephony, data communications in wireless local area networks, and satellite data communications. [In general, LDPC codes belong to a class of error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels.] The codes of the present special type exhibit low error floors, low bit and frame error rates, and low latency (in comparison with related prior codes). These codes also achieve low maximum rate of undetected errors over all signal-to-noise ratios, without requiring the use of cyclic redundancy checks, which would significantly increase the overhead for short blocks. These codes have protograph representations; this is advantageous in that, for reasons that exceed the scope of this article, the applicability of protograph representations makes it possible to design highspeed iterative decoders that utilize belief- propagation algorithms.

Divsalar, Dariush

Laboratory measurements and a theoretical analysis of the TCT fading channel radio system

This paper documents the laboratory and theoretical performance of a pilot-aided digital radio system. The technique considered transmits a midband pilot tone to improve the receiver data detection performance in a multipath fading channel and is referred to as the tone calibrated technique (TCT). The performance of a 860 MHz prototype system carrying 2.4 kbit/s data under Rician fading conditions is reported. Both experimental and analytical results show that the error floor experienced with nonpilot-aided transmission methods is effectively removed by the TCT scheme, resulting in significant performance gains at high signal-to-noise ratio values. The paper also examines the TCT system performance under typical operating conditions and presents a new analysis of the TCT theoretical error probability.

Rafferty, William

Polar Coding For Forward Error Correction In Space Communications With LDPC Comparisons

With the surging development of optical telecommunicationsfor space applications, the importance of errorcorrection has become more apparent than ever. Specifically,the exploration of forward error correction code (FEC) methodologieswill be instrumental in developing the standards foroptical communications in space. Despite the widespread useof low-density parity-check (LDPC) codes, alternate FEC codessuch as polar codes have shown immense promise in assistingspace communications error correction with their ability tobypass the error floors that plague LDPC codes. Extremelypromising techniques including cyclic redundancy checks (CRC),successive cancellation (SC), and successive cancellation lists(SCL) that assist polar coding in achieving the Shannon limitin a timely manner are evaluated. MATLAB simulations areconducted with AWGN and burst noise to test each technique'sability to handle noise typically encountered in space and eachtechnique's ability to correct unexpected errors. Results ofsimulations for different rates and message lengths are alsoreported to determine each technique's ability to handle largedata volumes and fix errors. Similar simulations are conductedfor LDPC codes with additional tests for convolutional and nointerleavers. Finally, a discussion regarding the future ability ofpolar codes to satisfy current missions in the place of, or inconjunction with, LDPC codes along with the merits of eachFEC technique's ability to process data efficiently and handledata while maintaining adequate performance will be provided.Preliminary recommendations will be made for each technique'seffectiveness for GEO related missions along with discussionsregarding each technique's ability to fit within the CCSDS standards for optical communications.

Polar Coding

DMSK: A practical 2400-bps receiver for the mobile satellite service: An MSAT-X Report

The partical aspects of a 2400-bps differential detection minimum-shift-keying (DMSK) receiver are investigated. Fundamental issues relating to hardware precision, Doppler shift, fading, and frequency offset are examined, and it is concluded that the receiver's implementation at baseband is more advantageous both in cost and simplicity than its IF implementation. The DMSK receiver has been fabricated and tested under simulated mobile satellite environment conditions. The measured receiver performance in the presence of anomalies pertinent to the link is presented in this report. Furthermore, the receiver behavior in a band-limited channel (GMSK) is also investigated. The DMSK receiver performs substantially better than a coherent minimum-shift-keying (MSK) receiver in a heavily fading environment. The DMSK radio is simple and robust, and results in a lower error floor than its coherent counterpart. Moreover, this receiver is suitable for burst-type signals, and its recovery from deep fades is fast.

Davarian, F.

Coherent versus noncoherent signaling for satellite-aided mobile communications

The use of coherent versus noncoherent communications is an unresolved issue for the mobile satellite community. Should one select the more robust but less efficient noncoherent strategy for communications over satellite-aided mobile channels, or does the introduction of a space platform in the mobile link improve signal stability (both amplitude and phase) such that conventional coherent schemes become attractive? This publication tries to answer some of the questions by discussing the results from experiments using a coherent QPSK receiver. The issues discussed include items such as the measured performance in Rician fading, the link error floor in a fading environment, etc. The results are compared and contrasted with that of a noncoherent limiter/discriminator FM receiver.

Davarian, F.

Channel simulation to facilitate mobile-satellite communications research

The mobile-satellite-service channel simulator, which is a facility for an end-to-end hardware simulation of mobile satellite communications links is discussed. Propagation effects, Doppler, interference, band limiting, satellite nonlinearity, and thermal noise have been incorporated into the simulator. The propagation environment in which the simulator needs to operate and the architecture of the simulator are described. The simulator is composed of: a mobile/fixed transmitter, interference transmitters, a propagation path simulator, a spacecraft, and a fixed/mobile receiver. Data from application experiments conducted with the channel simulator are presented; the noise converison technique to evaluate interference effects, the error floor phenomenon of digital multipath fading links, and the fade margin associated with a noncoherent receiver are examined. Diagrams of the simulator are provided.

Davarian, Faramaz

An additional study and implementation of tone calibrated technique of modulation

The Tone Calibrated Technique (TCT) was shown to be theoretically free from an error floor, and is only limited, in practice, by implementation constraints. The concept of the TCT transmission scheme along with a baseband implementation of a suitable demodulator is introduced. Two techniques for the generation of the TCT signal are considered: a Manchester source encoding scheme (MTCT) and a subcarrier based technique (STCT). The results are summarized for the TCT link computer simulation. The hardware implementation of the MTCT system is addressed and the digital signal processing design considerations involved in satisfying the modulator/demodulator requirements are outlined. The program findings are discussed and future direction are suggested based on conclusions made regarding the suitability of the TCT system for the transmission channel presently under consideration.

Rafferty, W.

Error control techniques for satellite and space communications

This report focuses on the results obtained during the PI's recent sabbatical leave at the Swiss Federal Institute of Technology (ETH) in Zurich, Switzerland, from January 1, 1995 through June 30, 1995. Two projects investigated various properties of TURBO codes, a new form of concatenated coding that achieves near channel capacity performance at moderate bit error rates. The performance of TURBO codes is explained in terms of the code's distance spectrum. These results explain both the near capacity performance of the TURBO codes and the observed 'error floor' for moderate and high signal-to-noise ratios (SNR's). A semester project, entitled 'The Realization of the Turbo-Coding System,' involved a thorough simulation study of the performance of TURBO codes and verified the results claimed by previous authors. A copy of the final report for this project is included as Appendix A. A diploma project, entitled 'On the Free Distance of Turbo Codes and Related Product Codes,' includes an analysis of TURBO codes and an explanation for their remarkable performance. A copy of the final report for this project is included as Appendix B.

Costello, Daniel J., Jr.

Transfer function bounds on the performance of turbo codes

In this article we apply transfer function bounding techniques to obtain upper bounds on the bit-error rate for maximum likelihood decoding of turbo codes constructed with random permutations. These techniques are applied to two turbo codes with constraint length 3 and later extended to other codes. The performance predicted by these bounds is compared with simulation results. The bounds are useful in estimating the 'error floor' that is difficult to measure by simulation, and they provide insight on how to lower this floor. More refined bounds are needed for accurate performance measures at lower signal-to-noise ratios.

Divsalar, D.

Global Velocities from VLBI

Precise geodetic Very Long Baseline Interferometry (VLBI) measurements have been made since 1979 at about 130 points on all major tectonic plates, including stable interiors and deformation zones. From the data set of about 2900 observing sessions and about 2.3 million observations, useful three-dimensional velocities can be derived for about 80 sites using an incremental least-squares adjustment of terrestrial, celestial, Earth rotation and site/session-specific parameters. The long history and high precision of the data yield formal errors for horizontal velocity as low as 0.1 mm/yr, but the limitation on the interpretation of individual site velocities is the tie to the terrestrial reference frame. Our studies indicate that the effect of converting precise relative VLBI velocities to individual site velocities is an error floor of about 0.4 mm/yr. Most VLBI horizontal velocities in stable plate interiors agree with the NUVEL-1A model, but there are significant departures in Africa and the Pacific. Vertical precision is worse by a factor of 2-3, and there are significant non-zero values that can be interpreted as post-glacial rebound, regional effects, and local disturbances.

Ma, Chopo