Search NASA⌕ Search

SEARCH · Search NASA

Results for “Decoder”

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
NASA NTRS1982

The effects of Viterbi decoder node synchronization losses on the telemetry receiving system

The Viterbi decoders currently used by the Deep space Network (DSN) use an algorithm for maintaining node synchronization that breaks down at bit signal-to-noise ratios (SNRs) of about 2.0 dB. It is shown that this can become an important consideration when the effects of noisy carrier referencing are combined with the lower SNRs that are expected at Voyager 2 Uranus and Neptune encounters. Depending on the available carrier power, node synchronization losses of between 0.85 and 1.25 dB can be expected in addition to the radio loss.

Deutsch, L. J.↗
NASA NTRS1981

Conceptual design for a universal Reed-Solomon decoder

An algorithm which enables one Reed-Solomon decoder to process other Reed-Solomon encoded data from a different code is presented. The sole requirement is that both codes have the same length, the same rate, and the same field of coefficients. It is pointed out that only very simple pre- and post-processing hardware is needed to resolve an encoder/decoder incompatibility and that no encoder modification is needed.

Miller, R. L.↗
NASA NTRS1980

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.↗
NASA NTRS1982

Viterbi decoder node synchronization losses in the Reed-Solomon/Veterbi concatenated channel

The Viterbi decoders currently used by the Deep Space Network (DSN) employ an algorithm for maintaining node synchronization that significantly degrades at bit signal-to-noise ratios (SNRs) of below 2.0 dB. In a recent report by the authors, it was shown that the telemetry receiving system, which uses a convolutionally encoded downlink, will suffer losses of 0.85 dB and 1.25 dB respectively at Voyager 2 Uranus and Neptune encounters. This report extends the results of that study to a concatenated (255,223) Reed-Solomon/(7, 1/2) convolutionally coded channel, by developing a new radio loss model for the concatenated channel. It is shown here that losses due to improper node synchronization of 0.57 dB at Uranus and 1.0 dB at Neptune can be expected if concatenated coding is used along with an array of one 64-meter and three 34-meter antennas.

Deutsch, L. J.↗
NASA NTRS1983

Node Synchronization for the Viterbi Decoder

At very low signal to noise ratios such as those that Voyager 2 will encounter at Uranus, the performance of the Reed-Solomon/Viterbi concatenated coding system could be seriously degraded by loss of node synchronization by the Viterbi decoder. This problem is described and now it can be almost completely avoided with a simple outboard hardware ""node synchronizer''. This device makes statistical decisions about node sync based on the hard quantized undecoded data stream. In a worst case Voyager-like environment, our method will detect and correct a true loss of node sync (thought to be a very rate event) within several hundred bits; many of these false alarms for our technique is on the order several years.

Lorden, G.↗
NASA NTRS1984

Probability of undetected error after decoding for a concatenated coding scheme

A concatenated coding scheme for error control in data communications is analyzed. In this scheme, the inner code is used for both error correction and detection, however the outer code is used only for error detection. A retransmission is requested if the outer code detects the presence of errors after the inner code decoding. Probability of undetected error is derived and bounded. A particular example, proposed for NASA telecommand system is analyzed.

Costello, D. J., Jr.↗
NASA NTRS1984

Performance Simulation for Unit-memory Convolutional Codes with Byte-oriented Viterbi Decoding Algorithm

A software package developed to simulate the performance of the byte-oriented Viterbi decoding algorithm for unit-memory (UM) codes on both 3-bit and 4-bit quantized AWGN channels is described. The simulation is shown to require negligible memory and less time than that for the RTMBEP algorith, although they both provide similar performance in terms of symbol-error probability. This makes it possible to compute the symbol-error probability of large codes and to determine the signal-to-noise ratio required to achieve a bit error rate (BER) of 0.000001 for corresponding concatenated systems. A (7, 10/48) UM code, 10-bit Reed-Solomon code combination achieves the required BER at 1.08 dB for a 3-bit quantized channel and at 0.91 dB for a 4-bit quantized channel.

Vo, Q. D.↗
NASA NTRS1984

Node synchronization for the Viterbi decoder

At very low signal to noise ratios such as those that Voyager 2 will encounter at Uranus, the performance of the Reed-Solomon/Viterbi concatenated coding system could be seriously degraded by loss of node synchronization by the Viterbi decoder. This problem is described and now it can be almost completely avoided with a simple outboard hardware 'node synchronizer'. This device makes statistical decisions about node sync based on the hard quantized undecoded data stream. In a worst case Voyager-like environment, our method will detect and correct a true loss of node sync (thought to be a very rare event) within several hundred bits; many of these false alarms for our technique is on the order several years. Previously announced in STAR as N83-28028

Lorden, G.↗
NASA NTRS1986

Fast Reed-Solomon Decoder

High-speed decoder intended for use with Reed-Solomon (RS) codes of long code length and high error-correcting capability. Design based on algorithm that includes high-radix Fermat transform procedure, which is most efficient for high speeds. RS code in question has code-word length of 256 symbols, of which 224 are information symbols and 32 are redundant.

Liu, K. Y.↗
NASA NTRS1984

A Very Efficient Transfer Function Bounding Technique on Bit Error Rate for Viterbi Decoded, Rate 1/N Convolutional Codes

For rate 1/N convolutional codes, a recursive algorithm for finding the transfer function bound on bit error rate (BER) at the output of a Viterbi decoder is described. This technique is very fast and requires very little storage since all the unnecessary operations are eliminated. Using this technique, we find and plot bounds on the BER performance of known codes of rate 1/2 with K 18, rate 1/3 with K 14. When more than one reported code with the same parameter is known, we select the code that minimizes the required signal to noise ratio for a desired bit error rate of 0.000001. This criterion of determining goodness of a code had previously been found to be more useful than the maximum free distance criterion and was used in the code search procedures of very short constraint length codes. This very efficient technique can also be used for searches of longer constraint length codes.

Lee, P. J.↗
NASA NTRS1985

A Software Simulation Study of a Sequential Decoder Using the Fano Algorithm

A set of subroutines was developed to simulate the performance of a sequential decoder based on the Fano algorithm. This simulation can be used to verify the coding performance of the International Cometary Explorer (ICE) communication link. The probability of frame deletion can be measured as a function of the number of computations allowed per frame and of E(b)/N(o). Both hard and soft quantized inputs are considered.

Pollara, F.↗
NASA NTRS1985

Coding and decoding for code division multiple user communication systems

A new algorithm is introduced which decodes code division multiple user communication signals. The algorithm makes use of the distinctive form or pattern of each signal to separate it from the composite signal created by the multiple users. Although the algorithm is presented in terms of frequency-hopped signals, the actual transmitter modulator can use any of the existing digital modulation techniques. The algorithm is applicable to error-free codes or to codes where controlled interference is permitted. It can be used when block synchronization is assumed, and in some cases when it is not. The paper also discusses briefly some of the codes which can be used in connection with the algorithm, and relates the algorithm to past studies which use other approaches to the same problem.

Healy, T. J.↗
NASA NTRS1986

Choosing channel quantization levels and viterbi decoding for space diversity reception over the additive white Guassian noise channel

Previous work in the area of choosing channel quantization levels for a additive white Gaussian noise channel composed of one receiver-demodulator is reviewed, and how this applies to the Deep Space Network composed of several receiver-demodulators (space diversity reception) is shown. Viterbi decoding for the resulting quantized channel is discussed.

Kalson, S.↗
NASA NTRS1986

A single VLSI chip for computing syndromes in the (225, 223) Reed-Solomon decoder

A description of a single VLSI chip for computing syndromes in the (255, 223) Reed-Solomon decoder is presented. The architecture that leads to this single VLSI chip design makes use of the dual basis multiplication algorithm. The same architecture can be applied to design VLSI chips to compute various kinds of number theoretic transforms.

Hsu, I. S.↗
NASA NTRS1987

Systolic arrays and stack decoding

The application of systolic priority queues to the sequential stack decoding algorithm is discussed in a review of the work of K. Yao and C. Y. Chang. Using a systolic array architecture, one can significantly improve the performance of such algorithms at high signal-to-noise ratios.

Shahshahani, M.↗
NASA NTRS1987

Soft-decision decoding of some block codes

The performance of certain binary block codes with soft-decision decoding is evaluated by simulation. A construction is proposed to introduce memory on block codes, and simulation results are shown for a trellis code derived from the Nordstrom-Robinson code.

Pollara, F.↗
NASA NTRS1986

VLSI Reed Solomon decoder design

A Reed Solomon code is a highly efficient error correcting code that NASA will use in future space communication missions. A VLSI implementation of the decoder is presented that accepts data rates of 80 Mbits/second. A total of seven chips are needed and operate with the symbol clock being the system clock for the chip set. Approximately 1.65 billion Galois Field operations per second are achieved with this chip set.

Maki, Gary K.↗