Skip to main content

Telecommunication-oriented FPGA and dedicated CAD system

  • Architectures
  • Conference paper
  • First Online:
Field-Programmable Logic and Applications (FPL 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 975))

Included in the following conference series:

Abstract

We developed a telecommunication-oriented LUT-based FPGA and its dedicated CAD system. The FPGA, called PROTEUS, has some unique features. For example, its logic block structure enables the user to easily realize the basic components used in telecommunication circuits such as binary counters and pattern matching circuits. In addition, PROTEUS has a lot of regularly-placed latches to accomplish pipelined data processing. With a logic synthesis system, the CAD system offers a top-down design methodology. The programming data downloaded into PROTEUS can be obtained directly from RTL language descriptions. Furthermore, the CAD system supports hardware-macro-based design to realize high performance circuits. In this paper, we introduce the PROTEUS FPGA architecture and CAD system. In addition, we show some experimental results proving that PROTEUS is applicable to real telecommunication circuits.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Stallings W., “Advances in ISDN and Broadband ISDN,” IEEE Computer Society Press, 1992.

    Google Scholar 

  2. Ohta N., Nakada H., Yamada K., Tsutsui A., and Miyazaki T., “PROTEUS: Programmable Hardware for Telecommunication Systems,” IEEE Proc. ICCD'94, pp. 178–183, October 1994.

    Google Scholar 

  3. Nakamura Y., Oguri K., Nagoya A., and Nomura R., “A Hierarchical Behavioral Description Based CAD System,” Proc. EURO ASIC, 1990.

    Google Scholar 

  4. Brown S.D., Francis R.J., Rose J. and Vranesic Z.G., “Field-Programmable Gate Arrays,” Kluwer Academic Publishers, 1992.

    Google Scholar 

  5. I-Cube, Inc., “The FPID Family Data Sheet,” April 1994.

    Google Scholar 

  6. Aptix Corporation, “Data Book,” February 1993.

    Google Scholar 

  7. Kirkoatrick S., Gelatt J.C.D., and Vecchi M., “Optimization by simulated annealing,” SCIENCE, Vol. 220, pp. 671–679, May 1983.

    Google Scholar 

  8. Ohta. N., Yamada K., Tsutsui A. and Nakada H., “New Application of FPGAs to Programmable Digital Communication Circuits,” Proc. FPL'92, September 1992.

    Google Scholar 

  9. Leiserson C.E., Rose F.M. and Saxe J.B., “Retiming Synchronous Circuitry,” Algorithmica, Vol.6, pp. 5–35, 1991.

    Google Scholar 

  10. Nakada H., Yamada K., Tsutsui A., and Ohta N., “A Design Method for Realising Real-time Circuits on Multiple-FPGA Systems,” in More FPGA, Moore W. R. and Luk W. eds. (Proc. FPL'93), pp.129–137, 1994.

    Google Scholar 

  11. Miyazaki T., Nakada H., Tsutsui T., Yamada K., and Ohta N., “A Speed-Up Technique for Synchronous Circuits Realized as LUT-Based FPGAs,” Proc. FPL'94, pp.89–98, September 1994.

    Google Scholar 

  12. Xilinx Inc., “The Field Programmable Gate Array Data Book,” 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Will Moore Wayne Luk

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miyazaki, T., Yamada, K., Tsutsui, A., Nakada, H., Ohta, N. (1995). Telecommunication-oriented FPGA and dedicated CAD system. In: Moore, W., Luk, W. (eds) Field-Programmable Logic and Applications. FPL 1995. Lecture Notes in Computer Science, vol 975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60294-1_98

Download citation

  • DOI: https://doi.org/10.1007/3-540-60294-1_98

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60294-1

  • Online ISBN: 978-3-540-44786-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics