This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References and Suggested Reading
Bentley, J. L., and H. T. Kung, “A Tree Machine for Searching Problems,” Proc. Int. Conf. Parallel Processing, pp. 257–266, 1979.
Kwai, D.-M., and B. Parhami, “FFT Computation with Linear Processor Arrays Using a Data-Driven Control Scheme,” J. VLSI Signal Processing, Vol. 13, pp. 57–66, 1996.
Lakshmivarahan, S., and S.K. Dhall, Parallel Computing Using the Prefix Problem, Oxford University Press, 1994.
Leighton, F. T., Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, 1992.
Narayanan, T. S., “A Class of Semi-X Tree-Based Dictionary Machines,” The Computer J., Vol. 39, No. 1, pp. 45–51, 1996.
Parhami, B., “Massively Parallel Search Processors: History and Modern Trends,” Proc. 4th Int. Parallel Processing Symp., pp. 91–104, 1990.
Sugla, B., and D A. Carlson, “Extreme Area-Time Tradeoffs in VLSI,” IEEE Trans. Computers, Vol. 39, No. 2, pp. 251–257, February 1990.
Yeh, C.-H., and B. Parhami, “A Class of Parallel Architectures for Fast Fourier Transform,” Proc. 39th Midwest Symp. Circuits and Systems, 1996, pp. 856–859.
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
(2002). Other Circuit-Level Examples. In: Introduction to Parallel Processing. Series in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/0-306-46964-2_8
Download citation
DOI: https://doi.org/10.1007/0-306-46964-2_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-306-45970-2
Online ISBN: 978-0-306-46964-0
eBook Packages: Springer Book Archive