Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Outage-Limit-Approaching Protograph LDPC Codes for Slow-Fading Wireless Communications (1903.01223v2)

Published 4 Mar 2019 in cs.IT and math.IT

Abstract: Block-fading (BF) channel, also known as slow-fading channel, is a type of simple and practical channel model that can characterize the primary feature of a number of wireless-communication applications with low to moderate mobility. Although the BF channel has received significant research attention in the past twenty years, designing low-complexity outage-limit-approaching error-correction codes (ECCs) is still a challenging issue. For this reason, a novel family of protograph low-density parity-check (LDPC) codes, called root-protograph (RP) LDPC codes, has been conceived recently. The RP codes can not only realize linear-complexity encoding and high-speed decoding with the help of a quasi-cyclic (QC) structure, but also achieve near-outage-limit performance in a variety of BF scenarios. In this article, we briefly review the design guidelines of such protograph codes with the aim of inspiring further research activities in this area.

Citations (1)

Summary

We haven't generated a summary for this paper yet.