scholarly journals Protograph LDPC Code Design For LS-MIMO 1-bit ADC Systems

Author(s):  
Thuy Van Nguyen ◽  
Hung Ngoc Dang

Recently, two emerging research topics are protograph low-density parity-check (P-LDPC) and large-scale multi-input multi-output (LS-MIMO) with low-resolution analog-to-digital (ADC) converters (LS-MIMO-LOW-ADC). In these directions, many research works have proposed 1-bit ADC as a good candidate for LS-MIMO systems in order to save both transmission power and circuit energy dissipation. However, we observed that previously reported P-LDPC codes might not have good performance for LS-MIMO systems with 1-bit ADC. Hence, we perform a re-design of the P-LDPC codes for the above systems in this paper. The new codes demonstrate a good coding gain from 0:3 dB at rate 1/2 to 0:5 dB at rate 2/3 in different LS-MIMO configurations with 1-bit ADC.

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Chakir Aqil ◽  
Ismail Akharraz ◽  
Abdelaziz Ahaitouf

In this study, we propose a “New Reliability Ratio Weighted Bit Flipping” (NRRWBF) algorithm for Low-Density Parity-Check (LDPC) codes. This algorithm improves the “Reliability Ratio Weighted Bit Flipping” (RRWBF) algorithm by modifying the reliability ratio. It surpasses the RRWBF in performance, reaching a 0.6 dB coding gain at a Binary Error Rate (BER) of 10−4 over the Additive White Gaussian Noise (AWGN) channel, and presents a significant reduction in the decoding complexity. Furthermore, we improved NRRWBF using the sum of the syndromes as a criterion to avoid the infinite loop. This will enable the decoder to attain a more efficient and effective decoding performance.


2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Yan Zhang ◽  
Feng-fan Yang ◽  
Weijun Song

This paper presents four different integer sequences to construct quasi-cyclic low-density parity-check (QC-LDPC) codes with mathematical theory. The paper introduces the procedure of the coding principle and coding. Four different integer sequences constructing QC-LDPC code are compared with LDPC codes by using PEG algorithm, array codes, and the Mackey codes, respectively. Then, the integer sequence QC-LDPC codes are used in coded cooperative communication. Simulation results show that the integer sequence constructed QC-LDPC codes are effective, and overall performance is better than that of other types of LDPC codes in the coded cooperative communication. The performance of Dayan integer sequence constructed QC-LDPC is the most excellent performance.


2018 ◽  
Vol 7 (03) ◽  
pp. 23781-23784
Author(s):  
Rajarshini Mishra

Low-density parity-check (LDPC) have been shown to have good error correcting performance approaching Shannon’s limit. Good error correcting performance enables efficient and reliable communication. However, a LDPC code decoding algorithm needs to be executed efficiently to meet cost , time, power and bandwidth requirements of target applications. Quasi-cyclic low-density parity-check (QC-LDPC) codes are an important subclass of LDPC codes that are known as one of the most effective error controlling methods. Quasi cyclic codes are known to possess some degree of regularity. Many important communication standards such as DVB-S2 and 802.16e use these codes. The proposed Optimized Min-Sum decoding algorithm performs very close to the Sum-Product decoding while preserving the main features of the Min-Sum decoding, that is low complexity and independence with respect to noise variance estimation errors.Proposed decoder is well matched for VLSI implementation and will be implemented on Xilinx FPGA family


2008 ◽  
Vol 17 (02) ◽  
pp. 333-351 ◽  
Author(s):  
K. M. S. SOYJAUDAH ◽  
P. C. CATHERINE

We introduce a recovery algorithm for low-density parity-check codes that provides substantial coding gain over the conventional method. Concisely, it consists of an inference procedure based on successive decoding rounds using different subsets of bit nodes from the bipartite graph representing the code. The technique also sheds light on certain characteristics of the sum–product algorithm and effectively copes with the problems of trapping sets, cycles, and other anomalies that adversely affect the performance LDPC codes.


Author(s):  
Hayder Khaleel AL-Qaysi ◽  
Tahreer Mahmood ◽  
Khalid Awaad Humood

The massive MIMO system is one of the main technologies in the fifth generation (5G) of telecommunication systems, also recognized as a highly large-scale system. Constantly in massive MIMO systems, the base station (BS) is provided with a large number of antennas, and this large number of antennas need high-quantization resolution levels analog-to-digital converters (ADCs). In this situation, there will be more power consumption and hardware costs. This paper presents the simulation performance of a suggested method to investigate and analyze the effects of different quantization resolution levels of ADCs on the bit error rate (BER) performance of massive MIMO system under different operating scenarios using MATLAB software. The results show that the SNR exceeds 12 dB accounts for only 0.001% of BER signals when the number of antennas 60 with low quantization a 2 bits’ levels ADCs, approximately. But when the antenna number rises to 300, the SNR exceeds 12 dB accounts for almost 0.01% of BER transmitted signals. Comparably with the BER performance of high quantization, 4 bits-quantization resolution levels ADCs with the same different antennas have a slight degradation. Therefore, the number of antennas is a very important influence factor.


2017 ◽  
Vol 2 (3) ◽  
pp. 191 ◽  
Author(s):  
Gianluigi Liva ◽  
Shumei Song ◽  
Lan Lan ◽  
Yifei Zhang ◽  
Shu Lin ◽  
...  

This survey paper provides fundamentals in the design of LDPC codes. To provide a target for the code designer, we first summarize the EXIT chart technique for determining(near-)optimal degree distributions for LDPC code ensembles. We also demonstrate the simplicity of representing codes by protographs and how this naturally leads to quasi-cyclic LDPC codes. The EXIT chart technique is then extended to the special case of protograph-based LDPC codes. Next, we present several design approaches for LDPC codes which incorporate one or more accumulators, including quasi-cyclic accumulatorbased codes. The second half the paper then surveys severalalgebraic LDPC code design techniques. First, codes based on finite geometries are discussed and then codes whose designs are based on Reed-Solomon codes are covered. The algebraic designs lead to cyclic, quasi-cyclic, and structured codes. The masking technique for converting regular quasi-cyclic LDPC codes to irregular codes is also presented. Some of these results and codes have not been presented elsewhere. The paper focuses on the binary-input AWGN channel (BI-AWGNC). However, as discussed in the paper, good BI-AWGNC codes tend to be universally good across many channels. Alternatively, the reader may treat this paper as a starting point for extensions to more advanced channels. The paper concludes with a brief discussion of open problems.


2014 ◽  
Vol 909 ◽  
pp. 338-341 ◽  
Author(s):  
Sekson Timakul ◽  
Somsak Choomchuay

In LDPC code, the structure of code's parity check matrix plays the crucial role in code performance. In this paper proposes the preliminary investigation of a designed parity check matrix from Tanner. We modify this technique in to non binary LDPC structure and decoding with FFT-SPA. We take into high code rate application more than 0.8. The result has shown that in bit error rate (BER) compare between non-binary LDPC and binary LDPC. In our results, the performance of non binary LDPC has better than binary LDPC.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 46017-46029 ◽  
Author(s):  
Hieu D. Vu ◽  
Thuy V. Nguyen ◽  
Diep N. Nguyen ◽  
Hieu T. Nguyen
Keyword(s):  

2014 ◽  
Vol 602-605 ◽  
pp. 3223-3227
Author(s):  
Hua Xu

Low encoding delay and complexity is very important for image transmission. This paper proposes a novel image transmission scheme with low encoding complexity. The proposed scheme is based on quasi-cyclic low density parity check (QC-LDPC) codes with a simple recursive encoding form (SREF QC-LDPC code) which results in low encoding complexity and delay. Constructing the SREF QC-LDPC codes in this scheme composes of two main steps, construction of the base matrix and the exponent matrix. We combine the differential evolution and protograph extrinsic information transfer (PEXIT) method to optimize the base matrix of QC-LDPC code. Consequently, the exponent matrix and the parity check matrix are constructed. Simulation results show that the proposed scheme based on SREF QC-LDPC code can provide a good tradeoff between the performance and complexity.


2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
S. Suresh Kumar ◽  
M. Rajaram

Multiantenna multicarrier code-division multiple access (MC-CDMA) technique has been attracting much attention for designing future broadband wireless systems. In addition, low-density parity-check (LDPC) code, a promising near-optimal error correction code, is also being widely considered in next generation communication systems. In this paper, we propose a simple method to construct a regular quasicyclic low-density parity-check (QC-LDPC) code to improve the transmission performance over the precoded MC-CDMA system with limited feedback. Simulation results show that the coding gain of the proposed QC-LDPC codes is larger than that of the Reed-Solomon codes, and the performance of the multiantenna MC-CDMA system can be greatly improved by these QC-LDPC codes when the data rate is high.


Sign in / Sign up

Export Citation Format

Share Document