General in-place scheduling for the Viterbi algorithm

  • Authors:

  • H.-D. Lin;C. B. Shung

  • Affiliations:

  • Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA;Texas Instrum. Inc., Houston, TX, USA

  • Venue:
  • ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is shown how to find in-place schedules for all kinds of trellises, including periodic and aperiodic in-place schedules. It is also shown how to verify the existence of aperiodic and periodic in-place schedules. With this in-place scheduling, one can improve data locality and thus reduce interprocessor communication bandwidths. This means a smaller overhead in chip routing area or communication cycles. The methods also apply to general parallel processing with trellis-like computational graphs.