Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “trellis”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

Serial-Turbo-Trellis-Coded Modulation with Rate-1 Inner Code

Serially concatenated turbo codes have been proposed to satisfy requirements for low bit- and word-error rates and for low (in comparison with related previous codes) complexity of coding and decoding algorithms and thus low complexity of coding and decoding circuitry. These codes are applicable to such high-level modulations as octonary phase-shift keying (8PSK) and 16-state quadrature amplitude modulation (16QAM); the signal product obtained by applying one of these codes to one of these modulations is denoted, generally, as serially concatenated trellis-coded modulation (SCTCM). These codes could be particularly beneficial for communication systems that must be designed and operated subject to limitations on bandwidth and power. Some background information is prerequisite to a meaningful summary of this development. Trellis-coded modulation (TCM) is now a well-established technique in digital communications. A turbo code combines binary component codes (which typically include trellis codes) with interleaving. A turbo code of the type that has been studied prior to this development is composed of parallel concatenated convolutional codes (PCCCs) implemented by two or more constituent systematic encoders joined through one or more interleavers. The input information bits feed the first encoder and, after having been scrambled by the interleaver, enter the second encoder. A code word of a parallel concatenated code consists of the input bits to the first encoder followed by the parity check bits of both encoders. The suboptimal iterative decoding structure for such a code is modular, and consists of a set of concatenated decoding modules one for each constituent code connected through an interleaver identical to the one in the encoder side. Each decoder performs weighted soft decoding of the input sequence. PCCCs yield very large coding gains at the cost of a reduction in the data rate and/or an increase in bandwidth.

Divsalar, Dariush↗
NASA NTRS1994

Trellis Coding of Non-coherent Multiple Symbol Full Response M-ary CPFSK with Modulation Index 1/M

This paper introduces a trellis coded modulation (TCM) scheme for non-coherent multiple full response M-ary CPFSK with modulation index 1/M. A proper branch metric for the trellis decoder is obtained by employing a simple approximation of the modified Bessel function for large signal to noise ratio (SNR). Pairwise error probability of coded sequences is evaluated by applying a linear approximation to the Rician random variable.

trellis coded modulation TCM↗
NASA NTRS1980

Joint map data/phase sequence estimation for trellis phase codes

A unified estimation procedure is formulated for the coherent detection of trellis phase codes, including partial response FM codes and multi-h codes. The unknown carrier phase is imbedded in the system state vector, and by simple augmentation of the decoder's state space, joint data and carrier estimation may be accomplished. The procedure is general to all trellis phase codes analyzed thus far. The effect of a static phase error on detection performance is also treated.

Wilson, S. G.↗
NASA NTRS1984

Error-trellis Syndrome Decoding Techniques for Convolutional Codes

An error-trellis syndrome decoding technique for convolutional codes is developed. This algorithm is then applied to the entire class of systematic convolutional codes and to the high-rate, Wyner-Ash convolutional codes. A special example of the one-error-correcting Wyner-Ash code, a rate 3/4 code, is treated. The error-trellis syndrome decoding method applied to this example shows in detail how much more efficient syndrome decoding is than Viterbi decoding if applied to the same problem. For standard Viterbi decoding, 64 states are required, whereas in the example only 7 states are needed. Also, within the 7 states required for decoding, many fewer transitions are needed between the states.

Reed, I. S.↗
NASA NTRS1985

Error-trellis syndrome decoding techniques for convolutional codes

An error-trellis syndrome decoding technique for convolutional codes is developed. This algorithm is then applied to the entire class of systematic convolutional codes and to the high-rate, Wyner-Ash convolutional codes. A special example of the one-error-correcting Wyner-Ash code, a rate 3/4 code, is treated. The error-trellis syndrome decoding method applied to this example shows in detail how much more efficient syndrome decordig is than Viterbi decoding if applied to the same problem. For standard Viterbi decoding, 64 states are required, whereas in the example only 7 states are needed. Also, within the 7 states required for decoding, many fewer transitions are needed between the states.

Reed, I. S.↗
NASA NTRS1985

16-QAM and trellis-coded 16-QAM on nonlinear channels

The use of 16-QAM on bandlimited nonlinear satellite channels, in uncoded and trellis-coded form, for bandwidth efficient modulation (ideally 4 bps/Hz) is discussed. To avoid severe degradation due to AM/AM and AM/PM distortion, or to avoid the need for large back-off, predistorting the 16-QAM constellation at the modulator is considered. Performance for varying back-off settings for uncoded and coded 16-QAM is simulated, and it is found that the four-state trellis code has a coding gain of about 8 dB, larger than expected based on linear channel analysis, while the 16-state code gains only marginally beyond this.

Lyons, M. T.↗
NASA NTRS1988

Trellis-coded MPSK modulation techniques for MSAT-X(sup)1

Various trellis-coded modulated phase shift keying (MPSK) modulation techniques for transmitting 4.8 kbps over a 5 kHz RF channel are considered. The tradeoffs between coherent versus differentially coherent types of demodulation, and interleaving are discussed as well as optimum trellis-codes designed for fading channels. Simulation results are presented.

Divsalar, Dariush↗
NASA NTRS1988

Bandwidth-efficient high-speed coded trellis modulation

A burst-mode coded trellis modulation system is discussed which is capable of 200-Mbit/s information rate transmission over nonlinear satellite transponders whose center frequencies are separated by 100 MHz. An overall real bandwidth efficiency of 2 bit/s per Hz of the allocated spectrum is projected. Convolutional codec and 8-PSK modulation subsystems together maximize the minimum Euclidean distance between the modulated codeword sequences in the overall coded trellis, resulting in a 4.3-dB asymptotic coding advantage over an uncoded 8-PSK system signalling at the same information rate over the same channel. The system performance has been evaluated by computer simulation.

Fang, R. J. F.↗
NASA NTRS1989

Design Of Trellis Codes For Fading Channels

Report develops theoretical basis for design of trellis codes that perform optimally when used in multiple trellis-coded modulation on Rician fading communication channels. Codes perform better than codes designed to be optimal on nonfading channels with only additive white Gaussian noise (AWGN). Design of improved codes based on new distance measure suitable for fading channels. ("Distance" denotes measure of separation in abstract space in theory of codes rather than in ordinary three-dimensional space.)

Simon, Marvin K.↗
NASA NTRS1990

New 16-PSK trellis codes for fading channels

Growth in satellite mobile communications leads to increasing requirements for high data rate transmission that can be met by more efficient modulation schemes (M greater than 8). The 16-PSK trellis coded modulation technique is a very promising solution. A class of new 16-PSK trellis codes with improved error rate are designed based on the criteria on fading channels.

Du, Jun↗
NASA NTRS1993

On the performance of Trellis coded modulation with octal phase shift keying over the TDRSS channel

As the National Aeronautics and Space Administration moves into the 21st century with programs like Space Station Freedom, a manned mission to Mars, and the new Landsat mission, transmission demands on the Tracking and Data Relay Satellite System (TDRSS) will very likely exceed the available bandwidth. The Manual Lujan, Jr. Center for Space Telemetering and Telecommunications Systems (CSTTS) at New Mexico State University (NMSU) is studying techniques for increasing the data rate capabilities of TDRSS. These techniques include the use of advanced bandwidth efficient modulation formats to increase the data rate that can be sustained in a TDRSS transponder and the use of lossless bandwidth compression of the data to be transmitted to lower the data rate required from the user spacecraft. Based upon current technology the most promising bandwidth efficient modulation technique is Trellis Coded Modulation (TCM) operating with Octal Phase shift Keying (8PSK). Trellis Coded Modulation coding with 8PSK carrier modulation has the capability to increase the data rate which can be transmitted through the TDRSS spacecraft by a factor of 2 to 2.5 times that available with todays coded QPSK systems with only a small penalty in link performance relative to the existing systems. However, before NASA can safely employ TCM coding it is necessary to prove that this complex format can perform on the real TDRSS link as it does in labs and simulation studies. This proof-of-concept test over a live satellite channel was the objective of the construction and testing performed under this task of the NMSU NASA grant referenced above. In conjunction with NASA, NMSU's CSTTS has constructed a system to test a new candidate TDRSS modulation scheme, TCM 8PSK, that can enhance the information throughput of the TDRSS spacecraft. The test system for this project which was constructed over a period of 18 months by NMSU consisted of two racks of commercial and univeristy-designed and -built equipment. This project has included modifications of an existing White Sands Ground Terminal (WSGT) High Rate QPSK Demodulator to demodulate 8PSK as well as the construction of other support hardware. Also, two TCM codecs (coder/decoders) have been constructed to implement two levels of bandwidth efficiency. One was designed and built by the research team at NMSU while the other was created by the University of Notre Dame with the University of South Australia. The NMSU codec achieves a 2-to-1 increase in data rate per unit bandwidth with a coding gain relative to QPSK of about 3dB. The Notre Dame/South Australia codec achieves a 2.5-to-1 increase in data rate per unit of occupied bandwidth and a coding gain of about 2dB.

Osborne, William P.↗
NASA NTRS1999

Map Algorithms for Decoding Linear Block codes Based on Sectionalized Trellis Diagrams

The MAP algorithm is a trellis-based maximum a posteriori probability decoding algorithm. It is the heart of the turbo (or iterative) decoding which achieves an error performance near the Shannon limit. Unfortunately, the implementation of this algorithm requires large computation and storage. Furthermore, its forward and backward recursions result in long decoding delay. For practical applications, this decoding algorithm must be simplified and its decoding complexity and delay must be reduced. In this paper, the MAP algorithm and its variations, such as Log-MAP and Max-Log-MAP algorithms, are first applied to sectionalized trellises for linear block codes and carried out as two-stage decodings. Using the structural properties of properly sectionalized trellises, the decoding complexity and delay of the MAP algorithms can be reduced. Computation-wise optimum sectionalizations of a trellis for MAP algorithms are investigated. Also presented in this paper are bi-directional and parallel MAP decodings.

Lin, Shu↗
NASA NTRS2000

MAP Algorithms for Decoding Linear Block Codes Based on Sectionalized Trellis Diagrams

The maximum a posteriori probability (MAP) algorithm is a trellis-based MAP decoding algorithm. It is the heart of turbo (or iterative) decoding that achieves an error performance near the Shannon limit. Unfortunately, the implementation of this algorithm requires large computation and storage. Furthermore, its forward and backward recursions result in long decoding delay. For practical applications, this decoding algorithm must be simplified and its decoding complexity and delay must be reduced. In this paper, the MAP algorithm and its variations, such as log-MAP and max-log-MAP algorithms, are first applied to sectionalized trellises for linear block codes and carried out as two-stage decodings. Using the structural properties of properly sectionalized trellises, the decoding complexity and delay of the MAP algorithms can be reduced. Computation-wise optimum sectionalizations of a trellis for MAP algorithms are investigated. Also presented in this paper are bidirectional and parallel MAP decodings.

Lui, Ye↗
NASA NTRS1990

Multiple trellis coded modulation

A technique for designing trellis codes to minimize bit error performance for a fading channel. The invention provides a criteria which may be used in the design of such codes which is significantly different from that used for average white Gaussian noise channels. The method of multiple trellis coded modulation of the present invention comprises the steps of: (a) coding b bits of input data into s intermediate outputs; (b) grouping said s intermediate outputs into k groups of s.sub.i intermediate outputs each where the summation of all s.sub.i,s is equal to s and k is equal to at least 2; (c) mapping each of said k groups of intermediate outputs into one of a plurality of symbols in accordance with a plurality of modulation schemes, one for each group such that the first group is mapped in accordance with a first modulation scheme and the second group is mapped in accordance with a second modulation scheme; and (d) outputting each of said symbols to provide k output symbols for each b bits of input data.

Simon, Marvin K.↗
NASA NTRS2010

Serial turbo trellis coded modulation using a serially concatenated coder

Serial concatenated trellis coded modulation (SCTCM) includes an outer coder, an interleaver, a recursive inner coder and a mapping element. The outer coder receives data to be coded and produces outer coded data. The interleaver permutes the outer coded data to produce interleaved data. The recursive inner coder codes the interleaved data to produce inner coded data. The mapping element maps the inner coded data to a symbol. The recursive inner coder has a structure which facilitates iterative decoding of the symbols at a decoder system. The recursive inner coder and the mapping element are selected to maximize the effective free Euclidean distance of a trellis coded modulator formed from the recursive inner coder and the mapping element. The decoder system includes a demodulation unit, an inner SISO (soft-input soft-output) decoder, a deinterleaver, an outer SISO decoder, and an interleaver.

Divsalar, Dariush↗
NASA NTRS2011

Serial turbo trellis coded modulation using a serially concatenated coder

Serial concatenated trellis coded modulation (SCTCM) includes an outer coder, an interleaver, a recursive inner coder and a mapping element. The outer coder receives data to be coded and produces outer coded data. The interleaver permutes the outer coded data to produce interleaved data. The recursive inner coder codes the interleaved data to produce inner coded data. The mapping element maps the inner coded data to a symbol. The recursive inner coder has a structure which facilitates iterative decoding of the symbols at a decoder system. The recursive inner coder and the mapping element are selected to maximize the effective free Euclidean distance of a trellis coded modulator formed from the recursive inner coder and the mapping element. The decoder system includes a demodulation unit, an inner SISO (soft-input soft-output) decoder, a deinterleaver, an outer SISO decoder, and an interleaver.

Divsalar, Dariush↗