A new bit reversal algorithm

@article{Walker1990ANB,
  title={A new bit reversal algorithm},
  author={James S. Walker},
  journal={IEEE Trans. Acoustics, Speech, and Signal Processing},
  year={1990},
  volume={38},
  pages={1472-1473}
}
This correspondence describes a new bit reversal permutation algorithm. Such algorithms are needed for radix 2 (or radix B ) fast Fourier transforms (FFT) or fast Hartley transforms (FHT). This algorithm is an alternative to one described by Evans. A BASIC version of this algorithm ran slightly faster than the BASIC version of Evans’ algorithm given in Bracewell’s book, with some time savings for odd powers of 2. This new algorithm also allows for precomputation of seed tables up to one higher… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS
11 Citations
2 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Conversion of FFT's to fast Hartley transforms,

  • 0. Buneman
  • SlAM J . Sei. Srat. Comput.
  • 1986

Similar Papers

Loading similar papers…