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

A High-Throughput Energy-Efficient Implementation of successive cancellation decoder for Polar Codes Using Combinational Logic

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS 2016年第3期63卷 436-447页

作者： Dizdar, Onur Arikan, Erdal Bilkent Univ Dept Elect Elect Engn TR-06800 Ankara Turkey

This paper proposes a high-throughput energyefficient successive cancellation (SC) decoder architecture for polar codes based on combinational logic. The proposed combinational architecture operates at relatively low clock frequencies compared to sequential circuits, but takes advantage of the high degree of parallelism inherent in such architectures to provide a favorable tradeoff between throughput and energy efficiency at short to medium block lengths. At longer block lengths, the paper proposes a hybrid-logic SC decoder that combines the advantageous aspects of the combinational decoder with the low-complexity nature of sequential-logic decoders. Performance characteristics on ASIC and FPGA are presented with a detailed power consumption analysis for combinational decoders. Finally, the paper presents an analysis of the complexity and delay of combinational decoders, and of the throughput gains obtained by hybrid-logic decoders with respect to purely synchronous architectures.

关键词： Energy efficiency error correcting codes polar codes successive cancellation decoder VLSI

来源：评论

学校读者我要写书评

暂无评论

Low-complex processing element architecture for successive cancellation decoder

引用

INTEGRATION-THE VLSI JOURNAL 2019年 66卷 80-87页

作者： Babu, Geethu Sathees Madala, Lakshmi Renuka Gopalakrishnan, Lakshminarayanan Sellathurai, Mathini Natl Inst Technol Tiruchirappalli Dept Elect & Commun Engn Tiruchirappalli Tamil Nadu India Heriot Watt Univ Edinburgh EH14 4AS Midlothian Scotland

A low-complexity design architecture for implementing the successive cancellation (SC) decoding algorithm for polar codes is presented. Hardware design of polar decoders is accomplished using SC decoding due to the reduced intricacy of the algorithm. Merged processing element (MPE) block is the primary area occupying factor of the SC decoder as it incorporates numerous sign and magnitude conversions. Two's complement method is typically used in the MPE block of SC decoder. In this paper, a low-complex MPE architecture with minimal two's complement conversion is proposed. A reformulation is also applied to the merged processing elements at the final stage of SC decoder to generate two output bits at a time. The proposed merged processing element thereby reduces the hardware complexity of the SC decoder and also reduces latency by an average of 64%. An SC decoder with code length 1024 and code rate 1/2 was designed and synthesized using 45-nm CMOS technology. The implementation results of the proposed decoder display significant improvement in the Technology Scaled Normalized Throughput (TSNT) value and an average 48% reduction in hardware complexity compared to the prevalent SC decoder architectures. Compared to the conventional SC decoder, the presented method displayed a 23% reduction in area.

关键词： ASIC Polar codes Processing element successive cancellation decoder

来源：评论

学校读者我要写书评

暂无评论

Permuted successive cancellation decoder for Polar Codes

Permuted Successive Cancellation Decoder for Polar Codes

引用

International Symposium on Information Theory and its Applications (ISITA)

作者： Vangala, Harish Viterbo, Emanuele Hong, Yi Monash Univ Dept ECSE Melbourne Vic 3800 Australia

ISBN: (纸本)9784885522925

We study a new variant of Arikan's successive cancellation decoder (SCD) for polar codes. We first propose a new decoding algorithm on a new decoder graph, where the various stages of the graph are permuted. We then observe that, even though the usage of the permuted graph doesn't affect the encoder, it can significantly affect the decoding performance of a given polar code. The new permuted successive cancellation decoder (PSCD) typically exhibits a performance degradation, since the polar code is optimized for the standard SCD. We then present a new polar code construction rule matched to the PSCD and show their performance in simulations. For all rates we observe that the polar code matched to a given PSCD performs the same as the original polar code with the standard SCD. We also see that a PSCD with a reversal permutation can lead to a natural decoding order, avoiding the standard bit-reversal decoding order in SCD without any loss in performance.

关键词： successive cancellation decoder permuted successive cancellation decoder decoding order permuted polar code construction permutation invariance of the polar encoder

来源：评论

学校读者我要写书评

暂无评论

A New Multiple Folded successive cancellation decoder for Polar Codes

A New Multiple Folded Successive Cancellation Decoder for Po...

引用

IEEE Information Theory Workshop (ITW)

作者： Vangala, Harish Viterbo, Emanuele Hong, Yi Monash Univ Dept Elect & Comp Syst Engn Melbourne Vic 3800 Australia

ISBN: (纸本)9781479959990

We consider a new variant of successive cancellation decoder (SCD) for polar codes based on the concept of folding, which was proposed in [ 1], [ 2] as technique to reduce the decoding latency at the cost of a higher computational complexity. In this paper, we first formally define the multiple folding operation (iterated - times), which decomposes the original encoding graph into a number of smaller polar encoding graphs. More specifically, we show that the multiple folding gives rise to a two stage interpretation of the graph representing the polar encoder and the SCD. Based on this, we propose the improved multiple folded successive cancellation decoder (IMFSCD), which combines SCD in one stage and maximum-likelihood decoding in the other. This decoder exhibits a latency gain by a factor of 2, still retaining a complexity close to the classic SCD. The small increase in complexity is due to a short maximum likelihood decoder (MLD) used in place of a SCD in the last decoding stage within the IMFSCD. Moreover, we observe by simulation that the decoder performance is exactly the same as that of an SCD at all rates.

关键词： successive cancellation decoder multiple folded successive cancellation decoder partial ML decoding of polar codes low latency decoder two stage polar encoder two stage polar decoder polar code concatenation

来源：评论

学校读者我要写书评

暂无评论

Line-Based successive cancellation decoder with Reduced Complexity 2nd

Line-Based Successive Cancellation Decoder with Reduced Comp...

引用

2nd International Conference on Intelligent Communication, Control and Devices (ICICCD)

作者： Madhuri, G. M. G. Kitti, B. Praveen Kumari, N. Prasanthi PSCMR Coll Engn & Technol Vijayawada India Univ Petr & Energy Studies Coll Engn Studies Dehra Dun Uttarakhand India

ISBN: (纸本)9789811059032;9789811059025

The error-correcting codes which achieve Shannon's channel capacity are polar codes for infinite length. In this, we propose an efficient implementation for SC polar decoders with O(log(2)N) processing elements, where N is code block length. Here, SC decoding processing unit is implemented in logarithmic domain, thereby reducing the multiplication and division operations and low-complex partial sum logic. This decoder architecture has a low dispensation density that allows large polar codes to put into practice. Simulation is done using Xilinx, and simulation results are presented.

关键词： successive cancellation decoder VLSI Polar codes Partial sum logic

来源：评论

学校读者我要写书评

暂无评论

Quantization of CRC-Aided successive cancellation List decoder for Polar Codes 2

Quantization of CRC-Aided Successive Cancellation List Decod...

引用

2nd International Conference on Robotics and Automation Sciences (ICRAS)

作者： Zheng, Xin Wang, Jiahao Tang, Bo China Univ Geosci Wuhan Sch Mech Engn & Elect Informat Wuhan Hubei Peoples R China

ISBN: (纸本)9781538673706

In order to implement a low-complexity CRC-aided successive cancellation list decoder for polar codes on digital chips, we study the quantization technologies for the initial log likelihood ratios and the path metric distance of the decoder. In order to reduce the block error rate performance loss using the uniform quantization method, we analyze various optimization techniques such as quantization hits and quantization precision for the initial log likelihood ratios and the path metric distance. We provide quantization simulation for realistic code length N = 2(10) and code rate R = 0.5. Simulation results show that 6 bits quantization on interval [-31, +31] for the initial log likelihood ratios and 8 hits quantization on interval [255, +255] for the path metric distance can not only bring the block error rate performance loss less than 0.1 dB, but also decrease the hardware implementation complexity significantly.

关键词： polar codes quantization CRC-aided successive cancellation list decoder successive cancellation list decoder successive cancellation decoder

来源：评论

学校读者我要写书评

暂无评论

All the Codeword Symbols in Polar Codes Have the Same SER Under the SC decoder

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2023年第7期71卷 3783-3791页

作者： Li, Guodong Ye, Min Hu, Sihuang Shandong Univ Key Lab Cryptol Technol & Informat Secur Minist Educ Qingdao 266237 Shandong Peoples R China Shandong Univ Sch Cyber Sci & Technol Qingdao 266237 Shandong Peoples R China Tsinghua Berkeley Shenzhen Inst Tsinghua Shenzhen Int Grad Sch Shenzhen 518055 Peoples R China Quan Cheng Lab Jinan 250103 Peoples R China

Let F-p be a prime field and let F-q be a larger finite field obtained from adjoining an element alpha to F-p, i.e., F-q = F-p(alpha). We consider polar codes constructed from the 2x2 kernel [GRAPHICS] over F-q. We prove that for any F-q-symmetric memoryless channel, any code length, and any code dimension, all the codeword symbols in such polar codes have the same symbol error rate (SER) under the successive cancellation (SC) decoder.

关键词： Polar code successive cancellation decoder symbol error rate F-q-symmetric channel

来源：评论

学校读者我要写书评

暂无评论

Polar Codes in Network Quantum Information Theory

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第2期62卷 915-924页

作者： Hirche, Christoph Morgan, Ciara Wilde, Mark M. Leibniz Univ Hannover Inst Theoret Phys D-30167 Hannover Germany Univ Autonoma Barcelona Dept Fis Fis Teor Informacio & Fenomens Quan ES-08193 Barcelona Spain Univ Coll Dublin Sch Math & Stat Dublin 4 Ireland Louisiana State Univ Dept Phys & Astron Hearne Inst Theoret Phys Ctr Computat & Technol Baton Rouge LA 70803 USA

Polar coding is a method for communication over noisy classical channels, which is provably capacity achieving and has an efficient encoding and decoding. Recently, this method has been generalized to the realm of quantum information processing, for tasks such as classical communication, private classical communication, and quantum communication. In this paper, we apply the polar coding method to network classical-quantum information theory, by making use of recent advances for related classical tasks. In particular, we consider problems such as the compound multiple access channel and the quantum interference channel. The main result of our work is that it is possible to achieve the best known inner bounds on the achievable rate regions for these tasks, without requiring a so-called quantum simultaneous decoder. Thus, this paper paves the way for developing network classical-quantum information theory further without requiring a quantum simultaneous decoder.

关键词： Polar codes channel capacity classical-quantum networks successive cancellation decoder quantum simultaneous decoder

来源：评论

学校读者我要写书评

暂无评论

LLR-Based successive cancellation List Decoding of Polar Codes

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2015年第19期63卷 5165-5179页

作者： Balatsoukas-Stimming, Alexios Parizi, Mani Bastani Burg, Andreas Swiss Fed Inst Technol EPFL TCL CH-1015 Lausanne Switzerland Swiss Fed Inst Technol EPFL Informat Theory Lab LTHI CH-1015 Lausanne Switzerland

We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation has useful properties that simplify the sorting step involved in successive cancellation list decoding. We propose a hardware architecture of the successive cancellation list decoder in the log-likelihood ratio domain which, compared with a log-likelihood domain implementation, requires less irregular and smaller memories. This simplification, together with the gains in the metric sorter, lead to to higher throughput per unit area than other recently proposed architectures. We then evaluate the empirical performance of the CRC-aided successive cancellation list decoder at different list sizes using different CRCs and conclude that it is important to adapt the CRC length to the list size in order to achieve the best error-rate performance of concatenated polar codes. Finally, we synthesize conventional successive cancellation decoders at large block-lengths with the same block-error probability as our proposed CRC-aided successive cancellation list decoders to demonstrate that, while our decoders have slightly lower throughput and larger area, they have a significantly smaller decoding latency.

关键词： CRC-aided successive cancellation list decoder hardware implementation polar codes successive cancellation decoder successive cancellation list decoder

来源：评论

学校读者我要写书评

暂无评论

Learning Polar Codes using Python Program with Graphical User Interface 34

Learning Polar Codes using Python Program with Graphical Use...

引用

34th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)

作者： Aung, Htain Lynn Maung, Tay Zar Bhone Sasithong, Pruk Sreprasurt, Teesid Wijayasekara, Sanika Pengnoo, Manus Wuttisittikulkij, Lunchakorn Phakphisut, Watid Phongphanphanee, Chairat Bajpai, Ambar Saadi, Muhammad Vanichchanunt, Pisit Chulalongkorn Univ Smart Wireless Commun Ecosyst Res Grp Bangkok Thailand Chulalongkorn Univ Dept Elect Engn Bangkok Thailand King Mongkuts Inst Technol Ladkrabang Bangkok Thailand Chulalongkorn Univ Dept Comp Engn Bangkok Thailand Indore Inst Sci & Technol Dept Elect & Commun Indore India Univ Cent Punjab Lahore Dept Elect Engn Punjab Pakistan King Mongkuts Univ Technol North Dept Elect & Comp Engn Bangkok Thailand

ISBN: (纸本)9781728132716

Polar codes are an emerging class of powerful capacity-achieving channel codes for binary-input memoryless channels. Very recently, polar codes have been adopted as an official channel coding technology for control channels of 5G communications systems. In this paper, we aim to develop a self-learning software tool to help electrical engineering students understand polar codes in the most effective manner. The software tool developed in Python provides a graphical display for detailed and step- by-step encoding and decoding processes for polar codes of various different block lengths. We have applied this tool in our lecture class of the fourth year undergraduate students. It is found that students are able to gain insight the basic concept of polar codes quickly through the interactive and friendly graphical user interface.

关键词： polar codes channel polarization successive cancellation decoder self-learning software tool

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：