A Hybrid ARQ Scheme Based on Shortened Low-Density Parity-Check Codes

A Hybrid ARQ Scheme Based on Shortened Low-Density Parity-Check Codes
复制标题

DOI:
10.1109/wcnc.2008.20
复制
发表时间:
2008-04
期刊:
2008 IEEE Wireless Communications and Networking Conference
影响因子:
--
通讯作者:
T. Okamura
T. Okamura
中科院分区:
其他
文献类型:
--
作者:
T. Okamura

文献摘要

被引文献

相似文献

本文介绍了基于缩短的低密度平价检查(LDPC)代码的混合ARQ(HARQ)方案。尽管基于刺穿的LDPC代码基于刺穿的LDPC代码的常规增量冗余HARQ(IR-HARQ)方案可以实现高吞吐量,刺穿减慢迭代解码的收敛性,此外,LDPC代码最初设计的最初是高速公路通常比每个迭代的复杂性都低于每个迭代的复杂性。低率代码。这使得以高速率计算复杂性成为常规IR-HARQ方案的问题。拟议的HARQ方案使用高利率母体代码:对于重新启动请求,信息位分为较小的子块,并为其中一个子块生成了额外的奇偶校验位,以用作母亲的缩短形式代码。为了使用拟议的HARQ方案实现高吞吐量,所有子块的缩短代码都必须表现良好。采用多层型代码设计来构建满足此要求的不规则的LDPC代码。仿真结果表明,所提出的HARQ方案可以在广泛的信噪比和计算复杂性较低的范围内实现与常规IR-HAQR方案相当的吞吐量。
This paper presents a hybrid ARQ (HARQ) scheme based on shortened low-density parity-check (LDPC) codes. Although conventional incremental redundancy HARQ (IR-HARQ) schemes based on punctured LDPC codes can achieve high throughput, puncturing slows the convergence of iterative decoding, and moreover, LDPC codes originally designed to be high-rate generally have lower decoding complexity for each iteration than low-rate codes. This makes computational complexity at high rates a problem for conventional IR-HARQ schemes. The proposed HARQ scheme uses a high-rate mother code: for a retransmission request, information bits are divided into smaller sub-blocks, and additional parity bits are generated for one of the sub-blocks to be used as a shortened form of the mother code. In order to achieve high throughput with the proposed HARQ scheme, it is necessary for the shortened codes of all the sub-blocks to perform well. A multi-edge type code-design is employed to construct irregular LDPC codes that meet this requirement. Simulation results show that the proposed HARQ scheme can achieve throughput comparable to that of a conventional IR-HAQR scheme over a wide range of signal-to-noise ratios and with lower computational complexity.