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

reduction of decoding complexity of trellises for BCM

IEE PROCEEDINGS-COMMUNICATIONS 1999年第2期146卷 82-88页

作者： Petronio, MA Carrasco, RA Staffordshire Univ Sch Engn & Adv Technol Beaconside ST18 0AD Staffs England

Block-coded modulation (BCM) combines bandwidth-efficient modulation techniques with error-correction capabilities to allow efficient data transmission over communication channels. The disadvantage of this technique, however, is the complexity of the trellis used in the Viterbi decoding, process. The authors address this problem and propose a method for the reduction of decoding complexity. Optimal sectionalisation has been identified as an appropriate technique and it is applied to trellises of BCM schemes based on a set of new objective functions. The resulting sectionalisation algorithm has been applied to various BCM schemes including 4-PSK, 8-PSK and 16-PSK and a complexity reduction of approximately 20% is achieved. Extensive simulation las shown that both original and sectionalised trellises have the same performance: over Rayleigh, K = 6 Rician and K = 10 Rician fading channels. Furthermore, a comparison between the considered BCM schemes and ring-TCM is provided in term of code performance and decoding complexity.

关键词： computational complexity modulation coding communication channels error-correction capabilities objective functions block-coded modulation data transmission 16-PSK Rician channels block codes Rayleigh fading channels Modulation and coding methods Rayleigh channels bandwidth-efficient modulation techniques Rician fading channels Viterbi decoding optimal sectionalisation BCM phase shift keying trellises 8-PSK Codes ring-TCM 4-PSK decoding complexity reduction

来源：评论

学校读者我要写书评

暂无评论

Low-latency low-complexity heap-based extended min-sum algorithms for non-binary low-density parity-check codes

引用

IET COMMUNICATIONS 2015年第9期9卷 1191-1198页

作者： Hwang, Youngjun Yang, Kyeongcheol Cheun, Kyungwhoon Pohang Univ Sci & Technol Dept Elect Engn Pohang 790784 Gyeongbuk South Korea

The extended min-sum (EMS) and improved EMS (I-EMS) algorithms for non-binary low-density parity-check codes over GF(q) significantly reduce the decoding complexity with an acceptable performance degradation, but they suffer from high latency because of many serial computations, including a sorting process. On the other hand, the trellis-based EMS algorithm can greatly reduce the latency, but it does not solve the complexity problem in high-order fields (q >= 64). To improve the latency problem with low-complexity advantages, the authors propose heap-based EMS (H-EMS) and heap-based I-EMS (HI-EMS) algorithms that are modifications of the EMS and I-EMS algorithms, respectively. The authors also propose double H-EMS and double HI-EMS algorithms trading off the latency against the performance by heaping messages twice. Numerical results show that the H-EMS algorithm has 2.74-9.52 times lower latency than the EMS algorithm with a negligible performance degradation over a wide range of code rates, whereas the HI-EMS algorithm has 1.20-1.62 times lower latency than the I-EMS algorithm. Furthermore, the proposed algorithms may be employed regardless of the decoding schedules.

关键词： decoding parity check codes Galois fields low-latency low-complexity heap-based extended min-sum algorithms nonbinary low-density parity-check codes improved EMS algorithms I-EMS algorithms GF(q) decoding complexity reduction performance degradation sorting process trellis-based EMS algorithm heap-based EMS algorithm H-EMS algorithm heap-based I-EMS algorithm HI-EMS algorithms

来源：评论

学校读者我要写书评

暂无评论

Saliency-Guided complexity Control for HEVC decoding

引用

IEEE TRANSACTIONS ON BROADCASTING 2018年第4期64卷 865-882页

作者： Yang, Ren Xu, Mai Wang, Zulin Duan, Yiping Tao, Xiaoming Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

The latest High Efficiency Video Coding (HEVC) standard significantly improves coding efficiency over its previous video coding standards. The expense of such improvement is enormous computational complexity, from both encoding and decoding sides. Since computational capability and power capacity are diverse across portable devices, it is necessary to reduce decoding complexity to a target with tolerable quality loss, so called complexity control. This paper proposes a saliency-guided complexity control (SGCC) approach for HEVC decoding, which reduces the decoding complexity to the target with minimal perceptual quality loss. First, we establish the SGCC formulation to minimize perceptual quality loss at the constraint on reduced decoding complexity, which is achieved via disabling deblocking filter (DF) and simplifying motion compensation (MC) of some non-salient coding tree units (CTUs). One important component in this formulation is the modeled relationship between decoding complexity reduction and DF disabling/MC simplification, which determines the control accuracy of our approach. Another component is the modeled relationship between quality loss and DF disabling/MC simplification, responsible for optimizing perceptual quality. By solving the SGCC formulation for a given target complexity, we can obtain the DF and MC settings of each CTU, and then decoding complexity can be reduced to the target. Finally, the experimental results validate the effectiveness of our SGCC approach, from the aspects of control performance, complexity-distortion performance, and fluctuation of quality loss and subjective quality.

关键词： HEVC decoding complexity reduction decoding complexity control

来源：评论

学校读者我要写书评

暂无评论

Efficient coding/decoding scheme for phase-shift keying optical systems with differential encoding

引用

IET OPTOELECTRONICS 2011年第6期5卷 241-246页

作者： Mumtaz, S. Rekaya-Ben Othman, G. Jaouen, Y. Telecom ParisTech F-75634 Paris France

Phase-shift keying (PSK) has been demonstrated as an efficient modulation format for long-haul high-bit-rate optical transmission systems. Differential encoding between successive PSK symbols is required for practical implementations in both coherent and direct detection. However, this kind of encoding increases the input bit error rate of the forward error correction (FEC) and thus affects its performance. In order to reduce the penalties induced by differential encoding, the authors, in this study, propose a structured symbol interleaving of the FEC codewords and the corresponding decoding algorithm. The authors' scheme allows obtaining a decoding complexity reduction of 50% compared to the usual decoding method and a redundancy reduction about 25% without any loss of performance.

关键词： differential encoding direct detection Optical communication phase-shift keying optical systems coding-decoding scheme long-haul high-bit-rate optical transmission systems forward error correction decoding decoding complexity reduction bit error rate coherent detection optical communication phase shift keying structured symbol interleaving Codes

来源：评论

学校读者我要写书评

暂无评论

Successive Cancellation Permutation decoding of Reed-Solomon Codes

Successive Cancellation Permutation Decoding of Reed-Solomon...

引用

IEEE Information Theory Workshop (ITW)

作者： Trifonov, Peter St Petersburg State Polytech Univ St Petersburg Russia

ISBN: (纸本)9781479959990

A novel soft-decision decoding algorithm for Reed-Solomon codes over F-2m is considered. The proposed approach is based on their representation as Arikan polar codes with dynamic frozen symbols and application of the sequential successive cancellation decoding algorithm. Furthermore, permutation techniques are utilized in order to reduce the decoding complexity.

关键词： Reed-Solomon codes decoding Arikan polar codes RS codes decoding complexity reduction dynamic frozen symbols permutation techniques sequential successive cancellation decoding algorithm soft-decision decoding algorithm complexity theory Heuristic algorithms Iterative decoding Maximum likelihood decoding Vectors Reed-Solomon codes maximum likelihood decoding complexity theory Iterative decoding Heuristic algorithms decoding successive cancellation

来源：评论

学校读者我要写书评

暂无评论

Efficient Message Passing Scheduling for Terminated LDPC Convolutional Codes

Efficient Message Passing Scheduling for Terminated LDPC Con...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Lentmaier, Michael Prenda, Maria Mellado Fettweis, Gerhard P. Tech Univ Dresden Vodafone Chair Mobile Commun Syst D-01062 Dresden Germany

ISBN: (纸本)9781457705953

Message passing schedules that reduce the decoding complexity of terminated LDPC convolutional code ensembles are analyzed. Considering the AWGN channel, various schedules are compared by means of density evolution. The results of the analysis together with computer simulations for some (3,6)-regular codes confirm that sliding window decoding is an attractive practical solution for low-latency and low-complexity decoding.

关键词： AWGN channel AWGN channels Block codes complexity theory Convolutional codes decoding Message passing Parity check codes Schedules convolutional codes decoding decoding complexity reduction density evolution low complexity decoding low latency decoding message passing message passing scheduling parity check codes terminated LDPC convolutional codes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：