PPM Performance for Reed-Solomon Decoding Over an Optical-RF Relay Link

Consideration is presently being given to an optical-RF relay deep space communication link that transmits optical PPM data from spacecraft to orbital relay, then retransmits the data via microwave to ground. It is generally advantageous to use Reed-Solomon (RS) encoding over the PPM optical link for improved error correction. In this paper several demodulating schemes are considered for generating the RS symbols at the relay photodetector output, and the effect of each on overall RS decoding performance is computed. Both Poisson and Gaussian optical noise models are used in the evaluation. The effect on performance of bit errors in the relay downlink is also examined.     

Multiple symbol trellis coding of CPFSK

This paper describes a technique related to the design of a trellis encoder, combined with the full response M-ary continuous phase frequency shift keying (CPFSK) with modulation index 1/M. A new representation of CPFSK waveforms in N signaling intervals, is proposed as a function of an (N+1)-D vector. We also decompose the generation of the proposed CPFSK waveform into two stages, an N-consecutive continuous phase encoder (NCPE) and a memoryless modulator (MM). This decomposition makes it possible to design binary convolutional encoders with various code rates, cascaded to the NCPE. Specific optimal outer convolutional encoders of two and three-consecutive full response four-ary CPFSK with modulation index 1/4 are designed following Ungerboeck's (1982) set partitioning approach. These codes achieve asymptotic coding gains up to 4.77 dB for the two consecutive case with code rate 3/4, and asymptotic coding gains up to 5.45 dB for the three-consecutive case with code rate 5/6     

Prediction of bankruptcy Iranian corporations through artificial neural network and Probit-based analyses

In this study, multilayer perceptron (MLP) of artificial neural networks is utilized to build a new model for bankruptcy prediction. A precise MLP-based relationship is obtained to classify samples of 136 bankrupt and non-bankrupt Iranian corporations using their financial ratios. A Probit analysis is performed to benchmark the MLP model. Ratios of sales to current assets ratio, operational income to sales, quick assets to total assets, and total liability to total assets are used as the effective predictive financial ratios. A comparative study is further conducted on the classification accuracy of the MLP, Probit, and other existing models. The proposed MLP model has a significantly better performance than the Probit and other models found in the bankruptcy prediction literature.     

Bandwidth efficient parallel concatenated coding schemes

The authors propose a solution to the parallel concatenation of trellis codes with multilevel amplitude/phase modulations and a suitable iterative decoding structure. Examples are given for throughputs 2bit/s/Hz with 8PSK and 16QAM signal constellations. For parallel concatenated trellis codes in the examples, rate 2/3 and 4/5, 16-state binary convolutional codes with Gray code mapping are used. The performances of these codes are within 1 dB of the Shannon limit at a bit error probability of 10^-6 for a given throughput. This outperforms all codes reported in the past for the same throughput     

Concatenated convolutional codes with interleavers

This article presents a tutorial overview of the class of concatenated convolutional codes with interleavers, also known as turbo-like codes. They are powerful codes, formed by a number of encoders connected through interleavers, endowed by a decoding algorithm that splits the decoding burden into separate decoding of each individual code. Refinement of successive estimates of the information sequence is obtained by iterating the procedure of passing from one decoder to the other likelihood information decorrelated by the interleaver action. The key issues of code analysis and design are covered at the level of broad comprehension, without paying attention to analytical details.     

Upper bounds to error probabilities of coded systems beyond the cutoff rate

A family of upper bounds to error probabilities of coded systems was recently proposed by D. Divsalar (see IEEE Communication Theory Workshop, 1999; JPL TMO Prog. Rep. 42-139, 1999). These bounds are valid for transmission over the additive white Gaussian noise channel, and require only the knowledge of the weight spectrum of the code words. After illustrating these bounds, we extend them to fading channels. Contrary to the union bound, our bounds maintain their effectiveness below the signal-to-noise ratio (SNR) at which the cutoff rate of the channel equals the rate of the code. Some applications are shown. First, we derive upper bounds to the minimum SNR necessary to achieve zero error probability as the code block length increases to infinity. Next, we use our bounds to predict the performance of turbo codes and low-density parity-check codes.     

Doppler-corrected differential detection of MPSK

An open-loop technique is presented for estimating and correcting Doppler frequency shift in an M-ary differential phase-shift-keyed (MDPSK) receiver. The novelty of the scheme is based on the observation that whereas the change in phase of the received signal over a full symbol contains the sum of the data (phase) and the Doppler-induced phase shift, the same change in phase over half a symbol (within a given symbol interval) contains only the Doppler-induced phase shift. Thus, by proper processing, the latter can be estimated and removed from the former. Analytical and simulation results are given for the variance of the above estimator, and the error probability performance of the MDPSK receiver is evaluated in the presence of the Doppler correction. Next, the practical considerations associated with the application of this technique on bandlimited Nyquist channels are discussed and incorporated into the final design. It is shown that the receiver can, in the absence of timing jitter, be designed to allow combined Doppler correction and data detection with no penalty due to intersymbol interference (ISI). The effects of ISI due to timing jitter are assessed by computer simulation     

Some new twists to problems involving the Gaussian probabilityintegral

Using an alternate form of the Gaussian probability integral discovered a number of years ago, it is shown that the solution to a number of previously considered communication problems can be simplified and, in some cases, made more accurate (i.e. exact rather than bounded). These problems include the evaluation of: (1) the bit-error probability of uncoded phase shift keying (PSK) with Costas loop tracking; (2) word-error probability of antipodal modulation in the presence of fading; (3) bit-error probability of coded M-ary PSK (MPSK) over the memoryless fading channel with given channel-state information; (4) conditional symbol-error probability of MPSK in the presence of carrier synchronization error; and (5) the average error probability for the binary additive white Gaussian noise (AWGN) intersymbol interference channel. Also obtained is a generalization of this new alternate form to the case of a two-dimensional Gaussian probability integral with arbitrary correlation which can be used to evaluate the symbol-error probability of MPSK with I-Q unbalance     

Improved parallel interference cancellation for CDMA

This paper introduces an improved nonlinear parallel interference cancellation scheme for code-division multiple access (CDMA) that significantly reduces the degrading effect on the desired user of interference from the other users that share the channel. The implementation complexity of the scheme is linear in the number of users and operates on the fact that parallel processing simultaneously removes from each user a part of the interference produced by the remaining users accessing the channel the amount being proportional to their reliability. The parallel processing can be done in multiple stages. The proposed scheme uses tentative decision devices at the multiple stages to produce the most reliably estimated received data for generation and cancellation of user interference. Simulation results are given for a multitude of different situations, in particular, those cases for which the analysis is too complex     

Analysis, design, and iterative decoding of double seriallyconcatenated codes with interleavers

A double serially concatenated code with two interleavers consists of the cascade of an outer encoder, an interleaver permuting the outer codeword bits, a middle encoder, another interleaver permuting the middle codeword bits, and an inner encoder whose input words are the permuted middle codewords. The construction can be generalized to h cascaded encoders separated by h-1 interleavers, where h>3. We obtain upper bounds to the average maximum likelihood bit-error probability of double serially concatenated block and convolutional coding schemes. Then, we derive design guidelines for the outer, middle, and inner codes that maximize the interleaver gain and the asymptotic slope of the error probability curves. Finally, we propose a low-complexity iterative decoding algorithm. Comparisons with parallel concatenated convolutional codes, known as “turbo codes”, and with the proposed serially concatenated convolutional codes are also presented, showing that in some cases, the new schemes offer better performance