RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        Construction of Structured q-ary LDPC Codes over Small Fields Using Sliding-Window Method

        Haiqiang Chen,Yunyi Liu,Tuanfa Qin,Haitao Yao,Qiuling Tang 한국통신학회 2014 Journal of communications and networks Vol.16 No.5

        In this paper, we consider the construction of cyclicand quasi-cyclic structured q-ary low-density parity-check (LDPC)codes over a designated small field. The construction is performedwith a pre-defined sliding-window, which actually executes the regularmapping from original field to the targeted field under certainparameters. Compared to the original codes, the new constructedcodes can provide better flexibility in choice of code rate, codelength and size of field. The constructed codes over small fields withcode length from tenths to hundreds perform well with q-ary sumproductdecoding algorithm (QSPA) over the additive white Gaussiannoise channel and are comparable to the improved spherepackingbound. These codes may found applications in wirelesssensor networks (WSN), where the delay and energy are extremelyconstrained.

      • KCI등재

        Iterative Reliability-Based Modified Majority-Logic Decoding for Structured Binary LDPC Codes

        Haiqiang Chen,Lingshan Luo,Youming Sun,Xiangcheng Li,Haibin Wan,Liping Luo,Tuanfa Qin 한국통신학회 2015 Journal of communications and networks Vol.17 No.4

        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 algorithminclude 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.

      • KCI등재

        Reliability-Based Iterative Proportionality-logic Decoding of LDPC Codes with Adaptive Decision

        Youming Sun,Haiqiang Chen,Xiangcheng Li,Lingshan Luo,Tuanfa Qin 한국통신학회 2015 Journal of communications and networks Vol.17 No.3

        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) Syndromemessages 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.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼