Detecting and correcting bit errors on magnetic tape
Procedure detects and corrects errors in data held for long term storage on magnetic tape.
Perlman, M.↗
SEARCH · Engineering Papers
Results for “bit error”
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.
Bit error rate evaluation of GSTDN/TDRSS communication links
Previously cited in issue 08, p. 1191, Accession no. A82-22092
Coffey, R. E.↗
The bit-error rate performance of a satellite microwave matrix switch
The matrix switch is a critical element of communications satellites using multiple-beam antennas and on-board switching. Two proof-of-concept models of a microwave matrix switch have been developed under NASA-sponsored contracts. These switches have undergone extensive testing at NASA Lewis Research Center to determine their operating characteristics in a system environment. The results of these tests indicate the effect of the matrix switch on the overall system operation.
Kerczewski, Robert J.↗
The bit-error rate performance of a satellite microwave matrix switch
The matrix switch is a critical element of communications satellites employing multiple beam antennas and on-board switching. Two proof-of-concept models of a microwave matrix switch have been developed under NASA-sponsored contracts. These switches have undergone extensive testing at NASA Lewis Research Center to determine their operating characteristics in a system environment. The results of these tests indicate the effect of the matrix switch on the overall system operation.
Kerczewski, Robert J.↗
Performance of concatenated Reed-Solomon/Viterbi channel coding
The concatenated Reed-Solomon (RS)/Viterbi coding system is reviewed. The performance of the system is analyzed and results are derived with a new simple approach. A functional model for the input RS symbol error probability is presented. Based on this new functional model, we compute the performance of a concatenated system in terms of RS word error probability, output RS symbol error probability, bit error probability due to decoding failure, and bit error probability due to decoding error. Finally we analyze the effects of the noisy carrier reference and the slow fading on the system performance.
Divsalar, D.↗
Asymmetric Memory Circuit Would Resist Soft Errors
Some nonlinear error-correcting codes more efficient in presence of asymmetry. Combination of circuit-design and coding concepts expected to make integrated-circuit random-access memories more resistant to "soft" errors (temporary bit errors, also called "single-event upsets" due to ionizing radiation). Integrated circuit of new type made deliberately more susceptible to one kind of bit error than to other, and associated error-correcting code adapted to exploit this asymmetry in error probabilities.
Buehler, Martin G.↗
A compact presentation of DSN array telemetry performance
The telemetry performance of an arrayed receiver system, including radio losses, is often given by a family of curves giving bit error rate vs bit SNR, with tracking loop SNR at one receiver held constant along each curve. This study shows how to process this information into a more compact, useful format in which the minimal total signal power and optimal carrier suppression, for a given fixed bit error rate, are plotted vs data rate. Examples for baseband-only combining are given. When appropriate dimensionless variables are used for plotting, receiver arrays with different numbers of antennas and different threshold tracking loop bandwidths look much alike, and a universal curve for optimal carrier suppression emerges.
Greenhall, C. A.↗
Characteristics of Single-Event Upsets in a Fabric Switch (ADS151)
Abstract-Two types of single event effects - bit errors and single event functional interrupts - were observed during heavy-ion testing of the AD8151 crosspoint switch. Bit errors occurred in bursts with the average number of bits in a burst being dependent on both the ion LET and on the data rate. A pulsed laser was used to identify the locations on the chip where the bit errors and single event functional interrupts occurred. Bit errors originated in the switches, drivers, and output buffers. Single event functional interrupts occurred when the laser was focused on the second rank latch containing the data specifying the state of each switch in the 33x17 matrix.
Buchner, Stephen↗
Short constraint length rate 1/2 'quick-look' codes
Quick-look nonsystematic convolutional codes have the property that the information sequence may be recovered from the encoded sequence in straightforward fashion and with a minimum of error amplification. In this concise paper we investigate their relevant characteristics for constraint lengths less than eight and rate 1/2 and obtain a number of interesting and practically useful results. In particular, for the best of these codes, we derive their free distance and error amplification, their decoded bit error probability when used over the binary symmetric channel in conjunction with Viterbi decoding, and show how they can be employed to measure the channel bit error rate.
Helgert, H. J.↗
Improving the performance of soft decision Viterbi decoding in a non-Gaussian environment through non-linear quantization
The performance of Viterbi decoding in a non-Gaussian environment is investigated using a nonlinear quantization strategy. The channel model consists of a convolutionally encoded BPSK signal transmitted to a satellite where it is corrupted with additive white Gaussian noise and pulsed radio frequency interference (RFI). The resultant signal is then passed through a satellite nonlinearity and transmitted to a ground station where it is coherently detected. Interleaving is assumed in order to make the channel memoryless. The presence of RFI makes the channel statistics non-Gaussian, leading to a nonlinear log-likelihood function. A near optimum quantization scheme is found by maximizing a channel parameter, or by matching the quantizer to the log-likelihood function in a mean square error sense. Bit error rate performance improvement is achieved by using such nonlinear quantization.
Mcgregor, D. N.↗
Telecommunications end-to-end systems monitoring on TOPEX/Poseidon: Tools and techniques
The TOPEX/Poseidon Project Satellite Performance Analysis Team's (SPAT) roles and responsibilities have grown to include functions that are typically performed by other teams on JPL Flight Projects. In particular, SPAT Telecommunication's role has expanded beyond the nominal function of monitoring, assessing, characterizing, and trending the spacecraft (S/C) RF/Telecom subsystem to one of End-to-End Information Systems (EEIS) monitoring. This has been accomplished by taking advantage of the spacecraft and ground data system structures and protocols. By processing both the received spacecraft telemetry minor frame ground generated CRC flags and NASCOM block poly error flags, bit error rates (BER) for each link segment can be determined. This provides the capability to characterize the separate link segments, determine science data recovery, and perform fault/anomaly detection and isolation. By monitoring and managing the links, TOPEX has successfully recovered approximately 99.9 percent of the science data with an integrity (BER) of better than 1 x 10(exp 8). This paper presents the algorithms used to process the above flags and the techniques used for EEIS monitoring.
Calanche, Bruno J.↗
Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes: The Map and Related Decoding Algirithms - Part 3
In a coded communication system with equiprobable signaling, MLD minimizes the word error probability and delivers the most likely codeword associated with the corresponding received sequence. This decoding has two drawbacks. First, minimization of the word error probability is not equivalent to minimization of the bit error probability. Therefore, MLD becomes suboptimum with respect to the bit error probability. Second, MLD delivers a hard-decision estimate of the received sequence, so that information is lost between the input and output of the ML decoder. This information is important in coded schemes where the decoded sequence is further processed, such as concatenated coding schemes, multi-stage and iterative decoding schemes. In this chapter, we first present a decoding algorithm which both minimizes bit error probability, and provides the corresponding soft information at the output of the decoder. This algorithm is referred to as the MAP (maximum aposteriori probability) decoding algorithm.
Lin, Shu↗
Performance of quadrature overlapped raised-cosine modulation over nonlinear satellite channels
This paper considers the performance evaluation of Staggered Quadrature Overlapped Raised Cosine (SQORC) signal transmission through wideband nonlinear satellite channels in the presence of uplink and downlink additive Gaussian noise. Expressions for the bit error rate are derived for a general transponder model with AM-AM and AM-PM conversion. It is shown that the bit error rate of SQORC is one-half of the sum of the bit error rate of MSK at 2/3 of the uplink signal-to-noise ratio and the bit error rate of Quadriphase Phase-Shift Keying QPSK at 4/3 of the uplink signal-to-noise ratio, whereas the spectrum of SQROC is the product of MSK and QPSK spectra. Numerical results are presented for a transponder which is modelled as a hard limiter.
Divsalar, D.↗
Improving TCP Network Performance by Detecting and Reacting to Packet Reordering
There are many factors governing the performance of TCP-basec applications traversing satellite channels. The end-to-end performance of TCP is known to be degraded by the reordering, delay, noise and asymmetry inherent in geosynchronous systems. This result has been largely based on experiments that evaluate the performance of TCP in single flow tests. While single flow tests are useful for deriving information on the theoretical behavior of TCP and allow for easy diagnosis of problems they do not represent a broad range of realistic situations and therefore cannot be used to authoritatively comment on performance issues. The experiments discussed in this report test TCP s performance in a more dynamic environment with competing traffic flows from hundreds of TCP connections running simultaneously across the satellite channel. Another aspect we investigate is TCP's reaction to bit errors on satellite channels. TCP interprets loss as a sign of network congestion. This causes TCP to reduce its transmission rate leading to reduced performance when loss is due to corruption. We allowed the bit error rate on our satellite channel to vary widely and tested the performance of TCP as a function of these bit error rates. Our results show that the average performance of TCP on satellite channels is good even under conditions of loss as high as bit error rates of 10(exp -5)
Kruse, Hans↗
A cascaded coding scheme for error control and its performance analysis
A coding scheme for error control in data communication systems is investigated. The scheme is obtained by cascading two error-correcting codes, called the inner and outer codes. Its error performance is analyzed for a binary symmetric channel with bit-error rate epsilon less than 1/2. It is shown that, if the inner and outer codes are chosen properly, high reliability can be attained even for a high-channel bit-error rate. Specific examples with inner codes ranging from high rates and Reed-Solomon codes as outer codes are considered, and their error probabilities evaluated. They all provide high reliability even for high bit-error rates, say 0.1-0.01. Several example schemes are being considered for satellite and spacecraft downlink error control.
Kasami, Tadao↗
Correction of burst errors containing bit slippages for cyclic block codes
A technique is presented for correction of an (n,k) cyclic block code subjected to a noise disturbance consisting of an arbitrary number of both bit deletions and bit inversions contained within a single error burst. Following the procedure described by Meggitt (1961), the correction of a b-bit burst is attempted by first loading the initial error syndrome into an (n-k) order feedback shift register with taps selected for the code's generating polynomial; the register is then successively shifted one bit position in the direction of lower order. The discussion covers burst correction with m-bit deletion, burst/deletion decoder implementation, false correction probability, and bit slippage involving bit insertions. The principal elements of the burst/deletion correction decoder are presented in schematic form.
Green, E. P.↗