检索结果-内蒙古大学图书馆

EXIT-Chart Aided Design of Irregular Multiple-rate Quantum Turbo Block codes

IEEE ACCESS 2023年 11卷 96177-96195页

作者： Chandra, Daryus Ng, Soon Xin Hanzo, Lajos Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ England

We propose a novel quantum turbo short-block code, which subsumes multiple-rate quantum short-block codes (MR-QSBCs) as the outer codes and a quantum unity-rate code (QURC) as the inner code. The proposed design is denoted as MR-QSBC-QURC. More specifically, the proposed design exhibits multiple quantum coding rates despite relying only on a single quantum encoder. Moreover, the flexibility offered by the single-encoder MR-QSBCs enables us to leverage extrinsic information transfer (EXIT) chart based heuristic optimization for determining the optimal weighting in the fractional encoding of MR-QSBCs. Our simulation results show that the MR-QSBC-QURC scheme conceived performs relatively close to the ultimate limit of the quantum hashing bound. Specifically, when considering the target quantum coding rates of rQ = {0.3, 0.4, 0.5, 0.6, 0.7}, the MR-QSBC-QURC operates at a distance of D = {0.042, 0.029, 0.030, 0.024, 0.017} from the quantum hashing bound, respectively, at a quantum bit error ratio (QBER) of 10(-3).

关键词： Quantum error-correction codes quantum stabilizer codes quantum turbo codes quantum short-block codes EXIT chart rate-compatible code

来源：评论

学校读者我要写书评

暂无评论

BIC codes: Bit Insertion-Based Constrained codes With Error Correction for DNA Storage

引用

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING 2023年第3期11卷 764-777页

作者： Park, Seong-Joon Park, Hosung Kwak, Hee-Youl No, Jong-Seon Seoul Natl Univ Dept Elect & Comp Engn INMC Seoul 08826 South Korea Univ Ulsan Dept Elect Elect & Comp Engn Ulsan South Korea Chonnam Natl Univ Dept Comp Engn Gwangju 64486 South Korea

In this article, we propose a new coding algorithm for DNA storage over both error-free and error channels. For the error-free case, we propose a constrained code called bit insertion-based constrained (BIC) code. BIC codes convert a binary data sequence to multiple oligo sequences satisfying the maximum homopolymer run (i.e., run-length (RL)) constraint by inserting dummy bits. We show that the BIC codes nearly achieves the capacity in terms of information density while the simple structure of the BIC codes allows linear-time encoding and fast parallel decoding. Also, by combining a balancing technique with the BIC codes, we obtain the constrained coding algorithm to satisfy the GC-content constraint as well as the RL constraint. Next, for DNA storage channel with errors, we integrate the proposed constrained coding algorithm with a rate-compatible low-density parity-check (LDPC) code to correct errors and erasures. Specifically, we incorporate LDPC codes adopted in the 5 G new radio standard because they have powerful error-correction capability and appealing features for the integration. Simulation results show that the proposed integrated coding algorithm outperforms existing coding algorithms in terms of information density and error correctability.

关键词： Bit insertion technique constrained coding DNA storage GC-content low-density parity-check (LDPC) code maxmimum homopolymer run rate-compatible code

来源：评论

学校读者我要写书评

暂无评论

An Efficient Construction of rate-compatible Punctured Polar (RCPP) codes Using Hierarchical Puncturing

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2018年第11期66卷 5041-5052页

作者： Hong, Song-Nam Jeong, Min-Oh Ajou Univ Dept Elect & Comp Engn Suwon 16499 South Korea

In this paper, we present an efficient method to construct a good rate-compatible punctured polar (RCPP) code for incremental redundancy hybrid automatic repeat request schemes. One of the major challenges on the construction of a RCPP code is to optimize a common information set which is good for all the (punctured) polar codes in the family. Unfortunately, there is no efficient way to solve the above problem. In the proposed construction, a common information set is simply optimized for the highest-rate code in the family and then it is updated to yield an effective information set for each other code, by keeping the condition that information bits are unchanged during retransmissions. This is enabled by presenting a novel hierarchical (or reciprocal) puncturing and information-copy technique. Specifically, some information bits are copied to frozen-bit channels whose locations are carefully determined according to rate-compatible puncturing patterns. This yields an information-dependent frozen vector in the encoding part. Also, in the decoding part, the effective information sets are obtained by properly combining the common information set and the information-dependent frozen vector. More importantly, the impact of unknown frozen hits are avoided due to the special structure of the proposed hierarchical (or reciprocal) puncturing. Simulation results verify that the proposed RCPP code can yield a significant performance gain (about 2 dB) over a benchmark RCPP code where both codes use the same rate-compatible puncturing patterns but the latter uses the conventional all-zero frozen vector. Therefore, the proposed method would be crucial to construct a good RCPP code efficiently.

关键词： Polar code rate-compatible code puncturing incremental redundancy IR-HARQ

来源：评论

学校读者我要写书评

暂无评论

Design of rate-compatible Block Turbo code with a Low-Degree Generating Polynomial

引用

WIRELESS PERSONAL COMMUNICATIONS 2014年第3期77卷 1615-1628页

作者： Kwon, Kyunghoon Heo, Jun Korea Univ Sch Elect Engn Seoul South Korea

This paper presents a rate-compatible Block Turbo code (RC-BTC) with increased transmission capacity. The proposed RC-BTC uses a new algorithm called information augmenting scheme, and can achieve a higher code rate than conventional one. A new Error Location Finding (ELF) Decoding Algorithm is introduced to solve the decoding problem of the information augmenting scheme. As a result, a novel error-correcting capability of the BTC-applied Chase-ELF Hybrid Decoder, combining the previous Chase-Pyndiah algorithm and the proposed ELF algorithm, is demonstrated via Monte-Carlo simulation. In addition, the proposed code maximally increases the transmission capacity with the Chase-ELF Hybrid decoder using an information augmenting scheme.

关键词： Block Turbo code rate-compatible code IEEE 802.16e WiMAX

来源：评论

学校读者我要写书评

暂无评论

AN ENCODING SCHEME AND ENcodeR ARCHITECTURE FOR rate-compatible QC-LDPC codeS

AN ENCODING SCHEME AND ENCODER ARCHITECTURE FOR RATE-COMPATI...

引用

IEEE Workshop on Signal Processing Systems (SiPS)

作者： Mahdi, Ahmed Kanistras, Nikos Paliouras, Vassilis Univ Patras Elect & Comp Engn Dept Patras 26500 Greece

ISBN: (纸本)9781457719219

We consider the problem of rate-compatible (RC)-encoder and RC-puncturing of LDPC codes. The proposed encoder is based on a modification of MacKay encoding scheme. The introduced modification enables the application of MacKay scheme for quasi-cyclic (QC) LDPC codes combined with a proposed matrix puncturing scheme based on an also proposed parity-check matrix construction to achieve code-rate compatibility. The proposed encoding scheme and VLSI encoder architecture address the problem of encoding complexity, since about 80% of MacKay encoding algorithm complexity is linearly depended on LDPC check node degree. The proposed matrix puncturing scheme can produce good BER performance especially for high puncturing rates, where only a few parity check symbols are transmitted. A comparison with prior art in puncturing is offered, which shows superior performance of the proposed scheme, in terms of coding gain without any hardware cost.

关键词： LDPC encoding quasi-cyclic LDPC rate-compatible code hardware architecture

来源：评论

学校读者我要写书评

暂无评论

The Design of Efficiently-Encodable rate-compatible LDPC codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2009年第2期57卷 365-375页

作者： Kim, Jaehong Ramamoorthy, Aditya McLaughlin, Steven W. Samsung Elect Co Ltd Yongin South Korea Iowa State Univ Dept Elect & Comp Engn Ames IA USA Georgia Inst Technol Dept Elect & Comp Engn Atlanta GA 30332 USA

We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (tip to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing over a wide range of rates and are suitable for usage in incremental redundancy hybrid-automatic repeat request (ARQ) systems. In addition, these codes are linear-time encodable with simple shift-register circuits. For a block length of 1200 bits the codes outperform optimized irregular LDPC codes and extended irregular repeat-accumulate (elRA) codes for all puncturing rates 0.6 similar to 0.9 (base code performance is almost the same) and are particularly good at high puncturing rates where good puncturing performance has been previously difficult to achieve.

关键词： Efficient encoding low-density parity-check (LDPC) code puncturing rate-compatible code

来源：评论

学校读者我要写书评

暂无评论

Structured Puncturing for rate-compatible B-LDPC codes with Dual-Diagonal Parity Structure

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2008年第10期7卷 3692-3696页

作者： Park, Hyo Yol Kim, Kwang Soon Kim, Dong Ho Whang, Keum Chan Yonsei Univ Dept Elect & Elect Engn Seoul 120749 South Korea Seoul Natl Univ Technol Dept Media Engn Seoul 139743 South Korea

In this paper, we propose a generalized formula for generating puncturing patterns for block-type low-density parity-check (B-LDPC) codes with dual-diagonal parity structure. The proposed formula distributes punctured bits uniformly in the zigzag edge connections, as well as maximizes the minimum recovery speed and the reliability of each punctured node. Also, the proposed puncturing can be applied to any B-LDPC code with dual-diagonal parity structure and can provide efficient bitwise puncturing patterns even when the number of puncturing bits is not equal to an integer multiple of the block size. Simulation results show that the proposed punctured B-LDPC codes are better than existing punctured B-LDPC codes and even dedicated B-LDPC codes used in commercial standards.

关键词： Block-type LDPC code rate-compatible code hybrid

来源：评论

学校读者我要写书评

暂无评论

Efficient puncturing, method for rate-compatible low-density parity-check codes

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2007年第11期6卷 3914-3919页

作者： Park, Hyo Yol Kang, Jae Won Kirrit, Kwang Soon Whang, Keurn Chan Yonsei Univ Dept Elect & Elect Engn Seoul 120749 South Korea

In this paper, we propose an efficient puncturing method for LDPC codes. The proposed algorithm provides the order of variable nodes for puncturing based on the proposed cost function. The proposed cost function tries to maximize the minimum reliability among those provided from all check nodes. Also, it tries to allocate survived check nodes evenly to all punctured variable nodes. Furthermore, the proposed algorithm prevents the formation of a stopping set from the punctured variable nodes even when the amount of puncturing is quite large. Simulation results show that the proposed punctured LDPC codes per-form better than existing punctured LDPC codes.

关键词： low-density parity-check code rate-compatible code puncturing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：