In this paper, both the high-complexity near-ML list decoding and the low-complexity beliefpropagation decoding are tested for some well-known regular and irregular LDPC codes. The complexity and performance trade-of...
详细信息
In this paper, both the high-complexity near-ML list decoding and the low-complexity beliefpropagation decoding are tested for some well-known regular and irregular LDPC codes. The complexity and performance trade-off is shown clearly and demonstrated with the paradigm of hybrid decoding. For regular LDPC code, the SNR-threshold performance and error-floor performance could be improved to the optimal level of ML decoding if the decoding complexity is progressively increased, usually corresponding to the near-ML decoding with progressively increased size of list. For irregular LDPC code, the SNR-threshold performance and error-floor performance could only be improved to a bottle-neck even with unlimited decoding complexity. However, with the technique of CRC-aided hybrid decoding, the ML performance could be greatly improved and approached with reasonable complexity thanks to the improved code-weight distribution from the concatenation of CRC and irregular LDPC code. Finally, CRC-aided 5GNR-LDPC code is evaluated and the capacity-approaching capability is shown.
Severe intersymbol interference (ISI) is one of the main obstacles for reliable signal reception in ATSC DTV systems. Decision feedback equalizers (DFEs) are commonly used to suppress the ISI. However, DFEs may suffer...
详细信息
ISBN:
(纸本)9781479934331
Severe intersymbol interference (ISI) is one of the main obstacles for reliable signal reception in ATSC DTV systems. Decision feedback equalizers (DFEs) are commonly used to suppress the ISI. However, DFEs may suffer from error propagation due to incorrect symbol decisions from the symbol slicer. This phenomenon deteriorates the performance even more when the post-cursor ISI is strong. In order to reduce error propagation, we present a novel hybrid equalization scheme for ATSC channels. The proposed scheme consists of an adaptive decision feedback sparsening filter (DFSF), and an iterative maximum a posteriori (MAP) equalizer based on the beliefpropagation (BP) algorithm. In the first stage, instead of removing all the ISI from post cursors, the DFSF employs a modified feedback filter which leaves the strongest post-cursor ISI taps uncorrected. As a result, a long ISI channel is equalized to a sparse channel having only a small number of nonzero taps. In the second stage, a belief propagation algorithm is applied to mitigate the residual ISI. Since the channel is typically time-varying and suffers from Doppler fading, the DFSF is adapted using the least mean square (LMS) algorithm, such that the amplitude and the locations of the nonzero taps of the equalized sparse channel appear to be fixed. As such, the channel appears to be static during the second stage of equalization which consists of the BP detector. Simulation results demonstrate that the proposed scheme outperforms the traditional DFE in symbol error rate, under both static channels and dynamic ATSC channels.
Frequency-selective fading channels are encountered in many modern wireless communication systems. In order to combat the intersymbol interference (ISI) introduced by such fading, equalization is required for reliable...
详细信息
ISBN:
(纸本)9781479934331
Frequency-selective fading channels are encountered in many modern wireless communication systems. In order to combat the intersymbol interference (ISI) introduced by such fading, equalization is required for reliable symbol detection. The maximum-likelihood sequence detector is the optimal equalization scheme;however its implementation complexity increases exponentially with the channel length and thus can be prohibitively high. In this paper, we compare the performance of two practically implementable suboptimal symbol detectors, including the partial response maximum-likelihood (PRML) detector and the partial response beliefpropagation (PRBP) detector, under frequency-selective fading channels. Both detectors employ a hybrid two-stage scheme, and allow a tradeoff between performance and complexity. The first stage is a partial response equalizer implemented as a linear filter which transforms the original channel impulse response to a target impulse response with reduced ISI. The residual ISI is then cancelled in the second stage using a more sophisticated nonlinear detector. In simulations, we consider a slow fading environment and use the ITU-R 3G channel models. From the numerical results, it is shown that in frequency-selective fading wireless channels, the PRBP detector provides superior performance over both the traditional minimum mean squared error linear equalizer and the PRML detector. Due to the effect of colored noise, the PRML detector in fading wireless channels is not as effective as it is in magnetic recording applications.
At present, Low-Density Parity-Check(LDPC) codes widely used in many fields of communications have the best performance of all the Error Correcting Codes(ECC). This paper mainly studies the decoding algorithms of LDPC...
详细信息
ISBN:
(纸本)9783037851579
At present, Low-Density Parity-Check(LDPC) codes widely used in many fields of communications have the best performance of all the Error Correcting Codes(ECC). This paper mainly studies the decoding algorithms of LDPC. It proposes an improved algorithm which is named Check-Variable nodes Hybrid(CVH) algorithm on the basis of the existing algorithms. The CVH algorithm can reduce the computational complexity during the check-node update while overcome with the correlation between the variable-node news in a code with circles. As well as, comparing with the original algorithms the performance of the new one saves 0.1 and 0.3 d B than Log-likelihood Ratios(LLR) beliefpropagation(BP) and BP- based algorithms under Additive White Gaussian Noise(AWGN) channel when the Bit Error Rate(BER) falls to 410-through the simulation. This point shows that this algorithm can increase the decoding performance and reduce the error rate effectively.
In this paper a modified Offset Min-Sum decoding algorithm for Low-Density Parity Check Codes is *** this modified algorithm,the offset factor in the original Offset Min-Sum algorithm is adjusted iteratively with the ...
详细信息
In this paper a modified Offset Min-Sum decoding algorithm for Low-Density Parity Check Codes is *** this modified algorithm,the offset factor in the original Offset Min-Sum algorithm is adjusted iteratively with the assistance of the check-node computation outputs of the Normalized MinSum *** a result,the offset factor in our modified algorithm can be calculated adaptively and more efficiently according to the previous decoding procedure,which can minimize the decoding degradation compared with the beliefpropagation decoding *** simulation results show that,compared with the original Offset Min-Sum decoding algorithm,our modified algorithm can achieve noticeable performance improvement with minor extra hardware *** example,when BER is 10 5,our algorithm can achieve 0.1dB and 0.2dB decoding gain over Offset MinSum algorithm for regular and irregular LDPC codes respectively.
In this paper, an iterative soft-decision (SD) decoding algorithm for cyclic codes based on extended parity-check equations is developed. The algorithm does not necessarily utilize the algebraic properties of the code...
详细信息
ISBN:
(纸本)9781538624111
In this paper, an iterative soft-decision (SD) decoding algorithm for cyclic codes based on extended parity-check equations is developed. The algorithm does not necessarily utilize the algebraic properties of the code, but operates on transforming the systematic parity-check matrix using the soft reliability information matrix obtained from the received vector. Results show a significant performance gain when compared with the hard decision Berlekamp-Massey (B-M) and beliefpropagation (BP) algorithms, but present a similar bit error rate (BER) performance when compared to the adaptive beliefpropagation (ABP) algorithm. An important feature of the decoder is that it functions within a practical decoding time complexity, and can be generally implemented for the class of linear block codes.
Fountain codes have been suggested as an efficient solution for multimedia communications over erasure packet network. Therefore, the unequal error protection (UEP) fountain codes schemes are needed for the multimedia...
详细信息
Fountain codes have been suggested as an efficient solution for multimedia communications over erasure packet network. Therefore, the unequal error protection (UEP) fountain codes schemes are needed for the multimedia data of different importance. This paper proposed a novel technique to optimize the degree distribution of the generalized fountain codes that can provide strong UEP property. We further verify our work with simulations. Simulation results show that the proposed fountain codes have a better decoding performance than the fountain codes without optimization.
Underwater targets are used more and more frequently in modern ocean *** is important to assess the threat from an enemy target after it is detected immediately,in order to prepare quick counterattack and *** paper pr...
详细信息
Underwater targets are used more and more frequently in modern ocean *** is important to assess the threat from an enemy target after it is detected immediately,in order to prepare quick counterattack and *** paper proposes a method for underwater target threat assessment based on Bayesian *** threat model uses a hierarchy view for threat *** factors are divided into three parts:environment,target space and target *** part contains several detailed factors,which are arranged based on their causal *** factors are applied into the Bayesian Network and the probability of threat is calculated through Bayesian ***,a simulation is conducted and the method can effectively assess the target *** model has a relatively good performance and can generate the assessment with low time cost.
暂无评论