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

IEEE TRANSACTIONS ON BROADCASTING 2009年第2期55卷 251-259页

作者： Jiang, Nan Peng, Kewu Song, Jian Pan, Chanyong Yang, Zhixing Tsinghua Univ Dept Elect Engn Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

High-throughput design approaches for quasi-cyclic (QC) low-density parity-check (LDPC) decoders are presented in this paper. Three novel schemes for the horizontal process in min-sum algorithm and its revisions are derived to reduce design and implementation complexity. The schemes can be directly applied for variant QC codes and easily pipelined to increase the operating frequency of the decoder. Some improvements of the semi-parallel architecture are proposed to enhance throughput performance and hardware efficiency. Employing the proposed approaches, QC-LDPC decoders for Chinese Digital Television Terrestrial Broadcasting (DTTB) standard are implemented using field programmable gate array (FPGA). As shown in the results, the proposed approaches can substantially improve the throughput performance, as well as the through put-and-hardware tradeoff, of decoders with semi-parallel architecture.

关键词： LDPC LDPC decoder min-sum algorithm pipeline QC-LDPC soft-decision decoder throughput

来源：评论

学校读者我要写书评

暂无评论

Image registration using BP-SIFT

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2013年第4期24卷 448-457页

作者： Zhu, Yingxuan Cheng, Samuel Stankovic, Vladimir Stankovic, Lina Syracuse Univ Dept Elect Engn & Comp Sci Syracuse NY 13244 USA Univ Oklahoma Sch Elect & Comp Engn Tulsa OK 74135 USA Univ Strathclyde Dept Elect & Elect Engn Glasgow G1 1XW Lanark Scotland

Scale Invariant Feature Transform (SIFT) is a powerful technique for image registration. Although SIFT descriptors accurately extract invariant image characteristics around keypoints, the commonly used matching approaches of registration loosely represent the geometric information among descriptors. In this paper, we propose an image registration algorithm named BP-SIFT, where we formulate keypoint matching of SIFT descriptors as a global optimization problem and provide a suboptimum solution using belief propagation (BP). Experimental results show significant improvement over conventional SIFT-based matching with reasonable computation complexity. (c) 2013 Elsevier Inc. All rights reserved.

关键词： Image registration Belief propagation SIFT RANSAC min-sum algorithm Keypoint matching Descriptors matching Image processing

来源：评论

学校读者我要写书评

暂无评论

Channel Coding Toward 6G: Technical Overview and Outlook

IEEE OPEN JOURNAL OF THE COMMUNICATIONS SOCIETY

引用

IEEE OPEN JOURNAL OF THE COMMUNICATIONS SOCIETY 2024年 5卷 2585-2685页

作者： Rowshan, Mohammad Qiu, min Xie, Yixuan Gu, Xinyi Yuan, Jinhong Univ New South Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia

Channel coding plays a pivotal role in ensuring reliable communication over wireless channels. With the growing need for ultra-reliable communication in emerging wireless use cases, the significance of channel coding has amplified. Furthermore, minimizing decoding latency is crucial for critical-mission applications, while optimizing energy efficiency is paramount for mobile and the Internet of Things (IoT) communications. As the fifth generation (5G) of mobile communications is currently in operation and 5G-advanced is on the horizon, the objective of this paper is to assess prominent channel coding schemes in the context of recent advancements and the anticipated requirements for the sixth generation (6G). In this paper, after considering the potential impact of channel coding on key performance indicators (KPIs) of wireless networks, we review the evolution of mobile communication standards and the organizations involved in the standardization, from the first generation (1G) to the current 5G, highlighting the technologies integral to achieving targeted KPIs such as reliability, data rate, latency, energy efficiency, spectral efficiency, connection density, and traffic capacity. Following this, we delve into the anticipated requirements for potential use cases in 6G. The subsequent sections of the paper focus on a comprehensive review of three primary coding schemes utilized in past generations and their recent advancements: low-density parity-check (LDPC) codes, turbo codes (including convolutional codes), and polar codes (alongside Reed-Muller codes). Additionally, we examine alternative coding schemes like Fountain codes (also known as rate-less codes), sparse regression codes, among others. Our evaluation includes a comparative analysis of error correction performance and the performance of hardware implementation for these coding schemes, providing insights into their potential and suitability for the upcoming 6G era. Lastly, we will briefly explore consider

关键词： Codes 5G mobile communication 3GPP 6G mobile communication Reliability Iterative decoding 3G mobile communication Channel coding error control coding error correction codes wireless mobile communications 5th generation 5G 6th generation 6G encoding decoding channel polarization polar codes PAD codes monomial codes CRC low-density parity-check codes LDPC codes convolutional codes turbo codes spatially coupled codes fountain codes spinal codes raptor codes Luby transform codes LT codes lattice codes nonbinary codes sparse regression codes SPARC machine learning neural codes neural decoding successive cancellation decoding beleif propagation decoing Message Passing Decoding BCJR decoding iterative decoding Viterbi decoding Fano decoding automorphism ensemble decoding min-sum algorithm bit-flipping PPV bound normal approximation coded modulation bit-interleaving puncturing shortening repetition ratecompatible codes application layer channel coding physical layer waveform non-terrestrial networks free space optical links modulation block error rate BLER frame error rate FER reliability latency complexity enhanced mobile broadband eMBB machine-type communications MTC ultra-reliable low-latency URLLC key performance indicator KPI hardware architecture waveform design

来源：评论

学校读者我要写书评

暂无评论

A Low-Complexity Decoder With Non-Uniform Quantization for Recursive BMST Codes

引用

IEEE COMMUNICATIONS LETTERS 2021年第8期25卷 2463-2467页

作者： Ai, Shengbo Zhao, Shancheng Jinan Univ Coll Informat Sci & Technol Guangzhou 510632 Peoples R China Guangdong Key Lab Data Secur & Privacy Preserving Guangzhou 510632 Peoples R China

Recursive block Markov superposition transmission (rBMST) can be used to construct high-performance spatially coupled codes. When used in power-limited scenarios, low-complexity quantized decoders are required for the rBMST codes. In this letter, we introduce an efficient decoder for rBMST codes by incorporating non-uniform quantization (NUQ) into the threshold attenuated min-sum algorithm (TAMSA). The resulting decoder is referred to as the NUQ-TAMSA. We use the hierarchical dynamic quantization algorithm to design the non-uniform quantizer. To show the effectiveness of the NUQ-TAMSA, we carry out comprehensive comparisons. Our results show that, for low-resolution quantization, performance gains as large as 0.3 dB can be obtained with the NUQ-TAMSA. Numerical results also show that, for a wide range of coding rates, 5-bits non-uniform quantization is sufficient for NUQ-TAMSA to approach the performances of the floating-point based TAMSA.

关键词： Decoding Quantization (signal) Encoding Heuristic algorithms Complexity theory Iterative decoding Mutual information Low complexity decoding min-sum algorithm non-uniform quantization recursive block Markov superposition transmission (BMST) codes

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Concatenated codes:: Serial and parallel

Concatenated codes:: Serial and parallel

引用

IEEE International Symposium on Information Theory

作者： Barg, A Zémor, G Ecole Natl Super Telecommun Bretagne F-75634 Paris France

ISBN: (纸本)0780377281

An analogy is examined between serially concatenated codes and parallel concatenations whose interleavers;are described by bipartite graphs with good expanding properties. In particular, a modified expander code construction is shown to behave very much like Forney's classical concatenated codes, though with improved decoding complexity. It is proved that these new codes achieve the Zyablov bound delta(Z) on the minimum distance. For these codes, a soft-decision, reliability-based, linear-time decoding algorithm is introduced, that corrects any fraction of errors up to almost delta(Z)/2. For the binary-symmetric channel, this algorithm's error exponent attains the Forney bound previously known only for classical (serial) concatenations.

关键词： bipartite-graph codes concatenated codes expander codes Forney bound min-sum algorithm soft-decision decoding Zyablov bound

来源：评论

学校读者我要写书评

暂无评论

Quantization and quantization sensitivity of soft-output product codes for fast-speed applications

Quantization and quantization sensitivity of soft-output pro...

引用

IEEE/Sarnoff Symposium on Advances in Wired and Wireless Communication

作者： Hu, RY Li, J Kurtas, E Lehigh Univ Dept Elect & Comp Engn Bethlehem PA 18015 USA

ISBN: (纸本)0780382196

This paper investigates two quantization schemes on three soft-output message-passing decoding algorithms for 2-dimensional product codes. Quantization sensitivity on code rates and channel conditions is also investigated. The surprising yet encouraging result is that a simple (3,1) uniform quantization scheme on the min-sum algorithm results in the best overall quality in terms of space, performance and complexity.

关键词： product codes quantization sum-product algorithm min-sum algorithm message-passing soft decoding

来源：评论

学校读者我要写书评

暂无评论

Design and FPGA Implementation of a Quasi-Cyclic LDPC Decoder 6th

Design and FPGA Implementation of a Quasi-Cyclic LDPC Decode...

引用

6th International Conference on Communications, Signal Processing, and Systems (ICCSPS)

作者： Zhao, Honglin Zhang, Haiyue Harbin Inst Technol Xidazhijie 92 Harbin 150006 Heilongjiang Peoples R China

ISBN: (纸本)9789811065712;9789811065705

The excellent error correction performance of Low-Density Parity Check code has made it widely used in many modern communication systems, including space communication system. This paper describes a design and FPGA implementation of a quasi-cyclic LDPC decoder based on min-sum algorithm. The partially parallel design solves the contradiction between the consumption of hardware resource and decoding efficiency. The decoder achieves up to a BER of 10(-3) at 4 dB, and a throughput of 300 Mbps per iteration for a code length of 8176.

关键词： LDPC min-sum algorithm Partially parallel decoder FPGA

来源：评论

学校读者我要写书评

暂无评论

A Novel Truncation Rule for the EMS Decoding of Non-binary LDPC Codes 12

A Novel Truncation Rule for the EMS Decoding of Non-binary L...

引用

12th International Conference on Signal Processing and Communications (SPCOM)

作者： Deka, Kuntal Rajesh, A. Bora, P. K. Indian Inst Technol Goa Farmagudi India Indian Inst Technol Guwahati Gauhati India

ISBN: (纸本)9781538638217

This paper presents a novel truncation rule for the extended min-sum (EMS) decoding of non-binary low-density parity-check (NB-LDPC) codes. The conventional NB-LDPC decoders involve vector-messages of length equal to the field size q. The complexity of these decoders increases significantly as q increases. In the EMS algorithm, the vector-messages are truncated by discarding the less-likely symbols. In this paper, we propose a truncation rule so that the lengths of the vector-messages are reduced to the so-far best limit without compromising on the error correction capability. We devise a proximity matrix which helps to identify the essential components of a vector-message for truncation. The proposed truncation rule has been applied to several NB-LDPC codes of different field sizes. Simulation results for these codes show that the proposed rule can achieve the maximum truncation with negligible performance loss.

关键词： Non-binary LDPC codes min-sum algorithm EMS algorithm truncation rule

来源：评论

学校读者我要写书评

暂无评论

Analysis of Performance and Implementation Complexity of Simplified algorithms for Decoding Low-Density Parity-Check codes

Analysis of Performance and Implementation Complexity of Sim...

引用

Globecom Workshops

作者： Chandrasetty, Vikram Arkalgud Aziz, Syed Mahfuzul Univ S Australia Sch Elect & Informat Engn Mawson Lakes SA 5095 Australia

ISBN: (纸本)9781424488650

This paper presents a novel technique to significantly reduce the implementation complexity of Low-Density Parity-Check (LDPC) decoders. The proposed technique uses high precision soft messages at the variable nodes but scales down the extrinsic message length, which reduces the number of interconnections between variable and check nodes. It also simplifies the check node operation. The effect on performance and complexity of the decoders due to such simplification is analyzed. A prototype model of the proposed decoders compliant with the WiMax application standard has been implemented and tested on Xilinx Virtex 5 FPGA. The implementation results show that the proposed decoders can achieve significant reduction in hardware complexity with comparable decoding performance to that of min-sum algorithm based decoders. The proposed decoders are estimated to achieve an average throughput in the range of 6 - 11 Gbps, even with short code lengths.

关键词： FPGA LDPC decoder WiMax WiMax application check node operation decoding decoding field programmable gate arrays implementation complexity low density parity check codes min-sum algorithm parity check codes performance analysis simplified algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：