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

Novel decoding algorithms for decode-and-forward cooperative beamforming systems

IET COMMUNICATIONS 2014年第17期8卷 3012-3018页

作者： Lee, Kyungchun Seoul Natl Univ Sci & Technol Dept Elect & Informat Engn Convergence Inst Biomed Engn & Biomat Seoul 139743 South Korea

In this study, two novel decoding algorithms for cooperative beamforming (CBF) systems are proposed. In decode-and-forward-based CBF, multiple relay nodes decode the packets transmitted from the source node and forward them to the destination node. However, decoding errors at the relay nodes cause erroneous retransmission of packets, which degrades the signal decoding performance at the destination node. To solve this problem, the optimal decoding strategy is derived;this strategy takes the potential errors in forwarded signals into account in the computation of the likelihood ratio of coded bits. Furthermore, to reduce the required computational complexity, a suboptimal decoding algorithm, which assumes that only one of the multiple relayed signals potentially contains errors in each time slot, is also proposed. In simulation results, it is observed that the proposed decoding algorithms for CBF provide performance improvements in terms of the achievable packet error rates with respect to the conventional schemes.

关键词： array signal processing cooperative communication decode and forward communication network coding packet radio networks relay networks (telecommunication) decoding algorithm decode and forward based CBF system cooperative beamforming relay node transmitted packet decoding source node destination node decoding error packet retransmission packet error rate coded bits likelihood ratio optimal decoding strategy destination node signal decoding performance

来源：评论

学校读者我要写书评

暂无评论

Hardware decoders for polar codes: An overview

Hardware decoders for polar codes: An overview

引用

International Symposium on Circuits and Systems

作者： Pascal Giard Gabi Sarkis Alexios Balatsoukas-Stimming YouZhe Fan Chi-ying Tsui Andreas Burg Claude Thibeault Warren J. Gross Dept. of Electr. and Comput. Eng. McGill Univ. Montreal Quebec Canada Telecommun. Circuits Lab. EPFL Lausanne Switzerland Dept. of Electron. and Comput. Eng. Hong Kong Univ. of Sci. and Technol. Hong Kong China Dept. of Electr. Eng. Ecole de technologie superieure Montreal Quebec Canada

ISBN: (纸本)9781479953424

Polar codes are an exciting new class of error correcting codes that achieve the symmetric capacity of memoryless channels. Many decoding algorithms were developed and implemented, addressing various application requirements: from error-correction performance rivaling that of LDPC codes to very high throughput or low-complexity decoders. In this work, we review the state of the art in polar decoders implementing the successive-cancellation, belief propagation, and list decoding algorithms, illustrating their advantages.

关键词： Polar code state of the art error correction New classes decoders low density parity check codes decoding algorithm Memoryless channel list decoding Error correction codes

来源：评论

学校读者我要写书评

暂无评论

A high throughput belief propagation decoder architecture for polar codes

A high throughput belief propagation decoder architecture fo...

引用

International Symposium on Circuits and Systems

作者： Jun Lin Jin Sha Li Li Chenrong Xiong Zhiyuan Yan Zhongfeng Wang School of Electronic Science and Engineering Nanjing University Jiangsu China Department of ECE Lehigh University PA USA Broadcom Corporation CA USA

ISBN: (纸本)9781479953424

The belief propagation (BP) decoding algorithm not only is an alternative to the successive cancelation (SC) decoders of polar codes, but also provides soft outputs that are necessary for joint detection and decoding. The BP decoders with the flooding schedule achieve high throughput with excessive hardware cost especially when the block length is large. The soft-cancelation (SCAN) decoders for polar codes have reduced memory complexity compared to the BP decoders based on the flooding schedule. The simplified SC aided reduced complexity soft-cancelation (S-RCSC) decoders further reduce the computational and memory complexity of the SCAN decoders at the cost of negligible error performance degradation. Both the SCAN and S-RCSC decoders have limited throughput due to their serial decoding schedules. In this paper, we first propose an improved S-RCSC (IS-RCSC) decoding algorithm and then present a high throughput decoder architecture based on our IS-RCSC algorithm. Our IS-RCSC decoding algorithm performs the message passing on a binary tree representation of a polar code. Compared to the S-RCSC decoding algorithm, our IS-RCSC decoding algorithm accelerates the computing of the returned soft messages when certain types of nodes are activated. The corresponding hardware architecture of our IS-RCSC decoder is also proposed. In terms of area efficiency, the hardware implementation results demonstrate that our IS-RCSC decoders are 19% to 43% better than decoders in the literature.

关键词： Polar code decoders decoding algorithm Throughput message passing area efficiency Belief propagation hardware architecture

来源：评论

学校读者我要写书评

暂无评论

237 Gbit/s unrolled hardware polar decoder

引用

ELECTRONICS LETTERS 2015年第10期51卷 762-U30页

作者： Giard, P. Sarkis, G. Thibeault, C. Gross, W. J. McGill Univ Dept Elect & Comp Engn Montreal PQ Canada Ecole Technol Super Dept Elect Engn Montreal PQ Canada

A new architecture for a polar decoder using a reduced complexity successive-cancellation (SC) decoding algorithm is presented. This novel fully unrolled, deeply pipelined architecture is capable of achieving a coded throughput of over 237 Gbit/s for a (1024, 512) polar code implemented using a field-programmable gate array. This decoder is two orders of magnitude faster than state-of-the-art polar decoders.

关键词： decoding field programmable gate arrays FPGA complexity successive cancellation decoding algorithm field programmable gate array pipelined architecture polar code unrolled hardware polar decoder

来源：评论

学校读者我要写书评

暂无评论

List-decoding Gabidulin Codes via Interpolation and the Euclidean algorithm

List-Decoding Gabidulin Codes via Interpolation and the Eucl...

引用

International Symposium on Information Theory and its Applications (ISITA)

作者： Kuijper, Margreta Trautmann, Anna-Lena Univ Melbourne Dept Elect & Elect Engn Melbourne Vic 3010 Australia Monash Univ Dept Elect & Comp Syst Engn Clayton Vic 3800 Australia

ISBN: (纸本)9784885522925

We show how Gabidulin codes can be list decoded by using a parametrization approach. For this we consider a certain module in the ring of linearized polynomials and find a minimal basis for this module using the Euclidean algorithm with respect to composition of polynomials. For a given received word, our decoding algorithm computes a list of all codewords that are closest to the received word with respect to the rank metric.

关键词： decoding Encoding Interpolation Measurement Polynomials Vectors Euclidean algorithm decoding Cloning Vectors Codes Interpolation Polynomial decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Recasting brain-machine interface design from a physical control system perspective

引用

JOURNAL OF COMPUTATIONAL NEUROSCIENCE 2015年第2期39卷 107-118页

作者： Zhang, Yin Chase, Steven M. Carnegie Mellon Univ Inst Robot Pittsburgh PA 15213 USA Carnegie Mellon Univ Ctr Neural Basis Cognit Pittsburgh PA 15213 USA Carnegie Mellon Univ Dept Biomed Engn Pittsburgh PA 15213 USA

With the goal of improving the quality of life for people suffering from various motor control disorders, brain-machine interfaces provide direct neural control of prosthetic devices by translating neural signals into control signals. These systems act by reading motor intent signals directly from the brain and using them to control, for example, the movement of a cursor on a computer screen. Over the past two decades, much attention has been devoted to the decoding problem: how should recorded neural activity be translated into the movement of the cursor? Most approaches have focused on this problem from an estimation standpoint, i.e., decoders are designed to return the best estimate of motor intent possible, under various sets of assumptions about how the recorded neural signals represent motor intent. Here we recast the decoder design problem from a physical control system perspective, and investigate how various classes of decoders lead to different types of physical systems for the subject to control. This framework leads to new interpretations of why certain types of decoders have been shown to perform better than others. These results have implications for understanding how motor neurons are recruited to perform various tasks, and may lend insight into the brain's ability to conceptualize artificial systems.

关键词： Brain-machine interfaces decoding algorithm Physical control system

来源：评论

学校读者我要写书评

暂无评论

Reduced Complexity Belief Propagation Decoders for Polar Codes

Reduced Complexity Belief Propagation Decoders for Polar Cod...

引用

IEEE International Workshop on Signal Processing Systems (SiPS)

作者： Lin, Jun Xiong, Chenrong Yan, Zhiyuan Lehigh Univ Dept Elect & Comp Engn Bethlehem PA 18015 USA

ISBN: (纸本)9781467396042

Polar codes are newly discovered capacity-achieving codes, which have attracted lots of research efforts. Polar codes can be efficiently decoded by the low-complexity successive cancelation (SC) algorithm and the SC list (SCL) decoding algorithm. The belief propagation (BP) decoding algorithm not only is an alternative to the SC and SCL decoders, but also provides soft outputs that are necessary for joint detection and decoding. Both the BP decoder and the soft cancelation (SCAN) decoder were proposed for polar codes to output soft information about the coded bits. In this paper, first a belief propagation decoding algorithm, called reduced complexity soft cancelation (RCSC) decoding algorithm, is proposed. Let N denote the block length. Our RCSC decoding algorithm needs to store only 5N - 3 log-likelihood ratios (LLRs), significantly less than 4N 2 N 2 + and N(log(2) N +1) LLRs needed by the BP and SCAN decoders, respectively, when N 64. Besides, compared to the SCAN decoding algorithm, our RCSC decoding algorithm eliminates unnecessary additions over the real field. Then the simplified SC (SSC) principle is applied to our RCSC decoding algorithm, and the resulting SSC-aided RCSC (S-RCSC) decoding algorithm further reduces the computational complexity. Finally, based on the S-RCSC decoding algorithm, we propose a corresponding memory efficient decoder architecture, which has better error performance than existing architectures. Besides, our decoder architecture consumes less energy on updating LLRs.

关键词： Polar code decoding algorithm decoders Belief propagation error performance Scandium

来源：评论

学校读者我要写书评

暂无评论

One-Level LDPC Lattice Codes for the Relay Channels

One-Level LDPC Lattice Codes for the Relay Channels

引用

Iran Workshop on Communication and Information Theory

作者： Khodaiemehr, Hassan Kiani, Dariush Sadeghi, Mohammad-Reza Amirkabir Univ Technol Fac Math & Comp Sci Tehran Iran

ISBN: (纸本)9781479982356

LDPC lattices were first family of lattices which have efficient decoding algorithm in high dimensions. An LDPC lattice can be constructed from Construction D' and a number of nested LDPC codes. When we consider one code as underlying code of these lattices, one-level LDPC lattices will be obtained. In this paper we propose a new encoding and decoding method for one-level LDPC lattices. We also establish an efficient shaping method for these lattices based on hypercube shaping. Then, based on this encoding and decoding, we propose the implementation of block Markov encoding for one-way relay networks, using obtained one-level LDPC lattice codes. Our proposed decoding algorithm has lower complexity than those given for LDLC lattices.

关键词： crystal lattices low density parity check codes decoding algorithm Relay networks relay decoding Codes relay channel

来源：评论

学校读者我要写书评

暂无评论

A 638 Mbps Low-Complexity Rate 1/2 Polar Decoder on FPGAs

A 638 Mbps Low-Complexity Rate 1/2 Polar Decoder on FPGAs

引用

IEEE International Workshop on Signal Processing Systems (SiPS)

作者： Giard, Pascal Sarkis, Gabi Thibeault, Claude Gross, Warren J. McGill Univ Dept Elect & Comp Engn Montreal PQ Canada Ecole Technol Super Dept Elect Engn Montreal PQ Canada

ISBN: (纸本)9781467396042

Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the state-of-the-art low-complexity decoding algorithm can be improved to better accommodate low-rate codes. Dedicated hardware is added to efficiently decode new constituent codes. Also, we use polar code construction alteration to further improve the latency and throughput. A polar decoder for a (1024, 512) code is implemented on two different FPGAs. It has 25% lower latency over the previous work and a coded throughput of 436 Mbps and 638 Mbps on the Xilinx Virtex 6 and Altera Stratix IV FPGAs, respectively.

关键词： Polar code Latency decoders Codes Polar Field programmable gate arrays Throughput Error correction codes decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

Variable length prefix (Δ, k)-codes 3

Variable length prefix (Δ, <i>k</i>)-codes

引用

IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)

作者： Anisimov, Anatoly V. Zavadskyi, Igor O. Kyiv Natl Taras Shevchenko Univ Kiev Ukraine

ISBN: (纸本)9781479985050

A new perspective family of universal variable length prefix codes with a set of delimiters is introduced. The main seed of these codes is the binary representation of natural numbers in the two-base numeration system with the main radix 2 and the auxiliary radix 3. We construct extensions and generalizations of these (2,3)-codes, which we call (Delta, k) codes. We prove that all (Delta, k) -codes are complete. Also for these codes we developed fast and efficient bit-wise and byte-wise encoding and decoding algorithms. Some representatives of (Delta, k) -codes family outperform the known closest to them Fibonacci codes either in text compression efficiency or in computational complexity.

关键词： Numeration Systems binary representation variable length Natural number Codes complexity classes decoding algorithm Generalization family Root Radix Base of a number system Fasting Text compression

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：