Citation
Abstract
An algorithm is presented for generating an m-ary summation tree. The algorithm is completely general and may be applied to any length input string. For an N length sequence summed in groups of mg at each level 2, a maximum of 3L ~ 2 storage is required where A special case of the general m-ary tree where all mg are equal will be used to smooth data in a radio-frequency interference experiment. The maximum storage required when Mg =m for all £ reduces to the closed form 3 log,,N - 2. m3; = 2.
Details
- Volume
- 42-45
- Published
- June 15, 1978
- Pages
- 147–151
- File Size
- 311.0 KB