BEAST decoding of block codes obtained via convolutional codes

Bocharova I.E.; Handlery M.; Johannesson R.; Kudryashov B.D.

首页> 外文期刊>IEEE Transactions on Information Theory >BEAST decoding of block codes obtained via convolutional codes

【24h】

BEAST decoding of block codes obtained via convolutional codes

机译：通过卷积码对块码进行BEAST解码

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

BEAST is a bidirectional efficient algorithm for searching trees. In this correspondence, BEAST is extended to maximum-likelihood (ML) decoding of block codes obtained via convolutional codes. First it is shown by simulations that the decoding complexity of BEAST is significantly less than that of the Viterbi algorithm. Then asymptotic upper bounds on the BEAST decoding complexity for three important ensembles of codes are derived. They verify BEAST's high efficiency compared to other algorithms. For high rates, the new asymptotic bound for the best ensemble is in fact better than previously known bounds.

机译：BEAST是用于搜索树的双向高效算法。在这种对应关系中，BEAST扩展为通过卷积码获得的分组码的最大似然（ML）解码。首先，通过仿真显示，BEAST的解码复杂度明显小于Viterbi算法。然后推导了三个重要代码合集的BEAST解码复杂度的渐近上限。他们证明了BEAST与其他算法相比的高效率。对于高速率，最佳合奏的新渐近界线实际上比以前已知的界线更好。

著录项

来源
《IEEE Transactions on Information Theory》 |2005年第5期|p.1880-1891|共12页
作者
Bocharova I.E.; Handlery M.; Johannesson R.; Kudryashov B.D.;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类无线电电子学、电信技术;
关键词
block codes; convolutional codes; maximum likelihood decoding; tree searching; BEAST; asymptotic upper bound; asymptotical decoding complexity; bidirectional efficient algorithm; block codes; convolutional codes; maximum-likelihood decoding; tree search; Asymptotica;

机译：分组码;卷积码;最大似然解码;树搜索;BEAST;渐近上限;渐近解码复杂度;双向有效算法;分组码;卷积码;最大似然解码;树搜索;渐近;

相似文献

外文文献
中文文献
专利

1. Implementation of Decoders for LDPC Block Codes and LDPC Convolutional Codes Based on GPUs [J] . Yue Zhao, Lau F.C.M. IEEE Transactions on Parallel and Distributed Systems . 2014,第3期

机译：基于GPU的LDPC块码和LDPC卷积码解码器的实现
2. The performance of a severely punctured convolutional code, some high rate distance-two block codes, and a Hamming code with maximum likelihood decoding [J] . Michelson A.M., Rosen G. IEEE Transactions on Communications . 1994,第2期

机译：严重打孔的卷积码，一些高速率距离二分块码以及具有最大似然解码的汉明码的性能
3. Algebraic decoder of multidimensional convolutional code: constructive algorithms for determining syndrome decoder and decoder matrix based on Gröbner basis [J] . P. Jangisarakul, C. Charoenlarpnopparut Multidimensional Systems and Signal Processing . 2011,第1a3期

机译：多维卷积码的代数解码器：基于Gröbner基础确定构造子解码器和解码器矩阵的构造算法
4. Soft decision decoding of block codes and concatenated block-convolutional codes using the stack algorithm [C] . Offer, E., Perkins, Global Telecommunications Conference, 1991. GLOBECOM '91. 'Countdown to the New Millennium. Featuring a Mini-Theme on: Personal Communications Services . 1991

机译：使用堆栈算法对块码和级联卷积码进行软判决解码
5. Sequential Neural Network Decoder for Convolutional Code with Large Block Sizes [D] . Yu, Xianhua . 2020

机译：具有大块尺寸的卷积码的顺序神经网络解码器
6. Deep Ensemble of Weighted Viterbi Decoders for Tail-Biting Convolutional Codes [O] . Tomer Raviv, Asaf Schwartz, Yair Be’ery 2021

机译：用于尾纹卷积码的加权维特比解码器的深组合
7. 1Implementation of Decoders for LDPC Block Codes and LDPC Convolutional Codes Based on GPUs [O] . Yue Zhao, Francis C. M. Lau, Senior Member 2016

机译：1基于GpU的LDpC分组码和LDpC卷积码解码器的实现

BEAST decoding of block codes obtained via convolutional codes

摘要

著录项

相似文献

相关主题

期刊订阅