A strong converse to the coding theorem for continuous memoryless channels
Computer programming - strong converse to coding theorem for continuous memoryless channels
SEARCH · Search NASA
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.
Computer programming - strong converse to coding theorem for continuous memoryless channels
Coding systems achieving wideband and narrow band channel capacity for satellite communications - noise channel with feedback
Algebraic and sequential coding-decoding method for data communication rates up to capacity of discrete memoryless channel, discussing error probabilities
It is shown that interleavel binary block codes combined with pulse position modulation give the best practical coded systems yet devised for optical communication with photon detection. Linear block codes rather than convolutional codes are considered.
It has been well established that the appropriate criterion for optimum trellis-coded modulation design on the additive white Gaussian noise channel is maximization of the free Euclidean distance. It is shown that when the trellis-coded modulation is used on a Rician fading channel with interleaving/deinterleaving, the design of the code of optimum performance is guided by other factors, in particular, the length of the shortest error-event path, and the product of branch distances (possibly normalized by the Euclidean distance of the path) along the path. Athough maximum free distance (dfree) is still an important consideration, it plays a less significant role the more severe the fading is on the channel. These considerations lead to the definition of a new distance measure of optimization of trellis codes transmitted over Rician fading channels. If no interleaving/deinterleaving is used, then once again the design of the trellis code is guided by maximizing dfree.
Fixed information bit rate approach to coding over space channel introducing redundancy and check digits for error probability
The performance of convolutional codes in conjunction with noncoherent multiple frequency shift-keyed (MFSK) modulation and Viterbi maximum likelihood decoding on a Rician fading channel is examined in detail. While the primary motivation underlying this work has been concerned with system performance on the planetary entry channel, it is expected that the results are of considerably wider interest. Particular attention is given to modeling the channel in terms of a few meaningful parameters which can be correlated closely with the results of theoretical propagation studies. Fairly general upper bounds on bit error probability performance in the presence of fading are derived and compared with simulation results using both unquantized and quantized receiver outputs. The effects of receiver quantization and channel memory are investigated and it is concluded that the coded noncoherent MFSK system offers an attractive alternative to coherent BPSK in providing reliable low data rate communications in fading channels typical of planetary entry missions.
Basic notions pertinent to code-division multiple-user communication signals are defined in set-theoretic terms. A general treatment of composition codes by identifying a time-frequency spectrogram with a set of points in a finite plane is provided. It is shown that a finite affine plane is a powerful generator of frequency-hopping codes for multiple-access channels, and that it provides optimum performance codes in a noiseless environment.
We investigate methods of coding for a channel subject to a large dead-time constraint, i.e. a constraint on the minimum spacing between transmitted pulses, with the deep-space optical channel as the motivating example.
Error correcting binary block code decoding on Q-ary output channels /weighted erasure decoding/, considering applications
Motivated by a recent paper of Pierce, we consider the problem associated with coding for optical communications systems that use photon-counting techniques. Making certain realistic assumptions, we find that external noise sources are negligible, and that channel capacity (measured in nats per photon) is infinite. However, quantum effects made the design of an efficient system at rates above about 5 nats per photon very difficult.
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.
A trellis coded multilevel differential phase shift keyed mobile communication system. The system of the present invention includes a trellis encoder for translating input signals into trellis codes; a differential encoder for differentially encoding the trellis coded signals; a transmitter for transmitting the differentially encoded trellis coded signals; a receiver for receiving the transmitted signals; a differential demodulator for demodulating the received differentially encoded trellis coded signals; and a trellis decoder for decoding the differentially demodulated signals.
A parity retransmission hybrid automatic repeat request (ARQ) scheme is proposed which uses rate 1/2 convolutional codes and Viterbi decoding. A protocol is described which is capable of achieving higher throughputs than previously proposed parity retransmission schemes. The performance analysis is based on a two-state Markov model of a nonstationary channel. This model constitutes a first approximation to a nonstationary channel. The two-state channel model is used to analyze the throughput and undetected error probability of the protocol presented when the receiver has both an infinite and a finite buffer size. It is shown that the throughput improves as the channel becomes more bursty.
Coding scheme using noiseless feedback link to improve communication over noisy forward link, assuming no bandwidth constraint
In this paper we simulate the performance of these codes over additive white Gaussian noise and Rayleigh fading channels.
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.
Coding scheme using noiseless feedback link to improve communication over noisy forward link, assuming band-limited signals