Maximum-likelihood data decoder
Digital convolutional decoder circuit for data communication receiver employs Viterbi decoding algorithm to quickly and efficiently decode data on basis of "maximum likelihood" computations.
Alberda, M. E.↗
SEARCH · Search NASA
Results for “Viterbi”
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.
Coding for spread spectrum packet radios
Packet radios are often expected to operate in a radio communication network environment where there tends to be man made interference signals. To combat such interference, spread spectrum waveforms are being considered for some applications. The use of convolutional coding with Viterbi decoding to further improve the performance of spread spectrum packet radios is examined. At 0.00001 bit error rates, improvements in performance of 4 db to 5 db can easily be achieved with such coding without any change in data rate nor spread spectrum bandwidth. This coding gain is more dramatic in an interference environment.
Omura, J. K.↗
Capacity, cutoff rate, and coding for a direct-detection optical channel
It is shown that Pierce's pulse position modulation scheme with 2 to the L pulse positions used on a self-noise-limited direct detection optical communication channel results in a 2 to the L-ary erasure channel that is equivalent to the parallel combination of L completely correlated binary erasure channels. The capacity of the full channel is the sum of the capacities of the component channels, but the cutoff rate of the full channel is shown to be much smaller than the sum of the cutoff rates. An interpretation of the cutoff rate is given that suggests a complexity advantage in coding separately on the component channels. It is shown that if short-constraint-length convolutional codes with Viterbi decoders are used on the component channels, then the performance and complexity compare favorably with the Reed-Solomon coding system proposed by McEliece for the full channel. The reasons for this unexpectedly fine performance by the convolutional code system are explored in detail, as are various facets of the channel structure.
Massey, J. L.↗
New results on antenna arraying, part 1
Baseband combining with and without combined carrier referencing for antenna arrays are compared under two scenarios for the Voyager 2 Uranus encounter. The combined carrier reference scheme is estimated to outperform the baseband only scheme by less than 0.3 dB E (sub b)/N (sub 0) at a bit error probability of 0.005. These results were attained both with mathematical modeling and software Viterbi decoder simulations.
Deutsch, L. J.↗
The impact of pulsed RFI on the coded BER performance of the nonlinear satellite communication channel
Communication links from low orbiting spacecraft to a central ground station, via satellite repeater, may be susceptible to significant performance degradation if high-level, pulsed radio frequency interference (RFI) must be contended with. The present paper examines the coded bit error rate (BER) performance of a communication system in which BPSK modulation is employed, pulsed CW or pulsed noise RFI is present, and the transponder contains a nonlinearity characterized by arbitrary AM/AM and AM/PM characteristics. A major result of this paper is an analytic method for determining soft decision statistics of the receiver demodulator output, in which pulsed RFI effects are accounted for. It is demonstrated that this result can be analytically applied to the approximate determination of the BER at the output of a Viterbi decoder, when convolutional coding is employed.
Weinberg, A.↗
Modulation/demodulation techniques for satellite communications. Part 4: Appendices
The use of the Viterbi algorithm in a general context is examined. The generalized transfer function bounds are given which permit the following applications to be carried out: maximum likelihood demodulation of such bandwidth modulations as minimum-shift-keying and continuous phase frequency-shift-keying, demodulation of intersymbol interference and partial response signals, estimation and smoothing, and simultaneous phase synchronization, and data detection. Sufficient conditions are reviewed for tightening Chernoff and Rhattacharyya bounds.
Omura, J. K.↗
Capacity, cutoff rate, and coding for a direct-detection optical channel
It is shown that when Pierce's pulse-position modulation scheme with 2 to the L power positions (where L is some positive integer) is used on a self-noise-limited direct-detection optical communication channel, there results a (2 to the L power)-ary erasure channel that is equivalent to the parallel combination of L completely correlated binary erasure channels. The capacity of the full channel is the sum of the capacities of the component channels, but the cutoff rate of the full channel is shown to be much smaller than the sum of the cutoff rates. An interpretation of the cutoff rate is given that suggests a complexity advantage in coding separately on the component channels. It is shown that if short-constraint length convolutional codes with Viterbi decoders are used on the component channels, then the performance and complexity compare favorably with the Reed-Solomon coding system proposed by McEliece (1979) for the full channel. The reasons for this unexpectedly fine performance by the convolutional code system are explored in detail, as are various facets of the channel structure.
Massey, J. L.↗
Simplified Syndrome Decoding of (n, 1) Convolutional Codes
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 is presented. The new algorithm uses the general solution of the polynomial linear Diophantine equation for the error polynomial vector E(D). This set of Diophantine solutions is a coset of the CC space. A recursive or Viterbi-like algorithm is developed to find the minimum weight error vector cirumflex E(D) in this error coset. An example illustrating the new decoding algorithm is given for the binary nonsymmetric (2,1)CC.
I. S. Reed↗
New Syndrome Decoding Techniques for the (n, K) Convolutional Codes
This paper presents a new syndrome decoding algorithm for the (n,k) convolutional codes (CC) which differs completely from an earlier syndrome decoding algorithm of Schalkwijk and Vinck. The new algorithm is based on the general solution of the syndrome equation, a linear Diophantine equation for the error polynomial vector E(D). The set of Diophantine solutions is a coset of the CC. In this error coset a recursive, Viterbi-like algorithm is developed to find the minimum weight error vector (circumflex)E(D). An example, illustrating the new decoding algorithm, is given for the binary nonsystemmatic (3,1)CC.
Reed, I. S.↗
Mitigation of pulsed RFI via automatic gain control
Three automatic gain control (AGC) strategies and their potential capabilities for mitigation of pulsed radio frequency interference (RFI) over a coded, nonlinear channel are examined. The first updates the AGC control voltage once each symbol interval in accordance with a prespecified criterion. The second implementation is designed to first detect high level RFI and then appropriately update its gain. The final implementation is a wideband device which updates its gain once each symbol interval by reducing the gain in direct proportion to a suitable power measurement. Computed results treat pulsed noise and pulsed CW RFI and compare performances in terms of bit error rate (BER) at the output of a Viterbi decoder.
Chang, R. W.-S.↗
The impact of mismatch on the performance of coded narrow-band FM with limiter/discriminator detection
An examination of the impact of mismatch on the performance of convolutionally encoded/Viterbi decoded narrow-band FM with limiter/discriminator detection is presented. Attention was given to the potential gain available by the combination of this type of system in terms of hard and soft decision decoding. Soft decision decoding was demonstrated to offer only approximately 0.3 dB better performance than hard decision coding. It was also shown, through a technique involving the number of clicks occurring in each detection interval, that both soft and hard decision decoding bit error probability performance could be improved. It is concluded that the mismatch between the coding channel and the decoding metric of the Viterbi algorithm is responsible for reducing the difference between hard and soft decoding metrics.
Simon, M. K.↗
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.↗
Symbol synchronization for the TDRSS decoder
Each 8 bits out of the Viterbi decoder correspond to one symbol of the R/S code. Synchronization must be maintained here so that each 8-bit symbol delivered to the R/S decoder corresponds to an 8-bit symbol from the R/S encoder. Lack of synchronization, would cause an error in almost every R/S symbol since even a - 1-bit sync slip shifts every bit in each 8-bit symbol by one position, therby confusing the mapping betweeen 8-bit sequences and symbols. The error correcting capability of the R/S code would be exceeded. Possible ways to correcting this condition include: (1) designing the R/S decoder to recognize the overload and shifting the output sequence of the inner decoder to establish a different sync state; (2) using the characteristics of the inner decoder to establish symbol synchronization for the outer code, with or without a deinterleaver and an interleaver; and (3) modifying the encoder to alternate periodically between two sets of generators.
Costello, D. J., Jr.↗
Study of a Tracking and Data Acquisition System (TDAS) in the 1990's
Progress in concept definition studies, operational assessments, and technology demonstrations for the Tracking and Data Acquisition System (TDAS) is reported. The proposed TDAS will be the follow-on to the Tracking and Data Relay Satellite System and will function as a key element of the NASA End-to-End Data System, providing the tracking and data acquisition interface between user accessible data ports on Earth and the user's spaceborne equipment. Technical activities of the "spacecraft data system architecture' task and the "communication mission model' task are emphasized. The objective of the first task is to provide technology forecasts for sensor data handling, navigation and communication systems, and estimate corresponding costs. The second task is concerned with developing a parametric description of the required communication channels. Other tasks with significant activity include the "frequency plan and radio interference model' and the "Viterbi decoder/simulator study'.
Source record↗
Transfer Function Bounds for Partial-unit-memory Convolutional Codes Based on Reduced State Diagram
The performance of a coding system consisting of a convolutional encoder and a Viterbi decoder is analytically found by the well-known transfer function bounding technique. For the partial-unit-memory byte-oriented convolutional encoder with m sub 0 binary memory cells and (k sub 0 m sub 0) inputs, a state diagram of 2(K) (sub 0) was for the transfer function bound. A reduced state diagram of (2 (m sub 0) +1) is used for easy evaluation of transfer function bounds for partial-unit-memory codes.
Lee, P. J.↗
Effects of NRZ-M Modulation on Convolutional Codes Performance
Non-return-to-zero mark (NRZ-M) modulation is often used to resolve data sense in suppressed carrier telemetry systems because such systems are subject to half cycle slips that result in complementing the encoded data stream. The performance of coded telemetry systems with NRZ-M is sensitive to the order in which the various operations are done. A system that demodulates the NRZ-M waveform and then decodes performs differently from a system that does the decoding first. The performance of the NASA standard (7, 1/2) convolutional codes is determined for several systems using NRZ-M. Several different demodulation schemes for NRZ-M are considered. It is shown that, even for the best soft-decision method examined, there is a 2.7 dB loss at a decoded bit error rate of 0.005 if the NRZ-M demodulation occurs before rather than after Viterbi decoding.
Deutsch, L. J.↗
New syndrome decoding techniques for the (n, k) convolutional codes
This paper presents a new syndrome decoding algorithm for the (n, k) convolutional codes (CC) which differs completely from an earlier syndrome decoding algorithm of Schalkwijk and Vinck. The new algorithm is based on the general solution of the syndrome equation, a linear Diophantine equation for the error polynomial vector E(D). The set of Diophantine solutions is a coset of the CC. In this error coset a recursive, Viterbi-like algorithm is developed to find the minimum weight error vector (circumflex)E(D). An example, illustrating the new decoding algorithm, is given for the binary nonsystemmatic (3, 1)CC. Previously announced in STAR as N83-34964
Reed, I. S.↗
Mission science value-cost savings from the Advanced Imaging Communication System (AICS)
An Advanced Imaging Communication System (AICS) was proposed in the mid-1970s as an alternative to the Voyager data/communication system architecture. The AICS achieved virtually error free communication with little loss in the downlink data rate by concatenating a powerful Reed-Solomon block code with the Voyager convolutionally coded, Viterbi decoded downlink channel. The clean channel allowed AICS sophisticated adaptive data compression techniques. Both Voyager and the Galileo mission have implemented AICS components, and the concatenated channel itself is heading for international standardization. An analysis that assigns a dollar value/cost savings to AICS mission performance gains is presented. A conservative value or savings of $3 million for Voyager, $4.5 million for Galileo, and as much as $7 to 9.5 million per mission for future projects such as the proposed Mariner Mar 2 series is shown.
Rice, R. F.↗