Further results on convolutional code search for block-fading channels

被引:25
作者
Chiani, M [1 ]
Conti, A
Tralli, V
机构
[1] Univ Bologna, DEIS, IEIIT, BO,CNR, I-40136 Bologna, Italy
[2] Univ Ferrara, DIF, I-44100 Ferrara, Italy
关键词
block-fading channel (BFC); code search; convolutional codes; generalized transfer function (GTF); performance evaluation;
D O I
10.1109/TIT.2004.828146
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This correspondence presents results of code search for convolutional codes over block-fading channels (BFCs). Search criteria are based on,a union bound approach which exploits the concept of generalized transfer function (GTF) of the error trellis diagram. A new asymptotic bound is derived, and the performance of the codes found using our search criterion is compared analytically and by numerical simulation with already existing codes.
引用
收藏
页码:1312 / 1318
页数:7
相关论文
共 16 条
[1]   On the Voronoi neighbor ratio for binary linear block codes [J].
Agrell, E .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (07) :3064-3072
[2]  
Benedetto S., 1999, Principles of Digital Transmission
[3]  
CAIRE G, 2001, P IEEE GLOBECOM 2001
[4]   Upper Bound on the Frame Error Probability of Terminated Trellis Codes [J].
Caire, Giuseppe ;
Viterbo, Emanuele .
IEEE COMMUNICATIONS LETTERS, 1998, 2 (01) :2-4
[6]  
CHIANI M, 2001, P IEEE INT C COMM HE
[7]  
CRAIG JW, 1991, P MIL COMM C BOST MA
[8]   On the design and selection of convolutional codes for an uninterleaved, bursty Rician channel [J].
Kaplan, G ;
Shamai, S ;
Kofman, Y .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1995, 43 (12) :2914-2921
[9]   On coding for block fading channels [J].
Knopp, R ;
Humblet, PA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (01) :189-205
[10]   MULTIFREQUENCY TRELLIS CODING WITH LOW-DELAY FOR FADING CHANNELS [J].
LEUNG, YS ;
WILSON, SG ;
KETCHUM, JW .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1993, 41 (10) :1450-1459