BOUNDS AND APPROXIMATIONS FOR THE BIT ERROR-PROBABILITY OF CONVOLUTIONAL-CODES

被引：0
|
作者：
BURR, AG
机构：
[1] Univ of York, York, United Kingdom
来源：
ELECTRONICS LETTERS | 1993年 / 29卷 / 14期
关键词：
CONVOLUTIONAL CODES; VITERBI CODING; BIT ERROR RATE;
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
The bit error probability P(b) of convolutional codes decoded using the Viterbi algorithm using both soft and hard decision techniques is considered. Approximations to the additive or union upper bound on P(b) which also form good approximations to P(b) at values up to 10(-2) or higher are presented. Tables are given for the best codes listed for constraint lengths between 3 and 7 and rates 1/2 and 1/3.
引用
收藏
页码：1287 / 1288
页数：2
相关论文
共 50 条
12345