Skip to main content

Design of regular arrays

  • Chapter
Design of Logic Systems
  • 175 Accesses

Abstract

One of the underlying principles of engineering design is that we should attempt to reduce the complexity (and hence cost) of our designs by identifying and constructing subsystems which can then be repeated or replicated to form the complete system. In the context of digital systems we have already seen several examples of the application of this principle, including both combinational and sequential circuits, for example, ripple-carry adders, cascadable magnitude comparators, ripple countries, and shift registers. In all such cases, the regular iterative (or ‘repeating’) nature of the circuit refers to the structure, consisting of a number of identical subcircuits (‘cells’, or ‘modules’) linked to form an array which performs the overall function.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References and Bibliography

  1. Kohavi, Z. (1978) Switching and Finite Automata Theory,McGraw-Hill.

    Google Scholar 

  2. Shannon, C.E. (1938) A symbolic analysis of relay and switching circuits. Trans. Am. Inst. Elect. Engrs., 57, 713–23.

    Article  Google Scholar 

  3. Caldwell, S. (1959) Switching Circuits and Logical Design,Wiley.

    Google Scholar 

  4. McCluskey, E.J. (1956) Algebraic minimisation and the design of two-terminal networks. PhD Thesis Dept. Elec. Eng., MIT.

    Google Scholar 

  5. Marcus, M.P. (1956) The detection and identification of symetric switching functions and the use of tables of combination. IRE Trans. Elect. Comp., EC5(4), 237–9.

    Google Scholar 

  6. Mead, C. and Conway, L. (1980) Introduction to VLSI Systems,Addison-Wesley.

    Google Scholar 

  7. Short, R.A. (1965) Two-rail cellular arrays, in AFIPS Conf. Proc., Pt. 1, pp. 355–69.

    Google Scholar 

  8. Akers, S.B. (1972) A rectangular logic array. IEEE Trans. Comp., C21, 848–57.

    Google Scholar 

  9. Guild, H.H. (1969) Fast decimal-binary conversion. Electron. Lett., 5 (8), 16.

    Google Scholar 

  10. Dean, K.J. (1968) Design for a full multiplier. Proc. IEE, 115, 1592–4.

    Google Scholar 

  11. Guild, H.H. (1970) Some cellular logic arrays for non-restoring binary division. The Radio and Electr. Engr., 39 (6), 345–8.

    Google Scholar 

  12. Dean, K.J. (1968) Cellular logical array for extracting square roots. Electron. Lett., 4 (4), 314–5.

    Google Scholar 

  13. White, G. (1970) Generalised cell for use in iterative and near-iterative arithmetic arrays. Electron. Lett., 6 (9), 270–1.

    Google Scholar 

  14. Hennessy, J.L. and Patterson, D.A. (1990) Computer Architecture: A Quantitative Approach,Morgan Kaufman.

    Google Scholar 

  15. Pekmestzi, K.Z. and Papadopoulos, G.D. (1979) Cellular twos-complement serial pipeline multipliers. The Radio and Electron. Engr., 49 (11), 575–80.

    Google Scholar 

  16. Fortes, J.A. and Wah, B.W. (1987) Systolic arrays–From concept to implementation. IEEE Computer, July, 12–7.

    Google Scholar 

  17. Ullman, J.D. (1984) Computational Aspects of VLSI,Computer Science Press.

    Google Scholar 

  18. Zobrist, G.W. (1990) Progress in Computer-Aided VLSI Design,Vol. 3, Ablex Publishing.

    Google Scholar 

  19. Sinha, B.P. and Srimani, P.K. (1989) Fast parallel algorithms for binary multiplication and their implementation on systolic architectures. IEEE Trans. Comp., C38 (3), 424–33.

    Google Scholar 

  20. Rao, S.K. and Kailath, T. (1988) Regular iterative algorithms and their implementation on processor arrays. Proc. IEEE, 76 (3), 259–70.

    Google Scholar 

  21. Bu, J. (1990) Systematic Design of Regular VLSI Processor Arrays,Delft University Press.

    Google Scholar 

  22. Kung, H.T. (1982) Why systolic architectures? IEEE Computer, Jan., 37–49.

    Google Scholar 

  23. Moldovan, D.I. and Fortes, J.A. (1986) Partitioning and mapping algorithms into fixed size systolic arrays. IEEE Trans. Comp., C35 (1), 1–12.

    Google Scholar 

  24. Kung, S.Y. et al. (1987) Wavefront array processors–Concept to implementation. IEEE Computer, July 18–36.

    Google Scholar 

  25. Annaratone, M. et al. (1987) The Warp computer: architecture, implementation and performance. IEEE Trans. Comp.,C36 (12) 1523–35.

    Google Scholar 

  26. Almasi, G.S. and Gottlieb, A. (1989) Highly Parallel Computing,Benjamin Cummings.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1992 D. Lewin and D. Protheroe

About this chapter

Cite this chapter

Lewin, D., Protheroe, D. (1992). Design of regular arrays. In: Design of Logic Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-6856-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-6856-2_9

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-412-42890-6

  • Online ISBN: 978-1-4899-6856-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics