Dual-dimensional parallelisation for the Viterbi algorithm is exploited. That is, parallelisation of the decoding procedures within each stage of the trellis and parallelisation of the decoding procedures are expanded to consecutive stages without excessive path memories. Since an arbitrary number of stages can be parallelised, the trade-off between computation speed and degree of integration can be adjusted as required.
- Codes and coding
- Parallel processing