We suggest a decoding algorithm of -ary linear codes, which we call supercode decoding. It ensures the error probability that approaches the error probability of minimumdistance decoding as the length of the code grows. For the algorithm has the maximum-likelihood performance. The asymptotic complexity of supercode decoding is exponentially smaller than the complexity of all other methods known...

In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.

DVB-S2 is the second generation of Digital Video Broadcasting-Satellite and LDPC (Low Density Parity Code) is the key technology in which the decoding plays an important role in determining the performance of DVB-S2 system. According to the research on the characteristics of DVB-S2 standard, this paper reports on the improvement of the Turbo Decoding Message Passing (TDMP) algorithm by adopting...

Turbo decoders inherently have a large latency and low throughput due to iterative decoding. To increase the throughput and reduce the latency, high speed decoding schemes have to be employed. In this paper, following a discussion on basic parallel decoding architectures, two types of area-efficient parallel decoding schemes are proposed. Detailed comparison on storage requirement, number of co...

We present improved differential lattice decoding (DLD) for multi-antenna differential modulation by exploiting both basis reduction and sphere decoding. The extra complexity of DLD is shown to be worthwhile in terms of the obtained performance gain over Clarkson et al.’s decoding scheme. With roughly another fold of complexity of basis reduction, DLD augmented by a local search practically at...

This paper presents a new decoding for polynomial residue codes, called the minimum degree-weighted distance decoding. The newly proposed decoding is based on the degreeweighted distance and different from the traditional minimum Hamming distance decoding. It is shown that for the two types of minimum distance decoders, i.e., the minimum degree-weighted distance decoding and the minimum Hamming...

Polar codes are a class of capacity-achieving codes for the binary-input discrete memoryless channels (B-DMCs). However, when applied in channels with intersymbol interference (ISI), the codes may perform poorly with BCJR equalization and conventional decoding methods. To deal with the ISI problem, in this paper a new joint successive cancellation (SC) decoding algorithm is proposed for polar c...

An efficient scheme for JPEG2000 SNR progressive decoding is proposed, which is capable of handling JPEG2000 compressed image data with SNR progressiveness. In order to avoid entropy decoding of the same compressed data more than once when decoding SNR progressive images, two techniques are introduced in our decoding scheme; reuse of intermediate decoding result and differential inverse discret...

We present an algorithm based on the closest point search (CPS) in lattices for decoding of space-time block codes (STBC). The modified CPS algorithm based on the Schnorr-Euchner variation of the Pohst method is used to perform the decoding of STBC. This method is shown to be substantially faster than other known sphere decoding methods. Also we exploit a fast method for decoding of orthogonal ...

In this paper, we propose two schemes, which enable any VF code to realize director fast-access decoding for any long source sequence. Direct-access decoding means that any source symbol of any position can be directly decoded within constant time, not depending on the length of source sequence N , without decoding the whole codeword sequence. We also evaluate the memory size necessary to reali...