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

Low-Complexity First-Two-minimum-Values Generator for Bit-Serial LDPC Decoding

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2016年第5期63卷 483-487页

作者： Lee, Jea Hack Sunwoo, Myung Hoon Ajou Univ Dept Elect & Comp Engn Suwon 443749 South Korea

This brief proposes a low-complexity first-two-minimum-values generator for a bit-serial scheme. Since the hardware complexity of generators utilizes a significant portion of the min-sum low-density parity-check decoder, a low-complexity generator is crucially important. To reduce hardware complexity, an existing bit-serial generator that finds only one minimum value instead of two has been proposed;however, it can cause bit error rate (BER) degradation. By contrast, the proposed low-complexity bit-serial generator can find the exact first two minimum values and thus can improve the BER performance. Moreover, the proposed generator does not suffer from any throughput loss since its latency is almost the same as that of the existing generator.

关键词： Area-time complexity bit-serial scheme low-complexity design low-density parity-check (LDPC) decoder minimum-value generator min-sum algorithm

来源：评论

学校读者我要写书评

暂无评论

Physical Layer Packet Coding: Inter-block Cooperative Coding for 5G 83

Physical Layer Packet Coding: Inter-block Cooperative Coding...

引用

IEEE 83rd Vehicular Technology Conference (VTC Spring)

作者： Xu, Jun Wang, Dongming Xu, Jin Xu, Xiaomei Li, Liguang You, Xiaohu Southeast Univ Natl Mobile Comm Res Lab Nanjing Jiangsu Peoples R China ZTE Corp Wireless Prod Operat Wireless Prod R&D Inst Algorithm Dept Shenzhen Peoples R China

ISBN: (纸本)9781509016983

5G sets stringent requirement on delay, which means large packets have to be segmented into shorter ones. However, the gain of turbo coding can be severely degraded due to short code size. In this paper, a novel coding and encoding scheme is proposed to obtain high coding gain under short size. The idea is to encode multiple short code blocks cooperatively to obtain a long code size. In the process of encoding, an XOR operation is conducted on certain parts of previously encoded blocks to introduce correlation. The mechanism of successive interference cancelation (SIC) receiver is applied in the decoding procedure and each code block utilizes the extrinsic information from the correlated parts from other code blocks. The scheme incurs no extra delays at reduced complexity. Simulation results show the scheme can yield equivalent or better performance than using traditional turbo code on long code block.

关键词： packet coding cooperative coding physical layer single parity code min-sum algorithm iterative decode

来源：评论

学校读者我要写书评

暂无评论

Using Self-Correction for min-sum Based Decoding algorithms of LDPC Codes 4

Using Self-Correction for Min-Sum Based Decoding Algorithms ...

引用

4th Mediterranean Conference on Embedded Computing (MECO

作者： Vityazev, V. V. Likhobabin, E. A. Ryazan State Radio Engn Univ Dept Telecommun & Fundamentals Radio Engn Ryazan Russia

Review of self-correction applied for min-sum based decoding algorithms considered. Complexity, performance, and average number of iteration for each algorithm are shown.

ISBN: (纸本)9781479989997

Review of self-correction applied for min-sum based decoding algorithms considered. Complexity, performance, and average number of iteration for each algorithm are shown.

关键词： error correction LDPC decoding min-sum algorithm a-min* algorithm a-min*-min algorithm self-correction

来源：评论

学校读者我要写书评

暂无评论

Physical Layer Packet Coding: Inter-block Cooperative Coding for 5G

Physical Layer Packet Coding: Inter-block Cooperative Coding...

引用

IEEE Vehicular Technology Conference

作者： Jun Xu Dongming Wang Jin Xu Xiaomei Xu Liguang Li Xiaohu You Algorithm Dept Wireless Product R & D Institute Wireless Product Operation ZTE Corp National Mobile Comm. Research Lab. Southeast Univ.

ISBN: (纸本)9781509016990

关键词： Packet coding Cooperative coding Physical layer Single parity code min-sum algorithm Iterative decode Physical layer coding turbo codes long code 5G mobile communication exclusive-OR function Codes Coding systems Packet coding gain

来源：评论

学校读者我要写书评

暂无评论

Adaptive-Normalized/Offset min-sum algorithm

引用

IEEE COMMUNICATIONS LETTERS 2010年第7期14卷 667-669页

作者： Wu, Xiaofu Song, Yue Jiang, ming Zhao, Chunming PLA Univ Sci & Tech Nanjing Inst Commun Engn Nanjing 210007 Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Peoples R China

An adaptive-normalized/offset min-sum (AN-/AO-MS) algorithm for decoding low-density parity-check (LDPC) codes is proposed. Unlike the normalized/offset min-sum (NMS/OMS) algorithm, the normalization/offset factor is adaptively adjusted according to the state of check nodes in each iteration. Simulation results show that the proposed AN-/AO-MS algorithm can perform better than the NMS/OMS algorithm while still preserving the low complexity of the min-sum algorithm.

关键词： Decoding min-sum algorithm low-density parity-check (LDPC) codes

来源：评论

学校读者我要写书评

暂无评论

A Modified min-sum algorithm for Low-Density Parity-Check Codes

A Modified Min-Sum Algorithm for Low-Density Parity-Check Co...

引用

IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS)

作者： Han, Wei Huang, Jianguo Wu, Fangfei NW Polytech Univ Coll Marine Engn Xian 710072 Peoples R China

ISBN: (纸本)9781424458516

A modified min-sum algorithm for low-density parity check codes is proposed in this paper. The inaccurate check node messages of the min-sum algorithm compared to the belief propagation (BP) algorithm are compensated by modified variable node messages, which is different from the normalized min-sum algorithm. The modified factor is obtained before decoding program and only one extra multiplication is needed in one cycle. So the increased complexity is fairly low. The simulation results show that the bit error rate (BER) and average number of iteration of the modified min-sum algorithm arc very close to the BP algorithm, the modified algorithm can improve the BER performance compared to the min-sum algorithm while added complexity slightly.

关键词： LDPC codes belief propagation min-sum algorithm bit error rate(BER) modified factor

来源：评论

学校读者我要写书评

暂无评论

Convergence of Weighted min-sum Decoding Via Dynamic Programming on Trees

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第2期60卷 943-963页

作者： Jian, Yung-Yih Pfister, Henry D. Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA

Applying the max-product (and sum-product) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational complexity and impressive performance in practice. Still, there is no general understanding of the conditions required for convergence or optimality of converged solutions or both. This paper presents an analysis of both attenuated max-product decoding and weighted min-sum decoding for low-density parity-check (LDPC) codes, which guarantees convergence to a fixed point when a weight factor, beta, is sufficiently small. It also shows that, if the fixed point satisfies some consistency conditions, then it must be both a linear-programming (LP) and maximum-likelihood (ML) decoding solution. For (d(v), d(c))-regular LDPC codes, the weight factor must satisfy beta(d(v) - 1) < 1 to guarantee convergence to a fixed point, whereas the results proposed by Frey and Koetter require instead that beta(d(v) - 1)(d(c) - 1) < 1. In addition, the range of the weight factor for a provable ML decoding solution is extended to 0 < beta(d(v) - 1) <= 1. In addition, counterexamples that show a fixed point might not be the ML decoding solution if beta(d(v) - 1) > 1 are given. Finally, connections are explored with recent work on the threshold of LP decoding.

关键词： Belief propagation max-product algorithm min-sum algorithm LDPC codes LP decoding

来源：评论

学校读者我要写书评

暂无评论

Novel modified min-sum decoding algorithm for low-density parity-check codes

引用

The Journal of China Universities of Posts and Telecommunications 2010年第4期17卷 1-5,46页

作者： LIU Hai-yang , QU Wen-ze, LIU Bin, LI Jiang-peng, LUO Shi-dong, CHEN Jie Institute of Microelectronics, Chinese Academy of Sciences, Beijing 100029, China [a] Institute of Microelectronics Chinese Academy of Sciences Beijing 100029 China

The problem of improving the performance of min-sum decoding of low-density parity-check （LDPC） codes is considered in this paper. Based on min-sum algorithm, a novel modified min-sum decoding algorithm for LDPC codes is proposed. The proposed algorithm modifies the variable node message in the iteration process by averaging the new message and previous message if their signs are different. Compared with the standard min-sum algorithm, the modification is achieved with only a small increase in complexity, but significantly improves decoding performance for both regular and irregular LDPC codes. Simulation results show that the performance of our modified decoding algorithm is very close to that of the standard sum-product algorithm for moderate length LDPC codes.

关键词： LDPC codes sum-product algorithm min-sum algorithm modified min-sum algorithm

来源：评论

学校读者我要写书评

暂无评论

A Modified min-sum algorithm for Low-Density Parity-Check Codes

A Modified Min-Sum Algorithm for Low-Density Parity-Check Co...

引用

2010 IEEE International Conference Conferenhce on Wireless Communications,Networking and Information Security(2010 IEEE 无线通信、网络技术与信息安全国际会议 WCNIS)

作者： Wei Han Jianguo Huang Fangfei Wu College of Marine Engineering Northwestern Polytechnical University Xi’an China

A modified min-sum algorithm for low-density parity check codes is proposed in this paper. The inaccurate check node messages of the min-sum algorithm compared to the belief propagation (BP) algorithm are compensated by modified variable node messages, which is different from the normalized min-sum algorithm. The modified factor is obtained before decoding program and only one extra multiplication is needed in one cycle. So the increased complexity is fairly *** simulation results show that the bit error rate (BER) and average number of iteration of the modified min-sum algorithm are very close to the BP algorithm, the modified algorithm can improve the BER performance compared to the min-sum algorithm while added complexity slightly.

关键词： LDPC codes belief propagation min-sum algorithm bit error rate(BER) modified factor

来源：评论

学校读者我要写书评

暂无评论

Adaptive-Normalized min-sum algorithm

Adaptive-Normalized Min-Sum Algorithm

引用

The 2010 2nd International Conference on Future Computer and Communication(第二届未来计算机与通信国际会议 ICFCC 2010)

作者： Xiaofu Wu Yue Song Long Cui Chunming Zhao ming Jiang Institute of Communications Engineering PLA Univ.of Sci.&Tech. Nanjing 210007 CHINA National Mobil Institute of Communications Engineering PLA Univ.of Sci.&Tech. Nanjing 210007 CHINA National Mobile Commun.Research Lab. Southeast University Nanjing 210096 CHINA

ISBN: (纸本)9781424458219;9781424458240

An adaptive-normalized min-sum (AN-MS) algorithm for decoding low-density parity-check (LDPC) codes is proposed. Unlike the normalized min-sum (NMS) algorithm, the normalization factor is adaptively adjusted according to the state of check nodes in each iteration. Simulation results show that the proposed AN-MS algorithm can perform better than the NMS algorithm while still preserving the low complexity of the min-sum algorithm.

关键词： decoding min-sum algorithm low-density parity-check (LDPC) codes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：