Improving LDPC Decoding Performance for 3D TLC NAND Flash by LLR Optimization Scheme for Hard and Soft Decision

Low-density parity-check (LDPC) codes have been widely adopted in NAND flash in recent years to enhance data reliability. There are two types of decoding, hard-decision and soft-decision decoding. However, for the two types, their error correction capability degrades due to inaccurate log-likelihood ratio (LLR) . To improve the LLR accuracy of LDPC decoding, this article proposes LLR optimization schemes, which can be utilized for both hard-decision and soft-decision decoding. First, we build a threshold voltage distribution model for 3D floating gate (FG) triple level cell (TLC) NAND flash. Then, by exploiting the model, we introduce a scheme to quantize LLR during hard-decision and soft-decision decoding. And by amplifying a portion of small LLRs, which is essential in the layer min-sum decoder, more precise LLR can be obtained. For hard-decision decoding, the proposed new modes can significantly improve the decoder’s error correction capability compared with traditional solutions. Soft-decision decoding starts when hard-decision decoding fails. For this part, we study the influence of the reference voltage arrangement of LLR calculation and apply the quantization scheme. The simulation shows that the proposed approach can reduce frame error rate (FER) for several orders of magnitude.

An improvement and a fast DSP implementation of the bit flipping algorithms for low density parity check decoder

<span lang="EN-US">For low density parity check (LDPC) decoding, hard-decision algorithms are sometimes more suitable than the soft-decision ones. Particularly in the high throughput and high speed applications. However, there exists a considerable gap in performances between these two classes of algorithms in favor of soft-decision algorithms. In order to reduce this gap, in this work we introduce two new improved versions of the hard-decision algorithms, the adaptative gradient descent bit-flipping (AGDBF) and adaptative reliability ratio weighted GDBF (ARRWGDBF). An adaptative weighting and correction factor is introduced in each case to improve the performances of the two algorithms allowing an important gain of bit error rate. As a second contribution of this work a real time implementation of the proposed solutions on a digital signal processors (DSP) is performed in order to optimize and improve the performance of these new approchs. The results of numerical simulations and DSP implementation reveal a faster convergence with a low processing time and a reduction in consumed memory resources when compared to soft-decision algorithms. For the irregular LDPC code, our approachs achieves gains of 0.25 and 0.15 dB respectively for the AGDBF and ARRWGDBF algorithms.</span>

A computational experimental of noise suppressing technique stand on hard decision threshold dissimilarity

Due to the extreme insistence for digital image processing, plentiful modern noise suppressing techniques are embodied of dissimilarity process and suppressing process. One of the extreme capability dissimilarity is hard decision threshold (HDT) dissimilarity, which has been recently declared in 2012, for suppressing the impulsive noisy photographs thus the computer experimental statement attempts to investigate the capability of the noise suppressing technique that is stand on HDT dissimilarity for the processed photographs, which are corrupted by fixed-intensity impulse noise (FIIN). This paper proposes the noise suppressing technique stand on HDT dissimilarity for FIIN. There are 3 primary contributions of this paper. The first contribution is the statistical average of the HDT dissimilarity of noise-free elements, which are computed from plentiful ground-truth photographs by varying window size for the best HDT window size. The second contribution is the statistical average of the HDT dissimilarity of corrupted elements, which are computed from plentiful corrupted photographs by varying outlier density for the best HDT window size. The final contribution is the statistical interrelation of the capability of the noise suppressing technique and hard consistent of HDT dissimilarity are investigated by varying the outlier denseness for the best HDT hard consistence.

Enhancement of Spectrum Sensing Performance via Cooperative Cognitive Radio ‎Networks at Low SNR

The inefficient use of spectrum is the key subject to overcome the upcoming spectrum crunch issue. This paper presents a study of performance of cooperative cognitive network via hard combining of decision fusion schemes. Simulation results presented different cooperative hard decision fusion schemes for cognitive network. The hard-decision fusion schemes provided different discriminations for detection levels. They also produced small values of Miss-Detection Probability at different values of Probability of False Alarm and adaptive threshold levels. The sensing performance was investigated under the influence of channel condition for proper operating conditions. An increase in the detection performance was achieved for cognitive users (secondary users) of the authorized unused dynamic spectrum holes (primary users) while operating in a very low signal-to-noise ratio with the proper condition of minimum total error rate.

Information Theory and Channel Coding

Chapter 9 presents the fundamentals of information theory and coding, which are required for understanding of the information measure, entropy and limits in signal transmission including the definition and derivative of the communication channel capacity. The coding theorem is separtelly presented. The chapter contains a part that defines the entropy of continuous and discrete Gaussian and uniform stochastic processes. The results of this unique analysis is essential to understand the notion of the continuous and discrete white Gaussian noise process. The block and convolutional codes, including hard decision Viterbi algorihthm are presented. The theory of iterative and turbo coding is presented in a form of a Project in the supplementary material, where several topics are defined and the related solutions are offered.

Classification of Cross-Country Ski Skating Sub-Technique Can Be Automated Using Carrier-Phase Differential GNSS Measurements of the Head’s Position

Position–time tracking of athletes during a race can provide useful information about tactics and performance. However, carrier-phase differential global navigation satellite system (dGNSS)-based tracking, which is accurate to about 5 cm, might also allow for the extraction of variables reflecting an athlete’s technique. Such variables include cycle length, cycle frequency, and choice of sub-technique. The aim of this study was to develop a dGNSS-based method for automated determination of sub-technique and cycle characteristics in cross-country ski skating. Sub-technique classification was achieved using a combination of hard decision rules and a neural network classifier (NNC) on position measurements from a head-mounted dGNSS antenna. The NNC was trained to classify the three main sub-techniques (G2–G4) using optical marker motion data of the head trajectory of six subjects during treadmill skiing. Hard decision rules, based on the head’s sideways and vertical movement, were used to identify phases of turning, tucked position and G5 (skating without poles). Cycle length and duration were derived from the components of the head velocity vector. The classifier’s performance was evaluated on two subjects during an in-field roller skiing test race by comparison with manual classification from video recordings. Classification accuracy was 92–97% for G2–G4, 32% for G5, 75% for turning, and 88% for tucked position. Cycle duration and cycle length had a root mean square (RMS) deviation of 2–3%, which was reduced to <1% when cycle duration and length were averaged over five cycles. In conclusion, accurate dGNSS measurements of the head’s trajectory during cross-country skiing contain sufficient information to classify the three main skating sub-techniques and characterize cycle length and duration.