• 제목/요약/키워드: Parity check

검색결과 273건 처리시간 0.026초

Construction of Block-LDPC Codes based on Quadratic Permutation Polynomials

  • Guan, Wu;Liang, Liping
    • Journal of Communications and Networks
    • /
    • 제17권2호
    • /
    • pp.157-161
    • /
    • 2015
  • A new block low-density parity-check (Block-LDPC) code based on quadratic permutation polynomials (QPPs) is proposed. The parity-check matrix of the Block-LDPC code is composed of a group of permutation submatrices that correspond to QPPs. The scheme provides a large range of implementable LDPC codes. Indeed, the most popular quasi-cyclic LDPC (QC-LDPC) codes are just a subset of this scheme. Simulation results indicate that the proposed scheme can offer similar error performance and implementation complexity as the popular QC-LDPC codes.

Upper Bounds for the Performance of Turbo-Like Codes and Low Density Parity Check Codes

  • Chung, Kyu-Hyuk;Heo, Jun
    • Journal of Communications and Networks
    • /
    • 제10권1호
    • /
    • pp.5-9
    • /
    • 2008
  • Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

레일리 페이딩 채널에서 파일럿 기법과 LDPC 코딩이 적용된 COFDM-CDMA의 성능 분석 (Performance of pilot-assisted coded-OFDM-CDMA using low-density parity-check coding in Rayleigh fading channels)

  • 안영신;최재호
    • 한국통신학회논문지
    • /
    • 제28권5C호
    • /
    • pp.532-538
    • /
    • 2003
  • 본 논문에서는 다중 경로 이동통신 환경에서 LDPC 코드를 COFDM-CDMA에 적용하는 기법을 제안한다. LDPC 코드는 부호화율이 증가함에 따라 AWGN 채널이나 플랫 페이딩 채널에서는 우수한 복호화 성능을 나타내지만 수신 신호의 품질이 상대적으로 열악한 다중 경로 페이딩 채널의 경우에서는 LDPC 코딩의 성능 또한 상대적으로 저하된다. SNR이 16 ㏈ 이하인 다중 경로 이동통신 환경에서 부호화율이 1:3 이하인 LDPC 코드의 복호 기능을 만분의 일 이차의 BER로 낮추기 위해서는 LDPC 코드의 패리티 정보와 함께 COFDM-CDMA 수신기의 등화기 탭 값 갱신을 위한 채널 추정 파일럿 정보를 전송 심벌에 포함시켜야 한다. 예를 들어, 일반적인 1:3 LDPC 코드로 부호화된 전송 심벌의 데이터와 패리티의 비율이 1:3이라면 제안한 방식의 LDPC 채널 부호화기는 데이터, 패리티 및 파일럿의 비율이 1:2:1이 된다. 전송 심벌에 포함되는 파일럿 정보는 채널 추정 및 등화기 탭 값 갱신에 사용될 뿐 만 아니라 이 정보를 패리티 정보와 함께 LDPC 코드의 복호화에도 사용함으로써 동일한 데이터 전송율에서 1:3, LDPC 코드보다 더 우수한 성능을 얻을 수 있다. 다중 경로 레일리 페이딩 채널 환경에서 제안한 기법을 COFDM-CDMA 시스템에 적용하여 그 성능을 분석한 결과, 제안한 방식의 성능이 순수한 LDPC 코드를 적용한 시스템에 비하여 SRN 대 BER 측면에서 더 우수한 성능을 나타냄을 확인하였다.

An Efficient Overlapped LDPC Decoder with a Upper Dual-diagonal Structure

  • Byun, Yong Ki;Park, Jong Kang;Kwon, Soongyu;Kim, Jong Tae
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제13권1호
    • /
    • pp.8-14
    • /
    • 2013
  • A low density parity check (LDPC) decoder provides a most powerful error control capability for mobile communication devices and storage systems, due to its performance being close to Shannon's limit. In this paper, we introduce an efficient overlapped LDPC decoding algorithm using a upper dual-diagonal parity check matrix structure. By means of this algorithm, the LDPC decoder can concurrently execute parts of the check node update and variable node update in the sum-product algorithm. In this way, we can reduce the number of clock cycles per iteration as well as reduce the total latency. The proposed decoding structure offers a very simple control and is very flexible in terms of the variable bit length and variable code rate. The experiment results show that the proposed decoder can complete the decoding of codewords within 70% of the number of clock cycles required for a conventional non-overlapped decoder. The proposed design also reduces the power consumption by 33% when compared to the non-overlapped design.

IEEE 802.16e 표준에 제시된 LDPC 부호의 수렴 속도 개선을 위한 복호 방법 (Decoding Method of LDPC Codes in IEEE 802.16e Standards for Improving the Convergence Speed)

  • 장민호;신범규;박우명;노종선;전인산
    • 한국통신학회논문지
    • /
    • 제31권12C호
    • /
    • pp.1143-1149
    • /
    • 2006
  • 본 논문에서는 체크 노드 분할을 이용한 변형된 반복 복호 방법 [8]을 IEEE 802.16e 표준에서 제시된 low-density parity-check(LDPC) 부호에 적용하여 복호의 수렴 속도 개선을 확인한다 또한 IEEE 802.16e에서 제시된 LDPC 부호에 가장 적합한 체크 노드 분할 방법을 제안한다. 수렴 속도 개선은 반복 횟수를 줄일 수 있다는 의미에서 계산 복잡도를 감소시킬 수 있다. 이러한 체크 노드 분할을 이용한 복호 방법은 복호기의 하드웨어 구현이 병렬 처리 방식으로 구현되기 어려운 시스템에서 효과적인 직렬 처리 방식으로 적용될 수 있다. 제시된 LDPC 부호의 변형된 반복 복호 방법은 무선 통신 시스템 환경의 실제 복호기를 구현하는데 사용될 수 있다.

DECODING OF LEXICODES S10,4

  • KIM, D.G.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제6권1호
    • /
    • pp.47-52
    • /
    • 2002
  • In this paper we propose a simple decoding algorithm for the 4-ary lexicographic codes (or lexicodes) of length 10 with minimum distance 4, write $S_{10,4}$. It is based on the syndrome decoding method. That is, using a syndrome vector we detect an error and it will be corrected an error from the four parity check equations.

  • PDF

Low Latency Algorithms for Iterative Codes

  • 최석순;정지원;배종태;김민혁;최은아
    • 한국통신학회논문지
    • /
    • 제32권3C호
    • /
    • pp.205-215
    • /
    • 2007
  • This paper presents low latency and/or computation algorithms of iterative codes of turbo codes, turbo product codes and low density parity check codes for use in wireless broadband communication systems. Due to high coding complexity of iterative codes, this paper focus on lower complexity and/or latency algorithms that are easily implementable in hardware and further accelerate the decoding speed.

Challenges and Some New Directions in Channel Coding

  • Arikan, Erdal;Hassan, Najeeb ul;Lentmaier, Michael;Montorsi, Guido;Sayir, Jossy
    • Journal of Communications and Networks
    • /
    • 제17권4호
    • /
    • pp.328-338
    • /
    • 2015
  • Three areas of ongoing research in channel coding are surveyed, and recent developments are presented in each area: Spatially coupled low-density parity-check (LDPC) codes, nonbinary LDPC codes, and polar coding.

Channel Estimation and LDPC Code Puncturing Schemes Based on Incremental Pilots for OFDM

  • Jung, Sung-Yoon;Kim, Sung-Hwan
    • ETRI Journal
    • /
    • 제32권4호
    • /
    • pp.603-606
    • /
    • 2010
  • In this letter, we propose a channel estimation algorithm based on incremental pilots. These are pilots additionally inserted after puncturing the modulated orthogonal frequency division multiplexing (OFDM) symbols to enhance channel estimation performance without lowering bandwidth efficiency. A low-density parity-check code puncturing scheme is also proposed to prevent the performance degradation due to the codeword bit loss caused by punctured OFDM symbols.

Selection-based Low-cost Check Node Operation for Extended Min-Sum Algorithm

  • Park, Kyeongbin;Chung, Ki-Seok
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권2호
    • /
    • pp.485-499
    • /
    • 2021
  • Although non-binary low-density parity-check (NB-LDPC) codes have better error-correction capability than that of binary LDPC codes, their decoding complexity is significantly higher. Therefore, it is crucial to reduce the decoding complexity of NB-LDPC while maintaining their error-correction capability to adopt them for various applications. The extended min-sum (EMS) algorithm is widely used for decoding NB-LDPC codes, and it reduces the complexity of check node (CN) operations via message truncation. Herein, we propose a low-cost CN processing method to reduce the complexity of CN operations, which take most of the decoding time. Unlike existing studies on low complexity CN operations, the proposed method employs quick selection algorithm, thereby reducing the hardware complexity and CN operation time. The experimental results show that the proposed selection-based CN operation is more than three times faster and achieves better error-correction performance than the conventional EMS algorithm.