Network coding for routability improvement in VLSI

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2006, Pages 820-823

  Jayakumar, Nikhil ^a   Khatri, Sunil P ^a   Gulati, Kanupriya ^a   Sprintson, Alexander ^a  

^a Texas AandM University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE AREAS; ALGEBRAIC OPERATIONS; COMPUTER-AIDED DESIGN; DELAY PENALTY; INTERCONNECT POWER; INTERNATIONAL CONFERENCES; MULTICAST COMMUNICATIONS; MULTICAST CONNECTIONS; NETWORK CODING; NETWORK NODES; ROUTABILITY; ROUTING APPROACH; VLSI DESIGNS; WIRE AREA; WIRE LENGTHS;

DESIGN; MULTICASTING; ROUTERS; STANDARDS; WIRE;

PROGRAMMING THEORY;

EID: 46149094420     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2006.320126     Document Type: Conference Paper

References (16)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network Information Flow," IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204-1216, 2000.
2. C. Chekuri, C. Fragouli, and E. Soljanin, "On Average Throughput Benefits and Alphabet Size in Network Coding," IEEE Transactions on Information Theory, vol. 52, pp. 2410-2424, June 2006.
3. M. Charikar and A. Agarwal, "On the Advantage of Network Coding for Improving Network Throughput," in Proceedings of IEEE Information Theory Workshop, San Antonio, 2004.
4. "The International Technology Roadmap for Semiconductors." http://public.itrs.net/,2003.
5. H. Wang, A. Papanikolaou, M. Miranda, and F. Catthoor, "A Global Bus Power Optimization Methodology for Physical Design of Memory Dominated Systems by Coupling Bus Segmentation and Activity Driven Block Placement," in Proceedings, Asia and South Pacific Design Automation Conference (ASPDAC), pp. 759-761, Jan 2004.
6. M. Langberg, A. Sprintson, and J. Bruck, "The Encoding Complexity of Network Coding," IEEE Transactions on Information Theory, vol. 52(6), pp. 2386-2397, June 2006. (The joint special issue of the IEEE Transactions on Infonnation Theory and the IEEE/ACM Transactions on Networking and Information Theory).
7. M. Langberg, A. Sprintson, and J. Bruck, "Network Coding: A Computational Perspective," in The 40th Annual Conference on Information Sciences and Systems(CISS), March 2006. (Invited paper).
8. K. Bhattad, N. Ratnakar, R. Koetter, and K. Narayanan, "Minimal Network Coding for Multicast," in Proceedings of the IEEE International Symposium on Information Theory, pp. 1730-1734, September 2005.
9. D. Lun, M. Médard, T. Ho., and R. Koetter, "Network Coding with a Cost Criterion," in Proceedings of International Symposium on Information Theory and its Applications (ISITA 2004), October 2004.
10. C. Fragouli and E. Soljanin, "Information Flow Decomposition for Network Coding," IEEE Transactions on Information Theory, vol. 52, pp. 829-848, March 2006.
11. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial Time Algorithms for Multicast Network Code Construction," IEEE Transactions on Information Theory, vol. 51, pp. 1973-1982, June 2005.
12. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear Network Coding," IEEE Transactions on Information Theory, vol. 49, no. 2, pp. 371-381, 2003.
13. R. Koetter and M. Medard, "An Algebraic Approach to Network Coding," IEEE/ACM Transactions on Networking, vol. 11, no. 5, pp. 782-795, 2003.
14. T. Ho, R. Koetter, M. Medard, D. Karger, and M. Effros, "The Benefits of Coding over Routing in a Randomized Setting," in Proceedings of the IEEE International Symposium on Information Theory, 2003.
15. K. Menger, "Zur allgemeinen Kurventheorie," Fund. Math, vol. 10, pp. 95-115, 1927.
16. Y Cao, T. Sato, D. Sylvester, M. Orshansky, and C. Hu, "New Paradigm of Predictive MOSFET and Interconnect Modeling for Early Circuit Design," in Proc. of IEEE Custom Integrated Circuit Conference, pp. 201-204, Jun 2000. http://www-device.eecs.berkeley.edu/ptm.