• Title/Summary/Keyword: Low Density Parity Check Code

Search Result 124, Processing Time 0.022 seconds

Construction of Block-LDPC Codes based on Quadratic Permutation Polynomials

  • Guan, Wu;Liang, Liping
    • Journal of Communications and Networks
    • /
    • v.17 no.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.

Further Results on Performance of LDPC coded IM-OFDM-QOS System

  • Kim, Hyeongseok;Kim, Jeongchang
    • Journal of Broadcast Engineering
    • /
    • v.24 no.7
    • /
    • pp.1221-1227
    • /
    • 2019
  • This paper describes a low-density parity-check (LDPC) coded index modulated orthogonal frequency division multiplexing with quasi-orthogonal sequence (IM-OFDM-QOS) and provides performance evaluations of the proposed system. By using QOS as the spreading code, IM-OFDM-QOS scheme can improve the reception performance than IM-OFDM-SS scheme for a given data rate. On the other hand, LDPC code is widely used to the latest wireless communication systems as forward error correction (FEC) scheme and has Shannon-limit approaching performance. Therefore, by applying LDPC code to IM-OFDM-QOS system as FEC scheme, the reception performance can be further improved. Simulation results show that significant signal-to-noise ratio (SNR) gains can be obtained for LDPC coded IM-OFDM-QOS system compared to the LDPC coded IM-OFDM-SS system and the SNR gain increases with the higher code rate.

Low Density Parity Check Codes for Hybrid ARQ System

  • Kim, Woo-Tae;Kim, Jeong-Goo;Joo, Eon-Kyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.4C
    • /
    • pp.370-378
    • /
    • 2007
  • The most appropriate low density parity check (LDPC) code for hybrid automatic repeat request (HARQ) system suitable for future multimedia communication systems is presented in this paper. HARQ system with punctured LDPC code is investigated at first. And two transmission schemes with parallel concatenated LDPC code are also presented and their performances are analyzed according to the various values of mean column weight (MCW). As a result, the parallel concatenated LDPC code with the diversity effect of information bit is considered to be more appropriate for HARQ system considering the throughput as well as error performance.

Space-Time Carrier Interferometry Techniques with Low-density Parity Check Code for High-speed Multimedia Communications

  • Chung Yeon-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.6
    • /
    • pp.728-734
    • /
    • 2006
  • Carrier interferometry code is considered as a promising scheme that provides significant performance improvement via frequency diversity effect. Space-time coding is commonly employed to achieve a performance gain through space diversity. The combination of these techniques and forward error correction coding will lead to enhanced system capacity and performance. This paper presents a low-density parity check (LDPC) coded space-time orthogonal frequency division multiplexing (OFDM) transmission scheme with carrier interferometry code for high-capacity and high-performance mobile multimedia communications. Computer simulations demonstrate that the proposed mobile multimedia transmission system offers a considerable performance improvement of approximately 9dB in terms of Eb/No in the Rayleigh fading channel with relatively low delay spread, in comparison with space-time OFDM. Performance gains are further increased, comparing with traditional OFDM systems.

  • PDF

Energy Efficiency in Wireless Sensor Networks using Linear-Congruence on LDPC codes (LDPC 코드의 Linear-Congruence를 이용한 WSN 에너지 효율)

  • Rhee, Kang-Hyeon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.3
    • /
    • pp.68-73
    • /
    • 2007
  • Recently, WSN(wireless sensor networks) consists of several sensor nodes in sensor field. And each sensors have the enforced energy constraint. Therefore, it is important to manage energy efficiently. In WSN application system, FEC(Forward error correction) increases the energy efficiency and data reliability of the data transmission. LDPC(Low density parity check) code is one of the FEC code. It needs more encoding operation than other FEC code by growing codeword length. But this code can approach the Shannon capacity limit and it is also can be used to increase the data reliability and decrease the transmission energy. In this paper, the author adopt Linear-Congruence method at generating parity check matrix of LDPC(Low density parity check) codes to reduce the complexity of encoding process and to enhance the energy efficiency in the WSN. As a result, the proposed algorithm can increase the encoding energy efficiency and the data reliability.

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
    • /
    • v.10 no.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.

Analysis of Performance according to LDPC Decoding Algorithms (저밀도 패리티 검사부호의 복호 알고리즘에 따른 성능 비교 분석)

  • Yoon, Tae Hyun;Park, Jin Tae;Joo, Eon Kyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.11
    • /
    • pp.972-978
    • /
    • 2012
  • LDPC (low density parity check) code shows near Shannon limit performance by iterative decoding based on sum-product algorithm (SPA). Message updating procedure between variable and check nodes in SPA is done by a scheduling method. LDPC code shows different performance according to scheduling schemes. The conventional researches have been shown that the shuffled BP (belief propagation) algorithm shows better performance than the standard BP algorithm although it needs less number of iterations. However the reason is not analyzed clearly. Therefore the reason of difference in performance according to LDPC decoding algorithms is analyzed in this paper. 4 cases according to satisfaction of parity check condition are considered and compared. As results, the difference in the updating procedure in a cycle in the parity check matrix is considered to be the main reason of performance difference.

Protograph-Based Block LDPC Code Design for Marine Satellite Communications (해양 위성 통신을 위한 프로토그래프 기반 블록 저밀도 패리티 검사 부호 설계)

  • Jeon, Ki Jun;Ko, Byung Hoon;Myung, Se-Chang;Lee, Seong Ro;Kim, Kwang Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.7
    • /
    • pp.515-520
    • /
    • 2014
  • In this paper, the protograph-based block low density parity check (LDPC) code, which improves the performance and reduces the encoder/decoder complexity than the conventional Digital Video Broadcasting Satellite Second Generation (DVB-S2) LDPC code used for the marine satellite communication, is proposed. The computer simulation results verify that the proposed protograph-based LDPC code has the better performance in both the bit error rate (BER) and the frame error rate (FER) than the conventional DVB-S2 LDPC code. Furthermore, by analyzing the encoding and decoding computational complexity, we show that the protograph-based block LDPC code has the efficient encoder/decoder structure.

A Design Method of Multi-Rate Low Density Parity Check Code (다수의 코드율이 가능한 저밀도 패러티 체크 코드의 설계 방법)

  • Hwang, Sung-Hee;Kim, Jin-Han;Park, Hyun-Soo
    • Transactions of the Society of Information Storage Systems
    • /
    • v.3 no.3
    • /
    • pp.126-128
    • /
    • 2007
  • 일반적으로 주어진 하나의 H matrix 로 다수의 코드율을 가지는 코드화가 가능하다. 하지만 Low Density Parity Check(LDPC) 코드의 H matrix는 H matrix 내의 1의 개수와 위치에 따라 그 성능이 달라짐으로 해서 하나의 H matrix로 다수의 코드율을 대응하기 위한 설계 방법이 요구된다. H matrix 의 성능은 일반적으로 girth나 minimum distance에 의해 좌우되고 H matrix의 1의 위치에 따라 달라진다. 본 논문에서는 H matrix의 girth 와 minimum distance에 입각한 다수 개의 코드율이 대응 가능한 LDPC code의 H matrix 설계 방법을 제시하고자 한다. 이렇게 함으로써 하나의 H matrix로 다수의 코드율에 따른 각각의 성능을 일정 수준 이상 유지하는 multi-rate LDPC code가 가능하다.

  • PDF

Low-Complexity Multi-size Cyclic-Shifter for QC-LDPC Codes

  • Kang, Hyeong-Ju;Yang, Byung-Do
    • ETRI Journal
    • /
    • v.39 no.3
    • /
    • pp.319-325
    • /
    • 2017
  • The decoding process of a quasi-cyclic low-density parity check code requires a unique type of rotator. These rotators, called multi-size cyclic-shifters (MSCSs), rotate input data with various sizes, where the size is the amount of data to be rotated. This paper proposes a low-complexity MSCS structure for the case when the sizes have a nontrivial common divisor. By combining the strong points of two previous structures, the proposed structure achieves the smallest area. The experimental results show that the area reduction was more than 14.7% when the proposed structure was applied to IEEE 802.16e as an example.