A Comparison of the "Pruned-Tree" versus "Stack" Algorithms for Look-Ahead Sigma—Delta Modulators
The ultimate performance of high-order sigma–delta ( – ) modulators is limited in view of the stability considerations that arise because the fed back decision is delayed by one sample. This means that especially as one approaches overload, the filter states can “run away” from the correcting effect of the output bit stream and the modulator will become unstable, unless a conservative noise-shaping filter design is used. These problems can be resolved if the modulator can look ahead a number of samples before making any quantization decisions. Look-ahead – modulators look forward k samples before deciding to output a 1 or a 0. The Viterbi algorithm is then used to search the trellis of the exponential number of possibilities that such a procedure generates. Alternative tree-based algorithms are described, which are simpler to implement because they do not require backtracking to determine the correct output value. Both the “tree” algorithm and the more computationally efficient “pruned-tree” and “stack” algorithms are described. In particular, implementations of the appropriate data structures for both the trial filters and the score memories are described in some detail. Although the stack algorithm offers a theoretically better average efficiency, in practice, the additional overhead required by it, combined with a relaxed requirement for a guaranteed optimal path, result in the “pruned tree” being the most efficient.
Click to purchase paper or login as an AES member. If your company or school subscribes to the E-Library then switch to the institutional version. If you are not an AES member and would like to subscribe to the E-Library then Join the AES!
This paper costs $20 for non-members, $5 for AES members and is free for E-Library subscribers.