DocumentCode :
427795
Title :
Simplified trellis decoding of block codes by selective pruning
Author :
Bertrand, Eric ; Labeau, Fabrice
Author_Institution :
Dept. of Electr. & Comput. eng., McGill Univ., Montreal, Que., Canada
Volume :
1
fYear :
2004
fDate :
7-10 Nov. 2004
Firstpage :
1115
Abstract :
As channel conditions improve we can augment data throughput by using error-correcting codes with higher coding rates. However at these rates convolutional codes suffer from performance loss due to puncturing and can be difficult to implement. On the other hand the trellis based decoding of block codes is computationally intensive. For this reason we introduce an innovative method of simplifying the decoding of block codes by way of selective trellis pruning. This algorithm can produce quasioptimal results with only a fraction of the operations required by conventional methods. We also introduce a way of obtaining a pruned trellis directly from a simplified generator matrix. By using this method one can avoid the construction and pruning of full trellises, which for some codes can be extremely large, thus simplifying decoding even further.
Keywords :
convolutional codes; decoding; error correction codes; matrix algebra; trellis codes; block code; convolutional code; error-correcting code; selective pruning; simplified generator matrix; simplified trellis decoding; Block codes; Convolutional codes; Councils; Decoding; Error correction; Error correction codes; Performance loss; Redundancy; Throughput; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signals, Systems and Computers, 2004. Conference Record of the Thirty-Eighth Asilomar Conference on
Print_ISBN :
0-7803-8622-1
Type :
conf
DOI :
10.1109/ACSSC.2004.1399314
Filename :
1399314
Link To Document :
بازگشت