Using the Viterbi decoding trellis graph approach to find the most effective investment path

Abstract

We propose to use the Viterbi's decoding trellis graph approach to find the most effective Radio Access Network (RAN) Evolution Path. By the most effective path we understand the cheapest sequence of sector's extensions which still fulfils the capacity requirements over the years. Cheapest means the lowest calculated Net Present Value of needed cash outflows, discounted with the assumed WACC - Weighted Average Costs of Capital over the assumed period of time. To find all possible paths in the trellis graph we also propose the use of the Deep First Search algorithm - DFS. DFS facilitates the analysis of the Transition Matrix, indicating the costs and possible transitions between particular states in available RAN Evolution Path. Transition Matrix is used to ease the introduction of the new RAN stages. The entire tool-set should help to automate the analysis of an increasing number of RAN extension options.