Trellis Noise-Shaping Sigma-Delta modulators look forward at k samples of the signal 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. Means of making the search more computationally efficient have been proposed. This paper describes alternative tree based algorithms that can also be used search the exponential number possibilities generated by lookahead noise-shaping S-D modulators. Tree based algorithms are simpler to implement because they do not require backtracking through an array of scores to determine the correct output value. They can also be made more efficient via the use of the `Fano` or `Stack` algorithms, which are described.
(See document for exact affiliation information.)
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.
