Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS1977

On the error probability of general trellis codes with applications to sequential decoding

An upper bound on the average probability of error for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n with distinction between memory length and tail length is given. It is shown that the bound is independent of the length L of the information sequence if the memory length exceeds the tail length by a specified amount that depends on L. Sequential decoding simulations using the stack algorithm were conducted to test the dependence of the undetected error probability on tail length and memory length, and the results corroborated the theory.

Johannesson, R.↗
NASA NTRS1977

DSN telemetry system performance using a maximum likelihood convolutional decoder

Results are described of telemetry system performance testing using DSN equipment and a Maximum Likelihood Convolutional Decoder (MCD) for code rates 1/2 and 1/3, constraint length 7 and special test software. The test results confirm the superiority of the rate 1/3 over that of the rate 1/2. The overall system performance losses determined at the output of the Symbol Synchronizer Assembly are less than 0.5 db for both code rates. Comparison of the performance is also made with existing mathematical models. Error statistics of the decoded data are examined. The MCD operational threshold is found to be about 1.96 db.

Benjauthrit, B.↗
NASA NTRS1978

Transform decoding of Reed-Solomon codes over GF(2 to the 2n power using the techniques of Winograd

An algorithm for computing a Fourier-like transform over GF(2 to the (second power) to the n power), where n = 1,2,3,4,5, was developed to encode and decode and Reed-Solomon (RS) codes of length 2 to the (second power) to the n power. Such as RS detector is considerably faster than a decoder that uses the conventional fast transform over GF(2 to the (second power) to the n power).

Reed, I. S.↗
NASA NTRS1978

Bursty channel errors and the Viterbi decoder

Recent applications have developed for spread spectrum communications, hardware data transfer, high rate digital systems, etc. that use channels for which errors tend to occur in short bursts in addition to those at random, i.e., compound channels. Viterbi decoding algorithms are generally very good for random error channels but are not as efficient for burst errors or for compound channels. This paper presents the results of a computer simulation study of the performance of various Viterbi decoders when receiving data corrupted with burst and random errors on the same channel. Simulations were performed using hard-decision CPSK.

Ingels, F.↗
NASA NTRS1979

Decoding of B.C.H. and R.S. codes with errors and erasures using continued fractions

Through the use of continuing fractions, a simplified algorithm for decoding B.C.H. and R.S. codes is developed that corrects both erasures and errors on a finite field GF(q to the m). It is noted that the decoding method is a modification of the Forney-Belekamp technique. Finally, it is believed that the present scheme is both simpler to understand and to implement than more conventional algorithms.

Reed, I. S.↗
NASA NTRS1981

Burst statistics of Viterbi decoding

A mathematical model of Viterbi decoder burst error performance is presented. This model allows for computer generation of Viterbi-like error sequences quickly and inexpensively for applications where large amounts of data are required. The model is corroborated through comparisons with actual software decoder simulations.

Deutsch, L. J.↗
NASA NTRS1982

Development of an LSI maximum-likelihood convolutional decoder for advanced forward error correction capability on the NASA 30/20 GHz program

The particular coding option identified as providing the best level of coding gain performance in an LSI-efficient implementation was the optimal constraint length five, rate one-half convolutional code. To determine the specific set of design parameters which optimally matches this decoder to the LSI constraints, a breadboard MCD (maximum-likelihood convolutional decoder) was fabricated and used to generate detailed performance trade-off data. The extensive performance testing data gathered during this design tradeoff study are summarized, and the functional and physical MCD chip characteristics are presented.

Clark, R. T.↗
NASA NTRS1981

A low-power, high-throughput maximum-likelihood convolutional decoder chip for NASA's 30/20 GHz program

It is pointed out that the NASA 30/20 GHz program will place in geosynchronous orbit a technically advanced communication satellite which can process time-division multiple access (TDMA) information bursts with a data throughput in excess of 4 GBPS. To guarantee acceptable data quality during periods of signal attenuation it will be necessary to provide a significant forward error correction (FEC) capability. Convolutional decoding (utilizing the maximum-likelihood techniques) was identified as the most attractive FEC strategy. Design trade-offs regarding a maximum-likelihood convolutional decoder (MCD) in a single-chip CMOS implementation are discussed.

Mccallister, R. D.↗
NASA NTRS1983

New syndrome decoder for (n, 1) convolutional codes

The letter presents a new syndrome decoding algorithm for the (n, 1) convolutional codes (CC) that is different and simpler than the previous syndrome decoding algorithm of Schalkwijk and Vinck. The new technique uses the general solution of the polynomial linear Diophantine equation for the error polynomial vector E(D). A recursive, Viterbi-like, algorithm is developed to find the minimum weight error vector E(D). An example is given for the binary nonsystematic (2, 1) CC.

Reed, I. S.↗
NASA NTRS1984

Simulations for Full Unit-memory and Partial Unit-memory Convolutional Codes with Real-time Minimal-byte-error Probability Decoding Algorithm

A program which was written to simulate Real Time Minimal-Byte-Error Probability (RTMBEP) decoding of full unit-memory (FUM) convolutional codes on a 3-bit quantized AWGN channel is described. This program was used to compute the symbol-error probability of FUM codes and to determine the signal to noise (SNR) required to achieve a bit error rate (BER) of 10 to the minus 6th power for corresponding concatenated systems. A (6,6/30) FUM code, 6-bit Reed-Solomon code combination was found to achieve the required BER at a SNR of 1.886 dB. The RTMBEP algorithm was then modified for decoding partial unit-memory (PUM) convolutional codes. A simulation program was also written to simulate the symbol-error probability of these codes.

Vo, Q. D.↗
NASA NTRS1984

Performance analysis of the word synchronization properties of the outer code in a TDRSS decoder

A self-synchronizing coding scheme for NASA's TDRSS satellite system is a concatenation of a (2,1,7) inner convolutional code with a (255,223) Reed-Solomon outer code. Both symbol and word synchronization are achieved without requiring that any additional symbols be transmitted. An important parameter which determines the performance of the word sync procedure is the ratio of the decoding failure probability to the undetected error probability. Ideally, the former should be as small as possible compared to the latter when the error correcting capability of the code is exceeded. A computer simulation of a (255,223) Reed-Solomon code as carried out. Results for decoding failure probability and for undetected error probability are tabulated and compared.

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

Decoding: Software implementations

The motivation to use phase coded observations for the stratosphere-troposphere region is discussed. Previous work using hardware correlators to decode the received signal is referred. An alternative technique using software to decode the signal samples is described, and results of the implementation are presented.

Loriot, G. B.↗
NASA NTRS1985

Novel applications of the NASA/GSFC Viterbi decoder hardware simulator

The NASA/GSFC developed an all digital, real time, programmable Viterbi decoder simulator operating at rates up to 6 Msps. With this simulator, the bit error rate (BER) performance of convolutionally encoded/Viterbi decoded Shuttle-TDRSS return link channels under pulsed radio frequency interference (RFI) conditions has been predicted. The principles of the simulator are described with special emphasis on the channel simulator and the essential interaction between CLASS software and the simulator. The sensitivity of coded BER as function of several illustrative RFI parameters is discussed for two typical Shuttle-TDRSS return link configurations.

Walvis, D. J. M.↗
NASA NTRS1983

Self-synchronizing outer codes for the TDRSS decoder

In this paper, various aspects of developing a self-synchronizing coding system are discussed for NASA's TDRSS satellite system. The coding system used is a concatenation of a (2, 1, 7) inner convolutional code with a (255,223) Reed-Solomon outer code. The goal is to design the decoder in such a way that both symbol and word synchronization are achieved for the outer code without the need for any separate synchronization patten. The system proposed in this paper uses the properties of the inner (Viterbi) decoder to provide symbol synchronization for the outer code, and maintains word synchronization by making use of a coset code of the Reed-Solomon code.

Lin, S.↗
NASA NTRS1986

Simplified Decoding of Convolutional Codes

Some complicated intermediate steps shortened or eliminated. Decoding of convolutional error-correcting digital codes simplified by new errortrellis syndrome technique. In new technique, syndrome vector not computed. Instead, advantage taken of newly-derived mathematical identities simplify decision tree, folding it back on itself into form called "error trellis." This trellis graph of all path solutions of syndrome equations. Each path through trellis corresponds to specific set of decisions as to received digits. Existing decoding algorithms combined with new mathematical identities reduce number of combinations of errors considered and enable computation of correction vector directly from data and check bits as received.

Truong, T. K.↗
NASA NTRS1985

Decoding convolutionally encoded images

Maximum Likelihood Convolutional Decoding, which is used by the Deep Space Network for short constraint-length convolutional codes, assumes that all strings of information bits are equally likely. In some cases, like image data, this is not the case. The use of information about an adjacent pixel in decoding convolutionally encoded Voyager images is examined. It is discovered that, in a region of interest, as much as 2 dB may be gained.

Pitt, G. H., III↗
NASA NTRS1987

Image statistics decoding for convolutional codes

It is a fact that adjacent pixels in a Voyager image are very similar in grey level. This fact can be used in conjunction with the Maximum-Likelihood Convolutional Decoder (MCD) to decrease the error rate when decoding a picture from Voyager. Implementing this idea would require no changes in the Voyager spacecraft and could be used as a backup to the current system without too much expenditure, so the feasibility of it and the possible gains for Voyager were investigated. Simulations have shown that the gain could be as much as 2 dB at certain error rates, and experiments with real data inspired new ideas on ways to get the most information possible out of the received symbol stream.

Pitt, G. H., III↗
NASA NTRS1988

Single-Chip VLSI Reed-Solomon Decoder

Efficient utilization of computing elements reduces size while preserving throughput. VLSI architecture is pipeline Reed-Solomon decoder for correction of errors and erasures. Uses transform circuit to compute syndrome polynomial. Erasure information enters decoder as binary sequence. Applied to variety of digital communications involving error-correcting RS codes.

Shao, Howard M.↗