In this paper, we present a simplification of log-BP algorithm which is able to reduce iterative times of decoding algorithm and save the hardware resource of decoder for LDPC codes. This simplification designs an imp...
详细信息
ISBN:
(纸本)9780769535708
In this paper, we present a simplification of log-BP algorithm which is able to reduce iterative times of decoding algorithm and save the hardware resource of decoder for LDPC codes. This simplification designs an improved layered-iterative decoding method without reducing the decoding performance, of which speed the updating of check nodes and variable nodes. Simulation results show that the improved layered-iterative log-BP algorithm with six-time iteration exhibits similar decoding performance to the traditional log-BP algorithm with ten-time iteration. When the improved log-BP and traditional log-BP both are simulated in ten-time iteration, the SNR of improved layer-iterative method decreases about 0.25 dB than that of traditional log-BP in the BER of 1e-2.
When the code length is moderate,non-binary low-density parity-check(NB-LDPC) codes can achieve better error correcting performance than their binary counterparts at the expense of higher decoding *** check node pro...
详细信息
ISBN:
(纸本)9781538629185
When the code length is moderate,non-binary low-density parity-check(NB-LDPC) codes can achieve better error correcting performance than their binary counterparts at the expense of higher decoding *** check node processing is a major bottleneck of NB-LDPC *** this paper,Min-max decoding algorithm is proposed based on a new forward backward processing method of check nodes,select only a part of the most reliable information to the forward-backward calculation process,and change the variable nodes to check nodes(v-to-c) generation of *** this algorithm,a kind of code(768,1152) defined on GF(4) is simulated and compared with belief propagation in log domain(LOG-BP) decoding *** results show Min-max decoding algorithm reduce information storage requirements and the computational complexity,conducive to engineering implementation.
A configurable approximation Min-sum decoding algorithm for LDPC is proposed in this paper. The degradation factor of BP to MS is found and optimized based on Jacobian Logarithm and hardware working mode. The decoding...
详细信息
ISBN:
(纸本)9781450371889
A configurable approximation Min-sum decoding algorithm for LDPC is proposed in this paper. The degradation factor of BP to MS is found and optimized based on Jacobian Logarithm and hardware working mode. The decoding algorithm is configurable to satisfy different environment's need and will only need update the variable memory. The simulation is based on LDPC NR 3GPP 38.212 release and the comparison results showed the proposed configurable approximation Min-sum decoding algorithm have a better BER performance. The hardware of this proposed algorithm is based on Min-sum decoder and the extra cost is only a shifter and an adder besides the configurable memory.
In this paper, an improved belief propagation decoding algorithm was proposed for low density parity check codes. In the proposed decoding process, error bits can be detected once again after hard-decision in the conv...
详细信息
ISBN:
(纸本)9783037859391
In this paper, an improved belief propagation decoding algorithm was proposed for low density parity check codes. In the proposed decoding process, error bits can be detected once again after hard-decision in the conventional BP decoding algorithm. The detection criterion is based on check matrix characteristics and D-value between prior probability and posterior probability. Simulation results demonstrate the performance of the improved BP decoding algorithm outperform that of the conventional BP decoding algorithm.
Acoustic space is made up of phonemes, and it can be modeled using universal background model (UBM). Therefore, there are some relations between the phonemes and Gaussian mixture components of the UBM. This paper repr...
详细信息
ISBN:
(纸本)9781618392701
Acoustic space is made up of phonemes, and it can be modeled using universal background model (UBM). Therefore, there are some relations between the phonemes and Gaussian mixture components of the UBM. This paper represents these relations by proposing a response probability (RP) model, which describes the location information of speech observations within the whole acoustic space. At decoding stage, proposed RP model is fused with traditional acoustic model (AM) and language model (LM). After integrating RP, the decoder is guided to weaken or enhance different path candidates respectively and directed to extend the most promising paths. Experiments conducted on Mandarin broadcasting speech show that character error rate is relatively reduced by 9.15% when RP model is used and by 11.89% when an improved RP model is used.
As the first realisation of Fountain Codes, Luby Transform (LT) codes provide high reliability and scalability and low complexities for data transmission in networks. Two basic algorithms, Belief Propagation (BP) and ...
详细信息
ISBN:
(纸本)9789811065712;9789811065705
As the first realisation of Fountain Codes, Luby Transform (LT) codes provide high reliability and scalability and low complexities for data transmission in networks. Two basic algorithms, Belief Propagation (BP) and Gaussian Elimination (GE), were introduced to decode LT codes. However, both of them execute their decoding process only after all the encoded symbols have been received by decoder, which results in the waste of time, storage space and computing resource. In this paper, an improved decoding algorithm termed on the fly belief propagation (OFBP) for LT codes is proposed. Based on the BP algorithm, OFBP performs the decoding processing once each encoded symbol arrives thus distributing the decoding work during all symbols reception. Compared with the traditional BP algorithm, the actual decoding time of the proposed algorithm is highly shortened. Moreover, without processing all the encoded symbols, the actual storage space and decoding complexity are greatly reduced while maintaining the same performance relative to the traditional BP decoding scheme.
This paper is concerned with the design and performance of non-binary LDPC-coded differential modulation systems. A low-complexity joint detection/decoding method for non-coherent demodulation is proposed, in which th...
详细信息
ISBN:
(纸本)9781479913213
This paper is concerned with the design and performance of non-binary LDPC-coded differential modulation systems. A low-complexity joint detection/decoding method for non-coherent demodulation is proposed, in which the hard-message-passing strategy is used for a joint factor graph. It combines trellis-based differential detection aided with channel prediction and the reliability-based decoding of nonbinary LDPC codes introduced in [1]. The Max-Log-MAP algorithm with soft-in hard-out is used for the differential detection. Simulation results show that the proposed method can offer good performances with a greatly reduced complexity.
We propose a decoding algorithm for the t-EC/AUED code proposed by Boinck and Tilborg. The proposed algorithm also reveals some remarkable properties of the code.
We propose a decoding algorithm for the t-EC/AUED code proposed by Boinck and Tilborg. The proposed algorithm also reveals some remarkable properties of the code.
This paper proposes a novel decoding algorithm by integrating both steady speech segments and observations' location information into conventional path extension framework. First, speech segments which possess sta...
详细信息
ISBN:
(纸本)9781467325073;9781467325066
This paper proposes a novel decoding algorithm by integrating both steady speech segments and observations' location information into conventional path extension framework. First, speech segments which possess stable spectrum are extracted. Second, a preliminarily improved algorithm is given by modifying traditional inter-HMM extension framework using the detected steady segments. Then, at probability calculation stage, response probability (RP), which represents location information of observations within acoustic feature space, is further incorporated into decoding. Thus, RP directs the decoder to enhance/weaken path candidates that get through the front end steady-segment-based decoding. Experiments conducted on Mandarin speech recognition show that character error rate of proposed algorithm achieves a 4.6% relative reduction when compared with a system in which only steady segment is used, and run time factor achieves a 10.0% relative reduction when compared with a system in which only RP is used.
This paper presents a novel hardware-oriented decoding algorithm in the log-domain for non-binary LDPC codes over GF(2(m)). As for max-log-SPA, only summations and comparisons are required in this new algorithm. Durin...
详细信息
ISBN:
(纸本)9781457717284;9781457717291
This paper presents a novel hardware-oriented decoding algorithm in the log-domain for non-binary LDPC codes over GF(2(m)). As for max-log-SPA, only summations and comparisons are required in this new algorithm. During the vertical update, these two operations are divided into layers based on the distribution of variable vectors that satisfy the check function. The number of additions during the vertical update is reduced by a factor of approximately p-2 without a performance loss, where p is the row weight of the parity check matrix.
暂无评论