DocumentCode :
2246339
Title :
A study of a suboptimal VLSI architecture for joint source-channel trellis coding
Author :
Perez, Luis Gonzalez ; Boutillon, Emmanuel
Author_Institution :
Ecole Nat. Superieure des Telecommun., Paris, France
Volume :
1
fYear :
2000
fDate :
2000
Firstpage :
643
Abstract :
An architectural study of a Joint Source-Channel Trellis Coding (JSCTC) technique is presented. The use of a sub-optimal trellis search algorithm, the M algorithm, is proposed to encode the source in order to keep the encoding complexity independent of the trellis constraint length (i.e. the codebook size). The idea is to increase the codebook size (and thus, the quality of the transmission) without increasing the hardware complexity. A comparison in terms of complexity versus performance between the M algorithm and the optimal search algorithm (Viterbi) is presented for the encoding of a first-order Gauss-Markov source. In addition, the JSCTC system is compared with a conventional communication system consisting of a JPEG codec and a turbo-codec
Keywords :
VLSI; combined source-channel coding; computational complexity; digital signal processing chips; image coding; trellis codes; M algorithm; codebook size; encoding complexity; first-order Gauss-Markov source; joint source-channel trellis coding; sub-optimal trellis search algorithm; suboptimal VLSI architecture; trellis constraint length; Books; Codecs; Decoding; Hardware; Quantization; Shift registers; Signal to noise ratio; Source coding; Very large scale integration; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on
Conference_Location :
Geneva
Print_ISBN :
0-7803-5482-6
Type :
conf
DOI :
10.1109/ISCAS.2000.857177
Filename :
857177
Link To Document :
بازگشت