Search

The first part of this paper presents a simple and systematic technique for constructing multidimensional M-ary phase shift keying (MMK) trellis coded modulation (TCM) codes. The construction is based on a multilevel concatenation approach in which binary convolutional codes with good free branch distances are used as the outer codes and block MPSK modulation codes are used as the inner codes (or the signal spaces). Conditions on phase invariance of these codes are derived and a multistage decoding scheme for these codes is proposed. The proposed technique can be used to construct good codes for both the additive white Gaussian noise (AWGN) and fading channels as is shown in the second part of this paper.

This paper documents the laboratory and theoretical performance of a pilot-aided digital radio system. The technique considered transmits a midband pilot tone to improve the receiver data detection performance in a multipath fading channel and is referred to as the tone calibrated technique (TCT). The performance of a 860 MHz prototype system carrying 2.4 kbit/s data under Rician fading conditions is reported. Both experimental and analytical results show that the error floor experienced with nonpilot-aided transmission methods is effectively removed by the TCT scheme, resulting in significant performance gains at high signal-to-noise ratio values. The paper also examines the TCT system performance under typical operating conditions and presents a new analysis of the TCT theoretical error probability.

This paper systematically analyzes the signal-to-noise ratio degradations which can potentially occur due to data asymmetry in digital transmission systems. Suitable asymmetry models are developed and error probability performance for various types of data detectors (integrate-and-dump filter, filter-sample detector, and gated-integrate-and-dump filter) is derived. Although this work was done to resolve problems being encountered in the Shuttle Ku-band return link design, specifically for the 50 Mbit/s convolutionally encoded channel (NRZ format), generalizations are made which provide results for other cases of interest (other Ku-band return link channels, or other systems entirely). This paper therefore considers Manchester data formats (in addition to NRZ) and uncoded transmission (in addition to convolutionally coded transmission). The effects of bandlimiting are also considered.

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.

This paper investigates trellis structures of linear block codes for the integrated circuit (IC) implementation of Viterbi decoders capable of achieving high decoding speed while satisfying a constraint on the structural complexity of the trellis in terms of the maximum number of states at any particular depth. Only uniform sectionalizations of the code trellis diagram are considered. An upper-bound on the number of parallel and structurally identical (or isomorphic) subtrellises in a proper trellis for a code without exceeding the maximum state complexity of the minimal trellis of the code is first derived. Parallel structures of trellises with various section lengths for binary BCH and Reed-Muller (RM) codes of lengths 32 and 64 are analyzed. Next, the complexity of IC implementation of a Viterbi decoder based on an L-section trellis diagram for a code is investigated. A structural property of a Viterbi decoder called add-compare-select (ACS)-connectivity which is related to state connectivity is introduced. This parameter affects the complexity of wire-routing (interconnections within the IC). The effect of five parameters namely: (1) effective computational complexity; (2) complexity of the ACS-circuit; (3) traceback complexity; (4) ACS-connectivity; and (5) branch complexity of a trellis diagram on the very large scale integration (VISI) complexity of a Viterbi decoder is investigated. It is shown that an IC implementation of a Viterbi decoder based on a nonminimal trellis requires less area and is capable of operation at higher speed than one based on the minimal trellis when the commonly used ACS-array architecture is considered.

In this paper, coset codes are considered as terminated convolutional codes. Based on this approach, three new general results are presented. First, it is shown that the iterative squaring construction can equivalently be defined from a convolutional code whose trellis terminates. This convolutional code determines a simple encoder for the coset code considered, and the state and branch labelings of the associated trellis diagram become straightforward. Also, from the generator matrix of the code in its convolutional code form, much information about the trade-off between the state connectivity and complexity at each section, and the parallel structure of the trellis, is directly available. Based on this generator matrix, it is shown that the parallel branches in the trellis diagram of the convolutional code represent the same coset code C(sub 1), of smaller dimension and shorter length. Utilizing this fact, a two-stage optimum trellis decoding method is devised. The first stage decodes C(sub 1), while the second stage decodes the associated convolutional code, using the branch metrics delivered by stage 1. Finally, a bidirectional decoding of each received block starting at both ends is presented. If about the same number of computations is required, this approach remains very attractive from a practical point of view as it roughly doubles the decoding speed. This fact is particularly interesting whenever the second half of the trellis is the mirror image of the first half, since the same decoder can be implemented for both parts.

Four different arraying schemes applicable to deep space communications are discussed and analyzed. These include symbol stream combining (SSC), baseband combining (BC), carrier arraying (CA) and full spectrum combining (FSC). Complexity versus performance is traded off throughout the paper and benefits to the reception of existing spacecraft signals are discussed.

This paper describes the breadboard advanced receiver (ARX) that is currently being built for future use in NASA's deep space network (DSN). This receiver has unique requirements in having to operate with very weak signals from deep space probes and provide high quality telemetry and tracking data. The hybrid analog/digital receiver performs multiple functions including carrier, subcarrier and symbol synchronization. Tracking can be achieved for either residual, suppressed or hybrid carriers and for both sinusoidal and square wave subcarriers. System requirements are specified and a functional description of the ARX is presented. The various digital signal processing algorithms used are also discussed and illustrated with block diagrams. Other functions such as time tagged Doppler extraction and monitor/control are also discussed including acquisition algorithms and lock detection schemes.

The space shuttle orbiter (SSO) and Ku-band single access return (KSAR) link and the Space Station Freedom (SSF) KSAR link via the tracking and data relay satellite system (TDRSS) use the same carrier frequency. The interference between spacecraft is minimized by opposite antenna polarizations and by TDRSS antenna beam pointing, but if the SSF and SSO are in close proximity, it is expected that mutual interference will be significant. Recently, Tsang and Su (1988, 1989) simulated the mutual interference effects, using a practical nonlinear bandlimited channel. The purpose of this paper is to demonstrate that a simplified (i.e., linear band-limited channel) analytical approach will yield adequate accuracy for the expected range of operating conditions. Relative degradation in bit energy-to-thermal noise power spectral density ratio to achieve a 10 exp -5 coded bit-error-probability is determined to be 4 dB for the Ku-band SSO-to-TDRS I-channel return link with a 4.5 dB effective signal-to-interference total power ratio (S/I) when the Ku-band SSF-to-TDRS return link interferes, whereas Su's simulation yields approximately 5 dB degradation. For the Ku-band SSF-to-TDRS return link, both analysis and simulation results yield a relative signal degradation of 0.4 dB at the effective S/I = 21.6 dB. In conclusion, interference on the Ku-band SSO-to-TDRS I-channel return link is significant, but on the Ku-band SSF-to-TDRS return link it is negligible.

This paper examines maximum-likelihood block detection of uncoded full response CPM over an additive white Gaussian noise (AWGN) channel. Both the maximum-likelihood metrics and the bit error probability performances of the associated detection algorithms are considered. The special and popular case of minimum-shift-keying (MSK) corresponding to h = 0.5 and constant amplitude frequency pulse is treated separately. The many new receiver structures that result from this investigation can be compared to the traditional ones that have been used in the past both from the standpoint of simplicity of implementation and optimality of performance.

This paper addresses the problem of stereopair data compression. Two fundamentally different techniques for compressing stereopairs are discussed. The first technique, called disparity-compensated transform-domain predictive coding, attempts to minimize the mean-square error between the original stereopair and the compressed stereopair. The second technique, called mixed-resolution coding, is a psychophysically justified technique that exploits known facts about human stereovision to code stereopairs in a subjectively acceptable manner. A method for assessing the quality of compressed stereopairs is also presented. It involves measuring the ability of an observer to perceive depth in coded stereopairs. It is found that observers generally perceived objects to be further away in compressed stereopairs than they did in originals. Finally, the problem of coding stereopairs is considered from a rate-distortion perspective. It is proved that the rate distortion limit for coding stereopairs cannot in general be achieved by a coder that first codes and decodes the right picture sequence independently of the left picture sequence, and then codes and decodes the left picture sequence given the decoded right picture sequence.

Previous analyses of lock detector algorithms for Costas loops have ignored the effects of the inherent correlation between samples of the phase error process. In this paper, both analysis and simulations are used to quantify the effects of phase correlation on lock detection for the 'square law' and 'absolute value' type detectors. Results are obtained which depict the lock detection probability as a function of loop signal-to-noise ratio for a given false alarm rate. It is shown that the square law detector experiences less degradation due to phase jitter than the absolute value detector and that the degradation in detector signal-to-noise ratio is more pronounced for squarewave than for sinewave signals.

This paper derives and analyzes optimum and near-optimum structures for detecting frequency-hopped (FH) signals with arbitrary modulation in additive white Gaussian noise. The principalmodulation formats considered are M-ary frequency-shift-keying (MFSK) with fast frequency hopping(FFH) wherein a single tone is transmitted per hop, and slow frequency hopping (SFH) with multipleMFSK tones (data symbols) per hop. The SFH detection category has not previously been addressedin the open literature and its analysis is generally more complex than FFH.

An analysis is presented of a frequency-noncoherent, two-lag autocorrelation statistic for the wideband detection of random binary phase-shift keying (BPSK) signals in noise plus random multitone interference. It is shown that this detector is quite robust to the presence or absence of interference and its specific parameter values contrary to an energy detector. The rule assumes knowledge of the data rate and the active scenario under H0. The purpose of the paper is to promote the real-time autocorrelation domain and its samples (lags) as a viable approach for detecting random signals in dense environments.

This paper presents an adaptive algorithm for motion compensated color image coding. The algorithm can be used for video teleconferencing or broadcast signals. Activity segmentation is used to reduce the bit rate and a variable stage search is conducted to save computations. The adaptive algorithm is compared with the nonadaptive algorithm and it is shown that with approximately 60 percent savings in computing the motion vector and 33 percent additional compression, the performance of the adaptive algorithm is similar to the nonadaptive algorithm. The adaptive algorithm results also show improvement of up to 1 bit/pel over interframe DPCM coding with nonuniform quantization. The test pictures used for this study were recorded directly from broadcast video in color.

The fiber distributed data interface (FDDI) is an ANSI draft proposed standard for a 100 Mbit/s fiber-optic token ring. The FDDI timed token access protocol provides dynamic adjustment of the load offered to the ring, with the goal of maintaining a specified token rotation time and of providing a guaranteed upper bound on time between successive arrivals of the token at a station. FDDI also provides automatic recovery when errors occur. The bound on time between successive token arrivals is guaranteed only if the token rotates quickly enough to satisfy timer requirements in each station when all ring resources are functioning properly. Otherwise, recovery would be initiated unnecessarily. The purpose of this paper is to prove that FDDI timing requirements are satisfied, i.e., the token rotates quickly enough to prevent initiation of recovery unless there is failure of a physical resource or unless the network management entity within a station initiates the recovery process.

This paper describes an ALOHA random access protocol for fading communications channels. A two-state Markov model is used for the channel error process to account for the channel fading memory. The ALOHA protocol is modified to send multiple contiguous copies of a message at each transmission attempt. Both pure and slotted ALOHA channels are considered. The analysis is applicable to fading environments where the channel memory is short compared to the propagation delay. It is shown that smaller delay may be achieved using replications and, in noisy conditions, can also improve throughput.

In this paper, a concatenated coding scheme for error control in data communications is presented and analyzed. In this scheme, the inner code is used for both error correction and detection; however, the outer code is used only for error detection. A retransmission is requested if either the inner code decoder fails to make a successful decoding or the outer code decoder detects the presence of errors after the inner code decoding. Probability of undetected error (or decoding error) of the proposed scheme is derived. An efficient method for computing this probability is presented. Throughput efficiency of the proposed error control scheme incorporated with a selective-repeat ARQ retransmission strategy is also analyzed. Three specific examples are presented. One of the examples is proposed for error control in the NASA Telecommand System.

For a frequency-hopped noncoherent MFSK communication system without jammer state information (JSI) in a worst case partial band jamming environment, it is well known that the use of a conventional unquantized metric results in very poor performance. In this paper, a 'normalized' unquantized energy metric is suggested for such a system. It is shown that with this metric, one can save 2-3 dB in required signal energy over the system with hard decision metric without JSI for the same desired performance. When this very robust metric is compared to the conventional unquantized energy metric with JSI, the loss in required signal energy is shown to be small. Thus, the use of this normalized metric provides performance comparable to systems for which JSI is known. Cutoff rate and bit error rate with dual-k coding are used for the performance measures.

Shortened Hamming codes are widely used for error detection in data communications. In this paper, a method for computing the probability of an undetected error for these codes is presented. This method is then used to evaluate the error-detection performance of the shortened codes obtained from the two distance-four Hamming codes adopted by CCITT X.25 for error control for packet-switched networks. It is shown that shortening a code does affect its error-detection performance.

This paper evaluates the double symbol error rate (average probability of two consecutive symbol errors) in differentially detected narrow-band FM. Numerical results are presented for the special case of MSK with a Gaussian IF receive filter. It is shown that, not unlike similar results previously obtained for the single error probability of such systems, large inaccuracies in predicted performance can occur when intersymbol interference is ignored.

A new algorithm is introduced which decodes code division multiple user communication signals. The algorithm makes use of the distinctive form or pattern of each signal to separate it from the composite signal created by the multiple users. Although the algorithm is presented in terms of frequency-hopped signals, the actual transmitter modulator can use any of the existing digital modulation techniques. The algorithm is applicable to error-free codes or to codes where controlled interference is permitted. It can be used when block synchronization is assumed, and in some cases when it is not. The paper also discusses briefly some of the codes which can be used in connection with the algorithm, and relates the algorithm to past studies which use other approaches to the same problem.

Background theory and specific coding designs for combined coding/modulation schemes utilizing convolutional codes and continuous-phase modulation (CPM) are presented. In this paper the case of r = 1/2 coding onto a 4-ary CPM is emphasized, with short-constraint length codes presented for continuous-phase FSK, double-raised-cosine, and triple-raised-cosine modulation. Coding buys several decibels of coding gain over the Gaussian channel, with an attendant increase of bandwidth. Performance comparisons in the power-bandwidth tradeoff with other approaches are made.

The paper computes direct detection laser communications receiver performance when using avalanche photodiode (APD) detectors. The performances are compared in terms of bit error probability vs average signal required per bit when the transmitter uses either on-off keying (OOK) or low-order PPM formats. It is shown that QPPM requires 3 dB less signal than OOK, while BPPM requires the same or slightly more than OOK for the same performance. Optimum APD gain values range from 200 to 400. When using QPPM, k(eff) = 0.006, and optimum gain, 60 signal counts/bit are required at 500 Mbits/s for a 0.000001 bit error probability. It is concluded that QPPM may be an attractive signaling format for some fiber or free space laser communication applications.

FH/MFSK has been proposed for a multiuser spread spectrum digital communication system to combat both self-jamming and intentional jamming. An independence assumption at the energy detector outputs is used to evaluate such a system for a digitized voice mobile radio system (Yue, 1981). This paper presents a correlated model and compares its performance to an independence model under the symbol error probability criterion. A Gaussian process model is also developed for comparison. It is found that the conventional Gaussian approximation is inadequate in predicting the number of users that can be accommodated by an FH/MFSK system using the conventional receiver. Furthermore, for the cases evaluated, the independence model provides an excellent approximation to the correlated model. Additionally, a conditional Chernoff bound is presented for the more general case of frequency-hopping systems with multiple hops per symbol.

This paper considers a system that couples several phase-locked loops (PLL's) to improve carrier tracking performance. The system coherently combines the received carrier signals at geographically separated ground antennas to increase the total effective aperture. It automatically aligns the received carrier's phases to enhance received carrier signal-to-noise ratio. The tracking performance of this system is being assessed in terms of rms phase jitter.

Key design parameters associated with the operation of a digital integrate-and-dump filter are identified in this paper. Performance degradation effects associated with the selection of these parameters such as analog-to-digital converter (ADC) gain loading factor, number of bits used, predetection bandwidth, sampling rate, and accumulator length are considered. Numerical results of practical interest are also provided.

Serial minimum-shift keyed (MSK) modulation, a technique for generating and detecting MSK using series filtering, is ideally suited for high data rate applications provided the required conversion and matched filters can be closely approximated. Low-pass implementations of these filters as parallel inphase- and quadrature-mixer structures are characterized in this paper in terms of signal-to-noise ratio (SNR) degradation from ideal and envelope deviation. Several hardware implementation techniques utilizing microwave devices or lumped elements are presented. Optimization of parameter values results in realizations whose SNR degradation is less than 0.5 dB at error probabilities of .000001.

This paper examines by analytical methods the power spectral densities of digital modulations (in particular, staggered and unstaggered quadrature modulations) passed through band-limited nonlinear channels. Previously observed (by computer simulation or hardware measurement) behavior of such spectra with regard to the suppression or restoration of its sidelobes after passing through the nonlinearity is verified analytically. Several examples corresponding to specific quadrature modulations and filter-nonlinearity combinations are presented as illustrations of the general results.

This paper considers the performance of quadrature partial response (QPR) in the presence of jamming. Although a QPR system employs a single sample detector in its receiver, while quadrature amplitude shift keying (or quadrature phase shift keying) requires a matched-filter type of receiver, it is shown that the coherent detection performances of the two in the presence of the intentional jammer have definite similarities.

The potential false-lock problem associated with the sampled data type of Costas loop implementation is addressed in this paper. The term 'alias lock' is used here to differentiate this type of false lock behavior from the data sideband false lock behavior of analog Costas loops. It is shown that the sampled-data version of the conventional Costas loop, sampled at a rate 1/T(s), can alias lock at frequencies that are multiples of 1/2T(s) away from the carrier frequency. It is also shown that the alias lock problem of the sampled data version of the Costas loop with hard-limited in-phase channel is further compounded by the potential occurrence of false lock frequencies at rational multiples of 1/2T(s) away from the carrier. The false lock S-curves of I-Q loops and decision-directed I-Q loops are investigated in detail, with and without additive noise. Close agreement between theory and earlier experimental results is also demonstrated.

Many redundancy removal algorithms employ some sort of run length code. Blocks of timing words are coded with synchronization words inserted between blocks. The probability of incorrectly reconstructing a sample because of a channel error in the timing data is a monotonically nondecreasing function of time since the last synchronization word. In this paper we compute the 'probability that the accumulated magnitude of timing errors equal zero' as a function of time since the last synchronization word for a zero-order predictor (ZOP). The result is valid for any data source that can be modeled by a first-order Markov chain and any digital channel that can be modeled by a channel transition matrix. An example is presented.

Quick-look nonsystematic convolutional codes have the property that the information sequence may be recovered from the encoded sequence in straightforward fashion and with a minimum of error amplification. In this concise paper we investigate their relevant characteristics for constraint lengths less than eight and rate 1/2 and obtain a number of interesting and practically useful results. In particular, for the best of these codes, we derive their free distance and error amplification, their decoded bit error probability when used over the binary symmetric channel in conjunction with Viterbi decoding, and show how they can be employed to measure the channel bit error rate.

Much has been said in the literature regarding the problem of establishing symbol synchronization in binary baseband digital communication systems. By comparison, the literature contains little information relating to the extraction of symbol sync from multilevel baseband data. With the recent interest in multilevel amplitude-shift keying (MASK) and quadrature amplitude-shift keying (QASK) as signaling techniques for multilevel digital communications systems, the problem of providing symbol synchronization in the receivers of such systems becomes paramount. This paper presents a technique for extracting symbol sync from a MASK or QASK signal which has been transmitted over an infinite-bandwidth white Gaussian noise channel. The scheme is essentially a generalization of the data transition tracking loop (DTTL) which has heretofore been used in PSK systems. The performance of the loop is analyzed in terms of its mean-squared symbol sync jitter and its effects on the data detection process in MASK and QASK systems.

The multipath communication channel for space communications is modeled as a multiplicative channel. This paper discusses the effects of multiplicative channel processes on the symbol error rate for quadrature modulation (QM) digital modulation schemes. An expression for the upper bound on the probability of error is derived and numerically evaluated. The results are compared with those obtained for additive channels.

Sequential decoding has been found to be an efficient means of communicating at low undetected error rates from deep space probes, but erasure or computational overflow remains a significant problem. Erasure of a block occurs when the decoder has not finished decoding that block at the time that it must be output. By drawing upon analogies in computer time sharing, this paper develops a buffer-management strategy which reduces the decoder idle time to a negligible level, and therefore improves the erasure probability of a sequential decoder. For a decoder with a speed advantage of ten and a buffer size of ten blocks, operating at an erasure rate of .01, use of this buffer-management strategy reduces the erasure rate to less than .0001.

Statistics on rainfall rates near and above the earth's surface are needed in order to estimate the percentage of time of absorption, or scattering of radio waves that affect radio system design and electrospace management. The most useful averaging time for computing such rates is on the order of 1 min or less. This paper extrapolates excessive short-duration precipitation data to provide such statistics from data routinely reported by the National Weather Service. For the 8766 h in an average year, and for a median or random location in any part of the world, the model described here estimates the fraction of time during which t-minute average rainfall rates exceed any given value.

Selection of a particular signal set array for a bandwidth-constrained multiple phase-and-amplitude-shift-keyed (MPASK) communication system for a linear additive Gaussian noise channel requires consideration of factors such as average and/or peak power vs symbol error probability, signal amplitude dynamic range, simplicity of generation and detection, and number of bit errors per symbol error (Gray code properties). A simple technique is presented for generating and optimally detecting the honeycomb (hexagonal) signal set, i.e., the signal set that has the tightest sphere-packing properties. The symbol and bit error probability performance of this set is compared to other two-dimensional signal sets that have been investigated in the literature, and is shown to be slightly superior from an average power standpoint. The paper concludes with a comparison of all of these signal sets from the standpoint of the factors listed above.

This paper presents the derivation of the recursive algorithms necessary for real-time digital detection of M-ary known signals that are subject to independent multiplicative and additive Gaussian noises. The motivating application is minimum probability of error detection of digital data-link messages aboard civil aircraft in the earth reflection multipath environment. For each known signal, the detector contains one Kalman filter and one probability computer. The filters estimate the multipath disturbance. The estimates and the received signal drive the probability computers. Outputs of all the computers are compared in amplitude to give the signal decision. The practicality and usefulness of the detector are extensively discussed.

This paper investigates the tracking performance of a Costas loop in the presence of single and multiple in-band pulsed RFI signals and receiver additive noise. It is shown that the loop's tracking performance is very sensitive to the pulse durations of the RFI signals, as well as their repetition rates and peak powers relative to those of the desired signal. The presence of in-band RFI can affect the loop's tracking performance in basically three ways. 1) The loop tracks the composite phase of the RFI instead of the phase of the desired signal when the effective RFI power is greater than that of the signal. 2) When the effective RFI power is not sufficiently large to capture the loop, there still will exist static phase error biases which cause the loop to lock at a phase between that of the desired signal and the composite RFI. 3) There is an increase in the rms phase jitter over the nominal design. These latter two effects degrade the bit error probability performance of the receiver. More significantly, if the nominal loop bandwidth is not designed properly to account for the increase in jitter phenomenon, frequency cycle slipping may result.

In this paper we discuss the correlation properties of the output of a binary convolutional encoder. We consider both random statistically independent inputs and first-order Markov inputs. It is shown that for random inputs, the ensemble average of the product of the outputs of a convolutional encoder taken two at a time is always either 0 or 1, and that for almost all good codes the ensemble average is always 0.

Quadriphase receivers, like biphase receivers, have the ability to false lock on a sideband on the data modulation. The theory associated with this phenomenon for receivers of binary phase-shift-keying (BPSK), using Costas loop demodulation, has recently been documented in the literature. This paper considers the corresponding theory for receivers of balanced quadriphase-shift-keying (QPSK) employing a quadriphase Costas loop (or equivalent fourth-power loop) for demodulation. Specific closed form expressions for false lock performance are developed and numerically evaluated for the particular case of single pole arm filters and an NRZ data format for each of the two statistically independent quadrature modulations.

Starting with MAP estimation theory as a basis for optimally estimating carrier phase of BPSK and QPSK modulations, it is shown in this paper that the closed loop phase trackers, which are motivated by this approach, are indeed closed loop optimum in the minimum mean-square phase tracking jitter sense. The corresponding squaring loss performance of these so-called MAP estimation loops is compared with that of more practical implementations wherein the hyperbolic tangent nonlinearity is approximated by simpler functions.

This paper describes the current work at NASA/Johnson Space Center in the area of RF coverage analysis and performance-assessment for the Space Shuttle Program communication and tracking radio links. Trajectories, antenna data, ground station and Shuttle hardware performance characteristics and RF link math models were assimilated to generate RF link performance predictions for the three basic mission phases - ascent, on-orbit, and descent. Results identify some earlier deficiencies that required re-configuration of the ground station. Overall performance is currently satisfactory.

The paper describes the SONG and modified ABATE adaptive delta modulation algorithms for voice encoding. Waveforms of the response of the delta modulators to channel errors are given, and performance data which show the relationship between channel errors and word intelligibility are provided. An analytic derivation yielding a comparison between PCM and adaptive delta modulation with respect to channel errors is given. The Space Shuttle is employing the modified-ABATE device because it can tolerate a high error rate and operates at a relatively low sampling rate.

The Space Shuttle initially will be using a field-sequential color television system but it is possible that an NTSC color TV system may be used for future missions. In addition to downlink color TV transmission via analog FM links, the Shuttle will use a high resolution slow-scan monochrome system for uplink transmission of text and graphics information. This paper discusses the characteristics of the Shuttle video systems, and evaluates digitization and/or bandwidth compression techniques for the various links. The more attractive techniques for the downlink video are based on a two-dimensional DPCM encoder that utilizes temporal and spectral as well as the spatial correlation of the color TV imagery. An appropriate technique for distortion-free coding of the uplink system utilizes two-dimensional HCK codes.

Shuttle voice processing uses a Variable Slope Delta Modulation scheme which is a variant of the ABATE algorithm. This paper summarizes the ground terminal subsystem which processes the multiplexed voice and telemetry data digital sequence in the downlink processing and digitizes the voice signal in the uplink processing. The Delta Modulation System (DMS) performance characteristics are given in terms of an intelligibility test score and in terms of time and frequency responses measured on a production system developed for NASA Goddard Space Flight Center. Implementation details of the encoder and decoder algorithms are given in terms of the circuit logic used to implement them.

Unbalanced quadriphase-shift-keying (QPSK) is an attractive means for transmitting two digital data streams which in general have different average powers, data rates, and data formats. Previous analyses of the tracking performance of Costas loop demodulators of unbalanced QPSK have accounted only for the filtering effect produced by the loop's two arm filters on the equivalent additive noise perturbing the loop. When the bandwidth of these filters is selected on the basis of the order of the data rate, as is typical of optimum Costas loop design, the filtering degradations of the data modulations themselves and the cross-modulation noise produced by their multiplication in the loop often cannot be neglected. The purpose of this paper is to incorporate these additional filtering effects into the analysis. Many of the results obtained herein are in the form of closed-form expressions which can easily be evaluated numerically for design and performance prediction purposes.

The paper examines the tracking performance of the Costas loop used in a suppressed carrier receiver with a hard limiter of the in-phase channel arm filter output. Attention is given to assessing the penalty, if indeed it is a penalty rather than an improvement, in this performance relative to a conventional Costas loop without the hard limiter and with an analog third multiplier. In particular, for the case of single-pole Butterworth (RC) arm filters and NRZ data, the squaring loss (tracking jitter penalty relative to a linear loop) is evaluated and illustrated as a function of the ratio of arm filter bandwidth to data rate and data SNR. Also considered is the tracking performance of a hard-limited modified Costas loop wherein the quadrature arm is removed. Corresponding results for the modified Costas loop without the hard limiter are given.

Because of the symmetry in most two-dimensional signal constellations, ambiguities exist at the receiver as to the exact phase orientation of the received signal set. In PSK systems, this ambiguity is resolved by the use of differential encoding. This paper presents differential encoding techniques which can be used with a variety of symmetric signal sets to remove their phase ambiguity. While not proven to be optimum, the techniques do have low performance penalties relative to the uncoded performance. The key to reducing the performance penalty is to use the minimum amount of differential encoding necessary to resolve the ambiguity. Examples of encoding techniques for several common signal constellations are given, including their performance penalties.