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.

Author: Angus, James A.
Affiliation: Acoustics Research Centre, University of Salford, Salford, Greater Manchester, England
AES Convention: 115 (October 2003) Paper Number: 5950
Publication Date: October 1, 2003
Subject: Signal Processing for Audio

Click to purchase paper as a non-member or you can login as an AES member to see more options.

No AES members have commented on this paper yet.

Subscribe to this discussion

To be notified of new comments on this paper you can subscribe to this RSS feed. Forum users should login to see additional options.

Start a discussion!

If you would like to start a discussion about this paper and are an AES member then you can login here:
Username:
Password:

If you are not yet an AES member and have something important to say about this paper then we urge you to join the AES today and make your voice heard. You can join online today by clicking here.