Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “bit error rate”

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 415 records · Page 23

Image Data Compression Having Minimum Perceptual Error

A method is presented for performing color or grayscale image compression that eliminates redundant and invisible image components. The image compression uses a Discrete Cosine Transform (DCT) and each DCT coefficient yielded by the transform is quantized by an entry in a quantization matrix which determines the perceived image quality and the bit rate of the image being compressed. The quantization matrix comprises visual masking by luminance and contrast technique all resulting in a minimum perceptual error for any given bit rate, or minimum bit rate for a given perceptual error.

Watson, Andrew B.↗

Performances of regenerative and non-regenerative satellite repeaters with MPSK signalling

Linear (translation), hard-limited, and demod/remod types of satellite repeaters are considered in this paper. Both uncoded and coded multiple phase shift keyed (MPSK) signals are assumed to be transmitted through these repeaters. Relative performances of these repeaters in the presence of uplink and downlink noises are then compared quantitatively. Probabilities of bit errors and the computational cutoff rates are computed for 2, 4, and 8 phases PSK signals, with uplink and downlink SNRs as parameters.

Woo, K. T.↗

Image data compression having minimum perceptual error

A method for performing image compression that eliminates redundant and invisible image components is described. The image compression uses a Discrete Cosine Transform (DCT) and each DCT coefficient yielded by the transform is quantized by an entry in a quantization matrix which determines the perceived image quality and the bit rate of the image being compressed. The present invention adapts or customizes the quantization matrix to the image being compressed. The quantization matrix comprises visual masking by luminance and contrast techniques and by an error pooling technique all resulting in a minimum perceptual error for any given bit rate, or minimum bit rate for a given perceptual error.

Watson, Andrew B.↗

Modulation and synchronization technique for MF-TDMA system

This report addresses modulation and synchronization techniques for a multi-frequency time division multiple access (MF-TDMA) system with onboard baseband processing. The types of synchronization techniques analyzed are asynchronous (conventional) TDMA, preambleless asynchronous TDMA, bit synchronous timing with a preamble, and preambleless bit synchronous timing. Among these alternatives, preambleless bit synchronous timing simplifies onboard multicarrier demultiplexer/demodulator designs (about 2:1 reduction in mass and power), requires smaller onboard buffers (10:1 to approximately 3:1 reduction in size), and provides better frame efficiency as well as lower onboard processing delay. Analysis and computer simulation illustrate that this technique can support a bit rate of up to 10 Mbit/s (or higher) with proper selection of design parameters. High bit rate transmission may require Doppler compensation and multiple phase error measurements. The recommended modulation technique for bit synchronous timing is coherent QPSK with differential encoding for the uplink and coherent QPSK for the downlink.

Faris, Faris↗

Least reliable bits coding (LRBC) for high data rate satellite communications

LRBC, a bandwidth efficient multilevel/multistage block-coded modulation technique, is analyzed. LRBC uses simple multilevel 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. Soft-decision multistage decoding is used to make decisions on unprotected bits through corrections made on more protected bits. Analytical expressions and tight performance bounds are used to show that LRBC can achieve increased spectral efficiency and maintain equivalent or better power efficiency compared to that of BPSK. The relative simplicity of Galois field algebra vs the Viterbi algorithm and the availability of high-speed commercial VLSI for block codes indicates that LRBC using block codes is a desirable method for high data rate implementations.

Vanderaar, Mark↗

Digital visual communications using a Perceptual Components Architecture

The next era of space exploration will generate extraordinary volumes of image data, and management of this image data is beyond current technical capabilities. We propose a strategy for coding visual information that exploits the known properties of early human vision. This Perceptual Components Architecture codes images and image sequences in terms of discrete samples from limited bands of color, spatial frequency, orientation, and temporal frequency. This spatiotemporal pyramid offers efficiency (low bit rate), variable resolution, device independence, error-tolerance, and extensibility.

Watson, Andrew B.↗

Real-time minimal bit error probability decoding of convolutional codes

A recursive procedure is derived for decoding of rate R=1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e. fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications such as in the inner coding system for concatenated coding.

Lee, L. N.↗

Real-time minimal-bit-error probability decoding of convolutional codes

A recursive procedure is derived for decoding of rate R = 1/n binary convolutional codes which minimizes the probability of the individual decoding decisions for each information bit, subject to the constraint that the decoding delay be limited to Delta branches. This new decoding algorithm is similar to, but somewhat more complex than, the Viterbi decoding algorithm. A real-time, i.e., fixed decoding delay, version of the Viterbi algorithm is also developed and used for comparison to the new algorithm on simulated channels. It is shown that the new algorithm offers advantages over Viterbi decoding in soft-decision applications, such as in the inner coding system for concatenated coding.

Lee, L.-N.↗

Seven Years of ACTS Technology Verification Experiments Reviewed

The Advanced Communications Technology Satellite (ACTS) was designed to achieve a 99.5-percent system availability rate and signals with less than one error in 10(exp 7) bits throughout the continental United States. To accomplish such a high rate of system availability, ACTS uses multiple narrow hopping beams and very small aperture terminal (VSAT) technology. In addition, ACTS uses an adaptive rain fade compensation protocol to reduce the negative effects of propagation on the system. To enhance knowledge on how propagation and system variances affect system availability, researchers at the NASA Glenn Research Center at Lewis Field performed technology verification experiments over a 7-yr period (from September 1993 to the present). These experiments include T1VSAT System Availability, Statistical Rain Fade Compensation Characterization, Statistical Characterization of Ka-Band Propagation Effects on Communication Link Performance, and Multibeam Antenna Performance.

Acosta, Roberto J.↗

Microprocessor-controlled data synchronizer

Versatile receiver processes data at variety of rates and code formats. Functions performed are: bit detection, NRZ-L conversion, frame synchronization (with programmable word length), bit-sync acquisition and tracking, error-curve normalization, lock detection, half-bit-ambiguity resolution, and data-rate tracking.

Houston, S. W.↗

Performance measurements of a diode laser optical communications link with Q = 4 PPM signaling

The theoretical and measured performance characteristics of a direct detection optical communication system are reported. The system consisted of a semiconductor diode laser, silicon avalanche photodiode detector, and used Q = 4 optical pulse position modulation signaling to transmit binary source data at a rate of 25 megabits/sec. Operation at a receiver bit error probability of 10 to the -6th was demonstrated at received signal energies corresponding to an average of 160 detected photons per PPM symbol, or 80 photons per source bit.

Sun, X.↗

Frame synchronization for a channel with different data rates

In some communication links, different data rates are used at different times on the same channel and each is assigned a separate frame synchronization (sync) marker. The frame search is completed within a finite number of frame intervals once both phase-lock and bit-sync are achieved because the incoming data rate can change. The probability of failure to frame-lock, and an upper bound of probability of false frame-lock in a frame search mode are derived for a communication link with a 10 to the -5th bit error probability. The probability of failure to detect data-rate change and the probability of false detection of data-rate change in a frame-lock mode are discussed. In a frame-lock mode, the probability of failure to detect data-rate change and probability detection of data-rate change an equal to 4.96 x 10 to the -12th. A frame-lock device can be used for the Space Station Freedom Ku-band return link.

Kwon, Hyuck M.↗

Hybrid and concatenated coding applications.

Results of a study to evaluate the performance and implementation complexity of a concatenated and a hybrid coding system for moderate-speed deep-space applications. It is shown that with a total complexity of less than three times that of the basic Viterbi decoder, concatenated coding improves a constraint length 8 rate 1/3 Viterbi decoding system by 1.1 and 2.6 dB at bit error probabilities of 0.0001 and one hundred millionth, respectively. With a somewhat greater total complexity, the hybrid coding system is shown to obtain a 0.9-dB computational performance improvement over the basic rate 1/3 sequential decoding system. Although substantial, these complexities are much less than those required to achieve the same performances with more complex Viterbi or sequential decoder systems.

Hofman, L. B.↗

Triple-Error-Correcting Codec ASIC

Coder/decoder constructed on single integrated-circuit chip. Handles data in variety of formats at rates up to 300 Mbps, correcting up to 3 errors per data block of 256 to 512 bits. Helps reduce cost of transmitting data. Useful in many high-data-rate, bandwidth-limited communication systems such as; personal communication networks, cellular telephone networks, satellite communication systems, high-speed computing networks, broadcasting, and high-reliability data-communication links.

Jones, Robert E.↗

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↗

Psychophysical rating of image compression techniques

Image compression schemes abound with little work which compares their bit-rate performance based on subjective fidelity measures. Statistical measures of image fidelity, such as squared error measures, do not necessarily correspond to subjective measures of image fidelity. Most previous comparisons of compression techniques have been based on these statistical measures. A psychophysical method has been used to estimate, for a number of compression techniques, a threshold bit-rate yielding a criterion level of performance in discriminating original and compressed images. The compression techniques studied include block truncation, Laplacian pyramid, block discrete cosine transform, with and without a human visual system scaling, and cortex transform coders.

Stein, Charles S.↗

Global and Local Distortion Inference During Embedded Zerotree Wavelet Decompression

This paper presents algorithms for inferring global and spatially local estimates of the squared-error distortion measures for the Embedded Zerotree Wavelet (EZW) image compression algorithm. All distortion estimates are obtained at the decoder without significantly compromising EZW's rate-distortion performance. Two methods are given for propagating distortion estimates from the wavelet domain to the spatial domain, thus giving individual estimates of distortion for each pixel of the decompressed image. These local distortion estimates seem to provide only slight improvement in the statistical characterization of EZW compression error relative to the global measure, unless actual squared errors are propagated. However, they provide qualitative information about the asymptotic nature of the error that may be helpful in wavelet filter selection for low bit rate applications.

Huber, A. Kris↗

A study of high density bit transition requirements versus the effects on BCH error correcting coding

Several methods for increasing bit transition densities in a data stream are summarized, discussed in detail, and compared against constraints imposed by the 2 MHz data link of the space shuttle high rate multiplexer unit. These methods include use of alternate pulse code modulation waveforms, data stream modification by insertion, alternate bit inversion, differential encoding, error encoding, and use of bit scramblers. The psuedo-random cover sequence generator was chosen for application to the 2 MHz data link of the space shuttle high rate multiplexer unit. This method is fully analyzed and a design implementation proposed.

Ingels, F.↗