Space-time (ST) coding techniques exploit the spatial diversity afforded by multiple transmit and receive antennas to achieve reliable transmission in scattering-rich environments. ST block codes are capable of realizing full diversity and spatial coding gains at relatively low rates; ST trellis codes can achieve better rate-diversity tradeoffs at the cost of high complexity. On the other hand,...

The main computational steps in algebraic softdecoding, as well as Sudan-type list-decoding, of Reed-Solomon codes are bivariate polynomial interpolation and factorization. We introduce a computational technique, based upon re-encoding and coordinate transformation, that significantly reduces the complexity of the bivariate interpolation procedure. This re-encoding and coordinate transformation...

The decoding error probability of a code C measures the quality of performance when C is used for error correction in data transmission. In this note we compare different types of codes with regard to the decoding error probability.

In this paper, we present hybrid decoding — a novel statistical machine translation (SMT) decoding paradigm using multiple SMT systems. In our work, in addition to component SMT systems, system combination method is also employed in generating partial translation hypotheses throughout the decoding process, in which smaller hypotheses generated by each component decoder and hypotheses combinatio...

By using viterbi decoder the power can be reduced according to number of stages used in each block. The efficient way to reduce data corruption in digital communication channels using various decoding algorithm. Although hardware implementations of decoding algorithms, (i.e.,) Viterbi algorithm, have shown good noise tolerance for error-correcting codes, these hardware implementations require a...

This paper presents a new approach to universal noiseless compression based on error correcting codes. The scheme is based on the concatenation of the Burrows-Wheeler block sorting transform (BWT) with the syndrome former of a Low-Density Parity-Check (LDPC) code. The proposed scheme has linear encoding and decoding times and uses a new closed-loop iterative doping algorithm that works in conju...

In this paper, sequential decoding is analyzed in conjunction with an efficient incremental redundancy ARQ scheme using punctured convolutional coding. With the incremental redundancy ARQ scheme, whenever the decoding time for a given data packet exceeds some predetermined value T max, decoding of that data packet is stopped and incremental redundancy bits are provided by the transmitter, a few...

A new tight analytical upper bound is presented for the performance of finite-delay symbol-by-symbol (SBS) Abend–Fritchman-like decoding of trellis-encoded data crossing arbitrary (eventually time-varying) discrete memoryless channels (DMC’s). On the basis of this bound, a related criterion for the optimal design of trellis codes with SBS decoding is then proposed. It gives rise to an effective...

A simple parallel algorithm for decoding a Huffman encoded file is presented, exploiting the tendency of Huffman codes to resynchronize quickly, i.e. recovering after possible decoding errors, in most cases. The average number of bits that have to be processed until synchronization is analyzed and shows good agreement with empirical data. As Huffman coding is also a part of the JPEG image compr...

This paper describes a novel architecture for parallel turbo decoding used in Long Term Evolution (LTE) systems. The decoding scheme contains only one Quadratic Permutation Polynomial (QPP) interleaver, independently on the parallelization factor. Also, we propose an efficient implementation for the QPP interleaver. The arithmetic properties of the corresponding interleaver equations are exploi...