DocumentCode
2909852
Title
Scalable architectures for high speed channel decoding
Author
Dawid, Herbert ; Meyr, Heinrich
Author_Institution
Integrated Syst. for Signal Process., Aachen Univ. of Technol., Germany
fYear
1994
fDate
1994
Firstpage
226
Lastpage
235
Abstract
At present, channel decoding and soft output channel decoding of convolutional codes are key technologies for advanced communication systems. The speed of any implementation of the corresponding decoding algorithms, the Viterbi algorithm (VA) and the soft output VA (SOVA) is limited by an inherent nonlinear recursion. In contrast this paper deals with scalable architectures for purely feedforward decoding algorithms, the “minimized method” parallelized Viterbi decoding algorithm and the parallel MAP (Maximum A Posteriori) soft output decoding algorithm. A unified treatment is possible since these algorithms and the corresponding dependence graphs (DGs) are very similar. In order to obtain a scalable throughput adapted to a given specification, a hierarchical resource sharing methodology exploiting the inherent DG regularity is proposed and implemented as a VHDL generator
Keywords
Viterbi decoding; VHDL generator; communication systems; dependence graphs; feedforward algorithms; hierarchical resource sharing methodology; high speed channel decoding; minimized method parallelized Viterbi decoding; parallel Maximum A Posteriori soft output decoding; scalable architectures; Convolutional codes; Decoding; Logic; Quantization; Resource management; Shift registers; Signal processing algorithms; Throughput; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
VLSI Signal Processing, VII, 1994., [Workshop on]
Conference_Location
La Jolla, CA
Print_ISBN
0-7803-2123-5
Type
conf
DOI
10.1109/VLSISP.1994.574747
Filename
574747
Link To Document