• Journal of Communications and Networks
• /
• 제17권4호
• /
• pp.339-345
• /
• 2015

In this paper, we present an iterative reliability-based modified majority-logic decoding algorithm for two classes of structured low-density parity-check codes. Different from the conventional modified one-step majority-logic decoding algorithms, we design a turbo-like iterative strategy to recover the performance degradation caused by the simply flipping operation. The main computational loads of the presented algorithm include only binary logic and integer operations, resulting in low decoding complexity. Furthermore, by introducing the iterative set, a very small proportion (less than 6%) of variable nodes are involved in the reliability updating process, which can further reduce the computational complexity. Simulation results show that, combined with the factor correction technique and a well-designed non-uniform quantization scheme, the presented algorithm can achieve a significant performance improvement and a fast decoding speed, even with very small quantization levels (3-4 bits resolution). The presented algorithm provides a candidate for trade-offs between performance and complexity.

• Journal of Communications and Networks
• /
• 제17권3호
• /
• pp.213-220
• /
• 2015

In this paper, we present a reliability-based iterative proportionality-logic decoding algorithm for two classes of structured low-density parity-check (LDPC) codes. The main contributions of this paper include: 1) Syndrome messages instead of extrinsic messages are processed and exchanged between variable nodes and check nodes, which can reduce the decoding complexity; 2) a more flexible decision mechanism is developed in which the decision threshold can be self-adjusted during the iterative process. Such decision mechanism is particularly effective for decoding the majority-logic decodable codes; 3) only part of the variable nodes satisfying the pre-designed criterion are involved for the presented algorithm, which is in the proportionality-logic sense and can further reduce the computational complexity. Simulation results show that, when combined with factor correction techniques and appropriate proportionality parameter, the presented algorithm performs well and can achieve fast decoding convergence rate while maintaining relative low decoding complexity, especially for small quantized levels (3-4 bits). The presented algorithm provides a candidate for those application scenarios where the memory load and the energy consumption are extremely constrained.

• ETRI Journal
• /
• 제37권4호
• /
• pp.736-742
• /
• 2015

A serial concatenated decoding algorithm with dynamic threshold is proposed for low-density parity-check codes with short and medium code lengths. The proposed approach uses a dynamic threshold to select a decoding result from belief propagation decoding and order statistic decoding, which improves the performance of the decoder at a negligible cost. Simulation results show that, under a high SNR region, the proposed concatenated decoder performs better than a serial concatenated decoder without threshold with an Eb/N0 gain of above 0.1 dB.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.14-15
• /
• 2008

In this paper, a new iterative decoding of LDPC codes is proposed. The decoding is based on the posteriori probability of each belief propagation (BP) decoding and an additional postprocessing, that is, erasure decoding of LDPC codes. It turned out that the new method consistently improves the decoding performance on various classes of LDPC codes. For example it removes the error floor of Margulis codes effectively.

• ETRI Journal
• /
• 제25권1호
• /
• pp.1-8
• /
• 2003

This paper introduces an efficient iterative decoding method for high-dimensional block turbo codes. To improve the decoding performance, we modified the soft decision Viterbi decoding algorithm, which is a trellis-based method. The iteration number can be significantly reduced in the soft output decoding process by applying multiple usage of extrinsic reliability information from all available axes and appropriately normalizing them. Our simulation results reveal that the proposed decoding process needs only about 30% of the iterations required to obtain the same performance with the conventional method at a bit error rate range of $10^{-5}\;to\;10^{-6}$.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권4호
• /
• pp.1296-1309
• /
• 2023

In this paper, based on the soft cancellation (SCAN) bit-flipping (SCAN-BF) algorithm, a generalized SCAN bit-flipping (GSCAN-BF-Ω) decoding algorithm is carried out, where Ω represents the number of bits flipped or corrected at the same time. GSCAN-BF-Ω algorithm corrects the prior information of the code bits and flips the prior information of the unreliable information bits simultaneously to improve the block error rate (BLER) performance. Then, a joint threshold scheme for the GSCAN-BF-2 decoding algorithm is proposed to reduce the average decoding complexity by considering both the bit channel quality and the reliability of the coded bits. Simulation results show that the GSCAN-BF-Ω decoding algorithm reduces the average decoding latency while getting performance gains compared to the common multiple SCAN bit-flipping decoding algorithm. And the GSCAN-BF-2 decoding algorithm with the joint threshold reduces the average decoding latency further by approximately 50% with only a slight performance loss compared to the GSCAN-BF-2 decoding algorithm.

• 방송공학회논문지
• /
• 제13권6호
• /
• pp.892-904
• /
• 2008

센서네트워크와 같은 자원한정적인 상황에서의 비디오 부호화가 중요해짐에 따라 경량화 비디오 부호화 문제의 솔루션으로 분산비디오 부호화 기술(DVC: Distributed Video Coding)이 폭넓게 연구되고 있다. 이의 대표적인 기술인 Wyner-Ziv 부호화 기술은, 복호화기에서 영상간 유사도를 이용하여 부호화하는 현재 프레임에 대한 보조정보를 생성하고, 발생하는 잡음을 채널코드를 이용하여 제거함으로써 영상을 복원한다. 따라서 복호화기에서 보조정보를 정교하게 만들수록, 즉 제거되어야 할 잡음이 적게 생성될수록 전체적인 시스템의 부호화 효율이 좋아진다. 하지만 실제로 복호화기가 부호화하는 현재 프레임에 대한 정보 없이 정확도 높은 보조정보를 만드는 것은 상당히 어려운 일이므로, 복호되는 현재 프레임의 정보 및 그 신뢰도에 기반하여 점진적으로 보조 정보를 향상시키는 방법이 개발되었다. 하지만 복호결과를 이용하여 보조정보를 향상시키기 위해서는 복호결과 정보의 에러율에 못지않게 복호결과로부터 유효한 정보의 양 또한 중요하다. 따라서 본 논문에서는 변환영역의 Wyner-Ziv 부호화 기술에서 점진적으로 복호되는 현재 프레임에 대한 정보의 에러율 및 유효한 정보 양을 고려한 신뢰도에 기반하여 점진적으로 보조정보를 향상시키는 부호화 방법을 제안한다. 실험결과는 제안 방법이 점진적 보조정보 향상방법을 사용하지 않는 이전 변환영역 Wyner-Ziv 부호화 방법에 비해 최대 약 1.7 dB에 이르는 성능향상이 있음을 보였다.

• 방송공학회논문지
• /
• 제15권6호
• /
• pp.742-748
• /
• 2010

최근의 반복 검출 및 복호 (iterative detection and decoding : IDD) 기법에서의 연판정 방식에서는 log-likelihood ratio (LLR) 값의 신뢰도를 높이기 위해 기존의 구복호화 (sphere decoding) 방식보다는 리스트를 형성하는 구복호화방식 (list sphere decoding : LSD)이 대두되고 있다. 기존의 구복호화 방식과는 달리, 리스트 구복호화 방식은 그 성능의 우수함에도 불구하고 여러 격자 포인트들을 검출해야하므로 신호대잡음비 (signal-to-noise ratio : SNR)의 증가에 따른 복잡도의 이득을 거의 취할 수 없다. 또한 리스트 구복호화 기법은 리스트의 크기가 고정되어 있다는 점에서 비효율적이다. 본 논문에서는, 검출 과정에서 LLR에 큰 영향을 미치지 않는 격자 포인트들을 제거하는 기법을 소개한다. 이 과정은 구반경의 최적화를 바탕으로 이루어지며, 제안된 방식은 기존의 리스트 구복호화 기법과 비교하여 성능이 크게 떨어지지 않은 가운데 복잡도를 크게 감소시킨다.

• 한국군사과학기술학회지
• /
• 제17권3호
• /
• pp.336-341
• /
• 2014

When using a higher-order modulation scheme, there are variations in bit-reliability depending on the bit position in a modulation symbol. Variations of bit-reliability in the codeword block lower the decoding performance. Also, the decoding performance increases as the sum of the bit-reliabilities in the codeword block increases. This paper presents a novel hybrid automatic repeat request scheme that increases the sum of the reliabilities of the transmitted bits by lowering the modulation order, and decreases the variations of bit-reliability in the codeword block by preferentially retransmitting bits with low reliability. The proposed scheme outperforms the constellation rearrangement scheme. Furthermore, the proposed scheme also provides a good solution in cases where the size of the retransmission block is smaller than the size of the initial transmission block.

• 한국통신학회논문지
• /
• 제25권3B호
• /
• pp.464-471
• /
• 2000

The number of quantization bits of the input signals $X_k$,$Y_k$ need to be optimally determined through the trade-off between the H/W complexity and the BER performance in Turbo codes applications. Also, an effective means to incorporate a channel reliability $L_c$ in the Log-MAP-based Turbo decoding is highly required. because it has a major effect on both the complexity and the performance. In this paper, a novel bit-shifting approach that substitutes for the multiplying is proposed so as to effectively incorporate. $L_c$ in Turbo decoding. The optimal number of quantization bits of $X_k$,$Y_k$ is investigated through Monte-Carlo simulations assuming that bit-shifting approach is adopted. In addition. The effects of an incorrect estimation of noise variance on the performance of Turbo codes is investigated. There is a confined range in which the effects of an incorrect estimation can be ignored.