Search NASA⌕ Search

SEARCH · Search NASA

Results for “Trellis Coding”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Error control techniques for satellite and space communications

An expurgated upper bound on the event error probability of trellis coded modulation is presented. This bound is used to derive a lower bound on the minimum achievable free Euclidean distance d sub (free) of trellis codes. It is shown that the dominant parameters for both bounds, the expurgated error exponent and the asymptotic d sub (free) growth rate, respectively, can be obtained from the cutoff-rate R sub O of the transmission channel by a simple geometric construction, making R sub O the central parameter for finding good trellis codes. Several constellations are optimized with respect to the bounds.

Costello, Daniel J., Jr.↗
NASA NTRS1991

Flexible digital modulation and coding synthesis for satellite communications

An architecture and a hardware prototype of a flexible trellis modem/codec (FTMC) transmitter are presented. The theory of operation is built upon a pragmatic approach to trellis-coded modulation that emphasizes power and spectral efficiency. The system incorporates programmable modulation formats, variations of trellis-coding, digital baseband pulse-shaping, and digital channel precompensation. The modulation formats examined include (uncoded and coded) binary phase shift keying (BPSK), quatenary phase shift keying (QPSK), octal phase shift keying (8PSK), 16-ary quadrature amplitude modulation (16-QAM), and quadrature quadrature phase shift keying (Q squared PSK) at programmable rates up to 20 megabits per second (Mbps). The FTMC is part of the developing test bed to quantify modulation and coding concepts.

Vanderaar, Mark↗
NASA NTRS1992

Error control techniques for satellite and space communications

Worked performed during the reporting period is summarized. Construction of robustly good trellis codes for use with sequential decoding was developed. The robustly good trellis codes provide a much better trade off between free distance and distance profile. The unequal error protection capabilities of convolutional codes was studied. The problem of finding good large constraint length, low rate convolutional codes for deep space applications is investigated. A formula for computing the free distance of 1/n convolutional codes was discovered. Double memory (DM) codes, codes with two memory units per unit bit position, were studied; a search for optimal DM codes is being conducted. An algorithm for constructing convolutional codes from a given quasi-cyclic code was developed. Papers based on the above work are included in the appendix.

Costello, Daniel J., Jr.↗
NASA NTRS1990

On complexity of trellis structure of linear block codes

The trellis structure of linear block codes (LBCs) is discussed. The state and branch complexities of a trellis diagram (TD) for a LBC is investigated. The TD with the minimum number of states is said to be minimal. The branch complexity of a minimal TD for a LBC is expressed in terms of the dimensions of specific subcodes of the given code. Then upper and lower bounds are derived on the number of states of a minimal TD for a LBC, and it is shown that a cyclic (or shortened cyclic) code is the worst in terms of the state complexity among the LBCs of the same length and dimension. Furthermore, it is shown that the structural complexity of a minimal TD for a LBC depends on the order of its bit positions. This fact suggests that an appropriate permutation of the bit positions of a code may result in an equivalent code with a much simpler minimal TD. Boolean polynomial representation of codewords of a LBC is also considered. This representation helps in study of the trellis structure of the code. Boolean polynomial representation of a code is applied to construct its minimal TD. Particularly, the construction of minimal trellises for Reed-Muller codes and the extended and permuted binary primitive BCH codes which contain Reed-Muller as subcodes is emphasized. Finally, the structural complexity of minimal trellises for the extended and permuted, and double-error-correcting BCH codes is analyzed and presented. It is shown that these codes have relatively simple trellis structure and hence can be decoded with the Viterbi decoding algorithm.

Lin, Shu↗
NASA NTRS1996

New Bandwidth Efficient Parallel Concatenated Coding Schemes

We propose a new solution to parallel concatenation of trellis codes with multilevel amplitude/phase modulations and a suitable iterative decoding structure. Examples are given for throughputs 2 bits/sec/Hz with 8PSK and 16QAM signal constellations.

trellis codes multilevel amplitude modulations dec↗
NASA NTRS1981

Trellis phase codes for power-bandwith efficient satellite communications

Support work on improved power and spectrum utilization on digital satellite channels was performed. Specific attention is given to the class of signalling schemes known as continuous phase modulation (CPM). The specific work described in this report addresses: analytical bounds on error probability for multi-h phase codes, power and bandwidth characterization of 4-ary multi-h codes, and initial results of channel simulation to assess the impact of band limiting filters and nonlinear amplifiers on CPM performance.

Wilson, S. G.↗
NASA NTRS1992

A co-designed equalization, modulation, and coding scheme

The commercial impact and technical success of Trellis Coded Modulation seems to illustrate that, if Shannon's capacity is going to be neared, the modulation and coding of an analogue signal ought to be viewed as an integrated process. More recent work has focused on going beyond the gains obtained for Average White Gaussian Noise and has tried to combine the coding/modulation with adaptive equalization. The motive is to gain similar advances on less perfect or idealized channels.

Peile, Robert E.↗
NASA NTRS1987

Error control techniques for satellite and space communications

During the period June 1, 1986 through November 30, 1986, progress was made in the following areas: undetected error probability and throughput analysis of a concatenated coding scheme; capacity and cutoff rate analysis of concatenated codes; concatenated codes using bandwidth efficient trellis inner codes; bounds on the minimum free Euclidean distance of bandwidth efficient trellis codes; and construction of multidimensional bandwidth efficient trellis codes for use as inner codes in a concatenated coding system.

Costello, Daniel J., Jr.↗
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 NTRS1987

Error control techniques for satellite and space communications

The performance of bandwidth efficient trellis inner codes using two-dimensional MPSK signal constellations in a NASA concatenated coding is summarized. Work was also continued on trellis coded modulation using multi-dimensional signal sets. Achievable lower bounds on free distance trellis codes were proved and the existence of good trellis coded modulation (TCM) schemes were established for a variety of signal constellations. The performance of TCM schemes on fading channels is being investigated. Preliminary results indicate that bandwidth efficient trellis coding is feasible on such channels, but that the important design parameter is no longer the minimum free Euclidean distance.

Costello, Daniel J., Jr.↗
NASA NTRS1972

On the structure of rate 1/n convolutional codes.

It is shown what choice there is in assigning output digits to transitions of binary rate 1/n code trellis so that the latter will correspond to a convolutional code. A new upper bound on free distance of rate 1/n convolutional codes is also derived, and the results obtained are used to determine the length of the largest input sequence that can conceivably result in an output whose weight is equal to the free distance of a code of rate 1/2.

Bahl, L.↗
NASA NTRS1990

Modulation and coding for satellite and space communications

Several modulation and coding advances supported by NASA are summarized. To support long-constraint-length convolutional code, a VLSI maximum-likelihood decoder, utilizing parallel processing techniques, which is being developed to decode convolutional codes of constraint length 15 and a code rate as low as 1/6 is discussed. A VLSI high-speed 8-b Reed-Solomon decoder which is being developed for advanced tracking and data relay satellite (ATDRS) applications is discussed. A 300-Mb/s modem with continuous phase modulation (CPM) and codings which is being developed for ATDRS is discussed. Trellis-coded modulation (TCM) techniques are discussed for satellite-based mobile communication applications.

Yuen, Joseph H.↗
NASA NTRS1988

Error control techniques for satellite and space communications

Progress made in the following areas is discussed: concatenated codes using bandwidth efficient Trellis inner codes; bounds on the minimum free Euclidean distance of bandwidth efficient Trellis inner codes; performance analysis of bandwidth Trellis codes on channels with phase jitter; construction of bandwidth efficient Trellis codes; and parity retransmission hybrid ARQ using convolutional codes.

Costello, Daniel J., Jr.↗
NASA NTRS1986

Error control techniques for satellite and space communications

High rate concatenated coding systems with trellis inner codes and Reed-Solomon (RS) outer codes for application in satellite communication systems are considered. Two types of inner codes are studied: high rate punctured binary convolutional codes which result in overall effective information rates between 1/2 and 1 bit per channel use; and bandwidth efficient signal space trellis codes which can achieve overall effective information rates greater than 1 bit per channel use. Channel capacity calculations with and without side information performed for the concatenated coding system. Concatenated coding schemes are investigated. In Scheme 1, the inner code is decoded with the Viterbi algorithm and the outer RS code performs error-correction only (decoding without side information). In scheme 2, the inner code is decoded with a modified Viterbi algorithm which produces reliability information along with the decoded output. In this algorithm, path metrics are used to estimate the entire information sequence, while branch metrics are used to provide the reliability information on the decoded sequence. This information is used to erase unreliable bits in the decoded output. An errors-and-erasures RS decoder is then used for the outer code. These two schemes are proposed for use on NASA satellite channels. Results indicate that high system reliability can be achieved with little or no bandwidth expansion.

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

Bandwidth efficient coding for satellite communications

An error control coding scheme was devised to achieve large coding gain and high reliability by using coded modulation with reduced decoding complexity. To achieve a 3 to 5 dB coding gain and moderate reliability, the decoding complexity is quite modest. In fact, to achieve a 3 dB coding gain, the decoding complexity is quite simple, no matter whether trellis coded modulation or block coded modulation is used. However, to achieve coding gains exceeding 5 dB, the decoding complexity increases drastically, and the implementation of the decoder becomes very expensive and unpractical. The use is proposed of coded modulation in conjunction with concatenated (or cascaded) coding. A good short bandwidth efficient modulation code is used as the inner code and relatively powerful Reed-Solomon code is used as the outer code. With properly chosen inner and outer codes, a concatenated coded modulation scheme not only can achieve large coding gains and high reliability with good bandwidth efficiency but also can be practically implemented. This combination of coded modulation and concatenated coding really offers a way of achieving the best of three worlds, reliability and coding gain, bandwidth efficiency, and decoding complexity.

Lin, Shu↗
NASA NTRS1987

Error control coding for satellite and space communications

The optical direct detection channel is discussed. It is shown how simple trellis coded modulation can be used to improve performance or increase throughput (in bits per second) without a bandwidth expansion and no performance loss. In fact, a modest performance gain can be achieved. The concentration is on signals derived from the pulse-position modulation format by allowing overlap.

Georghiades, Costas N.↗