David Haccoun

High-rate punctured convolutional codes for Viterbi and sequential decoding

An investigation is conducted of the high-rate punctured convolutional codes suitable for Viterbi and sequential decoding. Results on known short-memory codes M >

Generalized type II hybrid ARQ scheme using punctured convolutional coding

A method is presented to construct rate-compatible convolutional (RCC) codes from known high-rate punctured convolutional codes, obtained from best-rate 1/2 codes. The construction method is rather simple and straightforward, and still yields good codes. Moreover, low-rate codes can be obtained without any limit on the lowest achievable code rate. Based on the RCC codes, a generalized type-II hybrid ARQ scheme, which combines the benefits of the modified type-II hybrid ARQ strategy of J. Hagenauer (1988) with the code-combining ARQ strategy of D. Chase (1985), is proposed and analyzed. With the proposed generalized type-II hybrid ARQ strategy, the throughput increases as the starting coding rage increases, and as the channel degrades, it tends to merge with the throughput of rate 1/2 type-II hybrid ARQ schemes with code combining, thus allowing the system to be flexible and adaptive to channel conditions, even under wide noise variations and severe degradations. >

Coding for Satellite Communication

This paper discusses a number of coding techniques for future satellite communication; they include Reed-Solomon error decoding for message blocks, probabilistic decoding techniques for punctured convolutional codes, and planar Euclidean geometry difference set codes for random multiple access applications. The provision of code concatenation, helical interleaving, and simulation results of new punctured convolutional codes are included. A number of coded satellite systems that demonstrate the usefulness of coding in satellite communications are described.

Adaptive Viterbi decoding of convolutional codes over memoryless channels

In this paper, an adaptive decoding algorithm for convolutional codes, which is a modification of the Viterbi algorithm (VA) is presented. For a given code, the proposed algorithm yields nearly the same error performance as the VA while requiring a substantially smaller average number of computations. Unlike most of the other suboptimum algorithms, this algorithm is self-synchronizing. If the transmitted path is discarded, the adaptive Viterbi algorithm (AVA) can recover the state corresponding to the transmitted path after a few trellis depths. Using computer simulations over hard and soft 3-bit quantized additive white Gaussian noise channels, it is shown that codes with a constraint length K up to 11 can be used to improve the bit-error performance over the VA with K=7 while maintaining a similar average number of computations. Although a small variability of the computational effort is present with our algorithm, this variability is exponentially distributed, leading to a modest size of the input buffer and, hence, a small probability of overflow.

Further results on high-rate punctured convolutional codes for Viterbi and sequential decoding

The weight spectra of high-rate lpunctured convolutional codes are evaluated under the hypothesis of a low-rate structure. This interpretation yields results slightly different from those obtained when weight spectra are evaluated assuming a true high-rate structure for punctured codes. The search for long memory punctured codes is extended by providing new punctured codes of rates 4/5, 5/6, 6/7, and 7/8 with memories ranging from 9 to 19. >

Sequential decoding with ARQ and code combining: a robust hybrid FEC/ARQ system

Sequential decoding with ARQ (automatic-repeat-request) and code combining under the timeout condition is considered. That is, whenever the decoding time of a given packet exceeds some predetermined duration, decoding is stopped and retransmission of the packet is requested. However, the unsuccessful packets are not discarded, but are combined with their retransmitted copies. It is shown that the use of code combining allows sequential decoding to operate efficiently even when the coding rate R exceeds the computational cutoff rate R/sub comp/. Furthermore, an analysis of the selective-repeat ARQ scheme shows that the use of code combining yields a significant throughput even at very high channel error rates, thus making the system very robust under severe degradations of the channel. >

Performance Analysis of Amplify-and-Forward Cooperative Networks with Relay Selection over Rayleigh Fading Channels

A performance analysis for cooperative diversity system with best relay selection over Rayleigh fading channels is presented. We obtain analytical expressions for the probability density function (PDF), cumulative density function (CDF), and the moment generating function (MGF) of end-to-end SNR of the system under study. Using these expressions we derive closed- form expressions for the average symbol error rate (SER), the outage probability and the average end-to-end SNR gain obtained form relay selection. Using numerical simulations and calculation of the mathematical expressions, the performances of different cases are evaluated and compared to show the significant advantages of the relay selection in a cooperative communication.

Capacity Analysis of Opportunistic Relaying in Cooperative Systems with Outdated Channel Information

In this paper, we analyze the Shannon capacity of the opportunistic relaying technique in amplify-and-forward cooperative systems over Rayleigh fading channels under outdated channel information. Closed-form expressions are derived for the average channel capacity and outage probability. Using numerical evaluations the performances of different cases are compared to evaluate and quantify the effects of outdated channel information on the channel capacity and the outage performance.

Iterative threshold decoding without interleaving for convolutional self-doubly orthogonal codes

A novel iterative error control technique based on the threshold decoding algorithm and new convolutional self-doubly orthogonal codes is proposed. It differs from parallel concatenated turbo decoding as it uses a single convolutional encoder, a single decoder and hence no interleaver, neither at encoding nor at decoding. Decoding is performed iteratively using a single threshold decoder at each iteration, thereby providing good tradeoff between complexity, latency and error performance.

High-rate punctured convolutional codes: structure properties and construction technique

The authors present some properties of punctured convolutional codes, providing a construction method and a list of new, good, high-rate, long-memory punctured codes. The structure of punctured codes is examined and an upper bound on the free distance of punctured codes is derived, indicating that punctured codes are good codes. A construction method that generates the low-rate original codes which duplicate given known high-rate codes through perforation is proposed. Tables of punctured codes that duplicate the best known nonsystematic codes of rates 2/3 and 3/4 with memory lengths ranging from 3 to 23 and from 3 to 9, respectively, are given, together with the best known systematic codes for rates ranging from 2/3 to 7/8 with very long memory, M=44 through 48. >