Title :
Low latency sequential decoding
Author :
Pottie, Gregory J.
Author_Institution :
Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA
fDate :
29 Jun-4 Jul 1997
Abstract :
Sequential decoding has traditionally been considered for applications where large buffers are permitted, but the speed factor is low. However, there is a need for coding techniques which achieve relatively large gain (on the order of 6 dB) with relatively low latency (a few hundred symbols). While the very name suggests serial operations, sequential decoders have potential for high speed and efficient parallel decoding operations. We consider the desirable algorithmic features for high speed factor operations using the stack and Fano algorithm families as the point of reference
Keywords :
buffer storage; computational complexity; probability; search problems; sequential decoding; Fano algorithm; algorithmic features; buffers; computational complexity; high speed decoding operations; large coding gain; low latency sequential decoding; memory management; parallel decoding; path loss probability; search problems; sequential decoders; serial operations; stack algorithm; Buffer overflow; Computational complexity; Costs; Decoding; Delay effects; Error analysis; Memory management; Modulation coding; Sorting; Very large scale integration;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613436