A Comparison of the Performance of “Pruned Tree” Versus “Stack” Algorithms for Look-Ahead Sigma Delta Modulators

Angus JAS. A Comparison of the Performance of “Pruned Tree” Versus “Stack” Algorithms for Look-Ahead Sigma Delta Modulators. In: AES Convention 119. Audio Engineering Society; 2005. Paper 6562. Available from: https://aes.org/publications/elibrary-page/?id=13357

@inproceedings{Angus2005_13357,
  author = {Angus, Jamie A. S.},
  title = {{A Comparison of the Performance of “Pruned Tree” Versus “Stack” Algorithms for Look-Ahead Sigma Delta Modulators}},
  booktitle = {AES Convention 119},
  note = {Paper 6562},
  year = {2005},
  month = oct,
  publisher = {Audio Engineering Society},
  url = {https://aes.org/publications/elibrary-page/?id=13357}
}

TY  - CPAPER
TI  - A Comparison of the Performance of “Pruned Tree” Versus “Stack” Algorithms for Look-Ahead Sigma Delta Modulators
AU  - Angus, Jamie A. S.
T2  - AES Convention 119
M1  - Paper 6562
PY  - 2005
DA  - 2005/10/06
UR  - https://aes.org/publications/elibrary-page/?id=13357
PB  - Audio Engineering Society
LA  - en
AB  - 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. Implementations of both algorithms are described in some detail. In particular, the appropriate data structures for both the trial filters and score memories. Comparative results of their performance are also presented.
ER  -