A universal decoding procedure is proposed for memoryless Gaussian channels with deterministic interfering signals from a certain class. The universality of the proposed decoder is in the sense of W i g independent of the channel parameters and the unknown interfering signal, and at the same time attaining the same random coding e m r exponent as the optimal maximum likelihood (ML) decoder, whi...

In this paper, a class of Generalized Quasi-Orthogonal Space-Time Block Code is proposed to achieve full-rate transmission with low-complexity maximum likelihood decoding. Full transmit-diversity is achieved through rhe constellation rotation technique. Code construction criteria for this class of code are listed. Average lideterminant criterion is proposed for optimizing the degree of constell...

In this paper, we investigate various types of multi-stage decoding for multi-level block modulation codes, in which the decoding of a component code at each stage can be either soft-decision or hard-decision, maximum likelihood or bounded-distance. Error performance of codes is analyzed for a memoryless additive channel based on various types of multi-stage decoding, and upper bounds on the pr...

The error rate of error correcting codes with soft-decision-decoding rarely has a closed-form expression. Bounding techniques are widely used to evaluate the performance of maximum-likelihood decoding algorithm. But the existing bounds are not tight enough especially for a low signal-to-noise ratios region and become looser when a suboptimum decoding algorithm is used. The radius of decision re...

It has been proved that the maximum likelihood decoding problem of Reed-Solomon codes is NP-hard. However, the length of the code in the proof is at most polylogarithmic in the size of the alphabet. For the complexity of maximum likelihood decoding of the primitive Reed-Solomon code, whose length is one less than the size of alphabet, the only known result states that it is at least as hard as ...

The turbo decoding algorithm of a decade ago constituted a milestone in error-correction coding for digital communications, and has inspired extensions to generalized receiver topologies, including turbo equalization, turbo synchronization, and turbo CDMA, among others. Despite an accrued understanding of iterative decoding over the years, the “turbo principle” remains elusive to master analyti...

In this letter, we present a squaring method to simplify the decoding of orthogonal space–time block codes in a wireless system with an arbitrary number of transmitand receive-antennas. Using this squaring method, a closed-form expression of signal-to-noise ratio after space–time decoding is also derived. It gives the same decoding performance as the maximum-likelihood ratio decoding while it s...

A new adaptive trellis decoding technique for block codes is proposed. The technique is based on a recently introduced encoding technique which allows the design of almost all known linear codes together with their minimal trellises. The proposed adaptive trellis decoding technique allows t h e implementation of a single sof t maximum likelihood trellis decoder for decoding of different codes. ...

A popular combination in modern coding system is the convolutional encoder and the Viterbi decoder [5]. With a proper design, they can jointly provide an acceptable performance with feasible decoding complexity. In such a combination, a tradeoff on the error performance and the decoding complexity resides on the choice of the code constraint length. Specifically, the probability of Viterbi deco...

This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...