<P>The min-sum algorithm as an approximation of the sum-product algorithm (SPA) for decoding of LDPC codes has much lower computational complexity, but slightly worse performance than the SPA. However, severe performance degradation might occur ...
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=A107455079
2019
-
SCOPUS,SCIE
학술저널
109-112(4쪽)
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
<P>The min-sum algorithm as an approximation of the sum-product algorithm (SPA) for decoding of LDPC codes has much lower computational complexity, but slightly worse performance than the SPA. However, severe performance degradation might occur ...
<P>The min-sum algorithm as an approximation of the sum-product algorithm (SPA) for decoding of LDPC codes has much lower computational complexity, but slightly worse performance than the SPA. However, severe performance degradation might occur when it is realized in hardware due to the finite precision effect, especially in two-bit precision. In order to overcome this problem, we propose a two-bit precision decoding algorithm. The proposed algorithm employs one of several decoders adaptively, based on the syndrome weight of the estimated decoder output every iteration. Numerical results show that it has similar performance to the SPA over the binary symmetric channel.</P>
Coverage Probability of 3-D Mobile UAV Networks
Optimal Multipath TCP Offloading Over 5G NR and LTE Networks
DOTA: Physical-Layer Decomposing and Threading for ZigBee/Wi-Fi Co-Transmission