Concentrator access networks for programmable logic cores on SoCs

Proceedings - IEEE International Symposium on Circuits and Systems

Volumn , Issue , 2005, Pages 45-48

  Quinton, Bradley R ^a   Wilton, Steven J E ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS NETWORK; INPUT/OUTPUT; LOWER COST; NEW CONSTRUCTION; PERMUTATION NETWORK; PROGRAMMABLE LOGIC CORES;

COSTS;

CONCENTRATION (PROCESS);

EID: 33846647012     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCAS.2005.1464520     Document Type: Conference Paper

References (15)

1. S.J.E. Wilton and R. Saleh, "Progammable Logic IP Cores in SoC Design: Opportunities and Challenges", Proc. IEEE Custom IC Conf., San Diego, CA, pp. 63-66, May 2001.
2. P. Zuchowski, et al., "A Hybrid ASIC and FPGA Architecture", Proc. IEEE/ACM Inter. Conf. on Computer-Aided Design, pp. 187-194, 2002.
3. V. Raghunathan, et al., "A Survey of Techniques for Energy Efficient On-Chip Communication", Proc. of Design Automation Conference, pp. 900-905, June 2003.
4. V. E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic, Academic, New York, 1965.
5. F. K. Hwang, The Mathematical Theory of Nonblocking Switching Networks, World Scientific, New Jersey, 1998.
6. M. S. Pinsker, "On the complexity of a concentrator," in Proc. 7th Int. Teletraffic Congr. Stockholm, Sweden, pp. 318/1-318/4, 1973.
7. F. R. K. Chung, "On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks," Bell Sys. Tech. J., Vol. 58, No. 8, pp. 1765-1777, 1978.
8. C. E. Shannon, "Memory requirements in a telephone exchange," Bell Sys. Tech J., pp. 343-349, 1950.
9. G. A. Margulis, "Explicit constructions of concentrators", Probl. Inform. Transm., vol. 9, no. 4, pp. 325-332, 1973.
10. O. Gabber and Z. Galil, "Explicit constructions of linear sized super-concentrators", J. Comput. Syst. Sci., pp. 407-420, 1981.
11. N. Alon, Z. Galil, and V. D. Milman, "Better Expanders and Superconcentrators", J. Algorth., vol. 8, pp 337-347, 1987.
12. S. Nakamura and G. M. Masson, "Lower bounds on crosspoints in concentrators", IEEE Trans. Comput., vol. C-31, pp. 1173-1178, 1982.
13. A. Y. Oruc, and H. M. Huang, "Crosspoint Complexity of Sparse Crossbar Concentrators", IEEE Trans. on Information Theory, vol. 42, no. 5, pp. 1466-1471, Sept. 1996.
14. M. V. Chien and A. Y. Oruc, "High performance concentrators and superconcentrators using multiplexing schemes," IEEE Trans. Communication, vol. 42, no. 11, pp. 3045-3051, Nov.1994.
15. M. J. Narasimha, "A Recursive Concentrator Structure with Applications to Self-Routing Switching Networks", IEEE Trans. on Communication, vol. 42, no. 2/3/4, pp. 896-897, April 1994.