Integer linear programming method for spatial temporal mapping of the Viterbi decoder

Array processors are gaining importance as fabrication technology scales down. Thus a simple and systematic method to implement algorithms in array architectures is desirable. In this paper a general integer linear program (ILP) is formulated to minimize computation time and interconnection length. The ILP is solved with various constraints on the parallel computation time and interconnect space. Different cost functions as desired by the designer can be added to the optimization process. Viterbi decoder is considered as a case study. Optimum array architecture is obtained using the proposed ILP