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.
Authors:
Websdell, Peter C.; Angus, Jamie A.
Affiliation:
School of Computing, Science and Engineering, University of Salford
AES Convention:
123 (October 2007)
Paper Number:
7202
Publication Date:
October 1, 2007
Subject:
Signal Processing
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.
To be notified of new comments on this paper you can subscribe to this RSS feed. Forum users should login to see additional options.
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.