Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “channel 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 145 records · Page 8

Error-Rate Bounds for Coded PPM on a Poisson Channel

Equations for computing tight bounds on error rates for coded pulse-position modulation (PPM) on a Poisson channel at high signal-to-noise ratio have been derived. These equations and elements of the underlying theory are expected to be especially useful in designing codes for PPM optical communication systems. The equations and the underlying theory apply, more specifically, to a case in which a) At the transmitter, a linear outer code is concatenated with an inner code that includes an accumulator and a bit-to-PPM-symbol mapping (see figure) [this concatenation is known in the art as "accumulate-PPM" (abbreviated "APPM")]; b) The transmitted signal propagates on a memoryless binary-input Poisson channel; and c) At the receiver, near-maximum-likelihood (ML) decoding is effected through an iterative process. Such a coding/modulation/decoding scheme is a variation on the concept of turbo codes, which have complex structures, such that an exact analytical expression for the performance of a particular code is intractable. However, techniques for accurately estimating the performances of turbo codes have been developed. The performance of a typical turbo code includes (1) a "waterfall" region consisting of a steep decrease of error rate with increasing signal-to-noise ratio (SNR) at low to moderate SNR, and (2) an "error floor" region with a less steep decrease of error rate with increasing SNR at moderate to high SNR. The techniques used heretofore for estimating performance in the waterfall region have differed from those used for estimating performance in the error-floor region. For coded PPM, prior to the present derivations, equations for accurate prediction of the performance of coded PPM at high SNR did not exist, so that it was necessary to resort to time-consuming simulations in order to make such predictions. The present derivation makes it unnecessary to perform such time-consuming simulations.

Moision, Bruce↗

Comparing Performance of Coded Communications over Fading Channels between the Lunar South Pole & Earth

In this paper we design and analyze an end-to-endcommunication system between a lander/rover on the surface ofthe lunar South Pole and an Earth station. Various communicationsystems on the lander or rover could be used for the Earthto-Moon communication in both the uplink and downlink direction.To communicate to and from the lander/rover on the lunarSouth Pole, low and/or medium directional antennas onboardthe lander/rover will have to be pointed at low elevation anglesbetween 2 to 10 degrees, thus causing multipath fading effectsdue to reflection of a portion of the transmitted electromagneticwaves from the surface of the Moon. These are not commonlyencountered in traditional deep space communications betweena spacecraft and a ground station.We investigate various design methods and analyze such communicationsystems, in the presence of multipath fading. Wemodel the fading channel based on existing and simulated data.For coherent reception, the acquisition and tracking loop shouldacquire and track incoming carrier phase in presence of Ricianmultipath fading. For this communication system in additionto estimating the received carrier phase, the amplitude of thefading signal should also be estimated, in particular to be used inthe decoder. We consider simple modulation and coding schemesin particular those specified in the CCSDS standards for spaceapplications.After designing various components of the communication system,we use Simulink models to obtain the end-to-end performanceof the communication link under investigation. Basedon the available data, the fading channel can be accuratelymodeled as a Rician fading channel with various Rician parametersdepending on the Earth elevation angle, which alsoaffects the Doppler spread. Therefore, the challenge is todesign a communication system robust in the presence of themultipath fading where the channel conditions change in timeand thus produce fading. In summary, this paper comparespossible communication system designs, performance analysis,and simulations for coded system with/without interleaving withhard/soft decision and with/without channel state information(CSI), over a communication link between a lander/rover at theLunar south pole and a Deep Space Network station in presenceof Rician fading.

Cheung, Kar-Ming↗

Bit error probability calculations for convolutional codes with short constraint lengths on very noisy channels

A technique for estimating convolutional code performance on very noisy channels is considered. Specifically, the performance of short constraint length codes operating near the channel cutoff rate is estimated. Decoding convolutional codes with a sliding window decoder (SWD) are considered. This decoder is an optimal (maximum likelihood) symbol decoder as the window size grows toward infinity, while the Viterbi decoder is the maximum-likelihood sequence estimator. The difference in the decoded BERs (bit error rates) between the two decoders is very small and approaches zero asymptotically as the channel BER decreases. Therefore, an estimate on the decoded BER for the SWD can also be used as an estimate of the decoded BER for Viterbi decoding.

Herro, Mark A.↗

Comparison of convolutional and block code performance on the Rician channel

The paper is concerned with the relative performance of short constraint length convolutional codes vis-a-vis block codes when used in conjunction with either BPSK or DPSK modulation on the classical Rician fading channel. A variety of soft-decision decoding algorithms is considered for block codes while the Viterbi algorithm is used exclusively for decoding convolutional codes. Results indicate a substantial performance/complexity advantage in favor of short constraint length convolutional codes and Viterbi decoding which increases with fading severity. The work reported here extends the well-known performance advantage of convolutional codes on the AWGN channel to representative fading channels.

Mui, S. Y.↗

The performance of trellis coded multilevel DPSK on a fading mobile satellite channel

The performance of trellis coded multilevel differential phase-shift-keying (MDPSK) over Rician and Rayleigh fading channels is discussed. For operation at L-Band, this signalling technique leads to a more robust system than the coherent system with dual pilot tone calibration previously proposed for UHF. The results are obtained using a combination of analysis and simulation. The analysis shows that the design criterion for trellis codes to be operated on fading channels with interleaving/deinterleaving is no longer free Euclidean distance. The correct design criterion for optimizing bit error probability of trellis coded MDPSK over fading channels will be presented along with examples illustrating its application.

Simon, Marvin K.↗

Optimal Codes for the Burst Erasure Channel

Deep space communications over noisy channels lead to certain packets that are not decodable. These packets leave gaps, or bursts of erasures, in the data stream. Burst erasure correcting codes overcome this problem. These are forward erasure correcting codes that allow one to recover the missing gaps of data. Much of the recent work on this topic concentrated on Low-Density Parity-Check (LDPC) codes. These are more complicated to encode and decode than Single Parity Check (SPC) codes or Reed-Solomon (RS) codes, and so far have not been able to achieve the theoretical limit for burst erasure protection. A block interleaved maximum distance separable (MDS) code (e.g., an SPC or RS code) offers near-optimal burst erasure protection, in the sense that no other scheme of equal total transmission length and code rate could improve the guaranteed correctible burst erasure length by more than one symbol. The optimality does not depend on the length of the code, i.e., a short MDS code block interleaved to a given length would perform as well as a longer MDS code interleaved to the same overall length. As a result, this approach offers lower decoding complexity with better burst erasure protection compared to other recent designs for the burst erasure channel (e.g., LDPC codes). A limitation of the design is its lack of robustness to channels that have impairments other than burst erasures (e.g., additive white Gaussian noise), making its application best suited for correcting data erasures in layers above the physical layer. The efficiency of a burst erasure code is the length of its burst erasure correction capability divided by the theoretical upper limit on this length. The inefficiency is one minus the efficiency. The illustration compares the inefficiency of interleaved RS codes to Quasi-Cyclic (QC) LDPC codes, Euclidean Geometry (EG) LDPC codes, extended Irregular Repeat Accumulate (eIRA) codes, array codes, and random LDPC codes previously proposed for burst erasure protection. As can be seen, the simple interleaved RS codes have substantially lower inefficiency over a wide range of transmission lengths.

Hamkins, Jon↗

Rate 3/4 convolutional coding of 16-PSK - Code design and performance study

Convolutional coding coupled with 16-PSK modulation is investigated for bandwidth efficient transmission. Rate 3/4, small memory codes are found which are optimized in the free-distance sense on the Gaussian channel. These codes provide up to 4.8 dB of coding gain with 32 states over uncoded 8-PSK, a scheme having the same spectral efficiency as the codes described. The performance is compared with earlier findings of Ungerboeck and some recent results on R = 2/3 coded 8-PSK. In addition, results of a channel transmission study to assess the performance of the four-state code on the band-limited nonlinear channel are presented, and it is found that performance of the coded scheme degrades comparably with uncoded 8-PSK, i.e., coding gain is roughly preserved.

Wilson, S. G.↗

An iterative algorithm for decoding block codes transmitted over a memoryless channel

An algorithm was developed which optimally decodes a block code for minimum probability of symbol error in an iterative manner. The initial estimate is made by looking at each bit independently and is improved by considering bits related to it through the parity check equations. The dependent bits are considered in order of interesting probability of error. Since the computation proceeds in a systematic way with the bits having the greatest effect being used first, the algorithm approaches the optimum estimate after only a fraction of the parity check equations were used.

Greenberger, H. J.↗

Upper bounds to error probabilities of coded systems over AWGN and fading channels

A family of upper bounds to error probabilities of coded systems on the additive white Gaussian noise channel was recently proposed by Divsalar. Their calculation depends only on the weight spectrum of the code words. We first elaborate upon these bounds to show how they can be further tightened by using numerical integration instead of a Chernoff bound, and by reducing the number of code words to be included in the bound. Next, we extend them to finding channels.

coded systems↗

Multidimensional Trellis Coded Phase Modulation Using a Multilevel Concatenation Approach: Codes for AWGN and Fading Channels - Part 2

In this paper, we will use the construction technique proposed in to construct multidimensional trellis coded modulation (TCM) codes for both the additive white Gaussian noise (AWGN) and the fading channels. Analytical performance bounds and simulation results show that these codes perform very well and achieve significant coding gains over uncoded reference modulation systems. In addition, the proposed technique can be used to construct codes which have a performance/decoding complexity advantage over the codes listed in literature.

Rajpal, Sandeep↗

Performance of Variable Coded Modulations over a Nonlinear Channel for VCM Protocol Red Book

This presentation provides a summary of the results obtained from a study which evaluates the performance of variable coded modulations specified in the "Variable Coded Modulation Protocol" CCSDS Red Book, over a nonlinear channel that is currently on the CCSDS Blue Book track. The objectives are to perform simulation that identifies the operating signal-to-noise-power ratio required to achieve a codeword error rate of 1e-4 over the specified nonlinear channel for various modulations (i.e. BPSK, QPSK, 8-PSK) and LDPC coding schemes, and compare against performance over an ideal additive white Gaussian channel. We select a only subset of operating modes to perform the analysis which are based on a number of mitigation techniques to combat the nonlinear distortions. Specifically, transmitter centroidal pre-distortion, phase post-distortion and receiver mean phase estimation are analyzed in this study.

coding↗

Convolutional code performance in the Rician fading channel

The performance of short constraint length convolutional codes in conjunction with binary phase-shift keyed (BPSK) modulation and Viterbi maximum likelihood decoding on the classical Rician fading channel is examined in detail. Primary interest is in the bit error probability performance as a function of E sub b/N sub 0 parameterized by the fading channel parameters. Fairly general upper bounds on bit error probability performance in the presence of fading are obtained and compared with simulation results in the two extremes of zero channel memory and infinite channel memory. The efficacy of simple block interleaving in combating the memory of the channel is thoroughly explored. Results include the effects of fading on tracking loop performance and the subsequent impact on overall coded system performance. The approach is analytical where possible; otherwise resort is made to digital computer simulation.

Modestino, J. W.↗

Trellis coded modulation for transmission over fading mobile satellite channel

The combination of trellis coding and multiple phase-shift keyed (MPSK) signaling with asymmetry (nonuniform spacing) to the signal set is disclosed with regard to its suitability for a fading mobile satellite communication channel. For MPSK signaling, introducing nonuniformity in the phase spacing between signal points provides an improvement in performance over that achievable with trellis codes symmetric MPSK signaling, all this without increasing the average or peak power, or changing the bandwidth constraints imposed on the system. Block interleaving may be used to reduce error and pilot tone(s) may be used for improving the error correction performance of the trellis decoder in the presence of channel fading.

Simon, Marvin K.↗

The performance of trellis coded multilevel DPSK on a fading mobile satellite channel

The performance of trellis-coded multilevel differential phase-shift-keying (MDPSK) modulation over Rician and Rayleigh fading channels is discussed. For operation at L-band, this signalling technique leads to a more robust system than the coherent system with dual pilot tone calibration previously proposed for UHF. The results are obtained using a combination of analysis and simulation. The analysis shows that the design criterion for trellis codes to be operated on fading channels with interleaving/deinterleaving is no longer free Euclidean distance. The correct design criterion for optimizing bit error probability of trellis coded MDPSD over fading channels is presented along with examples illustrating its application.

Simon, Marvin K.↗