| Soft-input/soft-output symbol decoding plays a signiicant role in iterative decoding. We propose a simple optimal soft-input/soft-output symbol decoding algorithm for linear block codes which requires one forward recursion using a trellis. For many codes the decoding complexity is lower than previous methods, such as the algorithm by Bahl et. al. 1], and the decrease is shown at its most when...

Soft-input/soft-output symbol decoding plays a significant role in iterative decoding. We propose a simple optimal soft-input/softoutput symbol decoding algorithm for linear block codes which requires one forward recursion using a trellis. For many codes the decoding complexity is lower than previous methods, such as the algorithm by Bahl et al. [1], and the decrease is shown at its most when d...

This study presents a modified and conceptually simple step-by-step decoding algorithm for binary cyclic BCH codes. Step-by-step decoding temporarily changes one information bit value at a time and then checks weather the weight of the error pattern decreases by computing the corresponding syndrome matrix determinant. Based on the channel information, this study propose a modified step-by-step ...

In this paper, we address Joint Source-Channel (JSC) decoding with low decoding complexity over wireless channel. We propose a unity rate accumulator based design for soft-input soft-out decoding for low complexity Chase-like decoding of arithmetic codes. Chase-like decoding is a low complexity algorithm, where a maximum a posteriori sequence estimation criterion is employed for maximum likelih...

The performance of algebraic soft-decision decoding (ASD) of Reed-Solomon (RS) codes using bit-level soft information is investigated. Optimal multiplicity assignment strategies (MAS) of ASD with infinite cost are first studied over erasure channels and binary symmetric channels (BSC). The corresponding decoding radii are calculated in closed forms and tight bounds on the error probability are ...

Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF), the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme...

SUMMARY We have researched high dimensional parity-check (HDPC) codes that give good performance over a channel that has a very high error rate. HDPC code has a little coding overhead because of its simple structure. It has hard-in, maximum detected bit flipping (MDBF) decoding that has reasonable decoding performance and computational cost. In this paper, we propose a modified algorithm for MD...

Left-to-right (LR) decoding (Watanabe et al., 2006) is promising decoding algorithm for hierarchical phrase-based translation (Hiero) that visits input spans in arbitrary order producing the output translation in left to right order. This leads to far fewer language model calls, but while LR decoding is more efficient than CKY decoding, it is unable to capture some hierarchical phrase alignment...

As a new non-orthogonal multiple access technology for 5G massive machine type communication scenario, the sparse code (SCMA) has greatly improved spectrum efficiency due to high connection density. SCMA combines QAM (Quadrature Amplitude Modulation) modulation and spreading into codebook set obtain forming gain. The user binary bit data is directly mapped multi-dimensional codewords in transmi...