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

54th IEEE Vehicular Technology Conference (VTC 2001)

作者： Lassing, J Ottosson, T Ström, E Chalmers Univ Technol Dept Signals & Syst S-41296 Gothenburg Sweden

ISBN: (纸本)0780370058

To evaluate the performance of a convolutional code it is common to use a union bound on either the bit-error rate or the first-event error rate. Since these bounds are given as infinite sums they must be truncated to be evaluated. However, as the tail of the infinite sum is discarded. the upper bound turns into an approximation. In this paper, two methods to evaluate the union bound while taking the summation tail into account and thus maintaining the upper bound are described. The first method is based on a state matrix description of the convolutional encoder, while the second method is based on the transfer function. Results are given that compare the upper bounds and the truncated bound (approximation) to computer simulations. The standard rule-of-thumb that the union bound is tight as long as the error rates are below 10(-3) is readily seen to be valid.

关键词： convolutional code union bound truncation of union bound state transition matrix transfer function bound

来源：评论

学校读者我要写书评

暂无评论

Search for High-Rate Punctured convolutional codes through Transformed Identical codes

Search for High-Rate Punctured Convolutional Codes through T...

引用

39th Symposium on Information Theory and Its Applications (SITA)

作者： Moriya, Sen Kikuchi, Kana Sasano, Hiroshi Kindai Univ Sch Sci & Engn Higashiosaka Osaka 5778502 Japan

In this study, we consider techniques to search for high-rate punctured convolutional code (PCC) encoders by rearranging row vectors of identical-encoder generator matrices. One well-known method to obtain a good PCC encoder is to perform an exhaustive search of all candidates. However, this approach is time-intensive. An exhaustive search with a rate R-G = 1/2 original encoder requires a relatively short time, whereas that with an R-G = 1/3 or lower original encoder takes significantly longer. The encoders with lower-rate original encoders are expected to create better PCC encoders. Thus, this paper proposes a method that uses exhaustive search results with rate R-G = 1/2 original encoders, and rearranges row vectors of identical-encoder generator matrices to create PCCs with a lower rate original code. Further, we provide PCC encoders obtained by searches that utilize our method.

关键词： convolutional code punctured code identical code weight spectrum

来源：评论

学校读者我要写书评

暂无评论

A convolutional codeD ARQ SCHEME WITH RETRANSMISSION CRITERION BASED ON AN ESTIMATED DECODING ERROR RATE

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1995年第1期E78A卷 100-110页

作者： FUJIWARA, H YAMAMOTO, H REN, JQ Univ of Electro-Communications Chofu-shi Japan

A new Hybrid-ARQ scheme with a convolutional code and the Viterbi decoding is proposed, which uses the packet combining technique and a retransmission criterion based on an estimated decoding error rate. The throughput and bit error rate are evaluated by theoretical bounds and computer simulations. It is shown that a given error rate tolerance can be attained with good throughput for any signal to noise ratio, i.e. for the slow time-varying channels. Furthermore, the throughput performance can be improved by retransmitting not all but a part of packet.

关键词： ARQ convolutional code VITERBI DECODING PACKET COMBINING

来源：评论

学校读者我要写书评

暂无评论

Efficient Search for High-Rate Punctured convolutional codes Using Dual codes

Efficient Search for High-Rate Punctured Convolutional Codes...

引用

38th Symposium on Information Theory and its Applications (SITA)

作者： Moriya, Sen Kikuchi, Kana Sasano, Hiroshi Kindai Univ Sch Sci & Engn Higashiosaka Osaka 5778502 Japan

In this study, we consider techniques to search for highrate punctured convolutional code (PCC) encoders using dual code encoders. A low-rate R = 1/n convolutional code (CC) has a dual code that is identical to a PCC with rate R = (n - 1)/n. This implies that a rate R = 1/n convolutional code encoder can assist in searches for high-rate PCC encoders. On the other hand, we can derive a rate R = 1/n CC encoder from good PCC encoders with rate R = (n = 1)/n using dual code encoders. This paper proposes a method to obtain improved high-rate PCC encoders, using exhaustive search results of PCC encoders with rate R = 1/3 original encoders, and dual code encoders. We also show some PCC encoders obtained by searches that utilized our method.

关键词： convolutional code punctured code dual code weight spectrum

来源：评论

学校读者我要写书评

暂无评论

Vector Symbol Decoding with Lists of Alternative Vector Symbol Choices and Outer convolutional codes

Vector Symbol Decoding with Lists of Alternative Vector Symb...

引用

作者： Tuntoolavest, Usana PennState University Libraries

学位级别：Doctor of Philosophy

Vector Symbol Decoding (VSD) with list of alternative vector symbol choices is presented as a relatively simple and high performance decoding technique for convolutional outer codes. The convolutional VSD technique has the advantage over the block VSD technique in that most corrections are almost immediate based on observation of only one or a few syndromes. The list decoding also improves the performance and often simplifies the decoding. One main assumption of VSD is that the error symbols are linearly independent, which usually is true for large symbol size. The performance of VSD is compared to the Reed-Solomon code decoding for various types of inner codes and channel conditions. Interleaved Reed-Solomon codes are also considered. The decoding failure probability of VSD is evaluated by both analytically approach to find the upper bound and computer simulation approach to find the exact probability. The upper bound is shown to be extremely close to the simulation result. The decoding failure probability of VSD is considerably lower than the Reed-Solomon code in most cases.

关键词： Vector Symbol decoding convolutional code nonbinary code concatenated code Reed-Solomon code nonbinary code decoding

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of convolutional codes based on ML Decoding 2

Comparative Analysis of Convolutional Codes based on ML Deco...

引用

2nd International Conference on Communication Control and Intelligent Systems (CCIS)

作者： Agrawal, Tarun Kumar, Anjan Saraswat, Shelesh Krishna GLA Univ Dept Elect & Commun Mathura India

ISBN: (纸本)9781509032105

Viterbi algorithm is based on Maximum Likelihood Decoding Method. It finds a path from 2(k) total path through trellis that maximizes the path conditional probability. During decoding it compares the metric of all partial path entering each state. this paper involves brief information about convolutional code in terms of strategies of encoding and decoding of convolutional codes and also, Recursive Systematic convolutional Encoder is designed with BPSK Modulation and decoding is done by use of ML Decoding Method, compares the BER vs SNR performance at different code rates and find that as SNR increases the BER improves and also as number of bits are increases the performance of communication system also improves. At 3 db SNR the BER is 10 boolean AND-2, when the number of bits are 2048 and 4096 at 4db SNR the BER is close to 10 boolean AND-3.

关键词： convolutional code LTE ML Decoding MAP Decoding Burst Error HSDPA Interleaver

来源：评论

学校读者我要写书评

暂无评论

code division multiple access based on independent codes and turbo decoding

引用

ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS 1999年第7-8期54卷 401-410页

作者： Brunel, L Boutros, J Ecole Natl Super Telecommun Commun & Elect Dept F-75634 Paris 13 France

We study a multiple access encoding/decoding algorithm based on iterative (turbo) decoding. The algorithm is suitable for both synchronous and asynchronous systems. The quasi-orthogonal pseudo-noise sequences of the DS-SSMA system are replaced by independent channel codes constructed by combining convolutional codes and random interleavers. The interference is rebuilt using soft output information. The results show that the iterative joint decoder is able to completely eliminate the co-channel interference. The performance of the multiple access system tends practically to that of a single user system.

关键词： code division multiple access direct sequence spectrum error correcting code decoding convolutional code interleaving iteration signal interference channel capacity numerical simulation system performance

来源：评论

学校读者我要写书评

暂无评论

A METHOD FOR DECODING A VARIABLE-RATE ERROR-CORRECTING code BASED ON FINITE-STATE AUTOMATA

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2015年第3期51卷 336-343页

作者： Zavadskyi, I. O. Taras Shevchenko Natl Univ Kyiv Kiev Ukraine

A decoding algorithm for a special error-correcting code is considered and its efficiency is estimated. This code is obtained as a result of processing information messages by finite automata and using a two-base numeral system. A general encoding algorithm is also considered. Both encoding or decoding are performed by a two-level system in which an input message is represented as a lower (2,3) code at the internal level, and the error correcting capabilities of this code are strengthened owing to its transformation with the help of a special finite automaton at the external level. In decoding, errors are first detected and corrected at the external level, and then possible remaining errors are eliminated by an internal automaton. The relationship between the external level of the system being considered and convolutional codes is investigated and the advantages of the proposed method are shown.

关键词： finite-state automaton error-correcting code (2,3) code convolutional code

来源：评论

学校读者我要写书评

暂无评论

The FPGA Test Algorithm Of Large Constraint Length Convolution code Encoder 3

The FPGA Test Algorithm Of Large Constraint Length Convoluti...

引用

3rd IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)

作者： Zhang Taotao Wang Manxi Rong Hui Liu Wanhong Liu Yufeng State Key Lab Complex Electromagnet Environm Effe Luoyang Peoples R China China Luoyang Elect Equipment Test Ctr Luoyang Peoples R China 32183 Troops Luoyang Peoples R China

ISBN: (纸本)9781538645093

Methods for checking the generator polynomial of a convolutional code are mathematical derivation and using mathematical tools Matlab verification. However, the existing inspection methods do not apply to large constraint length convolutional codes, using the method of parallel computing to make appropriate improvements to existing evil code checking algorithms, transform the parallel inspection algorithm into an algorithm suitable for FPGA hardware development platform. It can be used to improve the inspection efficiency of bad code.

关键词： convolutional code stack structure Parallel Computing

来源：评论

学校读者我要写书评

暂无评论

Construction of High-Rate convolutional codes Using Dual codes*

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2023年第3期E106A卷 375-381页

作者： Moriya, Sen Sasano, Hiroshi Kindai Univ Fac Sci & Engn Higashiosaka 5778502 Japan Kindai Univ Cyber Informat Res Inst Higashiosaka 5778502 Japan

In this study, we consider techniques for searching high -rate convolutional code (CC) encoders using dual code encoders. A low-rate (R = 1/n) CC is a dual code to a high-rate (R = (n - 1)/n) CC. According to our past studies, if a CC encoder has a high performance, a dual code encoder to the CC also tends to have a good performance. However, it is not guaranteed to have the highest performance. We consider a method to obtain a high-rate CC encoder with a high performance using good dual code encoders, namely, high-performance low-rate CC encoders. We also present some CC encoders obtained by searches using our method.

关键词： convolutional code dual code weight spectrum

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：