Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm

Jiang, Xueqin; Hai, Han; Wang, Huiming; Lee, Moon Ho

doi:10.1109/access.2017.2688701

Cited by 22 publications

(29 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The binary information frame length is 192 bits, and the value of q is taken to 2. The H with a lower triangular is constructed by a QC algorithm, then the G is derived through Gaussian elimination [28], [29]. The Log-FFT-BP algorithm is adopted for LDPC decoding.…”

Section: Numerical Results and Analysismentioning

confidence: 99%

Information Transmission Schemes Based on Adaptive Coded Modulation for UAV Surveillance Systems With Satellite Relays

Xue

Zhao

Tang³

2020

IEEE Access

View full text Add to dashboard Cite

To expand their search range, unmanned aerial vehicles (UAVs) used for surveillance employ satellites as relays to forward monitoring data to the UAV's command and control centers. With updated sensors, the amount of UAV detection data increases sharply, and the demand for bandwidth and transmission rates increase continuously. In this paper, the Ka-band is introduced to the satellite system as a solution instead of the Ku, C and other bands. Highly robust constant coded modulations (CCMs), such as the binary low-density parity-check (LDPC) and the coded quadrature phase shift keying (QPSK) are adopted to handle poor channel conditions caused by rain attenuation, which lead to a waste of spectral efficiency, especially in poor weather conditions; Adaptive Coded Modulation (ACM) can relieve the problems detailed above. Aiming at the problem mentioned above, we have proposed two different transmission schemes for two typical scenarios, including high quality of service (QoS) and high throughput service. The first is the so called automatic repeat request (ARQ)+ACM (target bit error rate (BER) algorithm) for high QoS, which means ARQ and ACM are employed by UAV-satellite links and satellite-center links, respectively. The second, denoted as coded cooperation (CC)+ACM (the maximum throughput algorithm) for high throughput services, designates that CC is employed for UAV-satellite links and ACM is employed for satellite-center links. Simulation results show that the ARQ+ACM scheme achieves higher spectral efficiency than CCM in cases that keep the BER below 5 10 − , and the CC+ACM scheme attains 3 to 7.5 times the spectral efficiency of CCM.

show abstract

Section: Numerical Results and Analysismentioning

confidence: 99%

Information Transmission Schemes Based on Adaptive Coded Modulation for UAV Surveillance Systems With Satellite Relays

Xue

Zhao

Tang³

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The matrix is generated by the progressive edge growth (PEG) algorithm [34,35], divided into 4-ary (Code 1) and 16-ary (Code 2) simulation, which has a maximum number of iterations of 100. Under the AWGN channel conditions and using BPSK modulation, at least 1000 error bits are collected at each SNR.…”

Section: Simulation Results and Statistical Analysismentioning

confidence: 99%

“…At a low SNR, the performance of MSMWSF algorithm is almost the same as other algorithms. According to the simulation diagram of reference [34,35,36], a higher number of binary numbers indicates a poorer performance of the WSF algorithm. From Figure 5 and Figure 6, we can see that the performance of Code 1 is better than that of Code 2, which proves the effectiveness of the algorithm proposed in this paper.…”

Section: Simulation Results and Statistical Analysismentioning

confidence: 99%

Sum of the Magnitude for Hard Decision Decoding Algorithm Based on Loop Update Detection

Meng

Zhao

Tian

et al. 2018

Sensors

View full text Add to dashboard Cite

In order to improve the performance of non-binary low-density parity check codes (LDPC) hard decision decoding algorithm and to reduce the complexity of decoding, a sum of the magnitude for hard decision decoding algorithm based on loop update detection is proposed. This will also ensure the reliability, stability and high transmission rate of 5G mobile communication. The algorithm is based on the hard decision decoding algorithm (HDA) and uses the soft information from the channel to calculate the reliability, while the sum of the variable nodes’ (VN) magnitude is excluded for computing the reliability of the parity checks. At the same time, the reliability information of the variable node is considered and the loop update detection algorithm is introduced. The bit corresponding to the error code word is flipped multiple times, before this is searched in the order of most likely error probability to finally find the correct code word. Simulation results show that the performance of one of the improved schemes is better than the weighted symbol flipping (WSF) algorithm under different hexadecimal numbers by about 2.2 dB and 2.35 dB at the bit error rate (BER) of 10−5 over an additive white Gaussian noise (AWGN) channel, respectively. Furthermore, the average number of decoding iterations is significantly reduced.

show abstract

“…In [15] the selection criterion of the PEG algorithm to locate an edge in a BG is modified in order to have a better girth value than PEG. There are other constructive heuristics in the literature that avoid small cycles [5,19]. A genetic algorithm to design a BG with a small number of nodes is given in [6].…”

Section: Introduction and Literature Reviewmentioning

confidence: 99%

A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems

2019

View full text Add to dashboard Cite

We study a bipartite graph (BG) construction problem that arises in digital communication systems. In a digital communication system, information is sent from one place to another over a noisy communication channel using binary symbols (bits). The original information is encoded by adding redundant bits, which are then used to detect and correct errors that may have been introduced during transmission. Harmful structures, such as small cycles, severely deteriorate the error correction capability of a BG. We introduce an integer programming formulation to generate a BG for a given smallest cycle length. We propose a branch-and-cut algorithm for its solution and investigate the structural properties of the problem to derive valid inequalities and variable fixing rules. We also introduce heuristics to obtain feasible solutions for the problem. The computational experiments show that our algorithm can generate BGs without small cycles in an acceptable amount of time for practically relevant dimensions.

show abstract

Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm

Cited by 22 publications

References 18 publications

Information Transmission Schemes Based on Adaptive Coded Modulation for UAV Surveillance Systems With Satellite Relays

Information Transmission Schemes Based on Adaptive Coded Modulation for UAV Surveillance Systems With Satellite Relays

Sum of the Magnitude for Hard Decision Decoding Algorithm Based on Loop Update Detection

A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems

Contact Info

Product

Resources

About