A structure for fast synchronizing variable-length codes

被引:8
作者
Chabbouh, S [1 ]
Lamy, C [1 ]
机构
[1] Philips Rech France, F-92156 Suresnes, France
关键词
synchronization; tree construction; variable-length codes;
D O I
10.1109/LCOMM.2002.805547
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
A new approach for transforming variable-length codes, optimal in the minimum average codeword length sense, into fast synchronizing codes with the same length distribution is proposed in this letter. Based on the adaptation of an intrinsically fast synchronizing structure whose properties are demonstrated, this approach provides good synchronization recovery for a very low computational complexity. Finally, numerical results are presented and compared with reference ones.
引用
收藏
页码:500 / 502
页数:3
相关论文
共 6 条
[1]   SELF-SYNCHRONIZING HUFFMAN CODES [J].
FERGUSON, TJ ;
RABINOWITZ, JH .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1984, 30 (04) :687-693
[2]   A METHOD FOR THE CONSTRUCTION OF MINIMUM-REDUNDANCY CODES [J].
HUFFMAN, DA .
PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (09) :1098-1101
[3]  
*INT TEL UN, 1996, H263 ITU T
[4]   ERROR RECOVERY FOR VARIABLE LENGTH CODES [J].
MAXTED, JC ;
ROBINSON, JP .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (06) :794-801
[5]   SYNCHRONIZATION OF BINARY SOURCE CODES [J].
MONTGOMERY, BL ;
ABRAHAMS, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (06) :849-854
[6]   ERROR STATES AND SYNCHRONIZATION RECOVERY FOR VARIABLE-LENGTH CODES [J].
TAKISHIMA, Y ;
WADA, M ;
MURAKAMI, H .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1994, 42 (2-4) :783-792