Look-ahead Sigma-Delta modulators look forward k samples before deciding to output a “one” or a “zero”. The Viterbi algorithm is then used to search the trellis of the exponential number of possibilities that such a procedure generates. This paper describes alternative tree based algorithms. Tree based algorithms are simpler to implement because they do not require backtracking to determine the correct output value. They can also be made more efficient using “Stack” algorithms. Both the tree algorithm and the more computationally efficient “Stack” algorithms are described. In particular, the effects of different error metrics on the performance of the “Stack” algorithm are described and the average number of moves required per bit discussed. The performance of the “Stack” algorithm is shown to be better than previously thought.
(See document for exact affiliation information.)
https://aes2.org/publications/elibrary-page/?id=14260
(1143KB)
Click to purchase paper as a non-member 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 Join the AES. If you need to check your member status, login to the Member Portal.
