Network coding for routability improvement in VLSI

Authors:
Nikhil Jayakumar;Sunil P Khatri;Kanupriya Gulati;Alexander Sprintson
Affiliations:
Texas A&M University, College Station, TX;Texas A&M University, College Station, TX;Texas A&M University, College Station, TX;Texas A&M University, College Station, TX
Venue:
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Year:
2006

Citing 8
Cited 5

An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
A global bus power optimization methodology for physical design of memory dominated systems by coupling bus segmentation and activity driven block placement

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
The encoding complexity of network coding

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On average throughput and alphabet size in network coding

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction

IEEE Transactions on Information Theory
Information flow decomposition for network coding

IEEE Transactions on Information Theory

Network coding applications

Foundations and Trends® in Networking
Improving FPGA routability using network coding

Proceedings of the 18th ACM Great Lakes symposium on VLSI
The promise of network coding

ICUFN'09 Proceedings of the first international conference on Ubiquitous and future networks
On-chip bidirectional wiring for heavily pipelined systems using network coding

ICCD'09 Proceedings of the 2009 IEEE international conference on Computer design
Efficient congestion mitigation using congestion-aware steiner trees and network coding topologies

VLSI Design - Special issue on CAD for Gigascale SoC Design and Verification Solutions

Quantified Score

Hi-index	0.01

Visualization

Abstract

With the standard approach for establishing multicast connections over a network, network nodes are utilized to forward and duplicate the packets received over the incoming links. Recently, there has been a significant interest in a novel paradigm of network coding. Network coding generalizes the traditional routing approach by allowing the network nodes to generate new packets by performing algebraic operations on packets received over the incoming links. It has been shown that network coding can increase the throughput of multicast communication. In this paper, we explore the benefits of network coding for improving the routing characteristics of VLSI designs. We demonstrate that when data has to be routed across the IC, it is often beneficial to perform network coding. Initial results demonstrate that network coding can result in a healthy reduction in wire length, wire area, interconnect power as well as the active area associated with the interconnects. This comes at a small delay penalty.