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

A Novel Iterative Reliability-Based Majority-Logic Decoder for NB-LDPC Codes

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2020年第8期67卷 1399-1403页

作者： song, suwen Cui, Hangxuan Tian, Jing Lin, Jun Wang, Zhongfeng Nanjing Univ Sch Elect Sci & Engn Nanjing 210023 Peoples R China

Non-binary low-density parity-check (NB-LDPC) codes usually exhibit much better performance than their binary counterparts. Among NB-LDPC decoding algorithms, the iterative reliability-based majority-logic decoding (MLGD) algorithms are attractive for their low computation complexity, at the cost of performance degradation. In this brief, based on the improved iterative soft reliability-based (IISRB)-MLGD algorithm, we propose a clipped-modified (CM)-IISRB algorithm, which achieves better decoding performance with lower computational complexity. First, two modifications are introduced to the IISRB algorithm, which considerably reduces the decoding complexity with negligible performance loss. Second, an unsaturated-clipping method that facilitates significant performance improvement is presented. Simulation results show that the new algorithm outperforms the IISRB by about 0.2dB for the 256-ary (255, 175) example code. Moreover, based on a new storage reduction method, an optimized architecture is developed for the CM-IISRB algorithm. Synthesis results demonstrate that the proposed decoder can achieve very low hardware complexity, comparable to that of the iterative hard reliability-based (IHRB) decoder.

关键词： Iterative decoding Reliability Complexity theory Decoding Iterative algorithms Nickel Circuits and systems Low-density parity-check codes non-binary iterative majority-logic decoding VLSI low complexity

来源：评论

学校读者我要写书评

暂无评论

Sign Aided Adaptive Noisy Gradient Descent Bit-Flipping Algorithm for LDPC Codes

Sign Aided Adaptive Noisy Gradient Descent Bit-Flipping Algo...

引用

International Conference on Computer and Communications (ICCC)

作者： Keyue Deng Yuxing Chen suwen song Zhongfeng Wang School of Electronic Science and Engineering Nanjing University Nanjing China

The adjustment factor aided noisy gradient descent bit-flipping (ANGDBF) offers a significant improvement in error correction capability compared with other gradient descent bit-flipping (GDBF) variants. However, there still exists a considerable performance gap between the ANGDBF algorithm and the belief propagation (BP) algorithm. This paper presents a sign aided adaptive noisy GDBF (SANGDBF) algorithm, in which the mean of noise perturbation shows an adaptive property, facilitating the decoding process to escape from the local maxima more effectively. Moreover, the sign of the correlation term is fully utilized to improve the reliability of the inversion function. Simulation results show that the SANGDBF algorithm can achieve about 0.5 dB coding gain compared with the ANGDBF algorithm with limited hardware overhead.

关键词： Correlation Simulation Perturbation methods Parity check codes Hardware Decoding Error correction

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity Parallel Syndrome Computation for BCH Decoders Based on Cyclotomic FFT

Low-Complexity Parallel Syndrome Computation for BCH Decoder...

引用

IEEE Asia-Pacific Conference on Circuits and Systems

作者： Xinyuan Qiao Keyue Deng Yuxing Chen suwen song Zhongfeng Wang School of Electronic Science and Engineering Nanjing University Nanjing China

The long binary Bose-Chaudhuri-Hochquenghem (BCH) codes are widely used in communication and storage systems, and massive-parallel BCH decoders are expected to satisfy the requirement of high throughput. However, a large parallel degree leads to a significant increase in the hardware complexity of the syndrome computation (SC) module. Considering the similarities between SC and discrete Fourier transform (DFT), this paper proposes an advanced cyclotomic fast Fourier transform (CFFT) algorithm-aided SC architecture, which fully utilizes the property of characteristic-2 fields of binary BCH codes to reduce hardware complexity. The implementation results show that the proposed CFFT-aided architecture is desirable for long binary BCH codes with the error-correction capability less than 20. For (16383, 16271, 8) BCH code over GF(2 14 ), the hardware overhead of a 128-parallel SC module is reduced by 16% compared to the state-of-the-art architecture.

关键词： Codes Fast Fourier transforms Circuits and systems Discrete Fourier transforms Asia Computer architecture Throughput

来源：评论

学校读者我要写书评

暂无评论

Efficient T-EMS Based Decoding Algorithms for High-Order LDPC Codes

引用

IEEE ACCESS 2019年 7卷 50980-50992页

作者： Tian, Jing song, suwen Lin, Jun Wang, Zhongfeng Nanjing Univ Sch Elect Sci & Engn Nanjing 210023 Jiangsu Peoples R China

Non-binary low-density parity-check (NB-LDPC) codes show larger coding gain and lower error floor than their binary counterparts in many cases. However, the existing soft decoding algorithms of NB-LDPC codes generally suffer from high computational complexity. Recently, the trellis-based extended min-sum (T-EMS) decoding algorithm has attracted much attention since it can achieve good decoding performance with high parallelism and low computational complexity. In this paper, we propose two new methods to further reduce the computational complexity and enhance the decoding performance. Firstly, we introduce, with theoretical justification, a universal scheme called threshold-based shrinking (TS) scheme, which facilitates significant reduction of computational complexity for decoding of NB-LDPC codes. Secondly, we present a modified two-extra-column (TEC) scheme and apply it to the T-EMS. Furthermore, a high-performance low-complexity decoding algorithm, named TEC-TEMS algorithm, is obtained. Combining the TS scheme with the TEC-TEMS, the new algorithm, named TS-TEC-TEMS algorithm, achieves much lower computational complexity and has negligible performance loss compared to the TEC-TEMS. For a 256-ary (256, 203) example code, compared to the T-EMS, the computational complexities of the TEC-TEMS and TS-TEC-TEMS algorithms are reduced by more than 50% and nearly 90%, respectively. Moreover, the TEC-TEMS and TS-TEC-TEMS both outperform the T-EMS by about 0.3dB when the frame error rate (FER) is around 10(-5).

关键词： Error correction codes nonbinary low-density parity-check (NB-LDPC) codes min-sum decoding algorithm low computational complexity forward error correction (FEC)

来源：评论

学校读者我要写书评

暂无评论

A New Probabilistic Gradient Descent Bit Flipping Decoder for LDPC Codes

A New Probabilistic Gradient Descent Bit Flipping Decoder fo...

引用

IEEE International Symposium on Circuits and Systems (IEEE ISCAS)

作者： Cui, Hangxuan Lin, Jun song, suwen Wang, Zhongfeng Nanjing Univ Sch Elect Sci & Engn Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781728103976

Probabilistic gradient descent bit-flipping (PGDBF) is the state-of-the-art hard-decision algorithm for decoding low-density parity-check (LDPC) codes on binary symmetric channel (BSC). However, there still exists a considerable performance gap between the PGDBF algorithm and soft-decision algorithms, especially in the error-floor region. To bridge this performance gap, a tabu-list aided PGDBF (T-PGDBF) algorithm is proposed in this paper. In the T-PGDBF algorithm, a tabu-list is employed to help the decoding escape from trapping sets, which is the main cause of the error-floor phenomenon. The bits which are flipped in the current iteration will be added to the tabu-list to prevent them being flipped in the next iteration. Simulation results show that the T-PGDBF algorithm offers a significant performance gain when compared to the PGDBF algorithm, which can reach that of soft-decision algorithms. We also present the hardware architecture to implement the T-PGDBF algorithm. Synthesis results show that the improved performance offered by the T-PGDBF algorithm can be obtained with a small hardware overhead.

关键词： Probabilistic gradient descent bit-flipping low-density parity-check codes tabu-list trapping sets high-throughput decoder

来源：评论

学校读者我要写书评

暂无评论

A Novel Low-Complexity Joint Coding and Decoding Algorithm for NB-LDPC Codes

A Novel Low-Complexity Joint Coding and Decoding Algorithm f...

引用

IEEE International Symposium on Circuits and Systems (IEEE ISCAS)

作者： song, suwen Tian, Jing Lin, Jun Wang, Zhongfeng Nanjing Univ Sch Elect Sci & Engn Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781728103976

Non-binary low-density parity-check (NB-LDPC) codes exhibit a much better performance than their binary counterparts, especially for moderate codeword length and high-order modulation. However, their decoding algorithms suffer from very high computational complexity. In this paper, a low-complexity algorithm is proposed, named parity-check erased algorithm (PCEA), where an additional parity check bit is added to each symbol of the codeword when encoding and a series of simple operations are performed based on these bits during decoding. As a universal joint coding and decoding algorithm, the PCEA can be combined with arbitrary NB-LDPC encoding schemes and decoding algorithms based on message passing. The proposed algorithm facilitates significant improvement of decoding performance with a small decrease of the code rate. Additionally, it usually has an even better performance than a nearly same-rate code constructed by the original method, and requires much lower decoding complexity due to smaller size of the parity check matrix.

关键词： Non-binary low-density parity-check codes additional parity check bits joint coding and decoding algorithm low complexity

来源：评论

学校读者我要写书评

暂无评论

Redundancy-Aided Iterative Reliability-Based Majority-Logic Decoding for NB-LDPC Codes 13

Redundancy-Aided Iterative Reliability-Based Majority-Logic ...

引用

13th IEEE International Conference on ASIC

作者： song, suwen Tian, Jing Lin, Jun Wang, Zhongfeng Nanjing Univ Sch Elect Sci & Engn Nanjing Peoples R China

ISBN: (纸本)9781728107356

Non binary low-density parity-check (NB-LDPC) codes tend to exhibit much better performance than their binary counterparts while suffering from very high computational complexity. As a type of hard-decision NB-LDPC decoding algorithm, the iterative reliability-based majority-logic decoding (IRB-MLGD) algorithms are attractive for their low computation complexity, coming with obvious performance degradation. Aiming at improving the error-correction performance, in this paper, we introduce few redundant bits to the original NB-LDPC encoding and the corresponding checksum operations to the improved iterative soft reliability-based (IISRB)-MLGD. Based on the joint coding and decoding method, the obtained redundancy-aided (RA)-IISRB decoding algorithm shows significant performance improvement while maintaining the low-complexity property. Simulation results demonstrate that the proposed algorithm can achieve a more than 1.0dB extra coding gain over the original IISRB with a slight decrease of code rate.

关键词： Non binary low-density parity-check codes majority-logic decoding joint coding and decoding random disturbance low complexity

来源：评论

学校读者我要写书评

暂无评论

QuEChERS EMR-Lipid结合超高效液相色谱-串联质谱法测定动物源食品中16种喹诺酮类药物残留

引用

分析仪器 2023年第1期 68-73页

作者：袁荷芳高蕙文宋淑文耿成钢余花常州市食品药品纤维质量监督检验中心常州213000

目的:建立一种QuEChERS EMR-Lipid结合超高效液相色谱-串联质谱(UPLC-MS/MS)法同时测定动物源性食品中16种喹诺酮类药物残留的分析方法。方法:前处理利用酸化乙腈实现快速高效的蛋白沉淀萃取,使用增强型脂质去除净化管(QuEChERS EMR-Lip... 详细信息

目的:建立一种QuEChERS EMR-Lipid结合超高效液相色谱-串联质谱(UPLC-MS/MS)法同时测定动物源性食品中16种喹诺酮类药物残留的分析方法。方法:前处理利用酸化乙腈实现快速高效的蛋白沉淀萃取,使用增强型脂质去除净化管(QuEChERS EMR-Lipid)和EMR-Lipid反萃管进一步净化,氮吹,用0.1%甲酸水溶液复溶,经C18色谱柱分离后,采用0.2%甲酸水和乙腈作为流动相进行梯度洗脱,在ESI正离子模式下,采用多反应监测(MRM)方式进行扫描。结果:各组分在5~200ng/mL范围内线性关系良好,相关系数均大于0.996。检出限为2.0μg/kg,定量限为5.0μg/kg,在3个添加水平(n=6)的回收率为79.1%~99.3%,相对标准偏差在1.6%~8.7%之间。结论:该方法快速、灵敏、准确,适用于动物源性食品中喹诺酮检测。

关键词： QuEChERS EMR-Lipid 高效液相色谱-串联质谱喹诺酮动物源食品

来源：评论

学校读者我要写书评

暂无评论

A simplified method for estimating the longitudinal dispersion coefficient in ecological channels with vegetation

引用

ECOLOGICAL INDICATORS 2018年 92卷 91-98页

作者： Huai, Wenxin Shi, Haoran song, suwen Ni, Shaoqiang Wuhan Univ State Key Lab Water Resources & Hydropower Engn S Wuhan 430072 Hubei Peoples R China Tsinghua Univ Ctr Earth Syst Sci Beijing 100084 Peoples R China

The longitudinal dispersion coefficient is an important parameter for describing the transport processes in rivers. Riparian vegetation significantly influences the velocity profile and transport processes. This paper examines the longitudinal dispersion coefficient under the condition that rigid emergent vegetation grows symmetrically along the river bank. We build a three-zone model by extending the N-zone models of Chickwendu and Boxall & Guymer. We also analyze the velocity profiles that are significantly affected by vegetation to estimate the parameters in our model. Our tests using the experimental data from a series of experiments validate the acceptable accuracy of our three-zone model.

关键词： Longitudinal dispersion coefficient Emergent vegetation Partially vegetated rivers N-zone model

来源：评论

学校读者我要写书评

暂无评论

Redundancy-Aided Iterative Reliability-Based Majority-Logic Decoding for NB-LDPC Codes

Redundancy-Aided Iterative Reliability-Based Majority-Logic ...

引用

International Conference on ASIC

作者： suwen song Jing Tian Jun Lin Zhongfeng Wang School of Electronic Science and Engineering Nanjing University P.R. China

Non-binary low-density parity-check (NB-LDPC) codes tend to exhibit much better performance than their binary counterparts while suffering from very high computational complexity. As a type of hard-decision NB-LDPC decoding algorithm, the iterative reliability-based majority-logic decoding (IRB-MLGD) algorithms are attractive for their low computation complexity, coming with obvious performance degradation. Aiming at improving the error-correction performance, in this paper, we introduce few redundant bits to the original NB-LDPC encoding and the corresponding checksum operations to the improved iterative soft reliability-based (IISRB)-MLGD. Based on the joint coding and decoding method, the obtained redundancy-aided (RA)-IISRB decoding algorithm shows significant performance improvement while maintaining the low-complexity property. Simulation results demonstrate that the proposed algorithm can achieve a more than 1.0dB extra coding gain over the original IISRB with a slight decrease of code rate.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：