Number Of Decoding Iterations Research Articles

Performance Analysis of Practical QC-LDPC Codes: From DVB-S2 to ATSC 3.0

In this paper, a new analysis method is introduced to predict the gap between Shannon limit and successful decoding signal-to-noise ratio threshold (SNR loss) of practical quasi-cyclic low-density parity check (QC-LDPC) codes. The SNR loss of a QC-LDPC code is summed up from three aspects: 1) the base matrix; 2) the number of iterations for decoding; and 3) the finite codeword length. As an example, the SNR loss of DVB-S2 and ATSC 3.0 LDPC codes is analyzed with the proposed method. Results show that a large portion of the SNR loss of DVB-S2 LDPC codes is due to their base matrices, which is significantly improved in latest ATSC 3.0 standard. Furthermore, with the aid of the proposed analysis method, newly designed QC-LDPC codes with raptor-like structure are proposed. Bit-error rate simulations show that the proposed codes are only 0.4 dB away from Shannon limit under binary-input additive white Gaussian noise channel and only 0.65 dB away from Shannon limit under binary-input Rayleigh fading channel, which are comparable with state-of-art design.

Optimization of Iterative Channel State Estimation Algorithms in SCMA System

Optimization of iterative algorithms for channel state estimation in a sparse coding multiple-access system (SCMA) is performed to reduce computational costs of the receiver. It is shown that when a signal-to-noise ratio (SNR) does not exceed 10 dB, one iteration of the algorithm is sufficient, and an increase in the number of iterations does not lead to an increase in spectral efficiency. Simulation demonstrates a possibility of a reasonable choice of the total number of decoder iterations and their distribution between different stages of the channel estimation. For an uncoded system, iterative re-estimation of the channel is proposed, as well as ways to reduce computational costs during its calculation. In the coded system, at a low SNR the achieved spectral efficiency values are approximately similar to those with pilot-only channel estimation. The article provides recommendations for the placement of data symbols and pilot signals in re-source blocks to increase the system spectral efficiency.

Design of Irregular Repeat Accumulate Codes for Finite Decoder Iterations

This paper deals with the design of non-systematic irregular repeat-accumulate codes that are optimised for a finite number of decoding iterations. In many cases of practical interest, the usual approach for sparse-graph codes, which aims to approach capacity (with arbitrarily many decoder iterations), may not be suitable. This is of particular importance for systems with complexity or delay constraints. In this paper, we provide a design methodology which constrains the number of decoder iterations, as well as other measures of implementation complexity. Our approach uses extrinsic information transfer analysis, and our main contribution is the formulation of code optimisation problems which directly incorporate the number of iterations into the constraints. We focus on the single user binary erasure channel and the two-user binary adder channel, where this transfer analysis is exact. Generalisation to other sparse graph codes and other channels (under usual approximations) is straightforward.

Decoder-Assisted Timing Synchronization in Multiuser CDMA Systems

The problem of synchronizing weak user signals in multiuser code-division multiple access systems is addressed. We integrate timing synchronization into an iterative multiuser detection (MUD) framework for the improved synchronization performance of weak users. First, the effect of correctly detected users on the remaining undetected users is suppressed via soft parallel interference cancellation. Then, the time offset (TO) of each undetected user is estimated. To speed up the MUD, interference cancellation is performed after only a few decoder iterations of the detected users, and the TO estimator is designed taking into account the residual multiple access interference. A low-complexity non-data-aided TO estimator that estimates the TO of each undetected user separately is proposed. The proposed technique significantly improves the synchronization performance of weak users under high near-far conditions compared to the full interference case. Assuming Gaussian distributed log-likelihood ratios at the decoder outputs, we directly relate the missed detection probability of a desired user to the root-mean-squared error of the detected user's data sequences. The extrinsic information transfer chart of the decoder is used to analyze the acquisition performance of the desired user with the number of decoder iterations of the detected users. An upper bound for the missed detection probability of the proposed estimator is derived.

Iterative Decoding using Eigenmessages

The eigenmessage approach to iterative decoding introduces a degree of nonlocality into a belief propagation decoder by representing an entire set of messages around a cycle of the Tanner graph as a linear operator. The eigenvector for the operator represents a fixed point of the belief propagation algorithm around a cycle, with incident messages fixed. A multiple eigenmessage approach is also presented, in which messages around several cycles are simultaneously expressed. The eigenmessage approach may be applied to any graph with cycles, but we demonstrate its use on LDPC decoding. In this setting, computational results compare eigenmessage methods with conventional belief propagation decoding showing, using simulation and EXIT charts, that the eigenmessage approaches slightly reduce the number of decoder iterations compared to belief propagation decoding while preserving the probability of error of conventional decoding.

The UMTS Turbo Code and an Efficient Decoder Implementation Suitable for Software-Defined Radios

This paper provides a description of the turbo code used by the UMTS third-generation cellular standard, as standardized by the Third-Generation Partnership Project (3GPP), and proposes an efficient decoder suitable for insertion into software-defined radio architectures or for use in computer simulations. Because the decoder is implemented in software, rather than hardware, single-precision floating-point arithmetic is assumed and a variable number of decoder iterations is not only possible but desirable. Three twists on the well-known log-MAP decoding algorithm are proposed: (1) a linear approximation of the correction function used by the max* operator, which reduces complexity with only a negligible loss in BER performance; (2) a method for normalizing the backward recursion that yields a 12.5% savings in memory usage; and (3) a simple method for halting the decoder iterations based only on the log-likelihood ratios.